Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Bibliography
Accetta M, Baron R, Bolosky W, Golub D, Rashid R, Tevanian A, Young M (1986) Mach: a new kernel foundation for UNIX development. In: Proceedings of USENIX Association summer technical conference, Atlanta, GA, June 1986. USENIX Association, Berkeley, pp 93–112
Archibald J, Baer J-L (1986) Cache coherence protocols: evaluation using a multiprocessor simulation model. ACM Trans Comput Syst 4(4):273–298
Barak A, Shiloh A (1985) A distributed load-balancing policy for a multicomputer. Softw Pract Exper 15(9):901–913
Bokhari SH (1979) Dual processor scheduling with dynamic reassignment. IEEE Trans Softw Eng SE-5(4):341–349
Conway RW, Maxwell WL, Miller LW (1967) Theory of scheduling. Addison-Wesley, Reading
Craft DH (1983) Resource management in a decentralized system. In: Proceedings of symposium on operating systems principles, October 1983. ACM, New York, pp 11–19
Devarakonda M, Mukherjee A (1992) Issues in implementation of cache-affinity scheduling. In: Proceedings of winter USENIX conference, January 1992. USENIX Association, Berkeley, pp 345–357
Eager DL, Lazowska ED, Zahorjan J (1986) Adaptive load sharing in homogeneous distributed systems. IEEE Trans Softw Eng SE-12(5):662–675
Eager DL, Lazowska ED, Zahorjan J (1986) A comparison of receiver-initiated and sender-initiated adaptive load sharing. Perform Evaluation 6(1):53–68
Gupta A, Tucker A, Urushibara S (1991) The impact of operating system scheduling policies and synchronization methods on the performance of parallel applications. In: Proceedings of ACM SIGMETRICS conference on measurement and modeling of computer systems, May 1991. ACM, New York, pp 120–132
Horowitz E, Sahni S (1976) Exact and approximate algorithms for scheduling nonidentical processors. J ACM 23(2):317–327
Jouppi NP, Wall DW (1989) Available instruction-level parallelism for superscalar and superpipelined machines. In: Proceedings of international symposium on computer architecture, April 1989. ACM Press, New York, pp 272–282
Lin W, Kumar PR (1984) Optimal control of a queueing system with two heterogeneous servers. IEEE Trans Automatic Contr 29(8):696–703
Livny M, Melman M (1982) Load balancing in homogeneous broadcast distributed systems. In: Proceedings of ACM computer network performance symposium. ACM Press, New York, pp 47–55
Mirchananey R, Towsley D, Stankovic JA (1990) Adaptive load sharing in heterogeneous systems. J Parallel Distrib Comput 9:331–346
Salehi JD, Kurose JF, Towsley D (1996) The effectiveness of affinity-based scheduling in multiprocessor networking (extended version). IEEE/ACM Trans Networ 4(4):516–530
Sequent Computer Systems (1988) Symmetry technical summary. Sequent Computer Systems Inc, Beaverton
Squillante MS, Lazowska ED (1990) Using processor-cache affinity information in shared-memory multiprocessor scheduling. Technical Report 89-06-01, Department of Computer Science, University of Washington, June 1989. Minor revision, Feb 1990
Squillante MS, Lazowska ED (1993) Using processor-cache affinity information in shared-memory multiprocessor scheduling. IEEE Trans Parallel Distrib Syst 4(2):131–143
Squillante MS, Nelson RD (1991) Analysis of task migration in shared-memory multiprocessors. In: Proceedings of ACM SIGMETRICS conference on measurement and modeling of computer systems, May 1991. ACM, New York, pp 143–155
Squillante MS, Zhang Y, Sivasubramaniam A, Gautam N, Franke H, Moreira J (2002) Modeling and analysis of dynamic coscheduling in parallel and distributed environments. In: Proceedings of ACM SIGMETRICS conference on measurement and modeling of computer systems, June 2002. ACM, New York, pp 43–54
Tantawi AN, Towsley D (1985) Optimal static load balancing in distributed computer systems. J ACM 32(2):445–465
Thacker C, Stewart LC, Satterthwaite EH Jr (1988) Firefly: a multiprocessor workstation. IEEE Trans Comput C-37(8):909–920
Thakkar SS, Gifford PR, Fieland GF (1988) The balance multiprocessor system. IEEE Micro 8(1):57–69
Torrellas J, Tucker A, Gupta A (1993) Benefits of cache-affinity scheduling in shared-memory multiprocessors: a summary. In: Proceedings of ACM SIGMETRICS conference on measurement and modeling of computer systems, May 1993. ACM, New York, pp 272–274
Torrellas J, Tucker A, Gupta A (1995) Evaluating the performance of cache-affinity scheduling in shared-memory multiprocessors. J Parallel Distrib Comput 24(2):139–151
Vaswani R, Zahorjan J (1991) The implications of cache affinity on processor scheduling for multiprogrammed, shared memory multiprocessors. In: Proceedings of symposium on operating systems principles, October 1991. ACM, New York, pp 26–40
Wang YT, Morris R (1985) Load sharing in distributed systems. IEEE Trans Comput C-34(3):204–217
Weinrib A, Gopal G (1987) Decentralized resource allocation for distributed systems. In: Proceedings of IEEE INFOCOM ’87, San Francisco, April 1987. IEEE, Washington, DC, pp 328–336
Yu OS (1974) Stochastic bounds for heterogeneous-server queues with Erlang service times. J Appl Probab 11:785–796
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Squillante, M.S. (2011). Affinity Scheduling. In: Padua, D. (eds) Encyclopedia of Parallel Computing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09766-4_41
Download citation
DOI: https://doi.org/10.1007/978-0-387-09766-4_41
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-09765-7
Online ISBN: 978-0-387-09766-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering