Search results for "java concurrency and parallelism"
Items we need to order for you
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 580.00
R 1,238.00
R 306.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
R 489.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
R 1,221.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
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
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
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
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
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
R 3,107.57
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
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
CONCUR'99. Concurrency Theory
This volume contains the proceedings of the 10th International Conference on Concurrency Theory (CONCUR'99) held in Eindhoven, The Netherlands, 24-27 August 1999. ThepurposeoftheCONCURconferencesistobringtogetherresearchers,- velopersandstudentsinordertoadvancethetheoryofconcurrencyandpromote its applications. Interest in this topic is continuously growing, as a consequence oftheimportanceandubiquityofconcurrentsystemsandtheirapplications,and of the scienti?c relevance of their foundations. The scope of CONCUR'99 covers all areas of semantics, logics and veri?cation techniques for concurrent systems. A list of speci?c topics includes (but is not limited to) concurrency-related - pects of: models of computation and semantic domains, process algebras, Petri nets, event structures, real-time systems, hybrid systems, stochastic systems, - cidability, model-checking, veri?cation techniques, re?nement techniques, term and graph rewriting, distributed programming, logic constraint programming, object-oriented programming, typing systems and algorithms, case studies, and tools and environments for programming and veri?cation. The ?rst two CONCUR conferences were held in Amsterdam (NL) in 1990 and 1991, the following ones in Stony Brook (USA), Hildesheim (D), Uppsala (S), Philadelphia (USA), Pisa (I), Warsaw (PL) and Nice (F).The proceedings have appeared in Springer LNCS, as Volumes 458, 527, 630, 715, 836, 962, 1119, 1243, and 1466.
R 3,085.67
CONCUR 2002 - Concurrency Theory
This volume contains the proceedings of the 13th International Conference on Concurrency Theory (CONCUR 2002)held in Brno, Czech Republic, August 20-23, 2002. The purpose of the CONCUR conferences is to bring together researchers, - velopers and students in order to advance the theory of concurrency, and promote its applications. Interest in this topic is continuously growing, as a consequence of the importance and ubiquity of concurrent systems and their applications, and of the scienti?c relevance of their foundations. The scope covers all areas of semantics, logics and veri?cation techniques for concurrent systems. T- ics include concurrency-related aspects of models of computation and semantic domains, process algebras, Petri nets, event structures, real-time systems, - brid systems, probabilistic systems, model-checking, veri?cation techniques, - ?nement techniques, term and graph rewriting, distributed programming, logic constraint programming, object-oriented programming, typing systems and - gorithms, security, case studies, tools and environments for programming and veri?cation. The ?rst two CONCUR conferences were held in Amsterdam (The Neth- lands)in 1990 and 1991, the following ones in Stony Brook (USA), Hildesheim (Germany), Uppsala (Sweden), Philadelphia (USA), Pisa (Italy), Warsaw (Poland), Nice (France), Eindhoven (The Netherlands), University Park (Pe- sylvania, USA), and Aalborg (Denmark).The proceedings have appeared in Springer LNCS, as Vols. 458, 527, 630, 715, 836, 962, 1119, 1243, 1466, 1664, 1877, and 2154. Out of 101 regular papers submitted this year, 32 were accepted for p- sentation at the conference and are included in this volume.
R 4,819.16
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
CONCUR '94: Concurrency Theory
This volume constitutes the proceedings of the Fifth International Conference on Concurrency Theory, CONCUR '94, held at Uppsala, Sweden in August 1994.In total, 29 refereed research papers selected from 108 submissions for the conference are presented together with full papers or abstracts of the 5 invited talks by prominent speakers. The book contains recent results on all relevant aspects of concurrency research and thus competently documents the progress of the field since the predecessor conference CONCUR '93, the proceedings of which are published as LNCS 715.
R 1,596.78
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
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
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
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
Concurrency Verification
This is a systematic and comprehensive introduction both to compositional proof methods for the state-based verification of concurrent programs, such as the assumption-commitment and rely-guarantee paradigms, and to noncompositional methods, whose presentation culminates in an exposition of the communication-closed-layers (CCL) paradigm for verifying network protocols. Compositional concurrency verification methods reduce the verification of a concurrent program to the independent verification of its parts. If those parts are tightly coupled, one additionally needs verification methods based on the causal order between events. These are presented using CCL. The semantic approach followed here allows a systematic presentation of all these concepts in a unified framework which highlights essential concepts. This 2001 book is self-contained, guiding the reader from advanced undergraduate level. Every method is illustrated by examples, and a picture gallery of some of the subject's key figures complements the text.
R 3,891.46
R 916.00
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
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
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
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
Concurrency in Dependable Computing
Concurrency in Dependable Computing focuses on concurrency related issues in the area of dependable computing. Failures of system components, be hardware units or software modules, can be viewed as undesirable events occurring concurrently with a set of normal system events. Achieving dependability therefore is closely related to, and also benefits from, concurrency theory and formalisms. This beneficial relationship appears to manifest into three strands of work. Application level structuring of concurrent activities. Concepts such as atomic actions, conversations, exception handling, view synchrony, etc., are useful in structuring concurrent activities so as to facilitate attempts at coping with the effects of component failures. Replication induced concurrency management. Replication is a widely used technique for achieving reliability. Replica management essentially involves ensuring that replicas perceive concurrent events identically. Application of concurrency formalisms for dependability assurance. Fault-tolerant algorithms are harder to verify than their fault-free counterparts due to the fact that the impact of component faults at each state need to be considered in addition to valid state transitions. CSP, Petri nets, CCS are useful tools to specify and verify fault-tolerant designs and protocols. Concurrency in Dependable Computing explores many significant issues in all three strands. To this end, it is composed as a collection of papers written by authors well-known in their respective areas of research. To ensure quality, the papers are reviewed by a panel of at least three experts in the relevant area.
R 4,659.30
R 428.00
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
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
Parallelisierung komplexer Probleme
Parallelisierung komplexer Probleme ging aus der gleichnamigen Veranstaltung 1990 in Mannheim hervor. Es enthält nach einer einleitenden Übersicht von H.W. Meuer über den Stand und die Entwicklungstendenz im Markt für Parallelrechner aktualisierte Artikel zu den im Tutorium diskutierten Themen und eine Zusammenfassung der abschließenden Podiumsdiskussion. Als erstes deutschsprachiges Buch befaßt es sich mit den Problemen und Erfahrungen bei der Programmierung von Fragestellungen aus Wissenschaft und Technik auf Parallelrechnern. Besonders wertvoll sind die Berichte der Anwender, die erstmals Parallelrechner als Produktionsrechner in der Praxis einsetzen. Um einen Überblick über dieses sich sehr schnell entwickelnde Gebiet zu geben, wurde auf eine breite Sammlung verschiedener Anwendungen und Architekturen Wert gelegt. Die Anwendungen erstrecken sich von der Elementarteilchenphysik über Strömungsdynamik im Automobilbau und Meeresforschung bis hin zu Software-Werkzeugen für Parallelrechner selbst. Während die Hälfte der Beiträge Erfahrungen mit globalem Speicher schildern (Cray, IBM, Alliant, Convex), gehen die anderen auf verteilte Speicher ein (Intel, Suprenum, iP-Systems, Parsytec). Der Leser dieses Buches erhält insgesamt einen Überblick und zugleich einen detaillierten Einblick in die derzeitigen Probleme und Erfolge beim Einsatz paralleler Rechner zur Lösung komplexer Probleme.
R 2,022.99
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
Java and the Java Virtual Machine
The origin of this book goes back to the Dagstuhl seminar on Logic for System Engineering, organized during the first week of March 1997 by S. Jiihnichen, J. Loeckx, and M. Wirsing. During that seminar, after Egon Borger's talk on How to Use Abstract State Machines in Software Engineering, Wolfram Schulte, at the time a research assistant at the University of Ulm, Germany, questioned whether ASMs provide anything special as a scientifically well founded and rigorous yet simple and industrially viable framework for high level design and analysis of complex systems, and for natural refinements of models to executable code. Wolfram Schulte argued, referring to his work with K. Achatz on A Formal Object-Oriented Method Inspired by Fusion and Object-Z [1], that with current techniques of functional programming and of axiomatic specification, one can achieve the same result. An intensive and long debate arose from this discussion. At the end of the week, it led Egon Borger to propose a collaboration on a real-life specification project of Wolfram Schulte's choice, as a comparative field test of purely functional declarative methods and of their enhancement within an integrated abstract state-based operational (ASM) approach. After some hesitation, in May 1997 Wolfram Schulte accepted the offer and chose as the theme a high-level specification of Java and of the Java Virtual Machine.
R 1,571.66
R 611.00
