The Twenty First IASTED International Conference on Parallel and and Systems ~PDCS 2009~

Cambridge, Massachusetts, USA November 2 – 4, 2009

PRELIMINARY CONFERENCE PROGRAM

LOCATION Le Méridien Cambridge - MIT 20 Sidney Street Cambridge, MA 02139 USA

Parallel and Distributed Computing and Systems ~PDCS 2009~

SPONSOR The International Association of Science and Technology for Development (IASTED)

CONFERENCE CHAIR Dr. Teofilo Gonzalez – UC Santa Barbara, USA

KEYNOTE SPEAKERS Prof. Charles E. Leiserson – MIT Computer Science and Artificial Intelligence Laboratory, USA

Prof. Nancy Lynch – Massachusetts Institute of Technology, USA

TUTORIAL CHAIR Prof. Serge Chaumette – LaBRI, University Bordeaux 1, France

PLEASE NOTE

 Paper presentations are 15 minutes in length with an additional 5 minutes for questions.  Report to your Session Chair 15 minutes before the session is scheduled to begin.  Presentations should be loaded onto the presentation laptop in the appropriate room prior to your session.  End times of sessions vary depending on the number of papers scheduled.

1 INTERNATIONAL PROGRAM COMMITTEE

I. Ahmad – University of G. A. Gravvanis – Texas, Arlington, USA Democritus University of H. Ali – University of Thrace, Greece Nebraska at Omaha, USA D. Grosu – Wayne State B. O. Apduhan – Kyushu University, USA Sangyo University, Japan K. Hawick – Massey T. Baba – Utsunomiya University , New Zealand University, Japan H. Higaki – Tokyo Denki M. Cannataro – University University, Japan "Magna Græcia" of U. Hönig – University of Catanzaro, Italy Hagen, Germany P. Cappello – University of S. H. Hosseini – University California, Santa Barbara, of Wisconsin-Milwaukee, USA USA J. L. Chen – National D. Houatra – Orange Labs, Taiwan University of France Science & Technology, H. Jin – Huazhong Taiwan University of Science and P. J. Chuang – Tamkang Technology, PR China University, Taiwan H. D. Karatza – Aristotle G. Cong – IBM Research, University of Thessaloniki, USA Greece A. Córdoba Izaguirre – M. Kucera – University of Public University of Applied Sciences Navarra, Spain Regensburg, Germany A. Datta – University of K. Li – State University of Western Australia, New York, USA Australia K. C. Li – Providence F. F. de Vega – Centro University, Taiwan Universitario de Mérida, E. D. Moreno – Federal Spain University of Sergipe, E. Dekel – IBM Haifa Aracaju - Brazil, Brazil Research Lab., Israel T. O'Neil – University of E. D'Hollander – University Akron, USA of Ghent, Belgium J. Park – Boston University, M. J. Dominguez-Alda – USA University of Alcala, Spain L. Peng – Louisiana State M. Fernandez de Sevilla – University, USA University of Alcala, Spain M. Qiu – University of New Orleans, USA

2 J. Sang – Cleveland State Y. Zhu – University of University, USA Maine, USA E. Schikuta – University of Vienna, Austria Additional Paper D. C. Schmidt – Vanderbilt Reviewers University, USA D. Serpanos – University of F. Al-Hawari – Patras, Greece Northeastern University, R. Shankaran – Macquarie USA University, Australia K. Brzezinski – Warsaw H. Shen – University of University of Technology, Adelaide, Australia Poland H. Shi – University of L. Duan – LSU, USA Missouri-Columbia, USA J. Keller – Fern University, A. Sodan – University of Germany Windsor, Canada G. Khanna – University of E. G. Talbi – University of Massachusetts Dartmouth, Lille, France USA P. Trunfio – University of H. Lu – La Trobe Calabria, Italy University, Australia S. Venkatesan – University K. Ohno – Mie University, of Texas at Dallas, USA Japan L. Wang – Rochester R. Palaniappan – Institute of Technology, University of Central USA Florida, USA C. Wills – Worcester A. Sulistio – Hochschule Polytechnic Institute, USA Furtwangen University, Y. Wiseman – The Open Germany University, Israel Y. Wang – University of X. Wu – Texas A&M Alberta, Canada University, USA Y. Zhang – LSu, USA C. T. Yang – Tunghai S. Q. Zheng – The University, Taiwan University of Texas at L. T. Yang – St. Francis Dallas, USA Xavier University, Canada

3 PROGRAM OVERVIEW

Monday, November 2, 2009 Tuesday, November 3, 2009

07:00 – Registration 09:00 – Session 5 – Grid and Cloud (Social Foyer) Computing (Hunsaker B Room) 08:15 – Joint PDCS & SEA Welcome 08:30 Address 10:00 – Coffee Break (Hunsaker B Room) 10:30 (Social Foyer)

09:00 – PDCS Keynote Speaker – 10:30 – Session 5 Continued ‖Cilk++‖ – Prof. Charles E. Leiserson 11:30 – Lunch Break (Hunsaker B Room) (Self-Catered)

10:00 – Coffee Break 13:00 – Session 3 – Fault Tolerance 10:30 (Social Foyer) and Network Performance and Multicore Systems 10:30 – Session 7 – Wireless and (Hunsaker B Room) Mobile Networks (Hunsaker B Room) 13:00 – Session 2 – Network Security (MacVicar Room) 12:30 – Lunch Break (Self-Catered) 15:00 – Coffee Break 15:30 (Social Foyer) 13:30 – PDCS Keynote Speaker – ―Abstract MAC Layers‖ – 15:30 – Session 8 – Applications and Prof. Nancy Lynch Tools (Hunsaker B Room) (Hunsaker B Room)

15:00 – Coffee Break 19:30 – Dinner Banquet 15:30 (Social Foyer) (Hunsaker Room)

15:30 – Session 1– Distributed Computing (Hunsaker B Room)

4 Wednesday, November 4, 2009

08:30 – Session 4 – Miscellaneous (Hunsaker B Room)

10:00 – Coffee Break 10:30 (Social Foyer)

10:30 – Session 4 Continued

12:00 – Lunch Break (Self-Catered)

13:30 – Session 6 – Distributed Computing and FPGA and GPU Processing (Hunsaker B Room)

15:00 – Coffee Break 15:30 (Social Foyer)

15:30 – Session 6 Continued

5 Monday, November 2, "hyperobjects," which allow 2009 races on nonlocal variables to be mitigated without lock 07:00 – REGISTRATION contention or restructuring of Location: Social Foyer code. This talk overviews the Cilk++ technology. 08:15 – 08:30 – JOINT PDCS & SEA WELCOME ADDRESS Cilk++ is owned by Intel Location: Hunsaker B Room Corporation, and Professor Leiserson is a Cilk++ paid Intel 09:00 – PDCS KEYNOTE – consultant. “Clik++” Presenter: Prof. Charles E. Prof. Charles E. Leiserson is a Leiserson Professor of Computer Science Location: Hunsaker B Room and Engineering in MIT's Department of Electrical Cilk++ is a small set of linguistic Engineering and Computer extensions to C++ focused on Science (EECS). He is a member Cilk++ making the of MIT's Computer Science and programming of multicore Artificial Intelligence computers easier. Like its Laboratory (CSAIL), a member progenitor Cilk, which was of the Lab's Theory of developed at MIT, Cilk++ Computation Group (TOC), and allows applications to be head of its Supercomputing multithreaded by embedding a Technologies Group handful of keywords in the (SuperTech). Professor program source. The Cilk++ Leiserson is currently on leave compiler and runtime platform from MIT at Cilk Arts, a work together to offer provably venture-backed start-up which good performance. The is commercializing the Cilk Cilkscreen race detector technology he developed at guarantees to find race bugs in MIT. Professor Leiserson is an ostensibly deterministic ACM Fellow. executions, thereby ensuring software reliability. The 10:00 – 10:30 – COFFEE BREAK Cilkview scalability analyzer Location: Social Foyer extrapolates application performance to large systems. To cope with legacy codes containing global variables, Cilk++ supports reducer

6 10:30 – SESSION 7 – 668-055 WIRELESS AND MOBILE Cost Performance Analysis in NETWORKS Parallel Computing Networks Chair: tba with Divisible Load Scheduling Location: Hunsaker B Room K. Choi and T.G. Robertazzi (USA) 668-079 Wireless Multihop 12:30 – LUNCH BREAK Communication with Pair of (Self-Catered) Uni-Directional Multihop Routes in Wireless Access 13:30 – PDCS KEYNOTE – Networks “ABSTRACT MAC LAYERS” S. Kushiya and H. Higaki (Japan) Presenter: Prof. Nancy Lynch Location: Hunsaker B Room 668-078 High Throughput and Highly In this talk, I will describe recent Reliable Wireless Multihop work that uses Abstract MAC Transmissions in MANET Layers to develop and analyze M. Kosugi and H. Higaki (Japan) algorithms for wireless networks. These algorithms are 668-014 intended to run in networks A Programming Model for with local radio broadcast High-Performance Adaptive communication, with a variety Applications on Pervasive of possible signal characteristics. Mobile Grids C. Bertolli, D. Buono, S. Lametti, Current work on wireless G. Mencagli, M. Meneghin, network algorithms is A. Pasucci, and M. Vanneschi complicated by a diversity of (Italy) low-level communication assumptions, including 668-028 assumptions about message Movement Aware Routing for collisions and other forms of VANETs interference, and about how the C. Wu and T. Kato (Japan) success of message delivery 668-010 depends on geographical Multi-Path Position-based distance. It is hard to Routing in Mobile Ad-Hoc understand how the results Networks depend on the particular K. Day (Oman), S. Harous (UAE), communication assumptions. B. Arafeh, and A. Touzene (Oman) Moreover, many algorithms use similar techniques to deal with the same network difficulties.

7 The result has been a rather Newport. Other collaborators complicated theory. on related projects include Alex Cornejo, Majid habbazian, To simplify matters, we propose Darek Kowalski, Saira Viqar, using Abstract MAC Layers to and Jennifer Welch. mask some of the complexities of the underlying networks. For Prof. Nancy Lynch is the NEC example, we have defined a Professor of Software Science layer that provides reliable local and Engineering in the broadcast communication, with Department of Electrical timing guarantees stated in Engineering and Computer terms of abstract delay Science at MIT. She heads the functions of the local Theory of Distributed Systems contention. We have developed research group in MIT’s and analyzed two algorithms Computer Science and Artificial over this layer for the important Intelligence Laboratory. Prior to problem of Multi-Message joining MIT in 1981, she served Broadcast— a simple greedy on the mathematics faculty at algorithm and one that uses Tufts University, the University regional leaders. The second of of Southern California, and these algorithms extends to Florida International University, mobile networks. and then on the information and computer science faculty at In work in progress, we are . She received her demonstrating how our B.S. degree in mathematics from Abstract MAC Layer can be Brooklyn College in 1968, and implemented using existing her PhD in mathematics from methods of probabilistic decay MIT in 1972. and network coding. We are showing how one can use such Prof. Lynch has written layers to split existing numerous research articles algorithms and their analysis about distributed algorithms into smaller pieces. And, we are and impossibility results, and showing how our layer can be about formal modeling and used to solve other problems, verification of distributed such as implementing a popular systems. Her best-known dynamic graph model. research contribution is the ―FLP‖ impossibility result for The basic Abstract MAC Layer distributed consensus in the was developed jointly with presence of process failures, Fabian Kuhn and Calvin developed with Fischer and Paterson; their paper, entitled

8 ―Impossibility of Distributed 15:00 – SESSION 1 – Consensus with One Faulty DISTRIBUTED COMPUTING Process‖ won the 2001 Dijkstra Chairs: tba Prize (also known as the PODC Location: Hunsaker B Room Influential Paper Award). A subsequent paper with Dwork 668-036 and Stockmeyer, entitled Distributed Algorithms for ―Consensus in the Presence of Computing Alternate Paths Partial Synchrony‖, presented Avoiding Failed Nodes and an approach to circumventing Links the FLP impossibility result; this A.M. Bhosle and T.F. Gonzalez won the 2007 . (USA) Lynch’s other well-known research contributions include 668-020 the I/O automata mathematical Design and Evaluation of a system modeling frameworks, User-Oriented Availability with Tuttle, Vaandrager, Segala, Benchmark for Distributed File and Kaynar. Her recent work is Systems focused on algorithms for X. Chen, J. Langston, X. He, and mobile ad hoc networks. S. Scott (USA) 668-066 Prof. Lynch has written three Distributed Heterogeneous books: on ―Atomic Hashing and Deterministic Transactions‖ (with Merritt, Dynamical Decompositions Weihl, and Fekete), on D. Deveci, M. Kortenjan, and ―Distributed Algorithms‖, and G. Schomaker (Germany) on ―The Theory of Timed I/O Automata‖ (with Kaynar, 668-025 Segala, and Vaandrager). She is Processing Transactions with an ACM Fellow, a member of Greater Accuracy and the National Academy of Availability in COPAR Engineering, a co-winner of the S. Beharry, M. Hosein (Trinidad first van Wijngaarden prize and Tobago), S. Hartley, and (2006), and the winner of the J.M. Crichlow (USA) 2007 and the 2009 IEEE Piore Award.

15:00 – 15:30 – COFFEE BREAK Location: Social Foyer

9 668-032 Tuesday, November 3, 2009 GPRIDE - A Generalized Priority-based Distributed Floor 09:00 – SESSION 5 – GRID Control Protocol for AND CLOUD COMPUTING Collaborative Applications Chairs: tba S.M. Banik and T.-H. Chang Location: Hunsaker B Room (USA) 668-060 668-022 Adaptive Grid Computing for Toward the Marriage of XML MPI Applications and Mobile Agents: Utilizing J. Zhang and W. Meleis (USA) XML-RPC as a Migration Media K. Meguro, S. Motomura, T. 668-076 Kawamura, and K. Sugahara Grid Authentication and (Japan) Authorization based on Role Translation and Delegation S. Tang and S. Shen (PRC)

668-059 A History-based Heuristic to Optimize Data Access in Distributed Environments R. Porfirio Ishii and R. Fernandes de Mello (Brazil)

668-035 Shared Workspaces: A Concept for Implementing a Distributed eScience-Environment in Grid- and Cloud-based Infrastructures U. Hönig and W. Schiffmann (Germany)

668-080 Design and Implementation of ITcell System: Towards the Next-Generation Data Center for Cloud Computing S. Shigeta, A. Savva, Y. Imai, T. Yoshida, and K. Fukui (Japan)

10 668-071 668-077 Evaluating I/O Isolation of Topologically Adaptive Parallel Virtual Machines in OpenVZ Breadth-First Search on F. Westphal, A. Sulistio, and Multicore Processors C. Reich (Germany) Y. Xia and V.K. Prasanna (USA)

10:00 – 10:30 – COFFEE BREAK 668-049 Location: Social Foyer An Exploration of CUDA and CBEA for a Gravitational Wave 10:30 – SESSION 5 Source-Modelling Application CONTINUED G. Khanna and J. McKennon (USA) 11:30 – LUNCH BREAK Self-Catered 668-018 Highly Parallel Multi- 13:00 – SESSION 3 – FAULT Dimensional Fast Fourier TOLERANCE AND Transform on Fine- and Coarse- NETWORK PERFORMANCE Grained Many-Core AND MULTICORE SYSTEMS Approaches Chair: tba A. Beliz Saybasili (USA and Location: Hunsaker B Room Turkey), A. Tzannes, B.R. Brooks, and U. Vishkin (USA) 668-009

Performance and Reliability 13:00 – SESSION 2 – Evaluations on Stochastic NETWORK SECURITY Activity Networks Chairs: tba H.-y. Tu (USA) Location: MacVicar Room

668-012 668-023 Pancyclicity in Faulty k-ary 2- OnePort RMI: RMI Protecting Cubes Integrity and Confidentiality for Y. Xiang and I.A. Stewart (UK) Mobile Agents K. Meguro, S. Motomura, T. 668-013 Kawamura, and K. Sugahara On the Surface Area of the (Japan) Alternating Group Networks E. Cheng (USA), K. Qiu (Canada), 668-011 and Z. Shen (USA) Para-Snort: A Multi-Thread Snort on Multi-Core IA

Platform X. Chen, Y. Wu, L. Xu, Y. Xue,

and J. Li (PRC)

11 668-037 668-053 Authentication and Access Efficient Implementation of Air Control QoSS (Quality of Traffic Control using the Security Service) for NoC-based Clearspeed CSX600 System Systems M. Yuan, J.W. Baker, F. Drews, M.J. Sepúlveda, R. Pires, and W. Meilander (USA) M. Strum, and W.J. Chau (Brazil) 668-026 668-074 Bypass Method based on Performance of an Intrusion- Neighbor Node Determination Tolerant Gossip Protocol Algorithm for Automatic K.P. Kihlstrom and R.S. Elliott Human Tracking System (USA) H. Kakiuchi, S. Iwasaki, T. Kawamura, and K. Sugahara 668-064 (Japan) An Analysis of Threshold- Sensitive Routing Protocol in 668-031 Wireless Sensor Networks Network Performance D. Choi and I. Chung (Korea) Evaluation in a Web Browser A. Janc, C. Wills, and M. Claypool 15:00 – 15:30 – COFFEE BREAK (USA) Location: Social Foyer 668-063 15:30 – SESSION 8 – Shallow Ontology based Deep APPLICATIONS AND TOOLS Web Probing Chairs: tba H. Lu and O.O. Maruatona Location: Hunsaker B Room (Australia)

668-033 668-019 Parallel Implementation of the Cache-based Bounds Checking Implicitly Restarted for Multi-Threaded C Programs Arnoldi/Lanczos Method Y. Arahori, K. Gondow, and G.O. Ainsworth Jr., F.L.B. Ribeiro, H. Maejima (Japan) and C. Magluta (Brazil) 19:30 – DINNER BANQUET 668-044 Location: Hunsaker Room Automatic Speech Recognition Front-End Implemented by Means of Algorithmic Skeletons and Partial Reconfiguration N. Montealegre and V. Kataev (Germany)

12 Wednesday, November 4, 668-016 2009 Dynamic P2P Topology Management for Scalable H.264 08:30 – SESSION 4 - Multiple-Description Coded MISCELLANEOUS Video Streaming Chairs: tba C.-M. Huang, C.-C. Yang, and Location: Hunsaker B Room C.-H. Chang (Taiwan)

668-043 668-800 Real-Time Computation of Smart and Scalable Point-to-Multipoint Routes in Communications between Optical Networks for Digital Dynamic Entities Television A. Nurminen (Finland) R. Messmer (Austria) and J. Keller (Germany) 668-069 An Adaptive Scheduling 668-073 Scheme for Large-Scale Improved Algorithms for Workflows on Heterogeneous Constructing Hypercube SP- Environments Multicasting Trees K. Ohno, M. Matsumoto, C.C. Cipriano and T.F. Gonzalez T. Sasaki, T. Kondo, and (USA) H. Nakashima (Japan)

668-021 668-034 Partitioning Strategies: A Data Flow Implementation of Spatiotemporal Patterns of Agent-based Distributed Graph Program Decomposition Search H. Hoffmann, A. Agarwal, and I. Hamchi, M. Hoarau, S. Devadas (USA) A. Fillinger, N. Crouzier, L. Diduch, M. Michel, V. Stanford 668-056 (USA) Applying Source-Address- based NAT for IPsec NAT 10:00 – 10:30 – COFFEE BREAK Traversal: PtoP IPsec with NAT Location: Social Foyer Router M. Katsunori and K. Toshihiko 10:30 – SESSION 4 (Japan) CONTINUED

12:30 – LUNCH BREAK (Self-Catered)

13 13:30 – SESSION 6 – 668-057 DISTRIBUTED COMPUTING A Highly Parallel GPU-based AND FPGA AND GPU Hash Accelerator for a Data PROCESSING Deduplication System Chairs: tba X. Li and D.J. Lilja (USA) Location: Hunsaker B Room 668-075 668-038 Automatically Generating Analyzing the Number of Slow Streaming Architectures from Reads for Semifast Atomic Ordinary Programs Read/Write Register L. Gao, G. Mittal, D. Zaretsky, Implementations D. Schonfeld, and P. Banerjee C. Georgiou (Cyprus), S. Kentros, (USA) N. Nicolaou, and A.A. Shvartsman (USA) 668-024 A Scalable Pipeline Architecture 668-072 for Line Rate Packet 3f-Eventual Timeliness is Classification on FPGAs Enough for Consensus of J.M. Wagner, W. Jiang, and Resilience f V.K. Prasanna (USA) X. Liu and J. Pu (PRC)

15:00 – 15:30 – COFFEE BREAK 668-017 Location: Social Foyer A New Protocol to Optimize the

Degree of Concurrency in 15:30 – SESSION 6 Object-Oriented Databases CONTINUED D. Saha and J. Morrissey (Canada) 668-027 Implementation and Evaluation of Self-Organizing Map ******************************* Algorithm on a Graphic IASTED would like to thank Processor you for attending PDCS 2009. A. Shitara, Y. Nishikawa, Your participation helped M. Yoshimi, and H. Amano make this international event a (Japan) success and we look forward to seeing you at upcoming 668-065 IASTED events. Parallel Transient Simulator by ************************************* GPU using CUDA Y. Isoda, M. Yokota, I. Taniguchi, and M. Fukui (Japan)

14