NDLI: Finitary fairness

Content Provider	IEEE Xplore Digital Library
Author	Alur, R. Henzinger, T.A.
Copyright Year	1994
Description	Author affiliation: AT&T Bell Labs., Murray Hill, NJ, USA (Alur, R.)
Abstract	Fairness is a mathematical abstraction: in a multiprogramming environment, fairness abstracts the details of admissible ("fair") schedulers; in a distributed environment, fairness abstracts the speeds of independent processors. We argue that the standard definition of fairness often is unnecessarily weak and can be replaced by the stronger, yet still abstract, notion of finitary fairness. While standard weak fairness requires that no enabled transition is postponed forever, finitary weak fairness requires that for every run of a system there is an unknown bound k such that no enabled transition is postponed more than k consecutive times. In general, the finitary restriction fin(F) of any given fairness assumption F is the union of all w-regular safety properties that are contained in F. The adequacy of the proposed abstraction is demonstrated in two ways. Suppose that we prove a program property under the assumption of finitary fairness. In a multiprogramming environment, the program then satisfies the property for all fair finite-state schedulers. In a distributed environment, the program then satisfies the property for all choices of lower and upper bounds on the speeds (or timings) of processors.
Starting Page	52
Ending Page	61
File Size	1071141
Page Count	10
File Format	PDF
ISBN	0818663103
DOI	10.1109/LICS.1994.316087
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1994-07-04
Publisher Place	France
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Processor scheduling Safety Abstracts Distributed computing Context Probability distribution Upper bound Timing Computer science Contracts
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 Library 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

Performance evaluation of local real-time schedulers

Finitary Fairness (1994)

Context-aware performance analysis for efficient embedded system design

Tight non-linear loop timing estimation

Analysis of Dynamic Heuristics for Workflow Scheduling on Grid Systems

WCET-Driven Cache-Aware Memory Content Selection

Real-time distributed computing

Real-time recursive procedures

Two lower bounds in asynchronous distributed computation

Finitary fairness

Similar Documents

Performance evaluation of local real-time schedulers

Finitary Fairness (1994)

Context-aware performance analysis for efficient embedded system design

Tight non-linear loop timing estimation

Analysis of Dynamic Heuristics for Workflow Scheduling on Grid Systems

WCET-Driven Cache-Aware Memory Content Selection

Real-time distributed computing

Real-time recursive procedures

Two lower bounds in asynchronous distributed computation

Finitary fairness