Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD courier 1 190 Ft Post 1 795 Ft Post 1 690 Ft Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft DPD point 990 Ft GLS courier 1 690 Ft GLS point 1 190 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Advanced Memory Data Structures for Scalable Event Trace Analysis

Name: Advanced Memory Data Structures for Scalable Event Trace Analysis
Brand: Südwestdeutscher Verlag für Hochschulschriften
SKU: 06986686
Price: 28304 HUF
Availability: InStock
Author: Andreas Knüpfer
ISBN: 9783838109435

Dissertation

Andreas Knüpfer

Language

German

Book Paperback

Libristo code: 06986686

Publishers Südwestdeutscher Verlag für Hochschulschriften, November 2008

This dissertation presents a novel approach for the analysis of event traces from parallel program r... Full description

Libristo code: 06986686

196 b

28 304 Ft

Print on demand Shipping in 17-27 days

Up to 30 days for returns

Customers also purchased

Long and Short: Stories from Ghana Teddy Totimeh

Paperback

2 560 Ft

Marcel et Monsieur Pagnol, la bande dessinée du film Sylvain Chomet

Paperback

10 030 Ft

The Story Of Laulii, A Daughter Of Samoa (1889) Laulii Willis

Paperback

11 576 Ft

bonne nuit HENRY MARIE H / MASUREL CLAIRE Book

Hardback

5 298 Ft

Pandora's Toolbox Wake Smith

Hardback

7 497 Ft

Sinan Akcil Piyanist 2 CD Demet Akalin

Audio CD

7 059 Ft

El culto a Juarez Rebeca Villalobos Alvarez

Adobe ePub DRM

3 851 Ft

A Knight Templar's Pilgrimage to the Holy Land Thomas W. Wilson Eureka Calif

Hardback

11 937 Ft

ANUARI MEDIA.CAT 2021

Paperback

7 392 Ft

Dinosaur that Pooped a Reindeer! Tom Fletcher

Paperback

3 080 Ft

Kabala be paslap?i? Michael Laitman

Paperback

4 673 Ft

Od pohádky k pohádce – Tlapková patrola 5

Hardback

2 925 Ft

Upon a Starlit Tide WOODS KELL

Hardback

8 058 Ft

Deň noc voda Mária Modrovich

Paperback

3 710 Ft

Graph Neural Network for Feature Extraction and Classification of Hyperspectral Remote Sensing Images Yao Ding

Hardback

56 011 Ft

Trains David Hawcock

Hardback

5 211 Ft

Starburst: The Art of Audra Auclair AUCLAIR AUDRA

Hardback

11 590 Ft

Landscapes of Genius and the Transatlantic Origins of Environmentalism Scott Hess

Hardback

45 306 Ft

Teaching Foundational Skills to Adolescent Readers Douglas Fisher

Adobe ePub DRM

13 096 Ft

Matematika 8 Geometrie Učebnice Helena Binterová

Paperback

274 Ft

Wisdom and Goodness of God, in the Vegetable Creation, Farther Considered. in a Third Sermon Preached at the Parish-Church of St. Anne's, Black-Fryars William Dodd

Paperback

4 878 Ft

Consumer Nation: The True Cost of Technology Mary Colson

Paperback

4 253 Ft

Peter Rabbit: Goes to the Island Activity Book - Ladybird Readers Level 1 Ladybird

Paperback

1 780 Ft

Judah Between East and West Lester L Grabbe

Hardback

77 704 Ft

This dissertation presents a novel approach for the analysis of event traces from parallel program runs. Event tracing is an established method for the analysis and optimization of performance and scalability of parallel and High Performance Computing (HPC) applications. The Complete Call Graph (CCG) data structure is introduced as an alternative in-memory representation for huge event traces. It exploits frequently found redundancies and provides customized data reduction in a combination of lossless and lossy compression. It achieves data compression by factors of ten to factors of hundred and requires no explicit decompression during the analysis. Furthermore, adapted evaluation procedures allow to reduce the computational effort in the same order of magnitude as the data compression. The thesis includes a comprehensive discussion of the state-of-the-art of event tracing and related work, a detailed presentation of the design of the CCG data structure, an elaborate description of the algorithms for construction, compression, and analysis of CCGs, and an extensive experimental validation of all components.