Sciweavers

357 search results - page 16 / 72
» Fast Hypergraph Partition
Sort
View
HPDC
2006
IEEE
14 years 1 months ago
Task Scheduling and File Replication for Data-Intensive Jobs with Batch-shared I/O
This paper addresses the problem of efficient execution of a batch of data-intensive tasks with batch-shared I/O behavior, on coupled storage and compute clusters. Two scheduling...
Gaurav Khanna 0002, Nagavijayalakshmi Vydyanathan,...
SPAA
1997
ACM
13 years 11 months ago
HARP: A Fast Spectral Partitioner
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...
Horst D. Simon, Andrew Sohn, Rupak Biswas
RTSS
2005
IEEE
14 years 1 months ago
The Partitioned Multiprocessor Scheduling of Sporadic Task Systems
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform. Since the partitioning probl...
Sanjoy K. Baruah, Nathan Fisher
IPPS
2007
IEEE
14 years 1 months ago
A global address space framework for locality aware scheduling of block-sparse computations
In this paper, we present a mechanism for automatic management of the memory hierarchy, including secondary storage, in the context of a global address space parallel programming ...
Sriram Krishnamoorthy, Ümit V. Çataly&...
ATVA
2006
Springer
153views Hardware» more  ATVA 2006»
13 years 11 months ago
Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically bas...
Wonhong Nam, Rajeev Alur