Introduction to Reversible Computing by Kalyan S. Perumalla

By Kalyan S. Perumalla

Few books comprehensively hide the software program and programming facets of reversible computing. Filling this hole, Introduction to Reversible Computing deals an extended view of the sphere that incorporates the normal energy-motivated perspective in addition to the rising application-motivated software program approach.

Collecting scattered wisdom into one coherent account, the e-book offers a compendium of either classical and lately built effects on reversible computing. It explores up-and-coming theories, thoughts, and instruments for the applying of reversible computing—the logical subsequent step within the evolution of computing systems.

The e-book covers idea, and software program points, primary limits, complexity analyses, sensible algorithms, compilers, potency development strategies, and alertness components. the subjects span a number of parts of machine technological know-how, together with high-performance computing, parallel/distributed structures, computational idea, compilers, power-aware computing, and supercomputing.

The publication offers enough fabric for beginners to simply start. It presents citations to unique articles on seminal effects in order that readers can seek advice the corresponding courses within the literature. tips that could extra assets are integrated for extra complex issues. For these already accustomed to a undeniable subject inside reversible computing, the e-book can function a one-stop connection with different issues within the box.

Show description

Read Online or Download Introduction to Reversible Computing PDF

Similar algorithms books

Computational Geometry: An Introduction Through Randomized Algorithms

This advent to computational geometry is designed for newcomers. It emphasizes basic randomized equipment, constructing simple rules with assistance from planar functions, starting with deterministic algorithms and transferring to randomized algorithms because the difficulties turn into extra advanced. It additionally explores greater dimensional complex functions and offers routines.

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings

This publication constitutes the joint refereed lawsuits of the 14th overseas Workshop on Approximation Algorithms for Combinatorial Optimization difficulties, APPROX 2011, and the fifteenth foreign Workshop on Randomization and Computation, RANDOM 2011, held in Princeton, New Jersey, united states, in August 2011.

Conjugate Gradient Algorithms and Finite Element Methods

The location taken during this selection of pedagogically written essays is that conjugate gradient algorithms and finite point tools supplement one another tremendous good. through their combos practitioners were capable of clear up differential equations and multidimensional difficulties modeled by means of traditional or partial differential equations and inequalities, now not inevitably linear, optimum regulate and optimum layout being a part of those difficulties.

Routing Algorithms in Networks-on-Chip

This e-book presents a single-source connection with routing algorithms for Networks-on-Chip (NoCs), in addition to in-depth discussions of complex ideas utilized to present and subsequent iteration, many middle NoC-based Systems-on-Chip (SoCs). After a uncomplicated creation to the NoC layout paradigm and architectures, routing algorithms for NoC architectures are offered and mentioned in any respect abstraction degrees, from the algorithmic point to real implementation.

Extra info for Introduction to Reversible Computing

Sample text

1 Notions of Computing 3 4 5 7 Consider the word computation. For some strange and unknown reason, the notion that naturally arises in one’s mind is that of forward computation. The unidirectionality of computational flow seems to be the natural and intuitive notion for many people. Even more interestingly, no notion of computation in the opposite direction seems to be naturally triggered in one’s mind—neither a mental model nor even a recollection of any related reversible phenomenon.

Fault Tolerance . . . . . . . . . . . . . . . . . . . . . . . . . . Database Transactions . . . . . . . . . . . . . . . . . . . . . . Quantum Computing . . . . . . . . . . . . . . . . . . . . . . Additional Applications . . . . . . . . . . . . . . . . . . . . . 4 9 10 11 11 12 14 15 15 16 16 17 18 19 20 22 23 23 At a high level, the challenge of reversible computing may be stated as follows: Given a program, the program must be executed in such a way that its forward progress could be paused at any moment and the direction of its execution can be reversed to retrace its previous steps exactly.

1 Asynchronous Computing . . . . . . . . . . . . . . . . 2 Supercriticality . . . . . . . . . . . . . . . . . . . . . 3 Performance Effects . . . . . . . . . . . . . . . . . . . Processor Architectures . . . . . . . . . . . . . . . . . . . . . 1 Speculative Execution . . . . . . . . . . . . . . . . . . 2 Very Large Instruction Word . . . . . . . . . . . . . . 3 Anti-Memoization . . . . . .

Download PDF sample

Rated 4.15 of 5 – based on 5 votes