Scheduling independent jobs for torus connected networks with/without link contention.
type: Item
instance of: scholarly article
title: Scheduling independent jobs for torus connected networks with/without link contention.
zbMATH Open document ID: 1042.90562
DOI: 10.1016/S0895-7177(99)00228-9
author: Sandeep K. S. Gupta
author: Pradip K. Srimani
published in: Mathematical and Computer Modelling
publication date: 2002-05-05T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 1737807
MaRDI profile type: Publication
cites work: Horizons of parallel computation
cites work: Efficient processor allocation strategies for mesh-connected parallel computers
cites work: An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube
full work available at URL: s0895-7177(99)00228-9
OpenAlex ID: W2082358028
Recommended article: Task scheduling in networks
Recommended article: Scheduling of independent jobs in star graph networks
Recommended article: Task Scheduling in Networks
Recommended article: Q3789070
Recommended article: Scheduling Divisible Loads in Gaussian, Mesh and Torus Network of Processors
Recommended article: AN EFFICIENT JOB SCHEDULING ALGORITHM IN PARTITIONABLE MESH CONNECTED SYSTEMS
Recommended article: Integrating job scheduling and constrained network routing
description: scientific article; zbMATH DE number 1737807