Results 1 - 10 of 66,688

R.H. Thomas and W. Crowther. "The Uniform System: An Approach to Runtime Support for Large

by Processing Pages St , 1993
"... Introduction to Parallel Computing. Prentice Hall, Englewood Cliffs, NJ, 1992. [19] Steven Lucco. "A Dynamic Scheduling Method for Irregular Parallel Programs". In ACM SIGPLAN '92 Conference on Programming Language Design and Implementation, pages 200-211, San Francisco, CA, June 199 ..."
Abstract - Add to MetaCart
Multiprocessor Trends and the Implications for Parallel Program Performance". Technical Report 420, University of Rochester, Computer Science Department, March 1992. [22] C. McCann, R. Vaswani, and J. Zahorjan. "A Dynamic Processor Allocation Policy for Multiprogrammed Shared Memory Multiprocessors

Multiprogramming On Multiprocessors

by Mark Crovella , 1991
"... ska. "Using Processor-Cache affinity Information in Shared-Memory Multiprocessor Scheduling". Technical Report 89-06-01, Department of of Computer Science and Engineering, University of Washington, February 1990. R.H. Thomas and W. Crowther. "The Uniform System: An Approach to Runtim ..."
Abstract - Cited by 45 (1 self) - Add to MetaCart
to Runtime Support for Large Scale Shared Memory Parallel Processors". In Proc. 1987 International Conference on Parallel Processing, pages 245-254, August 1987. A. Tucker and A. Gupta. "Process Control and Scheduling Issues for Multiprogrammed Shared-Memory Multiprocessors". In Proceedings

Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors

by John M. Mellor-crummey, Michael L. Scott - ACM Transactions on Computer Systems , 1991
"... Busy-wait techniques are heavily used for mutual exclusion and barrier synchronization in shared-memory parallel programs. Unfortunately, typical implementations of busy-waiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become marke ..."
Abstract - Cited by 567 (32 self) - Add to MetaCart
-accessible ag variables, and for some other processor to terminate the spin with a single remote write operation at an appropriate time. Flag variables may be locally-accessible as a result of coherent caching, or by virtue of allocation in the local portion of physically distributed shared memory. We present a

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

by C.L. Liu, James Layland , 1973
"... The problem of multiprogram scheduling on a single processor is studied from the viewpoint... ..."
Abstract - Cited by 3712 (2 self) - Add to MetaCart
The problem of multiprogram scheduling on a single processor is studied from the viewpoint...

Processor Scheduling in Multiprogrammed Shared Memory NUMA Multiprocessors

by Chee-Shong Wu , 1993
"... In a multiprogrammed multiprocessor, the scheduler is not only responsible for deciding when to activate an application and when to suspend it, but is also responsible for determining how many processors to allocate to each application. In a scalable NUMA multiprocessor, it must further resolve the ..."
Abstract - Cited by 10 (0 self) - Add to MetaCart
In a multiprogrammed multiprocessor, the scheduler is not only responsible for deciding when to activate an application and when to suspend it, but is also responsible for determining how many processors to allocate to each application. In a scalable NUMA multiprocessor, it must further resolve

User-Level Dynamic Page Migration for Multiprogrammed Shared-Memory Multiprocessors

by Dimitrios S. Nikolopoulos, Theodore S. Papatheodorou Constantine D. Polychronopoulos, Theodore S. Papatheodorou, Constantine D. Polychronopoulos, Jesus Labarta, Eduard Ayguadé , 2000
"... This paper presents algorithms for improving the performance of parallel programs on multiprogrammed sharedmemory NUMA multiprocessors, via the use of user-level dynamic page migration. The idea that drives the algorithms is that a page migration engine can perform accurate and timely page migration ..."
Abstract - Cited by 29 (5 self) - Add to MetaCart
This paper presents algorithms for improving the performance of parallel programs on multiprogrammed sharedmemory NUMA multiprocessors, via the use of user-level dynamic page migration. The idea that drives the algorithms is that a page migration engine can perform accurate and timely page

Using Processor Affinity in Loop Scheduling on Shared-Memory Multiprocessors

by Evangelos P. Markatos, Thomas J. Leblanc - IEEE Transactions on Parallel and Distributed Systems , 1994
"... Loops are the single largest source of parallelism in many applications. One way to exploit this parallelism is to execute loop iterations in parallel on different processors. Previous approaches to loop scheduling attempt to achieve the minimum completion time by distributing the workload as evenly ..."
Abstract - Cited by 157 (2 self) - Add to MetaCart
scheduling, which ignore the location of data when assigning iterations to processors, incur a significant performance penalty on modern shared-memory multiprocessors. We propose a new loop scheduling algorithm that attempts to simultaneously balance the workload, minimize synchronization, and co-locate loop

Multiscalar Processors

by Gurindar S. Sohi, Scott E. Breach, T. N. Vijaykumar - In Proceedings of the 22nd Annual International Symposium on Computer Architecture , 1995
"... Multiscalar processors use a new, aggressive implementation paradigm for extracting large quantities of instruction level parallelism from ordinary high level language programs. A single program is divided into a collection of tasks by a combination of software and hardware. The tasks are distribute ..."
Abstract - Cited by 585 (30 self) - Add to MetaCart
Multiscalar processors use a new, aggressive implementation paradigm for extracting large quantities of instruction level parallelism from ordinary high level language programs. A single program is divided into a collection of tasks by a combination of software and hardware. The tasks

User-Level Dynamic Page Migration for Multiprogrammed Shared-Memory Multiprocessors

by Dimitrios Nikolopoulos Theodore, Theodore S. Papatheodorou, Constantine D. Polychronopoulos, Jesus Labarta, Eduard Ayguade , 2000
"... This paper presents algorithms for improving the performance of parallel programs on multiprogrammed sharedmemory NUMA multiprocessors, via the use of user-level dynamic page migration. The idea that drives the algorithms is that a page migration engine can perform accurate and timely page migration ..."
Abstract - Add to MetaCart
This paper presents algorithms for improving the performance of parallel programs on multiprogrammed sharedmemory NUMA multiprocessors, via the use of user-level dynamic page migration. The idea that drives the algorithms is that a page migration engine can perform accurate and timely page

User-Level Dynamic Page Migration for Multiprogrammed Shared-Memory Multiprocessors

by Dimitrios S. Nikolopoulos Ý, Theodore S. Papatheodorou Ý, Constantine D. Polychronopoulos Þ, Jesús Labarta Ü, Eduard Ayguadé Ü
"... This paper presents algorithms for improving the performance of parallel programs on multiprogrammed sharedmemory NUMA multiprocessors, via the use of user-level dynamic page migration. The idea that drives the algorithms is that a page migration engine can perform accurate and timely page migration ..."
Abstract - Add to MetaCart
This paper presents algorithms for improving the performance of parallel programs on multiprogrammed sharedmemory NUMA multiprocessors, via the use of user-level dynamic page migration. The idea that drives the algorithms is that a page migration engine can perform accurate and timely page
Results 1 - 10 of 66,688