[ACM Press the 22nd ACM symposium - Thira, Santorini, Greece (2010.06.13-2010.06.15)] Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA '10 - New algorithms for efficient parallel string comparison

[ACM Press the 22nd ACM symposium - Thir

[ACM Press the 22nd ACM symposium - Thira, Santorini, Greece (2010.06.13-2010.06.15)] Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA '10 - A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)

✍ Leiserson, Charles E.; Schardl, Tao B. 📂 Article 📅 2010 🏛 ACM Press ⚖ 830 KB

[ACM Press the 22nd ACM symposium - Thir

[ACM Press the 22nd ACM symposium - Thira, Santorini, Greece (2010.06.13-2010.06.15)] Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA '10 - A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)

✍ Leiserson, Charles E.; Schardl, Tao B. 📂 Article 📅 2010 🏛 ACM Press 🌐 English ⚖ 830 KB

We have developed a multithreaded implementation of breadth-first search (BFS) of a sparse graph using the Cilk++ extensions to C++. Our PBFS program on a single processor runs as quickly as a standard C++ breadth-first search implementation. PBFS achieves high work-efficiency by using a novel imple

[ACM Press the sixth annual ACM symposiu

[ACM Press the sixth annual ACM symposium - Cape May, New Jersey, United States (1994.06.27-1994.06.29)] Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures - SPAA '94 - A comparison of parallel algorithms for connected components

✍ Greiner, John 📂 Article 📅 1994 🏛 ACM Press ⚖ 860 KB

[ACM Press the fourteenth annual ACM sym

[ACM Press the fourteenth annual ACM symposium - Winnipeg, Manitoba, Canada (2002.08.10-2002.08.13)] Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '02 - Algorithms for fault-tolerant routing in circuit switched networks

✍ Bagchi, Amitabha; Chaudhary, Amitabh; Scheideler, Christian; Kolman, Petr 📂 Article 📅 2002 🏛 ACM Press 🌐 English ⚖ 250 KB

Sponsored By Acm Sigact [and] Acm Sigarch In Cooperation With Eatcs. Acm Order Number: 417020--t.p. Verso. Includes Bibliographical References And Author Index. Also Available On The World Wide Web Via Acm Digital Library With Title: Proceedings Of The Fourteenth Annual Acm Symposium On Parallel Alg

[ACM Press the eighteenth annual ACM sym

[ACM Press the eighteenth annual ACM symposium - Cambridge, Massachusetts, USA (2006.07.30-2006.08.02)] Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '06 - Power-aware scheduling for makespan and flow

✍ Bunde, David P. 📂 Article 📅 2006 🏛 ACM Press 🌐 English ⚖ 166 KB

[ACM Press the eighteenth annual ACM sym

[ACM Press the eighteenth annual ACM symposium - Cambridge, Massachusetts, USA (2006.07.30-2006.08.02)] Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '06 - Power-aware scheduling for makespan and flow

✍ Bunde, David P. 📂 Article 📅 2006 🏛 ACM Press 🌐 English ⚖ 166 KB

We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give linear-time algorithms to compute all non-dominated solutions for the general uniprocessor problem and for the mu