Dependable Distributed Scheduling in a Network of Workstations.

Abstract

The Active Nodal Task Seeking (ANTS) concept uses a completely decentralized approach in which each computing node is an active member of the system. This not only avoids the possible critical region in favor of a dependable computing, but also provides an adaptable, distributed resource management that can explore the full potential in computational power of the system. This paper describes the dependable distributed scheduling of the ANTS approach in a network of workstations. Results of the implementation under the Sun OS and UDP/IP are reported. Experimental runs statistics showing the efficiency and effectiveness of the ANTS approach are also presented.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 15, 1995
Accession Number
ADA298818

Entities

People

  • Arun Paramadhathil
  • Donald W. Tufts
  • James W. Cooley
  • Jien-chung Lo
  • John Hammen

Organizations

  • University of Rhode Island

Tags

Communities of Interest

  • Energy and Power Technologies
  • Weapons Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Application Software
  • C Programming Language
  • Communication Channels
  • Computations
  • Computer Programming
  • Data Transmission
  • Distributed Computing
  • Engineering
  • Fault Tolerance
  • Fish
  • Frequency
  • Local Area Networks
  • Network Protocols
  • Operating Systems
  • Scheduling (Production)
  • Simulators

Fields of Study

  • Computer science
  • Engineering

Readers

  • Agent-Based Social Robotics and Mobile-Assisted Learning in Virtual Environments.
  • Database Systems and Applications
  • Regression Analysis.