Thesis icon

Thesis

Task Graph Performance Bounds Through Comparison Methods

Abstract:

When a parallel computation is represented in a formalism that imposes series-parallel structure on its task graph, it becomes amenable to automated analysis and scheduling. Unfortunately, its execution time will usually also increase as precedence constraints are added to ensure series-parallel structure. Bounding the slowdown ratio would allow an informed tradeoff between the benefits of a restrictive formalism and its cost in loss of performance.This dissertation deals with series-parallel...

Expand abstract

Actions


Authors


András Z. Salamon More by this author
Publication date:
2001
URN:
uuid:5927438a-0b2e-4509-a865-0dd10c6f6ef8
Local pid:
cs:103

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP