default search action

combined dblp search
author search
venue search
publication search

ask others

7th CLADE@HPDC 2009: Garching, Germany

> Home > Conferences and Workshops > CLADE
> Home > Conferences and Workshops > HPDC

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

- view
  authority control:
- export record
  dblp key:
  - conf/clade/2009
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/clade/2009
Thomas Rauber, Gudula Rünger, Emmanuel Jeannot, Shantenu Jha:
Proceedings of the 7th international workshop on Challenges of large applications in distributed environments, CLADE@HPDC 2009, Garching near Munich, Germany, June 10, 2009. ACM 2009, ISBN 978-1-60558-588-8

Contributed papers

- view
  authority control:
- export record
  dblp key:
  - conf/clade/BarkerBRW09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/clade/BarkerBRW09
Adam Barker, Paolo Besana, David Robertson, Jon B. Weissman:
The benefits of service choreography for data-intensive computing. 1-10
- view
  authority control:
- export record
  dblp key:
  - conf/clade/Nussbaum09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/clade/Nussbaum09
Lucas Nussbaum:
Rebuilding debian using distributed computing. 11-16
- view
  authority control:
- export record
  dblp key:
  - conf/clade/SharrockKMACSBP09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/clade/SharrockKMACSBP09
Rémi Sharrock, Fadi Khalil, Thierry Monteil, Hervé Aubert, Fabio Coccetti, Patricia Stolf, Laurent Broto, Robert Plana:
Deployment and management of large planar reflectarray antennas simulation on grid. 17-26

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.