没有合适的资源?快使用搜索试试~ 我知道了~
首页Distributed Computing Pearls 无水印原版pdf
Distributed Computing Pearls 无水印原版pdf
需积分: 13 155 浏览量
更新于2023-03-16
评论 1
收藏 1.58MB PDF 举报
Distributed Computing Pearls 英文无水印原版pdf pdf所有页面使用FoxitReader、PDF-XChangeViewer、SumatraPDF和Firefox测试都可以打开 本资源转载自网络,如有侵权,请联系上传者或csdn删除 查看此书详细信息请在美国亚马逊官网搜索此书
资源详情
资源评论
资源推荐

Distributed
Computing Pearls
Gadi Taubenfeld
Series Editor: Michel Raynal, University of Rennes, France and Hong Kong Polytechnic University
Distributed Computing Pearls
Gadi Taubenfeld, e Interdisciplinary Center, Herzliya
Computers and computer networks are one of the most incredible inventions of the 20th
century, having an ever-expanding role in our daily lives by enabling complex human
activities in areas such as entertainment, education, and commerce. One of the most
challenging problems in computer science for the 21st century is to improve the design of
distributed systems where computing devices have to work together as a team to achieve
common goals.
In this book, I have tried to gently introduce the general reader to some of the
most fundamental issues and classical results of computer science underlying the design
of algorithms for distributed systems, so that the reader can get a feel of the nature of this
exciting and fascinating eld called distributed computing. e book will appeal to the
educated layperson and requires no computer-related background. I strongly suspect that
also most computer-knowledgeable readers will be able to learn something new.
ABOUT THE AUTHOR
Gadi Taubenfeld is a professor and past dean of the School of Computer Science at the
Interdisciplinary Center in Herzliya, Israel. He is an established authority in the area
of concurrent and distributed computing and has published widely in leading journals
and conferences. He authored the book Synchronization Algorithms and Concurrent
Programming, published by Pearson Education. His primary research interests are in
concurrent and distributed computing. Gadi was the head of the computer science
division at Israel’s Open University; member of technical sta at AT&T Bell Laboratories;
consultant to AT&T Labs-Research; and a research scientist and lecturer at Yale University.
Gadi served as the program committee chair of PODC 2013 and DISC 2008 and holds a
Ph.D. in Computer Science from the Technion-Israel Institute of Technology.
Synthesis Lectures on Distributed Computing Theory
Synthesis Lectures on Distributed Computing Theory
store.morganclaypool.com
TAUBENFELD DISTRIBUTED COMPUTING PEARLS MORGAN & CLAYPOOL PUBLISHERS


Distributed Computing Pearls

Synthesis Lectures on
Distributed Computing eory
Editor
Michel Raynal, University of Rennes, France and Hong Kong Polytechnic University
Synthesis Lectures on Distributed Computing eory is edited by Michel Raynal of the University
of Rennes, France and Nancy Lynch of the Massachusetts Institute of Technology. e series
publishes 50- to 150-page publications on topics pertaining to distributed computing theory. e
scope largely follows the purview of premier information and computer science conferences, such as
ACM PODC, DISC, SPAA, OPODIS, CONCUR, DialM-POMC, ICDCS, SODA, Sirocco,
SSS, and related conferences. Potential topics include, but not are limited to: distributed algorithms
and lower bounds, algorithm design methods, formal modeling and verification of distributed
algorithms, and concurrent data structures.
Distributed Computing Pearls
Gadi Taubenfeld
2018
Decidability of Parameterized Verification
Roderick Bloem, Swen Jacobs, Ayrat Khalimov, Igor Konnov, Sasha Rubin, Helmut Veith, and
Josef Widder
2015
Impossibility Results for Distributed Computing
Hagit Attiya and Faith Ellen
2014
Distributed Graph Coloring: Fundamentals and Recent Developments
Leonid Barenboim and Michael Elkin
2013
Distributed Computing by Oblivious Mobile Robots
Paola Flocchini, Giuseppe Prencipe, and Nicola Santoro
2012
Quorum Systems: With Applications to Storage and Consensus
Marko Vukolić
2012

iii
Link Reversal Algorithms
Jennifer L. Welch and Jennifer E. Walter
2011
Cooperative Task-Oriented Computing: Algorithms and Complexity
Chryssis Georgiou and Alexander A. Shvartsman
2011
New Models for Population Protocols
Othon Michail, Ioannis Chatzigiannakis, and Paul G. Spirakis
2011
e eory of Timed I/O Automata, Second Edition
Dilsun K. Kaynar, Nancy Lynch, Roberto Segala, and Frits Vaandrager
2010
Principles of Transactional Memory
Rachid Guerraoui and Michał Kapałka
2010
Fault-tolerant Agreement in Synchronous Message-passing Systems
Michel Raynal
2010
Communication and Agreement Abstractions for Fault-Tolerant Asynchronous
Distributed Systems
Michel Raynal
2010
e Mobile Agent Rendezvous Problem in the Ring
Evangelos Kranakis, Danny Krizanc, and Euripides Markou
2010
剩余124页未读,继续阅读













安全验证
文档复制为VIP权益,开通VIP直接复制

评论0