Author image not provided
 Andi Drebes

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article1.50
Citation Count6
Publication count4
Publication years2014-2017
Available for download4
Average downloads per article290.25
Downloads (cumulative)1,161
Downloads (12 Months)466
Downloads (6 Weeks)49
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author




BOOKMARK & SHARE


4 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 4 of 4
Sort by:

1 published by ACM
December 2017 ACM Transactions on Architecture and Code Optimization (TACO): Volume 14 Issue 4, December 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 26,   Downloads (12 Months): 28,   Downloads (Overall): 28

Full text available: PDFPDF
Collecting hardware event counts is essential to understanding program execution behavior. Contemporary systems offer few Performance Monitoring Counters (PMCs), thus only a small fraction of hardware events can be monitored simultaneously. We present new techniques to acquire counts for all available hardware events with high accuracy by multiplexing PMCs across ...
Keywords: Hardware event monitoring, hardware event multiplexing, performance monitoring counters, task-parallel performance analysis

2 published by ACM
September 2016 PACT '16: Proceedings of the 2016 International Conference on Parallel Architectures and Compilation
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 9,   Downloads (12 Months): 221,   Downloads (Overall): 357

Full text available: PDFPDF
Dynamic task-parallel programming models are popular on shared-memory systems, promising enhanced scalability, load balancing and locality. Yet these promises are undermined by non-uniform memory access (NUMA). We show that using NUMA-aware task and data placement, it is possible to preserve the uniform abstraction of both computing and memory resources for ...
Keywords: memory allocation, numa, scheduling, data-flow programming, task-parallel programming

3 published by ACM
February 2016 PPoPP '16: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 6,   Downloads (12 Months): 123,   Downloads (Overall): 316

Full text available: PDFPDF
Dynamic task parallelism is a popular programming model on shared-memory systems. Compared to data parallel loop-based concurrency, it promises enhanced scalability, load balancing and locality. These promises, however, are undermined by non-uniform memory access (NUMA) systems. We show that it is possible to preserve the uniform hardware abstraction of contemporary ...
Also published in:
November 2016  ACM SIGPLAN Notices - PPoPP '16: Volume 51 Issue 8, August 2016

4 published by ACM
August 2014 ACM Transactions on Architecture and Code Optimization (TACO): Volume 11 Issue 3, October 2014
Publisher: ACM
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 8,   Downloads (12 Months): 94,   Downloads (Overall): 460

Full text available: PDFPDF
We present a joint scheduling and memory allocation algorithm for efficient execution of task-parallel programs on non-uniform memory architecture (NUMA) systems. Task and data placement decisions are based on a static description of the memory hierarchy and on runtime information about intertask communication. Existing locality-aware scheduling strategies for fine-grained tasks ...
Keywords: dataflow programming, dynamic scheduling, weak memory model, lock-free algorithm, FIFO queue, Kahn process network, work stealing



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us