A Model to Solve Timing-Critical Application Problems in Distributed Computer Systems

Today, real-time computer applications can require system processing speeds up to hundreds of MIPS. Concurrently, there is a need for short system response time, particularly where timing-critical application (TCA) problems are concerned. As a way of meeting these system demands, concurrent processi...

Full description

Saved in:
Bibliographic Details
Published inComputer (Long Beach, Calif.) Vol. 17; no. 1; pp. 62 - 68
Main Author Ma, R P-Y
Format Journal Article
LanguageEnglish
Published IEEE 01.01.1984
Subjects
Application software
Computer applications
Concurrent computing
Cost function
Distributed computing
Real time systems
Software tools
Telecommunication traffic
Online AccessGet full text
ISSN0018-9162
DOI10.1109/MC.1984.1658932

Cover

More Information
Summary:Today, real-time computer applications can require system processing speeds up to hundreds of MIPS. Concurrently, there is a need for short system response time, particularly where timing-critical application (TCA) problems are concerned. As a way of meeting these system demands, concurrent processing of data items in advanced distributed computer systems is rapidly gaining favor. When distributed computer systems are applied to solve TCA problems, the network hardware provides the physical capability to concurrently process data items. The task allocation scheme is responsible for managing hardware devices that execute software tasks to meet the application requirements. Before selecting an allocation model for timing-critical application problems, the author looks at several different approaches to the subject. Basically, there are three methods of approaching the TCA problem: graph theoretical, integer programming, and heuristic.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9162
DOI:10.1109/MC.1984.1658932