Sciweavers

EUROPAR
2000
Springer
14 years 4 months ago
Complexity Theory and Algorithms
Friedhelm Meyer auf der Heide, Miroslaw Kutylowski...
EUROPAR
2000
Springer
14 years 4 months ago
Reducing the Replacement Overhead on COMA Protocols for Workstation-Based Architectures
In this paper we discuss the behavior of the replacement mechanism of well-known COMA protocols applied to a loosely-coupled multicomputer system sharing a common bus. We also pres...
Diego R. Llanos Ferraris, Benjamín Sahelice...
EUROPAR
2000
Springer
14 years 4 months ago
Scheduling the Computations of a Loop Nest with Respect to a Given Mapping
Abstract. When parallelizing loop nests for distributed memory parallel computers, we have to specify when the different computations are carried out (computation scheduling), wher...
Alain Darte, Claude G. Diderich, Marc Gengler, Fr&...
EUROPAR
2000
Springer
14 years 4 months ago
Novel Models for Or-Parallel Logic Programs: A Performance Analysis
One of the advantages of logic programming is the fact that it offers many sources of implicit parallelism, such as and-parallelism and or-parallelism. Arguably, or-parallel system...
Vítor Santos Costa, Ricardo Rocha, Fernando...
EUROPAR
2000
Springer
14 years 4 months ago
A Combinatorial Characterization of Properties Preserved by Antitokens
Balancing networks are highly distributed data structures used to solve multiprocessor synchronization problems. Typically, balancing networks are accessed by tokens, and the distr...
Costas Busch, Neophytos Demetriou, Maurice Herlihy...
EUROPAR
2000
Springer
14 years 4 months ago
BitValue Inference: Detecting and Exploiting Narrow Bitwidth Computations
We present a compiler algorithm called BitValue, which can discover both unused and constant bits in dusty-deck C programs. BitValue uses forward and backward dataflow analyses, ge...
Mihai Budiu, Majd Sakr, Kip Walker, Seth Copen Gol...
EUROPAR
2000
Springer
14 years 4 months ago
Cache Remapping to Improve the Performance of Tiled Algorithms
With the increasing processing power, the latency of the memory hierarchy becomes the stumbling block of many modern computer architectures. In order to speed-up the calculations, ...
Kristof Beyls, Erik H. D'Hollander
EUROPAR
2000
Springer
14 years 4 months ago
Parallelizing an Unstructured Grid Generator with a Space-Filling Curve Approach
A new parallel load distribution algorithm for unstructured parallel grid generation is presented. This new approach is based on a space-filling curve. The space-filling curve'...
Jörn Behrens, Jens Zimmermann