Reversible Programming Techniques for Shortest-Path Algorithms

Lanying Guo, Chao Peng, Siyuan Chen, Cheng He

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Reversible computing is so far the only way to circumvent the Landauer limit of CPU power efficiency, thus has attracted more and more attention recently due to its prospect in energy-efficient computing. To make reversible computing possible, much ground work needs to be studied, especially on reversible algorithms. We focus on designing reversible shortest path algorithms in this paper.

Original languageEnglish
Title of host publication2018 IEEE 37th International Performance Computing and Communications Conference, IPCCC 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538668085
DOIs
StatePublished - 2 Jul 2018
Event37th IEEE International Performance Computing and Communications Conference, IPCCC 2018 - Orlando, United States
Duration: 17 Nov 201819 Nov 2018

Publication series

Name2018 IEEE 37th International Performance Computing and Communications Conference, IPCCC 2018

Conference

Conference37th IEEE International Performance Computing and Communications Conference, IPCCC 2018
Country/TerritoryUnited States
CityOrlando
Period17/11/1819/11/18

Keywords

  • optimal
  • reversiSle algorithms
  • reversible computing
  • simulation
  • technique

Fingerprint

Dive into the research topics of 'Reversible Programming Techniques for Shortest-Path Algorithms'. Together they form a unique fingerprint.

Cite this