Sciweavers

1027 search results - page 62 / 206
» Ordered Vertex Partitioning
Sort
View
SBACPAD
2003
IEEE
125views Hardware» more  SBACPAD 2003»
14 years 3 months ago
Applying Scheduling by Edge Reversal to Constraint Partitioning
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
Marluce Rodrigues Pereira, Patrícia Kayser ...
EUROPAR
2009
Springer
14 years 2 months ago
Distributed Data Partitioning for Heterogeneous Processors Based on Partial Estimation of Their Functional Performance Models
The paper presents a new data partitioning algorithm for parallel computing on heterogeneous processors. Like traditional functional partitioning algorithms, the algorithm assumes ...
Alexey L. Lastovetsky, Ravi Reddy
DGCI
2006
Springer
14 years 1 months ago
Skeleton Pruning by Contour Partitioning
Abstract-- In this paper, we introduce a new skeleton pruning method based on contour partitioning. Any contour partition can be used, but the partitions obtained by Discrete Curve...
Xiang Bai, Longin Jan Latecki, Wenyu Liu
DFT
2005
IEEE
132views VLSI» more  DFT 2005»
14 years 3 days ago
Low Power BIST Based on Scan Partitioning
A built-in self-test (BIST) scheme is presented which both reduces overhead for detecting random-pattern-resistant (r.p.r.) faults as well as reduces power consumption during test...
Jinkyu Lee, Nur A. Touba
ECRTS
2009
IEEE
13 years 8 months ago
Partitioned Fixed-Priority Preemptive Scheduling for Multi-core Processors
Abstract--Energy and thermal considerations are increasingly driving system designers to adopt multi-core processors. In this paper, we consider the problem of scheduling periodic ...
Karthik Lakshmanan, Ragunathan Rajkumar, John P. L...