Relevant bibliographies by topics / Dynamic resource sharing

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Dynamic resource sharing"

1

Gokila, L., V. Poongodi, and Dr K. Thangadurai. "Multi Scheduling Reactive Resource Sharing for Dynamic Dataflow in Cloud Environment." Bonfring International Journal of Data Mining 6, no. 4 (2016): 46–52. http://dx.doi.org/10.9756/bijdm.8307.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jiang, Wei Jin, Luo Zhong, Qing Feng Li, and Xiao Qing Deng. "MAS-Based Supply Chain Dynamic Collaboration Resource Sharing." Advanced Materials Research 282-283 (July 2011): 474–77. http://dx.doi.org/10.4028/www.scientific.net/amr.282-283.474.

Full text
Abstract:
In order to study the law of emergence and its internal attributable causes according to the resources owned by agents that interacts with each other in the complex adaptive system about the supply chain, at the beginning the resources which the agents in the supply chain draw are defined as followings: the resources outside system, the resources in the system, the resources that other else agents own, and the dynamic resources the agent itself own, the multi-compartment agent of resources. The operating points of eight resources owned by agents interact with each other are controlled through eight random numbers, the direction, degree, speed and stability of resources flow during interaction among agents are described respectively by matching capability, matching speed and matching time; Furthermore, the evolution process about the resources among agents interacting is described by rules of GEF(Global Evaluate Function) and LEF(Local Evaluate Function), resources flow model of complex system about the supply chain is established; Eventually, through simulating respectively in the Swarm platform both the proposed model and the simple model that doesn’t cunsder the multi-compartment agent but the linear sum of all resources, it is found that the former describes the change rule of the resource more accurately in the supply chain system. It means that syncretizing eight resources, which interact and inter-constrain in the system, to an indiscerptible one is the attributable cause of the emergence.
APA, Harvard, Vancouver, ISO, and other styles
3

Chen, Qi, Qi Xu, and Cui Wu. "Dynamic Matching in Cloud Manufacturing considering Matching Costs." Complexity 2019 (July 4, 2019): 1–16. http://dx.doi.org/10.1155/2019/8398356.

Full text
Abstract:
As a service-oriented business platform model, the nature of cloud manufacturing is to realise the manufacturing resources’ sharing, which will largely benefit resources supplier, resources demander, and platform operator. However, it also faces some new problems. One of the most critical issues is how to dynamically match resources of supply and demand to maximise profits of all parties while considering matching costs. This paper investigates the resources’ dynamic matching in a manufacturing supply chain that operates under a cost-sharing contract and consists of two independent and competing manufacturers and a resource-service platform. We first use differential equation to model the evolution of resource-sharing and capture the effect of matching service efforts on market demand. Next, we study the optimal matching strategies by a two-stage differential game based on the dynamic control approach. Then, we design a cost-sharing contract to coordinate and improve the supply chain’s performance. Finally, a numerical example is provided to illustrate the impact of platform transaction fees and matching costs on the feasible region of the corresponding contract.
APA, Harvard, Vancouver, ISO, and other styles
4

Kim, Jiho, Jehee Cha, Jason Jong Kyu Park, Dongsuk Jeon, and Yongjun Park. "Improving GPU Multitasking Efficiency Using Dynamic Resource Sharing." IEEE Computer Architecture Letters 18, no. 1 (2019): 1–5. http://dx.doi.org/10.1109/lca.2018.2889042.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wu, Dan, Yueming Cai, Rose Qingyang Hu, and Yi Qian. "Dynamic Distributed Resource Sharing for Mobile D2D Communications." IEEE Transactions on Wireless Communications 14, no. 10 (2015): 5417–29. http://dx.doi.org/10.1109/twc.2015.2438292.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Zheng, and Mei Dong. "Multi-users Coordinated Sharing Grid Resource Management System." MATEC Web of Conferences 246 (2018): 03039. http://dx.doi.org/10.1051/matecconf/201824603039.

Full text
Abstract:
The fundamental task of grid resource management system is to supply on-demand resources service for various users and applications by aggregate heterogeneous, dynamic and increase resource. Most current grid resource management system is exclusive which brings two sides of deficiency distinctively. We bring forward and realize a multi-user coordinated sharing resource management system, which is a utility oriented resource management system to support resources sharing by multi users or multi workload schedulers, thus extendable resource serving capability can be improved. When the system is used in an “intelligent building” and “intelligent community”, the IT cost of the community enterprises can be reduced significantly.
APA, Harvard, Vancouver, ISO, and other styles
7

G. B., Pallavi, and P. Jayarekha. "An efficient resource sharing technique for multi-tenant databases." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 3 (2020): 3216. http://dx.doi.org/10.11591/ijece.v10i3.pp3216-3226.

Full text
Abstract:
Multi-tenancy is one of the key components of cloud computing environment. Multi-tenant database system in SaaS (Software as a Service) has gained a lot of attention in academics, research and business arena. These database systems provide scalability and economic benefits for both cloud service providers and customers(organizations/companies referred as tenants) by sharing same resources and infrastructure in isolation of shared databases, network and computing resources with Service level agreement (SLA) compliances. In a multitenant scenario, active tenants compete for resources in order to access the database. If one tenant blocks up the resources, the performance of all the other tenants may be restricted and a fair sharing of the resources may be compromised. The performance of tenants must not be affected by resource-intensive activities and volatile workloads of other tenants. Moreover, the prime goal of providers is to accomplish low cost of operation, satisfying specific schemas/SLAs of each tenant. Consequently, there is a need to design and develop effective and dynamic resource sharing algorithms which can handle above mentioned issues. This work presents a model embracing a query classification and worker sorting technique to efficiently share I/O, CPU and Memory thus enhancing dynamic resource sharing and improvising the utilization of idle instances proficiently. The model is referred as Multi-Tenant Dynamic Resource Scheduling Model (MTDRSM) .The MTDRSM support workload execution of different benchmark such as TPC-C(Transaction Processing Performance Council), YCSB(The Yahoo! Cloud Serving Benchmark)etc. and on different database such as MySQL, Oracle, H2 database etc. Experiments are conducted for different benchmarks with and without SLA compliances to evaluate the performance of MTDRSM in terms of latency and throughput achieved. The experiments show significant performance improvement over existing Mute Bench model in terms of latency and throughput.
APA, Harvard, Vancouver, ISO, and other styles
8

Kudo, Riichi, Yasushi Takatori, Kentaro Nishimori, et al. "Spatial Domain Resource Sharing for Overlapping Cells in Indoor Environment." International Journal of Digital Multimedia Broadcasting 2010 (2010): 1–9. http://dx.doi.org/10.1155/2010/642542.

Full text
Abstract:
As microcell wireless systems become more widespread, intercell interference among the access points will increase due to the limited frequency resource. In the overlapping cell scenario, radio resources should be shared by multiple cells. Although time and frequency resource sharing has been described in many papers, there is no detailed report on dynamic spatial resource sharing among multiple cells for microcell wireless systems. Thus, we present the effectiveness of spatial resource sharing among two access points. We introduce two scenarios based on the zero forcing method; one is the primary-secondary AP scenario and the other is the cooperative AP scenario. To evaluate the transmission performance of spatial resource sharing, channel matrices are measured in an indoor environment. The simulation results using the measured channel matrices show the potential of spatial resource sharing.
APA, Harvard, Vancouver, ISO, and other styles
9

Yilmaz, Ibrahim, and Sang Won Yoon. "Dynamic-distributed decisions and sharing protocol for fair resource sharing in collaborative network." International Journal of Production Economics 226 (August 2020): 107644. http://dx.doi.org/10.1016/j.ijpe.2020.107644.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Niu, Binglai, Yong Zhou, Hamed Shah-Mansouri, and Vincent W. S. Wong. "A Dynamic Resource Sharing Mechanism for Cloud Radio Access Networks." IEEE Transactions on Wireless Communications 15, no. 12 (2016): 8325–38. http://dx.doi.org/10.1109/twc.2016.2613896.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Dynamic resource sharing"

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 est une classe générale de problèmes d’optimisation dynamique stochastique. Relaxer la contrainte de trajectoire dans le problème d’optimisation permet de définir une politique d’index comme heuristique pour le modèle contraint d’origine, aussi appelée politique d’index de Whittle. Nous dérivons une expression analytique pour l’index de Whittle en fonction des probabilités stationnaires de l’état dans le cas où les bandits (ou projets) suivent un processus de naissance et de mort. D’une part, cette expression nécessite la vérification de plusieurs conditions techniques, d’autre part elle ne peut être calculée explicitement que dans certains cas spécifiques. Nous prouvons ensuite, que dans le cas particulier d’une file d’attente multi-classe avec abandon, la politique d’index de Whittle est asymptotiquement optimale aussi bien pour les régimes à faible trafic comme pour ceux à fort trafic. Dans la partie II, nous dérivons des heuristiques issues de l’approximation des systèmes stochastiques de partage de ressources par des modèles fluides déterministes. Nous formulons dans un premier temps une version fluide du problème d’optimisation relaxé que nous avons introduit dans la partie I, et développons une politique d’index fluide. L’index fluide peut toujours être calculé explicitement et surmonte donc les questions techniques qui se posent lors du calcul de l’index de Whittle. Nous appliquons les politiques d’index de Whittle et de l’index fluide à plusieurs cas : les fermes de serveurs éco-conscients, l’ordonnancement opportuniste dans les systèmes sans fil, et la gestion de stockage de produits périssables. Nous montrons numériquement que ces politiques d’index sont presque optimales. Dans un second temps, nous étudions l’ordonnancement optimal de la version fluide d’une file d’attente multi-classe avec abandon. Nous obtenons le contrôle optimal du modèle fluide en présence de deux classes de clients en concurrence pour une même ressource. En nous appuyant sur ces derniers résultats, nous proposons une heuristique pour le cas général de plusieurs classes. Cette heuristique montre une performance quasi-optimale lorsqu’elle est appliquée au modèle stochastique original pour des charges de travail élevées. Enfin, dans la partie III, nous étudions les phénomènes d’abandon dans le contexte d’un problème de distribution de contenu. Nous caractérisons une politique optimale de regroupement afin que des demandes issues d’utilisateurs impatients puissent être servies efficacement en mode diffusion<br>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 constraint in the optimization problem enables to define an index-based heuristic for the original constrained model, the so-called Whittle index policy. We derive a closed-form expression for the Whittle index as a function of the steady-state probabilities for the case in which bandits (projects) evolve in a birth-and-death fashion. This expression requires several technical conditions to be verified, and in addition, it can only be computed explicitly in specific cases. In the particular case of a multi-class abandonment queue, we further prove that the Whittle index policy is asymptotically optimal in the light-traffic and heavy-traffic regimes. In Part II, we derive heuristics by approximating the stochastic resource-sharing systems with deterministic fluid models. We first formulate a fluid version of the relaxed optimization problem introduced in Part I, and we develop a fluid index policy. The fluid index can always be computed explicitly and hence overcomes the technical issues that arise when calculating the Whittle index. We apply the Whittle index and the fluid index policies to several systems: e.g. power-aware server-farms, opportunistic scheduling in wireless systems, and make-to-stock problems with perishable items. We show numerically that both index policies are nearly optimal. Secondly, we study the optimal scheduling control for the fluid version of a multi-class abandonment queue. We derive the fluid optimal control when there are two classes of customers competing for a single resource. Based on the insights provided by this result we build a heuristic for the general multi-class setting. This heuristic shows near-optimal performance when applied to the original stochastic model for high workloads. In Part III, we further investigate the abandonment phenomena in the context of a content delivery problem. We characterize an optimal grouping policy so that requests, which are impatient, are efficiently transmitted in a multi-cast mode
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 examining spectrum sharing paradigms where a migration from fixed to flexible resource allocation is investigated. First, a radio resource management (RRM) architecture is proposed where advanced spectrum functionalities accounting for the short-term variations of the spectrum are examined. The achievable gains are shown in a multi-cell, multi-network environment with realistic traffic patterns from a European operator, enhancing thereby spectrum utilization. Second, inter-operator resource sharing in a broadband network is considered where a packet-based cellular network is developed. It is shown that the obtained gains in terms of quality-of-service (QoS), number of operators and different data rates requirements improve the overall efficiency of the network. Besides and in order to cope with the stringent data rate requirements, direct terminal-to-terminal (T2T) communication is examined in which a realistic algorithm is proposed advocating resource reuse in a cellular system with simultaneous communications between mobiles. Numerical results confirm the advantages of resource reuse in terms of throughput, average frame delays and power consumption. In this thesis, a proposal is made as how to enhance spectrum sharing. The concept of hierarchy is proposed in which wireless competitive operators share the same spectrum band. The decentralized hierarchical approach is shown to bridge the gap between the selfish and centralized approach. Interference avoidance is studied for point-to-point communication in a selforganized network where different optimal power allocation strategies are examined along with the impact of frequency reuse on the ergodic capacity of the network.
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 an optimality certificate is proposed. Novel bounding techniques via conic optimization are introduced and their efficiency is illustrated by numerical simulations. The proposed BB based algorithm is not limited to WSRMax only; it can be easily extended to maximize any system performance metric that can be expressed as a Lipschitz continuous and increasing function of the signal-to-interference-plus-noise (SINR) ratio. Beamforming techniques can provide higher spectral efficiency, only when the channel state information (CSI) of users is accurately known. However, in practice the CSI is not perfect. By using an ellipsoidal uncertainty model for CSI errors, both optimal and suboptimal robust beamforming techniques for the worst-case WSRMax problem are proposed. The optimal method is based on a BB technique. The suboptimal algorithm is derived using alternating optimization and sequential convex programming. Through a numerical example it is also shown how the proposed algorithms can be applied to a scenario with statistical channel errors. Next two decentralized algorithms for multicell MISO networks are proposed. The optimization problems considered are: P1) minimization of the total transmission power subject to minimum SINR constraints of each user, and P2) SINR balancing subject to the total transmit power constraint of the base stations. Problem P1 is of great interest for obtaining a transmission strategy with minimal transmission power that can guarantee QoS for users. In a system where the power constraint is a strict system restriction, problem P2 is useful in providing fairness among the users. Decentralized algorithms for both problems are derived by using a consensus based alternating direction method of multipliers. Finally, the problem of spectrum sharing between two wireless operators in a dynamic MISO network environment is investigated. The notion of a two-person bargaining problem is used to model the spectrum sharing problem, and it is cast as a stochastic optimization. For this problem, both centralized and distributed dynamic resource allocation algorithms are proposed. The proposed distributed algorithm is more suitable for sharing the spectrum between the operators, as it requires a lower signaling overhead, compared with centralized one. Numerical results show that the proposed distributed algorithm achieves almost the same performance as the centralized one<br>Tiivistelmä Tässä väitöskirjassa tarkastellaan monisoluisten laskevan siirtotien moniantennilähetystä käyttävien verkkojen radioresurssien hallintatekniikoita. Väitöskirjassa keskitytään erityisesti kehittämään lineaarisia siirron keilanmuodostustekniikoita optimoimalla tiettyjä palvelun laadun ominaisuuksia, kuten spektritehokkuutta, tasapuolisuutta ja välityskykyä. Painotetun summadatanopeuden maksimoinnin (WSRMax) ongelma on tunnistettu keskeiseksi monissa verkon optimointitavoissa ja sen tiedetään olevan NP-kova. Tässä työssä esitetään yleinen branch and bound (BB) -tekniikkaan perustuva algoritmi, joka ratkaisee WSRMax-ongelman globaalisti ja tuottaa todistuksen ratkaisun optimaalisuudesta. Samalla esitellään uusia conic-optimointia hyödyntäviä suorituskykyrajojen laskentatekniikoita, joiden tehokkuutta havainnollistetaan numeerisilla simuloinneilla. Ehdotettu BB-perusteinen algoritmi ei rajoitu pelkästään WSRMax-ongelmaan, vaan se voidaan helposti laajentaa maksimoimaan mikä tahansa järjestelmän suorituskykyarvo, joka voidaan ilmaista Lipschitz-jatkuvana ja signaali-(häiriö+kohina) -suhteen (SINR) kasvavana funktiona. Keilanmuodostustekniikat voivat tuottaa suuremman spektritehokkuuden vain, jos käyttäjien kanavien tilatiedot tiedetään tarkasti. Käytännössä kanavan tilatieto ei kuitenkaan ole täydellinen. Tässä väitöskirjassa ehdotetaan WSRMax-ongelman ääritapauksiin sekä optimaalinen että alioptimaalinen keilanmuodostustekniikka soveltaen tilatietovirheisiin ellipsoidista epävarmuusmallia. Optimaalinen tapa perustuu BB-tekniikkaan. Alioptimaalinen algoritmi johdetaan peräkkäistä konveksiohjelmointia käyttäen. Numeerisen esimerkin avulla näytetään, miten ehdotettuja algoritmeja voidaan soveltaa skenaarioon, jossa on tilastollisia kanavavirheitä. Seuraavaksi ehdotetaan kahta hajautettua algoritmia monisoluisiin moniantennilähetyksellä toimiviin verkkoihin. Tarkastelun kohteena olevat optimointiongelmat ovat: P1) lähetyksen kokonaistehon minimointi käyttäjäkohtaisten minimi-SINR-rajoitteiden mukaan ja P2) SINR:n tasapainottaminen tukiasemien kokonaislähetystehorajoitusten mukaisesti. Ongelma P1 on erittäin kiinnostava, kun pyritään kehittämään mahdollisimman pienen lähetystehon vaativa lähetysstrategia, joka pystyy takaamaan käyttäjien palvelun laadun. Ongelma P2 on hyödyllinen tiukasti tehorajoitetussa järjestelmässä, koska se tarjoaa tasapuolisuutta käyttäjien välillä. Molempien ongelmien hajautetut algoritmit johdetaan konsensusperusteisen vuorottelevan kertoimien suuntaustavan avulla. Lopuksi tarkastellaan kahden langattoman operaattorin välisen spektrinjaon ongelmaa dynaamisessa moniantennilähetystä käyttävässä verkkoympäristössä. Spektrinjako-ongelmaa mallinnetaan käyttämällä kahden osapuolen välistä neuvottelua stokastisen optimoinnin näkökulmasta. Tähän ongelmaan ehdotetaan ratkaisuksi sekä keskitettyä että hajautettua resurssien allokoinnin algoritmia. Hajautettu algoritmi sopii paremmin spektrin jakamiseen operaattorien välillä, koska se vaatii vähemmän kontrollisignalointia. Numeeriset tulokset osoittavat, että ehdotetulla hajautetulla algoritmilla saavutetaan lähes sama suorituskyky kuin keskitetyllä algoritmillakin
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 to dynamically push network functions to different locations in the network, while DRS allows for sharing transport resources in a flexible manner. Both of these strategies can be realized by employing a programmable control framework based on software defined networking (SDN), which has implications on both the network data and control planes. However, this thesis specifically focuses on the data plane aspects of NFV and the control plane aspects of DRS. Considering the network caching as a specific example of network function, the data plane aspects of NFV are studied in terms of different architectural options for cache placement in order to see which options are the most efficient in terms of network power consumption and cost. The results presented in this thesis show that placing large-sized caches farther in the network for a large group of users is the most efficient approach. The control plane aspects of DRS are analyzed in terms of which provisioning strategy should be used for sharing a limited amount of transport resources. The analysis is presented for both a single-tenant case (i.e., where the role of service and network provider is played by the same entity), and a multi-tenant case (i.e., where a network provider manages the resources assigned to different service providers in an intelligent way). The results show that DRS performs much better than the conventional static approach (i.e., without sharing of resources), which translates into significant cost savings for the network providers.<br><p>QC 20161115</p>
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 et enfin une décentralisation du processus de résolution imposée par une distribution physique et fonctionnelle des variables incompatible avec une vision centralisée du problème. Un parcours complet des espaces de recherche associés à de tels problèmes est irréaliste en un temps acceptable, il est alors nécessaire d'employer des méthodes de résolution dite incomplètes. Quelque soit l'approche incomplète considérée, le parcours incomplet de l'espace de recherche requiert un contrôle afin de maximiser la probabilité de converger vers une solution satisfaisante. Nous identifions trois niveaux de contrôle du parcours de l'espace de recherche indépendamment de l'approche utilisée : un contrôle statique (définition a priori du comportement du système), un contrôle dynamique (évoluant en cours de résolution selon des mécanismes préétablis) et un contrôle adaptatif (évoluant dynamiquement en cours de résolution). Nous montrons qu'un contrôle endogène de l'activité du système, c.-à-d. un contrôle adaptatif issu de l'activité même des agents, est nécessaire au guidage du parcours de l'espace de recherche dans le contexte de résolution de problèmes complexes. Ces travaux ayant été réalisés dans un contexte de collaboration industrielle, ils s'appuient sur une approche développée au cours de précédents travaux : CESNA (Complex Exchanges between Stigmergic Negotiating Agents). CESNA est une approche multi-agents auto-organisationnelle exploitant des agents situés dans un environnement matérialisant le problème et exploité par un processus de résolution basé sur une négociation stigmergique entre les agents. Le cas applicatif utilisé par l'approche CESNA et permettant d'illustrer ces travaux est le problème de partage de ressources critiques, caractérisé par un ensemble restreint de ressources exploitées par un grand nombre de consommateurs. Nos contributions sont de deux types : nous avons dans un premier temps proposé des évolutions de la représentation du problème exploitée par l'approche initiale (CESNA) afin d'en supprimer les limitations interdisant un passage à l'échelle, et dans un second temps, nous avons défini un nouveau modèle (MANA : Multi-level bAlancing Negotiating Agents) exploitant cette nouvelle représentation à l'aide d'un nouveau processus de résolution basé sur des mécanismes endogènes de contrôle de l'activité du système. Ces mécanismes reposent sur la matérialisation des effets microscopiques du phénomène macroscopique à orienter (le parcours de l'espace de recherche) afin de le rendre perceptible localement par les agents. Nos mesures montrent que ce nouveau modèle permet le passage à l'échelle (la résolution de problèmes industriels de grande taille) et une amélioration significative des performances de résolution par rapport à l'approche initiale montrant ainsi l'efficacité du guidage permis par les mécanismes utilisés.
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 chapter, we study the replica placement problem in a tree network. We try to minimize the energy consumption in a dynamic frame. After a complexity study, we confirm the quality of our heuristics through a complete set of simulations. In the fourth chapter, we come back to streaming applications, but in the form of series-parallel graphs, and try to map them onto a chip multiprocessor. The design of a polynomial algorithm on a simple problem allows us to derive heuristics on the most general problem, whose NP-completeness has been proven. In the fifth chapter, we study energy bounds of different routing policies in chip multiprocessors, compared to the classical XY routing, and develop new routing heuristics. In the last chapter, we compare the performance of different algorithms of the literature that tackle the problem of mapping DAG applications to minimize the energy consumption.
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 implement a distributed directory may not serve these applications efficiently, due to the frequent updates and the possibility of false positive answers. Fortunately, in these applications peers usually supply only one set of resources and can thus be characterized by one set of attributes. In this thesis, we propose Attribute-Based Overlay Network (AON) for searching dynamic resources. The idea is to interconnect the peers according to their attributes instead of some hash keys. Nodes with similar attributes will thus be neighbors in the overlay. Shortcuts are created according to the principle of small world for routing efficiency. AON can easily handle dynamic changing resources and answers queries requesting a given number of similar nodes. The simulation experiments show that AON can perform as well as CAN in searching efficiency. When facing churns, AON presents higher stability.
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
More sources

Books on the topic "Dynamic resource sharing"

1

Magnaghi, Alberto, and Sara Giacomozzi, eds. Un fiume per il territorio. Firenze University Press, 2009. http://dx.doi.org/10.36253/978-88-6453-033-8.

Full text
Abstract:
This book illustrates the study carried out to define the project guidelines for the river park of the Arno and its tributaries the Pesa and the Elsa in the Empoli area, and has been produced by liaison between the territorial Planning Department and the Municipalities of the Empoli district. The integrated analysis of local resources scheduled, on the one hand the identification of the criticalities of the territorial system, and on the other the conscious and distinctly interpretational representation of the local cultural bedrock. The definition of scenarios for the entire territory has made it possible to demonstrate the outcomes of complex dynamics in a synthetic manner, moving on to the individual integrated projects and specific sectorial policies. It is precisely this recourse to scenarios, seen as the embodiment of a phase of project sharing and definition, that is the innovative feature of the «River Contract» proposed as a tool for the management and implementation of the plan.
APA, Harvard, Vancouver, ISO, and other styles
2

Reyes, Miguel Angel. Dynamic sharing of the system resources in multilevel secure system. 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

(Editor), Paul Faugeras, Abdeslam Hoummada (Editor), and Robert Klapisch (Editor), eds. Sharing Knowledge Across the Mediterranean Area: Towards a Partnership for Sustainable Management of Resources and the Prevention of Catastrophes - Volume ... Series - Human and Societal Dynamics). IOS Press, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Dynamic resource sharing"

1

Mateescu, Gabriel. "A Dynamic Space Sharing Method for Resource Management." In High Performance Computing Systems and Applications. Springer US, 2003. http://dx.doi.org/10.1007/978-1-4615-0288-3_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zulkar Nine, Md S. Q., Md Abul Kalam Azad, Saad Abdullah, and Nova Ahmed. "Dynamic Load Sharing to Maximize Resource Utilization Within Cloud Federation." In Cloud Computing and Big Data. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-28430-9_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Toker, Ahmet Cihat, Fikret Sivrikaya, Nadim El Sayed, and Sahin Albayrak. "An Analytical Model for Dynamic Inter-Operator Resource Sharing in 4G Networks." In Communications in Computer and Information Science. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14171-3_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Carrera, David, Malgorzata Steinder, Ian Whalley, Jordi Torres, and Eduard Ayguadé. "Enabling Resource Sharing between Transactional and Batch Workloads Using Dynamic Application Placement." In Middleware 2008. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89856-6_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Dejun. "Research on Heterogeneous Resource Sharing and Dynamic Allocation Strategy in Campus Grid." In Frontiers in Computer Education. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-27552-4_111.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Noda, Itsuki, and Masayuki Ohta. "Meta-level Control of Multiagent Learning in Dynamic Repeated Resource Sharing Problems." In PRICAI 2008: Trends in Artificial Intelligence. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89197-0_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mitra, Debasis, and Ilze Ziedins. "Virtual partitioning by dynamic priorities: Fair and efficient resource-sharing by several services." In Broadband Communications Networks, Services, Applications, Future Directions. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0022226.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Begishev, Vyacheslav, Andrey Samuylov, Dmitri Moltchanov, and Konstantin Samouylov. "Modeling the Process of Dynamic Resource Sharing Between LTE and NB-IoT Services." In Communications in Computer and Information Science. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66836-9_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Warner, Janice, Vijayalakshmi Atluri, and Ravi Mukkamala. "A Credential-Based Approach for Facilitating Automatic Resource Sharing Among Ad-Hoc Dynamic Coalitions." In Data and Applications Security XIX. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11535706_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hanczewski, Sławomir, Maciej Stasiak, and Joanna Weissenberg. "The Queueing Model of a Multiservice System with Dynamic Resource Sharing for Each Class of Calls." In Computer Networks. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38865-1_44.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Dynamic resource sharing"

1

Al Agha, K. "Hybrid channel assignment using dynamic resource sharing." In Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324). IEEE, 1999. http://dx.doi.org/10.1109/vetecf.1999.800343.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

YILDIRIM, GUNGOR, and YETKIN TATAR. "Alternative Resource Allocation Model for Dynamic Resource Sharing WSN Systems." In Fifth International Conference on Advances in Computing, Electronics and Communication - ACEC 2017. Institute of Research Engineers and Doctors, 2017. http://dx.doi.org/10.15224/978-1-63248-121-4-04.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kaddouh, Bilal, William Crowther, and Peter M. Hollingsworth. "Dynamic Resource Allocation for Sharing Multi-UAV Services." In AIAA Modeling and Simulation Technologies Conference. American Institute of Aeronautics and Astronautics, 2015. http://dx.doi.org/10.2514/6.2015-2331.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bae, Junjik, Eyal Beigman, Randall Berry, Michael L. Honig, and Rakesh Vohra. "Incentives and Resource Sharing in Spectrum Commons." In 2008 IEEE Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN). IEEE, 2008. http://dx.doi.org/10.1109/dyspan.2008.34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bin Da and C. C. Ko. "Dynamic subcarrier sharing algorithms for uplink OFDMA resource allocation." In 2007 6th International Conference on Information, Communications & Signal Processing. IEEE, 2007. http://dx.doi.org/10.1109/icics.2007.4449622.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Arabnejad, Hamid, and Jorge Barbosa. "Fairness Resource Sharing for Dynamic Workflow Scheduling on Heterogeneous Systems." In 2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications (ISPA). IEEE, 2012. http://dx.doi.org/10.1109/ispa.2012.94.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wu, Dan, Yueming Cai, Jiannan Qi, and Joel J. P. C. Rodrigues. "Uplink dynamic resource sharing of underlaying D2D and cellular communications." In 2014 Sixth International Conference on Wireless Communications and Signal Processing (WCSP). IEEE, 2014. http://dx.doi.org/10.1109/wcsp.2014.6992180.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lieto, Alessandro, Ilaria Malanchini, and Antonio Capone. "Enabling Dynamic Resource Sharing for Slice Customization in 5G Networks." In GLOBECOM 2018 - 2018 IEEE Global Communications Conference. IEEE, 2018. http://dx.doi.org/10.1109/glocom.2018.8647249.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Zhao, Chun, Lin Zhang, Xuesong Zhang, and Liang Zhang. "Cloud Manufacturing Resource Management Based on Metadata." In ASME 2015 International Manufacturing Science and Engineering Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/msec2015-9388.

Full text
Abstract:
Centralized management and sharing of manufacturing resources is one of the important functions of cloud manufacturing platform. There are many kinds of manufacturing resources, centralized management, optimized scheduling, quick searching for various manufacturing resources become important issues in a cloud manufacturing platform. This paper presents a resource management model based on metadata to realize the access and unified management of the hardware resources, software resources and knowledge resources. Two management approaches respectively for static and dynamic resource data are introduced to realize resource state monitoring and real-time information collecting. On this basis, the relationship between static and dynamic data is determined and service-oriented of resources is realized.
APA, Harvard, Vancouver, ISO, and other styles
10

Ni, Wancheng, Lianchen Liu, Yuexuan Wang, Cheng Wu, and Wei Liu. "Dynamic Service Composition: a Collaborative Resource Sharing Framework for Equipment Grid." In 2005 First International Conference on Semantics, Knowledge and Grid. IEEE, 2005. http://dx.doi.org/10.1109/skg.2005.67.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Dynamic resource sharing' for particular source types:
Journal articles Dissertations / Theses
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!

To the bibliography