This book brings together current research direction in the mapping of dynamic programming recurrence equations for Knapsack Type problems, which include Unbounded Knapsack Problem, 0/1 Knapsack Problem, Subset Sum Problem, Change Making Problem, onto so-called regular parallel architectures. In particular, it focuses on heuristic and more formal techniques for mapping. The text is based on substantially revised papers published by the authors and their colleagues in the literature but re-written to provide an overall view of the subject area.

Mathematics of Computing -- Parallelism.

This book constitutes the refereed proceedings of the IFIP International Conference on Network and Parallel Computing, NPC 2005, held in Beijing, China in November/December 2005. The 48 revised full papers and 20 revised short papers presented together with 3 invited papers were carefully selected from a total of 320 submissions. The papers are organized in topical sections on grid and system software, grid computing, peer-to-peer computing, web techniques, cluster computing, parallel programming and environment, network architecture, network security, network storage, multimedia service, and ubiquitous computing.

Mathematics of Computing -- Parallelism.

Efficient parallel solutions have been found to many problems. Some of them can be obtained automatically from sequential programs, using compilers. However, there is a large class of problems - irregular problems - that lack efficient solutions. IRREGULAR 94 - a workshop and summer school organized in Geneva - addressed the problems associated with the derivation of efficient solutions to irregular problems. This book, which is based on the workshop, draws on the contributions of outstanding scientists to present the state of the art in irregular problems, covering aspects ranging from scientific computing, discrete optimization, and automatic extraction of parallelism. Audience: This first book on parallel algorithms for irregular problems is of interest to advanced graduate students and researchers in parallel computer science.

This book constitutes the proceedings of the 11th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2014, held in Ilan, Taiwan, in September 2014. The 42 full papers and 24 poster papers presented were carefully reviewed and selected from 196 submissions. They are organized in topical sections on systems, networks, and architectures, parallel and multi-core technologies, virtualization and cloud computing technologies, applications of parallel and distributed computing, and I/O, file systems, and data management.

Algorithms: Sequential, Parallel, and Distributed offers in-depth coverage of traditional and current topics in sequential algorithms, as well as a solid introduction to the theory of parallel and distributed algorithms. In light of the emergence of modern computing environments such as parallel computers, the Internet, and cluster and grid computing, it is important that computer science students be exposed to algorithms that exploit these technologies. Berman and Paul's text will teach students how to create new algorithms or modify existing algorithms, thereby enhancing students' ability to think independently.