Optimizing Routing and Backlogs for Job Flows in a Distributed Computing Environment

DOI10.1007/978-3-540-69277-5_2MaRDI QIDQ3603108zbMATH OpenOpenAlexFDO

Authors David J. Montana, John Zinky

Publication date 13 February 2009

Published in Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69277-5_2

zbMATH Keywords

clusterdistributed systemdynamic programminggenetic algorithmsjob flowsrouting and backlog of jobs

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Learning and adaptive systems in artificial intelligence (68T05) Stochastic network models in operations research (90B15) Combinatorial optimization (90C27)

Recommendations

• Routing jobs with deadlines to heterogeneous parallel servers
• Optimal Routing of Fixed Size Jobs to Two Parallel Servers
• scientific article; zbMATH DE number 1929963
• Optimality of routing and servicing in dependent parallel processing systems
• Optimal load balancing and scheduling in a distributed computer system
• Integrating job scheduling and constrained network routing
• Individually optimal routing in parallel systems

Cited in

(3)

• Achieving optimal backlog in multi-processor cup games
• Principles of Distributed Systems
• Optimizing latency and throughput of application workflows on clusters

This page was built for publication: Optimizing Routing and Backlogs for Job Flows in a Distributed Computing Environment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603108)