Besuchen Sie uns bei Binding Hook Live am 27. Oktober im Underbelly Boulevard Soho in London

Begleiten Sie uns zu Binding Hook Live

Verteiltes Rechnen

This module explores distributed computing, focusing on the architecture, functionality, and challenges of systems that distribute processing tasks across multiple computers. It covers concepts such as parallel processing, fault tolerance, and security considerations in distributed environments.

Curriculum Builder

Brauchen Sie Hilfe? Klicken Sie hier für Anweisungen.

Cormen, Thomas H., Charles E. Leiserson, and Ronald L. Rivest. “Chapter 28.” In Introduction to Algorithms, 24. print. The MIT Electrical Engineering and Computer Science Series. Cambridge, Mass.: MIT Press [u.a.], 2000.

Leighton, Frank Thomson. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. 1st ed. San Francisco, CA: Morgan Kaufmann Publications, 1991.

Hromkovič, Juraj, Ralf Klasing, Andrzej Pelc, Peter Ružička, and Walter Unger. Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Texts in Theoretical Computer Science. An EATCS Series (TTCS). Berlin ; New York: Springer, 2005.

Peleg, D. Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications. Philadelphia: Society for Industrial and Applied Mathematics, 2000.

Verteiltes Rechnen

Curriculum Builder

Cormen, Thomas H., Charles E. Leiserson, and Ronald L. Rivest. “Chapter 28.” In Introduction to Algorithms, 24. print. The MIT Electrical Engineering and Computer Science Series. Cambridge, Mass.: MIT Press [u.a.], 2000.

Leighton, Frank Thomson. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. 1st ed. San Francisco, CA: Morgan Kaufmann Publications, 1991.

Hromkovič, Juraj, Ralf Klasing, Andrzej Pelc, Peter Ružička, and Walter Unger. Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Texts in Theoretical Computer Science. An EATCS Series (TTCS). Berlin ; New York: Springer, 2005.

Peleg, D. Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications. Philadelphia: Society for Industrial and Applied Mathematics, 2000.

Wie der Curriculum Builder funktioniert

Vielen Dank, dass Sie sich für unseren Newsletter angemeldet haben!

Thank you! RSVP received for Cormen, Thomas H., Charles E. Leiserson, and Ronald L. Rivest. “Chapter 28.” In Introduction to Algorithms, 24. print. The MIT Electrical Engineering and Computer Science Series. Cambridge, Mass.: MIT Press [u.a.], 2000.

Vielen Dank für Ihre Bewerbung! Wir bleiben in Kontakt.

Apply for: Cormen, Thomas H., Charles E. Leiserson, and Ronald L. Rivest. “Chapter 28.” In Introduction to Algorithms, 24. print. The MIT Electrical Engineering and Computer Science Series. Cambridge, Mass.: MIT Press [u.a.], 2000.

Cormen, Thomas H., Charles E. Leiserson, and Ronald L. Rivest. “Chapter 28.” In Introduction to Algorithms, 24. print. The MIT Electrical Engineering and Computer Science Series. Cambridge, Mass.: MIT Press [u.a.], 2000.

Laden...