Scheduling for cache affinity in parallelized communication protocols

  • Authors:
  • James D. Salehi;James F. Kurose;Don Towsley

  • Affiliations:
  • Dept. of Computer Science, University of Massachusetts, Amherst, MA;Dept. of Computer Science, University of Massachusetts, Amherst, MA;Dept. of Computer Science, University of Massachusetts, Amherst, MA

  • Venue:
  • Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

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.