Toward a multilevel scalable parallel Zielonka's algorithm for solving parity games

D’Amore, Luisa; Murano, Aniello; Sorrentino, L.; Arcucci, Rossella; Laccetti, Giuliano

doi:10.1002/cpe.6043

Cited by 3 publications

(1 citation statement)

References 56 publications

(114 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Reference 3, the authors perform the feasibility analysis of a multilevel parallel version of the Zielonka Recursive (ZR) algorithm exploiting the coarse and the fine‐grained concurrency. Coarse‐grained parallelism relies on a suitable graph decomposition based on its strongly connected components (SCC).…”

Section: Contents Of the Special Issuementioning

confidence: 99%

Special Issue on High‐end Heterogeneous Architectures, Methodologies, and Algorithms (HHAMA20)

Kosta

Laccetti

Lapegna

et al. 2020

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

We are experiencing painful months, and as we write this editorial, the COVID-19 pandemic is still ongoing, severely affecting the peoples of many researchers who participated in this special issue. Our first thought is for the victims of this tragedy. Despite the difficulties, we have worked hard to keep in touch with the authors of the manuscripts, the anonymous referees, and the journal staff, so now we are especially delighted to present this special issue High-end Heterogeneous Architectures, Methodologies, and Algorithms (HHAMA-20) hosted on the Concurrency and Computation: Practice and Experience journal. The special issue collects an extension of the most valuable works presented at the Fifth Workshop on Models, Algorithms and Methodologies for Hybrid Parallelism in New HPC Systems (MAMHYP-19), held in Bialystok (Poland) in September 2019, jointly with the 13th Conference on Parallel Processing and Applied Mathematics (PPAM-19). New original papers related to the workshop themes are also included. The final aim is to provide a glimpse of the current state of knowledge related to the development of efficient methodologies and algorithms for HPC systems with multiple forms of parallelism. 1 CONTENTS OF THE SPECIAL ISSUE In this special issue, we collected nine papers, selected from 13 works submitted from eight different countries, with an acceptance rate of about 70%. Each manuscript has been accepted after two or three review rounds. In the first round, each paper has been assigned to two external anonymous reviewers. To the doubtful cases (i.e., borderline papers or with diverging recommendations), the guest editors of the special issue have been given additional individual attention. Authors of papers selected in the first round have been asked to revise their work according to the reviewers' feedback and submit a revised manuscript for a second or third review. The papers cover a broad spectrum of topics, and they could be classified into two large categories:

show abstract

Section: Contents Of the Special Issuementioning

confidence: 99%

Special Issue on High‐end Heterogeneous Architectures, Methodologies, and Algorithms (HHAMA20)

Kosta

Laccetti

Lapegna

et al. 2020

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

show abstract

COVID-Prevention-Based Parking with Risk Factor Computation

Balzano

Stranieri

2021

Complex, Intelligent and Software Intensive Systems

View full text Add to dashboard Cite

A Matrix-Based Approach to Parity Games

Aggarwal

Banda

Yang

et al. 2023

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Parity games are two-player zero-sum games of infinite duration played on finite graphs for which no solution in polynomial time is still known. Solving a parity game is an $$\text{ NP }\cap \text{ co-NP }$$ NP ∩ co-NP problem, with the best worst-case complexity algorithms available in the literature running in quasi-polynomial time. Given the importance of parity games within automated formal verification, several practical solutions have been explored showing that considerably large parity games can be solved somewhat efficiently. Here, we propose a new approach to solving parity games guided by the efficient manipulation of a suitable matrix-based representation of the games. Our results show that a sequential implementation of our approach offers very competitive performance, while a parallel implementation using GPUs outperforms the current state-of-the-art techniques. Our study considers both real-world benchmarks of structured games as well as parity games randomly generated. We also show that our matrix-based approach retains the optimal complexity bounds of the best recursive algorithm to solve large parity games in practice.

show abstract

Toward a multilevel scalable parallel Zielonka's algorithm for solving parity games

Cited by 3 publications

References 56 publications

Special Issue on High‐end Heterogeneous Architectures, Methodologies, and Algorithms (HHAMA20)

Special Issue on High‐end Heterogeneous Architectures, Methodologies, and Algorithms (HHAMA20)

COVID-Prevention-Based Parking with Risk Factor Computation

A Matrix-Based Approach to Parity Games

Contact Info

Product

Resources

About