Abstract
Leader election is a frequent problem for systems where it is important to coordinate activities of a group of actors. It has been extensively studied in the context of networked systems. But with the raise of many-core computer architectures, it also became important for shared-memory systems.
In this paper we present an efficient leader election technique for synchronous shared-memory systems. Synchronous in our context means the response time of code sections with relevant communication patterns is bounded. Our leader election method is used to help making the scheduling layer LPEL fault tolerant.With our approach LPEL will be efficient to resolve problems when the leader fails.
In this paper we present an efficient leader election technique for synchronous shared-memory systems. Synchronous in our context means the response time of code sections with relevant communication patterns is bounded. Our leader election method is used to help making the scheduling layer LPEL fault tolerant.With our approach LPEL will be efficient to resolve problems when the leader fails.
| Original language | English |
|---|---|
| Title of host publication | Proc. Int'l Workshop on Performance, Power and Predictability of Many-Core Embedded Systems (3PMCES'14) |
| Place of Publication | Dresden, Germany |
| Publisher | Electronic Chips and Systems Design Initiative ECSI |
| Number of pages | 5 |
| Publication status | Published - Mar 2014 |
Keywords
- fault tolerance
- leader election
- parallel computing
- shared memory