APDCM 2010 Program

Due to flight cancellation in Europe, almost half of the talks have been canceled. So, the schedule has been changed so that we have three sessions one in the morning and two in the afternoon.

• Keqin Li, Performance Analysis and Evaluation of Random Walk Algorithms on Wireless Networks
• Stephane Grumbach and Zhilin Wu, Distributed Tree Decomposition of Graphs and Applications to Verification
• Daniel Fajardo-Delgado and Jose Fernandez-Zepeda, RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES
• Wayne Goddard and Pradip Srimani, Self-Stabilizing Master Slave Token Circulation and Efficient Size-Computation in a Unidirectional Ring of Arbitrary Size
• Bharatkumar Sharma and Nagavijayalakshmi Vydyanathan, Parallel Discrete Wavelet Transform using the Open Computing Language: a performance and portability study

• Chen Wei, Miao Heh and Hong Liang, Cross Layer Design of Heterogeneous Virtual MIMO Radio Networks with Multi-Optimization
• Guoqiang Li, Xiaojuan Cai and Shoji Yuen, Modeling and Analysis of Real-Time Systems with Mutex Components
• Isaac Dooley and Laxmikant Kale, Detecting and Using Critical Paths at Runtime in Message Driven Parallel Programs
• Susumu Matsumae, Polylogarithmic Time Simulation of Reconfigurable Row/Column Buses by Static Buses

• Jian Shen, Yurong Chen and Yinlong Xu, Accelerating Mutual-Information-Based Registration on Multi-Core Systems

• Yasuaki Ito and Koji Nakano, Efficient Exhaustive Verification of the Collatz Conjecture using DSP48E blocks of Xilinx Virtex-5 FPGAs
• Jens Breitbart and Claudia Fohry, OpenCL – A viable programming model for data parallel computations at the Cell Broadband Engine?

All presentation will be of 20 minutes duration, which includes a 15-minute presentation and 5-minute question and discussion time.