See this document in CiteSeerX!

Conversion from NSP to SP graphs (1997)  (Make Corrections)  (3 citations)
Arturo González Escribano, Valentín Cardeñoso Payo, Arjan J.C. van Gemund



  Home/Search   Context   Related

 
View or download:
infor.uva.es/~artu...DINFO199701.ps.Z
infor.uva.es/~artu...DINFO199701.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: Recently a new parallel programming model (SPC) has been presented that imposes synchronization restrictions in order to allow for fully automatic, retargetable program optimization. The motivation for the model is the conjecture that in practice the loss of parallelism due to the inherent synchronization restrictions is less than a factor of 2. In this report we present a revised algorithm to automatically transform task graphs to provide compelling evidence in favor of this conjecture, based... (Update)

Context of citations to this paper:   More

...each class to an SP form. We present a brief of the results obtained using our previously presented polynomialtime space algorithm [4, 3], that approximates any NSP task graph in terms of an SP graph that is close to the original in terms of its critical path, using...

...so that there is always a way to series parallelise a task 1 CHAPTER 1. INTRODUCTION 2 graph while keeping the slowdown within the bound [30]. This bounded slowdown conjecture was introduced by Gonzalez Escribano et al. to capture the intuition that parallel programs could...

Cited by:   More
On the Loss of Parallelism by Imposing Synchronization.. - Escribano, Payo, van..   (Correct)
Task Graph Performance Bounds Through Comparison Methods - Salamon (2001)   (Correct)
The Expressiveness of SPC Synchronization Model: A.. - Escribano, Payo, van..   (Correct)

Similar documents (at the sentence level):
25.6%:   On The Loss Of Parallelism By Imposing Synchronization.. - Escribano, Payo, van.. (1997)   (Correct)
25.3%:   Approximating Unstructured Task Parallelism in.. - Escribano, Payo, van.. (1997)   (Correct)

Active bibliography (related documents):   More   All
0.6:   An Algorithm for Transforming NSP to SP Graphs - Escribano, van Gemund (1996)   (Correct)
0.1:   Notes on SPC: A Parallel Programming Model - van Gemund (1997)   (Correct)
0.1:   The Importance of Synchronization Structure in Parallel Program .. - van Gemund (1997)   (Correct)

Similar documents based on text:   More   All
0.7:   Expressiveness versus Optimizability in Coordinating.. -..   (Correct)
0.5:   Predicting the Impact of Implementation Level Aspects .. - Arturo.. (2001)   (Correct)

Related documents from co-citation:   More   All
2:   Automatic scalability analysis of parallel programs based on modeling techniques (context) - Maloney, Mertsiotakis et al. - 1994
2:   A Static Performance Estimator to Guide Data Partitioning Decisions (context) - Balasundaram, Fox et al. - 1991
2:   Precise compile-time performance prediction for superscalar-based computers - Wang - 1994

BibTeX entry:   (Update)

A. Gonzalez Escribano, V. Cardenoso and A.J.C. van Gemund, "Conversion from NSP to SP graphs," Tech. Rep. TR-DINFO-01-97, Universidad de Valladolid, Valladolid (Spain), Jan. 1997. http://citeseer.ist.psu.edu/escribano97conversion.html   More

@misc{ escribano97conversion,
  author = "A. Escribano and V. Cardenoso and A. van Gemund",
  title = "Conversion from NSP to SP graphs",
  text = "A. Gonzalez Escribano, V. Cardenoso and A.J.C. van Gemund, Conversion from
    NSP to SP graphs, Tech. Rep. TR-DINFO-01-97, Universidad de Valladolid,
    Valladolid (Spain), Jan. 1997.",
  year = "1997",
  url = "citeseer.ist.psu.edu/escribano97conversion.html" }
Citations (may not include all citations):
447   MPI: The Complete Reference (context) - Snir, Otto et al. - 1996
394   The High-Performance Fortran Handbook (context) - Koelbel, Loveman et al. - 1994
159   A static performance estimator to guide data partioning deci.. (context) - Balasundaram, Fox et al. - 1991
138   Concepts and notations for concurrent programming (context) - Andrews, Schneider - 1983
83   A static parameter-based performance prediction tool for par.. - Fahringer, Zima - 1993
28   Precise compile-time performance prediction for superscalar-.. - Wang - 1994
25   Performance Modeling of Parallel Systems (context) - van Gemund - 1996
17   Multivariate statistical techniques for parallel performance.. - Clement, Quinn - 1995
15   Automatic scalability analysis of parallel programs based on.. (context) - Maloney, Mertsiotakis et al. - 1994
5   Compile-time optimization and the SPC parallel programming m.. (context) - van Gemund - 1996
4   Measuring the distance to series-parallelity by path express.. - Naumann - 1994
2   New Jersey 07632: Prentice Hall (context) - Brassard, Bratley et al. - 1988
2   An algorithm for transforming NSP to SP graphs - Gonz, Escribano et al. - 1996

Documents on the same site (http://www.infor.uva.es/~arturo/publications.html):   More
An Algorithm for Transforming NSP to SP Graphs - Escribano, van Gemund (1996)   (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