• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Application-Aware Prioritization Mechanisms for On-Chip Networks

Cached

  • Download as a PDF

Download Links

  • [www.research.microsoft.com]
  • [www.research.microsoft.com]
  • [www.research.microsoft.com]
  • [research.microsoft.com]
  • [research.microsoft.com]
  • [research.microsoft.com]
  • [www.ece.cmu.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Reetuparna Das , Onur Mutlu , Thomas Moscibroda , Chita R. Das
Citations:4 - 3 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Das_application-awareprioritization,
    author = {Reetuparna Das and Onur Mutlu and Thomas Moscibroda and Chita R. Das},
    title = {Application-Aware Prioritization Mechanisms for On-Chip Networks},
    year = {}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Network-on-Chips (NoCs) are likely to become a critical shared resource in future many-core processors. The challenge is to develop policies and mechanisms that enable multiple applications to efficiently and fairly share the network, to improve system performance. Existing local packet scheduling policies in the routers fail to fully achieve this goal, because they treat every packet equally, regardless of which application issued the packet. This paper proposes prioritization policies and architectural extensions to NoC routers that improve the overall application-level throughput, while ensuring fairness in the network. Our prioritization policies are application-aware, distinguishing applications based on the stall-time criticality of their packets. The idea is to divide processor execution time into phases, rank applications within a phase based on stall-time criticality, and have all routers in the network prioritize packets based on their applications ’ ranks. Our scheme also includes techniques that ensure starvation freedom and enable the enforcement of system-level application priorities. We evaluate the proposed prioritization policies on a 64-core CMP with an 8x8 mesh NoC, using a suite of 35 diverse applications. For a representative set of case studies, our proposed policy increases average system throughput by 25.6 % over age-based arbitration and 18.4 % over round-robin arbitration. Averaged over 96 randomlygenerated multiprogrammed workload mixes, the proposed policy improves system throughput by 9.1 % over the best existing prioritization policy, while also reducing application-level unfairness.

Citations

1117 Clustering Algorithms - Hartigan - 1975
971 Analysis and Simulation of a Fair Queueing Algorithm - Demers, Keshav, et al. - 1989
852 Myrinet: A Gigabit-per-Second Local Area Network - Boden, Cohen, et al. - 1995
524 The Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks - Zhang - 1991
312 An efficient algorithm for exploiting multiple arithmetic units - Tomasulo - 1967
301 Lockup-Free Instruction Fetch/Prefetch Cache Organization - Kroft - 1981
258 Principles and Practices of Interconnection Networks - Dally, Towles - 2003
179 Symbiotic jobscheduling for a simultaneous multithreaded processor - Snavely, Tullsen - 2000
123 Runahead Execution: An Alternative to Very Large Instruction Windows for Out-of-order - Mutlu, Stark, et al. - 2003
103 Improving data cache performance by pre-executing instruction under a cache miss - DUNDAS, T - 1997
93 A Comparative Analysis of Disk Scheduling Policies - Teorey, Pinkerton - 1972
79 Focusing processor policies via critical-path prediction - Fields, Rubin, et al. - 2001
78 Trade-offs in the design of a router with both guaranteed and best-effort services for networks on chip - Rijpkema, Radulescu, et al. - 2003
67 Load Latency Tolerance in Dynamically Scheduled Processors - Srinivasan, Lebeck - 1999
60 QNoC: QoS Architecture and Design Process for Network on Chip - Bolotin, Cidon, et al.
52 Pinpointing representative portions of large Intel Itanium programs with dynamic instrumentation - Patil, Cohn, et al. - 2004
51 Stall-time fair memory access scheduling for chip multiprocessors - Mutlu, Moscibroda - 2007
49 Parallelism-aware batch scheduling: Enhancing both performance and fairness of shared DRAM systems - Mutlu, Moscibroda - 2008
35 A case for MLP-aware cache replacement - Qureshi, Lynch, et al. - 2006
34 Flattened Butterfly Topology for On-Chip Networks - Kim, Balfour, et al. - 2007
32 Express Virtual Channels: Towards the Ideal Interconnection Fabric - Kumar, Peh, et al. - 2007
30 System-level performance metrics for multiprogram workloads - Eyerman, Eeckhout - 2008
18 A novel dimensionally-decomposed router for - Kim, Nicopoulos, et al.
15 Efficient Runahead Execution: Power-Efficient Memory Latency Tolerance - Mutlu, Kim, et al.
14 GloballySynchronized Frames for Guaranteed Quality-of-Service in On-Chip Networks - Lee, Ng, et al. - 2008
14 Das,“ViChaR: A dynamic virtual channel regulator for network-on-chip routers - Nicopoulos, Park, et al. - 2006
9 The Power of Priority: NoC based Distributed Cache Coherency - Bolotin, Guz, et al. - 2007
7 QoS provisioning in clusters: an investigation of router and NIC design - Yum, Kim, et al. - 2001
4 Energy-delay characteristics of CMOS adders", High-Performance Energy-Efficient Microprocessor Design - Oklobdzija, Zeydel
3 Rotating Combined Queueing (RCQ - Chien, Kim - 1996
3 Criticalitybased optimizations for efficient load processing - Subramaniam, Bracy, et al. - 2009
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University