5448 search results - page 360 / 1090 » Breakpoints and Time in Distributed Computations |
174
click to vote
CLUSTER
2002
IEEE
15 years 11 months ago
2002
IEEE
The join is the most important, but also the most time consuming operation in relational database systems. We implemented the parallel Hybrid Hash Join algorithm on a PC-cluster a...
148
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
A major problem with time slicing on parallel machines is memory pressure, as the resulting paging activity damages the synchronism among a job’s processes. An alternative is to...
102
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper describes the framework of internal hardware templates. These reusable templates can be instantiated, inside the FPGA, to the required precision. Thus, the resource util...
170
click to vote
CONCUR
1998
Springer
15 years 11 months ago
1998
Springer
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of universal coalgebr...
180
click to vote
GCC
2005
Springer
16 years 5 days ago
2005
Springer
In this paper, we compare the performance of some mesh-based applications in a Grid environment using the domain decomposition technique and unbalanced workload strategies. We prop...