Sciweavers

2515 search results - page 300 / 503
» Interval Availability Distribution Computation
Sort
View
MIDDLEWARE
2007
Springer
15 years 11 months ago
Peer-to-peer brokering of planning meta-data
In self-adaptive systems, metadata about resources in the system (e.g., services, nodes) must be dynamically published, updated, and removed. Current middleware approaches use sta...
Johannes Oudenstad, Frank Eliassen, Eli Gjø...
ICNP
2005
IEEE
15 years 10 months ago
Intersection Characteristics of End-to-End Internet Paths and Trees
This paper focuses on understanding the scale and the distribution of “state overhead” (briefly load) that is incurred on the routers by various value-added network services,...
Sevcan Bilir, Kamil Saraç, Turgay Korkmaz
IEEEPACT
2005
IEEE
15 years 10 months ago
Communication Optimizations for Fine-Grained UPC Applications
Global address space languages like UPC exhibit high performance and portability on a broad class of shared and distributed memory parallel architectures. The most scalable applic...
Wei-Yu Chen, Costin Iancu, Katherine A. Yelick
ATAL
2005
Springer
15 years 10 months ago
Tunably decentralized algorithms for cooperative target observation
Multi-agent problem domains may require distributed algorithms for a variety of reasons: local sensors, limitations of communication, and availability of distributed computational...
Sean Luke, Keith Sullivan, Liviu Panait, Gabriel C...
IFL
2004
Springer
131views Formal Methods» more  IFL 2004»
15 years 10 months ago
Exploiting Single-Assignment Properties to Optimize Message-Passing Programs by Code Transformations
The message-passing paradigm is now widely accepted and used mainly for inter-process communication in distributed memory parallel systems. However, one of its disadvantages is the...
Alfredo Cristóbal-Salas, Andrey Chernykh, E...