NDLI: The peer tasking design method

Content Provider	IEEE Xplore Digital Library
Author	Howes, N.R. Wood, J.D. Goforth, A.
Copyright Year	1995
Description	Author affiliation: Inst. for Defense Anal., Alexandria, VA, USA (Howes, N.R.; Wood, J.D.)
Abstract	This paper is a preliminary report of an ARPA sponsored study. It focuses on designing real-time command and control or battle management systems for parallel and distributed architectures. Due to delays in other ARPA programs, the targeted architectures were not available during the time frame of the study. The results of the study were, however, tested on more conventional sequential and parallel platforms. The design method discussed here is fundamentally different from those assumed by current real-time scheduling theories, e.g., rate-monotonic, earliest-deadline-first, least-laxity or best-effort. These theories assume that the fundamental unit of prioritization is the task. In this new method, the fundamental unit of prioritization is called a work item. Work items are functions the system performs that have timing requirements (deadlines) associated with them in the requirements specification. Current scheduling theories are applied using artifact deadlines introduced by designers whereas this new method schedules work items to meet specification deadlines (sometimes called end-to-end deadlines) required by the user. With this method, tasks have no priorities. A collection of tasks with no priorities will be called a collection of peer tasks. The study showed that it is possible to schedule work items based on importance rather than urgency while still meeting as many work item deadlines as can be met by scheduling tasks with respect to urgency. Also, it showed that the minimum on-line deadline that can be guaranteed for a work item of highest importance, scheduled at run-time, is approximately the inverse of the throughput, measured in work items per second, for a work load consisting only of work items of that type. Further, it was shown that it provides optimal utilization of a single processor machine, and that its timing behavior is predictable (provable) for both single and multiprocessor machines. Finally, it was shown that throughput is not degraded during overload.
Starting Page	20
Ending Page	29
File Size	1145146
Page Count	10
File Format	PDF
ISBN	0818670991
DOI	10.1109/WPDRTS.1995.470511
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1995-04-25
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Design methodology Timing Throughput Peer to peer computing Real time systems Command and control systems Delay effects Sequential analysis Processor scheduling Runtime
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Libarray of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A scheduling technique for real-time systems with end-to-end timing constraints

Real-Time Control and Scheduling Co-Design for Efficient Jitter Handling

Automatic verification of real-time designs

Multiprocessor scheduling of periodic tasks in a hard real-time environment

A Method for Satisfying Asynchronous and Periodic Timing Requirements in Real-Time Embedded Systems

Inherently stable priority list scheduling in systems with external delays

Scheduling analysis of real-time systems with precise modeling of cache related preemption delay

Developing a real-time metaobject protocol

Timing analysis and conditional scheduling in a real-time system design environment

The peer tasking design method

Similar Documents

A scheduling technique for real-time systems with end-to-end timing constraints

Real-Time Control and Scheduling Co-Design for Efficient Jitter Handling

Automatic verification of real-time designs

Multiprocessor scheduling of periodic tasks in a hard real-time environment

A Method for Satisfying Asynchronous and Periodic Timing Requirements in Real-Time Embedded Systems

Inherently stable priority list scheduling in systems with external delays

Scheduling analysis of real-time systems with precise modeling of cache related preemption delay

Developing a real-time metaobject protocol

Timing analysis and conditional scheduling in a real-time system design environment

The peer tasking design method