MARC보기
LDR03485cmm uu200565Ki 4500
001000000305365
00520230525100523
006m o d
007cr cnu---unuuu
008131217s2013 mau ob 001 0 eng d
020 ▼a 9780262318945 (electronic bk.)
020 ▼a 0262318946 (electronic bk.)
020 ▼z 9780262026772
020 ▼z 0262026775
035 ▼a (OCoLC)865508692
040 ▼a N$T ▼b eng ▼e rda ▼e pn ▼c N$T ▼d YDXCP ▼d B24X7 ▼d STF ▼d 248032
049 ▼a K4RA
050 4 ▼a QA76.58 ▼b .F647 2013eb
072 7 ▼a COM ▼x 013000 ▼2 bisacsh
072 7 ▼a COM ▼x 014000 ▼2 bisacsh
072 7 ▼a COM ▼x 018000 ▼2 bisacsh
072 7 ▼a COM ▼x 067000 ▼2 bisacsh
072 7 ▼a COM ▼x 032000 ▼2 bisacsh
072 7 ▼a COM ▼x 037000 ▼2 bisacsh
072 7 ▼a COM ▼x 052000 ▼2 bisacsh
08204 ▼a 004/.36 ▼2 23
1001 ▼a Fokkink, Wan, ▼d 1965-
24510 ▼a Distributed algorithms : ▼b an intuitive approach / ▼c Wan Fokkink.
264 1 ▼a Cambridge, Massachusetts : ▼b The MIT Press, ▼c [2013]
300 ▼a 1 online resource.
336 ▼a text ▼b txt ▼2 rdacontent
337 ▼a computer ▼b c ▼2 rdamedia
338 ▼a online resource ▼b cr ▼2 rdacarrier
504 ▼a Includes bibliographical references and index.
520 ▼a "This book offers students and researchers a guide to distributed algorithms that emphasizes examples and exercises rather than the intricacies of mathematical models. It avoids mathematical argumentation, often a stumbling block for students, teaching algorithmic thought rather than proofs and logic. This approach allows the student to learn a large number of algorithms within a relatively short span of time. Algorithms are explained through brief, informal descriptions, illuminating examples, and practical exercises. The examples and exercises allow readers to understand algorithms intuitively and from different perspectives. Proof sketches, arguing the correctness of an algorithm or explaining the idea behind fundamental results, are also included. An appendix offers pseudocode descriptions of many algorithms. Distributed algorithms are performed by a collection of computers that send messages to each other or by multiple software threads that use the same shared memory. The algorithms presented in the book are for the most part "classics, " selected because they shed light on the algorithmic design of distributed systems or on key issues in distributed computing and concurrent programming. Distributed Algorithms be used in courses for upper-level undergraduates or graduate students in computer science, or as a reference for researchers in the field."
588 ▼a Description based on print version record.
650 0 ▼a Distributed algorithms ▼v Textbooks.
650 7 ▼a COMPUTERS / Computer Literacy. ▼2 bisacsh
650 7 ▼a COMPUTERS / Computer Science. ▼2 bisacsh
650 7 ▼a COMPUTERS / Data Processing. ▼2 bisacsh
650 7 ▼a COMPUTERS / Hardware / General. ▼2 bisacsh
650 7 ▼a COMPUTERS / Information Technology. ▼2 bisacsh
650 7 ▼a COMPUTERS / Machine Theory. ▼2 bisacsh
650 7 ▼a COMPUTERS / Reference. ▼2 bisacsh
655 4 ▼a Electronic books.
77608 ▼i Print version: ▼a Fokkink, Wan, 1965- ▼t Distributed algorithms ▼z 9780262026772 ▼w (DLC) 2013015173 ▼w (OCoLC)847246070
85640 ▼3 EBSCOhost ▼u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=675786
938 ▼a EBSCOhost ▼b EBSC ▼n 675786
938 ▼a YBP Library Services ▼b YANK ▼n 11437209
938 ▼a Books 24x7 ▼b B247 ▼n bks00065225
990 ▼a 관리자