Back to search

NJIT

Simulation and close-to-optimal algorithm for the static load balancing of a network of heterogeneous processors

Abstract

dc:description.abstract

A close-to-optimal linear programming-based algorithm for the static load balancing of a network of heterogeneous processors is described and implemented. Experimental results suggest that the amount of time required by the implementation of the algorithm to balance the loads of the servers as a function of the number of servers has polynomial complexity.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Computer Science - (M.S.)
Discipline thesis:degree_discipline
Computer and Information Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Steiner, Mark G.
Contributors dc:contributor
  • Boris S. Verkhovsky
  • James A. McHugh
  • Stephen B. Seidman

Subjects

dc:subject × 3

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.njit.edu/theses/681

Chain of custody

source
Harvested from
NJIT
Base URL
digitalcommons.njit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Steiner, Mark G.. Simulation and close-to-optimal algorithm for the static load balancing of a network of heterogeneous processors. https://digitalcommons.njit.edu/theses/681