Optimizing latency and throughput of application workflows on clusters

DOI10.1016/j.parco.2010.05.003zbMath1225.68054OpenAlexW2081316572MaRDI QIDQ645499

Naga Vydyanathan, Ponnuswamy Sadayappan, Tahsin M. Kurç, Ümit V. Çatalyürek, Joel H. Saltz

Publication date: 15 November 2011

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.parco.2010.05.003

zbMATH Keywords

latencythroughputdata-parallelismpipelined-parallelismstreaming applicationstask-parallelism

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (5)

Mapping filtering streaming applications ⋮ Mapping pipeline skeletons onto heterogeneous platforms ⋮ Optimizing latency and throughput of application workflows on clusters ⋮ Mapping workflow applications with types on heterogeneous specialized platforms ⋮ Complexity results for throughput and latency optimization of replicated and data-parallel workflows

Cites Work

• Mapping pipeline skeletons onto heterogeneous platforms
• Optimizing latency and throughput of application workflows on clusters
• Towards an Architecture-Independent Analysis of Parallel Algorithms
• C.P.M. Scheduling with Small Communication Delays and Task Duplication

This page was built for publication: Optimizing latency and throughput of application workflows on clusters