Sciweavers

1370 search results - page 49 / 274
» Synchronization Transformations for Parallel Computing
Sort
View
EUROPAR
2000
Springer
14 years 10 days ago
A Combinatorial Characterization of Properties Preserved by Antitokens
Balancing networks are highly distributed data structures used to solve multiprocessor synchronization problems. Typically, balancing networks are accessed by tokens, and the distr...
Costas Busch, Neophytos Demetriou, Maurice Herlihy...
PODC
1999
ACM
14 years 1 months ago
Wait-Free Synchronization in Multiprogrammed Systems: Integrating Priority-Based and Quantum-Based Scheduling
d Abstract) James H. Anderson Department of Computer Science University of North Carolina at Chapel Hill Mark Moiry Department of Computer Science University of Pittsburgh We cons...
James H. Anderson, Mark Moir
WSC
1997
13 years 10 months ago
Minimum Cost Adaptive Synchronization: Experiments with the ParaSol System
We present a novel adaptive synchronization algorithm, called the minimum average cost (MAC) algorithm, in the context of the ParaSol parallel simulation system. ParaSol is a mult...
Edward Mascarenhas, Felipe Knop, Vernon Rego
CLUSTER
2006
IEEE
14 years 2 months ago
A Simple Synchronous Distributed-Memory Algorithm for the HPCC RandomAccess Benchmark
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
Steven J. Plimpton, Ron Brightwell, Courtenay Vaug...
CCS
2004
ACM
14 years 2 months ago
Parallel mixing
Efforts to design faster synchronous mix networks have focused on reducing the computational cost of mixing per server. We propose a different approach: our re-encryption mixnet...
Philippe Golle, Ari Juels