Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Load balancing.

Rozprawy doktorskie na temat „Load balancing”

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Load balancing”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.

1

Burrows, Richard B. P. "Dynamic load balancing." Thesis, University of Oxford, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.363886.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Nagel, Lars. "Randomised load balancing." Thesis, Durham University, 2011. http://etheses.dur.ac.uk/3207/.

Pełny tekst źródła
Streszczenie:
Due to the increased use of parallel processing in networks and multi-core architectures, it is important to have load balancing strategies that are highly efficient and adaptable to specific requirements. Randomised protocols in particular are useful in situations in which it is costly to gather and update information about the load distribution (e.g. in networks). For the mathematical analysis randomised load balancing schemes are modelled by balls-into-bins games, where balls represent tasks and bins computers. If m balls are allocated to n bins and every ball chooses one bin at random, the
Style APA, Harvard, Vancouver, ISO itp.
3

Clifton, Christopher W. "Dynamic load balancing." Thesis, Massachusetts Institute of Technology, 1986. http://hdl.handle.net/1721.1/81504.

Pełny tekst źródła
Streszczenie:
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1986.<br>MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING<br>Bibliography: leaves 72-74.<br>by Christopher W. Clifton.<br>M.S.
Style APA, Harvard, Vancouver, ISO itp.
4

Friedetzky, Thomas. "Randomised dynamic load balancing." [S.l. : s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=96937979X.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Wang, Chunpu. "Distributed random load balancing." Thesis, University of British Columbia, 2017. http://hdl.handle.net/2429/61801.

Pełny tekst źródła
Streszczenie:
Low latency is highly desirable for cloud services spanning thousands of servers. With the rapid development of cloud market, the size of server farms grows fast. Hence, stringent timing requirements are needed for task scheduling in a large-scale server farm. Conventionally, the Join-the-Shortest-Queue (JSQ) algorithm, which directs an arriving task to the least loaded server, is adopted in scheduling. Despite its excellent delay performance, JSQ is throughput-limited, and thus doesn't scale well with the number of servers. There are two distributed algorithms proposed as "approximations" of
Style APA, Harvard, Vancouver, ISO itp.
6

Montag, David. "Load balancing of IP telephony." Thesis, Linköping University, Department of Computer and Information Science, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-16066.

Pełny tekst źródła
Streszczenie:
<p>In today's world, more and more phone calls are made over IP. This results in an increasing demand for scalable IP telephony equipment.</p><p>Ingate Systems AB produces firewalls specialized in handling IP telephony. They have an inherent limit in the number of concurrent phone calls that they can handle. This can be a bottleneck at high loads. There is a load balancing solution available in the platform, but it has a number of drawbacks, such as media latency and client capability requirements, limiting its usage.</p><p>Many companies provide load balancing solutions for SIP. However, it a
Style APA, Harvard, Vancouver, ISO itp.
7

Mohammad, Malik Adeel, and Saeed Muhammad Sheharyar. "Load Balancing in Microwave Networks." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-121698.

Pełny tekst źródła
Streszczenie:
Microwave links are very commonly used in carrier networks especially towards the access side. They not only ease deployment of a network but are also very cost effective. However, they bring along a multitude of challenges which are characteristic of the wireless technology. Microwave links are fickle. Being exposed to varying weather conditions, they experience bandwidth fluctuations. This is true especially in the case of links operating at higher frequencies. The unpredictable nature of microwave links makes it quite challenging to plan capacity in a network beforehand. Radio links employ
Style APA, Harvard, Vancouver, ISO itp.
8

Macharia, Geoffrey Muragori. "Cellular load distribution : dynamic load balancing in scalable multicomputers." Thesis, University of York, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.276343.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Do, Manh Duc. "Green Cloud - Load Balancing, Load Consolidation using VM Migration." TopSCHOLAR®, 2017. https://digitalcommons.wku.edu/theses/2059.

Pełny tekst źródła
Streszczenie:
Recently, cloud computing is a new trend emerging in computer technology with a massive demand from the clients. To meet all requirements, a lot of cloud data centers have been constructed since 2008 when Amazon published their cloud service. The rapidly growing data center leads to the consumption of a tremendous amount of energy even cloud computing has better improved in the performance and energy consumption, but cloud data centers still absorb an immense amount of energy. To raise company’s income annually, the cloud providers start considering green cloud concepts which gives an idea abo
Style APA, Harvard, Vancouver, ISO itp.
10

Garcia, Gasulla Marta. "Dynamic load balancing for hybrid applications." Doctoral thesis, Universitat Politècnica de Catalunya, 2017. http://hdl.handle.net/10803/406040.

Pełny tekst źródła
Streszczenie:
It is well known that load imbalance is a major source of efficiency loss in HPC (High Performance Computing) environments. The load imbalance problem has very different sources, from static ones related to the data distribution to very dynamic ones, for example, the noise of the system. In this thesis, we present DLB: Dynamic Load Balancing library. DLB is a framework to improve the efficient use of the computational resources of a computational node. With DLB we offer a dynamic solution to load imbalance problems. DLB is applied at runtime and does not need previous information to solve loa
Style APA, Harvard, Vancouver, ISO itp.
11

Pham, Vinh. "Performing Gateway Load Balancing in MANETs." Doctoral thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for telematikk, 2012. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-15131.

Pełny tekst źródła
Streszczenie:
During the last decades, the advances in Information Technology have formed the basis for increased interest and research activity in the field of ad hoc wireless multihop networks or simply ad hoc networks. This emerging technology enables internetworking between wireless nodes that are deployed in an ad hoc and temporary manner. All nodes in an ad hoc network take the role as both hosts in an end-to-end communication session, or as routers to collaboratively relay data traffic in a multihop fashion on behalf of other nodes. Furthermore, ad hoc networks are highly dynamic in nature, i.e. node
Style APA, Harvard, Vancouver, ISO itp.
12

Liang, Zhengang. "Transparent Web caching with load balancing." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ59383.pdf.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
13

Glazer, D. W. (David William). "Load balancing parallel discrete event simulations." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=39384.

Pełny tekst źródła
Streszczenie:
This thesis presents several load balancing algorithms for parallel discrete event simulations executed under both optimistic and conservative mechanisms. The algorithms rest upon recent developments in active process migration, which permits the use of dynamic strategies. Dynamic load balancing allow for re-adjustments when resource requirements vary during simulation. It is also useful when initial resource predictions are unknown or incorrect.<br>A simulated multi-processor environment (PARALLEX) was developed in order to evaluate the algorithms. Results indicate that substantial performanc
Style APA, Harvard, Vancouver, ISO itp.
14

Nuttall, Mark Patrick. "Cluster load balancing using process migration." Thesis, Imperial College London, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.267613.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
15

Maselino, Prince. "Load balancing for parallel 3D visualisation." Thesis, University of Westminster, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.442101.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
16

Predari, Maria. "Load balancing for parallel coupled simulations." Thesis, Bordeaux, 2016. http://www.theses.fr/2016BORD0369/document.

Pełny tekst źródła
Streszczenie:
Dans le contexte du calcul scientique, l'équilibrage de la charge est un problème crucial qui conditionne la performance des simulations numériques parallèles. L'objectif est de répartir la charge de travail entre un nombre de processeurs donné, afin de minimiser le temps global d'exécution. Une stratégie populaire pour résoudre ce problème consiste à modéliser la simulation à l'aide d'un graphe et à appliquer des algorithmes de partitionnement. En outre, les simulations numériques tendent à se complexifier, notamment en mixant plusieurs codes représentant des physiques différentes ou des éche
Style APA, Harvard, Vancouver, ISO itp.
17

Cronk, David. "Dynamic load balancing via thread migration." W&M ScholarWorks, 1999. https://scholarworks.wm.edu/etd/1539623961.

Pełny tekst źródła
Streszczenie:
Light-weight threads are becoming increasingly useful for parallel processing. This is particularly true for threads running in a distributed memory environment. Light-weight threads can be used to support latency hiding techniques, communication and computation overlap, and functional parallelism. Additionally, dynamic migration of light-weight threads supports both data locality and load balancing. Designing a thread migration mechanism presents some very unique and interesting challenges. One such challenge is maintaining communication between mobile threads. A potentially more difficult ch
Style APA, Harvard, Vancouver, ISO itp.
18

Elsässer, Robert. "Spectral methods for efficient load balancing strategies." [S.l.] : [s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=965647145.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
19

Ronoh, Kennedy, and Awoke Mengistie. "Load Balancing in Heterogeneous LTE-A Networks." Thesis, Linköpings universitet, Kommunikations- och transportsystem, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-81208.

Pełny tekst źródła
Streszczenie:
LTE-A is the latest cellular network technology. One feature of LTE-A is the use ofheterogeneous networks (HetNets) which consist of macro-cells and low power nodes(LPNs). One of the objectives of heterogeneous networks is to increase capacity especially inhotspot areas where there is high density of users. Due to their low transmit power, very fewusers associate with LPNs and this will result in load imbalance between LPNs and macrocells.Load balancing is therefore key issue in HetNets so as to maximize cell splitting gainsand ensure even user experiences. Cell range extension (CRE) is a tech
Style APA, Harvard, Vancouver, ISO itp.
20

Piccinini, Federico. "Dynamic load balancing based on latency prediction." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-143333.

Pełny tekst źródła
Streszczenie:
Spotify is a music streaming service that offers access to a vast music catalogue; it counts more than 24 million active users in 28 different countries. Spotify's backend is made up by a constellation of independent loosely-coupled services; each service consists of a set of replicas, running on a set of servers in multiple data centers: each request to a service needs to be routed to an appropriate replica. Balancing the load across replicas is crucial to exploit available resources in the best possible way, and to provide optimal performances to clients. The main aim of this project is expl
Style APA, Harvard, Vancouver, ISO itp.
21

El-Khatib, Khalil M. "Dynamic load balancing for clustered time warp." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape16/PQDD_0003/MQ29686.pdf.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
22

Skagos, P. Takis. "Load balancing in a heterogeneous, distributed environment." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/mq39153.pdf.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
23

El-Khatib, Khalil M. "Dynamic load balancing for clustered time warp." Thesis, McGill University, 1996. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=27311.

Pełny tekst źródła
Streszczenie:
In this thesis, we consider the problem of dynamic load balancing for parallel discrete event simulation. We focus on the optimistic synchronization protocol, Time Warp.<br>A distributed load balancing algorithm was developed, which makes use of the active process migration in Clustered Time Warp. Clustered Time Warp is a hybrid synchronization protocol; it uses an optimistic approach between the clusters and a sequential approach within the clusters. As opposed to the centralized algorithm developed by H. Avril for Clustered Time Warp, the presented load balancing algorithm is a distributed t
Style APA, Harvard, Vancouver, ISO itp.
24

Chow, Ka-po, and 周嘉寶. "Load-balancing in distributed multi-agent computing." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2000. http://hub.hku.hk/bib/B3122426X.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
25

張立新 and Lap-sun Cheung. "Load balancing in distributed object computing systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2001. http://hub.hku.hk/bib/B31224179.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
26

Muniz, Francisco Junqueira. "Parallel load-balancing on message passing architectures." Thesis, University of Southampton, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239888.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
27

Fellheimer, Eric Todd. "Dynamic load-balancing of StreamIt cluster computations." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/36763.

Pełny tekst źródła
Streszczenie:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.<br>Includes bibliographical references (p. 145-147).<br>This thesis discusses the design and implementation of a dynamic load-balancing mechanism for computationally distributed programs running on a cluster written in the StreamIt programming language. StreamIt is useful for streaming data applications such as MPEG codecs. The structure of the language carries a lot of static information, such as data rates and computational hierarchy, and therefore lends itself well to paralle
Style APA, Harvard, Vancouver, ISO itp.
28

Butt, Wajeeh U. N. "Load balancing strategies for distributed computer systems." Thesis, Loughborough University, 1993. https://dspace.lboro.ac.uk/2134/14162.

Pełny tekst źródła
Streszczenie:
The study investigates various load balancing strategies to improve the performance of distributed computer systems. A static task allocation and a number of dynamic load balancing algorithms are proposed, and their performances evaluated through simulations. First, in the case of static load balancing, the precedence constrained scheduling heuristic is defined to effectively allocate the task systems with high communication to computation ratios onto a given set of processors. Second, the dynamic load balancing algorithms are studied using a queueing theoretic model. For each algorithm, a dif
Style APA, Harvard, Vancouver, ISO itp.
29

Mäkeläinen, M. (Marko). "Algorithms for opportunistic load balancing cognitive engine." Master's thesis, University of Oulu, 2013. http://urn.fi/URN:NBN:fi:oulu-201303011071.

Pełny tekst źródła
Streszczenie:
Due to the increasing use of more and more powerful smart devices demands on the scarce radio spectrum are becoming more intense. One way to cope with increasing demands on radio spectrum is to apply innovative and flexible authorization schemes like spectrum sharing. Under the spectrum sharing paradigm, multiple users and/or systems are authorized to utilize the same spectrum band in a defined sharing agreement. A technology that is generally recommended for the implementation of spectrum sharing is called cognitive radio (CR). In this thesis, we design and implement a cognitive engine (CE) t
Style APA, Harvard, Vancouver, ISO itp.
30

Iyer, Sundar. "Load balancing and parallelism for the internet /." May be available electronically:, 2008. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
31

Chow, Ka-po. "Load-balancing in distributed multi-agent computing /." Hong Kong : University of Hong Kong, 2000. http://sunzi.lib.hku.hk:8888/cgi-bin/hkuto%5Ftoc%5Fpdf?B2295644x.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
32

Cheung, Lap-sun. "Load balancing in distributed object computing systems." Hong Kong : University of Hong Kong, 2001. http://sunzi.lib.hku.hk/hkuto/record.jsp?B2329428.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
33

Kumar, Rahul. "Load Balancing Parallel Explicit State Model Checking." Diss., CLICK HERE for online access, 2004. http://contentdm.lib.byu.edu/ETD/image/etd455.pdf.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
34

Wallace, Brian T. "Automated system for load-balancing EBGP peers." [Gainesville, Fla.] : University of Florida, 2004. http://purl.fcla.edu/fcla/etd/UFE0008800.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
35

Adams, Daniel Alan. "Optimal Load Balancing in a Beowulf Cluster." Link to electronic thesis, 2005. http://www.wpi.edu/Pubs/ETD/Available/etd-050205-135758/.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
36

Lu, Kai. "Decentralized load balancing in heterogeneous computational grids." Thesis, The University of Sydney, 2007. http://hdl.handle.net/2123/9382.

Pełny tekst źródła
Streszczenie:
With the rapid development of high-speed wide-area networks and powerful yet low-cost computational resources, grid computing has emerged as an attractive computing paradigm. The space limitations of conventional distributed systems can thus be overcome, to fully exploit the resources of under-utilised computing resources in every region around the world for distributed jobs. Workload and resource management are key grid services at the service level of grid software infrastructure, where issues of load balancing represent a common concern for most grid infrastructure developers. Although
Style APA, Harvard, Vancouver, ISO itp.
37

Cosenza, Biagio. "Efficient distributed load balancing for parallel algorithms." Doctoral thesis, Universita degli studi di Salerno, 2011. http://hdl.handle.net/10556/205.

Pełny tekst źródła
Streszczenie:
2009 - 2010<br>With the advent of massive parallel processing technology, exploiting the power offered by hundreds, or even thousands of processors is all but a trivial task. Computing by using multi-processor, multi-core or many-core adds a number of additional challenges related to the cooperation and communication of multiple processing units. The uneven distribution of data among the various processors, i.e. the load imbalance, represents one of the major problems in data parallel applications. Without good load distribution strategies, we cannot reach good speedup, thus good effic
Style APA, Harvard, Vancouver, ISO itp.
38

Igbe, Damian. "Dynamic load balancing of parallel road traffic simulation." Thesis, University of Westminster, 2010. https://westminsterresearch.westminster.ac.uk/item/90644/dynamic-load-balancing-of-parallel-road-traffic-simulation.

Pełny tekst źródła
Streszczenie:
The objective of this research was to investigate, develop and evaluate dynamic load-balancing strategies for parallel execution of microscopic road traffic simulations. Urban road traffic simulation presents irregular, and dynamically varying distributed computational load for a parallel processor system. The dynamic nature of road traffic simulation systems lead to uneven load distribution during simulation, even for a system that starts off with even load distributions. Load balancing is a potential way of achieving improved performance by reallocating work from highly loaded processors to
Style APA, Harvard, Vancouver, ISO itp.
39

Korzeniowski, Miroslaw. "Dynamic load balancing in peer-to-peer networks." [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=983620296.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
40

Ljungkvist, Karl. "Autonomic Dynamic Load Balancing of Parallel SAMR Applications." Thesis, Uppsala universitet, Avdelningen för teknisk databehandling, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-155517.

Pełny tekst źródła
Streszczenie:
When solving partial differential equations using finite difference methods on structured meshes, adaptive refinement can be used to increase the accuracy of the solution in an efficient manner. When implementing solvers using structured adaptive mesh refinement for modern parallel computer systems, an important task is the partitioning of the grid hierarchy over the available processors. The Meta-partitioner is an autonomic framework which can dynamically select between a large number of grid-partitioning algorithms at run time. In this thesis we investigate which modifications that are neces
Style APA, Harvard, Vancouver, ISO itp.
41

Schlimbach, Frank. "Optimising subdomain aspect ratios for parallel load balancing." Thesis, University of Greenwich, 2000. http://gala.gre.ac.uk/6293/.

Pełny tekst źródła
Streszczenie:
In parallel adaptive Finite Element simulations the work load 011the individual processors can change frequently. To (re)distribute the load evenly over the processors a load balancing heuristic is needed. Common strategies try to minimise subdomain dependencies by minimising the number of cut edges in the partition. For many solvers this is the most influential factor. However for example, for certain preconditioned Conjugate Gradient solvers this cutsize can play only a minor role, but their convergence can be highly dependent on the subdomain shapes. Degenerated subdomain shapes can cause t
Style APA, Harvard, Vancouver, ISO itp.
42

Cai, Haiying. "Dynamic load balancing on the EARTH-SP system." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape16/PQDD_0006/MQ29667.pdf.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
43

Khanna, Varun. "Intelligent load balancing in mobile ad hoc networks." Thesis, Wichita State University, 2010. http://hdl.handle.net/10057/3729.

Pełny tekst źródła
Streszczenie:
On demand ad hoc routing protocols such as AODV and DSR do not look for new routes unless there is a change in the network topology. In scenarios where same intermediate node is used for longer time, this behavior may cause the traffic concentration on few intermediate nodes resulting in large latency and depletion of battery power at the nodes. To overcome this problem, a load balancing algorithm is proposed in this thesis. Each node forwards its residual energy information to all its neighbor nodes using reserved fields in the hello packets. Each node calculates a desirability metric, for ea
Style APA, Harvard, Vancouver, ISO itp.
44

Cai, Haïying. "Dynamic load balancing on the earth-SP system." Thesis, McGill University, 1997. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=27292.

Pełny tekst źródła
Streszczenie:
The rapid progress of computer systems based on fine-grain multithreaded program execution models introduce both unique opportunities and challenges in the design and application of dynamic load balancing algorithms. This thesis presents a study of dynamic load balancing under the EARTH muitithreaded model.<br>In this study, we have implemented a number of load balancing algorithms on the EARTH-SP testbed--a realization of EARTH model on the IBM-SP2 system. Our study has been carried out on both benchmark programs and a set of stress tests. The major results of this thesis include: (A) Demonst
Style APA, Harvard, Vancouver, ISO itp.
45

Du, Lin. "Intelligent geographic load balancing for mobile cellular networks." Thesis, Queen Mary, University of London, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.414466.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
46

須成忠 and Cheng-zhong Xu. "Iterative methods for dynamic load balancing in multicomputers." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1993. http://hub.hku.hk/bib/B31233302.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
47

Liu, Zhenhua. "Greening Geographical Load Balancing." Thesis, 2011. https://thesis.library.caltech.edu/6442/2/ZhenhuaLiu_MS_Thesis.pdf.

Pełny tekst źródła
Streszczenie:
<p>Energy expenditure has become a significant fraction of data center operating costs. Recently, "geographical load balancing" has been suggested to reduce energy cost by exploiting the electricity price differences across regions. However, this reduction of cost can paradoxically increase total energy use. This work explores whether the geographical diversity of internet-scale systems can additionally be used to provide environmental gains.</p> <p>We first focus on geographical load balancing, which is modeled as a convex optimization problem. We derive two distributed algorithms for ach
Style APA, Harvard, Vancouver, ISO itp.
48

DEEPTI. "LOAD BALANCING IN CLOUD COMPUTING." Thesis, 2014. http://dspace.dtu.ac.in:8080/jspui/handle/repository/15432.

Pełny tekst źródła
Streszczenie:
The advent of cloud computing in recent years has sparked an interest from different organizations, institutions and users to take advantage of services and applications. Because of serving a very attractive package of services, cloud technology has grasped a huge attention from academia, IT industry and government organizations. Cloud computing promises scalability and on-demand availability of resources. As the number of users on the internet goes on increasing, it becomes difficult to handle the millions of user requests on it. Many a times it happens during the peak-hours that the tr
Style APA, Harvard, Vancouver, ISO itp.
49

Tung-Wei, Yang. "Dynamic Load Balancing for Multiple Processors." 2005. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0001-1307200518393900.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
50

Singh, Sarabjot active 21st century. "Load balancing in heterogeneous cellular networks." Thesis, 2014. http://hdl.handle.net/2152/28387.

Pełny tekst źródła
Streszczenie:
Pushing wireless data traffic onto small cells is important for alleviating congestion in the over-loaded macrocellular network. However, the ultimate potential of such load balancing and its effect on overall system performance is not well understood. With the ongoing deployment of multiple classes of access points (APs) with each class differing in transmit power, employed frequency band, and backhaul capacity, the network is evolving into a complex and “organic” heterogeneous network or HetNet. Resorting to system-level simulations for design insights is increasingly prohibitive with such g
Style APA, Harvard, Vancouver, ISO itp.
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!