skip to main content
10.1145/1281700.1281702acmconferencesArticle/Chapter ViewAbstractPublication PagesexpcsConference Proceedingsconference-collections
Article

Quantifying the cost of context switch

Published:13 June 2007Publication History

ABSTRACT

Measuring the indirect cost of context switch is a challenging problem. In this paper, we show our results of experimentally quantifying the indirect cost of context switch using a synthetic workload. Specifically, we measure the impact of program data size and access stride on context switch cost. We also demonstrate the potential impact of OS background interrupt handling on the measurement accuracy. Such impact can be alleviated by using a multi-processor system on which one processor is employed for context switch measurement while the other runs OS background tasks.

References

  1. Anant Agarwal, John L. Hennessy, and Mark Horowitz. Cache performance of operating system and multiprogramming workloads. ACM Trans. Comput. Syst., 6(4):393--431, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. R. Fromm and N. Treuhaft. Revisiting the cache interference costs of context switching. http://citeseer.ist.psu.edu/252861.html.Google ScholarGoogle Scholar
  3. R. Jain. The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation and Modeling. John Wiley & Sons, 2001.Google ScholarGoogle Scholar
  4. L. McVoy and C. Staelin. Imbench: Portable Tools for Performance Analysis. In In Proc. of the USENIX Annual Technical Conference, pages 279--294, San Diego, CA, January 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. J. C. Mogul and A. Borg. The Effect of Context Switches on Cache Performance. In In Proc. of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, pages 75--84, Santa Clara, CA, April 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. K. Ousterhout. Why Aren't Operating Systems Getting Faster As Fast As Hardware? In In Proc. of the USENIX Summer Conference, pages 247--256, Anaheim, CA, June 1990.Google ScholarGoogle Scholar
  7. G. Edward Suh, Srinivas Devadas, and Larry Rudolph. Analytical cache models with applications to cache partitioning. In Proceedings of the International Conference on Supercomputing, pages 1--12, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Quantifying the cost of context switch

      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
        ExpCS '07: Proceedings of the 2007 workshop on Experimental computer science
        June 2007
        218 pages
        ISBN:9781595937513
        DOI:10.1145/1281700

        Copyright © 2007 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: 13 June 2007

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader