A VLSI Architecture for Concurrent Data Structures (The Springer International Series in Engineering and Computer Science, 27),New

A VLSI Architecture for Concurrent Data Structures (The Springer International Series in Engineering and Computer Science, 27),New

SKU: DADAX0898382351 In Stock
Sale price$173.95 Regular price$248.50
Save $74.55
Quantity
Add to wishlist
Add to compare
Shipping & Tax will be calculated at Checkout.
Delivery time: 3-5 business days (USA)
Delivery time: 8-12 business days (International)
15 days return policy
Payment Options

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

Customer Reviews

Be the first to write a review
0%
(0)
0%
(0)
0%
(0)
0%
(0)
0%
(0)

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 Smalltalk80 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 treebased 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 maxflow problem, and graph parti tioning. These algorithms introduce new synchronization techniques to achieve better performance than existing algorithms.

Shipping & Returns

Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.

Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.

Shipping & Returns

Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.

Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.

Warranty

We provide a 2-year limited warranty, from the date of purchase for all our products.

If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.

This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).

Warranty

We provide a 2-year limited warranty, from the date of purchase for all our products.

If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.

This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).

Secure Payment

Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.

We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.

Secure Payment

Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.

We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.

Related Products

You may also like