OPAC

検索結果一覧に戻る

Dissemination of Information in Communication Networks : Broadcasting, Gossiping, Leader Election, and Fault-Tolerance / by Juraj Hromkovič, Ralf Klasing, A. Pelc, Peter Ruzicka, Walter Unger
(Texts in Theoretical Computer Science. An EATCS Series. ISSN:18624502)

データ種別	電子ブック
版	1st ed. 2005.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	2005
大きさ	XIV, 364 p. 73 illus : online resource
著者標目	*Hromkovič, Juraj author Klasing, Ralf author Pelc, A author Ruzicka, Peter author Unger, Walter author SpringerLink (Online service)

所蔵情報を非表示

URL	巻　次	配架場所	請求記号	登録番号	コメント	刷　年	状　態	利用注記	ISBN	予約	請求メモ
URL		射水-電子	007	EB0003415	Computer Scinece R0 2005-6,2022-3				9783540266631

書誌詳細を非表示

一般注記	The Telegraph and Telephone Modes -- Fundamentals -- Broadcasting -- Gossiping -- Systolic Communication -- Fault-Tolerance -- Distributed Networks -- Broadcast on Distributed Networks -- Leader Election in Asynchronous Distributed Networks -- Fault-Tolerant Broadcast in Distributed Networks Preface Due to the development of hardware technologies (such as VLSI) in the early 1980s, the interest in parallel and distributive computing has been rapidly growingandinthelate1980sthestudyofparallelalgorithmsandarchitectures became one of the main topics in computer science. To bring the topic to educatorsandstudents,severalbooksonparallelcomputingwerewritten. The involvedtextbook“IntroductiontoParallelAlgorithmsandArchitectures”by F. Thomson Leighton in 1992 was one of the milestones in the development of parallel architectures and parallel algorithms. But in the last decade or so the main interest in parallel and distributive computing moved from the design of parallel algorithms and expensive parallel computers to the new distributive reality – the world of interconnected computers that cooperate (often asynchronously) in order to solve di?erent tasks. Communication became one of the most frequently used terms of computer science because of the following reasons: (i) Considering the high performance of current computers, the communi- tion is often moretime consuming than the computing time of processors. As a result, the capacity of communication channels is the bottleneck in the execution of many distributive algorithms. (ii) Many tasks in the Internet are pure communication tasks. We do not want to compute anything, we only want to execute some information - change or to extract some information as soon as possible and as cheaply as possible. Also, we do not have a central database involving all basic knowledge. Instead, wehavea distributed memorywherethe basickno- edgeisdistributedamongthelocalmemoriesofalargenumberofdi?erent computers. The growing importance of solving pure communication tasks in the - terconnected world is the main motivation for writing this book HTTP:URL=https://doi.org/10.1007/b137871
件　名	LCSH:Computer networks LCSH:Computer science LCSH:Algorithms LCSH:Computer science -- Mathematics 全ての件名で検索 LCSH:Mathematical statistics FREE:Computer Communication Networks FREE:Theory of Computation FREE:Algorithms FREE:Mathematics of Computing FREE:Probability and Statistics in Computer Science
分　類	LCC:TK5105.5-5105.9 DC23:004.6
書誌ID	EB00002803
ISBN	9783540266631