Parallel and Distributed Computing and Systems ~PDCS 2009~
Total Page：16
File Type：pdf, Size：1020Kb
The Twenty First IASTED International Conference on Parallel and Distributed Computing 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