Add to ORKGThis paper addresses the problem of designing a parallel reduction architecture for applicative languages. An interconnection network that allows for scheduling of binary trees of arbitrary depth is presented. It is shown that using a static scheduling strategy the architecture achieves optimal performance while scheduling complete binary trees. Some issues related to the design of a machine based on this network are also discussed
In this paper, divisible load scheduling in a linear network of processors is presented. The cases o...
This paper investigates the execution of tree-shaped task graphs using multiple processors. Each edg...
The paper deals with a parallel approach to job shop scheduling by a branch and bound methodology us...
This paper addresses the problem of designing a parallel reduction architecture for applicative lang...
This paper addresses the problem of designing a parallel reduction architecture for applicative lang...
AbstractWe consider an extension of the well-known PRAM model for parallel distributed-memory comput...
International audienceReduction is a core operation in parallel computing that combines distributed ...
AbstractWe study the problem of scheduling a parallel computation so as to minimize the maximum numb...
This thesis explores a fundamental issue in large-scale parallel computing: how to schedule tasks on...
The Flagship Parallel Reduction Machine is designed to execute declarative language programs based o...
AbstractThis paper provides a unifying mathematical proof which replaces a mechanical certification ...
AbstractWe consider the problem of scheduling the execution of programs on the linear array architec...
Scheduling divisible loads in nonblocking mode of communication in a single-level tree network is co...
This paper presents an efficient hardware architecture for scheduling connections on a fat-tree inte...
We propose an algorithm for scheduling and allocation of parallel programs to message-passing archit...
In this paper, divisible load scheduling in a linear network of processors is presented. The cases o...
This paper investigates the execution of tree-shaped task graphs using multiple processors. Each edg...
The paper deals with a parallel approach to job shop scheduling by a branch and bound methodology us...
This paper addresses the problem of designing a parallel reduction architecture for applicative lang...
This paper addresses the problem of designing a parallel reduction architecture for applicative lang...
AbstractWe consider an extension of the well-known PRAM model for parallel distributed-memory comput...
International audienceReduction is a core operation in parallel computing that combines distributed ...
AbstractWe study the problem of scheduling a parallel computation so as to minimize the maximum numb...
This thesis explores a fundamental issue in large-scale parallel computing: how to schedule tasks on...
The Flagship Parallel Reduction Machine is designed to execute declarative language programs based o...
AbstractThis paper provides a unifying mathematical proof which replaces a mechanical certification ...
AbstractWe consider the problem of scheduling the execution of programs on the linear array architec...
Scheduling divisible loads in nonblocking mode of communication in a single-level tree network is co...
This paper presents an efficient hardware architecture for scheduling connections on a fat-tree inte...
We propose an algorithm for scheduling and allocation of parallel programs to message-passing archit...
In this paper, divisible load scheduling in a linear network of processors is presented. The cases o...
This paper investigates the execution of tree-shaped task graphs using multiple processors. Each edg...
The paper deals with a parallel approach to job shop scheduling by a branch and bound methodology us...