[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 - Reconfigurable resource scheduling

[ACM Press the eighteenth annual ACM sym

✍ Plaxton, C. Greg; Sun, Yu; Tiwari, Mitul; Vin, Harrick 📂 Article 📅 2006 🏛 ACM Press 🌐 English ⚖ 242 KB

We consider a class of scheduling problems that we refer to as reconfigurable resource scheduling. This class of problems is motivated by emerging applications that involve dynamically allocating a large number of shared resources to a variety of services. We design efficient online algorithms for c

[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

[ACM Press the sixteenth annual ACM symp

[ACM Press the sixteenth annual ACM symposium - Barcelona, Spain (2004.06.27-2004.06.30)] Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '04 - Balanced graph partitioning

✍ Andreev, Konstantin; Räcke, Harald 📂 Article 📅 2004 🏛 ACM Press 🌐 English ⚖ 127 KB

Sponsored By Acm Sigact, Acm Sigarch, And Organized In Cooperation With The European Association For Theoretical Computer Science & Intel Corporation. Includes Bibliographical References And Author Index. Also Issued Online With Additional Title: Proceedings Of The Sixteenth Annual Acm Symposium On

[ACM Press the sixteenth annual ACM symp

[ACM Press the sixteenth annual ACM symposium - Barcelona, Spain (2004.06.27-2004.06.30)] Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '04 - Balanced graph partitioning

✍ Andreev, Konstantin; Räcke, Harald 📂 Article 📅 2004 🏛 ACM Press 🌐 English ⚖ 127 KB

In this paper we consider the problem of (k, ν)-balanced graph partitioning -dividing the vertices of a graph into k almost equal size components (each of size less than ν • n k ) so that the capacity of edges between different components is minimized. This problem is a natural generalization of sev

[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 - Nearest common ancestors

✍ Alstrup, Stephen; Gavoille, Cyril; Kaplan, Haim; Rauhe, Theis 📂 Article 📅 2002 🏛 ACM Press 🌐 English ⚖ 183 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