๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[ACM Press the fifth annual ACM symposium - Velen, Germany (1993.06.30-1993.07.02)] Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures - SPAA '93 - A method for implementing lock-free shared-data structures

โœ Scribed by Barnes, Greg

Book ID
125530563
Publisher
ACM Press
Year
1993
Tongue
English
Weight
956 KB
Category
Article
ISBN-13
9780897915991

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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