Optimizing latency and throughput of application workflows on clusters
DOI10.1016/J.PARCO.2010.05.003zbMATH Open1225.68054OpenAlexW2081316572MaRDI QIDQ645499FDOQ645499
Authors: Naga Vydyanathan, P. Sadayappan, Ümit V. Çatalyürek, Tahsin Kurc, 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
Recommendations
- Co-scheduling algorithms for high-throughput workload execution
- Efficient scientific workflow scheduling for deadline-constrained parallel tasks in cloud computing environments
- Scheduling and optimizing algorithm for parallel tasks in heterogeneous distributed computing systems
- Optimizing Routing and Backlogs for Job Flows in a Distributed Computing Environment
- Polynomial scheduling algorithm for parallel applications on hybrid platforms
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel algorithms in computer science (68W10) Distributed systems (68M14)
Cites Work
Cited In (5)
- Complexity results for throughput and latency optimization of replicated and data-parallel workflows
- Mapping pipeline skeletons onto heterogeneous platforms
- Mapping workflow applications with types on heterogeneous specialized platforms
- Optimizing latency and throughput of application workflows on clusters
- Mapping filtering streaming applications
This page was built for publication: Optimizing latency and throughput of application workflows on clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645499)
