dblp.uni-trier.dewww.uni-trier.de

Dibyendu Das Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2008
10EEDibyendu Das, Manish Gupta, Rajan Ravindran, W. Shivani, P. Sivakeshava, Rishabh Uppal: Compiler-controlled extraction of computation-communication overlap in MPI applications. IPDPS 2008: 1-8
9EEDibyendu Das, Madhavi Valluri, Michael Wong, Chris Cambly: Speeding up STL Set/Map Usage in C++ Applications. SIPEW 2008: 314-321
2006
8EEDibyendu Das: Optimizing subroutines with optional parameters in F90 via function cloning. SIGPLAN Notices 41(8): 21-28 (2006)
2005
7EEDibyendu Das, U. Ramakrishna: A practical and fast iterative algorithm for phi-function computation using DJ graphs. ACM Trans. Program. Lang. Syst. 27(3): 426-440 (2005)
2003
6EEDibyendu Das: Function inlining versus function cloning. SIGPLAN Notices 38(4): 18-24 (2003)
5EEDibyendu Das: Function inlining versus function cloning. SIGPLAN Notices 38(6): 23-29 (2003)
1999
4 Prashanti Das, Dibyendu Das, Pallab Dasgupta: Adaptive Algorithms for Scheduling Static Task Graphs in Dynamic Distributed Systems. HiPC 1999: 143-150
1998
3EEDibyendu Das: Using Alternative Schedules for Fault Tolerance in Parallel Programs on a Network of Workstations. Euro-Par 1998: 401-404
2 Dibyendu Das, Pallab Dasgupta, Prashanti Das: A Heuristic for the Maximum Processor Requirement for Scheduling Layered Task Graphs with Coloring. J. Parallel Distrib. Comput. 49(2): 169-181 (1998)
1EEDibyendu Das, P. P. Das: PACWON: A parallelizing compiler for workstations on a network. Journal of Systems Architecture 45(2): 157-176 (1998)

Coauthor Index

1Chris Cambly [9]
2P. P. Das [1]
3Prashanti Das [2] [4]
4Pallab Dasgupta [2] [4]
5Manish Gupta [10]
6U. Ramakrishna [7]
7Rajan Ravindran [10]
8W. Shivani [10]
9P. Sivakeshava [10]
10Rishabh Uppal [10]
11Madhavi Valluri [9]
12Michael Wong [9]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)