Priority scheduling of distributed systems based on model checking

Ananda Basu, Saddek Bensalem, Doron Peled, Joseph Sifakis

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

19 Scopus citations

Abstract

Priorities are used to control the execution of systems to meet given requirements for optimal use of resources, e.g., by using scheduling policies. For distributed systems, it is hard to find efficient implementations for priorities; because they express constraints on global states, their implementation may incur considerable overhead. Our method is based on performing model checking for knowledge properties. It allows identifying where the local information of a process is sufficient to schedule the execution of a high priority transition. As a result of the model checking, the program is transformed to react upon the knowledge it has at each point. The transformed version has no priorities, and uses the gathered information and its knowledge to limit the enabledness of transitions so that it matches or approximates the original specification of priorities.

Original languageEnglish
Title of host publicationComputer Aided Verification - 21st International Conference, CAV 2009, Proceedings
Pages79-93
Number of pages15
DOIs
StatePublished - 2009
Event21st International Conference on Computer Aided Verification, CAV 2009 - Grenoble, France
Duration: 26 Jun 20092 Jul 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5643 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference21st International Conference on Computer Aided Verification, CAV 2009
Country/TerritoryFrance
CityGrenoble
Period26/06/092/07/09

Fingerprint

Dive into the research topics of 'Priority scheduling of distributed systems based on model checking'. Together they form a unique fingerprint.

Cite this