Adobe PDF (137.82 kB)
Title Details:
Parallel and distributed computing
Authors: Markou, Evripidis
Kranakis, Evangelos
Pagourtzis, Aristeidis
Krizanc, Danny
Reviewer: Nikolopoulos, Stavros
Description:
Abstract:
This chapter provides a historical overview of parallel computing models and an introduction to distributed computing. Various basic problems are discussed, such as matrix multiplication and the 'Graph Reachability' problem, and serial and parallel algorithms are presented and compared. Next, distributed computing models are presented and compared with parallel computing models. The reasons for introducing and studying distributed algorithms are discussed, and reference is made to basic problems in distributed computing, such as the broadcast problem, the leader election problem, the agent rendezvous problem, the network exploration problem, and the problem of discovering hostile nodes in a network.
Type: Chapter
Creation Date: 2015
Item Details:
License: http://creativecommons.org/licenses/by-nc-nd/3.0/gr
Handle http://hdl.handle.net/11419/5770
Bibliographic Reference: Markou, E., Kranakis, E., Pagourtzis, A., & Krizanc, D. (2015). Parallel and distributed computing [Chapter]. In Markou, E., Kranakis, E., Pagourtzis, A., & Krizanc, D. 2015. Algorithmic theory of distributed computing [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/5770
Language: Greek
Is Part of: Algorithmic theory of distributed computing
Publication Origin: Kallipos, Open Academic Editions