Scheduling independent jobs for torus connected networks with/without link contention.

DOI10.1016/S0895-7177(99)00228-9zbMath1042.90562OpenAlexW2082358028MaRDI QIDQ1597118

Sandeep K. S. Gupta, Pradip K. Srimani

Publication date: 5 May 2002

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(99)00228-9

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35)

Cites Work

• An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube
• Efficient processor allocation strategies for mesh-connected parallel computers
• Horizons of parallel computation

This page was built for publication: Scheduling independent jobs for torus connected networks with/without link contention.