Efficient parallel algorithms

This largely self-contained text is an introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelism, that presumes no special knowledge of parallel computers or particular mathematics. The book emphasizes designing algorithms within the timeless and abst...

Disgrifiad llawn

Wedi'i Gadw mewn:
Manylion Llyfryddiaeth
Prif Awdur: Gibbons, Alan
Fformat: Llyfr
Iaith:Undetermined
Cyhoeddwyd: Cambridge Cambridge University Press 1989
Pynciau:
Tagiau: Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
Thư viện lưu trữ: Trung tâm Học liệu Trường Đại học Cần Thơ
LEADER 01480nam a2200193Ia 4500
001 CTU_191457
008 210402s9999 xx 000 0 und d
082 |a 005.1 
082 |b G441 
100 |a Gibbons, Alan 
245 0 |a Efficient parallel algorithms 
245 0 |c Alan Gibbons, Wojciech Rytter 
260 |a Cambridge 
260 |b Cambridge University Press 
260 |c 1989 
520 |a This largely self-contained text is an introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelism, that presumes no special knowledge of parallel computers or particular mathematics. The book emphasizes 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 that concentrates on the essence of algorithmic theory, determining and taking advantage of the inherently parallel nature of certain types of problems. The authors present regularly-used techniques and a range of algorithms including some of the more celebrated ones. Nonspecialists considering entering the field of parallel algorithms, as well as advanced undergraduate or postgraduate students of computer science and mathematics will find this book helpful. 
650 |a Parallel programming (Computer science),Lập trình song song (khoa học máy tính) 
904 |i Qhieu 
980 |a Trung tâm Học liệu Trường Đại học Cần Thơ