pickabook books with huge discounts for everyone
pickabook books with huge discounts for everyone
Visit our new collection website www.collectionsforschool.co.uk
     
Email: Subscribe to news & offers:
Need assistance? Log In/Register


Item Details
Title: COOPERATIVE TASK-ORIENTED COMPUTING
ALGORITHMS AND COMPLEXITY
By: Alexander A. Shvartsman, Chryssis Georgiou, Nancy A. Lynch
Format: Paperback

List price: £40.95


We believe that this item is permanently unavailable, and so we cannot source it.

ISBN 10: 1608452875
ISBN 13: 9781608452873
Publisher: MORGAN & CLAYPOOL PUBLISHERS
Pub. date: 1 February, 2010
Series: Synthesis Lectures on Distributed Computing Theory
Pages: 167
Description: Presents cooperative computing with the focus on modelling distributed computing settings, algorithmic techniques enabling one to combine efficiency and fault-tolerance in distributed systems, and the exposition of trade-offs between efficiency and fault-tolerance for robust cooperative computing.
Synopsis: Cooperative network supercomputing is becoming increasingly popular for harnessing the power of the global Internet computing platform. A typical Internet supercomputer consists of a master computer or server and a large number of computers called workers, performing computation on behalf of the master. Despite the simplicity and benefits of a single master approach, as the scale of such computing environments grows, it becomes unrealistic to assume the existence of the infallible master that is able to coordinate the activities of multitudes of workers. Large-scale distributed systems are inherently dynamic and are subject to perturbations, such as failures of computers and network links, thus it is also necessary to consider fully distributed peer-to-peer solutions. We present a study of cooperative computing with the focus on modeling distributed computing settings, algorithmic techniques enabling one to combine efficiency and fault-tolerance in distributed systems, and the exposition of trade-offs between efficiency and fault-tolerance for robust cooperative computing.The focus of the exposition is on the abstract problem, called Do-All, and formulated in terms of a system of cooperating processors that together need to perform a collection of tasks in the presence of adversity. Our presentation deals with models, algorithmic techniques, and analysis. Our goal is to present the most interesting approaches to algorithm design and analysis leading to many fundamental results in cooperative distributed computing. The algorithms selected for inclusion are among the most efficient that additionally serve as good pedagogical examples. Each chapter concludes with exercises and bibliographic notes that include a wealth of references to related work and relevant advanced results.
Illustrations: black & white illustrations
Publication: US
Imprint: Morgan & Claypool Publishers
Returns: Returnable
Some other items by this author:
ALGORITHMIC FOUNDATIONS OF COMMUNICATION IN RADIO NETWORKS (PB)
ATOMIC TRANSACTIONS (HB)
ATOMIC TRANSACTIONS: IN CONCURRENT AND DISTRIBUTED SYSTEMS
COMMUNICATION AND AGREEMENT ABSTRACTIONS FOR FAULT-TOLERANT ASYNCHRONOUS DISTRIBUTED SYSTEMS (PB)
COOPERATIVE TASK-ORIENTED COMPUTING
COOPERATIVE TASK-ORIENTED COMPUTING
DISTRIBUTED ALGORITHMS (HB)
DISTRIBUTED ALGORITHMS (PB)
DISTRIBUTED COMPUTING (PB)
DISTRIBUTED STORAGE
DISTRIBUTED STORAGE (PB)
DO-ALL COMPUTING IN DISTRIBUTED SYSTEMS (HB)
DO-ALL COMPUTING IN DISTRIBUTED SYSTEMS (PB)
FAULT-TOLERANT AGREEMENT IN SYNCHRONOUS MESSAGE-PASSING SYSTEMS (PB)
HYBRID SYSTEMS, COMPUTATION AND CONTROL (PB)
K-SET CONSENSUS AND THE CONSENSUS HIERARCHY (PB)
KNOWLEDGE IN DISTRIBUTED SYSTEMS (PB)
LINK REVERSAL ALGORITHMS (PB)
LOWER BOUNDS FOR DISTRIBUTED COMPUTING (PB)
PRINCIPLES OF DISTRIBUTED SYSTEMS (PB)
PRINCIPLES OF TRANSACTIONAL MEMORY (PB)
RANDOMIZED SMOOTHING NETWORKS (PB)
REDUCTIONS AND SIMULATIONS IN DISTRIBUTED COMPUTING (PB)
STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY (PB)
STUDY GUIDE AND POWER NOTES (PB)
STUDY GUIDE AND POWERNOTES FOR FINANCIAL ACCOUNTING (PB)
THE THEORY OF TIMED I/O AUTOMATA
THE THEORY OF TIMED I/O AUTOMATA (PB)
THE THEORY OF TIMED I/O AUTOMATA (PB)

TOP SELLERS IN THIS CATEGORY
OCR AS and A Level Computer Science (Paperback)
PG Online Limited
Our Price : £32.30
more details
BTEC First in I&CT Revision Workbook (Paperback)
By:
Pearson Education Limited
Our Price : £5.54
more details
The Most Human Human (Paperback)
Penguin Books Ltd
Our Price : £8.02
more details
Algorithms to Live By (Paperback)
HarperCollins Publishers
Our Price : £8.02
more details
Types and Programming Languages (Hardback)
MIT Press Ltd
Our Price : £68.00
more details
BROWSE FOR BOOKS IN RELATED CATEGORIES
 COMPUTING AND INFORMATION TECHNOLOGY
 general theory of computing


Information provided by www.pickabook.co.uk
SHOPPING BASKET
  
Your basket is empty
  Total Items: 0
 






Early Learning
Little Worried Caterpillar (PB) Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
add to basket

Early Learning
add to basket

Picture Book
All the Things We Carry PB What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
add to basket