Sciweavers

11348 search results - page 1980 / 2270
» On time-scale designs for networks
Sort
View
IPPS
2007
IEEE
16 years 1 months ago
Task-pushing: a Scalable Parallel GC Marking Algorithm without Synchronization Operations
This paper describes a scalable parallel marking technique for garbage collection that does not employ any synchronization operation. To achieve good scalability, two major design...
Ming Wu, Xiao-Feng Li
IPPS
2007
IEEE
16 years 1 months ago
Online Aggregation over Trees
Consider a distributed network with nodes arranged in a tree, and each node having a local value. We consider the problem of aggregating values (e.g., summing values) from all nod...
C. Greg Plaxton, Mitul Tiwari, Praveen Yalagandula
IPPS
2007
IEEE
16 years 1 months ago
Self Adaptive Application Level Fault Tolerance for Parallel and Distributed Computing
Most application level fault tolerance schemes in literature are non-adaptive in the sense that the fault tolerance schemes incorporated in applications are usually designed witho...
Zizhong Chen, Ming Yang, Guillermo A. Francia III,...
IPPS
2007
IEEE
16 years 1 months ago
Packet Loss Burstiness: Measurements and Implications for Distributed Applications
Many modern massively distributed systems deploy thousands of nodes to cooperate on a computation task. Network congestions occur in these systems. Most applications rely on conge...
David X. Wei, Pei Cao, Steven H. Low
IROS
2007
IEEE
97views Robotics» more  IROS 2007»
16 years 1 months ago
Meld: A declarative approach to programming ensembles
Abstract— This paper presents Meld, a programming language for modular robots, i.e., for independently executing robots where inter-robot communication is limited to immediate ne...
Michael P. Ashley-Rollman, Seth Copen Goldstein, P...
« Prev « First page 1980 / 2270 Last » Next »