IEEEPACT
1998
IEEE
14 years 7 hour ago
1998
IEEE
This work identifies practical compiling techniques for scalable shared memory machines. For this, we have focused on experimental studies using a real machine and representative ...
IEEEPACT
1998
IEEE
14 years 7 hour ago
1998
IEEE
IEEEPACT
1998
IEEE
14 years 7 hour ago
1998
IEEE
IEEEPACT
1998
IEEE
14 years 7 hour ago
1998
IEEE
In this paper, we present an efficient algorithm, called CASS-II, for task clustering without task duplication. Unlike the DSC algorithm, which is empirically the best known algor...
IEEEPACT
1998
IEEE
14 years 7 hour ago
1998
IEEE
Conventional speculative architectures use branch prediction to evaluate the most likely execution path during program execution. However, certain branches are difficult to predic...
IEEEPACT
1998
IEEE
14 years 7 hour ago
1998
IEEE
In this paper, we present efficient methods for multidimensional array redistribution. Based on the previous work, the basic-cycle calculation technique, we present a basic-block ...
IEEEPACT
1998
IEEE
14 years 7 hour ago
1998
IEEE
The fast evolution of processor performance necessitates a permanent evolution of all the multiprocessor components, even for small to medium-scale symmetric multiprocessors (SMP)...
IEEEPACT
1998
IEEE
14 years 7 hour ago
1998
IEEE
Method speculation of object-oriented programs attempts to exploit method-level parallelism (MLP) by executing sequential method invocations in parallel, while still maintaining c...
IEEEPACT
1998
IEEE
14 years 7 hour ago
1998
IEEE
IEEEPACT
1998
IEEE
14 years 7 hour ago
1998
IEEE
We study in this paper the problem of polyhedron scanning which appears for example when generating code for transformed loop nests in automatic parallelization. After a review of...