Advertisement

Distributed Processing for Large Geodetic Solutions

  • H. BoomkampEmail author
Conference paper
Part of the International Association of Geodesy Symposia book series (IAG SYMPOSIA, volume 138)

Abstract

This paper reports on the activities of the IAG Working Group 1.1.1 on combination and comparison of precise orbits based on different space geodetic techniques. It will focus on the Dancer project which implements a distributed parameter estimation process that is scalable in the number of GPS receivers, so that an arbitrarily large number of receivers can be processed in a single reference frame realization. The background of this project will be summarized and its mathematical principles will be explained, as well as the essential aspects of the involved internet communication. It will show that the workload for data processing at a single participating receiver remains independent of the network size, while the data traffic only grows as a logarithmic function of the network size.

Keywords

Grid computing Distributed process Batch least squares GPS Orbit estimation 

References

  1. Altamimi Z, Boucher C, Sillard P (2002) New trends for the realization of the international terrestrial reference system. Adv Space Res 30(2):175–184CrossRefGoogle Scholar
  2. Anderson DP (2004) BOINC: a system for public-resource computing and storage. In: Proceedings 5th IEEE/ACM international workshop on grid computing. PittsburghGoogle Scholar
  3. Andrzejak A, Kondo D, Anderson DP (2010) Exploiting non-dedicated resources for cloud computing. 12th IEEE/IFIP network operations & management symposium OsakaGoogle Scholar
  4. Boomkamp HJ (2010) Global GPS reference frame solutions of unlimited size. Adv Space Res 46(2):136–143CrossRefGoogle Scholar
  5. Cappello F, Djilali S, Fedak G, Herault T, Magniette F, Neri V, Lodygensky O (2005) Computing on large scale distributed systems. Future Gener Comp Syst, Elsevier ISSN 0167-739X, 21(3):417–437Google Scholar
  6. Chung KL (1974) Elementary probability theory with stochastic processes. Springer, New york. ISBN 0-387-90159-0CrossRefGoogle Scholar
  7. Korpela E, Werthimer D, Anderson D, Cobb J, Leboffsky M (2001) SETI@home – massively distributed computing for SETI, computing in science and engineering 3 iss 1, Dubois ed (on-line)Google Scholar
  8. OECD (2009) Indicators of broadband coverage. Directorate for science, technology and industry, report DSTI/ICCP/CISP(2009)3/FINAL (on-line)Google Scholar
  9. Sameh AH (1971) On Jacobi and Jacobi-like algorithms for a parallel computer. Math Comput 25(115):579–590 (on-line)CrossRefGoogle Scholar
  10. Verstrynge J (2008) Practical JXTA. Lulu.com, Raleigh ISBN 978–1409215646Google Scholar
  11. Wilson BD (2002) JXTA. New Riders Publishing, Indianapolis. ISBN 0-73571-234-4Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.IAG sub-commission 1.1, Working Group 1, ESOCDarmstadtGermany

Personalised recommendations