Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Agrawal, Kunal - Department of Computer Science and Engineering, Washington University in St. Louis
Safe Open-Nested Transactions Through Ownership Kunal Agrawal I-Ting Angelina Lee Jim Sukha
Mapping linear workflows with computation/communication overlap
Nested Parallelism in Transactional Memory Kunal Agrawal Jeremy T. Fineman Jim Sukha
CSE241 Recitation 1 Handout 1 Preliminary
Recursive divide-and-conquer What is divide-and-conquer?
CSE241 Recitation 5 Handout 1.1 Hashing
CSE 241 Algorithms and Data Structures Finding Closest Pair
CSE 241 Algorithms and Data Structures Assigned: 02/16/2011 Due Date: 03/09/2011
An Empirical Evaluation of Work Stealing with Parallelism Feedback Kunal Agrawal Yuxiong He Charles E. Leiserson
The Worst Page-Replacement Policy Kunal Agrawal1
CSE241 Recitation 3 Handout 1. Insertion Sort. How does it work? In which cases, insertion sort has the best performance?
Executing Task Graphs Using Work-Stealing Kunal Agrawal
Adaptive Scheduling with Parallelism Feedback Kunal Agrawal Yuxiong He Wen Jing Hsu Charles E. Leiserson
Deadlock Avoidance for Streaming Computations with Filtering
Safe OpenNested Transactions Through Ownership Kunal Agrawal ITing Angelina Lee Jim Sukha
CSE 241 Algorithms and Data Structures Lab 3: Skip Lists
Memory Models for Open-Nested Transactions Kunal Agrawal Charles E. Leiserson Jim Sukha
Mapping Linear Workflows with Computation/Communication Overlap
CSE 241 Algorithms and Data Structures Lab 4: Graphs
Adaptive Work Stealing with Parallelism Feedback Kunal Agrawal Yuxiong He Charles E. Leiserson
Helper Locks for Fork-Join Parallel Programming Kunal Agrawal
I _____ L;'T= ----. --(]) ~ ~l+cA~~ ()-'\ 7--=-{\~v\&t-\ 0 .f\,
K~l+-oL+-16 f\. ;(jOk~o,,\l-IisY 0f t-o f-:C:; I -CS" 2.'-i ( lA+-ro~ot. +-~ S;'V; ~U"J I 1\
CSE 241 Algorithms and Data Structures Assigned: 03/07/2012 Due Date: 03/28/2012
CSE 241 Algorithms and Data Structures Closest Pair Algorithm
