1 / 8

Concurrent Algorithms: research directions

Concurrent Algorithms: research directions. Danny Hendler. Moore’s law Exponential growth in computing power. The Future of Computing. Speeding up uni-processors is harder and harder Intel, Sun (RIP), AMD, IBM now focusing on “multi-core” architectures

beaumont-dilan
Download Presentation

Concurrent Algorithms: research directions

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Concurrent Algorithms: research directions Danny Hendler

  2. Moore’s lawExponential growth in computing power

  3. The Future of Computing • Speeding up uni-processors is harder and harder • Intel, Sun (RIP), AMD, IBM now focusing on “multi-core” architectures • Already, most computers are multiprocessors How can we write correct and efficient algorithms for multiprocessors?

  4. Research directions: practical • Devising efficient implementations of transactional memory • Includes incorporating OS kernel support • Devising efficient and scalable lock-based and non-blocking data structures • Some find their way to Java libraries • Devising algorithms that use few barrier instructions • ...

  5. Research directions: theoretical • Lower bounds and impossibility results on deterministic and randomized mutual exclusion • Lower bounds and impossibility results on concurrent data-structures' (counters, stacks, queues, ...) complexity according to various metrics. • Formulating novel realistic metrics for concurrent algorithms and corresponding upper/lower bounds

  6. A riddle to give you the flavour of problems • Each processor has a constant number of bits • A single processor receives a START signal • Processes operate synchronously and communicate by sending messages • All processes should raise a flag simultaneously… Enjoy.

More Related