Search
Now showing items 901-910 of 976
Multi-set DHT for range queries on dynamic data for grid information service
(2008)
Scalability is a fundamental problem for information systems when the amount of managed data increases. Peer to Peer systems are usually used to solve scalability problems as centralized approaches do not scale without ...
Coordinated cooperative task computing using crash-prone processors with unreliable multicast
(2017)
This paper presents a new message-passing algorithm, called Do-UM, for distributed cooperative task computing in synchronous settings where processors may crash, and where any multicasts (or broadcasts) performed by crashing ...
Intermediary infrastructures for the World Wide Web
(2004)
Intermediaries are software entities, deployed on hosts of the wireline and wireless network, that mediate the interaction between clients and servers of the World Wide Web. In this paper we present a survey of intermediaries, ...
SWITCHES: A lightweight runtime for dataflow execution of tasks on many-cores
(2017)
SWITCHES is a task-based dataflow runtime that implements a lightweight distributed triggering system for runtime dependence resolution and uses static scheduling and compile-Time assignment policies to reduce runtime ...
Functional algorithm simulation of the fast multipole method: Architectural implications
(1996)
Functional Algorithm Simulation in a methodology for predicting the computation and communication characteristics of parallel algorithms for a class of scientific problems, without actually performing the expensive numerical ...
Performance evaluation of mobile-agent middleware: A Hierarchical approach
(2001)
In this paper, we introduce a hierarchical framework for the quantitative performance evaluation of mobile-agent middleware platforms. This framework is established upon an abstraction of the typical structure of mobile-agent ...
Topic 1: Support tools and environments
(2008)
The spread of systems that provide parallelism either "in-the- large" (grid infrastr-uctures, clusters) or "in-the-small" (multi -core chips), creates new opportunities for exploiting parallelism in a wider spectrum of ...
A comparison study of heuristics for mapping parallel algorithms to message-passing multiprocessors
(1995)
This paper presents a comparison study of popular clustering and mapping heuristics which are used to map task-flow graphs to message-passing multiprocessors. To this end, we use task-graphs which arc representative of ...