Sciweavers

2799 search results - page 259 / 560
» computing 1998
Sort
View
118
Voted
IEEEPACT
1998
IEEE
15 years 7 months ago
Exploiting Method-Level Parallelism in Single-Threaded Java Programs
Method speculation of object-oriented programs attempts to exploit method-level parallelism (MLP) by executing sequential method invocations in parallel, while still maintaining c...
Michael K. Chen, Kunle Olukotun
74
Voted
IPPS
1998
IEEE
15 years 7 months ago
Lower Bounds on Communication Loads and Optimal Placements in Torus Networks
Fully-populated tori, where every node has a processor attached, do not scale well since load on edges increases superlinearly with network size under heavy communication, resulti...
M. Cemil Azizoglu, Ömer Egecioglu
114
Voted
IPPS
1998
IEEE
15 years 7 months ago
Local Enumeration Techniques for Sparse Algorithms
Several methods have been proposed in the literature for the local enumeration of dense references for arrays distributed by the CYCLIC(k) data-distributionin High Performance For...
Gerardo Bandera, Pablo P. Trabado, Emilio L. Zapat...
IPPS
1998
IEEE
15 years 7 months ago
On the Bisection Width and Expansion of Butterfly Networks
This paper proves tight bounds on the bisection width and expansion of butterfly networks with and without wraparound. Previously it was known that the bisection width of an n-inp...
Claudson F. Bornstein, Ami Litman, Bruce M. Maggs,...
115
Voted
IPPS
1998
IEEE
15 years 7 months ago
Affordable Fault Tolerance Through Adaptation
Fault-tolerant programs are typically not only difficult to implement but also incur extra costs in terms of performance or resource consumption. Failures are typically relatively ...
Ilwoo Chang, Matti A. Hiltunen, Richard D. Schlich...