• Login
    View Item 
    •   SMARTech Home
    • College of Computing (CoC)
    • College of Computing Technical Reports
    • View Item
    •   SMARTech Home
    • College of Computing (CoC)
    • College of Computing Technical Reports
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    A Simulation-based Scalability Study of Parallel Systems

    Thumbnail
    View/Open
    GIT-CC-93-27.pdf (275.6Kb)
    Date
    1993
    Author
    Sivasubramaniam, Anand
    Singla, Aman
    Ramachandran, Umakishore
    Venkateswaran, H.
    Metadata
    Show full item record
    Abstract
    Scability studies of parallel architectures have used scalar metrics to evaluate their performance. Very often, it is difficult to glean the sources of inefficiency resulting from the mismatch between the algorithmic and architectural requirements using such scalar metrics. Low-level performance studies of the hardware are also inadequate for predicting the scalability of the machine on real applications. We propose a top-down approach to scalability study that alleviates some of these problems. We characterize applications in terms of the frequently occurring kernels, and their interaction with the architecture in terms of overheads in the parallel system. An overhead function is associated with the algorithmic characteristics as well as their interaction with the architectural features. We present a simulation platform called SPASM (Simulator for Parallel Architectural Scalability Measurements) that quantifies these overhead functions. SPASM separates the algorithmic overhead into its components (such as latency and contention). Such a separation is novel and has not been addressed in any previous study. We illustrate the top-down approach by considering a case study in implementing three NAS parallel kernels on two simulated message-passing platforms.
    URI
    http://hdl.handle.net/1853/6767
    Collections
    • College of Computing Technical Reports [506]

    Related items

    Showing items related by title, author, creator and subject.

    • An approximate load balancing parallel hash join algorithm to handle data skew in a parallel data base system 

      Geum, Seong (Georgia Institute of Technology, 1995-05)
    • Parallel subdomain method for massively parallel computers 

      Su, (Philip) Shin-Chen (Georgia Institute of Technology, 1992-12)
    • Stochastic Control: From Theory to Parallel Computation and Applications 

      Theodorou, Evangelos A. (2016-02-24)
      For autonomous systems to operate in stochastic environments, they have to be equipped with fast decision-making processes to reason about the best possible action. Grounded on first principles in stochastic optimal control ...

    Browse

    All of SMARTechCommunities & CollectionsDatesAuthorsTitlesSubjectsTypesThis CollectionDatesAuthorsTitlesSubjectsTypes

    My SMARTech

    Login

    Statistics

    View Usage StatisticsView Google Analytics Statistics
    facebook instagram twitter youtube
    • My Account
    • Contact us
    • Directory
    • Campus Map
    • Support/Give
    • Library Accessibility
      • About SMARTech
      • SMARTech Terms of Use
    Georgia Tech Library266 4th Street NW, Atlanta, GA 30332
    404.894.4500
    • Emergency Information
    • Legal and Privacy Information
    • Human Trafficking Notice
    • Accessibility
    • Accountability
    • Accreditation
    • Employment
    © 2020 Georgia Institute of Technology