نتایج جستجو برای: work load balancing received

تعداد نتایج: 1358872  

2001
Hans-Wolfgang Loidl

Parallel graph reducers such as GUM use dynamic techniques to manage resources during execution. One important aspect of the dynamic behaviour is the distribution of work. The load balancing mechanism, which controls this aspect, should be flexible, to adjust the distribution of work to hardware characteristics as well as dynamic program characteristics, and scalable, to achieve high utilisatio...

2016
ZHANJUN LIU Zhanjun Liu Xia Peng Yue Shen Jinnan Zhan Yu Liu

In wireless communication networks, the load balancing mechanism can improve the frequency utilization and reduce the outage rate. Furthermore, the user cooperation is used to enhance the SNR of the edge user. Therefore, in cooperative wireless communication network, the cooperation probability is introduced in the handover decision function of existing load balancing mechanisms which are based...

2006
Georgios Kambourakis Dimitris Geneiatakis Tasos Dagiuklas Costas Lambrinoudakis Stefanos Gritzalis

Session Initiation Protocol (SIP) high availability, reliability and redundancy are determined by the ability of the core SIP network components to offer high quality SIP services in the event(s) of high call transactions, link outages, device failures, misconfigurations and security attacks. In this context, load balancers can be used to achieve redundancy and active load balancing of SIP tran...

2000
CHUCK A. BAKER

– The preliminary design space exploration for large, interdisciplinary engineering problems is often a difficult and time-consuming task. General techniques are needed that efficiently and methodically search the design space. This work focuses on the use of parallel load balancing techniques integrated with a global optimizer to reduce the computational time of the design space exploration. T...

2014
Hesham A. Hefny Mohamed Helmy Khafagy Ahmed M Wahdan

MapReduce is a famous model for data-intensive parallel computing in shared-nothing clusters. One of the main issues in MapReduce is the fact of depending its performance mainly on data distribution. MapReduce contains simple load balance technique based on FIFO job scheduler that serves the jobs in their submission order but unfortunately it is insufficient in real world cases as it missed man...

1997
J. E. Flaherty R. M. Loy P. C. Scully M. S. Shephard B. K. Szymanski J. D. Teresco L. H. Ziantz

This paper describes predictive load balancing schemes designed for use with parallel adaptive finite element methods. We provide an overview of data structures suitable for distributed storage of finite element mesh data as well as software designed for mesh adaptation and load balancing. During the course of a parallel computation, processor load imbalances are introduced at adaptive enrichme...

1997
Joseph E. Flaherty Raymond M. Loy P. C. Scully Mark S. Shephard Boleslaw K. Szymanski James D. Teresco Louis H. Ziantz

This paper describes predictive load balancing schemes designed for use with parallel adaptive finite element methods. We provide an overview of data structures suitable for distributed storage of finite element mesh data as well as software designed for mesh adaptation and load balancing. During the course of a parallel computation, processor load imbalances are introduced at adaptive enrichme...

2013
Surabhi Jain Deepak Sharma

-Cloud Computing is a term, which involves virtualization, distributed computing, networking, software and web services. A cloud consists of several elements such as clients, datacenter and distributed servers. Central to these issues lies the establishment of an effective load balancing algorithm. The load can be CPU load, memory capacity, delay or network load. Load balancing is the process o...

Journal: :IEEE Trans. Knowl. Data Eng. 1998
Shashi Shekhar Sivakumar Ravada Vipin Kumar Douglas Chubb Greg Turner

Declustering and load-balancing are important issues in designing a high performance geographic information system (HPGIS) which is a central component of many interactive applications such as real-time terrain visualization. The current literature provides eecient methods for declustering spatial point-data. However, there has been little work towards developing eecient declustering methods fo...

Journal: :J. Parallel Distrib. Comput. 1996
Joseph Gil Yossi Matias

Parallel algorithms are often rst designed as a sequence of rounds where each round includes any number of independent constant time operations This so called work time presentation is then followed by a processor scheduling implementation on a more concrete computational model Many parallel algorithms are geometric decaying in the sense that the sequence of work loads is upper bounded by a dec...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید