302 search results - page 9 / 61 » Parallel computing to start the millennium |
TPDS
2002
13 years 7 months ago
2002
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
ICPPW
2006
IEEE
14 years 1 months ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
Gang scheduling is considered to be a highly effective task scheduling policy for distributed systems. In this paper we present a migration scheme which reduces the fragmentation ...
DSD
2003
IEEE
14 years 21 days ago
2003
IEEE
Double precision floating-point arithmetic is inadequate for many scientific computations. This paper presents the design of a quadruple precision floating-point multiplier tha...
CCGRID
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...