2270 search results - page 271 / 454 » On the distribution of eigenvalues of graphs |
167
click to vote
CLUSTER
2005
IEEE
16 years 3 days ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
222
click to vote
INFOVIS
2005
IEEE
16 years 2 days ago
2005
IEEE
We present a system that allows users to interactively explore complex flow scenarios represented as Sankey diagrams. Our system provides an overview of the flow graph and allows ...
181
click to vote
EDCC
2005
Springer
16 years 7 hour ago
2005
Springer
Many governmental agencies and businesses organizations use networked systems to provide a number of services. Such a service-oriented network can be implemented as an overlay on ...
142
click to vote
ASPLOS
2004
ACM
15 years 12 months ago
2004
ACM
Pipeline flushes are becoming increasingly expensive in modern microprocessors with large instruction windows and deep pipelines. Selective re-execution is a technique that can r...
167
click to vote
EUROPAR
2004
Springer
15 years 12 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...