|
Showing 1 - 3 of
3 matches in All Departments
"Now what should I do?" This is a question academic leaders ask
themselves with great regularity. As ironic as it may seem, very
few academic leaders have had any formal training in academic
administration, or in any kind of administration at all. For the
most part, academic administrators learn on the job. They also seek
advice wherever they can get it. The purpose of this book is to
offer such advice. The book is written both for academic
administrators at all levels as well as for those who aspire to
academic administration.
"Now what should I do?" This is a question academic leaders ask
themselves with great regularity. As ironic as it may seem, very
few academic leaders have had any formal training in academic
administration, or in any kind of administration at all. For the
most part, academic administrators learn on the job. They also seek
advice wherever they can get it. The purpose of this book is to
offer such advice. The book is written both for academic
administrators at all levels as well as for those who aspire to
academic administration.
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.
|
You may like...
Higher
Michael Buble
CD
(1)
R172
R154
Discovery Miles 1 540
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
|