๐”– 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 - Deterministic distribution sort in shared and distributed memory multiprocessors

โœ Scribed by Nodine, Mark H.; Vitter, Jeffrey Scott


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

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


[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 sixteenth annual ACM symp
โœ 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
โœ 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