Sciweavers

2110 search results - page 339 / 422
» What is the complexity of a distributed computing system
Sort
View
SPAA
2005
ACM
15 years 9 months ago
Dynamic circular work-stealing deque
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...
David Chase, Yossi Lev
ICDCSW
2002
IEEE
15 years 9 months ago
The Impact of Data Aggregation in Wireless Sensor Networks
Sensor networks are distributed event-based systems that differ from traditional communication networks in several ways: sensor networks have severe energy constraints, redundant ...
Bhaskar Krishnamachari, Deborah Estrin, Stephen B....
124
Voted
IPPS
1998
IEEE
15 years 8 months ago
Update Protocols and Iterative Scientific Applications
Software DSMs have been a research topic for over a decade. While good performance has been achieved in some cases, consistent performance has continued to elude researchers. This...
Peter J. Keleher
IPPS
1993
IEEE
15 years 8 months ago
Parallel Algorithms for Hypercube Allocation
Abstract - Parallel algorithms of the hypercube allocation strategies are considered in this paper. Although the sequential algorithms of various hypercube allocation strategies ar...
Yeimkuan Chang, Laxmi N. Bhuyan
CONCUR
2007
Springer
15 years 8 months ago
Temporal Antecedent Failure: Refining Vacuity
We re-examine vacuity in temporal logic model checking. We note two disturbing phenomena in recent results in this area. The first indicates that not all vacuities detected in prac...
Shoham Ben-David, Dana Fisman, Sitvanit Ruah