John M. Mellor-Crummey and Michael L. Scott. Algorithms for scalable synchronization onshared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1):21--65, February 1991. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Performance Issues in Parallelized Network Protocols - Nahum, Yates, Kurose, Towsley (1994) (22 citations) (Correct)
....for the connection state lock, and since the raw mutex locks provided by IRIX are not FIFO, this suggested that lock contention was causing threads, and thus packets, to be reordered. To preserve the original ordering, we implemented FIFO queueing using the MCS locks by Mellor Crummey and Scott [22]. Their locking algorithm requires atomic swap and compare and swap functions, which we implemented using short R4000 assembler routines. Figure 10 illustrates the effects, using 4 KB packets with checksumming on. The top curve in the figure is from the modified TCP where packets are assumed to ....
John M. Mellor-Crummey and Michael L. Scott. Algorithms for scalable synchronization onshared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1):21--65, February 1991.
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