Distributed Computing: A Locality-Sensitive Approach
David Peleg
জানু ২০০০ · Discrete Mathematics and Applicationsকিতাপ 5 · SIAM
ইবুক
359
পৃষ্ঠা
family_home
যোগ্য
info
নমুনা
reportমূল্যাংকন আৰু পৰ্যালোচনা সত্যাপন কৰা হোৱা নাই অধিক জানক
এই ইবুকখনৰ বিষয়ে
Presents the locality-sensitive approach to distributed network algorithms-the utilization of locality to simplify control structures and algorithms and reduce their costs. The author begins with an introductory exposition of distributed network algorithms focusing on topics that illustrate the role of locality in distributed algorithmic techniques. He then introduces locality-preserving network representations and describes sequential and distributed techniques for their construction. Finally, the applicability of the locality-sensitive approach is demonstrated through several applications. Gives a thorough exposition of network spanners and other locality-preserving network representations such as sparse covers and partitions. The book is useful for computer scientists interested in distributed computing, electrical engineers interested in network architectures and protocols, and for discrete mathematicians and graph theorists.
শৃংখলা
Computers en technologie
এই ইবুকখনক মূল্যাংকন কৰক
আমাক আপোনাৰ মতামত জনাওক।
পঢ়াৰ নির্দেশাৱলী
স্মাৰ্টফ’ন আৰু টেবলেট
Android আৰু iPad/iPhoneৰ বাবে Google Play Books এপটো ইনষ্টল কৰক। ই স্বয়ংক্রিয়ভাৱে আপোনাৰ একাউণ্টৰ সৈতে ছিংক হয় আৰু আপুনি য'তে নাথাকক ত'তেই কোনো অডিঅ'বুক অনলাইন বা অফলাইনত শুনিবলৈ সুবিধা দিয়ে।