Isbn: 9780262100366 - the characteristics of parallel algorithms (6 risultati)

Hardcover. Condizione: Very Good. Hardcover in very good condition. Stamp on front end page.

Condizione: Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Hardcover. Condizione: Near Fine. hardback book in near fine condition.

hardcover. Condizione: Very Good. No Dust Jacket. First Edition. Paperboard cover has notiseable edge wear. Bottom of page block is a bit grubby. Pages are clean and bright throughout. Illustrated with numerous graphs and diagrams. Used.

hardcover. Condizione: Good. No Dust Jacket. binding has some surface wear and a little wear to edges and corners, though is otherwise well preserved. pages are clean and crisp and printing is tight clean and bright throughout. sticker from previous retailer on rear cover. Used.

Printed Magenta Boards. Condizione: Very Good. No Jacket. Second Printing, 1988. This is a volume in the publisher's SERIES IN SCIENTIFIC COMPUTATION. There are 3 sections, I, General Characteristics of Parallel Computation Models; II, Application Domain Characterizations of Parallelism; and III, Software Tools. The chapter headings in Section I are; Programming Paradigms for Nonshared Memory Parallel Computers; LargeGrain Parallelism - Three Case Studies; Characterizing Parallel Algorithms; Measuring Communications Structures in Parallel Architectures and Algorithms; and Hierarchy in Sequential and Concurrent Systems - or - What's in a Reply? Those in Part II are: Computer Architectures for Speech Recognition; Issues on Parallel Algorithms for Image Processing; Parallel Methods for Partial Differential Equations; Parallel Algorithms for Matrix Computations; Programming with BLAS; and The Influence of Memory Hierarchy on Algorithm Organization: Programming FFTs on a Vector Multiprocessor. Those for Section III are: Experience with an Automatic Solution to the Mapping Problem; Design and Implementation of Parallel Programs with Large-Grain Data Flow; A Minimalist Approach to Portable, Parallel Programming; SCHEDULE: Tools for Developing and Analyzing Parallel Fortran Programs; and The Force. Sixteen chapters, 440 pages, with figures, and Index; plus six unnumbered pages, Contents, and Preface; References at the end of each paper. Covers show scant shelf-use at edges and backstrap, otherwise clean and sound; text is clean and strong. …