Copyright Notice. The documents available from this site are provided as a means to ensure timely dissemination of technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder (ACM, IEEE, Springer-Verlag, Elsevier, Taylor & Francis, etc.). Permission to make digital or hard copies of part or all of these works for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage. The electronic version of some of the works available from this site may differ from the definitive published version. | |
- | Multicore Computing |
- | All |
- | External-Memory / Cache-Efficient / Cache-Oblivious |
- | Computational Biology / Bioinformatics |
- | Graph Algorithms |
- | Data Structures |
- | Compilers |
1. | Yuan Tang, Rezaul Alam Chowdhury, Bradley Kuszmaul, Chi-Keung Luk, and Charles Leiserson, "The Pochoir Parallel Stencil Compiler", To appear in the Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2011), San Jose, California, June 4-6, 2011. |
View: Abstract | |
Download: PS, PDF | |
2. | Yuan Tang, Rezaul Alam Chowdhury, Chi-Keung Luk, and Charles Leiserson, "Coding Stencil Computations Using the Pochoir Stencil-Specification Language", Proceedings of the 3rd USENIX Workshop on Hot Topics in Parallelism (HotPar 2011), Berkeley, California, May 26-27, 2011. |
View: Abstract | |
Download: PS, PDF | |
3. | Rezaul Alam Chowdhury, Francesco Silvestri, Brandon Blakeley, and Vijaya Ramachandran, "Oblivious Algorithms for Multicores and Network of Processors", 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2010), Atlanta, Georgia, April 19-23, 2010 (Best Paper Award in the Algorithms Track). |
View: Abstract | |
Download: PS, PDF | |
4. | Rezaul Alam Chowdhury and Vijaya Ramachandran, "Cache-efficient Dynamic Programming Algorithms for Multicores", Proceedings of the 20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2008), Munich, Germany, pp. 207-216, 2008. |
View: Abstract | |
Download: PS, PDF | |
5. | Guy Blelloch, Rezaul Alam Chowdhury, Phillip Gibbons, Vijaya Ramachandran, Shimin Chen, and Michael Kozuch, "Provably Good Multicore Cache Performance for Divide-and-Conquer Algorithms", Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), San Francisco, California, pp. 501-510, 2008. |
View: Abstract | |
Download: PS, PDF | |
1. | Rezaul Alam Chowdhury, Francesco Silvestri, Brandon Blakeley, and Vijaya Ramachandran, "Oblivious Algorithms for Multicores and Network of Processors", The University of Texas at Austin, Department of Computer Sciences, TR-09-19, July 2009, 40 pages. |
View: Abstract | |
Download: PS, PDF | |
2. | Rezaul Alam Chowdhury and Vijaya Ramachandran, "Cache-efficient Dynamic Programming Algorithms for Multicores", The University of Texas at Austin, Department of Computer Sciences, TR-08-16, Apr. 2008, 21 pages. |
View: Abstract | |
Download: PS, PDF |