Office of Academic Resources
Chulalongkorn University
Chulalongkorn University

Home / Help

TitleModels for Parallel and Distributed Computation [electronic resource] : Theory, Algorithmic Techniques and Applications / edited by Ricardo Corrรชa, Inรชs Dutra, Mario Fiallos, Fernando Gomes
ImprintBoston, MA : Springer US : Imprint: Springer, 2002
Connect tohttp://dx.doi.org/10.1007/978-1-4757-3609-0
Descript XX, 323 p. online resource

SUMMARY

Parallel and distributed computation has been gaining a great lot of attention in the last decades. During this period, the advances attained in computing and communication technologies, and the reduction in the costs of those technoloยญ gies, played a central role in the rapid growth of the interest in the use of parallel and distributed computation in a number of areas of engineering and sciences. Many actual applications have been successfully implemented in various platยญ forms varying from pure shared-memory to totally distributed models, passing through hybrid approaches such as distributed-shared memory architectures. Parallel and distributed computation differs from dassical sequential compuยญ tation in some of the following major aspects: the number of processing units, independent local dock for each unit, the number of memory units, and the programming model. For representing this diversity, and depending on what level we are looking at the problem, researchers have proposed some models to abstract the main characteristics or parameters (physical components or logical mechanisms) of parallel computers. The problem of establishing a suitable model is to find a reasonable trade-off among simplicity, power of expression and universality. Then, be able to study and analyze more precisely the behavior of parallel applications


CONTENT

1 Introduction to the Complexity of Parallel Algorithms -- 2 The Combinatorics of Resource Sharing -- 3 On Solving the Static Task Scheduling Problem for Real Machines -- 4 Predictable Parallel Performance: The BSP Model -- 5 Discrete computing with CGM -- 6 Parallel Graph Algorithms for Coarse-Grained Multicomputers -- 7 Parallel metaheuristics for combinatorial optimization -- 8 Parallelism in Logic Programming and Scheduling Issues -- 9 Parallel Asynchronous Team Algorithms -- 10 Parallel Numerical Methods for Differential Equations


Computer science Architecture Computer Computers Computer science -- Mathematics Combinatorics Computer Science Computer System Implementation Theory of Computation Discrete Mathematics in Computer Science Combinatorics Symbolic and Algebraic Manipulation



Location



Office of Academic Resources, Chulalongkorn University, Phayathai Rd. Pathumwan Bangkok 10330 Thailand

Contact Us

Tel. 0-2218-2929,
0-2218-2927 (Library Service)
0-2218-2903 (Administrative Division)
Fax. 0-2215-3617, 0-2218-2907

Social Network

  line

facebook   instragram