LEADER 00908nam a22002411i 4500 001 991002901489707536 005 20040611162432.0 008 040624s1977 uika||||||||||||||||eng 035 $ab1299540x-39ule_inst 035 $aARCHE-095308$9ExL 040 $aDip.to Beni Culturali$bita$cA.t.i. Arché s.c.r.l. Pandora Sicilia s.r.l. 082 04$a930.1 100 1 $aBarker, Philip$0390999 245 10$aTechniques of archaeological excavation /$cPhilip Barker 260 $aLondon :$bB.T. Batsford,$c1977 300 $a279 p. :$bill. ;$c25 cm 650 4$aScavi archeologici 907 $a.b1299540x$b02-04-14$c12-07-04 912 $a991002901489707536 945 $aLE001 AR I 1 8$g1$i2001000097791$lle001$nC. 1$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i13602421$z12-07-04 996 $aTechniques of archaeological excavation$9283592 997 $aUNISALENTO 998 $ale001$b12-07-04$cm$da $e-$feng$guik$h0$i1 LEADER 05426nam 22006974a 450 001 9911020155803321 005 20200520144314.0 010 $a9786610721542 010 $a9781280721540 010 $a1280721545 010 $a9780470072646 010 $a0470072644 010 $a9780470072639 010 $a0470072636 035 $a(CKB)1000000000355168 035 $a(EBL)281835 035 $a(OCoLC)123905009 035 $a(SSID)ssj0000137130 035 $a(PQKBManifestationID)11143565 035 $a(PQKBTitleCode)TC0000137130 035 $a(PQKBWorkID)10088421 035 $a(PQKB)11632676 035 $a(MiAaPQ)EBC281835 035 $a(PPN)18506051X 035 $a(Perlego)2757395 035 $a(EXLCZ)991000000000355168 100 $a20060403d2007 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aDesign and analysis of distributed algorithms /$fNicola Santoro 210 $aHoboken, N.J. $cWiley-Interscience$dc2007 215 $a1 online resource (610 p.) 225 1 $aWiley series on parallel and distributed computing 300 $aDescription based upon print version of record. 311 08$a9780471719977 311 08$a0471719978 320 $aIncludes bibliographical references and indexes. 327 $aDESIGN AND ANALYSIS OF DISTRIBUTED ALGORITHMS; CONTENTS; Preface; 1 Distributed Computing Environments; 1.1 Entities; 1.2 Communication; 1.3 Axioms and Restrictions; 1.3.1 Axioms; 1.3.2 Restrictions; 1.4 Cost and Complexity; 1.4.1 Amount of Communication Activities; 1.4.2 Time; 1.5 An Example: Broadcasting; 1.6 States and Events; 1.6.1 Time and Events; 1.6.2 States and Configurations; 1.7 Problems and Solutions (*); 1.8 Knowledge; 1.8.1 Levels of Knowledge; 1.8.2 Types of Knowledge; 1.9 Technical Considerations; 1.9.1 Messages; 1.9.2 Protocol; 1.9.3 Communication Mechanism 327 $a1.10 Summary of Definitions1.11 Bibliographical Notes; 1.12 Exercises, Problems, and Answers; 1.12.1 Exercises and Problems; 1.12.2 Answers to Exercises; 2 Basic Problems And Protocols; 2.1 Broadcast; 2.1.1 The Problem; 2.1.2 Cost of Broadcasting; 2.1.3 Broadcasting in Special Networks; 2.2 Wake-Up; 2.2.1 Generic Wake-Up; 2.2.2 Wake-Up in Special Networks; 2.3 Traversal; 2.3.1 Depth-First Traversal; 2.3.2 Hacking (*); 2.3.3 Traversal in Special Networks; 2.3.4 Considerations on Traversal; 2.4 Practical Implications: Use a Subnet; 2.5 Constructing a Spanning Tree 327 $a2.5.1 SPT Construction with a Single Initiator: Shout2.5.2 Other SPT Constructions with Single Initiator; 2.5.3 Considerations on the Constructed Tree; 2.5.4 Application: Better Traversal; 2.5.5 Spanning-Tree Construction with Multiple Initiators; 2.5.6 Impossibility Result; 2.5.7 SPT with Initial Distinct Values; 2.6 Computations in Trees; 2.6.1 Saturation: A Basic Technique; 2.6.2 Minimum Finding; 2.6.3 Distributed Function Evaluation; 2.6.4 Finding Eccentricities; 2.6.5 Center Finding; 2.6.6 Other Computations; 2.6.7 Computing in Rooted Trees; 2.7 Summary; 2.7.1 Summary of Problems 327 $a2.7.2 Summary of Techniques2.8 Bibliographical Notes; 2.9 Exercises, Problems, and Answers; 2.9.1 Exercises; 2.9.2 Problems; 2.9.3 Answers to Exercises; 3 Election; 3.1 Introduction; 3.1.1 Impossibility Result; 3.1.2 Additional Restrictions; 3.1.3 Solution Strategies; 3.2 Election in Trees; 3.3 Election in Rings; 3.3.1 All the Way; 3.3.2 As Far As It Can; 3.3.3 Controlled Distance; 3.3.4 Electoral Stages; 3.3.5 Stages with Feedback; 3.3.6 Alternating Steps; 3.3.7 Unidirectional Protocols; 3.3.8 Limits to Improvements (*); 3.3.9 Summary and Lessons; 3.4 Election in Mesh Networks; 3.4.1 Meshes 327 $a3.4.2 Tori3.5 Election in Cube Networks; 3.5.1 Oriented Hypercubes; 3.5.2 Unoriented Hypercubes; 3.6 Election in Complete Networks; 3.6.1 Stages and Territory; 3.6.2 Surprising Limitation; 3.6.3 Harvesting the Communication Power; 3.7 Election in Chordal Rings (*); 3.7.1 Chordal Rings; 3.7.2 Lower Bounds; 3.8 Universal Election Protocols; 3.8.1 Mega-Merger; 3.8.2 Analysis of Mega-Merger; 3.8.3 YO-YO; 3.8.4 Lower Bounds and Equivalences; 3.9 Bibliographical Notes; 3.10 Exercises, Problems, and Answers; 3.10.1 Exercises; 3.10.2 Problems; 3.10.3 Answers to Exercises 327 $a4 Message Routing and Shortest Paths 330 $aThis text is based on a simple and fully reactive computational model that allows for intuitive comprehension and logical designs. The principles and techniques presented can be applied to any distributed computing environment (e.g., distributed systems, communication networks, data networks, grid networks, internet, etc.). The text provides a wealth of unique material for learning how to design algorithms and protocols perform tasks efficiently in a distributed computing environment. 410 0$aWiley series on parallel and distributed computing. 606 $aElectronic data processing$xDistributed processing 606 $aComputer algorithms 615 0$aElectronic data processing$xDistributed processing. 615 0$aComputer algorithms. 676 $a005.1 700 $aSantoro$b N$g(Nicola),$f1951-$0968033 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9911020155803321 996 $aDesign and analysis of distributed algorithms$92198548 997 $aUNINA