Rejoignez-nous au Binding Hook Live le 27 octobre au Underbelly Boulevard Soho à Londres.

Rejoignez-nous au Binding Hook Live

Informatique distribuée

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.

Bâtisseur de programmes d'études

Besoin d'aide ? Cliquez ici pour les instructions.

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.

Informatique distribuée

Bâtisseur de programmes d'études

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.

Fonctionnement du générateur de programmes d'études

Merci de vous être inscrit à notre lettre d'information !

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.

Merci d'avoir posé votre candidature ! Nous vous contacterons.

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.

Chargement...