Ελάτε μαζί μας στο Binding Hook Live στις 27 Οκτωβρίου στο Underbelly Boulevard Soho στο Λονδίνο

Ελάτε μαζί μας στο 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.

Δημιουργός προγράμματος σπουδών

Χρειάζεστε βοήθεια; Κάντε κλικ εδώ για οδηγίες.

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

Δημιουργός προγράμματος σπουδών

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.

Πώς λειτουργεί το πρόγραμμα σπουδών

Σας ευχαριστούμε για την εγγραφή σας στο ενημερωτικό μας δελτίο!

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.

Σας ευχαριστούμε για την αίτησή σας! Θα επικοινωνήσουμε μαζί σας.

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.

Φόρτωση...