Sciweavers

65 search results - page 4 / 13
» ipps 1997
Sort
View
IPPS
1997
IEEE
13 years 11 months ago
A Compile-Time Partitioning Strategy for Non-Rectangular Loop Nests
This paper presents a compile-time scheme for partitioning non-rectangular loop nests which consist of inner loops whose bounds depend on the index of the outermost, parallel loop...
Rizos Sakellariou
IPPS
1997
IEEE
13 years 11 months ago
A Randomized Sorting Algorithm on the BSP model
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
Alexandros V. Gerbessiotis, Constantinos J. Siniol...
IPPS
1997
IEEE
13 years 11 months ago
Work-Time Optimal K-Merge Algorithms on the PRAM
The k-merge problem, given a collection of k, (2  k  n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
Tatsuya Hayashi, Koji Nakano, Stephan Olariu
IPPS
1997
IEEE
13 years 11 months ago
Fault-Tolerant Deadline-Monotonic Algorithm for Scheduling Hard-Real-Time Tasks
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...
Alan A. Bertossi, Andrea Fusiello, Luigi V. Mancin...
IPPS
1997
IEEE
13 years 11 months ago
Adaptive Fault-Tolerant Wormhole Routing Algorithms for Hypercube and Mesh Interconnection
In this paper, we present adaptive fault-tolerant deadlock-free routing algorithms for hypercubes and meshes by using only 3 virtual channels and 2 virtual channels respectively. ...
Jau-Der Shih