Topic 13
Theory and Algorithms for Parallel Computation

Topic Description and Chairs
Session 13.1: Theory and Algorithms for Parallel Computation 1
Session 13.2: Theory and Algorithms for Parallel Computation 2

Session 13.1: Theory and Algorithms for Parallel Computation 1

Time Thursday, August 28, 2003, 09.00 - 10.30
Location HS 3
Chair Christos Kaklamanis
   
09.00 - 09.30 Minimizing Global Communication in Parallel List Ranking
    Jop F. Sibeyn
09.30 - 10.00 Construction of efficient communication sub-structures: Non-approximability results and polynomial sub-cases
    Christian Laforest
10.00 - 10.15 A Model of Pipelined Mutual Exclusion on Cache-Coherent Multiprocessors (Research Note)
    Masaru Takesue
10.15 - 10.30 c-Perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories (Research Note)
    G. Cordasco, A. Negro, V. Scarano, A. L. Rosenberg

Top

Session 13.2: Theory and Algorithms for Parallel Computation 2

Time Thursday, August 28, 2003, 11.00 - 11.45
Location HS 3
Chair Rainer Feldmann
   
11.00 - 11.30 Improving Communication Sensitive Parallel Radix Sort for Unbalanced Data
    Martin Schmollinger
11.30 - 11.45 Efficient Parallel Multiplication Algorithm for Large Integers (Research Note)
    V. Bunimov, M. Schimmler

Top