Towards zero latency photonic switching in shared memory networks. (14th August 2014)

• Record Type: Journal Article
• Authors: Madarbux, Muhammad Ridwan; Van Laer, Anouk; Watts, Philip M.; Jones, Timothy M.; Bartolini, Sandro; García, José M.; Pierson, Jean‐Marc; Dittman, Lars; Da Costa, Georges
• Is Part Of: Concurrency and computation. Volume 26:Number 15(2014:Oct.)
• Page Start: 2551
• Page End: 2566
• Publication Date: 2014-08-14
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3334
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main" id="cpe3334-abs-0001"> <title>SUMMARY</title> <p id="cpe3334-para-0001">Optical networks on chip based on silicon photonics have been proposed to reduce latency and power consumption in future chip multiprocessors. However, high performance chip multiprocessors use a shared memory model, which generates large numbers of short messages, creating high arbitration latency overhead for photonic switching networks. In this paper, we explore techniques that intelligently use information from the memory hierarchy to predict communication in order to setup photonic circuits with reduced or eliminated arbitration latency. Firstly, we present a switch scheduling algorithm, which arbitrates on a per memory transaction basis and holds open photonic circuits to exploit temporal locality. We show that this can reduce the average arbitration latency overhead by 60% and eliminate arbitration latency altogether for up to 70% of memory transactions. We then demonstrate that this switch scheduling algorithm operating with a central photonic crossbar or Clos switch has significant energy efficiency benefits over arbitration‐free photonic networks such as single writer multiple reader networks. Finally, we demonstrate that cache miss prediction can be used to predict 86% of more complex memory transactions involving multiple nodes or main memory. Copyright © 2014 John Wiley &amp; Sons, Ltd.</p> </abstract>