Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Federico Massaioli

dblp:30/2571 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%
Software engineering, system software, and programming languages
1 paper
Runtime systems and virtual machines · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel programming models › task parallelism
OpenMP tasking
0.112009
The Design of OpenMP Tasks · IEEE Trans. Parallel Distributed Syst. 2009
Parallel and multicore computing
parallel programming models
0.112009
The Design of OpenMP Tasks · IEEE Trans. Parallel Distributed Syst. 2009
Parallel and multicore computing › parallel programming models
task parallelism
0.112009
The Design of OpenMP Tasks · IEEE Trans. Parallel Distributed Syst. 2009
Runtime systems and virtual machines
parallel runtime systems
0.012009
The Design of OpenMP Tasks · IEEE Trans. Parallel Distributed Syst. 2009

Methods — techniques the papers use, named apart from their topics

task-based parallelism · 0.2
YearPublicationVenuePosition
2009 The Design of OpenMP Tasks
abstract
OpenMP has been very successful in exploiting structured parallelism in applications. With increasing application complexity, there is a growing need for addressing irregular parallelism in the presence of complicated control structures. This is evident in various efforts by the industry and research communities to provide a solution to this challenging problem. One of the primary goals of OpenMP 3.0 is to define a standard dialect to express and efficiently exploit unstructured parallelism. This paper presents the design of the OpenMP tasking model by members of the OpenMP 3.0 tasking sub-committee which was formed for this purpose. The paper summarizes the efforts of the sub-committee (spanning over two years) in designing, evaluating and seamlessly integrating the tasking model into the OpenMP specification. In this paper, we present the design goals and key features of the tasking model, including a rich set of examples and an in-depth discussion of the rationale behind various design choices. We compare a prototype implementation of the tasking model with existing models, and evaluate it on a wide range of applications. The comparison shows that the OpenMP tasking model provides expressiveness, flexibility, and huge potential for performance and scalability.
Eduard Ayguadé, Nawal Copty, Alejandro Duran, Jay P. Hoeflinger, Federico Massaioli, Xavier Teruel, Priya Unnikrishnan, Guansong Zhang
IEEE Trans. Parallel Distributed Syst.6
2005 OpenMP
Barbara M. Chapman, Federico Massaioli
Parallel Comput.2
2005 OpenMP parallelization of agent-based models
Federico Massaioli, Filippo Castiglione, Massimo Bernaschi
Parallel Comput.1