你好! Shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada A VLSI Architecture for Concurrent Data Structures
Type
Physical Book
Author
Publisher
Language
English
Pages
244
Format
Paperback
Dimensions
23.4x15.6x1.4 cm
Weight
0.38 kg.
ISBN13
9781461291916
Categories

A VLSI Architecture for Concurrent Data Structures

J. W. Dally (Author) · Springer · Paperback

A VLSI Architecture for Concurrent Data Structures - Dally, J. W.

Cheaper New Book Imported to Taiwan
Delivery: 22 Sep - 05 Oct Shipping: 13 to 17 business days.
NT$ 5,078
Faster New Book Imported to Taiwan
Delivery: 10 Sep - 18 Sep Shipping: 5 to 6 business days.
NT$ 6,629
NT$ 5,078

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "A VLSI Architecture for Concurrent Data Structures"

Concurrent data structures simplify the development of concurrent programs by encapsulating commonly used mechanisms for synchronization and commu- nication into data structures. This thesis develops a notation for describing concurrent data structures, presents examples of concurrent data structures, and describes an architecture to support concurrent data structures. Concurrent Smalltalk (CST), a derivative of Smalltalk-80 with extensions for concurrency, is developed to describe concurrent data structures. CST allows the programmer to specify objects that are distributed over the nodes of a concurrent computer. These distributed objects have many constituent objects and thus can process many messages simultaneously. They are the foundation upon which concurrent data structures are built. The balanced cube is a concurrent data structure for ordered sets. The set is distributed by a balanced recursive partition that maps to the subcubes of a binary 7lrcube using a Gray code. A search algorithm, VW search, based on the distance properties of the Gray code, searches a balanced cube in O(log N) time. Because it does not have the root bottleneck that limits all tree-based data structures to 0(1) concurrency, the balanced cube achieves 0C.: N) con- currency. Considering graphs as concurrent data structures, graph algorithms are pre- sented for the shortest path problem, the max-flow problem, and graph parti- tioning. These algorithms introduce new synchronization techniques to achieve better performance than existing algorithms.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews