CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Knowledge based scheduling of distributed systems
Authors
Saddek Bensalem
Doron Peled
Joseph Sifakis
Publication date
14 March 2013
Publisher
'Springer Science and Business Media LLC'
Doi
Cite
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. © 2010 Springer-Verlag Berlin Heidelberg
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Infoscience - École polytechnique fédérale de Lausanne
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:infoscience.tind.io:185012
Last time updated on 09/02/2018