Search
Now showing items 1-10 of 81
Universal bufferless routing
(2005)
Given an arbitrary network, and a routing problem with congestion C and dilation D, a long standing open problem is to show the existence of bufferless routing algorithms with optimal performance guarantees (routing time ...
Strength of counting networks
(1996)
This paper shows that any counting network, made up of balancers whose fan-in and fan-out vary arbitrarily, is, indeed, strong enough to simultaneously support both Fetch&Increment and Fetch&Decrement operations, once each ...
The cost of concurrent, low-contention Read&Modify&Write
(2005)
The possibility or impossibility and the corresponding costs of devising concurrent, low-contention implementations of atomic Read&Modify&Write (or RMW) operations in a distributed system were addressed. A natural class ...
Control-driven coordination based assembling of components
(2002)
The coordination paradigm has been used extensively as a mechanism for software composition and integration. Consequently, a number of associated models and languages have been proposed which address issues of CBSE from ...
Implementing a generic component-based framework for telecontrol applications
(2007)
The rapid growth of telecontrol systems is one of the major trends in today's network-oriented community. The implementation of generic frameworks, consisting of reusable components that can form the basis for the development ...
Internet computing: Using reputation to select workers from a pool
(2016)
The assignment and execution of tasks over the Internet is an inexpensive solution in contrast with supercomputers. We consider an Internet-based Master-Worker task computing approach, such as SETI@home. A master process ...
Reputation-based mechanisms for evolutionary master-worker computing
(2013)
We consider Internet-based Master-Worker task computing systems, such as SETI@home, where a master sends tasks to potentially unreliable workers, and the workers execute and report back the result. We model such computations ...
A comparative study of protocols for efficient data propagation in smart dust networks
(2003)
Smart Dust is comprised of a vast number of ultra-small fully autonomous computing and communication devices, with very restricted energy and computing capabilities, that co-operate to accomplish a large sensing task. Smart ...
Coordination of systems with real-time properties in manifold
(IEEE, 1996)
This paper combines work done in the areas of asynchronous timed computations and coordination models in order to derive a framework able to express real-time coordination without adhering to special architectures or ...
Mobile commerce: Vision and challenges (location and its management)
(Institute of Electrical and Electronics Engineers Inc., 2002)
Mobile computing is distributed computing that involves elements whose location changes in the course of computation. Elements may be software components such as mobile agents or moving objects-data or hardware such as ...