A Dynamic Priority Scheduling Rule with Optimization for Transaction Processing Systems.

Abstract

This report describes the investigation of a dynamic priority scheduling rule and its applicability for scheduling transaction processing systems. In this report once the scheduling rule was chosen, various cost models were optimized using this rule. Simulation studies were also conducted using this rule. The results from this analysis indicates that this scheduling rule can be applied favorably to transaction processing systems. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1979
Accession Number
ADA068160

Entities

People

  • Daniel K. Wood

Organizations

  • Syracuse University

Tags

Communities of Interest

  • C4I
  • Energy and Power Technologies
  • Space

DTIC Thesaurus Topics

  • Algorithms
  • Application Software
  • Boundaries
  • Computer Programming
  • Computers
  • Cost Models
  • Costs
  • Databases
  • Equations
  • Information Science
  • Information Systems
  • Mathematical Programming
  • Operations Research
  • Optimization
  • Simplex Method
  • Simulations
  • Statistical Analysis

Fields of Study

  • Computer science

Readers

  • Computational Modeling and Simulation
  • Logistics and Supply Chain Management.