2924 search results - page 488 / 585 » Lower Bounds in Distributed Computing |
117
click to vote
IPPS
2005
IEEE
15 years 10 months ago
2005
IEEE
Pfair scheduling, currently the only known way of optimally scheduling recurrent real-time tasks on multiprocessors, imposes certain requirements that may limit its practical impl...
122
click to vote
PPOPP
2005
ACM
15 years 10 months ago
2005
ACM
Dataraces in multithreaded programs often indicate severe bugs and can cause unexpected behaviors when different thread interleavings are executed. Because dataraces are a cause f...
159
click to vote
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
ShareStreams (Scalable Hardware Architectures for Stream Schedulers) is a canonical architecture for realizing a range of scheduling disciplines. This paper discusses the design c...
126
click to vote
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper we study the performance properties of combined multiple heterogeneous networks. Consider two nodes node1 and node2 with multiple heterogeneous physical networks con...
120
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
This paper is concerned with compact routing schemes for arbitrary undirected networks in the name-independent model first introduced by Awerbuch, Bar-Noy, Linial and Peleg. A co...