Back to search

NJIT

Efficient multiprocessor scheduling by mean field theory neural networks

Abstract

dc:description.abstract

<p>In this thesis, we develop an optimization method based on Mean Field Theory (MFT) Neural Networks to solve the Task Scheduling problem. The MFT algorithm combines characteristics of the Simulated Annealing (SA) algorithm and the Hopfield neural network. MFT exhibits rapid convergence and at the same time it preserves the solution quality afforded by SA. Since MFT has been successfully used to solve the Traveling Salesman Problem (TSP), a new modification to MFT is also presented which supports Task Scheduling problem. The temperature behavior of MFT during Task Scheduling is approximately analyzed and shown to possess a critical temperature (71,) at which most of the optimization occurs. This temperature is analogous to the gain of the neurons in a neural network and may be used to tune such networks for better performance.</p>

Degree

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

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Yi, Pei-Ken
Contributors dc:contributor
  • Nirwan Ansari
  • Edwin Hou
  • Yun Q. Shi

Subjects

dc:subject × 5

Identifiers

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

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

Yi, Pei-Ken. Efficient multiprocessor scheduling by mean field theory neural networks. https://digitalcommons.njit.edu/theses/2682