This is an introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelisation. It is self-contained and presumes no special knowledge of parallel computers or particular mathematics. The book emphasises designing algorithms within the timeless and abstracted context of a high-level programming language rather than within highly specific computer architectures. This is an approach which concentrates on the essence of algorithmic theory, determining and taking advantage of the inherently parallel nature of certain types of problem. The authors present regularly-used techniques and a range of algorithms which includes some of the more celebrated and well-known. Efficient Parallel Algorithms is targeted at non-specialists who are considering entering the field of parallel algorithms. It will be particularly useful for courses aimed at advanced undergraduate or new postgraduate students of computer science and mathematics.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
This is an introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelisation. It is self-contained and presumes no special knowledge of parallel computers or particular mathematics. The book emphasises designing algorithms within the timeless and abstracted context of a high-level programming language rather than within highly specific computer architectures. This is an approach which concentrates on the essence of algorithmic theory, determining and taking advantage of the inherently parallel nature of certain types of problem. The authors present regularly-used techniques and a range of algorithms which includes some of the more celebrated and well-known. Efficient Parallel Algorithms is targeted at non-specialists who are considering entering the field of parallel algorithms. It will be particularly useful for courses aimed at advanced undergraduate or new postgraduate students of computer science and mathematics.
"...a coherent introduction for all those who wish to enter this new field of research....a valuable contribution to the expository literature and will certainly become a favoured introduction to the field of parallel algorithms." Mathematical Reviews
"Highly recommended." Choice
"...a successful introduction to the area of parallel algorithms and to methods for parallelisation." N. I. Yanev, Mathematical Reviews
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : ThriftBooks-Atlanta, AUSTELL, GA, Etats-Unis
Hardcover. Etat : Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.3. N° de réf. du vendeur G0521345855I4N00
Quantité disponible : 1 disponible(s)
Vendeur : Burwood Books, Wickham Market, Royaume-Uni
Hardback. Etat : Very Good. First Edition. Hardback. No Dustjacket. 8vo. Illustrated laminated boards. Issued without dustjacket. Diagrams. ISBN: 0521345855 Pages: 267 Covers very slightly bumped otherwise VG+. N° de réf. du vendeur A78555
Quantité disponible : 1 disponible(s)
Vendeur : Rob the Book Man, Vancouver, WA, Etats-Unis
Hardcover. Etat : Near Fine. Hardcover in near fine condition. N° de réf. du vendeur 23207
Quantité disponible : 1 disponible(s)
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
Hardcover. Etat : Very Good. Very Good. book. N° de réf. du vendeur ERICA82905213458554
Quantité disponible : 1 disponible(s)