rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Execution driven evaluation of cache coherent shared memory multiprocessors
  name:
    name part: Kumar, Akhilesh.
    role:
      role term: creator
  type of resource: text
  genre: bibliography
  origin info:
    place:
      place term: xx
    date issued: 1996
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: print
    extent: xiv, 141 leaves : illustrations ; 28 cm.
  abstract: Shared-memory multiprocessors are gaining wide acceptability since they are easy to program. Caches and the support for cache coherence are an integral part of shared-memory systems. Large scale systems use directory based coherence protocol. This dissertation deals with the evaluation of large scale cache-coherent shared-memory systems. Execution driven simulation has been used for evaluation because of the complexity of the system model and to facilitate the use of real applications as workload. The interconnection network is a crucial component of multiprocessor systems. Here, the performance of a two-dimensional torus and a multi-stage network have been evaluated for cache-coherent shared-memory systems. Packet switching and wormhole routing have been considered in our evaluation. Also, virtual channels have been considered for wormhole-routed networks. The networks are evaluated for varying number of virtual channels, amount of buffer space, and number of internal links. The network in cache-coherent systems suffers from hot-spots due to bursty traffic. The effectiveness of adaptive routing techniques in wormhole networks has been investigated in dealing with hot-spots in such systems. A partially-adaptive routing scheme and two fully-adaptive routing schemes have been considered for two- dimensional tori and their performance has been compared against non-adaptive C-cube routing. The distribution of shared memory blocks in the system determines the traffic pattern and affects network performance. Two different memory organizations, high-order interleaving and low-order interleaving, have been considered. The traffic pattern and execution time of several applications have been determined for these memory organizations. For most of the applications, low-order interleaving results in lower execution time due to removal of hot-spots in the network and at memory modules. Another important aspect of this work has been to optimize algorithms for cachecoherent shared-…
  note: by Akhilesh Kumar.
  note: Vita.
  note: "Major Subject: Computer Science".
  note: Issued also on microfiche from University Microfilms Inc.
  note: Includes bibliographical references: pages 126-140.
  note: Ph. D. Texas A&M University 1996.
  subject:
    topic: Major computer science
  identifier: 97-01670 UMI
  identifier: http://proxy.library.tamu.edu/login
  related item:
    location:
      url: http://proxy.library.tamu.edu/login
  record info:
    record content source: TXA
    record creation date: 970506
    record change date: 20190325093257.0
    record identifier: in00001353302