Algorithm Engineering / Nejlevnější knihy
Algorithm Engineering

Kód: 05275002

Algorithm Engineering

Autor Jeffrey S. Vitter, Christos D. Zaroliagis

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 computa ... celý popis

1182


Skladem u dodavatele
Odesíláme za 5-8 dnů
Přidat mezi přání

Mohlo by se vám také líbit

Darujte tuto knihu ještě dnes
  1. Objednejte knihu a zvolte Zaslat jako dárek.
  2. Obratem obdržíte darovací poukaz na knihu, který můžete ihned předat obdarovanému.
  3. Knihu zašleme na adresu obdarovaného, o nic se nestaráte.

Více informací

Více informací o knize Algorithm Engineering

Nákupem získáte 118 bodů

Anotace knihy

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.

Parametry knihy

Zařazení knihy Knihy v angličtině Computing & information technology Computer networking & communications

1182



Osobní odběr Praha, Brno a 47405 dalších

Copyright ©2008-26 nejlevnejsi-knihy.cz Všechna práva vyhrazenaSoukromíCookies


Můj účet: Přihlásit se
Všechny knihy světa na jednom místě. Navíc za skvělé ceny.

Nákupní košík ( prázdný )

Vyzvednutí v Balikovně a PPL
boxech
zdarma nad 1 499 Kč.

Nacházíte se: