Neural scheduler for real-time networks

Tadashi Ae, Masafumi Yamashita, Ken ich Nitta

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Scheduling problem for real-time systems is known to be intractable, i.e., NP-hard or completely NP for most cases. A neural computation technique is introduced to solve it within a limited time under a hard real-time environment. Although the neural computation can be effectively carried out by a multiprocessor, a special processor is designed to obtain the scheduled result with no overhead.

Original languageEnglish
Title of host publicationProceedings of the Hawaii International Conference on System Science
EditorsBruce D. Shriver
PublisherPubl by Western Periodicals Co
Pages662-666
Number of pages5
ISBN (Print)0818619120
Publication statusPublished - Dec 1 1989
EventProceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences: Software Track - Kailua-Kona, Hawaii, USA
Duration: Jan 3 1989Jan 6 1989

Publication series

NameProceedings of the Hawaii International Conference on System Science
Volume2
ISSN (Print)0073-1129

Other

OtherProceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences: Software Track
CityKailua-Kona, Hawaii, USA
Period1/3/891/6/89

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Neural scheduler for real-time networks'. Together they form a unique fingerprint.

Cite this