- Home
- Register
- Attend
- Program
- Technical Program Overview
- SC14 Schedule
- Awards
- Birds-of-a-Feather Sessions (BOFs)
- Emerging Technologies
- Invited Talks
- Panels
- Papers
- Posters
- Scientific Visualization Showcase
- Tutorials
- Workshops
- Doctoral Showcase Program
- HPC Matters Plenary
- Keynote
- SC14 Archive
- SC14 Conference Program
- Tech Program Receptions
- Exhibit
- Engage
- Media
- Media Overview
- Media Releases
- Announcing the Second Test of Time Award Winner
- CDC to Present at Supercomputing 2014
- Finalists Compete for Coveted ACM Gordon Bell Prize in High Performance Computing
- Four Ways Supercomputing Is Changing Lives: From Climate Modeling to Manufacturing Consumer Goods
- Join the Student Cluster Competition
- New Orleans Becomes Home to Fastest Internet Hub in the World
- SC14 Announces New Plenary to Focus on the Importance of Supercomputers in Society
- SC14 Registration Opens, Technical Program Goes Live
- Supercomputing 2014 Recognizes Outstanding Achievements in HPC
- Supercomputing 2014 Sets New Records
- Supercomputing Invited Plenary Talks
- Supercomputing Unveils Ground-Breaking Innovations and the World’s Fastest Computer Network
- World’s Fastest Computer Network Coming to New Orleans
- SC14 Logo Usage
- SC14 Media Partners
- Social Media
- Newsletters
- SC14 Blog
- Opening Press Briefing
- SC Photograph and Film Acceptable Use Policy
- Media Registration
- Video Gallery
- SCinet
SCHEDULE: NOV 16-21, 2014
When viewing the Technical Program schedule, on the far righthand side is a column labeled "PLANNER." Use this planner to build your own schedule. Once you select an event and want to add it to your personal schedule, just click on the calendar icon of your choice (outlook calendar, ical calendar or google calendar) and that event will be stored there. As you select events in this manner, you will have your own schedule to guide you through the week.
Fast Parallel Computation of Longest Common Prefixes
SESSION: Parallel Algorithms
EVENT TYPE: Papers
TIME: 4:30PM - 5:00PM
SESSION CHAIR: Judith C. Hill
AUTHOR(S):Julian Shun
ROOM:391-92
ABSTRACT:
Suffix arrays and the corresponding longest common prefix (LCP) array
have wide applications in bioinformatics, information retrieval and
data compression. In this work, we propose and theoretically analyze
new parallel algorithms for computing the LCP array given the suffix
array as input. Most of our algorithms have a work and depth
(parallel time) complexity related to the LCP values of the input. We
also present a slight variation of Karkkainen and Sanders'
skew algorithm that requires linear work and poly-logarithmic depth in
the worst case. We present a comprehensive experimental study of our
parallel algorithms along with existing parallel and sequential LCP
algorithms. On a variety of real-world and artificial strings, we
show that on a 40-core shared-memory machine our fastest algorithm is
up to 2.3 times faster than the fastest existing parallel algorithm,
and up to 21.8 times faster than the fastest sequential LCP algorithm.
Chair/Author Details:
Judith C. Hill (Chair) - Oak Ridge National Laboratory
Julian Shun - Carnegie Mellon University
Click here to download .ics calendar file
Click here to download .vcs calendar file
Click here to add event to your Google Calendar