| 2008 |
|---|
| 9 | EE | Dibyendu 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 |
| 8 | EE | Dibyendu Das,
Madhavi Valluri,
Michael Wong,
Chris Cambly:
Speeding up STL Set/Map Usage in C++ Applications.
SIPEW 2008: 314-321 |
| 2006 |
|---|
| 7 | EE | Dibyendu Das:
Optimizing subroutines with optional parameters in F90 via function cloning.
SIGPLAN Notices 41(8): 21-28 (2006) |
| 2005 |
|---|
| 6 | EE | Dibyendu 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 |
|---|
| 5 | EE | Dibyendu Das:
Function inlining versus function cloning.
SIGPLAN Notices 38(4): 18-24 (2003) |
| 4 | EE | Dibyendu Das:
Function inlining versus function cloning.
SIGPLAN Notices 38(6): 23-29 (2003) |
| 1999 |
|---|
| 3 | | Prashanti Das,
Dibyendu Das,
Pallab Dasgupta:
Adaptive Algorithms for Scheduling Static Task Graphs in Dynamic Distributed Systems.
HiPC 1999: 143-150 |
| 1998 |
|---|
| 2 | EE | Dibyendu Das:
Using Alternative Schedules for Fault Tolerance in Parallel Programs on a Network of Workstations.
Euro-Par 1998: 401-404 |
| 1 | | 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) |
