82 search results - page 6 / 17 » Parallel static and dynamic multi-constraint graph partition... |
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
76
Voted
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
This paper presents our work on the static task scheduling model using the mean-field annealing (MFA) technique. Mean-field annealing is a technique of thermostatic annealing that...
ICPP
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—As Chip-Multiprocessor systems (CMP) have become the predominant topology for leading microprocessors, critical components of the system are now integrated on a single c...
JSSPP
2010
Springer
14 years 7 months ago
2010
Springer
Many computational solutions can be expressed as directed acyclic graphs (DAGs) with weighted nodes. In parallel computing, scheduling such DAGs onto manycore processors remains a ...
113
click to vote
ISPA
2004
Springer
15 years 3 months ago
2004
Springer
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is co...