Lecture Notes in Computer Science Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen
Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen University of Dortmund, Germany Madhu Sudan Massachusetts Institute of Technology, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max-Planck Institute of Computer Science, Saarbruecken, Germany
5101
Marian Bubak Geert Dick van Albada Jack Dongarra Peter M.A. Sloot (Eds.)
Computational Science – ICCS 2008 8th International Conference Kraków, Poland, June 23-25, 2008 Proceedings, Part I
13
Volume Editors Marian Bubak AGH University of Science and Technology Institute of Computer Science and Academic Computer Center CYFRONET 30-950 Kraków, Poland E-mail:
[email protected] Geert Dick van Albada Peter M.A. Sloot University of Amsterdam Section Computational Science 1098 SJ Amsterdam, The Netherlands E-mail: {dick,sloot}@science.uva.nl Jack Dongarra University of Tennessee Computer Science Department Knoxville, TN 37996, USA E-mail:
[email protected]
Library of Congress Control Number: 2008928939 CR Subject Classification (1998): F, D, G, H, I, J, C.2-3 LNCS Sublibrary: SL 1 – Theoretical Computer Science and General Issues ISSN ISBN-10 ISBN-13
0302-9743 3-540-69383-1 Springer Berlin Heidelberg New York 978-3-540-69383-3 Springer Berlin Heidelberg New York
This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. Springer is a part of Springer Science+Business Media springer.com © Springer-Verlag Berlin Heidelberg 2008 Printed in Germany Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper SPIN: 12279241 06/3180 543210
Advancing Science Through Computation
I knock at the stone’s front door. “It’s only me, let me come in. I’ve come out of pure curiosity. Only life can quench it. I mean to stroll through your palace, then go calling on a leaf, a drop of water. I don’t have much time. My mortality should touch you.” Wislawa Szymborska, Conversation with a Stone, in Nothing Twice, 1997 The International Conference on Computational Science (ICCS 2008) held in Krak´ ow, Poland, June 23–25, 2008, was the eighth in the series of highly successful conferences: ICCS 2007 in Beijing, China; ICCS 2006 in Reading, UK; ICCS 2005 in Atlanta; ICCS 2004 in Krakow, Poland; ICCS 2003 held simultaneously in Melbourne, Australia and St. Petersburg, Russia; ICCS 2002 in Amsterdam, The Netherlands; and ICCS 2001 in San Francisco, USA. The theme for ICCS 2008 was “Advancing Science Through Computation,” to mark several decades of progress in computational science theory and practice, leading to greatly improved applications in science. This conference was a unique event focusing on recent developments in novel methods and modeling of complex systems for diverse areas of science, scalable scientific algorithms, advanced software tools, computational grids, advanced numerical methods, and novel application areas where the above novel models, algorithms, and tools can be efficiently applied, such as physical systems, computational and systems biology, environment, finance, and others. ICCS 2008 was also meant as a forum for scientists working in mathematics and computer science as the basic computing disciplines and application areas, who are interested in advanced computational methods for physics, chemistry, life sciences, and engineering. The main objective of this conference was to discuss problems and solutions in all areas, to identify new issues, to shape future directions of research, and to help users apply various advanced computational techniques. During previous editions of ICCS, the goal was to build a computational science community; the main challenge in this edition was ensuring very high quality of scientific results presented at the meeting and published in the proceedings. Keynote lectures were delivered by: – Maria E. Orlowska: Intrinsic Limitations in Context Modeling – Jesus Villasante: EU Research in Software and Services: Activities and Priorities in FP7 – Stefan Bl¨ ugel: Computational Materials Science at the Cutting Edge
VI
Preface
– Martin Walker: New Paradigms for Computational Science – Yong Shi: Multiple Criteria Mathematical Programming and Data Mining – Hank Childs: Why Petascale Visualization and Analysis Will Change the Rules – Fabrizio Gagliardi: HPC Opportunities and Challenges in e-Science – Pawel Gepner: Intel’s Technology Vision and Products for HPC – Jarek Nieplocha: Integrated Data and Task Management for Scientific Applications – Neil F. Johnson: What Do Financial Markets, World of Warcraft, and the War in Iraq, all Have in Common? Computational Insights into Human Crowd Dynamics We would like to thank all keynote speakers for their interesting and inspiring talks and for submitting the abstracts and papers for these proceedings.
Fig. 1. Number of papers in the general track by topic
The main track of ICSS 2008 was divided into approximately 20 parallel sessions (see Fig. 1) addressing the following topics: 1. e-Science Applications and Systems 2. Scheduling and Load Balancing 3. Software Services and Tools
Preface
4. 5. 6. 7. 8. 9. 10.
VII
New Hardware and Its Applications Computer Networks Simulation of Complex Systems Image Processing and Visualization Optimization Techniques Numerical Linear Algebra Numerical Algorithms
# papers 25
23 19
20 17
14
15
14 10
10
8
10
10
10
8
7
9
8
5
Int Agents
Workflows
Environ
Soft. Eng
Develop
Bioinfo
Dyn. Data
Teaching
GeoComp
Networks
Finance
Chemistry
Multiphys
Graphics
0
Fig. 2. Number of papers in workshops
The conference included the following workshops (Fig. 2): 1. 2. 3. 4. 5. 6. 7. 8. 9. 10.
7th Workshop on Computer Graphics and Geometric Modeling 5th Workshop on Simulation of Multiphysics Multiscale Systems 3rd Workshop on Computational Chemistry and Its Applications Workshop on Computational Finance and Business Intelligence Workshop on Physical, Biological and Social Networks Workshop on GeoComputation 2nd Workshop on Teaching Computational Science Workshop on Dynamic Data-Driven Application Systems Workshop on Bioinformatics’ Challenges to Computer Science Workshop on Tools for Program Development and Analysis in Computational Science
VIII
11. 12. 13. 14.
Preface
Workshop Workshop Workshop Workshop
on on on on
Software Engineering for Large-Scale Computing Collaborative and Cooperative Environments Applications of Workflows in Computational Science Intelligent Agents and Evolvable Systems
# participants 100 77
30
27 19 15
12
11
10
8 6 5
5
4
5
2
2
AU
SG
MY
2
1
TW
IR
KR
IL
1
IN
1
BR
SZ
TR
SI
2
DZ
2
MU
2
1
SK
RS
RU
PL
RO
NL
NO
MK
IT
LT
GB
GR
ES
1
2
JP
2
CN
2
MX
2
1
FR
DK
CZ
1
DE
BE
BG
1
1
2
3
US
2
3
AR
2
3
CA
3
UA
3
AT
5
4
Fig. 3. Number of accepted papers by country
Selection of papers for the conference was possible thanks to the hard work of the Program Committee members and about 510 reviewers; each paper submitted to ICCS 2008 received at least 3 reviews. The distribution of papers accepted for the conference is presented in Fig. 3. ICCS 2008 participants represented all continents; their geographical distribution is presented in Fig. 4. The ICCS 2008 proceedings consist of three volumes; the first one, LNCS 5101, contains the contributions presented in the general track, while volumes 5102 and 5103 contain papers accepted for workshops. Volume LNCS 5102 is related to various computational research areas and contains papers from Workshops 1–7, while volume LNCS 5103, which contains papers from Workshops 8–14, is mostly related to computer science topics. We hope that the ICCS 2008 proceedings will serve as an important intellectual resource for computational and computer science researchers, pushing forward the boundaries of these two fields and enabling better collaboration and exchange of ideas. We would like to thank Springer for fruitful collaboration during the preparation of the proceedings. At the conference, the best papers from the general track and workshops were nominated and presented on the ICCS 2008 website; awards were funded by Elsevier and Springer. A number of papers will also be published as special issues of selected journals.
Preface
# participants 100
IX
94
34 28
21 17
16
14
10
9
8 5
5
5
3
3 2
1
1
5
2
2
1
3
3 2
2
3 2
1
1
3 2
2
1
1
AT BE CZ DE DK ES FR GB GR IT LT MK NL NO PL RO RS SI SK SZ TR CA US AR BR MX CN JP IL IN IR KR MY SG TW MU AU
1
5 4
4
Fig. 4. Number of participants by country
We owe thanks to all workshop organizers and members of the Program Committee for their diligent work, which ensured the very high quality of ICCS 2008. We would like to express our gratitude to the Kazimierz Wiatr, Director of ACC CYFRONET AGH, and to Krzysztof Zieli´ nski, Director of the Institute of Computer Science AGH, for their personal involvement. We are indebted to all the members of the Local Organizing Committee for their enthusiastic work towards the success of ICCS 2008, and to numerous colleagues from ACC CYFRONET AGH and the Institute of Computer Science for their help in editing the proceedings and organizing the event. We very much appreciate the help of the computer science students during the conference. We own thanks to the ICCS 2008 sponsors: Hewlett-Packard, Intel, Qumak-Secom, IBM, Microsoft, ATM, Elsevier (Journal Future Generation Computer Systems), Springer, ACC CYFRONET AGH, and the Institute of Computer Science AGH for their generous support. We wholeheartedly invite you to once again visit the ICCS 2008 website (http://www.iccs-meeting.org/iccs2008/), to recall the atmosphere of those June days in Krak´ ow.
June 2008
Marian Bubak G. Dick van Albada Peter M.A. Sloot Jack J. Dongarra
Organization
ICCS 2008 was organized by the Academic Computer Centre Cyfronet AGH in cooperation with the Institute of Computer Science AGH (Krak´ ow, Poland), the University of Amsterdam (Amsterdam,The Netherlands) and the University of Tennessee (Knoxville, USA). All the members of the Local Organizing Committee are staff members of ACC Cyfronet AGH and ICS AGH.
Conference Chairs Conference Chair Workshop Chair Overall Scientific Co-chair Overall Scientific Chair
Marian Bubak (AGH University of Science and Technology, Krak´ ow, Poland) Dick van Albada (University of Amsterdam, The Netherlands) Jack Dongarra (University of Tennessee, USA) Peter Sloot (University of Amsterdam, The Netherlands)
Local Organizing Committee Kazimierz Wiatr Marian Bubak Zofia Mosurska Maria Stawiarska Milena Zaj¸ac Mietek Pilipczuk Karol Fra´ nczak
Sponsoring Institutions Hewlett-Packard Company Intel Corporation Qumak-Sekom S.A. and IBM Microsoft Corporation ATM S.A. Elsevier Springer
Program Committee J.H. Abawajy (Deakin University, Australia) D. Abramson (Monash University, Australia)
XII
Organization
V. Alexandrov (University of Reading, UK) I. Altintas (San Diego Supercomputer Centre, UCSD, USA) M. Antolovich (Charles Sturt University, Australia) E. Araujo (Universidade Federal de Campina Grande, Brazil) M.A. Baker (University of Reading, UK) B. Bali´s (AGH University of Science and Technology, Krak´ ow, Poland) A. Benoit (LIP, ENS Lyon, France) I. Bethke (University of Amsterdam, The Netherlands) J. Bi (Tsinghua University, Beijing, China) J.A.R. Blais (University of Calgary, Canada) K. Boryczko (AGH University of Science and Technology, Krak´ ow, Poland) I. Brandic (Technical University of Vienna, Austria) M. Bubak (AGH University of Science and Technology, Krak´ ow, Poland) K. Bubendorfer (Victoria University of Wellington, New Zealand) B. Cantalupo (Elsag Datamat, Italy) L. Caroprese (University of Calabria, Italy) J. Chen (Swinburne University of Technology, Australia) O. Corcho (Universidad Politcnica de Madrid, Spain) J. Cui (University of Amsterdam, The Netherlands) J.C. Cunha (University Nova de Lisboa, Portugal) S. Date (Osaka University, Japan) S. Deb (National Institute of Science and Technology, Berhampur, India) Y.D. Demchenko (University of Amsterdam, The Netherlands) F. Desprez (INRIA, France) T. Dhaene (Ghent University, Belgium) I.T. Dimov (University of Reading, Bulgarian Academy of Sciences, Bulgaria) J. Dongarra (University of Tennessee, USA) F. Donno (CERN, Switzerland) C. Douglas (University of Kentucky, USA) G. Fox (Indiana University, USA) W. Funika (AGH University of Science and Technology, Krak´ ow, Poland) G. Geethakumari (University of Hyderabad, India) B. Glut (AGH University of Science and Technology, Krak´ ow, Poland) Y. Gorbachev (St.-Petersburg State Polytechnical University, Russia) A.M. Go´sci´ nski (Deakin University, Australia) M. Govindaraju (Binghamton University, USA) G.A. Gravvanis (Democritus University of Thrace, Greece) D.J. Groen (University of Amsterdam, The Netherlands) T. Gubala (Academic Computer Centre Cyfronet AGH, Krak´ow, Poland) M. Hardt (Forschungszentrum Karlsruhe, Germany) T. Heinis (ETH Zurich, Switzerland) L. Hluch´ y (Slovak Academy of Sciences, Slovakia) W. Hoffmann (University of Amsterdam, The Netherlands) A. Iglesias (University of Cantabria, Spain) C.R. Jesshope (University of Amsterdam, The Netherlands)
Organization
XIII
H. Jin (Huazhong University of Science and Technology, China) D. Johnson (University of Reading, UK) B.D. Kandhai (University of Amsterdam, The Netherlands) S. Kawata (Utsunomiya University, Japan) W.A. Kelly (Queensland University of Technology, Australia) J. Kitowski (AGH University of Science and Technology, Krak´ ow, Poland) M. Koda (University of Tsukuba, Japan) D. Kranzlm¨ uller (Johannes Kepler University Linz, Austria) J. Kroc (University of Amsterdam, The Netherlands) B. Kryza (Academic Computer Centre Cyfronet AGH, Krak´ ow, Poland) M. Kunze (Forschungszentrum Karlsruhe, Germany) D. Kurzyniec (Google, Krak´ ow, Poland) A. Lagana (University of Perugia, Italy) L. Lefevre (INRIA, France) A. Lewis (Griffith University, Australia) H.W. Lim (Royal Holloway, University of London, UK) E. Lorenz (University of Amsterdam, The Netherlands) P. Lu (University of Alberta, Canada) M. Malawski (AGH University of Science and Technology, Krak´ ow, Poland) A.S. McGough (London e-Science Centre, UK) P.E.C. Melis (University of Amsterdam, The Netherlands) E.D. Moreno (UEA-BENq, Manaus, Brazil) J.T. Mo´scicki (CERN, Switzerland) S. Naqvi (CETIC, Belgium) P.O.A. Navaux (Universidade Federal do Rio Grande do Sul, Brazil) Z. Nemeth (Hungarian Academy of Science, Hungary) J. Ni (University of Iowa, USA) G.E. Norman (Russian Academy of Sciences, Russia) ´ Nuall´ B.O. ain (University of Amsterdam, The Netherlands) S. Orlando (University of Venice, Italy) M. Paprzycki (Polish Academy of Sciences, Poland) M. Parashar (Rutgers University, USA) C.P. Pautasso (University of Lugano, Switzerland) M. Postma (University of Amsterdam, The Netherlands) V. Prasanna (University of Southern California, USA) T. Priol (IRISA, France) M.R. Radecki (AGH University of Science and Technology, Krak´ ow, Poland) M. Ram (C-DAC Bangalore Centre, India) A. Rendell (Australian National University, Australia) M. Riedel (Research Centre J¨ ulich, Germany) D. Rodr´ıguez Garca (University of Alcal, Spain) K. Rycerz (AGH University of Science and Technology, Krak´ ow, Poland) R. Santinelli (CERN, Switzerland) B. Schulze (LNCC, Brazil) J. Seo (University of Leeds, UK)
XIV
Organization
A.E. Solomonides (University of the West of England, Bristol, UK) V. Stankovski (University of Ljubljana, Slovenia) H. Stockinger (Swiss Institute of Bioinformatics, Switzerland) A. Streit (Forschungszentrum J¨ ulich, Germany) H. Sun (Beihang University, China) R. Tadeusiewicz (AGH University of Science and Technology, Krak´ow, Poland) M. Taufer (University of Delaware, USA) J.C. Tay (Nanyang Technological University, Singapore) C. Tedeschi (LIP-ENS Lyon, France) A. Tirado-Ramos (University of Amsterdam, The Netherlands) P. Tvrdik (Czech Technical University Prague, Czech Republic) G.D. van Albada (University of Amsterdam, The Netherlands) R. van den Boomgaard (University of Amsterdam, The Netherlands) A. Visser (University of Amsterdam, The Netherlands) D.W. Walker (Cardiff University, UK) C.L. Wang (University of Hong Kong, China) A.L. Wendelborn (University of Adelaide, Australia) Y. Xue (Chinese Academy of Sciences, China) F.-P. Yang (Chongqing University of Posts and Telecommunications, China) C.T. Yang (Tunghai University, Taichung, Taiwan) L.T. Yang (St. Francis Xavier University, Canada) J. Yu (Renewtek Pty Ltd, Australia) Y. Zheng (Zhejiang University, China) E.V. Zudilova-Seinstra (University of Amsterdam, The Netherlands)
Reviewers J.H. Abawajy H.H. Abd Allah D. Abramson R. Albert M. Aldinucci V. Alexandrov I. Altintas D. Angulo C. Anthes M. Antolovich E. Araujo E.F. Archibong L. Axner M.A. Baker B. Bali´s S. Battiato M. Baumgartner U. Behn
P. Bekaert A. Belloum A. Benoit G. Bereket J. Bernsdorf I. Bethke B. Bethwaite J.-L. Beuchat J. Bi J. Bin Shyan B.S. Bindhumadhava J.A.R. Blais P. Blowers B. Boghosian I. Borges A.I. Boronin K. Boryczko A. Borzi
A. Boutalib A. Brabazon J.M. Bradshaw I. Brandic V. Breton R. Brito W. Bronsvoort M. Bubak K. Bubendorfer J. Buisson J. Burnett A. Byrski M. Caeiro A. Caiazzo F.C.A. Campos M. Cannataro B. Cantalupo E. Caron
Organization
L. Caroprese U. Catalyurek S. Cerbat K. Cetnarowicz M. Chakravarty W. Chaovalitwongse J. Chen H. Chojnacki B. Chopard C. Choquet T. Cierzo T. Clark S. Collange P. Combes O. Corcho J.M. Cordeiro A.D. Corso L. Costa H. Cota de Freitas C. Cotta G. Cottone C.D. Craig C. Douglas A. Craik J. Cui J.C. Cunha R. Custodio S. Date A. Datta D. De Roure S. Deb V. Debelov E. Deelman Y.D. Demchenko B. Depardon F. Desprez R. Dew T. Dhaene G. Di Fatta A. Diaz-Guilera R. Dillon I.T. Dimov G. Dobrowolski T. Dokken J. Dolado
W. Dong J. Dongarra F. Donno C. Douglas M. Drew R. Drezewski A. Duarte V. Duarte W. Dubitzky P. Edmond A. El Rhalibi A.A. El-Azhary V. Ervin A. Erzan M. Esseffar L. Fabrice Y. Fan G. Farin Y. Fei V. Ferandez D. Fireman K. Fisher A. Folleco T. Ford G. Fox G. Frenking C. Froidevaux K. F¨ ulinger W. Funika H. Fuss A. Galvez R. Garcia S. Garic A. Garny F. Gava T. Gedeon G. Geethakumari A. Gerbessiotis F. Giacomini S. Gimelshein S. Girtelschmid C. Glasner T. Glatard B. Glut M. Goldman
XV
Y. Gorbachev A.M. Go´sci´ nski M. Govindaraju E. Grabska V. Grau G.A. Gravvanis C. Grelck D.J. Groen J.G. Grujic Y. Guang Xue T. Gubala C. Guerra V. Guevara X. Guo Y. Guo N.M. Gupte J.A. Gutierrez de Mesa P.H. Guzzi A. Haffegee S. Hannani U. Hansmann M. Hardt D. Har¸ez˙ lak M. Harman R. Harrison M. Hattori T. Heinis P. Heinzlreiter R. Henschel F. Hernandez V. Hern´andez P. Herrero V. Hilaire y L. Hluch´ A. Hoekstra W. Hoffmann M. Hofmann-Apitius J. Holyst J. Hrusak J. Hu X.R. Huang E. Hunt K. Ichikawa A. Iglesias M. Inda
XVI
Organization
D. Ireland H. Iwasaki B. Jakimovski R. Jamieson A. Jedlitschka C.R. Jesshope X. Ji C. Jim X H. Jin L. Jingling D. Johnson J.J. Johnstone J. Jurek J.A. Kaandorp B. Kahng Q. Kai R. Kakkar B.D. Kandhai S. Kawata P. Kelly W.A. Kelly J. Kennedy A. Kert´esz C. Kessler T.M. Khoshgoftaar C.H. Kim D.S. Kim H.S. Kim T.W. Kim M. Kisiel-Drohinicki J. Kitowski Ch.R. Kleijn H.M. Kl´ıe A. Kn¨ upfer R. Kobler T. K¨ ockerbauer M. Koda I. Kolingerova J.L. Koning V. Korkhov G. Kou A. Koukam J. Ko´zlak M. Krafczyk D. Kramer
D. Kranzlm¨ uller K. Kreiser J. Kroc B. Kryza V.V. Krzhizhanovskaya V. Kumar M. Kunze D. Kurzyniec M. Kuta A. Lagana K. Lai R. Lambiotte V. Latora J. Latt H.K. Lee L. Lefevre A. Lejay J. Leszczy´ nski A. Lewis Y. Li D. Liko H.W. Lim Z. Lin D.S. Liu J. Liu R. Liu M. Lobosco R. Loogen E. Lorenz F. Loulergue M. Low P. Lu F. Luengo Q. Luo W. Luo C. Lursinsap R.M. Lynden-Bell W.Y. Ma N. Maillard D.K. Maity M. Malawski N. Mangala S.S. Manna U. Maran R. Marcjan
F. Marco E. Matos K. Matsuzaki A.S. McGough B. McKay W. Meira Jr. P.E.C. Melis P. Merk M. Metzger Z. Michalewicz J. Michopoulos H. Mickler S. Midkiff L. Minglu M. Mirto M. Mitrovic H. Mix A. Mohammed E.D. Moreno J.T. Mo´scicki F. Mourrain J. Mrozek S. Naqvi S. Nascimento A. Nasri P.O.A. Navaux E. Nawarecki Z. Nemeth A. Neumann L. Neumann J. Ni G. Nikishkov G.E. Norman M. Nsangou J.T. Oden D. Olson M. O’Neill S. Orlando H. Orthmans ´ Nuall´ B.O. ain S. Pal Z. Pan M. Paprzycki M. Parashar A. Paszy´ nska
Organization
M. Paszy´ nski C.P. Pautasso B. Payne T. Peachey S. Pelagatti J. Peng Y. Peng F. Perales M. P´erez D. Pfahl G. Plank D. Plemenos A. Pluchino M. Polak S.F. Portegies Zwart M. Postma B.B. Prahalada V. Prasanna R. Preissl T. Priol T. Prokosch M. Py G. Qiu J. Quinqueton M.R. Radecki B. Raffin M. Ram P. Ramasami P. Ramsamy O.F. Rana M. Reformat A. Rendell M. Riedel J.L. Rivail G.J. Rodgers C. Rodr´ıguez-Leon B. Rodr´ıguez D. Rodr´ıguez D. Rodr´ıguez Garc´ıa F. Rogier G. Rojek H. Ronghuai H. Rosmanith J. Rough F.-X. Roux
X. R´ oz˙ a´ nska M. Ruiz R. Ruiz K. Rycerz K. Saetzler P. Saiz S. Sanchez S.K. Khattri R. Santinelli A. Santos M. Sarfraz M. Satpathy M. Sbert H.F. Schaefer R. Schaefer M. Schulz B. Schulze I. Scriven E. Segredo J. Seo A. Sfarti Y. Shi L. Shiyong Z. Shuai M.A. Sicilia L.P. Silva Barra F. Silvestri A. Simas H.M. Singer V. Sipkova P.M.A. Sloot R. Slota ´ zy´ B. Snie˙ nski A.E. Solomonides R. Soma A. Sourin R. Souto R. Spiteri V. Srovnal V. Stankovski E.B. Stephens M. Sterzel H. Stockinger D. Stokic A. Streit
XVII
B. Strug H. Sun Z. Sun F. Suter H. Suzuki D. Szczerba L. Szirmay-Kalos R. Tadeusiewicz B. Tadic R. Tagliaferri W.K. Tai S. Takeda E.J. Talbi J. Tan S. Tan T. Tang J. Tao M. Taufer J.C. Tay C. Tedeschi J.C. Teixeira D. Teller G. Terje Lines C. Te-Yi A.T. Thakkar D. Thalmann S. Thurner Z. Tianshu A. Tirado A. Tirado-Ramos P. Tjeerd R.F. Tong J. Top H. Torii V.D. Tran C. Troyer P. Trunfio W. Truszkowski W. Turek P. Tvrdik F. Urmetzer V. Uskov G.D. van Albada R. van den Boomgaard M. van der Hoef
XVIII
Organization
R. van der Sman B. van Eijk R. Vannier P. Veltri E.J. Vigmond J. Vill´ a i Freixa A. Visser D.W. Walker C.L. Wang F.L. Wang J. Wang J.Q. Wang J. Weidendorfer C. Weihrauch C. Weijun A. Weise A.L. Wendelborn
E. Westhof R. Wism¨ uller C. Wu C. Xenophontos Y. Xue N. Yan C.T. Yang F.-P. Yang L.T. Yang X. Yang J. Yu M. Yurkin J. Zara I. Zelinka S. Zeng C. Zhang D.L. Zhang
G. Zhang H. Zhang J.J. Zhang J.Z.H. Zhang L. Zhang J. Zhao Z. Zhao Y. Zheng X. Zhiwei A. Zhmakin N. Zhong M.H. Zhu T. Zhu O. Zimmermann J. Zivkovic A. Zomaya E.V. Zudilova-Seinstra
Workshops Organizers 7th Workshop on Computer Graphics and Geometric Modeling A. Iglesias (University of Cantabria, Spain) 5th Workshop on Simulation of Multiphysics Multiscale Systems V.V. Krzhizhanovskaya and A.G. Hoekstra (University of Amsterdam, The Netherlands) 3rd Workshop on Computational Chemistry and Its Applications P. Ramasami (University of Mauritius, Mauritius) Workshop on Computational Finance and Business Intelligence Y. Shi (Chinese Academy of Sciences, China) Workshop on Physical, Biological and Social Networks B. Tadic (Joˇzef Stefan Institute, Ljubljana, Slovenia) Workshop on GeoComputation Y. Xue (London Metropolitan University, UK) 2nd Workshop on Teaching Computational Science Q. Luo (Wuhan University of Science and Technology Zhongnan Branch, China), A. Tirado-Ramos (University of Amsterdam, The Netherlands), Y.-W. Wu
Organization
XIX
(Central China Normal University, China) and H.-W. Wang (Wuhan University of Science and Technology Zhongnan Branch, China) Workshop on Dynamic Data Driven Application Systems C.C. Douglas (University of Kentucky, USA) and F. Darema (National Science Foundation, USA) Bioinformatics’ Challenges to Computer Science M. Cannataro (University Magna Gracia of Catanzaro, Italy), M. Romberg (Research Centre J¨ ulich, Germany), J. Sundness (Simula Research Laboratory, Norway), R. Weber dos Santos (Federal University of Juiz de Fora, Brazil) Workshop on Tools for Program Development and Analysis in Computational Science A. Kn¨ upfer (University of Technology, Dresden, Germany), J. Tao (Forschungszentrum Karlsruhe, Germany), D. Kranzlm¨ uller (Johannes Kepler University Linz, Austria), A. Bode (University of Technology, M¨ unchen, Germany) and J. Volkert (Johannes Kepler University Linz, Austria) Workshop on Software Engineering for Large-Scale Computing D. Rodr´ıguez (University of Alcala, Spain) and R. Ruiz (Pablo de Olavide University, Spain) Workshop on Collaborative and Cooperative Environments C. Anthes (Johannes Kepler University Linz, Austria), V. Alexandrov (University of Reading, UK), D. Kranzlm¨ uller, G. Widmer and J. Volkert (Johannes Kepler University Linz, Austria) Workshop on Applications of Workflows in Computational Science Z. Zhao and A. Belloum (University of Amsterdam, The Netherlands) Workshop on Intelligent Agents and Evolvable Systems K. Cetnarowicz, R. Schaefer (AGH University of Science and Technology, Krak´ ow, Poland) and B. Zheng (South-Central University For Nationalities, Wuhan, China)
Table of Contents – Part I
Keynote Lectures Intrinsic Limitations in Context Modelling . . . . . . . . . . . . . . . . . . . . . . . . . . Maria E. Orlowska
3
EU Research in Software and Services: Activities and Priorities in FP7 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jes´ us Villasante
5
Computational Materials Science at the Cutting Edge . . . . . . . . . . . . . . . . Stefan Bl¨ ugel
6
Multiple Criteria Mathematical Programming and Data Mining . . . . . . . . Yong Shi, Rong Liu, Nian Yan, and Zhenxing Chen
7
HPC Opportunities and Challenges in e-Science . . . . . . . . . . . . . . . . . . . . . . Fabrizio Gagliardi
18
Integrated Data and Task Management for Scientific Applications . . . . . . Jarek Nieplocha, Sriram Krishamoorthy, Marat Valiev, Manoj Krishnan, Bruce Palmer, and P. Sadayappan
20
Why Petascale Visualization and Analysis Will Change the Rules . . . . . . Hank Childs
32
Computational Modeling of Collective Human Behavior: The Example of Financial Markets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Andy Kirou, Bla˙zej Ruszczycki, Markus Walser, and Neil F. Johnson
33
Intel’s Technology Vision and Products for HPC . . . . . . . . . . . . . . . . . . . . . Pawel Gepner
42
e-Science Applications and Systems Grid-Supported Simulation of Vapour-Liquid Equilibria with GridSFEA . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . I.L. Muntean, E. Elts, M. Buchholz, and H.-J. Bungartz Towards a System-Level Science Support . . . . . . . . . . . . . . . . . . . . . . . . . . . . Tomasz Gubala, Marek Kasztelnik, Maciej Malawski, and Marian Bubak
45
56
XXII
Table of Contents – Part I
Incorporating Local Ca2+ Dynamics into Single Cell Ventricular Models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Anna Sher, David Abramson, Colin Enticott, Slavisa Garic, David Gavaghan, Denis Noble, Penelope Noble, and Tom Peachey
66
Grid-Enabled Non-Invasive Blood Glucose Measurement . . . . . . . . . . . . . . Ibrahim Elsayed, Jianguo Han, Ting Liu, Alexander W¨ ohrer, Fakhri Alam Khan, and Peter Brezany
76
Simulating N-Body Systems on the Grid Using Dedicated Hardware . . . . Derek Groen, Simon Portegies Zwart, Steve McMillan, and Jun Makino
86
Supporting Security-Oriented, Collaborative nanoCMOS Electronics Research . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Richard O. Sinnott, Thomas Doherty, David Martin, Campbell Millar, Gordon Stewart, and John Watt
96
Comparing Grid Computing Solutions for Reverse-Engineering Gene Regulatory Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Martin Swain, Johannes J. Mandel, and Werner Dubitzky
106
Interactive In-Job Workflows . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ˇ Branislav Simo, Ondrej Habala, Emil Gatial, and Ladislav Hluch´ y
116
Pattern Based Composition of Web Services for Symbolic Computations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Alexandru Cˆ arstea, Georgiana Macariu, Dana Petcu, and Alexander Konovalov
126
DObjects: Enabling Distributed Data Services for Metacomputing Platforms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Pawel Jurczyk, Li Xiong, and Vaidy Sunderam
136
Behavioural Skeletons Meeting Services . . . . . . . . . . . . . . . . . . . . . . . . . . . . . M. Danelutto and G. Zoppi
146
Functional Meta-programming for Parallel Skeletons . . . . . . . . . . . . . . . . . . Jocelyn Serot and Joel Falcou
154
Interoperable and Transparent Dynamic Deployment of Web Services for Service Oriented Grids . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Michael Messig and Andrzej Goscinski
164
Pollarder: An Architecture Concept for Self-adapting Parallel Applications in Computational Science . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Andreas Sch¨ afer and Dietmar Fey
174
The Design and Evaluation of MPI-Style Web Services . . . . . . . . . . . . . . . . Ian Cooper and Yan Huang
184
Table of Contents – Part I
XXIII
Automatic Data Reuse in Grid Workflow Composition . . . . . . . . . . . . . . . . Ondrej Habala, Branislav Simo, Emil Gatial, and Ladislav Hluchy
194
Performance Analysis of GRID Middleware Using Process Mining . . . . . . Anastas Misev and Emanouil Atanassov
203
Scheduling and Load Balancing Bi-criteria Pipeline Mappings for Parallel Image Processing . . . . . . . . . . . . Anne Benoit, Harald Kosch, Veronika Rehn-Sonigo, and Yves Robert
215
A Simulation Framework for Studying Economic Resource Management in Grids . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Kurt Vanmechelen, Wim Depoorter, and Jan Broeckhove
226
Improving Metaheuristics for Mapping Independent Tasks into Heterogeneous Memory-Constrained Systems . . . . . . . . . . . . . . . . . . . . . . . . Javier Cuenca and Domingo Gim´enez
236
A2 DLT: Divisible Load Balancing Model for Scheduling Communication-Intensive Grid Applications . . . . . . . . . . . . . . . . . . . . . . . . . M. Othman, M. Abdullah, H. Ibrahim, and S. Subramaniam
246
Evaluation of Eligible Jobs Maximization Algorithm for DAG Scheduling in Grids . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Tomasz Szepieniec and Marian Bubak
254
Parallel Path-Relinking Method for the Flow Shop Scheduling Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Wojciech Bo˙zejko and Mieczyslaw Wodecki
264
A Fast and Efficient Algorithm for Topology-Aware Coallocation . . . . . . . Valentin Kravtsov, Martin Swain, Uri Dubin, Werner Dubitzky, and Assaf Schuster
274
Software Services and Tools View-OS: A New Unifying Approach Against the Global View Assumption . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Ludovico Gardenghi, Michael Goldweber, and Renzo Davoli
287
Evaluating Sparse Data Storage Techniques for MPI Groups and Communicators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Mohamad Chaarawi and Edgar Gabriel
297
Method of Adaptive Quality Control in Service Oriented Architectures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Tomasz Szydlo and Krzysztof Zielinski
307
XXIV
Table of Contents – Part I
Ontology Supported Selection of Versions for N-Version Programming in Semantic Web Services . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Pawel L. Kaczmarek
317
Hybrid Index for Metric Space Databases . . . . . . . . . . . . . . . . . . . . . . . . . . . Mauricio Marin, Veronica Gil-Costa, and Roberto Uribe
327
Structural Testing for Semaphore-Based Multithread Programs . . . . . . . . Felipe S. Sarmanho, Paulo S.L. Souza, Simone R.S. Souza, and Adenilso S. Sim˜ ao
337
Algorithms of Basic Communication Operation on the Biswapped Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Wenhong Wei and Wenjun Xiao Rule Engine Based Lightweight Framework for Adaptive and Autonomic Computing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . and Jakub Adamczyk, Rafal Chojnacki, Marcin Jarzab, Krzysztof Zieli´ nski
347
355
A Monitoring Module for a Streaming Server Transmission Architecture . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Sadick Jorge Nahuz, Mario Meireles Teixeira, and Zair Abdelouahab
365
BSP Functional Programming: Examples of a Cost Based Methodology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Fr´ed´eric Gava
375
On the Modeling Timing Behavior of the System with UML(VR) . . . . . . Leszek Kotulski and Dariusz Dymek
386
Reducing False Alarm Rate in Anomaly Detection with Layered Filtering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Rafal Pokrywka
396
New Hardware and Its Applications Performance of Multicore Systems on Parallel Data Clustering with Deterministic Annealing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Xiaohong Qiu, Geoffrey C. Fox, Huapeng Yuan, Seung-Hee Bae, George Chrysanthakopoulos, and Henrik Frystyk Nielsen
407
Second Generation Quad-Core Intel Xeon Processors Bring 45 nm Technology and a New Level of Performance to HPC Applications . . . . . Pawel Gepner, David L. Fraser, and Michal F. Kowalik
417
Heuristics Core Mapping in On-Chip Networks for Parallel Stream-Based Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Piotr Dziurzanski and Tomasz Maka
427
Table of Contents – Part I
Max-Min-Fair Best Effort Flow Control in Network-on-Chip Architectures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Fahimeh Jafari, Mohammad H. Yaghmaee, Mohammad S. Talebi, and Ahmad Khonsari Fast Quadruple Precision Arithmetic Library on Parallel Computer SR11000/J2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Takahiro Nagai, Hitoshi Yoshida, Hisayasu Kuroda, and Yasumasa Kanada
XXV
436
446
Characterizing the Basic Synchronization and Communication Operations in Dual Cell-Based Blades . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jos´e L. Abell´ an, Juan Fern´ andez, and Manuel E. Acacio
456
Performance Evaluation of the NVIDIA GeForce 8800 GTX GPU for Machine Learning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Ahmed El Zein, Eric McCreath, Alistair Rendell, and Alex Smola
466
Hardware Implementation Aspects of New Low Complexity Image Coding Algorithm for Wireless Capsule Endoscopy . . . . . . . . . . . . . . . . . . . Pawel Turcza, Tomasz Zieli´ nski, and Mariusz Duplaga
476
Computer Networks Database Prebuffering as a Way to Create a Mobile Control and Information System with Better Response Time . . . . . . . . . . . . . . . . . . . . . Ondrej Krejcar and Jindrich Cernohorsky
489
Network Traffic Classification by Common Subsequence Finding . . . . . . . Krzysztof Fabja´ nski and Tomasz Kruk
499
A Hierarchical Leader Election Protocol for Mobile Ad Hoc Networks . . . Orhan Dagdeviren and Kayhan Erciyes
509
Distributed Algorithms to Form Cluster Based Spanning Trees in Wireless Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Kayhan Erciyes, Deniz Ozsoyeller, and Orhan Dagdeviren
519
The Effect of Network Topology and Channel Labels on the Performance of Label-Based Routing Algorithms . . . . . . . . . . . . . . . . . . . . . Reza Moraveji, Hamid Sarbazi-Azad, and Arash Tavakkol
529
On the Probability of Facing Fault Patterns: A Performance and Comparison Measure of Network Fault-Tolerance . . . . . . . . . . . . . . . . . . . . . Farshad Safaei, Ahmad Khonsari, and Reza Moraveji
539
Cost-Minimizing Algorithm for Replica Allocation and Topology Assignment Problem in WAN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Marcin Markowski and Andrzej Kasprzak
549
XXVI
Table of Contents – Part I
Bluetooth ACL Packet Selection Via Maximizing the Expected Throughput Efficiency of ARQ Protocol . . . . . . . . . . . . . . . . . . . . . . . . . . . . Xiang Li, Man-Tian Li, Zhen-Guo Gao, and Li-Ning Sun
559
Simulation of Complex Systems High Performance Computer Simulations of Cardiac Electrical Function Based on High Resolution MRI Datasets . . . . . . . . . . . . . . . . . . . . . . . . . . . . Michal Plotkowiak, Blanca Rodriguez, Gernot Plank, J¨ urgen E. Schneider, David Gavaghan, Peter Kohl, and Vicente Grau
571
Statistical Modeling of Plume Exhausted from Herschel Small Nozzle with Baffle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Gennady Markelov and Juergen Kroeker
581
An Individual-Based Model of Influenza in Nosocomial Environments . . . Boon Som Ong, Mark Chen, Vernon Lee, and Joc Cing Tay
590
Modeling Incompressible Fluids by Means of the SPH Method: Surface Tension and Viscosity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Pawel Wr´ oblewski, Krzysztof Boryczko, and Mariusz Kope´c
600
Optimal Experimental Design in the Modelling of Pattern Formation . . . ` Adri´ an L´ opez Garc´ıa de Lomana, Alex G´ omez-Garrido, David Sportouch, and Jordi Vill` a-Freixa
610
Self-Organised Criticality as a Function of Connections’ Number in the Model of the Rat Somatosensory Cortex . . . . . . . . . . . . . . . . . . . . . . . . . . . . Grzegorz M. Wojcik and Wieslaw A. Kaminski
620
Approximate Clustering of Noisy Biomedical Data . . . . . . . . . . . . . . . . . . . Krzysztof Boryczko and Marcin Kurdziel
630
Domain Decomposition Techniques for Parallel Generation of Tetrahedral Meshes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Barbara Glut and Tomasz Jurczyk
641
The Complete Flux Scheme for Spherically Symmetric Conservation Laws . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . J.H.M. ten Thije Boonkkamp and M.J.H. Anthonissen
651
Computer Simulation of the Anisotropy of Fluorescence in Ring Molecular Systems: Tangential vs. Radial Dipole Arrangement . . . . . . . . . Pavel Heˇrman, Ivan Barv´ık, and David Zapletal
661
Functional Availability Analysis of Discrete Transport System Realized by SSF Simulator . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Tomasz Walkowiak and Jacek Mazurkiewicz
671
Table of Contents – Part I
XXVII
Parallel Implementation of Vascular Network Modeling . . . . . . . . . . . . . . . Krzysztof Jurczuk and Marek Kr¸etowski
679
Some Remarks about Modelling of Annular Three-Layered Plate Structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Dorota Pawlus
689
Parallel Quantum Computer Simulation on the CUDA Architecture . . . . Eladio Gutierrez, Sergio Romero, Maria A. Trenas, and Emilio L. Zapata Comparison of Numerical Models of Impact Force for Simulation of Earthquake-Induced Structural Pounding . . . . . . . . . . . . . . . . . . . . . . . . . . . Robert Jankowski
700
710
Image Processing and Visualisation Large-Scale Image Deblurring in Java . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Piotr Wendykier and James G. Nagy
721
A New Signature-Based Indexing Scheme for Trajectories of Moving Objects on Spatial Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jaewoo Chang, Jungho Um, and Youngjin Kim
731
Effective Emission Tomography Image Reconstruction Algorithms for SPECT Data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . J. Ram´ırez, J.M. G´ orriz, M. G´ omez-R´ıo, A. Romero, R. Chaves, A. Lassl, A. Rodr´ıguez, C.G. Puntonet, F. Theis, and E. Lang
741
New Sky Pattern Recognition Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . Wojciech Makowiecki and Witold Alda
749
A Generic Context Information System for Intelligent Vision Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Luo Sun, Peng Dai, Linmi Tao, and Guangyou Xu
759
Automated Positioning of Overlapping Eye Fundus Images . . . . . . . . . . . . Povilas Treigys, Gintautas Dzemyda, and Valerijus Barzdziukas
770
Acceleration of High Dynamic Range Imaging Pipeline Based on Multi-threading and SIMD Technologies . . . . . . . . . . . . . . . . . . . . . . . . . . . . Radoslaw Mantiuk and Dawid Paj¸ak
780
Monte Carlo Based Algorithm for Fast Preliminary Video Analysis . . . . . Krzysztof Okarma and Piotr Lech
790
Interactive Learning of Data Structures and Algorithmic Schemes . . . . . . Clara Segura, Isabel Pita, Rafael del Vado V´ırseda, Ana Isabel Saiz, and Pablo Soler
800
XXVIII
Table of Contents – Part I
Optimization Techniques Prediction and Analysis of Weaning Results of Ventilator-Dependent Patients with an Artificial Neuromolecular System . . . . . . . . . . . . . . . . . . . Jong-Chen Chen, Shou-Wei Chien, and Jinchyr Hsu
813
Licence Plate Character Recognition Using Artificial Immune Technique . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Rentian Huang, Hissam Tawfik, and Atulya Nagar
823
Integration of Ab Initio Nuclear Physics Calculations with Optimization Techniques . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Masha Sosonkina, Anurag Sharda, Alina Negoita, and James P. Vary
833
Non-uniform Distributions of Quantum Particles in Multi-swarm Optimization for Dynamic Tasks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Krzysztof Trojanowski
843
An Integer Linear Programming for Container Stowage Problem . . . . . . . Feng Li, Chunhua Tian, Rongzeng Cao, and Wei Ding
853
Using Padding to Optimize Locality in Scientific Applications . . . . . . . . . E. Herruzo, O. Plata, and E.L. Zapata
863
Improving the Performance of Graph Coloring Algorithms through Backtracking . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Sanjukta Bhowmick and Paul D. Hovland
873
Automatic Identification of Fuzzy Models with Modified Gustafson-Kessel Clustering and Least Squares Optimization Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Grzegorz Glowaty
883
Extending the Four Russian Algorithm to Compute the Edit Script in Linear Space . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Vamsi Kundeti and Sanguthevar Rajasekaran
893
Accuracy of Baseline and Complex Methods Applied to Morphosyntactic Tagging of Polish . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Marcin Kuta, Michal Wrzeszcz, Pawel Chrzaszcz, and Jacek Kitowski
903
Synonymous Chinese Transliterations Retrieval from World Wide Web by Using Association Words . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Chung-Chian Hsu and Chien-Hsing Chen
913
Numerical Linear Algebra Parallel Approximate Finite Element Inverses on Symmetric Multiprocessor Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Konstantinos M. Giannoutakis and George A. Gravvanis
925
Table of Contents – Part I
XXIX
Fast and Small Short Vector SIMD Matrix Multiplication Kernels for the Synergistic Processing Element of the CELL Processor . . . . . . . . . . . . Wesley Alvaro, Jakub Kurzak, and Jack Dongarra
935
Tridiagonalizing Complex Symmetric Matrices in Waveguide Simulations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . W.N. Gansterer, H. Schabauer, C. Pacher, and N. Finger
945
On Using Reinforcement Learning to Solve Sparse Linear Systems . . . . . . Erik Kuefler and Tzu-Yi Chen
955
Reutilization of Partial LU Factorizations for Self-adaptive hp Finite Element Method Solver . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Maciej Paszynski and Robert Schaefer
965
Linearized Initialization of the Newton Krylov Algorithm for Nonlinear Elliptic Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Sanjay Kumar Khattri
975
Analysis and Comparison of Reordering for Two Factorization Methods (LU and WZ) for Sparse Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Beata Bylina and Jaroslaw Bylina
983
Numerical Algorithms KCK-Means: A Clustering Method Based on Kernel Canonical Correlation Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Chuan-Liang Chen, Yun-Chao Gong, and Ying-Jie Tian
995
Application of the Variational Iteration Method for Inverse Stefan Problem with Neumann’s Boundary Condition . . . . . . . . . . . . . . . . . . . . . . . 1005 Damian Slota Generalized Laplacian as Focus Measure . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1013 Muhammad Riaz, Seungjin Park, Muhammad Bilal Ahmad, Waqas Rasheed, and Jongan Park Application of R-Functions Method and Parallel Computations to the Solution of 2D Elliptic Boundary Value Problems . . . . . . . . . . . . . . . . . . . . 1022 Marcin Detka and Czeslaw Cicho´ n Using a (Higher-Order) Magnus Method to Solve the Sturm-Liouville Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1032 Veerle Ledoux, Marnix Van Daele, and Guido Vanden Berghe Stopping Criterion for Adaptive Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . 1042 Sanjay Kumar Khattri Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1051
Intrinsic Limitations in Context Modelling Maria E. Orlowska Ministry of Science and Higher Education, 1/3 Wsp´ olna Street, 00-529 Warsaw, Poland Phone: (+4822) 629 5703; Fax: (+4822) 529 2615
Abstract. Where are the limits in context modelling? Can we ever model context? Do we understand the limits in context modelling, in the context of business process execution? Keywords: context awareness, context-dependent applications, process model, web services, coordination.
The last few years of Information Technology evolution has been strongly influenced by virtually unlimited mobile connectivity between functionally sophisticated hardware devices. Incredible promises of innovative applications, often beyond our imagination, have emerged within pervasive, ubiquitous, and ambient computing, within the semantic web, smart knowledge management, and the management of agile processes, and so on. All have one common characteristic; they rely on a system’s ability to observe and capture the application context. Therefore, context awareness, context capturing, context management, de-abstracting context, and linking contexts are the key terms and phrases for these directions in contemporary computer science. The precise meaning of the term “context” depends on the context in which the term is used. This obvious meta-level logical loop often creates confusion and discourages efforts, in different situations, to present a precise semantic specification of this term. The goal of this presentation is to constructively evaluate the feasibility of expanding the potential for future context-dependent applications in general. We will begin with a short overview of the generic and inherited limitations of current computational models that form the basis of all computing machines we use and most likely will use for many years to come. We will then continue the debate from the perspective of business process modelling issues where the meaning of “context”, and dependency of applications on “context”, is equally important. Typically, business process communication is characterized by complex interactions between heterogeneous and autonomous systems within an enterprise, and increasingly between trading partners. Each of the involved parties operates in its own individual context, with different perspectives on the overall process. Most attempts at business process enforcement can be thought of in terms of two basic approaches. The first “coordinative” paradigm is concerned with the enforcement of a structured, “pre-arranged” process. A complete process M. Bubak et al. (Eds.): ICCS 2008, Part I, LNCS 5101, pp. 3–4, 2008. © Springer-Verlag Berlin Heidelberg 2008
4
M.E. Orlowska
model, reflecting all potential local and global context variations, is designed prior to enacting the process. This approach mainly provides an effective means of coordinating business activities with well-defined dependency relations that can be modelled with simple workflow control constructs such as sequence, choice and fork. Another approach to process enforcement is concerned with a less structured and a more ad hoc process which is now more commonly quoted since the advent of web services. This is precisely where the use of context specification, discovery or capturing is vital for a realistic chance to deliver any promise. The potential of web service technology in the area of integration and interoperation has generated substantial interest, with initiatives from leading software vendors such as HP, IBM, Microsoft, SAP, Oracle and Sun Microsystems. There is a belief that web services will provide a means for integrating applications, promoting interoperability and facilitating loosely-coupled process management over decentralised environments. A natural question that comes to mind: where is the source of the web services power? Why do integration problems, often semantically and contextually sensitive, become easier to handle under these architectural considerations? Many extensions to the basic web service functionality have been recently proposed with the aim of capturing more meaningful semantics and contexts than simply service invocations, enabling the modelling and implementation of business processes in the web service context. This coordination layer is said to provide web service ‘orchestration’, ‘choreography’ or ‘harmonization’. Even a superficial analysis of the potential obstacles with deployment, either through coordinative or collaborative approaches for cross-organizational business process support, reveals that the main issues are related to context modelling of the loosely coupled application environments such that global goals are tractably achieved. This talk will highlight the issues outlined above with an attempt to provide well-defined feasibility limits for such context sensitive loosely coupled applications.
EU Research in Software and Services: Activities and Priorities in FP7 Jes´ us Villasante Head of Unit DG INFSO D3 “Software and Services Architectures and Infrastructures”, European Commission
Abstract. Over the past years, Service-Oriented Architectures have become a paradigm in enterprises for enabling more efficient and flexible business processes and addressing some of the technological challenges posed by the service-based economy. Using loosely coupled services, they allow for discovery, composition and orchestration capabilities that are needed by end-users, business processes or other services.
In parallel with these developments, research on Grid Technologies has expanded from its initial focus on complex eScience applications towards general-purpose service infrastructures that can also be used by business and industry. This requires the dynamic provision of resources in an easy and transparent manner thus greatly facilitating the translation ofbusiness or user requirements into infrastructure capabilities. The business aim is on the convergence with the service paradigm so that the infrastructure can be managed according to more flexible and dynamic business practices. This has opened new avenues of research in Software and Services that complement the research that is being done on Grids for scientific computations and on the deployment of research infrastructures for eScience. In this talk I will present the research on Software and Services within the FP6 and FP7 programmes of the European Commission, with particular emphasis on the activities related to service oriented infrastructures and Grids. I will also provide an overview of the expected research priorities in the coming years.
M. Bubak et al. (Eds.): ICCS 2008, Part I, LNCS 5101, p. 5, 2008. c Springer-Verlag Berlin Heidelberg 2008
Computational Materials Science at the Cutting Edge Stefan Bl¨ ugel Institut f¨ ur Festk¨ orperforschung, Forschungszentrum J¨ ulich, 52425 J¨ ulich, Germany
[email protected] Phone: +49 2461 61 4249; Fax: +49 2461 61 2850 www.fz-juelich.de/iff/staff/Bluegel S/
Abstract. Material science is a field which cuts through physics, chemistry, biology, and engineering working with an enormous spectrum of different material systems and structures on quite different length and time scale and symmetry, on different degrees of hardness or softness as well as on liquids. The degree to which new functionalities of magnetic clusters, quantum dots, bio-molecules or carbon nanowires can be exploited for specific applications depends heavily on our ability to design devices with optimal behavior in response to external stimulation, such as applied voltage. While the basic physical effects are often well understood, quantitative simulations with predictive power that do not rely on empirical models and parameters pose a major challenge. This is due to the large numerical effort of the calculations, to accurately describe quantum effects at atomic and larger distances. Therefore, modern quantum simulations in material science depend heavily on efficient algorithms and powerful computer hardware.
During the past ten years, first-principles calculations based on the densityfunctional theory (DFT) emerged as the most powerful framework to respond to the demands mentioned above on a microscopic level. By first-principles is meant, that the parameters of the theory are fixed by the basic assumptions and equations of quantum mechanics. The overwhelming success of the densityfunctional theory for the description of the ground-state properties of large material classes including organic molecules and bio-molecules, insulators, semiconductors, semimetals, half-metals, simple metals, transition-metals and rareearths in bulk, at surfaces and as nanostructures such as fullerenes and nanotubes makes it the unchallenged foundation of any modern electronic structure based materials. In this talk I will explore the opportunities of petaflop computing for materials science. Petaflop computing opens the path for the treatment of the van der Waals interaction of molecules, the chemical reactions of bio-molecules and the treatment of strongly-correlated electrons, where concept of individual electrons breaks down. These problems benefit from the advent of massively parallelized computers. Conclusions for the method development for massively parallelized computers are drawn. M. Bubak et al. (Eds.): ICCS 2008, Part I, LNCS 5101, p. 6, 2008. © Springer-Verlag Berlin Heidelberg 2008
Multiple Criteria Mathematical Programming and Data Mining Yong Shi1,2, Rong Liu1,3, Nian Yan2, and Zhenxing Chen2 1
Research Center on Fictitious Economy and Data Sciences, Chinese Academy of Sciences 100080 Beijing, China 2 College of Information Science and Technology, University of Nebraska at Omaha Omaha NE 68182, USA 3 School of Mathematical Science, Graduate University of Chinese Academy of Sciences 100049 Beijing, China
[email protected],
[email protected], {nyan,zchen}@mail.unomaha.edu
Abstract. Recently, researchers have extensively applied quadratic programming into classification, known as V. Vapnik’s Support Vector Machine, as well as various applications. However, using optimization techniques to deal with data separation and data analysis goes back to more than forty years ago. Since 1998, the authors and their colleagues extended such a research idea into classification via multiple criteria linear programming (MCLP) and multiple criteria quadratic programming (MQLP). The purpose of the paper is to share our research results and promote the research interests in the community of computational sciences. These methods are different from statistics, decision tree induction, and neural networks. In this paper, starting from the basics of Multiple Criteria Linear Programming (MCLP), we further discuss penalized MCLP Multiple Criteria Quadratic Programming (MCQP), Multiple Criteria Fuzzy Linear Programming, Multi-Group Multiple Criteria Mathematical Programming, as well as regression method by Multiple Criteria Linear Programming. A brief summary of applications of Multiple Criteria Mathematical Programming is also provided. Keywords: Multi-criteria programming, MCLP, MCQP, data mining, classification, regression, fuzzy programming.
1 Introduction Recently, researchers have extensively applied quadratic programming into classification, known as V. Vapnik’s Support Vector Machine [1], as well as various applications. However, using optimization techniques to deal with data separation and data analysis goes back to more than forty years ago. In 1960’s, O.L. Mangasarian’s group formulated linear programming as a large margin classifier [2]. Later in 1970’s, A. Charnes and W.W. Cooper initiated Data Envelopment Analysis where a fractional programming is used to evaluate decision making units, which is economic representative data in a given training dataset [3]. From 1980’s to 1990’s, F. Glover proposed M. Bubak et al. (Eds.): ICCS 2008, Part I, LNCS 5101, pp. 7–17, 2008. © Springer-Verlag Berlin Heidelberg 2008
8
Y. Shi et al.
a number of linear programming models to solve discriminant problems with a small sample size of data [4]. Then, since 1998, the authors and their colleagues extended such a research idea into classification via multiple criteria linear programming (MCLP) and multiple criteria quadratic programming (MQLP). These methods are different from statistics, decision tree induction, and neural networks. The purpose of the paper is to share our research results and promote the research interests in the community of computational sciences. The data mining task which will be investigated in this paper is the classification or the so-called discriminate analysis in statistical inference. The purpose of classification is to separate data according to some criteria. There are two commonly used criteria among them. The first one is the overlapping degree with respect to the discriminate boundary. The lower of this degree the better the classification is. Another one is the distance from a point to the discriminate boundary. The larger the sum of these distances the better the classification is. Accordingly, the objective of a classification is to minimize the sum of the overlapping degree and maximize the sum of the distances [4]. Note that these two criteria can not be optimized simultaneously because they are contradictory to each other. Fortunately, the multicriteria mathematical programming can be used to overcome this kind of problems in a systematical way. It has been thirty years since the first appearance of the multi-criteria linear programming. During these years, the multi-criteria programming has been not only improved in theoretical foundations but also applied successfully in real world problems. The data mining is such an area where the multi-criteria program has achieved a great deal. Initialed by Shi et al. [5], the model and ideal of multi-criteria programming have been widely adopted by the researches for classification, regression, etc. To handle the unbalanced training set problem, Li et al. [6] proposed the penalized multi-criteria linear programming method. He et al. [7] introduced the fuzzy approach in the multi-criteria programming to address the uncertainty in criteria of data separation. Using a different norm to measure the overlapping degree and distance, Kou [8] presented the Multiple Criteria Quadratic Programming for data mining. Kou et al. [9] proposed Multi-Group Multiple Criteria Mathematical Programming aimed to handle the multi-group classification. To extend the application of multi-criteria programming, Zhang et al. [10] developed a regressing method based on this technique. Some important characteristics of these variations of the multi-criteria data mining technique are summarized in Table 1. In respect of the abundance of the variations of multiple criteria mathematical programming and the diversity of applications, a comprehensive review of related methods would benefit the research in data mining. In this paper, several multi-criteria linear programming methods in data mining are reviewed and analyzed. The remaining part of the paper is organized as follows. First, we present the basics of Multiple Criteria Linear Programming (MCLP) (Section 2). Since the training set could be unbalanced, penalized MCLP method has been proposed to deal with this problem (Section 3). Furthermore, in order to achieve better classification performance and stability, Multiple Criteria Quadratic Programming (MCQP) has been developed (Section 4). Instead of identifying a compromise solution for the separation of data in MCLP, an alternative Multiple Criteria Fuzzy Linear Programming approach has also been studied (Section 5). In addition, two-group Multiple Criteria Mathematical
Multiple Criteria Mathematical Programming and Data Mining
9
Table 1. Some Important Characteristics of MCLP (M.1) Variations
MCQP FMCLP Multi-group MCLP MCLP Reg.
√ √ √ √ √ √ √
√ √
√
√ √ √
√ √ √
√ √
√ √
√
Regression
M.2 M.3 M.5 M.6 M.7 M.9 M.10 M.11
Classification
Multi-group classification Unbalance Constraints Soft Constraints Hard Constraints Non-Linear Objective Linear Objective
MCLP PMCLP
√ √ √ √ √ √ √ √
Programming has been extended to Multi-Group Multiple Criteria Mathematical Programming (Section 6). We also review how to apply MCLP to regression problem (Section 7). A brief summary of applications of multiple criteria mathematical programming is provided in Section 8. We conclude the paper in Section 9.
2 Multiple Criteria Linear Programming (MCLP) In linear discriminate analysis, the data separation can be achieved by two opposite objectives. The first one is to maximize the minimum distances of observations from the critical value. The second objective separates the observations by minimizing the sum of the deviations (the overlapping) among the observations [4]. However, it is theoretically impossible to optimize MMD and MSD simultaneously, the best tradeoff of two measurements is difficult to find. This shortcoming has been coped with by the technique of multiple criteria linear programming (MCLP) [5, 11, 12]. The first MCLP model can be described as follows: n
∑α
Min
i =1
i
n
Max
∑β i =1
S. T .
(Model 1)
i
(x i , w ) = b + yi (α i − β i ),
i = 1, K , n
α, β ≥ 0 Here,
αi
is the overlapping and
(x i , w ) = b
βi
the distance from the training sample
x i to the
yi ∈ {1,−1} denotes the label of x i and n is the number of samples. The weights vector w and the bias b are the discriminator
(classification boundary).
10
Y. Shi et al.
Fig. 1. The two criteria of classification
unknown variables to be optimized for the two objectives. A visual description of this model is shown in Fig. 1. Model 1 is formulized as Multiple Criteria Linear Programming which is difficult to optimize. In order to facilitate the computation, the compromise solution approach [5, 13] can be employed to reform the above model so that we can systematically identify the best trade-off between -Σαi and Σβi for an optimal solution. The “ideal value” of -Σαi and Σβi are assumed to be α* > 0 and β* > 0 respectively. Then, if Σαi > α*, we define the regret measure as -dα+ = Σαi + α*; otherwise, it is 0. If Σiαi < α*, the regret measure is defined as dα - = α* + Σαi; otherwise, it is 0. Thus, we have (i) α* + Σαi = dα - – dα +, (ii) |α* + Σαi | = dα - + dα +, and (iii) dα- , dα + ≥ 0. Similarly, we derive β* – Σβi = dβ - – dβ+, |β* – Σβi | = dβ - + dβ+, and dβ - , dβ+ ≥ 0. The two-class MCLP model has been gradually evolved as Model 2:
Min d α+ + d α− + d β+ + d β− n
S. T .
α ∗ + ∑ α i = d α− − d α+ i =1 n
β − ∑ β i = d β− − d β+ ∗
(Model 2)
i =1
(xi , w ) = b + yi (α i − βi ),
i = 1,K, n
α, β ≥ 0, d α+ ,d α− ,d β+ ,d β− ≥ 0 Here α* and β* are given, w and b are unrestricted. The geometric meaning of the model is shown as in Fig. 2. In order to calculate a large data set, the Linux-based MCLP classification algorithm was developed to implement the above Model 2 (Kou and Shi, 2002).
Multiple Criteria Mathematical Programming and Data Mining
11
Fig. 2. Model 2 and Model 7 formulations
3 Penalized MCLP Usually, the sample sizes of different groups vary; namely, the training set is unbalanced. To handle this problem with the MCLP model, Li et al. [6] proposed the following penalized MCLP method (Model 3) for credit scoring.
Min d α+ + d α− + d β+ + d β− S. T .
α∗ + p ×
n2 α i + ∑ α i = d α− − d α+ ∑ n1 i∈B i∈G
β∗ − p×
n2 βi = d β− − d β+ ∑ βi − ∑ n1 i∈B i∈G
(xi , w ) = b + α i − βi , (xi , w ) = b − α i + βi ,
(Model 3)
xi ∈ B xi ∈ G
α, β ≥ 0, d α+ ,d α− ,d β+ ,d β− ≥ 0 Here, “Bad” and “Good” denote different groups,
n1 and n2 are the number of
p ≥ 1 is the penalized parameter. In this model the distance is balanced on the two sides of b with the parameter n1 / n2 , even there are less “Bad” records on the left of the credit score boundary b . The value of p enhances the effect of “Bad” distance and penalizes much samples corresponding to the two groups, and
more if we wish more “Bad” records on the left of the boundary.
12
Y. Shi et al.
If n1 = n2 ,
p =1, the model above degenerates to the original MCLP model (Model 1). If n1 < n2 , then exist p ≥ 1 to make “Bad” catching rate of PMCLP higher than that of MCLP with the same n1 , n2 .
4 Multiple Criteria Quadratic Programming (MCQP) Based on MCLP, the Multiple Criteria Quadratic Programming is later developed to achieve better classification performance and stability. The overlapping and distance are respectively represented by the nonlinear functions f (α ) and g ( β ) . Given weights
ωα
and ωβ , let
f (α ) =|| α ||p and g ( β ) =|| β ||p , the two criteria basic
Model 1 can be converted into a single criterion general non-linear classification model (Model 4):
Min ωα || α ||p −ωβ || β ||p S.T .
(xi , w ) = b + yi (αi − βi ),
i = 1,K, n
(Model 4)
α, β ≥ 0 On the basis of Model 4, non-linear classification models with any norm can be defined theoretically. Let m
m
i =1
i =1
f (α ) = α T Hα = ∑ α i2 and f ( β ) = β T Qβ = ∑ β i2 where H and Q are predefined as identity matrices. We add the term
1 || w ||22 into 2
the objective function and formulate a simple quadratic programming with 2-norm as in Model 5: n n 1 || w ||22 +ωα ∑ αi2 − ωβ ∑ β i2 2 i =1 i =1 S . T . (x i , w ) = b + yi (αi − β i ), i = 1,K, n
Min
(Model 5)
α, β ≥ 0 In order to reduce the number of variables involved in our model and thus simplify computation. Let ηi = α i − β i . According to our definition, ηi = α i for all misclassified records and
ηi = − β i
for all correctly separated records. To obtain strong
convexity to the objection function, we add
ωb 2
b2 to Model 5’s objective function.
The weight Wb is an arbitrary positive number and ωb
<< ωβ . Model 6 becomes [8]:
Multiple Criteria Mathematical Programming and Data Mining n W ω n 1 || w ||22 + α ∑ηi2 + ωβ ∑ηi + b b2 2 2 i =1 2 i =1 S . T . (xi , w ) = b + yiηi , i = 1, K, n
13
Min
(Model 6)
η≥0 5 Multiple Criteria Fuzzy Linear Programming Instead of identifying a compromise solution for the separation of data in MCLP, the fuzzy approach classifies the data by seeking a fuzzy (satisfying) solution obtained from a fuzzy linear program (FLP) [7]. Let y1L be MSD and y 2U be MMD, then one can assume that the value of Maximize Σαi to be
y1U and that of Minimize Σαi to
be y 2 L . The classification problem is equivalent to the following fuzzy linear program (Model 7):
Min ξ S.T .
ξ≤
∑α
ξ≤
∑β
i
− y1L
y1U − y1L i
− y2 L
(Model 7)
y2U − y2 L
(x i , w ) = b + yi (αi − βi ),
i = 1,K, n
α, β ≥ 0 Note that Model 7 will produce a value of
ξ
with 0 ≤ ξ
< 1 . To avoid the trivial
solution, one can set up 0 ≤ ε < ξ , for a given ε . Therefore, seeking Maximum ξ in the FLP approach becomes the standard of determining the classifications between Good and Bad records in the database. A graphical illustration of this approach can be seen from Fig. 2, any point of hyper plane 0 < ξ < 1 over the shadow area represents the possible determination of classifications by the FLP method.
6 Multi-group Multiple Criteria Mathematical Programming The above models are concerned with two groups’ case. Now suppose we have k groups, G1, G2,…, Gk, are predefined. Gi ∩ G j = Φ, i ≠ j ,1 ≤ i, j ≤ k and
xi ∈ {G1 ∪ G2 ∪ ... ∪ Gk } . A series of boundary scalars b1
14
Y. Shi et al.
Let w =
( w1 ,..., wm )T ∈ R m be a vector of real number to be determined. Thus, we
can establish the following linear inequations [14; 8]: (xi, w) < b1,
∀xi ∈ G1;
(1)
bj-1 ≤ (xi, w) < bj,
∀xi ∈ Gj;
(2)
(xi, w)≥ bk-1,
∀xi ∈ Gk;
(3)
2 ≤ j ≤ k-1, 1≤ i ≤ n. A mathematical function f can be used to describe the summation of total overlapping while another mathematical function g represents the aggregation of all distances. The final classification accuracies of this multi-group classification problem depend on simultaneously minimize f and maximize g . Thus, a generalized bicriteria programming method for classification can be formulated as Model 8:
Min
f
Max S. T .
g (1), (2), and (3)
(Model
8)
Furthermore, to transform the bi-criteria problems of the generalized model into a single-criterion problem, weights ωα > 0 and ωζ > 0 are introduced for
f (α ) and g (ζ ) , respectively. The values of ωα and ωζ can be pre-defined in the process of identifying the optimal solution. As a result, the generalized model can be converted into a single-criterion mathematical programming model as Model 9: k
n
Min ωα ¦¦ α i , j j =1 i =1
S. T .
p
n § − ωζ ¨ ¦ ¦ ζ i , j ¨ j =1orj = k i =1 ©
(x i , w ) = b j + α i , j − ζ i , j , 1 ≤ (x i , w ) = b j −1 + α i , j −1 − ζ i , j −1 ,
k −1 n
p
− ¦¦ j = 2 i =1
b j − b j −1 2
· − ζ i, j ¸ ¸ p ¹
j ≤ k −1
(4)
2≤ j≤k
(5)
ζ i , j −1 ≤ b j − b j −1 2 ≤ j ≤ k
(6)
ζ i , j ≤ b j +1 − b j 1 ≤ j ≤ k − 1
(7)
Here xi is given, w and bj are unrestricted, and
α i, j , ζ i , j ≥ 0 , 1 ≤ i ≤ n.
(6) and (7) are defined as such due to the fact that the distances from any correctly classified data (x i ∈ G j , 2 ≤ j ≤ k − 1 ) to two adjunct boundaries bj-1 and bj must be less than bj - bj-1 . A better separation of two adjunct groups may be achieved by the following constraints which have stronger limitation on ζ i : j
Multiple Criteria Mathematical Programming and Data Mining
ζ i, j ≤ (bj
- bj-1 )/2+ε, 2 ≤
ζ i, j ≤ (bj+1
- bj )/2+ε, 1 ≤
15
j≤k
(8)
j ≤ k −1
(9)
ε ∈ ℜ+
is a small positive real number. Let p = 2, then objective function in Model 1 can now be a quadratic objective and we have Model 10 as shown below: k −1 n b − b n k n ⎛ j −1 Min ωα ∑∑ α i , j − ωζ ⎜ ∑ ∑ ζ i , j − ∑∑ j − ζ i, j p p ⎜ j =1orj = k i =1 2 j = 2 i =1 j =1 i =1 ⎝ S. T . (4), (5), (8), and (9)
Note that the constant
(
b j − b j −1
2
⎞ ⎟ ⎟ p⎠
) 2 is omitted from the Model 6 without any ef-
fect to the solution.
7 Regression Method by Multiple Criteria Linear Programming MCLP can also be applied to regression problem. The data set of the regression problem is T = {( x1 , y1 ), ( x2 , y 2 ), K , ( xn , yn )} , where T
T
T
xi ∈ R m is the input variable,
yi ∈ R is the output variable, which can be any real number. Define the G and B as +
−
“Good” and “Bad”, respectively, then the D MCLP and D MCLP data sets for MCLP regression model are constructed. With these data sets, MCLP regression model can be written as Model 11 [10]: n
Min
∑ (α i =1
S. T .
i
− α i ') − Max
n
∑ (β i =1
i
− β i ')
xi1w1 + L + xim wm + ( y1 + ε )wm +1 = b − α1 + β1 L xn1w1 + L + xnm wm + ( yn + ε )wm +1 = b − α n + β n
for all ∈ G
L xn1w1 + L + xnm wm + ( yn − ε )wm +1 = b + α n '− β n '
for all ∈ B
xi1w1 + L + xim wm + ( y1 − ε )wm +1 = b + α1 '− β1 '
α , α ' , β, β ' ≥ 0 Aggregation of Good samples: +
D MCLP = {((x i , y i + ε ) , +1) , i = 1, L , l } T
T
16
Y. Shi et al.
Aggregation of Bad samples: −
D MCLP = {((x i , y i − ε ) , −1) , i = 1, L , l } T
T
8 Applications The multi-criteria data mining techniques reviewed above have yielded fruitful results in diverse applications. Kou [8] applied the Multiple Criteria Quadratic Programming to credit card risk analysis and obtained comparable results with some sophisticated methods. Classification of HIV-1 mediated neuronal dendritic and synaptic damage is another successful example of the multi-criteria data mining techniques [15]. Kou et al. [16] introduced this technique to network surveillance and intrusion detection system. This approach has also been applied to predict firm bankruptcies [17, 18]. Zhang et al. [19] employed the both Multiple-Criteria Linear and Quadratic Programming in VIP e-Mail behavior analysis. In addition to these applications, some of the models mentioned above have played important roles in building the national credit scoring system in China as well as an insurance fraud detection system in USA, in witch tera-bytes of data have been handled for business intelligence.
9 Conclusions This paper has reviewed various multi-criteria programming data mining models. These methods are different from statistics, decision tree induction, and neural networks. We have discussed 11 models related to basic Multiple Criteria Linear Programming (MCLP), MCLP Multiple Criteria Quadratic Programming (MCQP), Multiple Criteria Fuzzy Linear Programming, Multi-Group Multiple Criteria Mathematical Programming, as well as regression method by Multiple Criteria Linear Programming. These models have
been successfully applied in many real-life applications, such as credit assessment management, information intrusion, bio-informatics, etc. The purpose of the paper is to share the research results and promote research interests in the international community of computational sciences. Acknowledgments. This work was partially supported by National Natural Science Foundation of China (Grant No. 70621001, 70531040, 70501030, 10601064), National Natural Science Foundation of Beijing (Grant No. 9073020), 973 Project of Chinese Ministry of Science and Technology (Grant No. 2004CB720103), and BHP Billiton Cooperation of Australia.
References 1. Cortes, C., Vapnik, V.: Support-vector Network. Machine Learning 20, 273–279 (1995) 2. Mangasarian, O.L.: Linear and Nonlinear Separation of Patterns by Linear Programming. Operations Research 13, 444–452 (1965) 3. Charnes, A., Cooper, W.W., Rhodes, E.: Measuring the Efficiency of Decision-making Units. European Journal of Operations Research 3(4), 339 (1979)
Multiple Criteria Mathematical Programming and Data Mining
17
4. Freed, N., Glover, F.: Simple but Powerful Goal Programming Models for Discriminant Problems. European Journal of Operational Research 7, 44–60 (1981) 5. Shi, Y., Wise, M., Luo, M., Lin, Y.: Data Mining in Credit Card Portfolio Management: A Multiple Criteria Decision Making Approach. In: Proceedings of International Conference on Multiple Criteria Decision Making, Ankara, Turkey (2000) 6. Li, A.H., Shi, Y., He, J.: MCLP-based Methods for Improving “Bad” Catching Rate in Credit Cardholder Behavior Analysis. Applied Soft Computing 8(3), 1259–1265 (2008) 7. He, J., Liu, X., Shi, Y., Xu, W., Yan, N.: Classifications of Credit Cardholder Behavior by using Fuzzy Linear Programming. International Journal Of Information Technology And Decision Making 3(4), 633–650 (2004) 8. Kou, G.: Multi-Class Multi-Criteria Mathematical Programming and its Applications in Large Scale Data Mining Problems, PhD Dissertation, University of Nebraska Omaha (2006) 9. Kou, G., Liu, X., Peng, Y., Shi, Y., Wise, M., Xu, W.: Multiple Criteria Linear Programming to Data Mining: Models, Algorithm Designs and Software Developments. Optimization Methods and Software 18, 453–473 (2003) 10. Zhang, D.L., Tian, Y.J., Shi, Y.: A Regression Method by Multiple Criteria Linear Programming. In: 19th International Conference on Multiple Criteria Decision Making (2008) 11. Shi, Y.: Multiple Criteria and Multiple Constraint Level Linear Programming: Concepts. World Scientific Publishing Co., Singapore (2001) 12. Shi, Y., Peng, Y., Xu, W., Tang, X.: Data Mining Via Multiple Criteria Linear Programming: Applications in Credit Card Portfolio Management. International Journal of Information Technology and Decision Making 1, 131–151 (2002) 13. Shi, Y., Yu, P.L.: Goal Setting and Compromise Solutions. In: Karpak, B., Zionts, S. (eds.) Multiple Criteria Decision Making and Risk Analysis Using Microcomputers, pp. 165– 204. Springer, Berlin (1989) 14. Kou, G., Peng, Y., Shi, Y., Wise, M., Xu, W.: Discovering Credit Cardholders Behavior by Multiple Criteria Linear Programming. Annals of Operations Research 135(1), 261–274 (2005) 15. Zheng, J., Zhuang, W., Yan, N., Kou, G., Peng, H., McNally, C., Erichsen, D., Cheloha, A., Herek, S., Shi, C., Shi, Y.: Classification of HIV-1 Mediated Neuronal Dendritic and Synaptic Damage Using Multiple Criteria Linear Programming. Neuroinformatics 2, 303– 326 (2003) 16. Kou, G., Peng, Y., Yan, N., Shi, Y., Chen, Z., Zhu, Q., Huff, J., McCartney, S.: Network Intrusion Detection by Using Multiple-Criteria Linear Programming. In: Chen, J. (ed.) Proceedings of 2004 International Conference on Service Systems and Service Management, Beijing, China, July 19-21, pp. 806–809 (2004) 17. Kwak, W., Shi, Y., Cheh, J.J.: Firm Bankruptcy Prediction Using Multiple Criteria Linear Programming Data Mining Approach. Advances in Financial Planning and Fore-casting 2, 27–49 (2006) 18. Kwak, W., Shi, Y., Eldridge, S., Kou, G.: Bankruptcy prediction for Japanese firms: using Multiple Criteria Linear Programming data mining approach. International Journal of Business Intelligence and Data Mining 1(4), 401–416 (2006) 19. Zhang, P., Zhang, J.L., Shi, Y.: A New Multi-Criteria Quadratic-Programming Linear Classification Model for VIP E-Mail Analysis. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007. LNCS, vol. 4488, pp. 499–502. Springer, Heidelberg (2007)
HPC Opportunities and Challenges in e-Science Fabrizio Gagliardi Microsoft Research, Technical Computing, EMEA and LATAM Director Phone: +41 78 844 6476
[email protected]
Abstract. In the last few years a new paradigm has emerged in science: extensively use of simulation techniques and software modeling, running on a distributed high performance computing electronic infrastructure. This paradigm is referred to as electronic Science or e-Science. Besides computer simulation, it uses huge amounts of distributed and shared data captured by instruments or sensors and/or stored in databases, analyzed to provide new results for science. This distributed HPC and data ecosystem enables the sharing of acquired knowledge, remote access to resources and above of all a world-wide scientific collaboration. Keywords: e-Science, Grid computing, Cloud, elastic computing, multi-core architectures.
The EU Datagrid project was one of the first examples of Grid computing going in this direction, which was followed by the EGEE (Enabling Grids for Escience) project. The research community and the High Energy Physicists at CERN were among the first to adopt Grid computing. The EGEE projects has to date integrated more than 50.000 CPUs in Europe and beyond, and 20 Peta Bytes (millions of GigaBytes) of storage, serving multiple application communities including HEP, Bioinformatics, Astrophysics, Computational Chemistry, Earth Sciences, Fusion. Some business/industrial applications are also adopting this distributed HPC computing model such as automotive, finance, multimedia, and there also a few examples of e-Government ones such as in the civil protection area. Thus, Grid computing has delivered an affordable and high performance computing infrastructure to scientists all over the world for solving intense computing problems within constrained research budget. Business or industrial entities have also used similar technologies to increase the usage of their computing infrastructure and reduce their total cost of ownership (TCO). In addition, Grid computing is leveraging the advanced research networks to deliver an effective and irreplaceable channel for international collaboration. Issues which hinder a wider adoption of grid technology in e-Science and industry have to do with the cost of operations and the overall complexity of the Grid, which aims at delivering secure and reliable services over widely distributed non homogeneous resources belonging to different administrative domains. The EGEE project, for instance, is spending more than 30 million € per M. Bubak et al. (Eds.): ICCS 2008, Part I, LNCS 5101, pp. 18–19, 2008. © Springer-Verlag Berlin Heidelberg 2008
HPC Opportunities and Challenges in e-Science
19
year (around half is covered by the EC) to run and support the 50.000 CPUs infrastructure (operations, middleware development and certification, application support, training, dissemination, etc.). Besides the operational expenditures, one should take into account the depreciated capital expenditures of the infrastructure. Hardware costs of the 50.000 CPUs and the 20PB storage should be in the order of 100 million Euros, depreciated over 5 years, results for another 20 million Euros per year. Power consumption and heat dissipation are also becoming an important new factor that needs to be considered seriously. Taking the rough estimation of 10% of the hardware costs, this should add another 10 Euros per year operational expenditures. Supposing that the (over-provisioned) connectivity costs are covered anyway by the National Research Networks, this sums up to around 60 million € per year. This is comparable to the estimated 48M € figure that the EGEE usage would have cost, if performed with Amazon Elastic Computing and Simple Storage Services (presented by the EGEE project director in the 2008 EGEE User Forum). Although calculations are not accurate, they show that the grid and the cloud now are in the same order of costs. Thus elastic computing, Computing on the Cloud, Data Centres and Service hosting are offering on demand CPUs and storage with similar pricing. As an example, Amazon Elastic Computing (EC2) offers a small instance CPU hour for 0,10 USD, and is quite easy to use. In addition, it charges 0,10 USD per GB for data transfer in and 0,18 USD for data transfer out (of their systems). For datasets that stay at the Amazon system, one has to use the Amazon S3 services, which have an additional cost of 0,15 USD per GB per month. Other major stakeholders in the market such as SUN, Google and IBM are moving in the same direction towards offering similar services of on-demand computing, storage and hosting. Emerging multi-core architectures and CPU accelerators promise potential breakthroughs, and in the future one might not have to rely on computer clusters, the cloud and the grid, rather afford her/his own personal supercomputer desk top or desk side Microsoft is actively investigating this field, and the Technical Computing in Microsoft Research, is supporting e-Science initiatives in collaboration with leading scientists around the world. We need to advance in making computing easy to use for the scientists to concentrate their energy in real science and not the computing tools!
Integrated Data and Task Management for Scientific Applications Jarek Nieplocha1, Sriram Krishamoorthy1, Marat Valiev1, Manoj Krishnan1, Bruce Palmer1, and P. Sadayappan2 1
Pacific Northwest National Laboratory, Richland, WA 99352, USA {jarek.nieplocha,sriram,marat.valiev, manoj,bruce.palmer}@pnl.gov 2 The Ohio State University, Columbus, OH 43210, USA
[email protected]
Abstract. Several emerging application areas require intelligent management of distributed data and tasks that encapsulate execution units for collection of processors or processor groups. This paper describes an integration of data and task parallelism to address the needs of such applications in context of the Global Array (GA) programming model. GA provides programming interfaces for managing shared arrays based on non-partitioned global address space programming model concepts. Compatibility with MPI enables the scientific programmer to benefit from performance and productivity advantages of these high level programming abstractions using standard programming languages and compilers. Keywords: Global Array programming, computational kernels, MPI, task management, data management.
1 Introduction Since the dawn of distributed memory parallel computers, the development of application codes for such architectures has been a challenging task. The parallelism in the underlying problem needs to be identified and exposed; the data and computation then must be partitioned and mapped onto processors to achieve load balancing, and finally the interprocessor communication required to exchange the data between individual processors has to be carefully orchestrated to avoid deadlocks and unnecessary delays. When communication costs cannot be completely eliminated, alternative approaches should be taken to minimize the adverse effects of communication on scalability. To achieve good performance as well as scalability, knowledge of the network topology, memory hierarchy, and even some understanding of the underlying implementation of communication libraries has been required. Factors such as these have made parallel programming a difficult task, leaving it to a limited number of expert scientific programmers. M. Bubak et al. (Eds.): ICCS 2008, Part I, LNCS 5101, pp. 20–31, 2008. © Springer-Verlag Berlin Heidelberg 2008
Integrated Data and Task Management for Scientific Applications
21
Over the last two decades, a number of high level programming languages and libraries have been created to address the challenges of the software development for scalable architectures. Unfortunately, most of these high-level programming models have not been given enough time and/or resources to mature and advance from the proof-of-concept to the production stage. There are several reasons contributing to this problem, including: immature run-time systems used to implement advanced programming models, shortage of funding available to the research community that would be required for adequate validation, testing, debugging, and optimizing of prototype programming models, constantly evolving and advancing parallel architectures, and unrealistic expectations from the users about performance and scalability of applications implemented using prototype implementations of novel programming models. For over a decade, we have been working on the development of the Global Arrays (GA) programming toolkit[1]. By working closely with application developers, we have been fortunate to be able define, tune, and evaluate the feature set and implementation choices for advancing GA. One of the key decisions in development of GA was interoperability with the mainstream programming model in scientific computing, MPI. GA has enabled scientific programmers to start with the low-level, low-productivity standard and use more advanced features of globally addressable data structures. The global address space abstractions can greatly improve programmer productivity by freeing the programmer from explicitly partitioning data and orchestrating the communication required to access the data. They allow focussed efforts on other key aspects of parallel computations such as parallelism or load balancing. The GA toolkit has in fact been adopted by several very large applications and used successfully by scientists without any formal training in parallel computing. This paper provides an overview of the integration of data and task parallelism in the context of the Global Array programming model. An overview of the GA capabilities is provided. An application example is provided to show how these capabilities can be used in a real complex scientific application that requires advanced management of distributed data and tasks executing on processor groups.
2 Application Motivations Exploiting all available forms of parallelism is becoming increasingly important for programming forthcoming high-end systems. Such systems, containing tens or hundreds of thousands of processors, present a challenge to many important scientific applications. Many applications that require these high-end systems tend to be composed of algorithms with variable computation/communication granularity. The question on how to partition computational resources and manage them to execute the overall application effectively is becoming critical to our ability to take advantage of the massively parallel hardware. One strategy to limit the negative effect of Amdahl’s law on the overall efficiency and scalability of the application is execute the finer granularity algorithms on smaller subsets of processors, where their efficiency and speedup are high. In many important problem areas such as environmental remediation, drug and enzyme design, and development of new energy sources, we need to gain molecular
22
J. Nieplocha et al.
level understanding of macroscopic phenomena. The fate of many macroscopic processes is often dependent upon intricate details of numerous chemical transformations at the microscopic (angstrom) level. Fundamental understanding of these phenomena is highly desirable for many large-scale practical applications in biology, energy, and climate areas, providing a way for rational control. The immense dimensions of this problem make it an ideal candidate for emerging peta and exascale computing platforms, but the necessary mathematical and software tools are inadequate or virtually nonexistent. The inherent complexity of the problem in conjunction with management of vast number of computing nodes presents challenges far beyond the conventional scientific applications codes. The presence of multiple scales requires concurrent parallel engagement and information exchange between different computational kernels (e.g. quantum, classical, continuum) with potentially thousands or more coupled simulations running at the same time. These simulations will have to dynamically managed and reconfigured subject to available computing nodes and network bottlenecks including the inherent run-time failures. Given the vast numbers of potential scenarios and outcomes, the details of the simulation cannot be anticipated ahead of time requiring intelligent software for managing complex data, scheduling processor resources and task execution.
3 Global Arrays In the traditional shared-memory programming model, data is located either in “private” memory (accessible only by a specific process) or in “global” memory (accessible to all processes). In shared-memory systems, global memory is accessed in the same manner as local memory, i.e., by load/store operations. The sharedmemory paradigm eliminates the synchronization that is required when message passing is used to access non-private data. The Global Arrays toolkit combines the best features of the shared and distributed-memory programming models [1]. It implements a shared-memory programming model in which data locality is managed by the programmer through explicit calls to functions that transfer data between a global address space (a distributed array) and local storage. In this respect, the GA model has similarities to distributed shared-memory (DSM) models [2, 3] that provide an explicit acquire/release protocol. However, the GA model acknowledges that remote data is slower to access than is local data and therefore allows data locality to be explicitly specified and hence managed. Another advantage is that GA, by optimizing and moving only the data requested by the user, avoids issues such as false sharing or redundant data transfers present in some DSM solutions. The GA model exposes to the programmer the hierarchical memory of modern high-performance computer systems, and by recognizing the communication overhead for remote data transfer, it promotes data reuse and locality of reference. The GA programming model includes as a subset message passing; in particular, the programmer can use full MPI functionality on both GA and non-GA data. The Global Array toolkit can be used as a distributed array library in an MPI-based application or as a complete programming environment based on a shared-memory approach. The core capabilities of GA are in the area of management of dense distributed arrays and a set of operations for sparse data management is available [1].
Integrated Data and Task Management for Scientific Applications
23
The library can be used in C, C++, Fortran 77, Fortran 90 and Python programs. The capabilities of the GA toolkit include: 1.
The GA toolkit provides extensive support for controlling array distribution and accessing locality information. Global arrays can be created by (1) allowing the library to determine array distribution, (2) specifying decomposition only for one array dimension and allowing the library to determine the others, (3) specifying the distribution block size for all dimensions, or (4) specifying irregular distribution as a Cartesian product of irregular distributions for each axis. The distribution and locality information is available through library operations that (1) specify the array section held by a given process, (2) specify which process owns a particular array element, and (3) return a list of processes and the blocks of data owned by each process corresponding to a given section of an array.
Physically distributed data
Process Z ga_get (a,175,185,19,70,buf,10) Process Y ga_get (a,180, 210, 23,40,buf, 30)
Single, shared data structure
Process X ga_get (a,100, 200, 17, 20,buf, 100)
HJ$ UDWKHUWKDQEXI RQWDVN
Fig. 1. Left: GA manages a distributed array as a single shared data object. As shown, any process/task can access the distributed data using global indexing (e.g., using global index A(4,3,1)). Right: Any part of the array can be accessed noncollectively as if it is located in shared memory (e.g., Process X gets a block of the global array with global indices starting at (100,17) and block size=100x3).
2.
The GA toolkit offers communication calls to support for both task and data parallelism. Task parallelism is supported through the one-sided (noncollective) copy operations that transfer data between global memory (distributed/shared array) and local memory. In addition, each process is able to access directly data held in a section of a global array that is logically assigned to that process.
24
3.
4.
J. Nieplocha et al.
Atomic operations are provided that can be used to implement synchronization and ensure correctness of an accumulate operation (floating-point sum reduction that combines local and remote data) executed concurrently by multiple processes and targeting overlapping array sections. The data parallel computing model is supported through the set of collectivelycalled functions that operate on either entire arrays or sections of global arrays. The set includes BLAS-like operations (copy, additions, transpose, dot products, matrix multiplication). Some of them are defined and supported for all array dimensions (e.g., addition). Some other operations such as matrix multiplication are limited to one- or two-dimensional arrays (however, multiplication is also offered on two-dimensional subsections of higher dimensional arrays). The set of data parallel operations has been enlarged to support the requirements of TAO. The extensions included element-wise operations on arrays (e.g., elementwise addition of two arrays, or shifting diagonal). GA extends its capabilities by offering interfaces to third-party libraries in the area of linear algebra through ScaLAPACK) [4] and optimization through TAO [5, 6].
For performance reasons shared memory is used for storing global arrays within SMP nodes. Therefore, any process/task can directly access the memory allocated for a global array on any other process in the same SMP node. Although every process is guaranteed to have fast access to the portion of array it owns, all the other processes in the same SMP node are able to access this memory directly, thereby avoiding unnecessary copies. In the case of a shared memory system, such as the SGI Altix, a process can access data in the entire global array directly. An appropriate interface for task mapping to individual SMP nodes of a cluster in the parallel job was introduced to enable exploiting the performance advantages of shared memory. Exploiting processor groups is becoming increasingly important for programming next-generation high-end systems composed of tens or hundreds of thousands of processors. To preserve compatibility of GA with MPI, GA follows the MPI approach to the processor group management as closely as possible. However, with GA the management of shared data rather than the explicit interprocessor communication is the main focus area. GA includes calls to create, access, share, and destroy shared data in the framework of the processor group management of MPI. For example, Fig. 2 illustrates the concept of using shared arrays by processor groups. The three processor groups (Group1, Group2, and Group3 in Fig. 2) execute tasks that operate on three arrays: A, B, and C. Array A is in the scope of all three processor groups. Array B is distributed on processor Group 1. Array C is distributed on processor group 3. All arrays can be accessed using collective (individual and multiple arrays) and one-sided (non-collective) operations by any processor in the group that owns the array. The concept of the default processor group is a powerful capability that enables rapid development of new group-based codes and simplifies conversion of existing, non-group aware codes. Under normal circumstances, the default group for a parallel calculation in GA is the MPI world group (contains the complete set of processors), but a call is available that can be used to change the default group to a processor subgroup. This call must be executed by all processors in the subgroup. Furthermore,
Integrated Data and Task Management for Scientific Applications
25
Array A
Array C Array B
Group1
Group2 Group3
Fig. 2. An example of multilevel parallelism in Global Arrays
although it is not required, it is probably a very good idea to make sure that the default groups for all processors in the system (i.e. all processors contained in the original world group) represent a complete non-overlapping covering of the original world group. Once the default group has been set, all operations are implicitly assumed to occur on the default processor group unless explicitly stated otherwise. Shared arrays are created on the default processor group and global operations by default are restricted to the default group. Inquiry functions, such as the number of tasks and the task rank, return values relative to the default processor group.
4 Task Pools Task parallelism is a popular technique for expressing parallelism in programs that exhibit irregular, sparse, or nested parallelism. Mixed task and data parallelism exists naturally in many application programs. Integrating task and data parallelism improves application performance in practice, however utilizing it may require sophisticated scheduling algorithms and software support [8]. In such programs, static partitioning can often lead to load imbalance due to irregularity in the problem spatial domain, sparsity in the data, or algorithmic characteristics of the problem where computational effort is not directly correlated with the data sizes. By decomposing the problem into tasks and dynamically mapping the computation onto available resources, these classes of applications are able to achieve scalable performance. In addition to overcoming irregularity in the computation, dynamic task scheduling can also be used to mitigate irregularity in the hardware that may be introduced through heterogeneity among processors or in the memory hierarchy. In the early stage of development, GA model was motivated by the needs of electronic structure computational chemistry applications that deploy task level parallelism. These applications relied on atomic increment of a shared task counter to assign dynamically tasks to individual processors. However, the development of more
26
J. Nieplocha et al.
complex task management schemes has not been pursued by the application developers. Recently, we have been designing different task pool management systems complementary to the GA model. Some early efforts were pursued in context of the Tensor Contraction Engine (TCE) to manage sparse tensor contraction operations performed by coupled cluster models for ab initio electronic structure modeling. This includes locality-aware load-balancing for in-memory computations [9], transparent memory hierarchy management for out-of-core programs [10], and work-stealing techniques [11]. All these approaches focused on tasks that are sequentially executed on a single processor. We have been working with application developers of quantum chemistry codes to define a task management pool suitable for more dynamic schemes and applicable to tasks executed on processor groups rather than individual processor. Moreover, depending on the problem and molecular properties, tasks can vary significantly in their requirements for memory and processor resources. The abstraction provided to the user, shown in Fig. 3, enables the specification of a set of independent tasks to be executed in parallel. For each such set, all processes collectively create a task pool object using the create task pool method. Each task in the task pool is identified by the routine to be invoked to process that task, identified by a function handle, and the set of locality elements it operates upon. In addition, any private data specific to that task can also be specified. Each locality element corresponds to a global data region, identified by its global address, size, and its access mode. Three access modes are supported. Read, write, and access modes allow for put, get, and accumulate of global data. For dense and block-sparse arrays, the global address is replaced by the array handle and the specification of the data region being accessed. Tasks are added to a task pool using the add task method. The creation and addition of tasks to the task pool is done by all processors. Once all the tasks have been added to the task pool, the seal task pool method is used to seal
task pool Task A
Task B
Task C
Task D
Processor Group Manager
Dispatcher
Task A
Task E
Task B
Task C
Fig. 3. Task Pool Management
processor resources
Integrated Data and Task Management for Scientific Applications
27
the work pool. This method is invoked once for a task pool and is used to perform start-time optimizations. Subsequently, Dispatcher processes the task pool and calls Processor Group Manager to create and appropriately sized processor groups. Dispatcher then assigns tasks to the processor groups to process the tasks in the task pool. Once a task is finished a processor group can be assigned another task or destroyed. A task pool, once created, can be processed multiple times. The cost of start-time optimizations, performed once, can thus be amortized over multiple cycles. The task pool approach for processor groups appears quite attractive for building applications with multi-level parallelism. Decomposition of the problem into tasks to be assigned to different processor groups is in particular attractive for massively parallel systems and problems that include some parts that lack sufficient parallelism to be executed on all the processors the application is using. Our approach for integrating task and data parallelism has several performance benefits in practice. Earlier efforts [12, 13] have pursued similar goals. However they are either compile-based approach or not suited for irregular computations. Moreover, these approaches do not offer much control to the user. For example, they are more biased to task parallelism and offer less support for data parallelism, or vice versa. Some of the earlier approaches are based on MPI processor group model, which imposes additional constraints on the task parallelism as outlined in Section 4.1. In addition, our approach uses global address space model which offers significant productivity advantages in the data management area. 4.1 Processor Group Management One of the design obstacles involved overcoming the limitations of the MPI processor group management. Under MPI all the processors in the parent group have to participate in the subgroup creation process. This constraint makes it impossible to create and destroy on-demand processor groups to match requirements of tasks on top of the queue. We designed a more flexible group management system and integrated it with ARMCI runtime-system that GA uses [7]. ARMCI in particular implements a basic set of collective communication calls on processor groups. The subgroup creation process is coordinated between processors that form a subgroup. However, this coordination can be implicit and is implemented without use of collective operations. The only assumption is that all the processors in the subgroup must be aware of the group membership.
5 Application Example An important representative problem where the issues outlined in Section 2 start to play an important role can be found in dynamical simulation of soft matter system consisting of collection of loosely bound molecules (e.g. liquid water). Examples of such systems can be found in wide range of applications related to environmental remediation, catalysis, biology, and other areas. To provide a realistic description of these systems requires consideration of relatively large fragments (more than 103 atoms) that, combined with periodic boundary conditions, give an insight into bulk behavior which is most relevant to practical applications. Until recently problems of
28
J. Nieplocha et al.
Fig. 5. Task graph for fragment based QM approach illustrated for a system containing 4 molecules
this size could only be described by classical molecular mechanics based on empirical pair potentials. In many cases however a quantum-mechanical based description would be quite beneficial providing validation for classical models as well as a description of electronic structure properties. Given that a direct quantum-mechanical based description would be unreasonable for these large systems, alternative approaches have been developed that combine both quantum mechanical and classical methods. Among them is a fragment based quantum mechanical description which utilizes a cluster-like many-body expansions where the short range quantum mechanical effects are evaluated on the quantum mechanical level while long-range electrostatic effects are handled classically [14]. For example, in the second order (binary) fragment expansion the total energy of the system is represented by
(
E binary = ∑ Ei1 + ∑ Ei1i2 − Ei1 − Ei2 i1
i1
)
where Ei is the energy of the ith monomer and Eij the energy of the dimer made from i and j molecules of the system. These individual energy terms are obtained as the eigenvalues of the Schrödinger equation
H i1Likψ i1Lik = Ei1Likψ i1Lik Here the Hamiltonian,
H i1Lik = H i10Lik +
∑
im ∉{i1 ,K,ik }
Vim
Integrated Data and Task Management for Scientific Applications
is given by the sum of the gas phase Hamiltonian
29
H i01Lik of the isolated cluster
i1 Lik and , Vim ,the electrostatic interaction between the subcluster i1 Lik and other subunits
im (not belonging to the subcluster).
VimCoulomb ( r ) = ∑ a∈im
ρi ( r′ ) Za dr′ −∫ m r − ra r − r′
To facilitate the calculations the electrostatic potential can be approximated by the effective electrostatic charges fit to reproduce the “true” electric field on a grid point surrounding the system.
Za
∑ r −r −∫
a∈im
a
ρi ( r′ ) m
r − r′
dr′ = ∑ a∈im
Qa r − ra
The calculation in the fragment-based approach proceeds according to the following scheme, see Fig. 4. 1. For each monomer in the system the Schrodinger equation for the monomer and new charges Qa are calculated. 2. Step 1 is repeated until self-consistency is reached where charges Qa and correspondingly energies Ei are no longer changing. 3. For each dimer in the system the Schrodinger equation is solved with other molecules represented by point charges calculated in steps 1-2. Steps 1 and 2 are ideally suited for exploiting the parallel task pools approach. On one hand the monomer calculations appear fully parallel, but there is nontrivial nonlinear coupling through the electrostatic charges that they generate.
6 Experimental Results The experiment evaluation was performed on a Quadrics cluster with dual 1.5GHz Itanium nodes running Linux kernel 2.6.11. The example system considered in this work consists of 256 water molecules enclosed in a ~20A cubic box. Only the monomer part of the calculation was considered at this point. After the initialization step where the coordinates of monomer units and surrounding charges are assembled, the quantum calculations of each monomer unit are executed independently subject to available processor pool. We performed the entire self-consistent loop until charges on all the monomers have converged. This involves one-sided communication of the charges from the processor group to a global charge array which is monitored for convergence. The performance of our scheme is shown in Fig. 4, labeled task-pool. In this case the processor groups were uniformly sized and included two processors. For comparison, we evaluated the performance of the application, with each monomer calculation being performed by all the processors collectively (MPI_COMM_WORLD), denoted do-all in the figure. As our data illustrates this approach does not scale due to inherent limitation in the
30
J. Nieplocha et al.
Execution tim e (secs)
2500 task-pool
2000
do-all
1500 1000 500 0 0
10
20
30
40
50
60
70
#procs Fig. 6. Execution time for the monomer QM calculations
scalability of the quantum calculation. We observe almost linear speedup with the number of processors in our task pool-based implementation.
7 Conclusions and Future Work We described an integrated data and task management system in context of the Global Arrays toolkit that supports a global address space programming model. Our task management system can handle variable sized processor groups. This capability was used for a quantum mechanical application with complex data and task management requirements. The experimental results demonstrate very good scaling. Our plans for future work include more experimental validation with other applications, and adding locality optimization to the task pool management, and implementing a distributed version of the task pool Dispatcher to handle very large numbers of processors.
References 1. Nieplocha, J., Palmer, B., Tipparaju, V., Krishnan, M., Trease, H., Apra, E.: Advances, Applications and Performance of the Global Arrays Shared Memory Programming Toolkit. International Journal of High Performance Computing and Applications 20(2) (2006) 2. Bershad, B.N., Zekauskas, M.J., Sawdon, W.A.: Midway distributed shared memory system. In: 38th Annual IEEE Computer Society International Computer Conference – COMPCON SPRING 1993, February 22-26 1993, pp. 528–537. IEEE, Piscataway (1993) 3. Cox, A.L., Dwarkadas, S., Lu, H., Zwaenepoel, W.: Evaluating the performance of software distributed shared memory as a target for parallelizing compilers. In: 1997 11th International Parallel Processing Symposium, IPPS 1997, April 1-5 1997, pp. 474–482. IEEE, Los Alamitos (1997)
Integrated Data and Task Management for Scientific Applications
31
4. Blackford, L.S., Choi, J., Cleary, A., D’Azevedo, E., Demmel, J., Dhillon, I., Dongarra, J., Hammarling, S., Henry, G., Petitet, A., Stanley, K., Walker, D., Whaley, R.C.: ScaLAPACK: A Linear Algebra Library for Message-Passing Computers. In: Proceedings of Eighth SIAM Conference on Parallel Processing for Scientific Computing, Minneapolis, MN (1997) 5. Benson, S., McInnes, L., Moré, J., Sarich, J.: Toolkit for Advanced Optimization (TAO) User Manual. ANL/MCS-TM-242 (2004), http://www.mcs.anl.gov/tao 6. Benson, S., Krishnan, M., McInnes, L.C., Nieplocha, J., Sarich, J.: Using the GA and TAO toolkits for solving large-scale optimization problems on parallel computers. ACM Trans. Math. Softw. 33(2), 11 (2007) 7. Nieplocha, J., Tipparaju, V., Krishnan, M., Panda, D.: High Performance Remote Memory Access Communications: The ARMCI Approach. International Journal of High Performance Computing and Applications 20(2) (2006) 8. Chakrabarti, S., Demmel, J., Yelick, K.: Modeling the benefits of mixed data and task parallelism. In: Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, June 24-26, 1995, pp. 74–83 (1995) 9. Krishnamoorthy, S., Nieplocha, J., Sadayappan, P.: Data and computation abstractions for dynamic and irregular computations. In: Bader, D.A., Parashar, M., Sridhar, V., Prasanna, V.K. (eds.) HiPC 2005. LNCS, vol. 3769. Springer, Heidelberg (2005) 10. Krishnamoorthy, S., Catalyurek, U., Nieplocha, J.: Hypergraph partitioning for automatic memory hierarchy management. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC 2006) (November 2006) 11. Dinan, J., Krishnamoorthy, S., Larkins, B., Nieplocha, J., Sadayappan, P.: Scioto: A framework for global-view task parallelism (under submission) 12. Bal, H.E., Haines, M.: Approaches for Integrating Task and Data Parallelism. IEEE Concurrency 6(3), 74–84 (1998) 13. Rauber, T., Rünger, G.: Library support for hierarchical multi-processor tasks. In: Proceedings of the 2002 ACM/IEEE conference on Supercomputing, November 16, 2002, pp. 1–10 (2002) 14. Kamiya, M., Hirata, S., Valiev, M.: Fast electron correlation methods for molecular clusters without basis set superposition errors. Journal of Chemical Physics 128(7), 74103 (2008)
Why Petascale Visualization and Analysis Will Change the Rules Hank Childs Lawrence Livermore National Laboratory, Box 808, L-557 Livermore, CA 94551-0808 Phone: 925-422-4035, Fax.: 925-423-6961
[email protected]
Abstract. In the last decade, supercomputers and the scientific simulations performed on them have dramatically increased in size. Currently, simulations can use hundreds of TeraFLOPs (trillions of floating point operations per second) and generate many, many terabytes of data. In the near future, we will see PetaFLOP computing and petabytes of data. In addition, a critical step in the simulation process is “postprocessing”: applying visualization and analysis techniques to better understand the simulation. As a result, the issues of visualizing and analyzing massive data sets have never been more important. This puts the spotlight on two key issues. One, are we prepared for the unprecedented scale of data that we will need to postprocess? And, two, assuming that we can handle data of this size, can we intelligently analyze these simulations? I will argue that, for both of these questions, we must “change the rules” and make dramatic departures from our current modus operandi.
M. Bubak et al. (Eds.): ICCS 2008, Part I, LNCS 5101, p. 32, 2008. © Springer-Verlag Berlin Heidelberg 2008
Computational Modeling of Collective Human Behavior: The Example of Financial Markets Andy Kirou1 , Bla˙zej Ruszczycki1 , Markus Walser2 , and Neil F. Johnson1 1
2
Department of Physics, University of Miami, P.O. Box 248046, Coral Gables, FL 33124 USA Landesbank Baden-W¨ urttemberg, Am Hauptbahnhof 2, 70173 Stuttgart, Germany
[email protected]
Abstract. As a result of the increased availability of higher precision spatiotemporal datasets, coupled with the realization that most realworld human systems are complex, a new field of computational modeling is emerging in which the goal is to develop minimal models of collective human behavior which are consistent with the observed real-world dynamics in a wide range of systems. For example, in the field of finance, the fluctuations across a wide range of markets are known to exhibit certain generic stylized facts such as a non-Gaussian ‘fat-tailed’ distribution of price returns. In this paper, we illustrate how such minimal models can be constructed by bridging the gap between two existing, but incomplete, market models: a model in which a population of virtual traders make decisions based on common global information but lack local information from their social network, and a model in which the traders form a dynamically evolving social network but lack any decision-making based on global information. We show that a combination of these two models – in other words, a population of virtual traders with access to both global and local information – produces results for the price return distribution which are closer to the reported stylized facts. Going further, we believe that this type of model can be applied across a wide range of systems in which collective human activity is observed. Keywords: complex systems, socio-economic systems, virtual traders, collective behavior.
1
Introduction
Socio-economic systems were traditionally treated from the points of view of game theory or traditional economic theory. These approaches – while undoubtedly successful in terms of gaining insight into core features – are unable to address the issue of how and why such systems produce the fluctuating external signals that they do [1,2,3,4,5]. Human systems as diverse as traffic, Internet downloads, and financial markets, are all known to produce large-scale fluctuations – for example, in the number of cars taking a certain road, or the number of people accessing a certain website, or the number of people trying to sell a stock at certain times [1,2,3,4,5]. In previous decades, there was typically an insufficient amount of reliable data available for researchers to address such problems M. Bubak et al. (Eds.): ICCS 2008, Part I, LNCS 5101, pp. 33–41, 2008. c Springer-Verlag Berlin Heidelberg 2008
34
A. Kirou et al.
of dynamics. Nowadays, with the increase in online logging of data – from social, governmental and commercial sectors – this area of modeling now becomes very attractive. However few advances are likely to be made analytically, since any meaningful explanation of the dynamics must be related back to what the collection of individual objects are doing. In other words, it is what physicists call a many-body problem – one in which the objects are subjected to endogenous and exogenous feedback and nonlinear interactions – and it is known that such many-body problems are in general intractable. Given the additional feature that the objects themselves may be semi-autonomous (i.e. they each have some form of independent decision-making ability such that a given external input may yield various possible outputs depending on some internal state of the object itself) the only realistic route toward advancing our understanding of such systems must surely be driven by computational modeling and simulation. In short, such socio-economic systems are complex – and the key to understanding the dynamics of such complex systems is provided by computer simulation. Among the wide range of socio-economic fields that have attracted the interest of complexity scientists, is the goal of trying to understand financial market dynamics [1,2,3,4,5]. This is partly because financial markets produce such high frequency data, and partly because the possible actions of an individual trader are quite simple: buy, sell or do nothing at any timestep. A wide range of interesting stylized facts have emerged based on analysis of the real market data over a wide range of timescales – from seconds through to days, weeks and months. In particular, it has been found that the distribution of price returns (i.e. changes in price between a given time t and a time t + Δt later) do not follow the simple distribution expected from a random walk. The standard model of a financial market – based on the efficient market hypothesis – is that price-changes are like the toss of a coin. They are supposedly independent – hence if we assume that each trader trades according to the toss of a coin, then the probability of buying and selling would a priori be 12 if we ignore the ‘do nothing’ option. Counting a head as +1 in terms of price change, and a tail as −1, the probability distribution for having a given price-change ΔP = Nbuy − Nsell is simply the probability of obtaining Nbuy heads and Nsell tails from N coin-tosses, such that N = Nbuy + Nsell . This is a binomial expression, which then approaches a Gaussian in the large-N limit. We note in passing that it is more common in the finance literature to consider the logarithm of price-changes rather than the price-change itself, hence the distribution of returns in the ideal, random-walk market is log-normal. However the two distributions are essentially indistinguishable in most financial markets, since the returns are typically much smaller than the prices themselves.
2
Collective Non-randomness in the Human World
As a rough first approximation, financial market behavior is not far from the Gaussian model. However, many independent detailed empirical studies of financial market returns have confirmed that major deviations begin to arise
Computational Modeling of Collective Human Behavior
35
in the tails of the distribution [1,2,3,5]. Specifically, the distribution of pricechanges ΔP deviates from Gaussian behavior even at moderate values of ΔP . In particular, the probability of intermediate-to-large price-changes is larger than the random coin-toss model would suggest. This leads to the so-called ‘fat tail’ terminology which is often used to describe real financial markets when they ‘misbehave’. In fact, such fat-tailed behavior is common across a wide range of socio-economic domains [1]. In many scientific settings such as physics, such deviations from Gaussian behavior in the tail of the distribution might be considered a mere detail, since the average behavior of the system is typically what counts. However real-world finance is all about risk – in particular, the risk of large unexpected price-changes – and so these deviations are actually the most important features of the distribution, contributing to abnormally high estimates of the moments of the distribution such as the variance. The fact that large price-changes are more likely than expected – and in more general socio-economic settings, that large traffic jams or heavy Internet downloads are more likely than expected – suggests that the population is unintentionally behaving in a coordinated way. It is as though the supposedly independent coin-tosses of the N traders are not in fact independent: when one comes up heads, they are all more likely to come up heads, and vice versa with tails. It is as though the population of traders was inter-connected in some way. The fact that getting the best price in a financial market is a competitive activity – in the same way that managing to grab space on a busy road, or a download on a busy website, are also competitive – means that such coordination is very unlikely to have arisen through some intentional population-level decision making. There is no central controller – and even if there were, the fact that individual objects are competing to win means that no central controller would necessarily be listened to or followed by individual members of the population. This coordination observed in many scenarios where populations of humans are competing for some limited resource, thereby leading to larger than random probability for large events, is characteristic of many human systems [1,4]. But if so, what causes it and how can we provide a quantitative model of it? Because of the generic nature of the fat-tail statistics, any useful model should not depend on the details of the particular market or type of trader, or road or type of car, or website or type of computer. Instead it must be some fairly general feature of collective human activity. The fundamental question as to what underlying model might best represent such collective coordination, has inspired a new breed of computer-based scientific investigation involving physical, biological and social scientists. At its root, a system such as a financial market, traffic system, or the Internet, involves agents (i.e. people) deciding between a few options (e.g. buy, sell, do nothing) based on some limited information – which may be global or locally generated – and then competing with the remaining agents for the available resource or reward. Any collective coordination will require some form of trader inter-connectedness. One way in which this could have arisen, is if subsets of the traders form social groups such that they and their immediate friends or associates, coordinate
36
A. Kirou et al.
their actions (i.e. bias their decisions and hence effectively connect their coins during the coin-toss). In fast-moving financial markets, such groups are likely to change fairly rapidly, and should at least be accounted for using dynamical models of such group formation. This idea has led to a particular class of models based on dynamical cluster formation. Notable examples include the dynamical clustering model of Egu´ıluz and Zimmermann [7] and of others in biology [6], [8]. A second way in which coordination could have arisen, concerns how agents react to a particular piece of common information. Models of this form, of which a notable example is the so-called Grand Canonical Minority Game [9], feature agents whose actions are dictated by a strategy (or set of strategies). In the first case of real clusters, the grouping is intentional, while in the second case agents form unintentional groups (i.e. crowds) as a result of using the same strategy at the same time and hence acting identically over a short period of time. These two classes of model are complementary. Each of these models is ‘minimal’ in the sense that they are the simplest known examples which seem to capture the essential ingredients of clustering and decision-making respectively. To date, the two classes of model have been studied separately – however, they should clearly both be combined in order to understand the interplay of local and global information on collective group formation and hence the collective dynamics. In this paper, we take the first steps in this direction of analyzing a collective human system in which there are local interactions as observed in the Egu´ıluz and Zimmermann [7] model (i.e. E-Z model) and global interactions as observed in the Grand Canonical Minority Game [9] (i.e. GCMG). The focus of this paper is to show how adding global interactions to the E-Z model, does indeed improve the fit with the known empirical distributions of financial market returns. Our construction is a modified E-Z model in which the agents are randomly assigned the trading strategies and apply their strategy based on the last two price movements. Unlike the full GCMG, the model does not include an explicit strategy score. Instead, the system behaves as a relative majority voting system.
3
Relative Majority Vote
The relative majority vote system is specified by two parameters, the total number of agents N and the consensus parameter x. To set up a timescale, we need to prescribe some form of timescale constant. At each time-step, an agent is chosen at random and the group to which the agent belongs is identified. The size of this group is denoted as s. Once a particular group has been identified, it makes a decision in the following way: Each agent votes either to sell, buy or wait (see Fig. 1) with approximate probability 1/3 for each of the listed options. If the number of votes for the most popular decision exceeds the threshold, which is defined as T ≡x·s (1) the consensus is reached and the decision is performed. Otherwise there is no consensus and the group fragments into single individuals. The group that decides to wait does not trade, but instead merges with another group by choosing
Computational Modeling of Collective Human Behavior
37
Global information 10 m(10) = 2
+1
+1 0
0
+1
1
-1
2
0
3
-1
-1
consensus?
yes
wait > buy & wait > sell
global outcome is 0 cluster merges
sell > buy & sell > wait
buy > sell & buy > wait
global outcome is 0
global outcome is +1
no
in case of a tie one of the tied actions is picked at random
global outcome is 0 cluster fragments
Fig. 1. Schematic diagram of the decision process in our multi-agent model
randomly any other agent from the entire population and then joining with the group to which this agent belongs. For a particular group of size s, let us denote the number of agents who vote to sell, buy or wait (and merge with another group) as S, B, W respectively. The conditions for the group decision are as follows: Fragments: (W < T ) ∧ (S < T ) ∧ (B < T ) Buys: (B ≥ T ) ∧ (B > S) ∧ (B > W) (2) Sells: (S ≥ T ) ∧ (S > B) ∧ (S > W) Merges: (W ≥ T ) ∧ (W > B) ∧ (W > S) We also need to account for the fact we may have a tied number of votes. This is resolved by randomly picking one of the two tied decisions, e.g. if (S ≥ T ) ∧ (S = B) ∧ (S > W) then the group either sells or buys with equal probability. The decisions presented in Eq. (2) are exclusive, therefore the corresponding conditional probabilities (on the condition that the particular group is chosen) satisfy the equation pˆ frg + pˆ sell + pˆ buy + pˆ merge = 1 ,
(3)
where pˆ frg is the probability that the group fragments. Note that the above conditional probabilities depend on the group size s. From the symmetry of Eqs. (2) and (3) we see that it is sufficient to know pˆ frg since
38
A. Kirou et al.
Fig. 2. Cumulative distribution of price returns ΔP in arbitrary units, for the consensus parameter x = 37% (thicker solid line), x = 41% (dashed line) and x = 47% (dashed-dotted line). The number of agents is 10000. The thin solid lines indicate the scaling behavior observed for the cumulative probability distribution for returns ΔP in the pure E-Z model and for typical empirical market data [2]. The underlying probability distribution for price-changes p(ΔP ), follows a power-law p(ΔP ) ∼ (ΔP )−α over a range of ΔP values in both the E-Z and real market data, with α = 1.5 for the pure E-Z model and α ∼ 4 for empirical market data.
pˆ sell = pˆ buy = pˆ merge =
1 − pˆ frg . 3
(4)
We calculate the combinatorial expression as pˆ frg (s) =
s−1 s! 3s
W=0
min(T −1,s−W)
B=s−T −W
1 W!B!(s − B − W)!
(5)
The system may be described by mean field theory (disregarding the fluctuations and finite size effects). We denote by ns the average number of groups of size s. For the steady state, the set of master equations is semi-recursive1 and is written as N s 1 1 − pˆ frg (s)(1 − δs1 )ns − pˆ merge (s) + 2 s pˆ merge (s ) s ns N N N s =1
+
s−1 s =1
1
s ns (s − s )ns pˆ merge s + δs,1
N
pˆ frg (s )s2 ns = 0 .
s =s+1
The equation for nl depends on ni for all i = 1 . . . l − 1.
(6)
Computational Modeling of Collective Human Behavior
39
The above set may be solved numerically2 . In order to include corrections from the fluctuations and the finite size effect, we need to perform direct simulations of the system described by Eq. (6). We are interested in the situation when the consensus parameter is within the range of x = (33 1/3 %, 50 %). If x < 33 1/3 % there is no fragmentation. If x > 50 % we have the absolute majority vote condition. When x → 33 1/3 % from above, we expect the return distribution to approach the one for the original Egu´ıluz-Zimmermann system, which shows a power law with exponent 1.5 over a large scale of return sizes. As we increase x slightly above 33 1/3 %, the dominant behavior of the buy/sell probabilty pˆ buy = pˆ sell for the large groups (i.e. of order s 100) yields an exponential cut-off, while for smaller s we have the finite size effect. This modifies the model in two ways, by changing the group distribution (since the conditional probabilities enter Eq. (6)) and the trade mechanism. Unlike the E-Z system [7] where mostly the large groups trade, we expect to have the trades coming from the actions of the small groups with the exponential cut-off due to the behavior of Eq. (5).
4
Simulation Results
The simulations were performed for a system with N = 104 agents, m = 2, and 106 time steps, with three different values of the consensus parameter. The initial state of information was (1, 1). After 105 timesteps, in order to allow the system to reach equilibrium, the returns where computed as follows: if a cluster of size s decides to buy, the return is +s. If a cluster of size s decides to sell, the return is −s. After the simulation was complete, the time was rescaled by adding the returns of two consecutive timesteps since on average a transaction occurred once every two timesteps. Thus the results in Fig. 2 are effectively for 9 × 105 /2 timesteps. It is observed that indeed most of the trades come from the action of the small groups. As the consensus parameter is increased, the distribution of returns can be seen to fall more sharply due to the increasing dominance of the exponential cut-off. Our results demonstrate that the feature of allowing agents access to global information and subsequent decision-making, when built into a model focused on local group formation (i.e. E-Z), leads to a hybrid model which can better capture features of the known empirical distributions. In short, both local group formation and global information are important when building a minimal computational model of financial markets. By extension, the same statement should hold for collective human activity in any domain in which competition exists between a collection of interconnected agents.
5
Discussion
We have proposed a simple model system that represents a first step in the quest to develop minimal, individual-based computational models of real 2
The numerical procedure for solving Eq. 6 is effective for modest values of N , since at least 1/2 N 2 iteration steps are required.
40
A. Kirou et al.
socio-economic systems in which both local and global interactions are featured. Such minimal models aim to incorporate the minimum number of rules, and hence parameters, such that individuals’ behavior and interactions still appear credible; yet at the same time, the emergent dynamics should remain consistent with the maximum possible number of empirical stylized facts based on realworld data. In our particular case, we have incorporated global interactions via the heterogeneity of strategies held by the agents, as well as agent memory in the locally interacting system via the grouping mechanism. Our specific results are as follows. The scenario in which the agents are allowed to vote introduces an exponential cut-off starting on the scale for which effects connected to the discrete nature of the system may be neglected. Our results show that those who usually trade are the small groups, and that there are no trades coming from the large groups. By contrast in the original E-Z model, the conditional probabilities were constant and any particular large group trades more often than a particular small group. The most realistic minimal model (which is as yet undiscovered) should lie somewhere in between. Any voting scenario is a Poisson process which introduces an exponential cut-off into the system. This exponential cut-off appears on a scale where the number of individuals involved is sufficiently large that we may disregard the discrete nature of the system. The modeling and the computational challenge is therefore as follows: How can the present model be further enhanced such that it reflects the more complex behavior of the individuals through the possession of memory, behavior based on past experience, and the passing of information between groups concerning whether to trade or not? In terms of more general issues of computational modeling, we have tried to highlight the need to develop minimal computational models of real socio-economic systems through individual-based behavior. Future theoretical developments in such fields lie beyond simply integrating some form of phenomenological equation. Moreover, this sort of socio-economic modeling is an application of computation that is set to boom in the future given the growing availability of high-frequency data from socio-economic systems – and the fundamental philosophical need for theories which treat dynamical fluctuations in addition to mean behavior. One particular example in which this philosophy is now being developed, is in improving our understanding of human conflict – by looking at the stylized facts of conflict dynamics in exactly the same way as has been done for financial markets. Indeed, we have recently shown that remarkably similar minimal computational models can be built, exhibiting equally satisfying agreement with empirical data, simply by combining together global and local interactions among agents. This work on human conflict will be discussed in more detail elsewhere.
References 1. See for example, the wide range of publications and conferences around this common theme of computational modeling of socio-economic systems, http://www.unifr.ch/econophysics
Computational Modeling of Collective Human Behavior
41
2. Bouchaud, J.-P., Potters, M.: Theory of Financial Risk and Derivative Pricing: From Statistical Physics to Risk Management, 2nd edn. Cambridge University Press, Cambridge (2004) 3. Mantegna, R.N., Stanley, H.E.: An Introduction to Econophysics: Correlations and Complexity in Finance. Cambridge University Press, Cambridge (1999) 4. Johnson, N.F.: Two’s company, three is complexity. Oneworld, New York (2007) 5. Johnson, N.F., Jefferies, P., Hui, P.M.: Financial Market Complexity. Oxford University Press, Oxford (2003) 6. Gueron, S., Levin, S.A.: The Dynamics of Group Formation. Mathematical Biosciences 128, 243–246 (1995) 7. Egu´ıluz, V.M., Zimmermann, M.G.: Transmission of Information and Herd Behaviour: An Application to Financial Markets. Phys. Rev. Lett. 85, 5659–5662 (2000) 8. Cont, R., Bouchaud, J.-P.: Herd Behavior and Aggregate Fluctuations in Financial Markets. Macroeconomic Dynamics 4, 170–196 (2000) 9. Challet, D., Zhang, Y.C.: Emergence of Cooperation and Organization in an Evolutionary Game. Physica A 246, 407–418 (1997)
Intel’s Technology Vision and Products for HPC Pawel Gepner Intel Corporation Phone: +48 602 41 41 28
[email protected]
Abstract. Traditionally most hardware and software architectural innovations have come through High End Computing. Today, innovation moves up from the bottom (low-power) and down from the top (parallelization) but the High-End is still a main foundation of new ideas. What is in today’s supercomputer will be in tomorrow’s desktop. What Intel does for HPC and what is the Intel vision and product portfolio for HPC segment will be covered during the lecture.
M. Bubak et al. (Eds.): ICCS 2008, Part I, LNCS 5101, p. 42, 2008. © Springer-Verlag Berlin Heidelberg 2008
Grid-Supported Simulation of Vapour-Liquid Equilibria with GridSFEA I.L. Muntean, E. Elts, M. Buchholz, and H.-J. Bungartz Technische Universit¨ at M¨ unchen, Dept. of Informatics, Scientific Computing in Computer Science, Boltzmannstr. 3, 85748 Garching, Germany {muntean,elts,buchholm,bungartz}@in.tum.de http://www5.in.tum.de
Abstract. In order to benefit from grid computing, software applications in CSE often need to be substantially modified or rewritten to a large extent. To reduce the required grid know-how and effort the computational scientist (end user and software developer) needs for this task, we developed a framework for engineering simulations in grid environments (GridSFEA). This paper presents two novel features of GridSFEA: the integrated support for parameter investigations and the controlled execution of long-running simulations in grids. They allow the grid enabling of CSE applications with minimal or even without changes of their source code. Furthermore, the overhead for working in grid environments introduced by our approach, compared to working on classical HPC platforms, is very low. We provide two examples of using GridSFEA for performing vapour-liquid equilibria (VLE) simulations using Molecular Dynamics and Monte Carlo methods. To develop VLE models, parameter investigations are carried out. Large VLE scenarios are computed over a long time, to create test cases for the development of HPC software. Keywords: grid application, grid services, HPC molecular simulation, vapour-liquid equilibria, two-centre Lennard-Jones, polar fluid.
1
Introduction
Recently, grid computing environments [1] evolved from research and experimental status towards production systems, providing scientists with access to large aggregated computing and storage resources. Although the scope of such environments is limited – scenarios of capability computing typically requiring high performance resources at one place – esp. capacity computing applications (e.g., Monte Carlo (MC) simulations, parameter studies) offer a huge potential for the grid. Despite this attractiveness (due to mechanisms for security or access to distributed resources e.g.) of computing grids, they still remain underutilised and underexploited by the computational science and engineering (CSE) community. One reason for this is esp. the tedious development of grid applications and the grid middleware know-how necessary for the scientist (developer) to master. M. Bubak et al. (Eds.): ICCS 2008, Part I, LNCS 5101, pp. 45–55, 2008. c Springer-Verlag Berlin Heidelberg 2008
46
I.L. Muntean et al.
There is ongoing research to bridge the gap between CSE applications and the grid. On the one hand, development toolkits and libraries for grid applications have recently been embraced by the grid community. Such examples are Java CoG Kit [2], DRMAA [3], or JavaGAT [4]. They provide high-level API and tools for interacting with the grid, simplifying the grid software development a lot. Nevertheless, with this approach the code of existing CSE simulation software often still needs to be extended to get advantages from grids. On the other hand, frameworks for grid applications have emerged, mainly based on the above toolkits and libraries. Two representatives of such programs can be found in [5] and [6]. Since they both are tailored to their specific field, earth sciences and image processing, resp. it is hard to reuse them for other applications. Another approach is represented by complex grid tools, covering the entire range from applications to grid resource managers and brokers. Such examples are Nimrod/G [7], Condor-G[8], or GrADS[9]. Although they are nearly complete solutions for grid-enabling applications, existing simulation codes (still) need to be rewritten, to use provided features of these tools. Such an example is GrADS, where the migration of a computational job is possible only after the re-implementation of application-level checkpointing in the simulation code using the SRS library. We present an approach suitable for enabling various CSE software applications without the need to adapt their code. The framework we introduce here – GridSFEA (Grid-based Simulation Framework for Engineering Applications) [10] – reuses the know-how about requirements of CSE applications gathered in previous experiences with frameworks for engineering processes [11,12]. It handles completely the interaction with the grid middleware Globus Toolkit 4 (GT4) [13] by using Java CoG Kit, DRMAA, an application portal based on OGCE2 [14], grid services, etc. The integration of an application is done by simple wrappers. So far, we have used GridSFEA for the development of classification algorithms based on sparse grids [15] and for computational fluid dynamics simulations. Here, we highlight its application to molecular simulation scenarios. In this paper, we focus on two easy-to-use mechanisms available within GridSFEA. The first one refers to application-independent parameter studies, while the second one applies to checkpoint-based migration of long-running simulations in the grid. We evaluate these mechanisms in the context of Molecular Dynamics and Monte Carlo simulations of vapour-liquid equilibria (VLE) of pure substances and mixtures: First, we use GridSFEA for carrying out parameter space investigations needed to develop VLE models. Second, we show how our framework can be easily employed to manage the long-running execution of large VLE scenarios with millions of molecules in the grid. Those scenarios are needed to create test cases to be used in the development of HPC software. The framework is briefly introduced in Sect. 2, with focus on the two mechanisms mentioned above. Section 3 presents computational aspects of the development of models and HPC simulation software for VLE. We discuss the numerical experiments carried out with GridSFEA in Sect. 4 and conclude with Sect. 5.
Grid-Supported Simulation of Vapour-Liquid Equilibria with GridSFEA
2
47
GridSFEA - A Simulation Framework for Engineering Applications in Grid
The GridSFEA framework aims at providing a viable complement to the classical way of computing HPC simulations. It enables various CSE software applications to easily run in grid environments with minimal or even without changes of their original source code. Within GridSFEA, a set of common functionalities, such as authentication, file transfer, or job coordination, are shared among all simulation applications. Additionally, the framework comprises enhancements specific to user scenarios. 2.1
Organisation of GridSFEA
In the realisation of GridSFEA, we reuse available (grid) community toolkits and libraries. GridSFEA currently works with GT4, which is the de-facto standard middleware for grid environments. The main components of our framework are shown in Fig. 1.
Fig. 1. The architecture of GridSFEA: tools running in the user (left) and the grid (right) environment, resp
GridSFEA Services are a collection of grid services for the management of simulations, of their data, and for the visualisation of the simulation results. They are developed based on WSRF and run on grid servers with GT4 installed. The application portal hosts web applications based on portlets, for interfacing the scientist with the simulation programs to compute with. Additionally, it reuses portlets from OGCE2 for basic interactions with the grid, such as portal authentication and file transfers. Application scripts are wrappers, adaptors, and utility programs (such as generators) written for integrating the various simulation programs into the framework. They typically run on the resources where the simulations are computed. The portal and the application scripts interact with the grid via the GridSFEA ClientApplication library, which is based on CoG Kit and DRMAA. The library acts as a glue for the framework. GridSFEA interacts with various categories of tools (see Fig. 1).
48
2.2
I.L. Muntean et al.
Enhanced Support for Parameter Space Investigations
The portal of our framework comprises two portlets designed for parameter studies. One is the SparseGrids portlet, a web application tailored to the requirements of the development process of classification algorithms [15]. The second one is the ParameterInvestigation portlet, that allows more general parameter studies. It uses a flexible and extensible data model for the parameter definition, based on XML Schema. Thus, it allows an intuitive specification of simulation parameters, such as enumerations, sequences, and combinations of the latter ones. Moreover, it has its own engine for parameter generation, passes parameters and other input data to a user-specified simulation program, automatically submits jobs to the grid and manages them. JSR128 portlets provided by a third-party can coexist with our portlets and mutually complement their functionality. The parameter specification API and the generation engine are part of the ClientApplication library. Thus, they are used from both portal and command line-based tools of the framework. Furthermore, one can easily write adaptors or plugins for other parameter study tools and connect them to GridSFEA. 2.3
Long Running Simulations in Grid Environments
GridSFEA provides a job migration mechanism based on checkpoints that aims to automate the execution of long-running simulations in grids. Thus, it manages the simulation data for jobs computed on different grid resources at various locations. It aims to reduce the idle time of the continuation jobs in the queues. This is achieved by the GridSFEA services and the ClientApplication library. They record metadata about the input, output, result, and checkpoint files of each job. An application wrapper defines the interface between the framework and the program to be run in grid. This way, the simulation code remains unaffected. To a regular user job we add new operations before and after the execution of the simulation. The preprocessing operations are the retrieval of the checkpoint information from the GridSFEA services and the transfer of the checkpoint and of other input data. The registration of the new checkpoint is done at the end of the job. Furthermore, we provide the computational scientist, both user and application developer, the possibility to specify or to plug-in post processing scripts to be performed on the simulation results. So far, we plugged in the new job the generation of a preview of the results using VMD [16] for MD and Paraview for CFD simulations. They are used as batch renderers. Similar postprocessing tasks can be integrated in GridSFEA with low programming effort. The prerequisites to enable a simulation program to use the migration mechanism available in GridSFEA are: non-interactive use (requested by the batch execution mode), checkpoint-based resuming of computations, and a simple wrapper for specifying checkpoint and result files or for integrating postprocessing tasks. Furthermore, the application has to be installed in grid in advance.
Grid-Supported Simulation of Vapour-Liquid Equilibria with GridSFEA
3
49
VLE Simulations
For many technologically relevant tasks in chemical and thermal process engineering knowledge of vapour-liquid equilibria (VLE) has turned out to be necessary. Among the different ways to study VLE, such as experimental and theoretical approaches, molecular simulation plays an important role [17,18]. It is a reliable tool for predicting phase equilibria and the best way for gaining insights into the connection between phase behaviour and molecular interactions. Here we focus on two distinct challenges from the field of VLE, both well suited to be tackled with the help of a grid. In Sect. 3.1, we describe a method for a fast elaboration of molecular models which involves extensive parameter studies. By using GridSFEA, we can profit to a great extent from the ideal possibilities a grid provides for such studies. The second example (Sect. 3.2) deals with the evaluation of parallelisation strategies for a wide range of large VLE simulations. Therefore, we need to run a moderate number of long-running HPC jobs. GridSFEA’s job-migration facilities helps us to avoid to explicitly organise the resources for those jobs. 3.1
Elaboration of the 2CLJQ Fluid Model for VLE
The search for an appropriate interaction model for a given fluid is usually a time consuming process. In this section, we follow a new route to develop interaction models, proposed in [19], that allows fast adjustments of model parameters to experimental data for a given class of pure fluids and considerably reduces the time required for the development of new molecular models. We consider this model elaboration technique for the example of the two-centre Lennard-Jones plus pointquadrupole model (2CLJQ). The idea is to study the thermodynamic properties of the 2CLJQ model fluid systematically and in detail over a wide range of model parameters with the help of GridSFEA. Using reduced coordinates, for the 2CLJQ fluid with fixed angle θ, only 2 parameters have to be varied: the LJ centre-centre distance1 L∗ and the pointquadrupole strength Q∗2 . Based on the results from the parameter study, it is straightforward to adjust the molecular interaction parameters of the 2CLJQ fluid to experimental data of real quadrupolar fluids. Properties like the critical value of the temperature e.g. are available as functions of the molecular interaction parameters [19]. Hence, the development of the molecular interaction model for a given substance is not more difficult than the adjustment of parameters of thermodynamic models. Thus, the present simulations are a reliable basis for adjustments of the model parameters Q∗2 and L∗ to experimental VLE data of real fluids. 3.2
Development and Evaluation of Parallelisation Strategies
For VLE simulations with large numbers of particles, the development and evaluation of parallelisation techniques is an important issue. 1
All values with ∗ are reduces values (transformed to a dimensionless form).
50
I.L. Muntean et al.
One typical property of VLE simulations is a very heterogeneous particle distribution. This necessitates the use of efficient parallelisation and load-balancing algorithms. We have developed a MD software for the simulation of NVTensembles [20] with a large number of particles. The design of our software allows us to easily switch between different parallelisation schemes [21], but we need to find a way of comparing those schemes. Therefore, we first have to investigate the possible simulation scenarios. For the initial configuration of a NVT simulation, the Number of particles, the Volume, and the Temperature have to be specified. In our case, we use a face-centred grid to set the particles initial positions. The particle distribution that evolves depends on the temperature and on the density (particles per volume). Basically each combination of temperature and density yields a different distribution of the particles in the domain. To cover most of those distributions for the evaluation of the parallelisation techniques, we should examine at least five different densities and five different temperatures, which leads to 25 scenarios. As we use N = 5 · 106 particles for each scenario and simulate it for 105 time steps, the simulation of one of those scenarios on 64 processors takes more that 24 hours. Getting processing time for a long-running job is quite hard and obviously it is harder to get processing time for 25 ot those jobs. But it is much easier to get several shorter blocks of processing time. Therefore, the simulation of all scenarios demands the possibility of job migration and support for parameter studies to reduce the administrative work for the user. By using GridSFEA, we get those benefits without having to interact during the simulation.
4
Case Studies
For each of the two challenges presented in Sect. 3, we describe – after introducing the experiments carried out – how to run the simulations with GridSFEA and evaluate the results with a special focus on the time overhead needed for the framework. 4.1
Systematic Investigation of the VLE of the 2CLJQ Model Fluid
Setup of the experiments. The systematic investigation of the VLE of the 2CLJQ model fluid was performed for a range of quadrupolar momentum 0 ≤ Q∗2 ≤ 4 and of elongation 0 ≤ L∗ ≤ 0.8, with steps 1 and 0.2, resp. Temperatures investigated ranged from 0.55% to 0.95% of the critical temperature. Combining these values, 125 input files were generated with GridSFEA. To obtain the VLE data the Grand Equilibrium method [18] was used. Widom’s insertion method [22] was used to calculate the chemical potential in the liquid. The data obtained from liquid simulation was further used as phase equilibrium conditions for the vapour phase. Results. The simulations have been computed with the parallel MD code ms2 [23]. They were carried out within the frame of the InGrid project [24]. GridSFEA services have been deployed on a GT4 container (version 4.0.3) running on
Grid-Supported Simulation of Vapour-Liquid Equilibria with GridSFEA
51
the grid node gt4.dgrid.hlrs.de. The user provided in the ParameterInvestigation portlet the XML description of the parameters Q∗2 , L∗ , and the temperature factor, together with the name of the generator for ms2 input files. The portlet generated all parameter combinations and for each of them submitted a batch job to the grid. Thus, the user does not have to care about all the tedious administration overhead necessary to create jobs for the different parameter combinations, all that work is done by GridSFEA. Table 1. Time for the submission with GridSFEA of a trivial job (hostname) and of the VLE simulation tasks: liquid phase (MD) and vapour phase (MC)
trivial job liquid phase vapour phase
Execution time (min) Submission time (min) 10−4 0.27 42 – 254 0.27 41 – 103 0.27
In Table 1, we show the submission time for the VLE simulation tasks (liquid and vapour phases) together with the range of their execution time. Each of the generated jobs ran on sets of four processors. For both parts of the simulation, the submission time with GridSFEA was approximatively the same. This time is measured from the moment the submission command was issued until the user program begins to run. It includes internal operations in the framework, such as file transfer, job submission, results retrieval, logging etc. Thus, the submission time is a measure of the time overhead introduced by GridSFEA at the execution of a user simulation on HPC resources. The overhead is independent from the number of employed processors and from the duration of the individual jobs. Furthermore, it has the same value as for the submission of a trivial job that returns the name of the system it runs on (hostname). Figure 2 illustrates the strong influence of both the elongation and the quadrupolar momentum on the 2CLJQ VLE data for Q∗2 = 1 and Q∗2 = 4. Increasing the elongation or the quadrupolar momentum strongly influences the shape of the density coexistence curve. With the data obtained from this study, it
Fig. 2. Vapour-liquid coexistence of the 2CLJQ fluid
52
I.L. Muntean et al.
is straightforward to adjust the molecular interaction parameters of the 2CLJQ model fluid to experimental data of real quadrupole fluid and to develop molecular interaction model for various substances [25]. 4.2
Examination of the Time Requirements for Large Scenarios
Scenarios and HPC environment. In Sect. 3.2, we motivated the examination of different scenarios. Now we look at some results for three selected scenarios with the densities ρ∗ = 0.15, ρ∗ = 0.3 and ρ∗ = 0.6. All scenarios contain N = 5 · 106 particles and have a temperature of T ∗ = 0.85. The simulations were done on a Linux Cluster with an InfiniBand 4x network. We used 16 nodes, each having 8 GB RAM and four Opteron 850 processors with 2.4 GHz. The parallelisation scheme used here is a domain decomposition without any load balancing.
Fig. 3. Simulation of 5 million particles at T ∗ = 0.85 and ρ∗ = 0.15 after 10,000, 50,000 and 100,000 time steps (visualisation with VMD [16])
Results. Fig. 3 shows the visualisation for the first scenario (T ∗ = 0.85, ρ∗ = 0.15) after 10,000, 50,000 and 100,000 time steps. To get a clearer view, only a cubic section with one third of the original side length is shown. As the distribution changes significantly during the whole simulation, 100,000 time steps are needed. In the beginning, the particles in each scenario are uniformly distributed. As the imbalance increases during the simulation, the processing time increases too and remains instationary during the first 100,000 time steps. This indicates that the distribution is continuously changing throughout the simulation. Table 2. Time results for the migration with GridSFEA of the VLE simulation with ρ∗ = 0.30, T ∗ = 0.85 Scenario Setup time (GridSFEA) File transfer time Computation time first job 15 s 16 s 10.6 h cont. job 38 s 20 s 11.4 h
Grid-Supported Simulation of Vapour-Liquid Equilibria with GridSFEA
53
We computed sets of jobs, with 10,000 time steps per job. Each job checkpointed its final state to a file and registered it with the GridSFEA services. At startup, each job retrieved the checkpoint information from the grid services and transferred it to the local machine. Table 2 shows the overhead introduced by the migration mechanism of our framework for the scenario with N = 5 · 106 molecules at T ∗ = 0.85 and ρ∗ = 0.3, compared to the effective simulation time. Discussion. In both experiments introduced in this section, the grid enabling of the simulation programs was carried out without any changes of their source code. To use the migration mechanism in the second experiment, a simple wrapper for the MD application was added to the user space installation of GridSFEA. Similarly, further engineering simulation tasks can use this mechanism. The overhead for automatically setting up a simulation job in GridSFEA is very small, below one minute. This makes our checkpoint-based migration suitable for typical computational engineering jobs, with execution times ranging from few hours to hundreds or thousands of hours. Nevertheless, for jobs with relatively short duration (several minutes), the migration mechanism from GridSFEA is not useful any more.
5
Conclusions
Using state-of-the-art grid technologies and tools, we developed the GridSFEA framework for performing engineering simulations in grid environments. With this work, we enabled the computational scientist to benefit from GT4-based grid environments for concrete tasks such as modeling VLE processes and preparing realistic simulation data for test cases to be employed in the development of HPC software for VLE. Our approach achieves the integration of application scenarios in the framework by means of wrappers, therefore without modifying the source code of the respective CSE program. The two features of GridSFEA that we introduced in this paper – support for parameter space investigations and for long running simulations – are not only useful for the case studies discussed here, but also for other similar CSE scenarios specific to capacity computing. As future work, we plan the improvement of the automated migration mechanism in GridSFEA and an opening of the framework to other grid middleware (e.g. Unicore). Furthermore, we intend to increase the number and type of CSE scenarios and applications handled by GridSFEA. Acknowledgements. We thank HLRS and the German D-Grid initiative for providing within the InGrid project the computing resources employed for accomplishing this research. Furthermore, we acknowledge the collaboration on the VLE topic with B. Eckl and Dr. J. Vrabec at the Institute of Thermodynamics and Thermal Process Engineering, Universit¨ at Stuttgart.
54
I.L. Muntean et al.
References 1. Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (2005) 2. Thomas, M., et al.: Grid Portal Architectures for Scientific Applications. Journal of Physics 16, 596–600 (2005) 3. Tr¨ oger, P., Rajic, H., Haas, A., Domagalski, P.: Standardization of an API for Distributed Resource Management Systems. In: Proc. 7th IEEE Int. Symp. on Cluster Computing and the Grid (CCGrid 2007), pp. 619–626 (2007) 4. Nieuwpoort, R.V., Kielmann, T., Bal, H.E.: User-Friendly and Reliable Grid Computing Based on Imperfect Middleware. In: ACM, Supercomputing (SC 2007) (2007) 5. Price, A.R., et al.: Optimization of integrated Earth System Model components using Grid-enabled data management and computation. Concurrency Computat.: Pract. Exper. 19, 153–165 (2007) 6. Jin, H., Zheng, R., Zhang, Q., Li, Y.: Components and workflow based Grid programming environment for integrated image-processing applications. Concurrency Computat.: Pract. Exper. 18, 1857–1869 (2006) 7. Abramson, D., Giddy, J., Kotler, L.: High performance parametric modeling with nimrod/g: Killer application for the global grid? In: IPDPS 2000: Proc. of the 14th Int. Symp. on Parallel and Distributed Processing. IEEE Computer Society Press, Washington, DC (2000) 8. Frey, J., et al.: Condor-G: A computation management agent for multi-institutional grids. Cluster Computing 5, 237–246 (2002) 9. Vadhiyar, S.S., Dongarra, J.J.: Self adaptivity in grid computing: Research articles. Concurr. Comput.: Pract. Exper. 17(2-4), 235–257 (2005) 10. Muntean, I.L.: GridSFEA - Grid-based Simulation Framework for Engineering Applications, http://www5.in.tum.de/forschung/grid/gridsfea/ 11. Mundani, R.P., Bungartz, H.J., Niggl, A., Rank, E.: Embedding, Organisation, and Control of Simulation Processes in an Octree-Based CSCW Framework. In: Proc. 11th Int. Conf. on Comp. in Civil and Building Eng., pp. 3208–3215 (2006) 12. Mundani, R.P., et al.: Applying Grid Techniques to an Octree-Based CSCW Framework. In: Di Martino, B., Kranzlm¨ uller, D., Dongarra, J. (eds.) EuroPVM/MPI 2005. LNCS, vol. 3666, pp. 504–511. Springer, Heidelberg (2005) 13. Foster, I.: Globus Toolkit Version 4: Software for Service-Oriented Systems. In: Jin, H., Reed, D., Jiang, W. (eds.) NPC 2005. LNCS, vol. 3779, pp. 2–13. Springer, Heidelberg (2005) 14. OGCE: Open Grid Computing Environments: www.collab-ogce.org/ogce2/ 15. Pfl¨ uger, D., Muntean, I.L., Bungartz, H.J.: Adaptive Sparse Grid Classification Using Grid Environments. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007. LNCS, vol. 4487, pp. 708–715. Springer, Heidelberg (2007) 16. Humphrey, W., Dalke, A., Schulten, K.: VMD – Visual Molecular Dynamics. J. Molecular Graphics (1996) 17. Serbanovic, S., et al.: Vapour-liquid equilibria of the OPLS model for the binary systems of alkanes and alkanes + alcohols. J. Serb. Chem. Soc (2005) 18. Vrabec, J., Hasse, H.: Grand Equilibrium: vapour-liquid equilibria by a new molecular simulation method. Molecular Physics (2002) 19. Stoll, J., Vrabec, J., Hasse, H., Fischer, J.: Comprehensive study of the vapourliquid equilibria of the two-centre Lennard-Jones plus point quadrupole fluid. Fluid Phase Equilibria (2001)
Grid-Supported Simulation of Vapour-Liquid Equilibria with GridSFEA
55
20. Allen, M.P., Tildesley, D.J.: Computer Simulation of Liquids. Oxford University Press, USA (1989) 21. Bernreuther, M., Buchholz, M., Bungartz, H.J.: Aspects of a Parallel Molecular Dynamics Software for Nano-Fluidics. In: Parallel Computing: Architectures, Algorithms and Applications, Int. Conf. ParCo 2007 (2007) 22. Heyes, D.: Chemical Potential, Partial Enthalpy and Partial Volume of Mixtures by NPT Molecular Dynamics. Molecular Simulation (1992) 23. Eckl, B., Vrabec, J.: ms2 – MD simulation program. Inst. of Thermodynamics and Thermal Process Engineering, University of Stuttgart 24. INGRID: Inovative grid technology in engineering, www.ingrid-info.de/ 25. Vrabec, J., Stoll, J., Hasse, H.: A set of molecular models for symmetric quadrupole fluids. Journal of Physical Chemistry B (2001)
Towards a System-Level Science Support Tomasz Gubala2,3 , Marek Kasztelnik3 , Maciej Malawski1 , and Marian Bubak1,3 1
Institute of Computer Science AGH, al. Mickiewicza 30, 30-059 Krak´ ow, Poland 2 Informatics Institute, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands 3 ACC CYFRONET AGH, Krak´ ow, ul. Nawojki 11, 30-950 Krak´ ow, Poland
[email protected],
[email protected], {malawski,bubak}@agh.edu.pl
Abstract. Recently, there is a growing need for an information technology solution to support a new methodology of scientific investigation, called system-level science. This paper presents a new approach to development and execution of collaborative applications. These applications are built as experiment plans with a notation based on the Ruby language. The virtual laboratory, which is an integrated system of dedicated tools and servers, provides a common space for planning, building, improving and performing in-silico experiments by a group of developers. The application is built with elements called gems which are available on the distributed Web- and Grid-based infrastructure. The process of application developments and the functionality of the virtual laboratory are demonstrated with a real-life example of the drug susceptibility ranking application from the HIV treatment domain. Keywords: System-level science, e-Science, collaborative applications, virtual laboratory, ViroLab.
1
Introduction
Nowadays we observe a new approach to scientific investigations which, besides of analyses of individual phenomena, integrates different, interdisciplinary sources of knowledge about a complex system, to acquire understanding of the system as a whole. This innovative way of conducting research has recently been called system-level science [1]. Biomedicine is an important example of such a field, requiring this new approach, which, in turn, must be accompanied by adequate information technology solutions. The complexity of challenges in the biomedical research and the growing number of groups and institutions involved creates more demand from that part of science for new, collaborative environments. Since biomedicine experts and research groups do not work in separation, more and more attention and effort is devoted to collaborative, inter-laboratory projects involving data and computational resources. The computer science aspects of this research, which include virtual groups, virtual organizations built around complex in-silico experiments and electronic data stores are also representative for other fields. M. Bubak et al. (Eds.): ICCS 2008, Part I, LNCS 5101, pp. 56–65, 2008. c Springer-Verlag Berlin Heidelberg 2008
Towards a System-Level Science Support
57
An example of such a collaborative application in the virology domain, being built and used in complex simulations by many cooperating users, is drug resistance evaluation for HIV treatment [2] [3]. As the final results of this simulation is important for everyday practice of clinical virologists, there are efforts to provide it as a service via the web [4]. The ViroLab project dedicates substantial resources to deliver a decision support system to help medical doctors issue HIV drug prescriptions [5], as it develops the Drug Ranking System (DRS) [6]. Treatment decision support systems, like DRS, are used and developed by many people. There are many groups involved in HIV research and users representing various expertise levels inside these groups work to deliver a valid, reasonably complete and efficiently working solution. In turn, this objective can be achieved only if the entire endeavor is backed by a solid, innovative and wellintegrated technology that is both generic enough to support users with distinct assignments, yet sufficiently focused. In this paper we present the ViroLab Virtual Laboratory [7]: a collaborative, modern platform for system-level science. The laboratory is a set of dedicated tools and servers that form a common space for planning, building, improving and performing in-silico experiments in the virology domain. In subsequent sections we show how such a complex application as DRS for HIV treatment may be designed, prepared and deployed for use in a collaborative fashion by people of different expertise levels, working towards a common objective. The next section presents an overview of related initiatives, and it is followed by a detailed explanation of operation of the proposed solution. Next, we discuss the novelty and innovation of this solution. We conclude with a summary and plans for future research.
2
Background
The need for information technology solutions supporting system-level science is indicated in the Cover Features by I. Foster and C. Kesselman [1]. Problem-solving environments and virtual laboratories have been the subject of research and development for many years [8]. Most of them are built on top of workflow systems. The LEAD [9] project is an example of a virtual laboratory for weather prediction applications; its main modules include a portal with user interfaces, a set of dedicated, distributed Grid resources and a workflow system which allows for combining the present resources together, to define task-specific processing. An example of an experimentation space is the Kepler [10] system which provides a tool for composing application workflows (which could, in particular, be experiments). In the MyGrid [11] environment, the Taverna system is used to compose complex experiment processes out of smaller, atomic building blocks. A rich library of those basic elements allows for great flexibility and numerous different solutions can be developed. Collaborative extensions have been provided by the MyExperiment project [12]. A recent overview of dedicated environments supporting development and execution of complex applications in biomedicine is presented in [13].
58
T. Gubala et al.
Most of problem solving environments and virtual laboratories are built on top of scientific workflow systems. The work on extension of the expressiveness of their programming models, interoperability, and on enabling access to different computing resources is still a subject of research [14]. In this paper, basing on the experience from workflow systems, we present an alternative approach to building systems supporting system-level science.
3 3.1
Drug Ranking Experiment in Virtual Laboratory Experiment Pipeline
The process of experiment preparation in the collaborative ViroLab virtual laboratory is composed of well-defined steps (Fig. 1). At the beginning, the medical expert defines requirements for the experiment: what are its objectives, what kind of data and computation is required. Subsequently, the experiment developer, by analyzing these requirements, identifies the functional blocks that constitute the application. These computational elements of the ViroLab virtual laboratory are called gems and, in most cases, are available in the distributed Web- and Grid-based infrastructure. Otherwise, they have to be created, published and registered in the virtual laboratory, thus becoming available for other developers who may reuse them in their own experiments.
Fig. 1. Experiment pipeline: consecutive steps of an experiment in the virtual laboratory
Once all required computational activities are available, an experiment plan may be created. This purposed virtual laboratory provides an expressive, easy way to use a notation based on a high-level scripting language called Ruby [15]. The experiment plan is a Ruby script. The Ruby language provides a clear syntax, a full set of control structures and, as a result, it enables expressing experiments of arbitrary complexity levels in the form of scripts. After the script is created and it fulfills (according to the developer) all the experiment requirements, it is stored in a dedicated repository and becomes available to other members of a given virtual organization. As a result, the scientist does not need to become familiar with scripting details, and may access the
Towards a System-Level Science Support
59
virtual laboratory through a portal as well as browse and execute the available experiments using dedicated tools [16]. During application execution, provenance data is created and stored in dedicated provenance storage. This information is used by the scientist to search for interesting data and its origins [17]. The experiment script, as released by a developer, may not be optimal or may lack some functionalities. The virtual laboratory enables the scientist to easily communicate with the developer using a dedicated tool to submit user feedback, which is then used by the developer to produce a better version of the application. The Drug Ranking System was created as a result of the experiment pipeline described above. Interpretation of the susceptibility of the HIV virus to particular drugs involves several steps. Some of these steps have to be performed manually (a blood sample has to be taken from the patient, the genetic material from the virus has to be isolated and sequenced). Once these steps are complete, a set of valid information is placed into a database. This material provides the required in- Fig. 2. “From Genotype to Drug Resisput for the DRS system. Knowing the tance” experiment nature of the experiment, a medical expert defines its structure (Fig. 2). A set of nucleotide sequences of the HIV virus has to be obtained. These sequences are then the subject of subtype detection algorithms and alignment processes, which create a list of mutations. This list is passed to the drug resistance expert system which returns virus-to-drug susceptibility values. When the experiment plan is defined, the developer can start searching for required gems or create them if they are not available, and implement the experiment plan. 3.2
Development and Publication of Gems
As already hinted in Section 3.1, the basic computational building blocks of experiments are called experiment gems, which follows the name introduced for Ruby libraries (Ruby gems [15]). Although in the experiment script all such gems are represented with a uniform API based on the Grid Object abstraction [18], the gems themselves may be implemented using various technologies. Such an approach to integration of multiple technologies was motivated by the very vivid diversity of existing Grid- and Web-based middleware systems which may be used to provide access to computation. There are standard Web services, WSRF, distributed component frameworks such as MOCCA [19] or ProActive [20], as well as large-scale job-processing systems such as EGEE LCG/gLite [21]. The goal of the Virtual Laboratory is to support gems using all these technologies.
60
T. Gubala et al.
Before a gem can be used in Virtual laboratory experiments, it has to be prepared by a gem developer. Fig. 3 shows schematically the required steps. After the interface of the gem is defined, it must be implemented using a selected technology. For simple, stateless interaction a standard Web service is the preferred solution. If a gem requires stateful (conversational) interaction and may benefit from dynamic deployment on remote resources, then implementing it as MOCCA component may be a good choice. Otherwise, if running a gem is a CPU-intensive and time-consuming task, it may be reasonable to implement it as a standalone program, which may be submitted as a job to such Grid infrastructures as EGEE or DEISA. Once the gem is developed, it has to be registered in the Grid Resource Registry (GRR), which is a central service of the Virtual Laboratory. GRR stores a technical description (techinfo) of each gem, including all information about the interface, implementation and details required to deploy or invoke the gem. It is possible to register gems which are published by third parties on the Web in the form of Web services: in that case it is enough to provide the WSDL file, describing the given service. Before actual registration takes place, the gem developer may write testing and debugging scripts which operate directly on the gem techinfo. Following registration in the GRR, the gem becomes visFig. 3. Gem development: follow- ible to all experiment developers and can be ing interface definition, a gem has shared throughout the Virtual Laboratory. to be implemented, deployed in a In the Drug Ranking experiment described specific technology and registered in in this paper, the gems include the Drug ReGRR sistance Service [5] and the RegaDB HIV sequence alignment and subtyping tools [22]. 3.3
Experiment Planning, Scripting and Publishing
After the requirements of the experiment are defined and the missing gems developed, installed and registered in the GRR, the developer can start creating the experiment plan. The plan links data and computation into a working application. As presented in Section 3.2, the gems can be implemented using different technologies and, consequently, the creation of an experiment that connects these technologies, becomes complicated. To hide the complexity of the underlying middleware, a high-level object-oriented API called the Grid Operation Invoker – GOI [18] has been introduced. Uniform access to computations is enabled by providing three level of resource description (Fig. 4) – Grid Object, Grid Object Implementation and Grid Object Instance. During creation of the experiment plan only the highest level is used, although, if necessary, the
Towards a System-Level Science Support
61
developer can define all the resource’s technical details using one of the lower layers. The next problem that occurs while creating the experiment plan is access to the medical data. The virtual laboratory provides a high-level, secure API that enables querying different data sources with the Data Access Client – DAC (a client of the ViroLab Data Access Service [23]). The Experiment Planning Environment (EPE [16]) supports creation of experiment plans. EPE is an RPC application based on the Eclipse platform which offers an integrated set of tools and a dedicated editor for writing experiment plans. The Domain Ontology Store (DOS) plug-in is a graphical browser that enables discovery of semantic information about the data and computational services. The Grid Resource Registry browser (GRR-browser) plug-in allows Fig. 4. Grid Object abstraction browsing registered services, their operations, input, output parameters and the attached documentation. These two plug-ins are integrated with the EPE experiment plan editor and between them provide a powerful mechanism for data and service discovery. The DRS experiment plan (see Fig. 5) was created using this set of tools. The developer knows that three computational services (responsible for subtyping, aligning and drug ranking) are required. Using the DOS plug-in all computational parts that return subtyped, aligned and drug-ranking results are found. Afterwards, by switching from DOS to the GRR-browser plug-in, the developer is able to see the details of the gems operations. The statements which result in the creation of selected resources, are added to the experiment plan directly from the browser plug-in. EPE is also integrated with the Experiment Repository version control system (based on Subversion), which facilitates collaboration between developers. As a result, many developers can work on single experiment plan, sharing it with other members of a virtual organization. The last step in experiment plan development is to make it available to the medical expert who is the application end user. The release plug-in, integrated with EPE, simplifies the experiment plan release process. During this process a new branch in the SVN repository is created and the experiment plan is copied with a unique version number and licence file. 3.4
Execution of Experiment
Both GOI and DAC are elements of the GridSpace engine (GSEngine [24]) which provides runtime support. It allows executing experiment plans locally on the developer’s machine, or remotely, on the server (Fig. 6). EPE is integrated with the runtime, thus making experiment plan creation and testing easy. For the medical expert who is the end user of the created experiments, a dedicated Web based application (Experiment Management Environment – EMI [16]) is created,
62
T. Gubala et al.
patientID = DataRequester.new.getData("Provide patient\’s ID") region = DataRequester.new.getData("Region (\"rt\" or \"pro\")") nucleoDB = DACConnector.new("das", "angelina.hlrs.de:8080/wsrf/services/DataAccessService","","","") sequences = nucleoDB.executeDistributedQuery( "select nucleotides from nt_sequence where patient_ii=#{patientID.to_s};") subtypesTool = GObj.create("RegaDBSubtypesTyool") subtypes = subtypesTool.subtype(sequences) puts "Subtypes: #{subtypes}" mutationsTool = GObj.create("RegaDBMutationsTool") mutationsTool.align(sequences, region) mutations = regaDBMutationsTool.getResult drs = GObj.create("DrugResistanceService") puts drs.drs("retrogram", region, 100, mutatations) Fig. 5. Listing of the decision support system experiment plan
hiding the complexity of the technology layer. It allows browsing information about the released experiment plans’ versions (their names, descriptions, licences) and executes them. Thanks to close integration with the GSEngine, interaction between users and experiment plans is realized. This mechanism allows receiving additional information from the user during script execution. For example, the DRS experiment (Fig. 5) requires two pieces of input data from the user: patientId – necessary to receive patient sequences from the medical database, and the region – required by the Drug Resistance Service.
4
Innovation
The ViroLab virtual laboratory provides an environment to collaboratively plan, develop and use biomedical applications. The main innovation of the presented platform is dedication to multi-expertise task-oriented groups. Tools are provided for technical personnel, developers and administrators whose task is to maintain and enrich the experiment space. Additionally, there are tools that help virologists and healthcare providers perform their treatment-related tasks. The respective objectives and actions of these user groups are combined together with a set of remote services, information stores and other integration techniques. In this way the laboratory helps entire research teams (both traditional and virtual, Internet-wide ones) reach their scientific and professional goals more effectively.
Towards a System-Level Science Support
63
Fig. 6. GSEngine - collaborative environment for experiment plan execution
Another innovative feature of the presented solution is stress on the generality of provided solutions in the middleware layer. The GridSpace runtime components are designed to support various remote computation technologies, programming models and paradigms. Together with this generic and multi-purpose solution, the environment provides a set of user-oriented tools that allow customizing, arranging and populating the virtual laboratory space with content and solutions specific to certain application domains. It is a method of harvesting the end users’ high creativity to help them co-create their environment rather than tailoring ready-to-use solutions. Since the e-Science domain is evolving very quickly, we argue that this model of a generic platform with specific content is best suited for technically knowledgeable teams of scientists. The described concept of independent analysis gems and data sources as well as the scripting glue used to combine them in desired experiments, ensures easy reconfigurability, extensibility and enables ad-hoc recomposition of laboratory content and applications. The presented platform facilitates fast, close cooperation of developers and users on experiments. Since an in-silico experiment is subject to frequent changes, modifications and enhancements, the traditional software model of releases, downloads, deployments and bug reports is not effective enough. Instead, the ViroLab experiment planning and publishing model encourages quick, agile software releasing and a corresponding versioning scheme. In this model, enhancement reports can be provided right away in the experiment execution tool and they are immediately visible to all interested programmers, who may publish new experiment versions which are also immediately ready to use by all interested scientists in the group. The additional licensing and terms-of-use information, always attached to experiments, saves the end users time that would otherwise be spent on finding out whether and how the results of experiments may be used and published.
64
5
T. Gubala et al.
Summary
The applicability and suitability of the virtual laboratory was demonstrated with the real-life example of the drug susceptibility ranking application from the HIV treatment domain. The main innovation of this work is the novel design of the virtual laboratory that allows for truly collaborative planning, development, preparation and execution of complex data acquisition and analysis applications, so crucial for the biomedicine field. In the proposed environment people of different occupations, both advanced script developers and scientists can effectively and collaboratively conduct their respective tasks, contributing to a common goal. The current version of the presented platform, rich documentation and tutorials are available from the ViroLab virtual laboratory site [7]. The laboratory is under continuous development. One of the most important features to be added is a module for management of results produced by experiments. Effort is being invested in semantic descriptions of data and computations. Consequently, finding interesting information will become easier and the corresponding middleware will be able to track the provenance of results in an application-specific way. This, in turn, will lead to future experiment repeatability. The listed functionality aspects are of great importance for system-level science. Acknowledgements. This work was partially funded by the European Commission under the ViroLab IST-027446, the IST-2002-004265 Network of Excellence CoreGRID projects, the related Polish SPUB-M grant and the Foundation for Polish Science. The Authors are grateful to Piotr Nowakowski for his comments and suggestions.
References 1. Foster, I., Kesselman, C.: Scaling system-level science: Scientific exploration and it implications. Computer 39(11), 31–39 (2006) 2. Vandamme, A.M., et al.: Updated european recommendations for the clinical use of hiv drug resistance testing. Antiviral Therapy 9(6), 829–848 (2004) 3. Rhee, S., et al.: Genotypic predictors of human immunodeficiency virus type 1 drug resistance. In: Proceedings of National Academy of Sciences of the United States of America. National Academy of Sciences, vol. 103 (2006) 4. Rhee, S., et al.: Human immunodeficiency virus reverse transcriptase and protease sequence database. Nucleic Acids Research 31(1), 298–303 (2003) 5. Sloot, P.M.A., Tirado-Ramos, A., Altintas, I., Bubak, M., Boucher, C.: From molecule to man: Decision support in individualized e-health. Computer 39(11), 40–46 (2006) 6. Sloot, P.M.A., Tirado-Ramos, A., Bubak, M.: Multi-science decision support for hiv drug resistance treatment. In: Cunningham, P., Cunningham, M. (eds.) Expanding the Knowledge Economy: Issues, Applications, Case Studies, eChallenges 2007, pp. 597–606. IOS Press, Amsterdam (2007) 7. ViroLab Virtual Laboratory, http://virolab.cyfronet.pl
Towards a System-Level Science Support
65
8. Rycerz, K., Bubak, M., Sloot, P., Getov, V.: Problem solving environment for distributed interactive simulations. In: Gorlatch, S., Bubak, M., Priol, T. (eds.) Achievements in European Reseach on Grid Systems. CoreGRID Integration Workshop 2006 (Selected Papers), pp. 55–66. Springer, Heidelberg (2008) 9. Droegemeier, K., et al.: Service-oriented environments in research and education for dynamically interacting with mesoscale weather. IEEE Computing in Science and Engineering (November-December 2005) 10. Altintas, I., Jaeger, E., Lin, K., Ludaescher, B., Memon, A.: A web service composition and deployment framework for scientific workflows. ICWS 0, 814–815 (2004) 11. Stevens, R.D., et al.: Exploring williams-beuren syndrome using mygrid. Bioinformatics 1(20), 303–310 (2004) 12. MyExperiment: myexperiment website (2007), http://myexperiment.org 13. Aloisio, G., Breton, V., Mirto, M., Murli, A., Solomonides, T.: Special section: Life science grids for biomedicine and bioinformatics. Future Generation Computer Systems 23(3), 367–370 (2007) 14. Gil, Y., Deelman, E., Ellisman, M., Fahringer, T., Fox, G., Gannon, D., Goble, C., Livny, M., Moreau, L., Myers, J.: Examining the Challenges of Scientific Workflows. IEEE Computer 40(12), 24–32 (2007) 15. Thomas, D., Fowler, C., Hunt, A.: Programming Ruby – The Pragmatic Programmer’s Guide, Second Edition. The Pragmatic Programmers (2004) 16. Funika, W., Har¸ez˙ lak, D., Kr´ ol, D., P¸egiel, P., Bubak, M.: User interfaces of the virolab virtual laboratory. In: Proceedings of Cracow Grid Workshop 2007, ACC CYFRONET AGH, pp. 47–52 (2008) 17. Bali´s, B., Bubak, M., Pelczar, M., Wach, J.: Provenance tracking and querying in virolab. In: Proceedings of Cracow Grid Workshop 2007, ACC CYFRONET AGH, pp. 71–76 (2008) 18. Bartynski, T., Malawski, M., Gubala, T., Bubak, M.: Universal grid client: Grid operation invoker. In: Proceedings of the 7th Int. Conf. on Parallel Processing and Applied Mathematics PPAM 2007. LNCS. Springer, Heidelberg (to appear, 2008) 19. Malawski, M., Bubak, M., Placek, M., Kurzyniec, D., Sunderam, V.: Experiments with distributed component computing across grid boundaries. In: Proceedings of the HPC-GECO/CompFrame workshop in conjunction with HPDC 2006, Paris, France (2006) 20. Baduel, L., Baude, F., Caromel, D., Contes, A., Huet, F., Morel, M., Quilici, R.: Programming, Deploying, Composing, for the Grid. In: Grid Computing: Software Environments and Tools. Springer, Heidelberg (2006) 21. EGEE Project: Lightweight middleware for grid computing (2007), http://glite.web.cern.ch/glite 22. de Oliveira, T., et al.: An automated genotyping system for analysis of HIV-1 and other microbial sequences. Bioinformatics (2005) 23. Assel, M., Krammer, B., Loehden, A.: Management and access of biomedical data in a grid environment. In: Proceedings of Cracow Grid Workshop 2006, pp. 263–270 (2007) 24. Ciepiela, E., Kocot, J., Gubala, T., Malawski, M., Kasztelnik, M., Bubak, M.: Gridspace engine of the virolab virtual laboratory. In: Proceedings of Cracow Grid Workshop 2007, ACC CYFRONET AGH, pp. 53–58 (2008)
Incorporating Local Ca2+ Dynamics into Single Cell Ventricular Models Anna Sher2, David Abramson1, Colin Enticott1, Slavisa Garic1, David Gavaghan2, Denis Noble3, Penelope Noble3, and Tom Peachey1 1
Faculty of Information Technology, Monash University, Clayton, 3800, Victoria, Australia 2 Comp. Biology Group, Oxford University Computing Laboratory, Oxford OX1 3QD, UK 3 Department of Physiology, Anatomy and Genetic, Oxford University Oxford OX1 3PT, UK
Abstract. Understanding physiological mechanisms underlying the activity of the heart is of great medical importance. Mathematical modeling and numerical simulation have become a widely accepted method of unraveling the underlying mechanism of the heart. Calcium (Ca2+) dynamics regulate the excitationcontraction coupling in heart muscle cells and hence are among the key players in maintaining normal activity of the heart. Many existing ventricular single cell models lack the biophysically detailed description of the Ca2+ dynamics. In this paper we examine how we can improve existing ventricular cell models by replacing their description of Ca2+ dynamics with the local Ca2+ control models. When replacing the existing Ca2+ dynamics in a given cell model with a different Ca2+ description, the parameters of the Ca2+ subsystem need to be re-fitted. Moreover, the search through the plausible parameter space is computationally very intensive. Thus, the Grid enabled Nimrod/O software tools are used for optimizing the cell parameters. Nimrod/O provides a convenient, user-friendly framework for this as exemplified by the incorporation of local Ca2+ dynamics into the ventricular single cell Noble 1998 model. Keywords: Cardiac Cells, Mathematical modeling, Parameter optimization, Grid Computing.
1 Introduction Researchers have been developing complex models of cardiac cells for many years, in an attempt to explore the detailed physiology and operation of the heart. Ultimately, the goal is to produce better treatment strategies and to develop novel drugs for treating heart disease. This case study concerns the detailed modeling of particular ion channels in heart muscle cells. The key physiological function of the heart is to pump blood around the living organism. This function is enabled by the spread of electrical excitation through the M. Bubak et al. (Eds.): ICCS 2008, Part I, LNCS 5101, pp. 66–75, 2008. © Springer-Verlag Berlin Heidelberg 2008
Incorporating Local Ca2+ Dynamics into Single Cell Ventricular Models
67
cardiac tissue and contraction of the cardiac muscles. On the single-cell level (a myocyte), the mechanisms of excitation-contraction coupling are closely regulated by calcium ion (Ca2+) dynamics. Ca2+ entering the cell triggers the release of Ca2+ from the sarcoplasmic reticulum (SR) which is the organelle that stores calcium. The resulting rise of intracellular Ca2+ (Cai) activates the contraction of the cell. This phenomenon is known as Ca2+-induced Ca2+ release (CICR). Local Ca2+ dynamics are characterized by the interactions within localized microdomains (known as dyadic spaces) between L-type Ca2+ channels (LCCs) located on the Transverse–tubules (T– tubules), which are deep invaginations of the membrane into the cell, and closely opposed Ca2+ release channels (known as ryanodine receptors, RyRs) located on the sarcoplasmic reticulum (Fig. 1). The sarcoplasmic reticulum is an extensive and well organized network, that repeatedly comes in contact with each T-tubule, so that the number of dyadic spaces throughout the cell has been estimated to be of the order 50,000 – 300,000.
Sarcolemma Ca-ATP
NCX
Cai Dyadic space JLCC
SR JRyR CaSR
Cads JD
Serca
Cai
T-tubule Fig. 1. Local Ca2+ dynamics of Greenstein et al. 2006 [1] model. Arrows represent the direction in which Ca2+ flows. Cai, Cads and CaSR denote intracellular, dyadic and SR Ca2+ respectively. The diagram illustrates the local control theory: LCCs and RyRs contribute to local JLCC and JRyR fluxes respectively within the dyadic space, JD represents the diffusion of Ca2+ out of the dyad into the bulk myoplasm, SERCA re-uptakes Ca2+ back into the SR, Ca2+-ATPases and NCXs pump Ca2+ out of the cell.
68
A. Sher et al.
ICa.L(ds) INa-stretch
Ina.b ICa INaCa Ip.N ICa. ICa-stretch
L-type Ca2+ channel
Diadic space
a
Na+
Na+K+ Ca2+
Na+ Na+ Na+ Ca2+
b
Ca2+ Na+ Ca2+ Ca2+
IAn-stretch Cl-
Sarcoplasmic Reticulum
Iup
Ca2+ NSR Itr Ca2+
K+
K+ K+
K+
K+
JSR
Calsequestrin K+
Irel
Ca2+
INs-stretch
Myoplasm
K+ K+ Na+
K+
K+
IK1 IKr IKs IKNa Ib(K) IK.ATP Ito IK.ACh INaK IK-stretch Fig. 2. Schematic representation of the single cell Noble et al. 1998 [3] model (adapted from a diagram at www.cellml.org model repository). Arrows represent the direction in which the ions flow and the label of the corresponding ionic current is located above or bellow the arrow. The model includes four Ca2+ compartments which are the intracellular, dyadic, network SR (NSR) and junctional SR (JSR). This model is an example of the deterministic non-common pool ventricular model that uses phenomenological description of Ca2+ in the dyadic space and Ca2+ related currents. While such a model succeeds in producing graded SR Ca2+ release, it lacks the mechanistic description of local SR Ca2+ release, i.e. the stochastic interaction between LCCs and RyRs within the dyadic spaces.
The local Ca2+ release mechanisms are essential to reproduce the characteristic properties of the excitation-contraction coupling such as high gain and graded Ca2+ release. However, most existing single cell models lack the description of the biophysical nature of local Ca2+ dynamics. In this paper we present a methodology of how local Ca2+ dynamics can be efficiently incorporated into a single cell model of ventricular myocyte in order to produce a biophysically accurate cell model. The two stages involved are (i) development of the Ca2+ subsystem and (ii) its incorporation into a single cell model. The first stage is the generation of the local control CICR models (also known as the coupled LCC-RyR models) such as, for instance, the ones that have been developed by Hinch et al. [2] and Greenstein et al. [1]. The second stage, which is the focus of this paper, involves the incorporation of the coupled LCC-RyR models into a single cell model. Specifically, the steps are as follows:
Incorporating Local Ca2+ Dynamics into Single Cell Ventricular Models
69
− The equations that describe Ca2+ dynamics in the original single cell model (e.g. Noble 1998 model1 [4] (Fig. 2)) are substituted by equations of the biophysically detailed Ca2+ subsystem (e.g. baseline 40-state coupled LCC-RyR Greenstein 2006 model [1] (Fig. 1)), provided that units are modified accordingly; − The parameters of the newly obtained single cell model are refitted. This is done to ensure that the newly obtained single cell model, which contains the replaced Ca2+ subsystem, is capable of reproducing the data of the original model. In particular, the specific aim is to fit the dynamics of the Ca2+ of the newly developed wholecell model either to the dynamics of the Ca2+ of the original model (e.g. Noble 1998) and/or to the available experimental data (e.g. Cai transient, IV curves, tail currents recorded from the voltage-clamp experiments, etc.). To achieve this, we need to optimize the parameters of the Ca2+ subsystem, or, in other words, to solve an inverse problem. In this paper we demonstrate how the novel Grid computing tools allows the incorporation of local Ca2+ dynamics into the existing cellular models at a low computational cost. The optimization methods that are used require repeated evaluation of the models, and thus the time required to compute the optimal model parameters can be very long. The computational Grid can be exploited to speed the execution by delivering a large number of processors. The Grid enabled Nimrod/O tool that we use in this experiment incorporates a range of non-linear optimization methods, and these can be used to optimize the cell parameters accordingly. Section 2 briefly introduces the Grid and the Nimrod tools. Section 3 discusses challenges and results of incorporating local calcium dynamics on the example of the ventricular single cell Noble 1998 model.
2 Grid Computing The Grid provides a general platform for integrating computation, data and instruments [8]. It serves as the infrastructure for implementing novel applications, particular in science and engineering. In particular, “computational” Grids have emerged as a viable platform for delivering on-demand access to a range of very high performance machines. Whilst it may not be possible to gain access to sufficient resources at any single site, computational Grids can aggregate a number of otherwise separate resources into a single large super-computer. Such a virtual machine, or testbed, is an ideal base for simulating complex systems using computational models because the resources can be assembled at a period of peak demand and then released for use when not required. Such platforms have the potential to offer very cost effective solutions, leveraging everything from spare cycles on high end machines through to large pools of inexpensive desktops that are idle. 1
The Noble 1998 model is extensively used by various researchers and, thus, it is important to assess the effect of replacing the existing phenomenological description of Ca2+ in the dyadic space and Ca2+ related currents with the local, biophysically sound Ca2+ dynamics. Therefore, the Noble 1998 model is chosen as the case study.
70
A. Sher et al.
In spite of the enormous progress in building operation Grids, and the significant effort in developing middleware, assembling such a testbed on demand is difficult. Most Grids are built from different components, and this resource heterogeneity is a fact of life. Likewise, Grids are built across multiple administrative and security domains, posing problems for aggregating them into a single virtual machine. Lack of a single owning organization also means that resource scheduling becomes complex – no single job scheduler can guarantee access to sufficient computational power, making it difficult to deliver the guaranteed levels of service. Importantly, Grid application users don’t want to know about the complexity of the underlying fabric, and wish to concentrate on their domain science. Difficulty in using the Grid is not a hypothetical concern. Currently, very few scientists use the Grid routinely, and instead rely on local resources, which are under their control. This means that the scale and nature of the work is limited. Until we can make it easier to use, the Grid will never be adopted by more than the most hardy or desperate users! Over the years we have developed a strategy for delivering the high levels of performance, and have built software tools that make it easy for scientists to leverage the computational power of the Grid. Specifically, the Nimrod family of tools allows a non-expert to specify large computational experiments using legacy software, and execute these over a range of Grid resources. Nimrod is not a single tool: it incorporates a component that distributes computations to the resources (Nimrod/G) [5], [7]; a component that searches for “good” solutions using non-linear optimization algorithms (Nimrod/O) [4], [6]; and a component that helps evaluate which parameter settings are important using experimental design (Nimrod/E). Most aspects of Nimrod have been written about extensively over the years, so we will only provide a cursory overview in Section 2.1 of the paper. 2.1 The Nimrod Tool Family Figure 3 shows the architecture of the Nimrod tool family and the interaction between the major components. Typically, users interact through a Web browser using the Nimrod portal. This single point of presence then directs traffic to one of three different components – Nimrod/G which support parameter studies and distributes the computations to the Grid, Nimrod/O which performs optimization and Nimrod/E which uses experimental design techniques to scope parameter studies. Importantly, each of these components acts either as a user level tool, or as middleware, depending on the client use. For example, Nimrod/G can interact directly with users using a Web enabled interface, or can provide services to other software (such as Nimrod/E, Nimrod/O) via an API. Each of the applications discussed here leverages different aspects of the tools. In many cases, they used Nimrod/G to perform a crude sweep of the overall parameter space, and then launched Nimrod/O to refine the solutions. Nimrod/E is a fairly new development, and whilst it has been used in the cardiac modeling work, we do not have results at this stage. An important aspect of the tool family is that they share a common specification language – which is written in a text document called a “plan” file. This file contains details of the parameters and how to invoke the application, and is typically quite small. Over the years, we have expanded the plan file to allow more complex
Incorporating Local Ca2+ Dynamics into Single Cell Ventricular Models
71
workflows to be specified [9], however, in the simplest form a single application is run many times. Nimrod/O plan files contain some additional information about which heuristics to use This specifies the optimization algorithm, or algorithms, and associated settings. For example, the file may specify simulated annealing and the associated cooling regime. Starting points for iterative algorithms are also specified as Nimrod/O can perform multiple concurrent searches. The Nimrod/E plan file contains information about which parameter combinations are to be estimated, and which are assumed negligible.
Fig. 3. The Nimrod tool chain
2.2 Nimrod Methodology Each of the case studies discussed in the next section adopted the same overall methodology – regardless of which Nimrod tool was used. The following steps summarize this process: 1. Testbed construction. The use must decide which resources will be included in the grid testbed, and configure Nimrod to use these. The Nimrod portal provides a number of high level interfaces for making this fairly easy. Nimrod assumes that users already have accounts (and the necessary authentication) on each of the testbed resources. 2. Software preparation. Here the applications are compiled and tested on each of the Grid resources. This can either be performed manually by logging into each
72
3.
4.
5.
6.
7.
A. Sher et al.
of the different remote resources, or by using a tool like Distant [9] which manages the process through a single user oriented client. Even when configured manually, it is possible to prepare the application binary on one machine, and use Nimrod to distribute it to similar resources before execution. Determine which Nimrod tool to use. As discussed, Nimrod has a number of different components. The user must select the most appropriate component, depending on whether a complete, partial or guided search is required. Describe how to execute the application, and which files are required for input and output. These steps are described in the Nimrod plan file, using a simple declarative language. Nimrod can be instructed to copy input files to each resource, and return output files. Large output files can be left on remote resources for later analysis. Nimrod also managed parameter substitution via command line options or special control files. Determine the parameters and their ranges. This will vary depending on the application requirements, These are then described in the Nimrod plan file using the ‘parameter’ keyword. Most parameters are independent, however, it is also possible to specify sequences of parameters that create complex workflows [9]. In this paper we use Nimrod/O to compute optimal parameter settings. Execute the experiment. This is usually performed through the Nimrod portal, but it is also possible to use the Nimrod command line tools. Long running experiments can be left unattended, and monitored using the Nimrod monitoring tools. Analyze the results, possibly returning to step 5 to refine the parameter ranges.
3 Incorporating Local Ca2+ Dynamics The models of the local Ca2+ dynamics is a system of ODEs of approximately 30-70 variables with up to 100 parameters. These ODEs do not exhibit stiffness, thus, time integrators such as the forward Euler integrator or a Runge-Kutta 4th order method are appropriate to simulate these Markov models. The results presented below are simulated in Matlab 6.5 using an inbuilt `ode45' solver - a one-step solver based on an explicit Runge-Kutta of 4th and 5th order, that is appropriate for non-stiff problems and has medium accuracy. Each simulation on a personal laptop (e.g. Toshiba 512 MB RAM, 2 GHz, 60 GB Hard Drive, Windows XP) takes under five minutes, thus the computational resources required to perform one simulation are minimal. However, to optimize the set of parameters in the newly developed Ca2+ subsystem, the software tools which perform optimization algorithms within the framework of the distributive computing are essential. In particular, Nimrod/O provides a computationally effective manner of tuning the parameters and examining their effects within the newly developed models. Interestingly, in the case of running the simulations discussed above, the limiting factor is the number of Matlab licenses available rather than the number of processors. This is an issue that requires consideration by both the community and independent software vendors if the true power of the Grid is to be realized for this class of software. Nimrod/O offers a variety of optimization methods, such as “subdivision search” and downhill type search methods, etc. The simulation results
Incorporating Local Ca2+ Dynamics into Single Cell Ventricular Models
73
presented below are obtained using the downhill simplex method of Nelder and Mead. The optimal set of parameters, calculated using the simplex method, is obtained by fitting the action potential (AP), Cai transient and ICaL current, with the objective function calculated using the least-square approximations. The direct incorporation of the canine 40-state Greenstein 2006 coupled LCC-RyR model 1 into Noble 1998 guinea pig model (Fig. 2) results in a distorted electrical behaviour of the cell such as a significant second peak in Cai transient and a pronounced plateau phase in an action potential (compare dashed and dotted curves in Fig. 4). An optimized set of parameters obtained using Nimrod/O significantly improves the dynamical behaviour of the modified Noble 1998 model (solid curve).
Fig. 4. Cardiac model output: The guinea pig Noble 1998 [4] ventricular model modified to include local Ca2+ dynamics. Dashed curve represents the Noble 1998 model. Dotted curve shows the modified Noble 1998 model that incorporates the 40-state coupled LCC-RyR Greenstein et al. 2006 model. Solid curve denotes Noble 1998 model modified to include Greenstein et al. 2006 Ca2+ dynamics with an optimized set of parameters2. 2
The optimal set of parameters (corresponding to the solid curve) is as follows: an increase in the maximum rate of the SERCA pump (1.4-fold), an increase in the conductance of RyR (3.5-fold) and LCC (1.5-fold) channels, modified constants of the 10-state LCC Markov model (the transition rate to the Ca2+-dependent inactivation (CDI) state by 1.33-fold; the transition rate out of the CDI-state constant by 0.34-fold; the transition rate out of the closed state by 2.2-fold; the transition state out of the open state by 0.59-fold) and of the 4-state RyR Markov model (the transition rate into the open state from CDI-state 2 by 4.58-fold; the transition rate out of open state into CDI-state 2 by 0.79-fold; the transition rate into the open state from CDI-state 4 by 2.4-fold; the transition rate out of the closed state by 2.1-fold).
74
A. Sher et al.
Importantly, the new set of parameters, which falls within the physiologically acceptable ranges, results in an elimination of the second peak in Cai transient (middle panel in Fig. 4). Further, the results demonstrate that Nimrod/O provides a convenient, user-friendly framework for tuning the parameters in the cardiac cell models in an efficient computional manner by taking advantage of parallel batches of evaluations. This study provides a valuable platform for future incorporation of the biophysically detailed Ca2+ subsystems into whole-cell models of various species. It is important to note that the use of Nimrod/O highlighted the issues of the parameter sensitivity and over-parameterizations of cardiac ionic models (data not shown). Specifically, the challenges involved in analyzing and characterizing the significance of a given set of parameters in ionic models include (1) potentially fewerthan-necessary constraints being imposed when calculating the objective function, (2) the cardiac ionic models being complex nonlinear systems which have many local minima as opposed to global minima, etc. Parameter estimation in cardiac systems is an ongoing area of research. Thus, while Nimrod/O is a valuable tool in parameter optimization with low computational cost, further studies need to be performed in order to improve the method of finding the optimal set of parameters in a given ventricular single cell model.
4 Conclusions In this paper we have outlined the steps necessary for updating the ventricular myocytes models with the local Ca2+ dynamics. Nimrod/O was used as the tool to incorporate the coupled LCC-RyR models in the place of the existing Ca2+ dynamics. To conclude, the incorporation of the local Ca2+ dynamics into the Noble 1998 model shows that Nimrod/O is a convenient, user-friendly framework for tuning the parameters in the cardiac cell models in an efficient computational manner by taking advantage of parallel batches of evaluations. Thus, Nimrod/O, provides a valuable, low-computational tool for the incorporation of the biophysically detailed Ca2+ subsystems into whole-cell models of various species. Acknowledgements. The cardiac modeling project was supported by EPSRC EScience Pilot Project in Integrative Biology GR/S72023/01, UK. The Nimrod project has been funded by the Australian Research Council, the Cooperative Research Centre for Enterprise Distributed Systems, the Department of Communications, Information Technology and the Arts under a GrangetNet grant, and the Australian Partnership for Advanced Computing.
References 1. Greenstein, J.L., Hinch, R., Winslow, R.L.: Mechanisms of excitation-contraction coupling in an integrative model of the cardiac ventricular myocyte. Biophys. J. 90, 77–91 (2006) 2. Hinch, R., Greenstein, J.L., Tanskanen, A.J., Xu, L., Winslow, R.L.: A simplified local control model of calcium-induced calcium release in cardiac ventricular myocytes. Biophys. J. 87, 3723–3736 (2004)
Incorporating Local Ca2+ Dynamics into Single Cell Ventricular Models
75
3. Noble, D., Varghese, A., Kohl, P., Noble, P.: Improved guinea-pig ventricular cell model incorporating a diadic space, IKr and Iks, and length- and tension-dependent processes, Can. J. Cardiol. 14(1), 123–134 (1998) 4. Abramson, D., Lewis, A., Peachey, T., Fletcher, C.: An Automatic Design Optimization Tool and its Application to Computational Fluid Dynamics. In: SuperComputing 2001, Denver (November 2001) 5. Abramson, D., Sosic, R., Giddy, J., Hall, B.: Nimrod: A Tool for Performing Parametrised Simulations using Distributed Workstations. In: The 4th IEEE Symposium on High Performance Distributed Computing, Virginia (August 1995) 6. Abramson, D., Lewis, A., Peachy, T.: Nimrod/O: A Tool for Automatic Design Optimization. In: The 4th International Conference on Algorithms & Architectures for Parallel Processing (ICA3PP 2000), Hong Kong, December 11-13 (2000) 7. Abramson, D., Giddy, J., Kotler, L.: High Performance Parametric Modeling with Nimrod/G: Killer Application for the Global Grid? In: International Parallel and Distributed Processing Symposium (IPDPS), Cancun, Mexico, May 2000, pp. 520–528 (2000) 8. Foster, I., Kesselman, C. (eds.): The Grid: Blueprint for a New Computing Infrastructure, 2nd edn. Morgan Kaufmann, USA (2003) 9. Ayyub, S., Abramson, D., Enticott, C., Garic, S., Tan, J.: Executing Large Parameter Sweep Applications on a Multi-VO Testbed. In: 7th IEEE International Symposium on Cluster Computing and the Grid, CCGrid, Brazil, pp. 73–80 (2007) 10. Goscinski, W., Abramson, D.: Legacy Application Deployment over Heterogeneous Grids using Distributed Ant. In: IEEE Conference on e-Science and Grid Computing, Melbourne (December 2005)
Grid-Enabled Non-Invasive Blood Glucose Measurement Ibrahim Elsayed1, Jianguo Han2 , Ting Liu3 , Alexander W¨ ohrer1 , 1 1 Fakhri Alam Khan , and Peter Brezany 1
3
Institute of Scientific Computing University of Vienna, Nordbergstrasse 15/C/3, A-1090 Vienna, Austria {elsayed,woehrer,khan,brezany}@par.univie.ac.at 2 School of Information Science and Technology Beijing University of Chemical Technology 15 BeiSanhuan East Road, ChaoYang District, Beijing 100029, China
[email protected] School of Earth and Space Science, Peking University, Beijing 100871, China
[email protected]
Abstract. Earth and life sciences are at the forefront to successfully include computational simulations and modeling. Medical applications are often mentioned as the killer applications for the Grid. The complex methodology and models of Traditional Chinese Medicine offer different approaches to diagnose and treat a persons health condition than typical Western medicine. A possibility to make this often hidden knowledge explicit and available to a broader audience will result in mutual synergies for Western and Chinese medicine as well as improved patient care. This paper proposes the design and implementation of a method to accurately estimate blood glucose values using a novel non-invasive method based on electro-transformation measures in human body meridians. The framework used for this scientific computing collaboration, namely the ChinaAustria Data Grid (CADGrid) framework, provides an Intelligence Base offering commonly used models and algorithms as Web/Grid-Services. The controlled execution of the Non-Invasive Blood Glucose Measurement Service and the management of scientific data that arise from model execution can be seen as the first application on top of the CADGrid. Keywords: Traditional Chinese Medicine, Non-Invasive Blood Glucose Measurement, Grid Computing, e-Infrastructure.
1
Introduction
Grid computing [1] promises to change the way scientists will tackle future research challenges in a number of domains, including earth sciences [2], medicine [3,4] and life sciences [5]. Service-oriented architectures (SOA) [6] are utilized in Grid computing to facilitate the virtualization of heterogeneous resources, e.g. data sources, computational resources, network and workload. Due to wireless connectivity improvements and hardware getting mobile and constantly smaller M. Bubak et al. (Eds.): ICCS 2008, Part I, LNCS 5101, pp. 76–85, 2008. c Springer-Verlag Berlin Heidelberg 2008
Grid-Enabled Non-Invasive Blood Glucose Measurement
77
and cheaper, the visions of ubiquitous [7] and mobile computing [8] are becoming reality. Information is collected, exchanged and processed by specialized computing units embedded in the environment to achieve a certain task [9] and accessed as needed on-the-way [10]. Enormous amount of data will be produced at a rate never seen before in any field of human activity, requiring next generation grids [11] to cope with and making use of it. Traditional Chinese Medicine (TCM) [12] has different models and approaches to diagnose and treat a persons health condition than typical Western medicine. According to meridian-theory, which is an important part of TCM, meridians are a secret to our biological and medical knowledge. Recently, several projects in China started to investigate how modern measurement and information and communication technologies can support not only exact estimation of the meridian status, but also to improve TCM in general [13]. Although Chinese and Western medicine have a different understanding and approach to life, health, and illness - concerted, complementary work between Western allopathy and Chinese medicine could result in an improved health system [14]. The problem of diabetis mellitus [15] is urgent around the world (estimated 100 million [16]), in Austria approximately 300.000 people suffer from it [17]. To minimize short term problems (e.g. unconsciousness, hypoglycemia) and severe mid and long term complications (e.g. blindness and neuropathie), which are also very costly to treat, repetitive invasive blood sugar measurements are needed with following medication modulation (typically insulin for Type 1 and pills for Type 2 diabetics). Besides several negative medical side effects (e.g. skin injuring), this way is also rather expensive. This paper proposes the grid based implementation of a novel non-invasive method for measuring human blood glucose values accurately and conveniently by the use of a special medical meridian measurement instrument and the CADGrid infrastructure [18]. The data obtained by this instrument are referred to as meridian measurement data and can be analyzed by the meridian electro information transmission model [19] to derive human blood glucose values. This model is implemented as a complex grid-based computing process that executes a number of compute intensive algorithms. The controlled execution of this process is done by the Non-Invasive Glucose Measurement Service, in short NIGM-Service. A special subset of CADGrid-services will focus on receiving and analyzing patients meridian measurement data coming from mobile devices and thin clients. Splitting the process of vital parameter estimation into an evolveable, personalized data mining process and a rather simple source signal emitting and recording phase has two main benefits: first, the infrastructure can easily be applied to other target values and second, improvements to the involved data mining services and process will directly result in a more precise and robust estimation of the values. Diabetic patients as well as researchers in the field of treatment of diabetes mellitus will highly profit from the realization of the above mentioned scientific computing infrastructure. This paper is organized as follows. In Section 2 the application domain is described in order to provide the reader with domain specific background knowledge. Section 3 describes the China-Austria Data Grid infrastructure and
78
I. Elsayed et al.
on top of it its first application the Non-Invasive Glucose Measurement Service in Section 4. Section 5 gives a brief overview of available non-invasive methods for measuring human blood glucose values. Finally, we conclude the paper and mention our ongoing work as well as planned next steps in Section 6.
2
Application Scenario
The non-invasive method for measuring human glucose values used in the NIGMService is based on the meridian-theory, according to which the human body has 14 acupuncture meridians. Each of these longitudinally distributed lines on our human body has its main points, called source points, totally 24 [20]. Clinical practices of TCM (especially acupuncture) have been guided by meridian theory for thousands of years. Exact estimation of the meridian status has been one of the pilot tasks of TCM. In order to prove the meridian theory with modern methods a number of special meridian measurement instruments were developed. Analyzing these meridian measurement data with advanced data mining techniques and models can lead to important information about human illness state and other health relevant knowledge. The electro signal measurement instrument sends an electric signal (white noise) into one meridian source point and measures the corresponding signal output at another source point either on the same meridian or on another meridian. In particular a random electro signal with the maximal voltage less than 2.0 V is produced by the instrument. This process is illustrated in Figure 1. According to international standard terminologies defined by the World Health Organization on traditional medicine in the western pacific region [21], point 1 is called “Ba Xie” and point 2 is called “He Gu”. These points are connecting two different meridians through a special information channel. Zero potential points are points on the human body that have the lowest electrical potential and are usually located on finger tips and toes. In the context of electro signal measure, zero point measures are used as reference values, in order to weight the electric potential on a acupuncture point. The measurements obtained in this process can, if analyzed by the meridian electro information transmission model, derive diabetic patient’s blood glucose values. Another instrument measures the subcutaneous impedance at acupuncture points and its adjacent control points [20]. Also high sensitive CO2 analyzers are used to measure transcutaneous CO2 emission [22] from the skin on correlating meridian source points. Using clustering and frequent itemset mining techniques, correlations among measured values of these points can be identified, e.g. start-end point correlation, symmetric point correlation etc., which is useful knowledge for research in the meridian theory and thus aims to observe the features of acupuncture and meridians. Deploying an e-infrastructure that provides collaborative research with advanced data mining services, efficient data and workflow management services, as well as visualization services contribute to the progress in this domain.
Grid-Enabled Non-Invasive Blood Glucose Measurement
Acupuncture Point 1
Acupuncture Point 2
79
Zero Potential Point
Fig. 1. The Electro Signal Measure on the left hand
3
CADGrid Infrastructure
Science has evolved in the past several decades from an empirical and theoretical approach to one that includes computational simulations and modeling [23], commonly known as enhanced science or e-science in short. The term e-Science is often used to refer to highly collaborative computational science that uses distributed software infrastructures, like grids in order to support shared efforts. Technological progress in such e-Science infrastructures have enabled researchers to run complex, computational investigations that include data access, analysis, and largely automated model execution. The China-Austria Data Grid (CADGrid) connects several research institutions in both countries and provides an Intelligence Base offering commonly used models and algorithms as services as well as compute and storage resources. Further it is equipped with our workflow engine WEEP [24] allowing the users to execute a number of pre-selected services in a controlled and efficient way. The Intelligence Base is the heart of the CADGrid infrastructure, providing participants a number of services aiming to support and accomplish user defined research tasks. In general the services can be classified into four main groups, (a) data analysis group includes services representing data mining and other special data analysis algorithms (i.e. Kalman Filtering), (b) data managing and preprocessing services covering issues that occur when working with different data sources or when accessing data resources from different locations, (c) workflow services that are necessary to provide the controlled execution of a number of pre-selected services, and (d) the data visualization group including services for data representation and visualization. Three typical usage scenarios will exemplify how diabetic patients, medical professionals, and researchers in the field of treatment of diabetes mellitus can benefit from NIGM and its underlying grid infrastructure.
80
I. Elsayed et al.
Diabetic patients can measure the electricity information transformation of their blood sugar values using the measurement instrument which will be embedded into mobile devices such as PDA, cell phones and other handhelds. Using the NIGM-Service offered via the Intelligence Base the measurement data can be analyzed on the fly and the patient will be informed via messaging services about his blood glucose values. Patients will benefit twice: first the incurred expenses will be lower in comparison to conventional methods based on chemical reactions and second patients will have a much more convenient method than injuring their skin to receive the needed drop of blood for the chemical reaction. Health professionals and services have a better surveillance of the patient’s illness and can adjust their therapy more efficiently based on the continuously collected data. Scientists from different institutions in different countries can work together on common goals. This will require access to anonymized measurement data and analysis services from different locations. Further they might want to share their results among each other. The CADGrid Intelligence Base provides advanced data management services enabling such requirements in an efficient and secure way. By means of the online portals, scientists can access advanced data analysis tools, computational power, and data resources and share elaborated results.
4
Non-Invasive Glucose Measurement Service
The NIGM-Service covers the process of computing patients glucose values from meridian measurements. The service consists of the execution of several algorithms, each one available as a standalone CADGrid service within the Intelligence Base. Using the workflow engine WEEP [24], a predefined workflow representing the NIGM-Service is deployed and available as one service within the CADGrid Intelligence Base. Figure 2 illustrates the workflow with the visualized outputs of each component. In the following the non-invasive process of calculating patients blood glucose values from meridian measurements is briefly described. More details can be found in [19]: Collect Measurement Data by running a measurement process with the electro signal measurement instrument. This non-invasive painless process is done by a health professional or any trained person on the hand of a patient. The current prototype of the instrument is equipped with a USB interface and connected to a PC, where the occurred measurement data is organized in two files. One representing the input values and the other contains values of the measured output signal. This data, referred to as meridian measurement data is sent to the joint grid testbed where the NIGM-Service will be started. The NIGM-Service is composed of a set of services implementing the following algorithms, which will be executed one after the other, whereas each algorithm’s output represents the input to the next algorithm. System Identification is the first algorithm to be executed. A model is set up for each measured input/output value pair describing the relationship
Grid-Enabled Non-Invasive Blood Glucose Measurement
Input Signals
81
Output Signals
Diabetic
Data
Health Professional
Identification
Transformation
Transformation (FFT)
User
Data
Diabetic
Fig. 2. The Non-Invasive Glucose Measurement Service
between the corresponding signals. The resulting difference equation is used to generate a standard output signal for a common input signal. Kalman Filtering is further used to weaken the white noises and filter the useful signals, as well as useful noises. In fact, the useful signals are the true data retrieved from the meridians. However, the measurement data is blended with different kind of noises: physical, chemical, and biological noises. These noises can represent the patient’s condition and feelings at the moment the measurements were taken i.e. fear, hotness, etc. and also the surroundings of the patient i.e. noisy or electromagnetic environment. The first kind of noises represent useful information (color noise), whereas the latter one (white noise) are of less interest. Although they need to be extracted in order to get data that is close to the true data. This process is defined as optimal estimation of measured true data, which is blended by white and color noises and is covered within the Kalman Filtering service. Wavelet Transformation takes the graph containing the optimally estimated data produced in the previous step and splits it into several frequency levels. Each generated new graph, referred to as wavelet represents the origin time domain graph from different frequency levels. This mechanism of experimental data processing provides the most visual and informative picture of the measured data and allows finding peculiarities of the signal in the area of the wavelet. Hence the wavelet with the most important graph is selected and forwarded to the next algorithm. It is to say that choosing a best wavelet for calculating the blood glucose values is in the current state of research progress an optional step and needs to be elaborated in detail.
82
I. Elsayed et al.
Fast Fourier Transformation is then executed in order to produce the frequency domain representation of the time domain graph used in the previous algorithms. A frequency domain graph shows how much of the signal lies within each given frequency band over a range of frequencies. Further the so called electro-transformation-character-values are computed. These values, such as maximum, integral, center point, etc. represent the characteristics of the produced graph. These are the main inputs for the next step which is to setup a back propagation neural network. Back Propagation Neural Network. In general such a model is used to establish a mathematical model describing the relationship among two data series. The two data series in our model are the electro-transformation-character-values on one side and conventionally measured glucose values, serving as training data in order to set up the model. The model has to be trained first, pictured in the left corner of the figure above. During this phase, in addition to each meridian measurement a conventional method has to be used to get reference values. Once a model is set up for a patient it can be used to compute the patient’s glucose values for a given set of electro-transformation-character-values without conventionally measured values. In order to maintain the model, reference values have to be measured again in a certain time interval (e.g. once a week) and the model must be re-evaluated to accommodate recent changes and developments in the patient health condition and to further improve precision and robustness.
5
Related Work
The development of non-invasive methods for measuring human blood glucose values has been targeted by a number of research institutions all over the world. The most common non-invasive methods were categorized into two broad categories [16]: (a) blood glucose measurement with external factor and (b) without external factor (based on the theory that blood glucose values can be derived from glucose concentration in human body liquids like tears, urine and saliva). The latter cannot be used for continuous measurement of glucose concentration in blood. Methods with external factor are described in the following: Electromagnetic Radiation. Here electromagnetic radiation (EMR) is used as an external factor for the non-invasive measurement of glucose value in blood. The optical characteristics of the tissue are observed and analyzed when a human body is exposed to EMR. Experiments have shown that optical methods are not sufficient to calculate blood glucose values accurately, therefore other external factor techniques like mechanical stimulation of tissues and analysis of light scattering are more frequently used. Eye Sensitivity to small color changes. In this technique the value of glucose in blood is measured from the eye sensitivity to small color changes where wide range of wavelengths, filters and detectors are used. Endogenous Method. This method correlates changes in the glucose value to changes in the electro-physiological activity of certain peripheral nerves.
Grid-Enabled Non-Invasive Blood Glucose Measurement
83
Changes in their endogenous physiological and biochemical functions are observed from which the glucose value is calculated. Nuclear Magnetic Resonance. In this method the nuclear magnetic resonance spectrum and water resonance are considered. Blood glucose values are calculated on the basis of theory that the ratio of the resonance frequencies correlates with the blood glucose level. Our approach has the advantage to split the process of blood glucose value estimation into a developable, personalized data mining process and a rather simple source signal emitting and recording phase. Improvements to the involved data mining services and overall process can be deployed remotely and will directly result in a more precise and robust estimation for the patient without the need to change the client environment. Another important benefit of our approach is that the introduced concept of local measurement and remote personalized estimation is general applicable to various scenarios, e.g. for estimating another vital parameter like blood pressure. E-Health [25], the use of information and communication technologies to improve or enable health care, will have various impacts on health care services [26] and the quality, cost and efficiency of patient care [27]. Health Grids [27] are going to be used for the individualized health care and the epidemiology analysis. The former is improved by the secure and efficient combination of the widespread personal clinical information and the availability of advanced services for diagnostic and therapy. The latter combine the information from a wide population to extract the knowledge that can lead to the discovery of new correlations between symptoms, diseases, genetic features or any other clinical data. An example of a project serving both directions is @neurIST [3], which aims to create an IT infrastructure for the management of all processes linked to research, diagnosis and treatment development for complex and multi-factorial diseases - currently focusing on cerebral aneurysm and subarachnoid haemorrhage. The recently started EU project OLDES [28] includes a pilot application focusing on older persons suffering from Type 2 diabetes mellitus. The main aim is to provide a low-cost and easy-to-use health care platform, including a continuous glucose monitoring system. All measured data, including other vital parameters, will be transferred wirelessly to the patient’s health provider. This will enable a better surveillance of the patient’s health status and more efficient adjustment of therapy. While we are having the same overall aims as OLDES namely the reduction of acute and chronic complications of diabetes and a more effective prevention of emergencies, resulting in the reduction of the frequency of hospitalizations and increased quality of life - we are targeting also the commonly younger, more mobile and active Type 1 diabetics with our non-invasive measurement method, but not providing such a comprehensive health platform.
6
Conclusions
This paper has outlined the China-Austria Data Grid framework in the context of its first application, namely the Non-Invasive Glucose Measurement Service,
84
I. Elsayed et al.
in short NIGM-Service. The key contribution in this paper is the grid based implementation of a novel non-invasive method for accurate estimation of blood glucose values based on electro-transformation measures in human body meridians. The presented approach has two main benefits, by splitting the process of vital parameter estimation into an evolve-able, personalized data mining process and a rather simple source signal emitting and recording phase: first, the infrastructure can easily be applied to other target values and second, improvements to the involved data mining services and process will directly result in a more precise and robust estimation of the values. It follows from the discussion in this paper that the treatment of diabetic patients will be the first domain highly profiting (improvement of quality of life, economical aspects, etc.) from the NIGM-Service. However, the scientific computing infrastructure presented in this paper also establishes the basis for a number of future applications and extensions to other domains. Acknowledgments. The work described in this paper is being carried out as part of the research projects “Medical Measurement Grid for On-Line Diagnosis” and “Austrian Grid” supported by the Austrian Federal Ministry of Science and Research.
References 1. De Roure, D., Baker, M.A., Jennings, N.R., Shadbolt, N.R.: The evolution of the grid. In: Berman, F., Hey, A.J.G., Fox, G. (eds.) Grid Computing: Making The Global Infrastructure a Reality, pp. 65–100. John Wiley & Sons, Chichester (2003) 2. Ramakrishnan, L., Simmhan, Y., Plale, B.: Realization of Dynamically Adaptive Weather Analysis and Forecasting in LEAD: Four Years Down the Road. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007. LNCS, vol. 4487, pp. 1122–1129. Springer, Heidelberg (2007) 3. The @neurIST Project: Integrated Biomedical Informatics for the Management of Cerebral Aneurysms (2008), http://www.aneurist.org/ 4. Benkner, S., Berti, G., Engelbrecht, G., Fingberg, J., Kohring, G., Middleton, S.E., Schmidt, R.: GEMSS: Grid-infrastructure for Medical Service Provision (2004) 5. Krishnan, A.: A survey of life sciences applications on the grid. New Generation Computing 22(2), 111–126 (2004) 6. Srinivasan, L., Treadwell, J.: An overview of service-oriented architecture, web services and grid computing. Hewlett-Packard White Paper (2005) 7. Abowd, G.D., Mynatt, E.D.: Charting past, present, and future research in ubiquitous computing. ACM Transactions on Computer-Human Interaction (TOCHI) 7(1) (2000) 8. Satyanarayanan, M.: Fundamental challenges in mobile computing. In: PODC 1996: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, pp. 1–7 (1996) 9. Mattern, F.: Ubiquitous computing: Scenarios from an informatised world. In: Zerdick, A., et al. (eds.) E-Merging Media - Communication and the Media Economy of the Future, pp. 145–163. Springer, Heidelberg (2005) 10. The AKOGRIMO Project: Access to Knowledge trough the Grid in a Mobile World (2008), http://www.mobilegrids.org/
Grid-Enabled Non-Invasive Blood Glucose Measurement
85
11. Cannataro, M., Talia, D.: Towards the next-generation grid: a pervasive environment for knowledge-based computing. Information Technology: Coding and Computing, 437–441 (2003) 12. Maciocia, G.: The Foundations of Chinese Medicine: A Comprehensive Text for Acupuncturists and Medical Herbalist. Elsevier Churchill Livingstone (2005) 13. Wen, D.: The drum of chinese medicine’s modernization beats loudly: A summary of the second international science and technology conference on traditional chinese medicine. Acupuncture Today (2005) 14. Schloegl, R.: Report on the outcome of the conference ’traditional chinese medicine - a successful concept for east and west’. In: Seminar on the modernization of traditional medicine, pp. 10–11 (2006) 15. WHO-IDF: Definition and diagnosis of diabetes mellitus and intermediate hyperglycemia. Report of a WHO/IDF Consultation (2006) 16. Bazaev, N.A., Selishchev, S.V.: Noninvasive methods for blood glucose measurement. Biomedical Engineering 41(1), 42–50 (2007) 17. Diabetes-Austria (2008), http://www.diabetes-austria.com/ 18. CADGrid: China-austria data grid (2007), http://www.par.univie.ac.at/project/cadgrid/ 19. Han, J., Han, Y., Xia, Q., Hou, X., Li, Y.: Experiment and analysis on transmission-characteristics of human-body-meridians-electro-information with application. Modern Chinese- and west-Medicine Magazine 3(19), 17–29 (2005) 20. Zhang, W.B., Jeong, D.: Subcutaneous impedance measured by four-electrode method and low impedance acupoints located by single power alternative current. American Journal of Chinese Medicine 32(5), 779–788 (2004) 21. WHO: International standard terminologies on traditional medicine in the western pacific region. WHO Library Cataloging in Publication Data (2007) 22. Zhang, W.B.: Proceedings in the study of transcutaneous CO2 emission in acupuncture and meridians. World Journal of Gastroenterol 6(3) (2000) 23. Bell, G., Gray, J., Szalay, A.: Petascale computational systems. Computer 39(1), 110–112 (2006) 24. WEEP: The workflow enactment engine project (2005), http://weep.gridminer.org 25. Oh, H., Rizo, C., Enkin, M., Jadad, A.: What is ehealth (3): A systematic review of published definitions. Journal of Medical Internet Research (2005) 26. Martin, S., Yen, D.C., Tan, J.K.: E-health: impacts of internet technologies on various healthcare and services sectors. International Journal of Healthcare Technology and Management 4(1/2), 71–86 (2002) 27. Breton, V., Dean, K., Solomonides, T.: The healthgrid white paper (2005), http://www.whitepaper.healthgrid.org 28. The OLDES project: Old people’s e-services at home (2007), http://www.oldes.eu/
Simulating N-Body Systems on the Grid Using Dedicated Hardware Derek Groen1,2 , Simon Portegies Zwart1,2 , Steve McMillan3 , and Jun Makino4 1
2
Section Computational Science, University of Amsterdam, Amsterdam, The Netherlands
[email protected] Astronomical Institute “Anton Pannekoek”, University of Amsterdam, Amsterdam, The Netherlands 3 Drexel University, Philadelphia, United States 4 National Astronomical Observatory, Mitaka, Japan
Abstract. We present performance measurements of direct gravitational N -body simulation on the grid, with and without specialized (GRAPE-6) hardware. Our intercontinental virtual organization consists of three sites, one in Tokyo, one in Philadelphia and one in Amsterdam. We run simulations with up to 196608 particles for a variety of topologies. In many cases, high performance simulations over the entire planet are dominated by network bandwidth rather than latency. Using a global grid of GRAPEs our calculation time remains dominated by communication over the entire range of N , which was limited due to the use of three sites. Increasing the number of particles will result in a more efficient execution and for > 2 · 106 we expect the computation time to overtake the communiN ∼ cation time. We compare our results with a performance model and find that our results are in accordance with the predicted values.
1
Introduction
The simulation of a star cluster is commonly performed by direct-method N-body integrators [1]. The gravitational force on individual stars in such simulations is calculated by aggregating the force contributions from all other particles in the system. This is a compute-intensive operation that requires the use of parallel algorithms or dedicated hardware (such as GRAPEs [2], or GPUs [3]) for simulating more than a few thousand stars. Several parallel algorithms have been developed for N-body simulations, including a copy algorithm [4], where updated particles are exchanged between all processes, and a ring algorithm [5]. Parallelization of GRAPEs appears to be an efficient way to reduce the wallclock time for individual simulations [4,5,6]. The gravitational N -body problem has calculation time complexity O(N 2 ), whereas the communication scales only with O(N ). For sufficiently large N , the force calculation time will therefore overtake the communication time. For a local cluster of GRAPEs with low-latency M. Bubak et al. (Eds.): ICCS 2008, Part I, LNCS 5101, pp. 86–95, 2008. c Springer-Verlag Berlin Heidelberg 2008
Simulating N-Body Systems on the Grid Using Dedicated Hardware
87
and high bandwidth network, break-even between calculation and communication is reached at N ∼ 104 [6]. Generally, GRAPE clusters are not cheap and few institutions can afford such dedicated hardware solutions. An alternative to purchasing a large cluster is provided by a computational grid [7]. Grid technology can be applied to combine several clusters (with or without GRAPEs) into one collective infrastructure. Doing so is beneficial, as the purchase and maintenance costs are shared among institutes. The grid provides security mechanisms to allow uniform registration and authentication, monitoring tools to detect idle GRAPEs and meta-schedulers to divide the workload over the participating sites. These features make grids both more scalable and flexible than cluster setups that connect using ssh keys [8]. The real challenge for the grid is to develop new applications for astronomical problems that have yet to be solved. For example, the simulation of an entire galaxy requires at least several PFLOP/s of computational power and the development of a hybrid simulation environment [9]. Such an environment performs several astrophysical simulations on vastly different temporal and spatial scales, simulating gravity interactions as well as stellar evolution and treatment of close encounters. To facilitate these tightly-coupled multi-physics simulations on the PFLOP/s scale, we require an extensive and heterogeneous grid infrastructure consisting of several powerful compute clusters. Although grid technology has often been applied to facilitate high-throughput computing [10] or loosely-coupled simulations, little research has been done on investigating how the grid can be efficiently used to solve tightly-coupled HPC problems. By using grid technology for this specific set of problems, we can potentially fullfill the computational requirements for performing petascale multi-physics simulations. Using a grid infrastructure for HPC has another drawback, as networks between grid sites have completely different characteristics compared to local area networks. Earlier experiments indicate that a grid of regular PCs across Europe improves overall performance for relatively small N [5], but these results do not necessarily extend to a global grid of GRAPEs, which has intercontinental network lines connecting special purpose nodes. We address the question for which problem size a world-wide grid has practical usage, and how to optimize our simulations to take advantage of the grid. In this, we focus on grids equipped with GRAPE hardware.
2
Technical Setup and Performance Model
We have constructed a heterogeneous grid of GRAPEs, which we call the Global GRAPE Grid (or G3). The G3 consists of five nodes across three sites, where each of the nodes is equipped with a GRAPE-6Af special purpose computer. We provide the technical details of our grid setup in 2.1, while we briefly describe the applied performance model in 2.2.
88
D. Groen et al.
2.1
Technical Setup
Of the five nodes in the G3, two nodes are located at Tokyo University (Tokyo, Japan), two are located at the University of Amsterdam (Amsterdam, the Netherlands) and one is at Drexel University (Philadelphia, United States). Local nodes in the G3 are connected by Gigabit Ethernet, whereas different sites are connected with regular internet. In Table 1 we present the specifications of the G3. Each of the computers in the G3 is set up with Globus Toolkit middleware1 and MPICH-G22 . Table 1. Specifications for the nodes in G3. The first column gives the name of the computer followed by its country of residence (NL for the Netherlands, JP for Japan and US for the United States). The subsequent columns give the type of processor in the node, the amount of RAM, followed by the operating system, the kernel version and the version of Globus installed on the PC. Each of the nodes is equipped with a 1 Gbit/s Ethernet card and GRAPE-6Af hardware. Local nodes are interconnected with Gigabit Ethernet. name vader palpatine yoda skywalker obi-wan
location CPU type NL NL JP JP US
Intel P4 2.4GHz Intel P4 2.67GHz Athlon 64 3500+ Athlon 64 3500+ 2x Xeon 3.6GHz
RAM OS kernel Globus [MB] version 1280 Ubuntu 5.10 2.6.5 4.0.3 256 RHEL 3 2.4.21 4.0.3 1024 FC 2 2.6.10 3.2.1 1024 FC 2 2.6.10 3.2.1 2048 Gentoo 06.1 2.6.13 4.0.4
In Table 2 we present the network characteristics, latency and bandwidth, of the connections within G3. We tested local area network (LAN) and wide area network (WAN) connections using the UNIX ping command to measure latency. We use scp for measuring the network bandwidth, transferring a 75 MB file, rather than referring to theoretical limits because the majority of bandwidth on non-dedicated WANs is used by external users. For our performance measurements, we used a standard implementation of MPICH-G2 without specific optimizations for long-distance networking. As a result, the MPI communication makes use of only 40%-50% of the available bandwidth3 . If we were to optimize MPICH-G2, or add support for grid security to already optimized MPI libraries, such as Makino’s tcplib4 or OpenMPI, our bandwidth use would be close to the bandwidth use of a regular file transfer. The N-body integrator we have chosen for our experiments uses block timesteps [11] with a 4th order Hermite integration scheme [12]. The time steps with which the particles are integrated are blocked in powers of two between a 1 2 3
4
http://www.globus.org http://www3.niu.edu/mpi/, in the future: http://dev.globus.org/wiki/MPICH-G2 For more information we refer to a research report from INRIA: http://hal.inria.fr/inria-00149411/en/ See: http://grape.mtk.nao.ac.jp/∼makino/softwares
Simulating N-Body Systems on the Grid Using Dedicated Hardware
89
Table 2. Characteristics of local and wide network connections. Latency indicates the required time for sending 1 byte through the network connection. The bandwidth indicates the transfer capacity of the network connection. The bandwidth was measured with a 75MB scp file transfer. connection
latency [ms] Amsterdam LAN 0.17 Tokyo LAN 0.04 Amsterdam - Tokyo WAN 266.0 Amsterdam - Phil. WAN 104.0 Philadelphia - Tokyo WAN 188.0
bandwidth (theory) bandwidth (real) [MB/s] [MB/s] 125.0 11.0 125.0 33.0 57.0 0.22 312.5 0.56 57.0 0.32
minimum of 2−22 and a maximum of 2−3 N-body time unit [13]. During each time step, the codes perform particle predictions, calculate forces between particles and correct particles on a block of active particles (see [6] for a detailed description of the integration scheme). Particle corrections include updates of positions and velocities, and computation of new block time steps of particles. For our experiments we use two implementations of an N -body integrator. One of these codes runs on a single PC with and without GRAPE, whereas the other is parallelized with MPI using the ring algorithm (see [5] for more details). We initialize the simulations using Plummer spheres that were in virial equilibrium and performed our simulations using a softening parameter of 2−8 . Since our simulations are performed over one N -body time unit , the realization of the N-body system is not critical to the timing results. 2.2
Performance Model
To further understand our experiments we adopted the parallel performance model described by [14], which is based on the work of [15], [6] and [5], but then applied to the grid. To apply these models, we need to measure several parameters. These include τpred , which is the time to predict a single particle, τforce , which is the time to calculate the forces between two particles, and τcorr , which is the time spent to correct a single particle. We measure the values for τpred , τforce and τcorr by using a sample N-body simulation with 32768 particles, and provide them in table 3 for the various nodes in the G3. We have applied the performance model to the results presented in Sect.3. In Fig. 1 we compare the measured wall-clock time for the ring algorithm on the grid with the performance model. To guide the eye, the results for a single GRAPE are also presented in both figures. The performance model tracks the real measurements quite satisfactorily, giving a slightly lower computation time for a single GRAPE while giving a slightly higher computation time for a simulation across grid sites. The communication overhead of a distributed computer often renders high performance computing on a grid inefficient. However, for sufficiently large N ,
90
D. Groen et al.
Table 3. Machine performance specification and machine-specific constants. The first two columns show the name of the machine, followed by the country of residence. The last three columns give the time required for to perform one particle prediction (τpred ), the time required for one force calculation between two particles (τforce ) and the time required for correcting one particle (τcorr ) respectively, all in microseconds. name
location τpred [μs] vader NL 0.247 palpatine NL 0.273 yoda JP 0.131 skywalker JP 0.131 obi-wan US 0.098
τforce [μs] 0.216 0.193 0.110 0.110 0.148
τcorr [μs] 4.81 2.39 1.29 1.29 1.14
there will eventually be a point where relatively little time is lost communicating, and the compute resources are efficiently used. In Fig. 1 we can see that, for GRAPE-enabled simulations, the model predicts break-even between calculation and communication around N 2 · 106 . For large N , a grid of two GRAPEs will therefore outperform a single GRAPE.
3
Results
We have performed a number of simulations on local machines and on the G3, which consists of timing simulations lasting one N-body time unit and short simulations that have been profiled. We measured the full wall-clock execution time for the longer simulations and we profiled the shorter simulations. 3.1
Timing Results of N-Body Calculations
We run the N -body codes, discussed in Sect.2.1, on a single PC and across the network in parallel using N = 1024 to N = 65536 (a few additional calculations were performed with N > 65536). The runs were performed with and without GRAPE. We present our results in Fig. 1. If a simulation is run multiple times with the same problem set, the execution time may be slightly different per run. This variation is within the margin of 1.07 over 4 runs, and can be primarily attributed to fluctuations in the network bandwidth. Single PC. The performance on a single PC (represented by the thick dashed line with bullets in Fig.1) is entirely dominated by force calculations, which scales as O(N 2 ). As the number of steps per N-body time unit increases with N , the execution time scales slightly worse than N 2 . Grid of PCs. The performance on the G3 using all three sites, without using GRAPE, is given by the thin dashed line with triangles. For N < 24576, the performance is dominated by network communication. Given that p indicates the number of processes, the network communication scales as O (N log p) [6].
Simulating N-Body Systems on the Grid Using Dedicated Hardware 106
91
Ring
105
Tapp [s]
104
10
3
102
10
1
10
0
103
1 GRAPE 2 GRAPEs (PT) 2 GRAPEs (AT) 3 GRAPEs (APT) 1 PC 3 PCs (APT) perf. model 104
105
106
N
Fig. 1. The time for running the application for 1 N -body time unit (Tapp ) as a function of the number of stars (N ) using the ring algorithm. The two thick lines give the results for a single CPU with GRAPE (lower solid curve) and without (top dashed curve). We make the distinction between solid curves to present the results for simulations run with GRAPE, and dashed curves to give the results without GRAPE. The results on the grid are presented with four different lines, based on the three included locations. Each of these runs is performed with one node per site. The results for the WAN connection Philadelphia–Tokyo (given in the legend by PT), Amsterdam–Tokyo (AT) and Amsterdam–Philadelphia–Tokyo (APT) are indicated with the solid curves with filled squares, open squares and filled triangles, respectively. The dashed curve with filled triangles gives the results for the Amsterdam–Philadelphia–Tokyo connection but without using GRAPE. Dotted lines indicate the performance of runs with GRAPE according to the performance model.
For our grid-based simulation experiments without GRAPE, break-even between communications and force calculations is achieved around N ∼ 4 · 104 . For larger N , the execution time is dominated by force calculations, rather than network communication. Single PC with GRAPE. The performance on a single PC with GRAPE, given by the thick solid line with bullets, is dominated by force calculations, although communication between host and GRAPE, and operations on the host PC have an impact on performance for N < 16384. For such small N , the GRAPE performs less efficiently, because many blocks are too small to fill the GRAPE pipelines. For larger N , force calculations become the performance bottleneck, and the scaling of the execution time becomes that of a single PC without GRAPE. Grid of PCs with GRAPE. The performance on two sites in the G3 (with GRAPEs) is given by the thin solid line with solid squares for calculations
92
D. Groen et al.
100
76
133
234
410
720
block size [n] 1262 2213
3880
6803
11926
network bandwidth
network latency
10-1
share of time spent
force calculations 10-2
-3
10
PC-GRAPE comm. time corrector -4
10
predictor 10-5 3 10
104
105
106
N
Fig. 2. Share of wall-clock time spent on individual tasks during a single time step, using 3 nodes on 3 sites. Solid lines indicate tasks performed locally. The thick solid line with filled circles represents time spent on force calculations, and the thin solid lines give the result for time spent on communication between PC and GRAPE (open triangles), particle corrections (open circles) and particle predictions (open squares) respectively. Dotted lines indicate time spent on communication between nodes. The thin dotted line with asterisks indicates time spent on communication latency between nodes and the thick dotted line with solid squares indicates time spent on using the network bandwidth.
between Philadelphia and Tokyo, and by the thin solid line with open squares for calculations between Amsterdam and Tokyo. The performance on the G3 using all three sites is given by the thin solid line with triangles. For all problem sizes N we have measured, the grid speedup Γ [16] is less than 0.15, indicating that the performance is dominated by network communication. The network communication time scales better than the force calculation time, therefore, if N is sufficiently large, force calculation time will overtake the network communication time. However, this break-even point lies at much higher N than for a grid of PCs, because the use of GRAPE greatly decreases the time spent on force calculations. 3.2
Profiling of the N-Body Simulations
We have chosen one parallel algorithm (ring) and one resource topology (3 nodes on 3 sites) to profile the simulation during one integration time step. The block size n for every measurement was fixed using a formula for calculating average block size n = 0.20N 0.81 , which has been used for the same initial conditions in [3]. During execution, we measured the time spent on individual tasks, such as force
Simulating N-Body Systems on the Grid Using Dedicated Hardware
93
calculations or communication latency between processes. We have profiled our simulations for N = 1024 up to N = 196608, using the timings measured on the process running in Tokyo. The results of these measurements are given in Fig. 2. We find that for larger N , low bandwidth of our wide area network affects the outcome of the performance measurements, and that MPI calls are only able to use about a quarter of the available bandwidth for passing message content. > 5 · 105 we expect the force calculation to take more time than network For N ∼ latency. If we were to use the network bandwidth more efficiently for such a large number of particles, the execution time would be dominated by force calculations. The usable bandwidth can be increased either by using a more efficient MPI implementation (see Sect.2.1) or by using a dedicated network. Using our > 2 · 106 current networking and MPI implementation, we expect that for N ∼ particles the force calculation time overtakes the bandwidth time.
4
Conclusions
We studied the potential use of a virtual organization in which GRAPEs are used in a wide area grid. We tested the performance model with an actual grid across three sites, each of which is located on a different continent. We used GRAPE hardware in Japan, the Netherlands and the USA in parallel for calculations of 1024 up to 196608 particles. With these particle numbers we were unable to reach superior speed compared to a single GRAPE. However, we were both