Theoretical Results on Distributed Processing with Limited Computing Resources

Abstract

A task is a set of related operations which can be performed on some input data. An algorithm is a collection of tasks with an underlying structure defined in terms of precedence relationships among the tasks. Two models of processing systems are considered. A distributed processing system consists of separate processors, each one dedicated to perform a single task, and permits pipelined processing of consecutive requests, as well as concurrent processing of tasks for a given request. A centralized processing system consists of a single processor which performs all the tasks for a given request sequentially, and services the requests sequentially without pipelining. The performance of these two systems is compared in terms of average execution times, under the constraint that the capacity of the processor in the centralized system is equal to the sum of the capacities of individual processors in the distribution system.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1985
Accession Number
ADA221897

Entities

People

  • Fouad A. Tobagi
  • Hemant Kanakia

Organizations

  • Stanford University

Tags

Communities of Interest

  • C4I
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Coefficients
  • Communication Networks
  • Computer Communications
  • Computers
  • Convex Programming
  • Electrical Engineering
  • Electronics Laboratories
  • Equations
  • Information Processing
  • Networks
  • Notation
  • Probability
  • Random Variables
  • Security
  • Sequences
  • Topology

Fields of Study

  • Computer science
  • Engineering

Readers

  • Parallel and Distributed Computing.