U
Umut A. Acar
Researcher at Carnegie Mellon University
Publications - 104
Citations - 3315
Umut A. Acar is an academic researcher from Carnegie Mellon University. The author has contributed to research in topics: Semantics (computer science) & Compiler. The author has an hindex of 29, co-authored 96 publications receiving 3152 citations. Previous affiliations of Umut A. Acar include French Institute for Research in Computer Science and Automation & Toyota Technological Institute at Chicago.
Papers
More filters
Proceedings ArticleDOI
Incoop: MapReduce for incremental computations
TL;DR: This paper describes the architecture, implementation, and evaluation of Incoop, a generic MapReduce framework for incremental computations that detects changes to the input and automatically updates the output by employing an efficient, fine-grained result reuse mechanism.
Proceedings ArticleDOI
The data locality of work stealing
TL;DR: The initial experiments on iterative data-parallel applications show that the work-stealing scheduling algorithm matches the performance of static-partitioning under traditional work loads but improves the performance up to 50% over static partitioning under multiprogrammed work loads and a locality-guided work stealing algorithm that improves the data locality of multi-threaded computations by allowing a thread to have an affinity for a processor.
Journal ArticleDOI
The Data Locality of Work Stealing
TL;DR: A locality-guided work-stealing algorithm that improves the data locality of multithreaded computations by allowing a thread to have an affinity for a processor and improves the performance of work stealing up to 80%.
Proceedings ArticleDOI
Scheduling parallel programs by work stealing with private deques
TL;DR: Two work-stealing algorithms with private deques are proposed and it is proved that the algorithms guarantee similar theoretical bounds as work stealing with concurrent deques, which enables implementing flexible task creation and distribution strategies.
Proceedings ArticleDOI
Adaptive functional programming
TL;DR: A general mechanism for adaptive computing that enables one to make any purely-functional program adaptive is proposed and it is shown that the mechanism is practical by giving an efficient implementation as a small ML library.