skip to main content
10.1145/223587.223626acmconferencesArticle/Chapter ViewAbstractPublication PagesmetricsConference Proceedingsconference-collections
Article
Free Access

Scheduling for cache affinity in parallelized communication protocols

Authors Info & Claims
Published:01 May 1995Publication History

ABSTRACT

We explore processor-cache affinity scheduling of parallel network protocol processing in a setting in which protocol processing executes on a shared-memory multiprocessor concurrently with a general workload of non-protocol activity. We find that affinity scheduling can significantly reduce the communication delay associated with protocol processing, enabling the host to support a greater number of concurrent streams and to provide a higher maximum throughput to individual streams. In addition, we compare implementations of two parallelization approaches (Locking and Independent Protocol Stacks) with very different caching behaviors.

References

  1. 1.J. Salehi, J. Kurose, D. Towsley. "Scheduling for Cache Affinity in Parallelized Communication Protocols". TR UM-CS-1994- 075, U Massachusetts, Oct. 1994. (available via ftp from gaia.cs.umass.edu in pub/Sale94:Scheduling.ps.Z) Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.J. Singh, H. Stone and D. Thiebaut. "A Model of Workloads and Its Use in Miss-Rate Prediction for Fully Associative Caches". IEEE Transactions on Computers, 41 (7):811-825, Jul. 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.M. Squillante and E. Lazowska. "Using Processor Cache Affinity Information in Shared-Memory Multiprocessor Scheduling". IEEE Transacttons on Parallel and Distributed Systems, 4(2):131-143, Feb. 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.D. Thiebaut and H. Stone. "Footprints in the Cache". A CM Transactions on Computer Systems, 5(4):305-329, Nov. 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Scheduling for cache affinity in parallelized communication protocols

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          SIGMETRICS '95/PERFORMANCE '95: Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
          May 1995
          340 pages
          ISBN:0897916956
          DOI:10.1145/223587

          Copyright © 1995 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 May 1995

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate459of2,691submissions,17%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader