1 option
31st ACM Symposium on Parallelism in Algorithms and Architectures / Christian Scheideler, Petra Berenbrink, editors.
- Format:
- Book
- Series:
- ACM international conference proceedings series.
- ACM international conference proceedings series
- Language:
- English
- Subjects (All):
- Computer algorithms--Congresses.
- Computer algorithms.
- Computer architecture--Congresses.
- Computer architecture.
- Parallel processing (Electronic computers)--Congresses.
- Parallel processing (Electronic computers).
- Physical Description:
- 1 online resource (410 pages) : illustrations.
- Other Title:
- SPAA '19
- Place of Publication:
- New York, NY : Association for Computing Machinery, 2019.
- Summary:
- It is our great pleasure to welcome you to the 31st ACM Symposium on Parallelism in Algorithms and Architectures - SPAA 2019. The goal of SPAA is to develop a deeper understanding of parallelism in all its forms, bringing together the theory and practice of parallel computing. These days the applications for parallel computing include all areas of information technology; desktops, notebook systems and smart phones have CPUs which are equipped with multiple cores. An understanding of parallel computing is becoming essential knowledge for every IT professional. Over the last several years, the study of parallelism has expanded into new areas, including new models of parallel computation, new techniques for managing parallelism, and new types of parallel systems. These increasingly important topics are also represented at SPAA this year. This year, the call for papers attracted 109 submissions. The program committee accepted 34 as regular papers (an acceptance rate of only 35%) and 11 as brief announcements. The keynote talk is given by Guy Even, Tel-Aviv University, Israel. The best paper award for SPAA 2017 is awarded to: Faith Ellen, Barun Gorain, Avery Miller and Andrej Pelc: Constant-Length Labeling Schemes for Deterministic Radio Broadcast. The authors consider broadcast in radio networks, modeled as simple undirected connected graphs with a designated source. The nodes communicate in synchronous rounds and a node receives a message from a neighbor only if the neighbor is the only one that transmits in the round. It is well known that deterministic broadcast is impossible if nodes of the network do not have any labels. On the other hand, if all nodes have distinct labels, then broadcast can be carried out trivially in a round-robin fashion. The authors ask the natural question if very short labels are sufficient for broadcast. They show that every radio network can be labeled with 2 bits in such a way that broadcast can be accomplished by some universal deterministic algorithm that does not know the network topology nor any bound on its size.
- Notes:
- Description based on publisher supplied metadata and other sources.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.