×

Competitive snoopy caching. (English) Zbl 0645.68034

For a review of the preliminary version of this paper in Discrete algorithms and complexity, Proc. Jap.-US Joint Semin., Kyoto/Jap. 1986, Perspect. Comput. 15, 459-483 (1987), see Zbl 0643.68021.

MSC:

68N25 Theory of operating systems
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Archibald, J., and Baer, J.-L. An evaluation of cache coherence solutions in shared-bus multiprocessors. Technical Report 85-10-05, Department of Computer Science, University of Washington, 1985.
[2] Belady, L. A., A study of replacement algorithms for virtual storage computers.IBM Systems J.,5 78–101, 1966.
[3] Bentley, J. L., and McGeoch, C. C., Amortized analysis of self-organizing sequential search heuristics.Comm. ACM,28(4) 404–411, 1985.
[4] Frank, S. J., Tightly coupled multiprocessor system speeds memory access times.Electronics,57(1), 164–169, 1984.
[5] Goodman, J. R. Using cache memory to reduce processor-memory traffic.Proc. 10th Annual IEEE International Symposium on Computer Architecture, pp. 124–131, 1983.
[6] Katz, R., Eggers, S., Wood, D. A., Perkins, C., and Sheldon, R. G. Implementing a cache consistency protocol.Proc. 12th Annual IEEE International Symposium on Computer Architecture, pp. 276–283, 1985.
[7] Papamarcos, M., and Patel, J. A low overhead coherence solution for multiprocessors with private cache memories.Proc. 11th Annual IEEE International Symposium on Computer Architecture, pp. 348–354, 1984.
[8] Rudolph, L., and Segall, Z. Dynamic decentralized cache schemes for MIMD parallel processors.Proc. 11th Annual IEEE International Symposium on Computer Architecture, pp. 340–347, 1984.
[9] Rudolph, L., and Segall, Z. Dynamic paging schemes for MIMD parallel processors. Technical Report, Computer Science Department, Carnegie-Mellon University, 1986.
[10] Sleator, D. D., and Tarjan, R. E., Amortized efficiency of list update and paging rules.Comm. ACM,28(2), 202–208, 1985.
[11] Vernon, M. K., and Holliday, M. A. Performance analysis of multiprocessor cache consistency protocols using generalized timed Petri nets. Technical Report, Computer Science Department, University of Wisconsin, 1986.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.