Enter your search into one or more of the boxes below:
You can refine your search by selecting from any of the options below:
Algorithm Engineering: 3rd International Workshop, WAE'99 London, UK, July 19-21, 1999 Proceedings
Foyalty 206

Algorithm Engineering: 3rd International Workshop, WAE'99 London, UK, July 19-21, 1999 Proceedings (Paperback)

Printed to order. Despatched in 2-3 weeks.
Email me when back in stock


This work considers practical parallel list-ranking algorithms. The model for which programs are written is a single-program multiple-data (SPMD) \bri- ingmodel". Thismodel isdesignated asa programmer'smodelfora ne-grained computation framework called Explicit Multi-Threading (XMT), which was - troduced in [VDBN98]; the XMT framework covers the spectrum from al- rithms through architecture to implementation; it is meant to provide a pl- form for faster single-task completion time by way of instruction-level par- lelism (ILP). The performance of XMT programs is evaluated as follow: the performance of a matching optimized XMT assembly code is measured within an XMT execution model. (We use in the current paper the so-called Spawn- MT programmingmodel - the easier to implement amongthe two programming modelspresented in[VDBN98]). The XMT approach deviatesfromthe standard PRAM approach by incorporating reduced synchrony and departing from the lock-step structure in its so-called asynchronous mode. Our envisioned platform uses an extension to a standard serial instruction set.

This extension e ciently implements PRAM-style algorithms using explicit multi-threaded ILP, which allows considerably more n e-grained parallelism than the previously studied parallel computing implementation platforms/models. The list ranking problem was the rst problem considered as we examined and re ned many of the concepts in the XMT framework. The problem arises in parallel algorithmson lists, trees and graphs and is considered a fundamental problemin the theory of parallelalgorithms. Experimental results are presented.

Computing & ITComputer networking & communicationsComputing & ITComputer programming / software developmentAlgorithms & data structures Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Publication Date: 18/08/1999 ISBN-13: 9783540664277  Details: Type: Paperback Format: Books
Availability: Printed to order. Despatched in 2-3 weeks.  

More books by Jeffrey Scott Vitter

More books by Christos D. Zaroliagis

Leave Review


Delivery Options

All delivery times quoted are the average, and cannot be guaranteed. These should be added to the availability message time, to determine when the goods will arrive. During checkout we will give you a cumulative estimated date for delivery.

Location 1st Book Each additional book Average Delivery Time
UK Standard Delivery FREE FREE 3-5 Days
UK First Class £4.50 £1.00 1-2 Days
UK Courier £7.00 £1.00 1-2 Days
Western Europe** Courier £17.00 £3.00 2-3 Days
Western Europe** Airmail £5.00 £1.50 4-14 Days
USA / Canada Courier £20.00 £3.00 2-4 Days
USA / Canada Airmail £7.00 £3.00 4-14 Days
Rest of World Courier £22.50 £3.00 3-6 Days
Rest of World Airmail £8.00 £3.00 7-21 Days

** Includes Austria, Belgium, Denmark, France, Germany, Greece, Iceland, Irish Republic, Italy, Luxembourg, Netherlands, Portugal, Spain, Sweden and Switzerland.

Click and Collect is available for all our shops; collection times will vary depending on availability of items. Individual despatch times for each item will be given at checkout.

Special delivery items

A Year of Books Subscription Packages 

Delivery is free for the UK. Western Europe costs £60 for each 12 month subscription package purchased. For the Rest of the World the cost is £100 for each package purchased. All delivery costs are charged in advance at time of purchase. For more information please visit the A Year of Books page.

Animator's Survival Kit

For delivery charges for the Animator's Survival Kit please click here.


Delivery Help & FAQs

Returns Information

If you are not completely satisfied with your purchase*, you may return it to us in its original condition with in 30 days of receiving your delivery or collection notification email for a refund. Except for damaged items or delivery issues the cost of return postage is borne by the buyer. Your statutory rights are not affected.

* For Exclusions and terms on damaged or delivery issues see Returns Help & FAQs

You might also like

Lectures on Convex Optimization
Yurii Nesterov
The GETMe Mesh Smoothing Framework: A...
Dimitris P. Vartziotis; Joachim Wipper
Algorithm Design Practice for...
Yonghui Wu; Jiande Wang
The Mathematics of Chip-Firing
Caroline J. Klivans
© W&G Foyle Ltd
Foyles uses cookies to help ensure your experience on our site is the best possible. Click here if you’d like to find out more about the types of cookies we use.
Accept and Close