Sciweavers

EUROPAR
2001
Springer
13 years 9 months ago
Self-Organizing Hierarchical Cluster Timestamps
Distributed-system observation tools require an efficient data structure to store and query the partial-order of execution. Such data structures typically use vector timestamps to...
Paul A. S. Ward, David J. Taylor
EUROPAR
2001
Springer
13 years 9 months ago
A Software Architecture for User Transparent Parallel Image Processing on MIMD Computers
Abstract. This paper describes a software architecture that allows image processing researchers to develop parallel applications in a transparent manner. The architecture’s main ...
Frank J. Seinstra, Dennis Koelma, Jan-Mark Geusebr...
EUROPAR
2001
Springer
13 years 9 months ago
Execution Latency Reduction via Variable Latency Pipeline and Instruction Reuse
Operand bypass logic might be one of the critical structures for future microprocessors to achieve high clock speed. The delay of the logic imposes the execution time budget to be ...
Toshinori Sato, Itsujiro Arita
EUROPAR
2001
Springer
13 years 9 months ago
An Experimental Performance Evaluation of Join Algorithms for Parallel Object Databases
Abstract. Parallel relational databases have been successful in providing scalable performance for data intensive applications, and much work has been carried out on query processi...
Sandra de F. Mendes Sampaio, Jim Smith, Norman W. ...
EUROPAR
2001
Springer
13 years 9 months ago
Cactus Application: Performance Predictions in Grid Environments
Matei Ripeanu, Adriana Iamnitchi, Ian T. Foster
EUROPAR
2001
Springer
13 years 9 months ago
Using a Swap Instruction to Coalesce Loads and Stores
A swap instruction, which exchanges a value in memory with a value of a register, is available on many architectures. The primary application of a swap instruction has been for pro...
Apan Qasem, David B. Whalley, Xin Yuan, Robert van...
EUROPAR
2001
Springer
13 years 9 months ago
Optimal Polling for Latency-Throughput Tradeoffs in Queue-Based Network Interfaces for Clusters
We consider a networking subsystem for message–passing clusters that uses two unidirectional queues for data transfers between the network interface card (NIC) and the lower prot...
Dmitry Ponomarev, Kanad Ghose, Eugeny Saksonov
EUROPAR
2001
Springer
13 years 9 months ago
Optimal Many-to-One Routing on the Mesh with Constant Queues
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
Andrea Pietracaprina, Geppino Pucci