Parallel Algorithms for Mean-Payoff Games: An Experimental Evaluation
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F09%3A00029685" target="_blank" >RIV/00216224:14330/09:00029685 - isvavai.cz</a>
Alternative codes found
RIV/00216224:14330/09:00065865
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Parallel Algorithms for Mean-Payoff Games: An Experimental Evaluation
Original language description
Mean-payoff games (MPGs) have many applications, especially in the synthesis, analysis and verification of computer systems. Because of the size of these systems, there is a need to solve very large MPGs. Existing algorithms for solving MPGs are sequential, hence limited by the power of a single computer. In this paper, we propose several parallel algorithms based on the sequential ones. We also evaluate and compare the parallel algorithms experimentally.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F09%2F1389" target="_blank" >GA201/09/1389: Verification and Analysis of Large-Scale Computer Systems</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Algorithms - European Symposium on Algorithms (ESA) 2009
ISBN
978-3-642-04127-3
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
—
Publisher name
Springer Berlin / Heidelberg
Place of publication
Berlin
Event location
Kodaň
Event date
Jan 1, 2009
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
000279102100054