loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
15th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'03)
Applying Scheduling by Edge Reversal to Constraint Partitioning
S?o Paulo, SP - Brazil
November 10-November 12
ISBN: 0-7695-2046-4
ASCII Text
x 
 
Marluce Rodrigues Pereira, Patrícia Kayser Vargas, Felipe M. G. França, Maria Clicia Stelling de Castro, Inês de Castro Dutra, "Applying Scheduling by Edge Reversal to Constraint Partitioning," Computer Architecture and High Performance Computing, Symposium on, pp. 134, 15th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/CAHPC.2003.1250331,
author = {Marluce Rodrigues Pereira and Patrícia Kayser Vargas and Felipe M. G. França and Maria Clicia Stelling de Castro and Inês de Castro Dutra},
title = {Applying Scheduling by Edge Reversal to Constraint Partitioning},
journal ={Computer Architecture and High Performance Computing, Symposium on},
volume = {0},
year = {2003},
isbn = {0-7695-2046-4},
pages = {134},
doi = {http://doi.ieeecomputersociety.org/10.1109/CAHPC.2003.1250331},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer Architecture and High Performance Computing, Symposium on
TI - Applying Scheduling by Edge Reversal to Constraint Partitioning
SN - 0-7695-2046-4
SP
EP
A1 - Marluce Rodrigues Pereira,
A1 - Patrícia Kayser Vargas,
A1 - Felipe M. G. França,
A1 - Maria Clicia Stelling de Castro,
A1 - Inês de Castro Dutra,
PY - 2003
KW - null
VL - 0
JA - Computer Architecture and High Performance Computing, Symposium on
ER -
 
Marluce Rodrigues Pereira, Universidade Federal do Rio de Janeiro
Patrícia Kayser Vargas, Universidade Federal do Rio de Janeiro and Centro Universitário La Salle
Felipe M. G. França, Universidade Federal do Rio de Janeiro
Maria Clicia Stelling de Castro, Universidade Federal do Rio de Janeiro and Universidade Estadual do Rio de Janeiro
Inês de Castro Dutra, Universidade Federal do Rio de Janeiro
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 constraint partitioning of Constraint Satisfaction Problems (CSP). In order to apply the SER mechanism, the graph representing the constraints must receive an acyclic orientation. Since obtaining an optimal acyclic orientation is an NP-hard problem, this work studies three non-deterministic strategies known in the literature: Alg-Neigh, Alg-Edges, and Alg-Colour. We implemented the three algorithms and the SER scheduling mechanism, applying them to the CSP constraint networks generated from 3 applications. Our results show that SER has a great potential to perform a good partitioning of the constraint graphs.
Citation:
Marluce Rodrigues Pereira, Patrícia Kayser Vargas, Felipe M. G. França, Maria Clicia Stelling de Castro, Inês de Castro Dutra, "Applying Scheduling by Edge Reversal to Constraint Partitioning," sbac-pad, pp.134, 15th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.