19. SPAA 2007: San Diego, CA, USA
Phillip B. Gibbons, Christian Scheideler (Eds.): SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007. ACM 2007 ISBN 978-1-59593-667-7
Network theory
- Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker: Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier. 1-7
- Robert Krauthgamer: On triangulation of simple networks. 8-15
- Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder: Strong-diameter decompositions of minor free graphs. 16-24
Scheduling
- Guolong Lin, Rajmohan Rajaraman: Approximation algorithms for multiprocessor scheduling under uncertainty. 25-34
- Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam: Scheduling to minimize gaps and power consumption. 46-54
Brief announcements I: parallel and multicore systems
- Arun Kumar, Naresh Jayam, Ashok Srinivasan, Ganapathy Senthilkumar, Pallav K. Baruah, Shakti Kapoor, Murali Krishna, Raghunath Sharma: Feasibility study of MPI implementation on the heterogeneous multi-core cell BETM architecture. 55-56
- Srinivas Sridharan, Arun Rodrigues, Peter M. Kogge: Evaluating synchronization techniques for light-weight multithreaded/multicore architectures. 57-58
- Woongki Baek, JaeWoong Chung, Chi Cao Minh, Christos Kozyrakis, Kunle Olukotun: Towards soft optimization techniques for parallel cognitive applications. 59-60
Cache-oblivious/cache-aware algorithms
- Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari: Optimal sparse matrix dense vector multiplication in the I/O-model. 61-70
- Rezaul Alam Chowdhury, Vijaya Ramachandran: The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation. 71-80
- Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson: Cache-oblivious streaming B-trees. 81-92
- Kamen Yotov, Thomas Roeder, Keshav Pingali, John A. Gunnels, Fred G. Gustavson: An experimental comparison of cache-oblivious and cache-conscious programs. 93-104
Multicore architectures and algorithms
- Shimin Chen, Phillip B. Gibbons, Michael Kozuch, Vasileios Liaskovitis, Anastassia Ailamaki, Guy E. Blelloch, Babak Falsafi, Limor Fix, Nikos Hardavellas, Todd C. Mowry, Chris Wilkerson: Scheduling threads for constructive cache sharing on CMPs. 105-115
- Ernie Chan, Enrique S. Quintana-Ortí, Gregorio Quintana-Ortí, Robert A. van de Geijn: Supermatrix out-of-order scheduling of matrix operations for SMP and multi-core architectures. 116-125
- Jeffery A. Brown, Rakesh Kumar, Dean M. Tullsen: Proximity-aware directory-based coherence for multi-core processor architectures. 126-134
- Guangming Tan, Ninghui Sun, Guang R. Gao: A parallel dynamic programming algorithm on a multi-core architecture. 135-144
Distributed network algorithms
Packing, coloring and load balancing
- Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar: Packing to angles and sectors. 171-180
- Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, Saurabh Ray: Conflict-free coloring for rectangle ranges using O(n.382) colors. 181-187
- Udi Wieder: Balanced allocations with heterogenous bins. 188-193
Brief announcements II: diverse algorithms
- Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky: Weakening the online adversary just enough to get optimal conflict-free colorings for intervals. 194-195
- Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia: On the truthfulness and the approximation for scheduling selfish tasks. 196-197
Concurrent programming
- Michel Raynal, Gadi Taubenfeld: The notion of a timed register and its application to indulgent synchronization. 200-209
- Michael F. Spear, Arrvindh Shriraman, Luke Dalessandro, Sandhya Dwarkadas, Michael L. Scott: Nonblocking transactions without indirection using alert-on-update. 210-220
- Torvald Riegel, Christof Fetzer, Pascal Felber: Time-based transactional memory with scalable time bases. 221-228
- Shivali Agarwal, Rajkishore Barik, Dan Bonachea, Vivek Sarkar, R. K. Shyamasundar, Katherine A. Yelick: Deadlock-free scheduling of X10 computations with bounded resources. 229-240
Algorithms for wireless networks
- Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang: Online frequency allocation in cellular networks. 241-249
- Petra Berenbrink, Colin Cooper, Zengjian Hu: Energy efficient randomised communication in unknown AdHoc networks. 250-259
- Miroslaw Dynia, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, Jonas Schrieb: Local strategies for maintaining a chain of relay stations between an explorer and a base station. 260-269
Latency and makespan
- John R. Douceur, Jay R. Lorch, Thomas Moscibroda: Maximizing total upload in latency-sensitive P2P applications. 270-279
- Jack Dongarra, Emmanuel Jeannot, Erik Saule, Zhiao Shi: Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems. 280-288
Brief announcements III: parallel computing
- Bradley C. Kuszmaul: Cilk provides the "best overall productivity" for high performance computing: (and won the HPC challenge award to prove it). 299-300
Online algorithms and games
- Adi Rosén, Gabriel Scalosub: Rate vs. buffer size: greedy information gathering on the line. 305-314
- Baruch Awerbuch, Thomas P. Hayes: Online collaborative filtering with nearly optimal dynamic regret. 315-319
- Yossi Azar, Iftah Gamzu, Shai Gutner: Truthful unsplittable flow for large capacity networks. 320-329
- Angelo Fanelli, Michele Flammini, Luca Moscardelli: On the convergence of multicast games in directed networks. 330-338
Algorithms and architectures
- Timothy Furtak, José Nelson Amaral, Robert Niewiadomski: Using SIMD registers and instructions to enable instruction-level parallelism in sorting algorithms. 348-357
- Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe: A tight bound on online buffer management for two-port shared-memory switches. 358-364
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team