Scheduling of independent jobs in star graph networks

DOI10.1016/0898-1221(96)00143-5zbMath0862.90079OpenAlexW2043159198MaRDI QIDQ1816661

Pradip K. Srimani, Shahram Latifi

Publication date: 19 December 1996

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(96)00143-5

zbMATH Keywords

boundsnonpreemptive schedulingindependent jobspreemptively scheduling\(m\)-dimensional star graph based network

Mathematics Subject Classification ID

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
• On the fault-diameter of the star graph
• Parallel concepts in graph theory
• A group-theoretic model for symmetric interconnection networks
• Unnamed Item
• Unnamed Item

This page was built for publication: Scheduling of independent jobs in star graph networks