Sciweavers

Share
CAP
2010
8 years 4 months ago
Polynomial homotopies on multicore workstations
Homotopy continuation methods to solve polynomial systems scale very well on parallel machines. In this paper we examine its parallel implementation on multiprocessor multicore wo...
Jan Verschelde, Genady Yoffe
TPDS
1998
157views more  TPDS 1998»
8 years 8 months ago
A Compiler Optimization Algorithm for Shared-Memory Multiprocessors
This paper presents a new compiler optimization algorithm that parallelizes applications for symmetric, sharedmemory multiprocessors. The algorithm considers data locality, parall...
Kathryn S. McKinley
JSS
2002
107views more  JSS 2002»
8 years 8 months ago
On the attractiveness of the star network
In defiance of the tremendous research the star network had attracted during the last decade, no parallel machine based on this network has yet been built. In this paper, we explo...
Abdel Elah Al-Ayyoub, Khaled Day, Abdullah Al-Dhel...
ANOR
2008
123views more  ANOR 2008»
8 years 9 months ago
An approach to predictive-reactive scheduling of parallel machines subject to disruptions
: In this paper, a new predictive-reactive approach to a parallel machine scheduling problem in the presence of uncertain disruptions is presented. The approach developed is based ...
Alejandra Duenas, Dobrila Petrovic
AAECC
2007
Springer
87views Algorithms» more  AAECC 2007»
8 years 9 months ago
Towards an accurate performance modeling of parallel sparse factorization
We present a simulation-based performance model to analyze a parallel sparse LU factorization algorithm on modern cached-based, high-end parallel architectures. We consider supern...
Laura Grigori, Xiaoye S. Li
EUROPAR
2010
Springer
8 years 9 months ago
A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
Marin Bougeret, Pierre-François Dutot, Klau...
SODA
2001
ACM
125views Algorithms» more  SODA 2001»
8 years 10 months ago
Parallel processor scheduling with delay constraints
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
Daniel W. Engels, Jon Feldman, David R. Karger, Ma...
ARC
2010
Springer
138views Hardware» more  ARC 2010»
9 years 15 days ago
Space and Time Sharing of Reconfigurable Hardware for Accelerated Parallel Processing
High-Performance Reconfigurable Computers (HPRCs) are parallel machines consisting of FPGAs and microprocessors, with the FPGAs used as co-processors. The execution of parallel app...
Esam El-Araby, Vikram K. Narayana, Tarek A. El-Gha...
ESA
2000
Springer
141views Algorithms» more  ESA 2000»
9 years 24 days ago
Preemptive Scheduling with Rejection
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
Han Hoogeveen, Martin Skutella, Gerhard J. Woeging...
DFG
1992
Springer
9 years 1 months ago
Complexity of Boolean Functions on PRAMs - Lower Bound Techniques
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
Miroslaw Kutylowski
books