This volume presents the proceedings of the First Canada-France Conference on Parallel Computing; despite its name, this conference was open to full international contribution and participation, as shown by the list of contributing authors. This volume consists of in total 22 full papers, either invited or accepted and revised after a thorough reviewing process. All together the papers provide a highly competent perspective on research in parallel algorithms and complexity, interconnection networks and distributed computing, algorithms for unstructured problems, and structured communications from the point of view of parallel and distributed computing.
This volume presents the proceedings of the First Canada-France Conference on Parallel Computing; despite its name, this conference was open to full international contribution and participation, as shown by the list of contributing authors. This volume consists of in total 22 full papers, either invited or accepted and revised after a thorough reviewing process. All together the papers provide a highly competent perspective on research in parallel algorithms and complexity, interconnection networks and distributed computing, algorithms for unstructured problems, and structured communications from the point of view of parallel and distributed computing.
Many science and engineering applications require the user to find solutions to systems of nonlinear constraints or to optimize a nonlinear function subject to nonlinear constraints. The field of global optimization is the study of methods to find all solutions to systems of nonlinear constraints and all global optima to optimization problems. Numerica is modeling language for global optimization that makes it possible to state nonlinear problems in a form close to the statements traditionally found in textbooks and scientific papers. The constraint-solving algorithm of Numerica is based on a combination of traditional numerical methods such as interval and local methods, and constraint satisfaction techniques. This comprehensive presentation of Numerica describes its design, functions, and implementation. It also discusses how to use Numerica effectively to solve practical problems and reports a number of experimental results. A commercial implementation of Numerica is available from ILOG under the name ILOG Numerica.
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.
This volume is the proceedings of the first International Workshop on Orders, Algorithms, and Applications, held at Lyon, France in July 1994. Ordered sets and the more specifically algorithmic aspects of order theory are of increasing importance, for example in graph theory. They enjoy a recognized place in computer science as well as in mathematics, due to various new developments in the last few years. The nine technical papers accepted for this volume and the four invited papers presented offer a representative perspective on theoretical and applicational aspects of orders and related algorithms.
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.