Tom Knight, March 1987. Talk at Stanford Computer Systems Laboratory. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Reducing Memory and Traffic Requirements for Scalable.. - Gupta, Weber, Mowry (1990) (47 citations) (Correct)
....accurately capturing the identities of processors caching copies of the block. 3. 3 Cache Based Linked List Schemes A different way of addressing the scalability problem of full vector directory schemes is to keep the list of pointers in the processors caches instead of a directory next to memory [9, 16]. One such scheme is currently being formalized as the Scalable Coherent Interface [8] Each directory entry is made up of a doubly linked list. The head and tail pointer to the list are kept in memory. Each cache with a copy of the block is one item of the list with a forward and back pointer to ....
Tom Knight, March 1987. Talk at Stanford Computer Systems Laboratory.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC