Sciweavers

434 search results - page 21 / 87
» Scalable synchronous queues
Sort
View
OPODIS
2010
13 years 7 months ago
An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
Danny Hendler, Shay Kutten, Erez Michalak
HPDC
2000
IEEE
14 years 2 months ago
Synchronizing Network Probes to Avoid Measurement Intrusiveness with the Network Weather Service
In this paper we present a scalable protocol for conducting periodic probes of network performance in a way that minimizes collisions between separate probes. The goal of the prot...
Richard Wolski, Benjamin Gaidioz, Bernard Touranch...
PPOPP
2012
ACM
12 years 5 months ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank
ICCD
2007
IEEE
132views Hardware» more  ICCD 2007»
14 years 6 months ago
A position-insensitive finished store buffer
This paper presents the Finished Store Buffer (or FSB), an alternative and position-insensitive approach for building a scalable store buffer for an out-of-order processor. Exploi...
Erika Gunadi, Mikko H. Lipasti
IPPS
2008
IEEE
14 years 4 months ago
Accurately measuring collective operations at massive scale
Accurate, reproducible and comparable measurement of collective operations is a complicated task. Although Different measurement schemes are implemented in wellknown benchmarks, m...
Torsten Hoefler, Timo Schneider, Andrew Lumsdaine