EUROPAR
2000
Springer
13 years 8 months ago
2000
Springer
EUROPAR
2000
Springer
13 years 8 months ago
2000
Springer
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...
EUROPAR
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. When parallelizing loop nests for distributed memory parallel computers, we have to specify when the different computations are carried out (computation scheduling), wher...
EUROPAR
2000
Springer
13 years 8 months ago
2000
Springer
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...
EUROPAR
2000
Springer
13 years 8 months ago
2000
Springer
Balancing networks are highly distributed data structures used to solve multiprocessor synchronization problems. Typically, balancing networks are accessed by tokens, and the distr...
EUROPAR
2000
Springer
13 years 8 months ago
2000
Springer
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...
EUROPAR
2000
Springer
13 years 8 months ago
2000
Springer
EUROPAR
2000
Springer
13 years 8 months ago
2000
Springer
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, ...
EUROPAR
2000
Springer
13 years 8 months ago
2000
Springer
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'...
EUROPAR
2000
Springer
13 years 8 months ago
2000
Springer