Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Process migration
DS Milojičić, F Douglis, Y Paindaveine… - ACM Computing …, 2000 - dl.acm.org
Process migration is the act of transferring a process between two machines. It enables
dynamic load distribution, fault resilience, eased system administration, and data access …
dynamic load distribution, fault resilience, eased system administration, and data access …
Join-idle-queue: A novel load balancing algorithm for dynamically scalable web services
The prevalence of dynamic-content web services, exemplified by search and online social
networking, has motivated an increasingly wide web-facing front end. Horizontal scaling in …
networking, has motivated an increasingly wide web-facing front end. Horizontal scaling in …
A logarithmic reduction algorithm for quasi-birth-death processes
G Latouche, V Ramaswami - Journal of Applied Probability, 1993 - cambridge.org
Quasi-birth-death processes are commonly used Markov chain models in queueing theory,
computer performance, teletraffic modeling and other areas. We provide a new, simple …
computer performance, teletraffic modeling and other areas. We provide a new, simple …
Using processor affinity in loop scheduling on shared-memory multiprocessors
EP Markatos, TJ LeBlanc - IEEE Transactions on Parallel and …, 1994 - ieeexplore.ieee.org
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 …
this parallelism is to execute loop iterations in parallel on different processors. Previous …
Using processor-cache affinity information in shared-memory multiprocessor scheduling
MS Squillante, ED Lazowska - Ieee transactions on parallel …, 1993 - ieeexplore.ieee.org
In a shared-memory multiprocessor system, it may be more efficient to schedule a task on
one processor than on another if relevant data already reside in a particular processor's …
one processor than on another if relevant data already reside in a particular processor's …
Scheduling and page migration for multiprocessor compute servers
R Chandra, S Devine, B Verghese, A Gupta… - ACM SIGOPS …, 1994 - dl.acm.org
Several cache-coherent shared-memory multiprocessors have been developed that are
scalable and offer a very tight coupling between the processing resources. They are …
scalable and offer a very tight coupling between the processing resources. They are …
A mean field model of work stealing in large-scale systems
In this paper, we consider a generic model of computational grids, seen as several clusters
of homogeneous processors. In such systems, a key issue when designing efficient job …
of homogeneous processors. In such systems, a key issue when designing efficient job …
Scheduling parallel computations by work stealing: A survey
J Yang, Q He - International Journal of Parallel Programming, 2018 - Springer
Work stealing has been proven to be an efficient technique for scheduling parallel
computations, and has been gaining popularity as the multiprocessor/multicore-processor …
computations, and has been gaining popularity as the multiprocessor/multicore-processor …
[PDF][PDF] Network processor load balancing for high-speed links
G Dittmann, A Herkersdorf - … of the 2002 International Symposium on …, 2002 - Citeseer
While transmission rates already achieve speeds beyond 40 Gb/s, today's network
processors are only slowly approaching 10 Gb/s. In this paper we present a load-balancing …
processors are only slowly approaching 10 Gb/s. In this paper we present a load-balancing …
[PDF][PDF] Using Processor A nity in Loop Scheduling on Shared-Memory Multiprocessors
EP Markatos, TJ LeBlanc - Proc. Supercomputing, 1992 - projects.ics.forth.gr
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 di erent processors. Previous …
this parallelism is to execute loop iterations in parallel on di erent processors. Previous …