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.

Guenter Kickinger

dblp:02/6421 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none

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

Systems, architecture and hardware · 1

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
High-performance computing · 41% Distributed systems · 18% Parallel and multicore computing · 18%

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

TopicWeightPapersLastEvidence papers
High-performance computing
cluster computing
0.112006
PROOF - The Parallel ROOT Facility · HPDC 2006
High-performance computing › performance optimization
data access optimization
0.112006
PROOF - The Parallel ROOT Facility · HPDC 2006
Distributed systems › distributed data processing
distributed data analytics
0.112006
PROOF - The Parallel ROOT Facility · HPDC 2006
Parallel and multicore computing › parallel computing
parallel data processing
0.112006
PROOF - The Parallel ROOT Facility · HPDC 2006
Electronic design automation › high-level synthesis
scheduling
0.112006
PROOF - The Parallel ROOT Facility · HPDC 2006
Storage systems
distributed storage
0.012006
PROOF - The Parallel ROOT Facility · HPDC 2006
High-performance computing › cluster computing
heterogeneous clusters
0.012006
PROOF - The Parallel ROOT Facility · HPDC 2006

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

multi-tier architecture · 0.1i/o optimization · 0.1
YearPublicationVenuePosition
2006 PROOF - The Parallel ROOT Facility
abstract
The parallel ROOT facility, PROOF, enables the interactive analysis of distributed data sets in a transparent way. It exploits the inherent parallelism in data sets of uncorrelated events via a multi-tier architecture that optimizes I/O and CPU utilization in heterogeneous clusters with distributed storage. On a grid, PROOF can use the available services to find out the location of data to analyze and the resources to use. Dedicated PROOF-enabled test-beds are now being deployed for testing by the LHC experiments. Being part of the ROOT framework PROOF inherits the benefits of a high performance object-oriented storage system and a wealth of statistical and visualization tools. The basic ideas and architecture underlying the PROOF project are described, together with the status of the project, focusing mostly on the issues of data access optimization, scheduling of user sessions and user interface
Bertrand Bellenot, Rene Brun, Gerardo Ganis, Jan Iwaszkiewicz, Guenter Kickinger, Andreas J. Peters, Fons Rademakers, Maarten Ballintijn, C. Loizides, C. Reed, Philippe Canal, Derek Feichtinger
HPDC5