2270 search results - page 152 / 454 » On the distribution of eigenvalues of graphs |
177
click to vote
ICPP
2005
IEEE
16 years 16 min ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
164
click to vote
IEEEPACT
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...
153
click to vote
IEEEPACT
1998
IEEE
15 years 10 months ago
1998
IEEE
In order to achieve practical efficient execution on a parallel architecture, a knowledge of the data dependencies related to the application appears as the key point for building...
200
click to vote
SPAA
1993
ACM
15 years 10 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
151
click to vote
CCGRID
2010
IEEE
15 years 7 months ago
2010
IEEE
Applications structured as parallel task graphs exhibit both data and task parallelism, and arise in many domains. Scheduling these applications on parallel platforms has been a lo...