Digital Symposium Collection 2000  

 
 
 
 
 
 

 
















S. Haldar

DataBlitz Storage Manager: Main Memory Database Performance for Critical Applications

Publications

Note: Links lead to the DBLP on the Web.

S. Haldar

11 Jerry Baulier , Philip Bohannon , S. Gogate , C. Gupta , S. Haldar, S. Joshi , A. Khivesera , Henry F. Korth , P. McIlroy , J. Miller , P. P. S. Narayan , M. Nemeth , Rajeev Rastogi , S. Seshadri , Abraham Silberschatz , S. Sudarshan , M. Wilder , C. Wei : DataBlitz Storage Manager: Main Memory Database Performance for Critical Applications. SIGMOD Conference 1999 : 519-520

10 S. Haldar: An `All Pairs Shortest Paths' Distributed Algorithm Using 2n² Messages. J. Algorithms 24 (1): 20-36 (1997)

9 S. Haldar, K. Vidyasankar : Space-Efficient Construction of Buffer-Optimal 1-Writer 1-Reader Multivalued Atomic Variable (Abstract). PODC 1996 : 178

8 S. Haldar, K. Vidyasankar : Simple Extensions of 1-writer Atomic Variable Constructions to Multiwriter Ones. Acta Informatica 33 (2): 177-202 (1996)

7 S. Haldar, K. Vidyasankar : Constructing 1-Writer Multireader Multivalued Atomic Variable from Regular Variables. JACM 42 (1): 186-203 (1995)

6 S. Haldar, P. S. Subramanian : Space-optimum Conflict-free Construction of 1-Writer 1-Reader Multivalued Atomic Variable. WDAG 1994 : 116-129

5 S. Haldar: An `All Pairs Shortest Path' Distributed Algorithm Using 2n² Messages. WG 1993 : 350-363

4 S. Haldar, K. Vidyasankar : Counteraxamples to a One Writer Multireader Atomic Variable Construction of Burns and Peterson. Operating Systems Review 26 (1): 78-88 (1992)

3 S. Haldar, D. K. Subramanian : Fairness in Processor Scheduling in Time Sharing Systems. Operating Systems Review 25 (1): 4-18 (1991)

2 S. Haldar, D. K. Subramanian : Ring Based Termination Detection Algorithm for Distributed Computations. IPL 29 (3): 149-153 (1988)

1 S. Haldar, D. K. Subramanian : An Efficient Solution to the Mutual Exclusion Problem Using Unfair and Weak Semaphore. Operating Systems Review 22 (2): 60-66 (1988)



























Copyright(C) 2000 ACM