5640 search results - page 629 / 1128 » Parallelizing the Data Cube |
149
Voted
CLUSTER
2001
IEEE
15 years 7 months ago
2001
IEEE
This paper describes a middleware that enables its target application to dynamically incorporate heterogeneous nodes of a cluster. It distributes the objects of the application ac...
116
click to vote
EUROPAR
2000
Springer
15 years 7 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, ...
136
click to vote
EUROPAR
2000
Springer
15 years 7 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...
135
click to vote
ICS
2000
Tsinghua U.
15 years 7 months ago
2000
Tsinghua U.
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...
130
Voted
CONCUR
1995
Springer
15 years 7 months ago
1995
Springer
We develop a theory of bisimulation equivalence for the broadcast calculus CBS. Both the strong and weak versions of bisimulation congruence we study are justi ed in terms of a cha...