Log in

Relevant bibliographies by topics / Dynamic resource sharing / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Dynamic resource sharing.

Dissertations / Theses on the topic 'Dynamic resource sharing'

Author: Grafiati

Published: 4 June 2021

Last updated: 4 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 19 dissertations / theses for your research on the topic 'Dynamic resource sharing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Larrañaga, Maialen. "Dynamic control of stochastic and fluid resource-sharing systems." Thesis, Toulouse, INPT, 2015. http://www.theses.fr/2015INPT0075/document.

Full text

Abstract:

Dans cette thèse, nous étudions le contrôle dynamique des systèmes de partage de ressources qui se posent dans divers domaines : réseaux de gestion des stocks, services de santé, réseaux de communication, etc. Nous visons à allouer efficacement les ressources disponibles entre des projets concurrents, selon certains critères de performance. Ce type de problème est de nature stochastique et peut être très complexe à résoudre. Nous nous concentrons donc sur le développement de méthodes heuristiques performantes. Dans la partie I, nous nous plaçons dans le cadre des Restless Bandit Problems, qui

APA, Harvard, Vancouver, ISO, and other styles

2

Bennis, M. (Mehdi). "Spectrum sharing for future mobile cellular systems." Doctoral thesis, University of Oulu, 2009. http://urn.fi/urn:isbn:9789514260582.

Full text

Abstract:

Abstract Spectrum sharing has become a high priority research area over the past few years. The motivation behind this lies in the fact that the limited spectrum is currently inefficiently utilized. As recognized by the World radio communication conference (WRC)-07, the amount of identified spectrum is not large enough to support large bandwidths for a substantial number of operators. Therefore, it is paramount for future mobile cellular systems to share the frequency spectrum and coexist in a more efficient manner. The present dissertation deals with the problem of spectrum scarcity by exam

APA, Harvard, Vancouver, ISO, and other styles

3

Joshi, S. K. (Satya Krishna). "Radio resource allocation techniques for MISO downlink cellular networks." Doctoral thesis, Oulun yliopisto, 2018. http://urn.fi/urn:isbn:9789526217437.

Full text

Abstract:

Abstract This thesis examines radio resource management techniques for multicell multi-input single-output (MISO) downlink networks. Specifically, the thesis focuses on developing linear transmit beamforming techniques by optimizing certain quality-of-service (QoS) features, including, spectral efficiency, fairness, and throughput. The problem of weighted sum-rate-maximization (WSRMax) has been identified as a central problem to many network optimization methods, and it is known to be NP-hard. An algorithm based on a branch and bound (BB) technique which globally solves the WSRMax problem with

APA, Harvard, Vancouver, ISO, and other styles

4

Raza, Muhammad Rehan. "Flexible and Programmable 5G Transport Networks." Licentiate thesis, KTH, Optical Network Laboratory (ON Lab), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-196525.

Full text

Abstract:

The advent of 5th generation of mobile networks (5G) will introduce some new challenges for the transport network. Different strategies can be employed by the network providers to address these challenges with the aim to achieve an efficient utilization of network resources. The most feasible option to achieve this goal is to introduce intelligence in the transport infrastructure by designing a flexible and programmable transport network. Network function virtualization (NFV) and dynamic resource sharing (DRS) are two possible techniques for realizing a flexible transport network. NFV allows t

APA, Harvard, Vancouver, ISO, and other styles

5

Gary, Michael Shayne. "The dynamics of resource sharing in related diversification : a feedback simulation modelling approach." Thesis, London Business School (University of London), 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.325689.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Lefevre, Olivier. "Contrôle endogène des systêmes multi-agents pour la résolution de problèmes complexes." Phd thesis, Université Claude Bernard - Lyon I, 2010. http://tel.archives-ouvertes.fr/tel-00838773.

Full text

Abstract:

Ces travaux abordent la problématique du contrôle endogène dans les Systèmes Multi-Agents (SMA) pour la résolution de problèmes complexes, que nous explorons grâce au problème de partage de ressources critiques. Les problèmes dits complexes que nous abordons se caractérisent par une explosion combinatoire du nombre de solutions avec la taille des problèmes, une forte dynamique des données du problème induite par un environnement ouvert dans lequel de nombreux événements peuvent avoir lieu, une grande complexité systémique issue des interdépendances entre les nombreuses variables du problèmes e

APA, Harvard, Vancouver, ISO, and other styles

7

Renaud-Goud, Paul. "Energy-aware scheduling : complexity and algorithms." Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2012. http://tel.archives-ouvertes.fr/tel-00744247.

Full text

Abstract:

In this thesis we have tackled a few scheduling problems under energy constraint, since the energy issue is becoming crucial, for both economical and environmental reasons. In the first chapter, we exhibit tight bounds on the energy metric of a classical algorithm that minimizes the makespan of independent tasks. In the second chapter, we schedule several independent but concurrent pipelined applications and address problems combining multiple criteria, which are period, latency and energy. We perform an exhaustive complexity study and describe the performance of new heuristics. In the third c

APA, Harvard, Vancouver, ISO, and other styles

8

Yu-Ping, Chiang. "Attribute-Based Overlay for Dynamic Resource Sharing." 2006. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0016-1303200709332310.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Chiang, Yu-Ping, and 姜毓平. "Attribute-Based Overlay for Dynamic Resource Sharing." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/17469157339210800742.

Full text

Abstract:

碩士<br>國立清華大學<br>資訊工程學系<br>94<br>The search targets in traditional P2P networks are often files or people, and the names of the files or people are the primary attribute for lookup to locate the target. A distinct feature of these applications is that the name attribute do not change with time. However in applications such as P2P computing and streaming that require quality resources, the search targets may be CPU cycles, memory space, and network bandwidth. The status of these targets may change when they are used and their search attributes may differ with time. Traditional P2P systems which

APA, Harvard, Vancouver, ISO, and other styles

10

Katramatos, Dimitrios. "Dynamic resource sharing mechanisms for high-performance heterogeneous clusters /." 2005. http://wwwlib.umi.com/dissertations/fullcit/3149208.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Larranaga, Maialen. "Dynamic control of stochastic and fluid resource-sharing systems." Phd thesis, 2015. http://oatao.univ-toulouse.fr/14494/1/Larranaga_Maialen_INP.pdf.

Full text

Abstract:

In this thesis we study the dynamic control of resource-sharing systems that arise in various domains: e.g. inventory management, healthcare and communication networks. We aim at efficiently allocating the available resources among competing projects according to a certain performance criteria. These type of problems have a stochastic nature and may be very complex to solve. We therefore focus on developing well-performing heuristics. In Part I, we consider the framework of Restless Bandit Problems, which is a general class of dynamic stochastic optimization problems. Relaxing the sample-path

APA, Harvard, Vancouver, ISO, and other styles

12

Subramoniam, Kumaran. "Dynamic multilateral peering : an efficient mechanism for controlled resource sharing." 2004. http://hdl.handle.net/1993/15745.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

(11197803), Mai Zhang. "Adaptive Transmission and Dynamic Resource Allocation in Collaborative Communication Systems." Thesis, 2021.

Find full text

Abstract:

With the ever-growing demand for higher data rate in next generation communication systems, researchers are pushing the limits of the existing architecture. Due to the stochastic nature of communication channels, most systems use some form of adaptive methods to adjust the transmitting parameters and allocation of resources in order to overcome channel variations and achieve optimal throughput. We will study four cases of adaptive transmission and dynamic resource allocation in collaborative systems that are practically significant. Firstly, we study hybrid automatic repeat request (HARQ) tech

APA, Harvard, Vancouver, ISO, and other styles

14

"Efficient Routing and Resource Sharing Mechanisms for Hybrid Optical-Wireless Access Networks." Doctoral diss., 2016. http://hdl.handle.net/2286/R.I.38457.

Full text

Abstract:

abstract: The integration of passive optical networks (PONs) and wireless mesh networks (WMNs) into Fiber-Wireless (FiWi) networks has recently emerged as a promising strategy for providing flexible network services at relative high transmission rates. This work investigates the effectiveness of localized routing that prioritizes transmissions over the local gateway to the optical network and avoids wireless packet transmissions in radio zones that do not contain the packet source or destination. Existing routing schemes for FiWi networks consider mainly hop-count and delay metrics over a fla

APA, Harvard, Vancouver, ISO, and other styles

15

Qaimkhani, Irshad Ali. "Improving Frequency Reuse and Cochannel Interference Coordination in 4G HetNets." Thesis, 2013. http://hdl.handle.net/10012/7807.

Full text

Abstract:

This report describes my M.A.Sc. thesis research work. The emerging 4th generation (4G) mobile systems and networks (so called 4G HetNets) are designed as multilayered cellular topology with a number of asymmetrically located, asymmetrically powered, self-organizing, and user-operated indoor small cell (e.g., pico/femto cells and WLANs) with a variety of cell architectures that are overlaid by a large cell (macro cell) with some or all interfering wireless links. These designs of 4G HetNets bring new challenges such as increased dynamics of user mobility and data traffic trespassing over the

APA, Harvard, Vancouver, ISO, and other styles

16

Reyes, Miguel Angel. "Dynamic sharing of the system resources in multilevel secure system." Thesis, 1986. http://hdl.handle.net/10945/21798.

Full text

Abstract:

This thesis represents a preliminary step in the development of a reliable application program simulating an operating system which handles several multi-security-level users dynamically sharing system resources in the Gemini Trusted Multiple Microcomputer Base machine. The proposed design presents the necessary steps to follow when working in a multilevel configuration. The use of primitives that support the application design are explained along with a description of the implementation of this application using Janus/Ada language. In addition, security constraints are identified and system t

APA, Harvard, Vancouver, ISO, and other styles

17

Huang, Chih-Shung, and 黃志祥. "Scheduling Sporadic, Hard Real-time Tasks with Resources Sharing via Dynamic Voltage Scaling Approach." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/95585263485632198314.

Full text

Abstract:

碩士<br>國立成功大學<br>資訊工程學系碩博士班<br>93<br>Dynamic voltage scaling (DVS) algorithms save energy by scaling down the processor frequency when the processor is not fully loaded. How to schedule the sporadic, hard real-time tasks with shared resource in a power saving way is still an open problem. Thus, in the thesis, the problem of power aware scheduling for sporadic tasks that share a set of serially reusable, single unit software resources is considered. The goals of this work are that (1) each release of each task should be completed before a well-defined deadline, (2) a resource is serially used by

APA, Harvard, Vancouver, ISO, and other styles

18

"Shared Mobility Optimization in Large Scale Transportation Networks: Methodology and Applications." Doctoral diss., 2018. http://hdl.handle.net/2286/R.I.49355.

Full text

Abstract:

abstract: Optimization of on-demand transportation systems and ride-sharing services involves solving a class of complex vehicle routing problems with pickup and delivery with time windows (VRPPDTW). Previous research has made a number of important contributions to the challenging pickup and delivery problem along different formulation or solution approaches. However, there are a number of modeling and algorithmic challenges for a large-scale deployment of a vehicle routing and scheduling algorithm, especially for regional networks with various road capacity and traffic delay constraints on fr

APA, Harvard, Vancouver, ISO, and other styles

19

Hsu, Chia-Hao, and 許家豪. "A Study on the Reputation Mechanism based on Dynamic Access Resources Strategies in P2P File Sharing Systems." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/55732557525593536338.

Full text

Abstract:

碩士<br>國立屏東科技大學<br>資訊管理系所<br>96<br>Peer-to-Peer （P2P） systems that nodes interact directly to share resources and services provide a kind platform of file sharing. Although P2P systems are convenient for getting resources, there are some problems such as inauthentic files or free-rider. In order to download good resources or solve free-riding, many researches provide “Reputation Mechanism” to quantify their behavior. It can assist us in having the references when we are going to download files and reduce the probability of accessing bad files. A few reputation computing of the mechanisms are ba

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!