See this document in CiteSeerX!

An Algorithm for Transforming NSP to SP Graphs (1996)  (Make Corrections)  (2 citations)
Arturo Gonzalez Escribano, Arjan J.C. van Gemund



  Home/Search   Context   Related

 
View or download:
infor.uva.es/~arturo/...tr199609.ps.Z
infor.uva.es/~arturo...tr199609.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  infor.uva.es/~artu...publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In the research area of the Series-Parallel-Contention programming model we have a very important conjecture about the increment of computational time when transforming Non-series-parallelContention structures to Series-Parallel-Contention. The first step in the study of this conjecture is to check it in a very simple syntactic case: the Non-Series-Parallel task graphs. We have developed a polynomial time algorithm to automatically transform this kind of graphs in Series-Parallel structures. We ... (Update)

Context of citations to this paper:   More

...is still an evaluation tool, the implementation is not completly ecient. There is a description index of the software generated in [5]. New versions of the algorithm will be developed with new improvements and nice features. A new JAVA version will be implemented for full...

.... structure, while simultaneously keeping the loss of performance due to this restriction (the slowdown) to a small constant [32]. The worst case slowdown was conjectured to be at most 2 in almost all cases [29, 31,79, 80] The hypothesis underlying this dissertation...

Cited by:   More
Task Graph Performance Bounds Through Comparison Methods - Salamon (2001)   (Correct)
Conversion from NSP to SP graphs - Escribano, Payo, van Gemund (1997)   (Correct)

Active bibliography (related documents):   More   All
0.4:   Approximating Unstructured Task Parallelism in.. - Escribano, Payo, van.. (1997)   (Correct)
0.1:   The Expressiveness of SPC Synchronization Model: A.. - Escribano, Payo, van..   (Correct)
0.1:   On The Loss Of Parallelism By Imposing Synchronization.. - Escribano, Payo, van.. (1997)   (Correct)

Similar documents based on text:   More   All
0.7:   On the Loss of Parallelism by Imposing Synchronization.. - Escribano, Payo, van..   (Correct)
0.3:   Predicting the Impact of Implementation Level Aspects .. - Arturo.. (2001)   (Correct)
0.3:   Performance Trade-offs in Series-Parallel Programming Models - Escribano, van Gemund, Payo (2000)   (Correct)

Related documents from co-citation:   More   All
2:   cient and practical modular decomposition (context) - Dahlhaus, Gustedt et al. - 1997

BibTeX entry:   (Update)

A. Gonzalez Escribano and A.J.C. van Gemund, \An algorithm for transforming NSP to SP graphs," Tech. Rep. 1-68340-44(1996)09, Technical University, Delft, The Netherlands, 1996. http://citeseer.ist.psu.edu/gonzalezescribano96algorithm.html   More

@misc{ gonz96algorithm,
  author = "A. Gonz and a Escribano and A. van Gemund",
  title = "An algorithm for transforming NSP to SP graphs",
  text = "A. Gonzalez Escribano and A.J.C. van Gemund, \An algorithm for transforming
    NSP to SP graphs, Tech. Rep. 1-68340-44(1996)09, Technical University, Delft,
    The Netherlands, 1996.",
  year = "1996",
  url = "citeseer.ist.psu.edu/gonzalezescribano96algorithm.html" }
Citations (may not include all citations):
25   Performance Modeling of Parallel Systems (context) - van Gemund - 1996
15   Automatic scalability analysis of parallel programs based on.. (context) - Maloney, Mertsiotakis et al.
3   A new model of parallel computation (context) - van Gemund - 1996
2   New Jersey 07632: Prentice Hall (context) - Brassard, Bratley et al. - 1988
1   Spc programming power: A conjecture (context) - van Gemund

Documents on the same site (http://www.infor.uva.es/~arturo/publications.html):   More
Conversion from NSP to SP graphs - Escribano, Payo, van Gemund (1997)   (Correct)
On The Loss Of Parallelism By Imposing Synchronization.. - Escribano, Payo, van.. (1997)   (Correct)
Approximating Unstructured Task Parallelism in.. - Escribano, Payo, van.. (1997)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC