Allocating Independent Subtasks on Parallel Processors
IEEE Transactions on Software Engineering
Parallel processing: the Cm* experience
Parallel processing: the Cm* experience
The Crystal Multicomputer: Design and Implementation Experience
IEEE Transactions on Software Engineering
The duality of memory and communication in the implementation of a multiprocessor operating system
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
Guided self-scheduling: A practical scheduling scheme for parallel supercomputers
IEEE Transactions on Computers
PRESTO: a system for object-oriented parallel programming
Software—Practice & Experience
Speedup Versus Efficiency in Parallel Systems
IEEE Transactions on Computers
The Performance Implications of Thread Management Alternatives for Shared-Memory Multiprocessors
IEEE Transactions on Computers
Mean-Value Analysis of Closed Multichain Queuing Networks
Journal of the ACM (JACM)
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Scheduler activations: effective kernel support for the user-level management of parallelism
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
Characterizing memory hot spots in a shared memory MIMD machine
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Scheduler activations: effective kernel support for the user-level management of parallelism
ACM Transactions on Computer Systems (TOCS)
A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors
ACM Transactions on Computer Systems (TOCS)
Chores: enhanced run-time support for shared-memory parallel computing
ACM Transactions on Computer Systems (TOCS)
Using scheduler information to achieve optimal barrier synchronization performance
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Spin-block synchronization algorithm in the shared memory multiprocessor system
ACM SIGOPS Operating Systems Review
High performance synchronization algorithms for multiprogrammed multiprocessors
PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
Scheduler-conscious synchronization
ACM Transactions on Computer Systems (TOCS)
Empirical studies of competitve spinning for a shared-memory multiprocessor
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
First-class user-level threads
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
WOSP '02 Proceedings of the 3rd international workshop on Software and performance
Characterizing the Performance of Algorithms for Lock-Free Objects
IEEE Transactions on Computers
Design Considerations for Shared Memory Multiprocessor Message Systems
IEEE Transactions on Parallel and Distributed Systems
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Thread prioritization: a thread scheduling mechanism for multiple-context parallel processors
HPCA '95 Proceedings of the 1st IEEE Symposium on High-Performance Computer Architecture
Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects
IEEE Transactions on Parallel and Distributed Systems
A softerware monitor for shared-memory multiprocessor computers
Software—Practice & Experience
Hardware support for spin management in overcommitted virtual machines
Proceedings of the 15th international conference on Parallel architectures and compilation techniques
Towards scalable multiprocessor virtual machines
VM'04 Proceedings of the 3rd conference on Virtual Machine Research And Technology Symposium - Volume 3
LFTHREADS: a lock-free thread library
ACM SIGARCH Computer Architecture News
LFTHREADS: a lock-free thread library
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
| Hi-index | 0.00 |
Spinning, or busy waiting, is commonly employed in parallel processors when threads ofexecution must wait for some event, such as synchronization with another thread.Because spinning is purely overhead, it is detrimental to both user response time and system throughput. The effects of two environmental factors, multiprogramming and data-dependent execution times, on spinning are discussed, and it is shown how the choice of scheduling discipline can be used to reduce the amount of spinning in each case.