506 search results - page 5 / 102 » Distributing synchronous programs using bounded queues |
IPPS
2000
IEEE
13 years 12 months ago
2000
IEEE
This paper presents a new methodology for implementing fast synchronization on scalable cache-coherent multiprocessors, through the use of hybrid primitives. Hybrid primitives lev...
MCMASTER
1993
13 years 11 months ago
1993
With the recent advances in massively parallel programmable processor networks, methods for the infusion of massive MIMD parallelism into programs have become increasingly relevant...
JSSPP
2007
Springer
14 years 1 months ago
2007
Springer
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. Because these machines are...
WSC
2007
13 years 10 months ago
2007
This paper addresses several issues of using the mathematical programming representations of discrete-event dynamic systems in perturbation analysis. In particular, linear program...
WDAG
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents lower bounds on the time- and space-complexity of implementations that use the k compare-and-swap (k-CAS) synchronization primitives. We prove that the use of ...