Sciweavers

998 search results - page 76 / 200
» A New Design for Distributed Systems: The Remote Memory Mode...
Sort
View
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
14 years 9 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
WOSP
2004
ACM
14 years 2 months ago
Early performance testing of distributed software applications
Performance characteristics, such as response time, throughput and scalability, are key quality attributes of distributed applications. Current practice, however, rarely applies s...
Giovanni Denaro, Andrea Polini, Wolfgang Emmerich
VTC
2007
IEEE
106views Communications» more  VTC 2007»
14 years 3 months ago
Analysis and Design of Dirty Paper Coding by Transformation of Noise
— We design a coding scheme for Costa’s dirty paper coding (DPC) [6] using a channel and a shaping code. We show that by transforming the channel noise distribution the DPC cha...
Young-Seung Lee, Sae-Young Chung
PCRCW
1997
Springer
14 years 27 days ago
ChaosLAN: Design and Implementation of a Gigabit LAN Using Chaotic Routing
In recent years, theChaos Project at theUniversityofWashingtonhas analyzed and simulated a dozen routing algorithms. Three new routing algorithms have been invented; of these, the...
Neil R. McKenzie, Kevin Bolding, Carl Ebeling, Law...
CASES
2004
ACM
14 years 15 days ago
Translating affine nested-loop programs to process networks
New heterogeneous multiprocessor platforms are emerging that are typically composed of loosely coupled components that exchange data using programmable interconnections. The compon...
Alexandru Turjan, Bart Kienhuis, Ed F. Deprettere