000 01627 a2200229 4500
008 140323b2009 xxu||||| |||| 00| 0 eng d
020 _a9781584889458
082 _a005.275
100 _aCasanova, Henri
_958362
245 _aParallel algorithms
_cCasanova, Henri
260 _aBoca Raton
_bCRC Press
_c2009
300 _axv, 337 p. :
365 _bUKP 39.99
440 _aChapman and Hall/CRC numerical analysis and scientific computi
_958363
520 _aPlacing an emphasis on practical implementation, Parallel Algorithms presents a rigorous yet accessible treatment of theoretical models of parallel computation, parallel algorithm design, and complexity and performance analysis. This comprehensive text focuses on algorithms for distributed-memory parallel architectures in which computing elements communicate by exchanging messages. It also addresses scheduling topics and approaches such as the definition of new metrics of performance, online scheduling problems, and multi-criteria scheduling. Each chapter presents numerous examples along with a set of practice exercises, making it a valuable resource for students. Source: www.barnesand noble.com
650 _aParallel algorithm Parallel programming (Computer science)
_958364
700 _aLegrand, Arnaud
_958365
700 _aRobert, Yves
_958366
942 _cBK
952 _p166850
_C22/12/2008
_L0.00
_BUKP
_DHimanshu Book Co.
_G97977
_K20.00%
_A39.99
_J3167.20
_H11/12/2008
_F11/12/2008
_E280668
_IApproval
_MProf. Venkata Rao V
_v3167.20
_40
_00
_bVSL
_10
_o005.275 C2P2
_d22/12/2008
_70
_yBK
_aVSL
999 _c161471
_d161471