Search results for "Java Concurrency and Parallelism"
Items we need to order for you
R 580.00
Concurrent and Distributed Computing in Java
An in-depth introduction to concurrent and distributed computing with Java Combining the two key types of Java programming, Concurrent and Distributed Computing in Java offers both professionals and students a comprehensive guide to fundamental concepts necessary for mastering Java programming. The text is presented in two parts. The first deals with techniques for programming in shared-memory based systems and covers concepts in Java such as: Threads Synchronized methods Waits and notify Multi-threaded programming Algorithms for mutual exclusion, consensus, atomic objects, and wait-free data structures The second half of the text deals with programming in a message-passing system, and covers: Resource allocation problems Logical clocks Global property detection Leader election Message ordering Agreement algorithms Checkpointing Message logging Avoiding excessive mathematical notation while explaining important concepts with both rigor and clarity, this up-to-date text will prove a valuable resource for interested professionals and students alike.
R 5,762.00
R 1,238.00
R 306.00
R 489.00
Applied Parallel Computing. New Paradigms for HPC in Industry and Academia
The papers in this volume were presented at PARA 2000, the Fifth International Workshop on Applied Parallel Computing. PARA 2000 was held in Bergen, Norway, June 18-21, 2000. The workshop was organized by Parallab and the Department of Informatics at the University of Bergen. The general theme for PARA 2000 was New paradigms for HPC in industry and academia focusing on: { High-performance computing applications in academia and industry, { The use of Java in high-performance computing, { Grid and Meta computing, { Directions in high-performance computing and networking, { Education in Computational Science. The workshop included 9 invited presentations and 39 contributed pres- tations. The PARA 2000 meeting began with a one-day tutorial on OpenMP programming led by Timothy Mattson. This was followed by a three-day wor- hop. The rst three PARA workshops were held at the Technical University of Denmark (DTU), Lyngby (1994, 1995, and 1996). Following PARA’96, an - ternational steering committee for the PARA meetings was appointed and the committee decided that a workshop should take place every second year in one of the Nordic countries. The 1998 workshop was held at Ume a University, Sweden. One important aim of these workshops is to strengthen the ties between HPC centers, academia, and industry in the Nordic countries as well as worldwide. The University of Bergen organized the 2000 workshop and the next workshop in the year 2002 will take place at the Helsinki University of Technology, Espoo, Finland.
R 2,015.00
Concurrent Programming: Algorithms, Principles, and Foundations
This book is devoted to the most difficult part of concurrent programming, namely synchronization concepts, techniques and principles when the cooperating entities are asynchronous, communicate through a shared memory, and may experience failures. Synchronization is no longer a set of tricks but, due to research results in recent decades, it relies today on sane scientific foundations as explained in this book.In this book the author explains synchronization and the implementation of concurrent objects, presenting in a uniform and comprehensive way the major theoretical and practical results of the past 30 years. Among the key features of the book are a new look at lock-based synchronization (mutual exclusion, semaphores, monitors, path expressions); an introduction to the atomicity consistency criterion and its properties and a specific chapter on transactional memory; an introduction to mutex-freedom and associated progress conditions such as obstruction-freedom and wait-freedom; a presentation of Lamport's hierarchy of safe, regular and atomic registers and associated wait-free constructions; a description of numerous wait-free constructions of concurrent objects (queues, stacks, weak counters, snapshot objects, renaming objects, etc.); a presentation of the computability power of concurrent objects including the notions of universal construction, consensus number and the associated Herlihy's hierarchy; and a survey of failure detector-based constructions of consensus objects. The book is suitable for advanced undergraduate students and graduate students in computer science or computer engineering, graduate students in mathematics interested in the foundations of process synchronization, and practitioners and engineers who need to produce correct concurrent software. The reader should have a basic knowledge of algorithms and operating systems.
R 3,784.27
Core Java for the Impatient
Clear, Concise Guide to the Core Language and Libraries--Updated through Java 17 Modern Java introduces major enhancements that impact the core Java technologies and APIs at the heart of the Java platform. Many old Java idioms are no longer needed, and new features and programming paradigms can make you far more effective. However, navigating these changes can be challenging. Core Java for the Impatient, Third Edition, is a complete yet concise guide that reflects all changes through Java SE 17, Oracle's latest Long-Term Support (LTS) release. Written by Cay S. Horstmann--author of the classic two-volume Core Java--this indispensable tutorial offers a faster, easier pathway for learning modern Java. Horstmann covers everything working developers need to know, including the powerful concepts of lambda expressions and streams, modern constructs such as records and sealed classes, and sophisticated concurrent programming techniques. Given the size and scope of Java 17, there's plenty to cover, but it's presented in small chunks organized for quick access and easy understanding, with plenty of practical insights and sample code to help you quickly apply all that's new. Test code as you create it with JShellImprove your object-oriented design with records and sealed classesEffectively use text blocks, switch expressions, and pattern matchingUnderstand functional programming with lambda expressionsStreamline and optimize data management with the Streams APIUse modern library features and threadsafe data structures to implement concurrency reliablyWork with the modularized Java API and third-party modulesTake advantage of API improvements for working with collections, input/output, regular expressions, and processesLearn the APIs for date/time processing and internationalization Whether you're an experienced developer just getting started with modern Java, or have been programming with Java for years, this guide will help you write more robust, efficient, and secure Java code. Register your book for convenient access to downloads, updates, and/or corrections as they become available. See inside book for details.
R 1,628.00
Decade of Concurrency: Reflections and Perspectives
The REX School/Symposium "A Decade of Concurrency - Reflections and Perspectives" was the final event of a ten-year period of cooperation between three Dutch research groups working on the foundations of concurrency. Ever since its inception in 1983, the goal of the project has been to contribute to the cross-fertilization between formal methods from the fields of syntax, semantics, and proof theory, aimed at an improved understanding of the nature of parallel computing. The material presented in this volume was prepared by the lecturers (and their coauthors) after the meeting took place. In total, the volume constitutes a thorough state-of-the-art report of the research activities in concurrency.
R 3,102.56
Scientific Computing in Object-Oriented Parallel Environments
This book constitutes the refereed proceedings of the First International Conference on Scientific Computing in Object-Oriented Parallel Environments, ISCOPE '97, held in Marina del Rey, California, in December 1997. The volume presents 36 revised papers carefully selected for inclusion in the book. The papers address run-time performance optimization at several levels, new language programming paradigms, applications of Java-based technology, direct applications in various areas, object-oriented libraries, and new ideas and approaches to parallel scientific computing. All in all, this is an up-to-date presentation of the state-of-the-art in the application of object-oriented methods in scientific and engineering applications.
R 2,015.00
R 1,221.00
R 1,130.00
R 1,374.00
Application and Theory of Petri Nets and Concurrency
This book constitutes the proceedings of the 47th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2026, held in Hamburg, Germany, during June 2026.The 14 full papers and 6 short papers presented in this volume were carefully reviewed and selected from 42 submissions. The topics of accepted papers includes Parallel computing models, Abstract machines, Formal languages and automata theory.
R 3,529.63
JavaTech, an Introduction to Scientific and Technical Computing with Java
JavaTech is a practical introduction to the Java programming language with an emphasis on the features that benefit technical computing. After presenting the basics of object-oriented programming in Java, it examines introductory topics such as graphical interfaces and thread processes. It goes on to review network programming and develops Web client-server examples for tasks such as monitoring remote devices. The focus then shifts to distributed computing with RMI. Finally, it examines how Java programs can access the local platform and interact with hardware. Topics include combining native code with Java, communication via serial lines, and programming embedded processors. An extensive web site supports the book with additional instructional materials. JavaTech demonstrates the ease with which Java can be used to create powerful network applications and distributed computing applications. It will be used as a textbook for programming courses, and by researchers who need to learn Java for a particular task.
R 2,872.00
Object-Based Parallel and Distributed Computation
This book contains a refereed collection of revised papers selected from the presentations at the France-Japan Workshop on Object-Based Parallel and Distributed Computation, OBPDC'95, held in Tokyo in June 1995.The 18 full papers included in the book constitute a representative, well-balanced set of timely research contributions to the growing field of object-based concurrent computing. The volume is organized in sections on massively parallel programming languages, distributed programming languages, formalisms, distributed operating systems, dependable distributed computing, and software management.
R 1,567.69
Semantics of Parallelism
Semantics of Parallelism is the only book which provides a unified treatment of the non-interleaving approach to process semantics (as opposed to the interleaving approach of the process algebraists). Many results found in this book are collected for the first time outside conference and journal articles on the mathematics of non-interleaving semantics. It gives the reader a unified view of various attempts to model parallelism within one conceptual frame work. It is aimed at postgraduates in theoretical computer science and academics who are teaching and researching in the modelling of discrete, concurrent/distributed systems. Workers in the information technology industry who are interested in available theoretical studies on parallelism will also be interested in this book.
R 3,068.49
R 1,962.30
Algebraic Theory for True Concurrency
Algebraic Theory for True Concurrency presents readers with the algebraic laws for true concurrency. Parallelism and concurrency are two of the core concepts within computer science. This book covers the different realms of concurrency, which enables programs, algorithms or problems to be broken out into order-independent or partially ordered components to improve computation and execution speed. There are two primary approaches for executing concurrency: interleaving concurrency and true concurrency. The main representative of interleaving concurrency is bisimulation/rooted branching bisimulation equivalences which is also readily explored. This work eventually founded the comprehensive axiomatization modulo bisimulation equivalence -- ACP (Algebra of Communicating Processes).The other approach to concurrency is true concurrency. Research on true concurrency is active and includes many emerging applications. First, there are several truly concurrent bisimulation equivalences, including: pomset bisimulation equivalence, step bisimulation equivalence, history-preserving (hp-) bisimulation equivalence, and hereditary history-preserving (hhp-) bisimulation equivalence, the most well-known truly concurrent bisimulation equivalence.
R 5,297.00
Languages and Compilers for Parallel Computing
This volume presents revised versions of the 32 papers accepted for the Seventh Annual Workshop on Languages and Compilers for Parallel Computing, held in Ithaca, NY in August 1994.The 32 papers presented report on the leading research activities in languages and compilers for parallel computing and thus reflect the state of the art in the field. The volume is organized in sections on fine-grain parallelism, align- ment and distribution, postlinear loop transformation, parallel structures, program analysis, computer communication, automatic parallelization, languages for parallelism, scheduling and program optimization, and program evaluation.
R 1,591.78
Concurrency Control in Distributed System Using Mutual Exclusion
The book presents various state-of-the-art approaches for process synchronization in a distributed environment. The range of algorithms discussed in the book starts from token based mutual exclusion algorithms that work on tree based topology. Then there are interesting solutions for more flexible logical topology like a directed graph, with or without cycle. In a completely different approach, one of the chapters presents two recent voting-based DME algorithms. All DME algorithms presented in the book aim to ensure fairness in terms of first come first serve (FCFS) order among equal priority processes. At the same time, the solutions consider the priority of the requesting processes and allocate resource for the earliest request when no such request from a higher priority process is pending.
R 3,007.06
Parallelism, Learning, Evolution
This volume presents the proceedings of a workshop onevolutionary models and strategies and another workshop onparallel processing, logic, organization, and technology,both held in Germany in 1989.In the search for new concepts relevant for parallel anddistributed processing, the workshop on parallel processingincluded papers on aspects of space and time,representations of systems, non-Boolean logics, metrics,dynamics and structure, and superposition and uncertainties.The point was stressed that distributed representations ofinformation may share features with quantum physics, such asthe superposition principle and the uncertainty relations.Much of the volume contains material on general parallelprocessing machines, neural networks, and system-theoreticaspects.The material on evolutionary strategies is included becausethese strategies will yield important and powerfulapplications for parallel processing machines, and open thewayto new problem classes to be treated by computers.
R 1,780.45
Object-Based Models and Languages for Concurrent Systems
This volume presents carefully refereed versions of the best papers presented at the Workshop on Models and Languages for Coordination of Parallelism and Distribution, held during ECOOP '94 in Bologna, Italy in July 1994.Recently a new class of models and languages for distributed and parallel programming has evolved; all these models share a few basic concepts: simple features for data description and a small number of mechanisms for coordinating the work of agents in a distributed setting. This volume demonstrates that integrating such features with those known from concurrent object-oriented programming is very promising with regard to language support for distribution and software composition.
R 1,542.57
Modern Concurrency on Apple Platforms
Chapter 1: Introduction to Concurrency- What is concurrency?- Why is concurrency hard to implement?- Existing methods to implement concurrency in Apple Platforms (before async/await). Chapter 2: Async/Await Basics- The keywords and components that play a role in the new concurrency system- Explaining the `async` keyword- Explaining the `await` keyword- Understanding tasks- Understanding the meaning of Continuations. Chapter 3: Introducing Structured Concurrency- Understanding structured concurrency- Using the `async let` construct to create concurrency.- Migrating older delegate and callback-based code into async/await. Chapter 4: The Task Tree- The Task Tree structure- Understanding Task cancellation- What is cooperative task cancellation? Chapter 5: Task Groups- Understanding and implementing task groups.- Implementing concurrency with `withThrowingTaskGroup`- Understanding `withTaskGroup`. Chapter 6: Unstructured Concurrency- Launching concurrent tasks from non-concurrent contexts.- Understanding detached tasks and how to use them. Chapter 7: Actors and Global Actors- Understanding actors as reference types.- The purpose of state isolation.- Understanding the purpose of global actors.Chapter 8: Final Bits- Understanding the @TaskLocal property wrapper- Using the `AsyncSequence` protocol in Swift.- Using AsyncStream to receive events in an awaited loop.- Sendable typesAudience: Advanced
R 1,139.35
Input/Output Intensive Massively Parallel Computing
Massively parallel processing is currently the most promising answer to the quest for increased computer performance. This has resulted in the development of new programming languages and programming environments and has stimulated the design and production of massively parallel supercomputers. The efficiency of concurrent computation and input/output essentially depends on the proper utilization of specific architectural features of the underlying hardware. This book focuses on development of runtime systems supporting execution of parallel code and on supercompilers automatically parallelizing code written in a sequential language. Fortran has been chosen for the presentation of the material because of its dominant role in high-performance programming for scientific and engineering applications.
R 1,557.71
Paradigms of Concurrency
Paradigms of Concurrency: Observations, Behaviours, and Systems - a Petri Net View - Ryszard Janicki (McMaster University, CA) Jetty Kleijn (Leiden University, NL) Maciej Koutny (Newcastle University, UK) Lukasz Mikulski (Nicolaus Copernicus University, PL) Concurrency can be studied at different yet consistent levels of abstraction: from individual behavioural observations via more abstract concurrent histories that can be represented by causality structures capturing invariant dependencies between executed actions, to system level constructs such as Petri nets or process algebra expressions. Histories can then be understood as sets of closely related observations. Depending on the nature of the observed relationships between executed actions involved in a single concurrent history, one may identify different concurrency paradigms underpinned by different kinds of causality structures such as partial orders. This book studies fundamental mathematical abstractions to capture and relate observations, histories, and systems. In particular, taking a Petri net view, we present system models fitting various concurrency paradigms and their associated causality structures.
R 7,670.30
R 3,107.57
Parallel Computing in Science and Engineering
It was the aim of the conference to present issues in parallel computing to a community of potential engineering/scientific users. An overview of the state-of-the-art in several important research areas is given by leading scientists in their field. The classification question is taken up at various points, ranging from parametric characterizations, communication structure, and memory distribution to control and execution schemes. Central issues in multiprocessing hardware and operation, such as scalability, techniques of overcoming memory latency and synchronization overhead, as well as fault tolerance of communication networks are discussed. The problem of designing and debugging parallel programs in a user-friendly environment is addressed and a number of program transformations for enhancing vectorization and parallelization in a variety of program situations are described. Two different algorithmic techniques for the solution of certain classes of partial differential equations are discussed. The properties of domain-decomposition algorithms and their mapping onto a CRAY-XMP-type architecture are investigated and an overview is given of the merit of various approaches to exploiting the acceleration potential of multigrid methods. Finally, an abstract performance modeling technique for the behavior of applications on parallel and vector architectures is described.
R 1,539.34
Logics for Concurrency
This book presents five tutorial-style lectures on various approaches to the problem of verifying distributed systems: three chapters concentrate on linear-time or branching-time temporal logics; one addresses process equivalence with an emphasis on infinite-state systems; and the final one presents a novel category-theoretic approach to verification. The various formalisms for expressing properties of concurrent systems, based on automata-theoretic techniques or structural properties, are studied in detail.Much attention is paid to the style of writing and complementary coverage of the relevant issues. Thus these lecture notes are ideally suited for advanced courses on logics for concurrent systems. Equally, they are indispensable reading for anyone researching the area of distributed computing.
R 1,553.72
Models for Concurrency
Concurrent systems are generally understood in terms of behavioural notions. This book analyzes the subject in terms of events and their temporal relationship rather than on global states. It presents a comprehensive analysis of model theory applied to concurrent protocols, and seeks to provide a theory of concurrency that is based on mathematical foundations. The book is divided into three main sections. The first introduces the required concepts from model theory, details the structures that are used to model concurrency, gives an in-depth description and explanation of the semantics of a simple language that allows concurrent execution of sequential programs and deals with the question of resolving executions into higher-level and lower-level granularities. The second and third sections apply the theory developed to practical examples, and an expansion of the producer/consumer problems with details of two solutions is given. The author also deals with message passing as oppposed to shared memory.
R 7,572.77
PARLE ’92. Parallel Architectures and Languages Europe
The 1992 Parallel Architectures and Languages Europeconference continues the tradition - of a wide andrepresentative international meeting of specialists fromacademia and industry in theory, design, and application ofparallel computer systems - set by the previous PARLEconferences held in Eindhoven in 1987, 1989, and 1991.This volume contains the 52 regular and 25 poster papersthat were selected from 187 submitted papers forpresentation and publication. In addition, five invitedlectures areincluded. The regular papers are organized intosections on: implementation of parallel programs, graphtheory, architecture, optimal algorithms, graph theory andperformance, parallel software components, data baseoptimization and modeling, data parallelism, formal methods,systolic approach, functional programming, fine grainparallelism, Prolog, data flow systems, network efficiency,parallel algorithms, cache systems, implementation ofparallel languages, parallel scheduling in data basesystems, semantic models, parallel data base machines, andlanguage semantics.
R 2,014.68
Compositionality, Concurrency, and Partial Correctness
The hierarchical decomposition of programs into smaller ones is generally considered imperative to master the complexity of large programs. The impact of this principle of program decomposition on the specification and verification of parallel executed programs is the subject of this monograph. Two important yardsticks for verification methods, those of compositionality and modularity, are made precise. The problem of reusing software is addressed by the introduction of the notion of specification adaptation. Within this context, different methods for specifying the observable behavior with respect to partial correctness of communicating processes are considered, and in particular the contrast between the "programs are predicates" and the "programs are predicate transformers" paradigms is shown. The associated formal proof systems are proven sound and complete in various senses with respect to the denotational semantics of the programming language, and they are related to each other to give an in-depth comparison between the different styles of program verification. The programming language TNP used here is near to actual languages like Occam. It combines CCS/CSP style communication based programming with state based programming, and allows dynamically expanding and shrinking networks of processes.
R 1,553.72
Concurrency Control in Distributed System Using Mutual Exclusion
The book presents various state-of-the-art approaches for process synchronization in a distributed environment. The range of algorithms discussed in the book starts from token based mutual exclusion algorithms that work on tree based topology. Then there are interesting solutions for more flexible logical topology like a directed graph, with or without cycle. In a completely different approach, one of the chapters presents two recent voting-based DME algorithms. All DME algorithms presented in the book aim to ensure fairness in terms of first come first serve (FCFS) order among equal priority processes. At the same time, the solutions consider the priority of the requesting processes and allocate resource for the earliest request when no such request from a higher priority process is pending.
R 3,006.16
Building Parallel, Embedded, and Real-Time Applications with Ada
The arrival and popularity of multi-core processors has sparked a renewed interest in the development of parallel programs. Similarly, the availability of low-cost microprocessors and sensors has generated a great interest in embedded real-time programs. This book provides students and programmers whose backgrounds are in traditional sequential programming with the opportunity to expand their capabilities into parallel, embedded, real-time and distributed computing. It also addresses the theoretical foundation of real-time scheduling analysis, focusing on theory that is useful for actual applications. Written by award-winning educators at a level suitable for undergraduates and beginning graduate students, this book is the first truly entry-level textbook in the subject. Complete examples allow readers to understand the context in which a new concept is used, and enable them to build and run the examples, make changes, and observe the results.
R 5,464.09
Languages and Compilers for Parallel Computing
This book constitutes the thoroughly refereed post-proceedings of the 23rd International Workshop on Languages and Compilers for Parallel Computing, LCPC 2010, held in Houston, TX, USA, in October 2010. The 18 revised full papers presented were carefully reviewed and selected from 47 submissions. The scope of the workshop spans foundational results and practical experience, and targets all classes of parallel platforms including concurrent, multithreaded, multicore, accelerated, multiprocessor, and cluster systems
R 2,172.12
R 916.00
Parallel Processing and Parallel Algorithms
Motivation It is now possible to build powerful single-processor and multiprocessor systems and use them efficiently for data processing, which has seen an explosive ex pansion in many areas of computer science and engineering. One approach to meeting the performance requirements of the applications has been to utilize the most powerful single-processor system that is available. When such a system does not provide the performance requirements, pipelined and parallel process ing structures can be employed. The concept of parallel processing is a depar ture from sequential processing. In sequential computation one processor is in volved and performs one operation at a time. On the other hand, in parallel computation several processors cooperate to solve a problem, which reduces computing time because several operations can be carried out simultaneously. Using several processors that work together on a given computation illustrates a new paradigm in computer problem solving which is completely different from sequential processing. From the practical point of view, this provides sufficient justification to investigate the concept of parallel processing and related issues, such as parallel algorithms. Parallel processing involves utilizing several factors, such as parallel architectures, parallel algorithms, parallel programming lan guages and performance analysis, which are strongly interrelated. In general, four steps are involved in performing a computational problem in parallel. The first step is to understand the nature of computations in the specific application domain.
R 3,137.02
Algorithms and Architectures for Parallel Processing
This fourvolume set LNCS 9528, 9529, 9530 and 9531 constitutes the refereed proceedingsof the 15th International Conference on Algorithms and Architectures for ParallelProcessing, ICA3PP 2015, held in Zhangjiajie, China, in November 2015.The 219revised full papers presented together with 77 workshop papers in these fourvolumes were carefully reviewed and selected from 807 submissions (602 fullpapers and 205 workshop papers). The first volume comprises the followingtopics: parallel and distributed architectures; distributed and network-basedcomputing and internet of things and cyber-physical-social computing. Thesecond volume comprises topics such as big data and its applications andparallel and distributed algorithms. The topics of the third volume are:applications of parallel and distributed computing and service dependabilityand security in distributed and parallel systems. The covered topics of the fourthvolume are: software systems and programming models and performance modelingand evaluation.
R 2,264.11
OpenMP: Portable Multi-Level Parallelism on Modern Systems
This book constitutes the proceedings of the 16th International Workshop on OpenMP, IWOMP 2020, held in Austin, TX, USA, in September 2020. The conference was held virtually due to the COVID-19 pandemic.The 21 full papers presented in this volume were carefully reviewed and selected for inclusion in this book. The papers are organized in topical sections named: performance methodologies; applications; OpenMP extensions; performance studies; tools; NUMA; compilation techniques; heterogeneous computing; and memory.The chapters ‘A Case Study on Addressing Complex Load Imbalance in OpenMP’ and ‘A Study of Memory Anomalies in OpenMP Applications’ are available open access under a Creative Commons Attribution 4.0 License via link.springer.com.
R 3,328.09
Models for Parallel and Distributed Computation
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.
R 4,661.51
Vector and Parallel Processing - VECPAR'96
This book constitutes a carefully arranged selection of revised full papers chosen from the presentations given at the Second International Conference on Vector and Parallel Processing - Systems and Applications, VECPAR'96, held in Porto, Portugal, in September 1996.Besides 10 invited papers by internationally leading experts, 17 papers were accepted from the submitted conference papers for inclusion in this documentation following a second round of refereeing. A broad spectrum of topics and applications for which parallelism contributes to progress is covered, among them parallel linear algebra, computational fluid dynamics, data parallelism, implementational issues, optimization, finite element computations, simulation, and visualisation.
R 1,587.07
Algorithms and Architectures for Parallel Processing
This book constitutes the refereed proceedings of the 7th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2007, held in Hangzhou, China in June 2007. Focusing on two broad areas of parallel and distributed computing, the papers are organized in topical sections on parallel algorithms, parallel architecture, grid computing, peer-to-peer technologies, and advanced network technologies.
R 1,592.66
