Skip to main content
Log in

Algorithmenbibliotheken

  • HAUPTBEITRAG
  • ALGORITHMENBIBLIOTHEKEN
  • Published:
Informatik-Spektrum Aims and scope

Zusammenfassung

Wir berichten über Erfahrungen mit Algorithmenbibliotheken im Rahmen des SPP 1307 Algorithm Engineering. Den Schwerpunkt bilden unsere Anpassungen der C++ STL für Sekundärspeicher und Multicore. Weitere Beispiele sind parallele Algorithmen für die Computational Geometry Algorithms Library CGAL sowie ein leistungsfähiger Graphpartitionierer. Als Anwendungsbeispiele diskutieren wir minimale Spannbäume und die Konstruktion von Suffix-Tabellen zur Volltextsuche.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. Batista VHF, Millman DL, Pion S, Singler J (2010) Parallel geometric algorithms for multi-core computers. Comput Geom 43(8):663–677

    Article  MathSciNet  MATH  Google Scholar 

  2. Beckmann A, Dementiev R, Singler J (2009) Building a parallel pipelined external memory algorithm library. In: 23rd IEEE International Symposium on Parallel and Distributed Processing, Rom, 25.–29.5.2009, pp 1–10

  3. Dementiev R (2006) Algorithm engineering for large data sets. Doktorarbeit, Universität des Saarlandes

  4. Dementiev R, Kärkkäinen J, Mehnert J, Sanders P (2008) Better external memory suffix array construction. ACM J Exper Algorithm 12. Special issue on Alenex 2005, online article

  5. Dementiev R, Kettner L, Sanders P (2008) STXXL: Standard Template Library for XXL data sets. Software Pract Exper 38(6):589–637

    Google Scholar 

  6. Dementiev R, Sanders P, Schultes D, Sibeyn J (2004) Engineering an external memory minimum spanning tree algorithm. In: IFIP TCS, Toulouse, pp 195–208

  7. Dementiev R, Singler J (2010) Libraries. In: Müller-Hannemann M, Schirra S (eds) Algorithm Engineering, LNCS, vol 5971, Springer, pp 290–324

  8. Frias L, Singler J (2007) Parallelization of bulk operations for STL dictionaries. In: Euro-Par Workshops, LNCS, vol. 4854, Springer, pp 49–58

  9. Mehlhorn K, Näher S (1999) The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press

  10. Osipov V, Sanders P, Schulz C (2012) Engineering graph partitioning algorithms. In: 11th International Symposium on Experimental Algorithms (SEA), LNCS, vol. 7276, Springer, pp 18–26

  11. Osipov V, Sanders P, Singler J (2009) The filter-Kruskal minimum spanning tree algorithm. In: 10th Workshop on Algorithm Engineering and Experiments (ALENEX), New York, 3.1.2009, pp 52–61

  12. Sanders P, Speck J, Träff JL (2009) Two-tree algorithms for full bandwidth broadcast, reduction and scan. Parallel Comput 35(12):581–594

    Article  MathSciNet  Google Scholar 

  13. Sanders P, Träff JL (2002) The factor algorithm for regular all-to-all communication on clusters of SMP nodes. In: 8th Euro-Par, LNCS, vol 2400, Springer, pp 799–803

  14. Sanders P, Träff JL (2006) Parallel prefix (scan) algorithms for MPI. In: Recent Advances in Parallel Virtual Machine and Message Passing Interface. 13th European PVM/MPI Users’ Group Meeting, LNCS, vol 4192, Springer, pp 49–57

  15. Singler J (2010) Algorithm libraries for multi-core processors. Doktorarbeit, Universität Karlsruhe

  16. Singler J, Kosnik B (2008) The libstdc++ parallel mode: software engineering considerations. In: International Workshop on Multicore Software Engineering (IWMSE), Leipzig, 11.5.2008

  17. Singler J, Sanders P, Putze F (2007) MCSTL: The multi-core standard template library. In: 13th International Euro-Par Conference, LNCS, vol 4641, Springer, pp 682–694

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peter Sanders.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sanders, P. Algorithmenbibliotheken. Informatik Spektrum 36, 174–179 (2013). https://doi.org/10.1007/s00287-013-0683-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00287-013-0683-2

Navigation