SPAA 2001 : thirteenth annual ACM Symposium on Parallel Algorithms and Architectures, July 3-6, 2001, Crete Island, Greece / sponsored by ACM SIGACT, ACM SIGARCH ; in cooperation with EATCS
Imprint
New York, NY : Association for Computing Machinery, 2001
Descript
xi, 339 p. : ill. ; 28 cm
CONTENT
Routing -- Algorithms -- FIFO protocol -- Buffer management -- Geometric radio networks -- Attack propagation -- Deterministic resource -- Large-scale peer-to-peer networks -- Extremely fine-grained parallel programming -- Vectorizable numerical -- Automatable verification of sequential consistency -- Synchronizations -- Shared memory -- Computational power -- Optimal semi-oblique tiling -- Parallel -- Out-of-core sorting program -- Normal basis representations -- Hierarchical clusters -- Optimal prefetching and caching -- Data tracking -- Spectral bounds -- k-Partitioning -- Union of data streams -- Randomized k-Set agreement -- Periodic, random-fault-tolerant correction networks -- D-CAT -- Library support for orthogonal processor groups -- Push tree problem -- Tiling space-time mapped loop nests -- Exact triangularization -- Particle transport sweeps -- Work-optimal CGM algorithm -- LIS problem -- Locks