Dołącz do nas podczas Binding Hook Live 27 października w Underbelly Boulevard Soho w Londynie

Dołącz do nas na Binding Hook Live

Distributed Computing

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.

Kreator programów nauczania

Potrzebujesz pomocy? Kliknij tutaj dla instrukcji.

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.

Distributed Computing

Kreator programów nauczania

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.

Jak działa kreator programów nauczania

Dziękujemy za zapisanie się do naszego newslettera!

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.

Dziękujemy za zgłoszenie! Będziemy w kontakcie.

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.

Ładowanie...