Author image not provided
 Rahul Shrivastava

Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article0.00
Citation Count0
Publication count2
Publication years2017-2017
Available for download2
Average downloads per article83.50
Downloads (cumulative)167
Downloads (12 Months)167
Downloads (6 Weeks)52

See all colleagues of this author


2 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 2 of 2
Sort by:

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

Full text available: PDFPDF
Energy-efficient compilation is an important problem for multi-core systems. In this context, irregular programs with task-parallel loops  present interesting challenges: the threads with lesser work-loads ( non-critical -threads) wait at the join-points for the thread with maximum work-load ( critical -thread); this leads to significant energy wastage. This problem becomes ...
Keywords: multi-socket-multi-core systems, DVFS, Irregular task parallel programs

2 published by ACM
June 2017 ICS '17: Proceedings of the International Conference on Supercomputing
Publisher: ACM
Citation Count: 0
Downloads (6 Weeks): 25,   Downloads (12 Months): 127,   Downloads (Overall): 127

Full text available: PDFPDF
We present a new optimization DECAF that optimizes recursive task parallel (RTP) programs by reducing the task creation and termination overheads. DECAF reduces the task termination (join) operations by aggressively increasing the scope of join operations (in a semantics preserving way), and eliminating the redundant join operations discovered on the ...
Keywords: data parallel, recursive task parallel, useful parallelism

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