Relevant bibliographies by topics / Throughput allocation

Academic literature on the topic 'Throughput allocation'

Author: Grafiati
Published: 10 December 2022
Last updated: 29 January 2023

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Throughput allocation.'

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 "Throughput allocation"

1

Ismail, M. S., Noorhafiza Muhammad, M. I. Hussain, Zuraidah Mohd Zain, and R. Ahmad. "Buffer Allocation Using 6 Steps Oba Method: A Case Study." Applied Mechanics and Materials 815 (November 2015): 287–92. http://dx.doi.org/10.4028/www.scientific.net/amm.815.287.

Full text
Abstract:
This paper utilized a simulation software to determine an optimal buffer allocation for any unpaced production line when a set of buffer quantity is known. The optimal buffer allocation will give the highest throughput rate (productivity) to the production line. From the simulation result, a trend of relation between mean processing time (μ) trend of the stations in the production line and buffer allocation configuration of the buffer slots were studied. It was concluded that for any unpaced production line, the best throughput rate of the production line will be obtained if the buffer allocation configuration follow the mean processing time (μ) trend. By applying this concept, a mathematical relation was formed results in a development of a technique called 6 Steps OBA (optimal buffer allocation) method . In order to validate the result from this 6 Steps OBA method, a case study was carried out in one of the multinational electronics company in Malaysia (Company S). An unpaced and u-unbalanced production line was selected and this line was producing a product which is known as model A. In this production line, a few possible buffer allocations quantity were allocated on each buffer slots including buffer allocation suggested by 6 Steps OBA method. For each buffer allocation possibilities, the actual production line productivity (throughput rate) was recorded and compared to validate that the best line throughput rate was the buffer allocation suggested by the 6 Steps OBA method. From the overall result, it was proven that the 6 Steps OBA method will give a maximum throughput rate to a production line.
APA, Harvard, Vancouver, ISO, and other styles
2

SK, Khaleelahmed, Venkateswararao N, Varshasree KN, and P. V. Naidu. "Improving MIMO system throughput using power transmission scheduling." International Journal of Engineering & Technology 7, no. 3 (June 23, 2018): 1181. http://dx.doi.org/10.14419/ijet.v7i3.13097.

Full text
Abstract:
The main idea of this paper is to select the best power allocation throughput model by simulating the different power allocation theoretical modules in MIMO arbitrary multipath environment to address the effects of channel parameters on throughput. In general, power allocation techniques are used for minimizing the overall Bit Error Rate (BER). In this process, the channel estimation is usually done at the receiver by accessing the Channel State Information (CSI). The optimized system can be designed with respect to channel parameters so that it can be suitable for transmitter side during power allocation. The simulation analysis is carried out in NI LabVIEW and it is observed from the studies that the throughput results are as a function of received power. Under static system parameters, the relative throughput of the water filling (WF) power allocation model is found to be high efficient 15.74% when it is compared with the open loop zero-forcing (ZF) and it is 4.45 % with respect to inverse singular value decomposition (SVD) equal power allocation models.
APA, Harvard, Vancouver, ISO, and other styles
3

Bonald, Thomas, Léonce Mekinda, and Luca Muscariello. "Fair throughput allocation in Information-Centric Networks." Computer Networks 125 (October 2017): 122–31. http://dx.doi.org/10.1016/j.comnet.2017.05.019.

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

Tassiulas, Leandros, and Partha P. Bhattacharya. "Allocation of interdependent resources for maximal throughput." Communications in Statistics. Stochastic Models 16, no. 1 (January 2000): 27–48. http://dx.doi.org/10.1080/15326340008807575.

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

Gao, Sixiao, Toshimitsu Higashi, Toyokazu Kobayashi, Kosuke Taneda, Jose I. U. Rubrico, and Jun Ota. "Buffer Allocation via Bottleneck-Based Variable Neighborhood Search." Applied Sciences 10, no. 23 (November 30, 2020): 8569. http://dx.doi.org/10.3390/app10238569.

Full text
Abstract:
This study addresses the challenging problem of efficient buffer allocation in production lines. Suitable locations for buffer allocation are determined to satisfy the desired throughput, while a suitable balance between solution quality and computation time is achieved. A throughput calculation approach that yields the state probability of production lines is adopted to evaluate the effectiveness of candidate buffer allocation solutions. To generate candidate buffer allocation solutions, an active probability index based on state probability is proposed to rapidly detect suitable locations of buffer allocations. A variable neighborhood search algorithm is used to maintain acceptable solution quality; an additional neighborhood structure is used in the case where no satisfactory solution is generated in the initial neighborhood structure. Extensive numerical experiments demonstrate the efficacy of the proposed approach. The proposed approach can facilitate agile design of production lines in industry by rapidly estimating production line topologies.
APA, Harvard, Vancouver, ISO, and other styles
6

Abuajwa, Osama, Mardeni Bin Roslee, and Zubaida Binti Yusoff. "Simulated Annealing for Resource Allocation in Downlink NOMA Systems in 5G Networks." Applied Sciences 11, no. 10 (May 18, 2021): 4592. http://dx.doi.org/10.3390/app11104592.

Full text
Abstract:
In this work, we investigate resource allocation and user pairing to improve the system’s Throughput for the downlink non-orthogonal multiple access (NOMA)-based 5G networks. The proposed resource allocation involves user pairing, subchannel power allocation, and proportional power allocation among the multiplexed users. The resource allocation is a non-deterministic polynomial (NP-hard) problem that is difficult to tackle throughput maximization. The user pairing and power allocation are coupled to address the substantial requirements of the NOMA system. The NOMA system requires an efficient deployment of resource allocation techniques to enhance the system’s throughput performance. In this work, we propose simulated annealing (SA) to optimize the power allocation and perform user pairing to maximize the throughput for the NOMA system. Also, we provide mathematical proof on the near-optimal solution for subchannel power and mathematical analysis on the optimal value of the power ratio for the multiplexed users in the NOMA system. The SA provides a significant throughput performance that increases by 7% compared to the existing numerical optimization methods. Results obtained show that SA performs with sufficient reliability and low time complexity in terms of Throughput improvement.
APA, Harvard, Vancouver, ISO, and other styles
7

Le, Van Hoa, Viet Minh Nhat Vo, and Manh Thanh Le. "Throughput-based fair bandwidth allocation in OBS networks." ETRI Journal 40, no. 5 (September 15, 2018): 624–33. http://dx.doi.org/10.4218/etrij.2017-0253.

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

Hong, Bo, and Viktor Prasanna. "Adaptive Allocation of Independent Tasks to Maximize Throughput." IEEE Transactions on Parallel and Distributed Systems 18, no. 10 (October 2007): 1420–35. http://dx.doi.org/10.1109/tpds.2007.1042.

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

Maeng, Juhyun, Mwamba Kasongo Dahouda, and Inwhee Joe. "Optimal Power Allocation with Sectored Cells for Sum-Throughput Maximization in Wireless-Powered Communication Networks Based on Hybrid SDMA/NOMA." Electronics 11, no. 6 (March 8, 2022): 844. http://dx.doi.org/10.3390/electronics11060844.

Full text
Abstract:
Wireless-powered communication networks (WPCNs) consist of wireless devices (WDs) that transmit information to the hybrid access point (HAP). In this situation, there is interference among WDs that is considered to be noise and causes information loss because of adjacent signals. Moreover, power is limited and can be lost if transmission distance is long. This paper studies sum-throughput maximization with sectored cells for WPCN. We designed a downlink (DL) energy beamforming by sector based on the hybrid space division multiple access (SDMA) and nonorthogonal multiple access (NOMA) approach to maximize the sum throughput. First, a cell is divided into several sectors, and signals from each sector are transmitted to each antenna of the HAP, so that the signals are not adjacent. Further, the HAP decodes the overlapping information of each sector. Next, power allocation is optimized by sector. To optimize power allocation, a constrained optimization problem is formulated and then converted into a nonconstraint optimization problem using the interior penalty method. The optimal solution derives the maximal value to the problem. Power for each sector is optimally allocated according to this optimal solution. Under this consideration, sum-throughput maximization is performed by optimally allocating DL energy beamforming by sector. We analyzed sum throughput and fairness, and then compared them according to the number of sectors. Performance results show that the proposed optimal power allocation by sector using hybrid SDMA/NOMA outperforms the existing equal power allocation by sector in terms of the sum throughput while fairness is also maintained. Moreover, the performance difference between the hybrid approach and SDMA, which optimally allocates power by sector, was about 1.4 times that of sum throughput on average, and the hybrid approach was dominant. There was also no difference in fairness performance.
APA, Harvard, Vancouver, ISO, and other styles
10

Diamantidis, A. C., and C. T. Papadopoulos. "A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines." Mathematical Problems in Engineering 2004, no. 3 (2004): 209–23. http://dx.doi.org/10.1155/s1024123x04402014.

Full text
Abstract:
In this study, the buffer allocation problem (BAP) in homogeneous, asymptotically reliable serial production lines is considered. A known aggregation method, given by Lim, Meerkov, and Top (1990), for the performance evaluation (i.e., estimation of throughput) of this type of production lines when the buffer allocation is known, is used as an evaluative method in conjunction with a newly developed dynamic programming (DP) algorithm for the BAP. The proposed algorithm is applied to production lines where the number of machines is varying from four up to a hundred machines. The proposed algorithm is fast because it reduces the volume of computations by rejecting allocations that do not lead to maximization of the line's throughput. Numerical results are also given for large production lines.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Throughput allocation"

1

PUNYALA, SRINIVASA REDDY. "THROUGHPUT OPTIMIZATION AND RESOURCE ALLOCATION ON GPUS UNDER MULTI-APPLICATION EXECUTION." OpenSIUC, 2017. https://opensiuc.lib.siu.edu/theses/2255.

Full text
Abstract:
Platform heterogeneity prevails as a solution to the throughput and computational chal- lenges imposed by parallel applications and technology scaling. Specifically, Graphics Processing Units (GPUs) are based on the Single Instruction Multiple Thread (SIMT) paradigm and they can offer tremendous speed-up for parallel applications. However, GPUs were designed to execute a single application at a time. In case of simultaneous multi-application execution, due to the GPUs’ massive multi-threading paradigm, ap- plications compete against each other using destructively the shared resources (caches and memory controllers) resulting in significant throughput degradation. In this thesis, a methodology for minimizing interference in shared resources and provide efficient con- current execution of multiple applications on GPUs is presented. Particularly, the pro- posed methodology (i) performs application classification; (ii) analyzes the per-class in- terference; (iii) finds the best matching between classes; and (iv) employs an efficient re- source allocation. Experimental results showed that the proposed approach increases the throughput of the system for two concurrent applications by an average of 36% compared to other optimization techniques, while for three concurrent applications the proposed approach achieved an average gain of 23%.
APA, Harvard, Vancouver, ISO, and other styles
2

Srinivasan, Ramya. "Throughput optimization in MIMO networks." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42735.

Full text
Abstract:
Enabling multi-hop wireless mesh networks with multi-input multi-output (MIMO) functionality boosts network throughput by transmitting over multiple orthogonal spatial channels (spatial multiplexing) and by performing interference cancellation, to allow links within interference range to be concurrently active. Furthermore, if the channel is in a deep fade, then multiple antenna elements at the transmitter and/or receiver can be used to transmit a single stream, thereby improving signal quality (diversity gain). However, there is a fundamental trade-off between boosting individual link performance and reducing interference, which must be modeled in the process of optimizing network throughput. This is called the diversity-multiplexing-interference suppression trade-off. Optimizing network throughput therefore, requires optimizing the trade-off between the amounts of diversity employed on each link, the number of streams multiplexed on each link and the number of interfering links allowed to be simultaneously active in the network. We present a set of efficient heuristics for one-shot link scheduling and stream allocation that approximately solve the problem of optimizing network throughput in a single time slot. We identify the fundamental problem of verifying the feasibility of a given stream allocation. The problems of general link scheduling and stream allocation are very closely related to the problem of verifying feasibility. We present a set of efficient heuristic feasibility tests which can be easily incorporated into practical scheduling schemes. We show for some special MIMO network scenarios that feasibility is of polynomial complexity. However, we conjecture that in general, this problem, which is a variation of Boolean Satisablility, is NP-Complete.
APA, Harvard, Vancouver, ISO, and other styles
3

Cardany, John Paul. "Node to processor allocation for large grain data flow graphs in throughput-critical applications." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1994. http://handle.dtic.mil/100.2/ADA283607.

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

Garau, Luis Juan Jose. "A Comparison of artificial intelligence algorithms for dynamic power allocation in flexible high throughput satellites." Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/127074.

Full text
Abstract:
Thesis: S.M., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, May, 2020
Cataloged from the official PDF of thesis.
Includes bibliographical references (pages 117-123).
The Dynamic Resource Management (DRM) problem in the context of multibeam satellite communications is becoming more relevant than ever. The future landscape of the industry will be defined by a substantial increase in demand alongside the introduction of digital and highly flexible payloads able to operate and reconfigure hundreds or even thousands of beams in real time. This increase in complexity and dimensionality puts the spotlight on new resource allocation strategies that use autonomous algorithms at the core of their decision-making systems. These algorithms must be able to find optimal resource allocations in real or near-real time. Traditional optimization approaches no longer meet all these DRM requirements and the research community is studying the application of Artificial Intelligence (AI) algorithms to the problem as a potential alternative that satisfies the operational constraints.
Although multiple AI approaches have been proposed in the recent years, most of the analyses have been conducted under assumptions that do not entirely reflect the new operation scenarios' requirements, such as near-real time performance or high-dimensionality. Furthermore, little work has been done in thoroughly comparing the performance of different algorithms and characterizing them. This Thesis considers the Dynamic Power Allocation problem, a DRM subproblem, as a use case and compares nine different AI algorithms under the same near-real time operational assumptions, using the same satellite and link budget models, and four different demand datasets. The study focuses on Genetic Algorithms (GA), Simulated Annealing (SA), Particle Swarm Optimization (PSO), Deep Reinforcement Learning (DRL), and hybrid approaches, including a novel DRL-GA hybrid. The comparison considers the following characteristics: time convergence, continuous operability, scalability, and robustness.
After evaluating the algorithms' performance on the different test scenarios, three algorithms are identified as potential candidates to be used during real satellite operations. The novel DRL-GA implementation shows the best overall performance, being also the most robust. When the update frequency is in the order of seconds, DRL is identified as the best algorithm, since it is the fastest. Finally, when the online data substantially diverges from the training dataset of the DRL algorithm, both DRL and DRL-GA hybrid might not perform adequately and an individual GA might be the best option instead.
by Juan Jose Garau Luis.
S.M.
S.M. Massachusetts Institute of Technology, Department of Aeronautics and Astronautics
APA, Harvard, Vancouver, ISO, and other styles
5

Ji, Bo. "Design of Efficient Resource Allocation Algorithms for Wireless Networks: High Throughput, Small Delay, and Low Complexity." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1354641556.

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

Toktas, Engin. "Subcarrier Allocation In Ofdma Systems With Time Varying Channel And Packet Arrivals." Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/3/12610029/index.pdf.

Full text
Abstract:
This study considers the average system throughput and the average delay performances of subcarrier allocation algorithms in OFDMA systems. The effects of varying the number of users, the number of subcarriers, and the statistical characteristics of incoming packets are investigated on the throughput and delay performances of the algorithms. Moreover, a new subcarrier allocation algorithm with low-order computational complexity, which performs very well almost all cases, is proposed. With the aid of the simulations, the significance of channel v.s. queue state information varying with the statistical characteristic of incoming packets is examined and reached some results which can be very valuable for channel estimation and feedback systems. Finally, the stability issue is considered in OFDMA systems and a new heuristic simulation-based method for obtaining the stability region of an OFDMA subcarrier allocation algorithm is proposed.
APA, Harvard, Vancouver, ISO, and other styles
7

Cao, Fei. "Efficient Scientific Workflow Scheduling in Cloud Environment." OpenSIUC, 2014. https://opensiuc.lib.siu.edu/dissertations/802.

Full text
Abstract:
Cloud computing enables the delivery of remote computing, software and storage services through web browsers following pay-as-you-go model. In addition to successful commercial applications, many research efforts including DOE Magellan Cloud project focus on discovering the opportunities and challenges arising from the computing and data-intensive scientific applications that are not well addressed by the current supercomputers, Linux clusters and Grid technologies. The elastic resource provision, noninterfering resource sharing and flexible customized configuration provided by the Cloud infrastructure has shed light on efficient execution of many scientific applications modeled as Directed Acyclic Graph (DAG) structured workflows to enforce the intricate dependency among a large number of different processing tasks. Meanwhile, the Cloud environment poses various challenges. Cloud providers and Cloud users pursue different goals. Providers aim to maximize profit by achieving higher resource utilization and users want to minimize expenses while meeting their performance requirements. Moreover, due to the expanding Cloud services and emerging newer technologies, the ever-increasing heterogeneity of the Cloud environment complicates the challenges for both parties. In this thesis, we address the workflow scheduling problem from different applications and various objectives. For batch applications, due to the increasing deployment of many data centers and computer servers around the globe escalated by the higher electricity price, the energy cost on running the computing, communication and cooling together with the amount of CO2 emissions have skyrocketed. In order to maintain sustainable Cloud computing facing with ever-increasing problem complexity and big data size in the next decades, we design and develop energy-aware scientific workflow scheduling algorithm to minimize energy consumption and CO2 emission while still satisfying certain Quality of Service (QoS) such as response time specified in Service Level Agreement (SLA). Furthermore, the underlying Cloud hardware/Virtual Machine (VM) resource availability is time-dependent because of the dual operation modes namely on-demand and reservation instances at various Cloud data centers. We also apply techniques such as Dynamic Voltage and Frequency Scaling (DVFS) and DNS scheme to further reduce energy consumption within acceptable performance bounds. Our multiple-step resource provision and allocation algorithm achieves the response time requirement in the step of forward task scheduling and minimizes the VM overhead for reduced energy consumption and higher resource utilization rate in the backward task scheduling step. We also evaluate the candidacy of multiple data centers from the energy and performance efficiency perspectives as different data centers have various energy and cost related parameters. For streaming applications, we formulate scheduling problems with two different objectives, namely one is to maximize the throughput under a budget constraint while another is to minimize execution cost under a minimum throughput constraint. Two different algorithms named as Budget constrained RATE (B-RATE) and Budget constrained SWAP (B-SWAP) are designed under the first objective; Another two algorithms, namely Throughput constrained RATE (TP-RATE) and Throughput constrained SWAP (TP-SWAP) are developed under the second objective.
APA, Harvard, Vancouver, ISO, and other styles
8

Maaz, Mohamad. "Allocation de ressource et analyse des critères de performance dans les réseaux cellulaires coopératifs." Thesis, Rennes, INSA, 2013. http://www.theses.fr/2013ISAR0036/document.

Full text
Abstract:
Dans les systèmes de communications sans fil, la transmission de grandes quantités d'information et à faible coût énergétique sont les deux principales questions qui n'ont jamais cessé d'attirer l'attention de la communauté scientifique au cours de la dernière décennie. Récemment, il a été démontré que la communication coopérative est une technique intéressante notamment parce qu'elle permet d'exploiter la diversité spatiale dans le canal sans fil. Cette technique assure une communication robuste et fiable, une meilleure qualité de service (QoS) et rend le concept de coopération prometteur pour les futurs générations de systèmes cellulaires. Typiquement, les QoS sont le taux d'erreurs paquet, le débit et le délai. Ces métriques sont impactées par le délai, induit par les mécanismes de retransmission Hybrid-Automatic Repeat-Request (HARQ) inhérents à la réception d'un paquet erroné et qui a un retard sur la QoS demandée. En revanche, les mécanismes HARQ créent une diversité temporelle. Par conséquent, l'adoption conjointe de la communication coopérative et des protocoles HARQ pourrait s'avérer avantageux pour la conception de schémas cross-layer. Nous proposons tout d'abord une stratégie de maximisation de débit total dans un réseau cellulaire hétérogène. Nous introduisons un algorithme qui alloue la puissance optimale à la station de base (BS) et aux relais, qui à chaque utilisateur attribue de manière optimale les sous-porteuses et les relais. Nous calculons le débit maximal atteignable ainsi que le taux d'utilisateurs sans ressources dans le réseau lorsque le nombre d'utilisateurs actifs varie. Nous comparons les performances de notre algorithme à ceux de la littérature existante, et montrons qu'un gain significatif est atteint sur la capacité globale. Dans un second temps, nous analysons théoriquement le taux d'erreurs paquet, le délai ainsi que l'efficacité de débit des réseaux HARQ coopératifs, dans le canal à évanouissements par blocs. Dans le cas des canaux à évanouissement lents, le délai moyen du mécanisme HARQ n'est pas pertinent à cause de la non-ergodicité du processus. Ainsi, nous nous intéressons plutôt à la probabilité de coupure de délai en présence d'évanouissements lents. La probabilité de coupure de délai est de première importance pour les applications sensibles au délai. Nous proposons une forme analytique de la probabilité de coupure permettant de se passer de longues simulations. Dans la suite de notre travail, nous analysons théoriquement l'efficacité énergétique (bits/joule) dans les réseaux HARQ coopératifs. Nous résolvons ensuite un problème de minimisation de l'énergie dans les réseaux coopératifs en liaison descendante. Dans ce problème, chaque utilisateur possède une contrainte de délai moyen à satisfaire de telle sorte que la contrainte sur la puissance totale du système soit respectée. L'algorithme de minimisation permet d'attribuer à chaque utilisateur la station-relai optimale et sa puissance ainsi que la puissance optimale de la BS afin de satisfaire les contraintes de délai. Les simulations montrent qu'en termes de consommation d'énergie, les techniques assistées par relais prédominent nettement les transmissions directes, dans tout système limité en délai. En conclusion, les travaux proposés dans cette thèse peuvent promettre d'établir des règles fiables pour l'ingénierie et la conception des futures générations de systèmes cellulaires énergétiquement efficaces
In wireless systems, transmitting large amounts of information with low energetic cost are two main issues that have never stopped drawing the attention of the scientific community during the past decade. Later, it has been shown that cooperative communication is an appealing technique that exploits spatial diversity in wireless channel. Therefore, this technique certainly promises a robust and reliable communications, higher quality-of-service (QoS) and makes the cooperation concept attractive for future cellular systems. Typically, the QoS requirements are the packet error rate, throughput and delay. These metrics are affected by the delay, where each erroneous packet is retransmitted several times according to Hybrid-Automatic Repeat-Request (HARQ) mechanism inducing a delay on the demanded QoS but a temporal diversity is created. Therefore, adopting jointly cooperative communications and HARQ mechanisms could be beneficial for designing cross-layer schemes. First, a new rate maximization strategy, under heterogeneous data rate constraints among users is proposed. We propose an algorithm that allocates the optimal power at the base station (BS) and relays, assigns subcarriers and selects relays. The achievable data rate is investigated as well as the average starvation rate in the network when the load, i.e. the number of active users in the network, is increasing. It showed a significant gain in terms of global capacity compared to literature. Second, in block fading channel, theoretical analyses of the packet error rate, delay and throughput efficiency in relayassisted HARQ networks are provided. In slow fading channels, the average delay of HARQ mechanisms w.r.t. the fading states is not relevant due to the non-ergodic process of the fading channel. The delay outage is hence invoked to deal with the slow fading channel and is defined as the probability that the average delay w.r.t. AWGN channel exceeds a predefined threshold. This criterion has never been studied in literature, although being of importance for delay sensitive applications in slow fading channels. Then, an analytical form of the delay outage probability is proposed which might be useful to avoid lengthy simulations. These analyses consider a finite packet length and a given modulation and coding scheme (MCS) which leads to study the performance of practical systems. Third, a theoretical analysis of the energy efficiency (bits/joule) in relay-assisted HARQ networks is provided. Based on this analysis, an energy minimization problem in multiuser relayassisted downlink cellular networks is investigated. Each user has an average delay constraint to be satisfied such that a total power constraint in the system is respected. The BS is assumed to have only knowledge about the average channel statistics but no instantaneous channel state information (CSI). Finally, an algorithm that jointly allocates the optimal power at BS, the relay stations and selects the optimal relay in order to satisfy the delay constrains of users is proposed. The simulations show the improvement in terms of energy consumption of relay-assisted techniques compared to nonaided transmission in delay-constrained systems. Hence, the work proposed in this thesis can give useful insights for engineering rules in the design of the next generation energyefficient cellular systems
APA, Harvard, Vancouver, ISO, and other styles
9

Yassin, Mohamad. "Inter-cell interference coordination in wireless networks." Thesis, Rennes 1, 2015. http://www.theses.fr/2015REN1S106/document.

Full text
Abstract:
Grâce aux avancées technologiques dans le domaine des réseaux cellulaires et des équipements mobiles, le nombre d'applications multimédia à haut débit dans les réseaux mobiles ne cesse d'augmenter. On prévoit que le trafic de données dans les réseaux mobiles en 2017 sera 13 fois plus important que celui en 2012. Pour satisfaire aux besoins des équipements mobiles, de nouvelles approches pour la gestion des ressources radio et des puissances de transmission sont requises.Dans le cadre de cette thèse, on s'intéresse à proposer des solutions pour remédier aux problèmes des interférences intercellulaires dans les réseaux mobiles de dernière génération. Nous enquêtons d'une manière exhaustive les différentes techniques de coordination des interférences intercellulaires existantes. Ces techniques sont qualitativement comparées, puis classées selon le taux de coopération requis entre les différentes stations de base, mais aussi selon leurs principes de fonctionnement. Nous abordons également le problème multicellulaire d'allocation des ressources et des puissances de transmission d'une manière centralisée. Nous formulons ce problème d'optimisation centralisé, puis nous le décomposons en deux sous-problèmes indépendants : l'allocation de ressources et l'allocation des puissances de transmission. De plus, une approche distribuée basée sur la théorie des jeux est proposée pour l'allocation des puissances de transmission. Les techniques centralisées de minimisation des interférences intercellulaires offrent la solution optimale au prix d'une grande charge de signalisation. Par contre, les solutions décentralisées réduisent le trafic de signalisation sans garantir l'optimalité de la solution obtenue. Nous proposons ensuite une heuristique de contrôle de puissance qui modifie localement l'allocation des puissances de transmission de manière à éviter le gaspillage d'énergie et pour réduire les interférences ressenties par les utilisateurs des stations de base voisines. Nous proposons également une technique autonome qui gère la distribution des ressources radio entre les différentes zones de chaque cellule. Cette technique répond aux besoins des utilisateurs dans chaque zone en adaptant la distribution des ressources d'une manière dynamique. Nous abordons aussi le compromis entre les techniques de gestion d'interférences intercellulaires centralisées et décentralisées. Nous proposons une approche hybride où l'allocation des ressources radio et des puissances de transmission est faite d'une manière coopérative entre les différentes cellules. Dans un premier lieu, les cellules voisines collaborent afin d'ajuster les puissances de transmission allouées aux ressources radio. Ensuite, la distribution des ressources entre les différentes zones de chaque cellule est modifiée localement, selon les besoins des utilisateurs dans chaque zone
The exponentially increasing demand for mobile broadband communications have led to the dense deployment of cellular networks with aggressive frequency reuse patterns. The future Fifth Generation (5G) networks are expected to overcome capacity and throughput challenges by adopting a multi-tier architecture where several low-power Base Stations (BSs) are deployed within the coverage area of the macro cell. However, Inter-Cell Interference (ICI) caused by the simultaneous usage of the same spectrum in different cells, creates severe problems. ICI reduces system throughput and network capacity, and has a negative impact on cell-edge User Equipment (UE) performance. Therefore, Inter-Cell Interference Coordination (ICIC) techniques are required to mitigate the impact of ICI on system performance. In this thesis, we address the resource and power allocation problem in multiuser Orthogonal Frequency Division Multiple Access (OFDMA) networks such as LTE/LTE-A networks and dense small cell networks. We start by overviewing the state-of-the-art schemes, and provide an exhaustive classification of the existing ICIC approaches. This qualitative classification is followed by a quantitative investigation of several interference mitigation techniques. Then, we formulate a centralized multi-cell joint resource and power allocation problem, and prove that this problem is separable into two independent convex optimization problems. The objective function of the formulated problem consists in maximizing system throughput while guaranteeing throughput fairness between UEs. ICI is taken into account, and resource and power allocation is managed accordingly in a centralized manner. Furthermore, we introduce a decentralized game-theoretical method to solve the power allocation problem without the need to exchange signaling messages between the different cells. We also propose a decentralized heuristic power control algorithm based on the received Channel Quality Indication (CQI) feedbacks. The intuition behind this algorithm is to avoid power wastage for UEs that are close to the serving cell, and reducing ICI for UEs in the neighboring cells. An autonomous ICIC scheme that aims at satisfying throughput demands in each cell zone is also introduced. The obtained results show that this technique improves UE throughput fairness, and it reduces the percentage of unsatisfied UEs without generating additional signaling messages. Lastly, we provide a hybrid ICIC scheme as a compromise between the centralized and the decentralized approaches. For a cluster of adjacent cells, resource and power allocation decisions are made in a collaborative manner. First, the transmission power is adjusted after receiving the necessary information from the neighboring cells. Second, resource allocation between cell zones is locally modified, according to throughput demands in each zone
APA, Harvard, Vancouver, ISO, and other styles
10

Wu, Fei. "Ultra-Low Delay in Complex Computing and Networked Systems: Fundamental Limits and Efficient Algorithms." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu155559337777619.

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

Books on the topic "Throughput allocation"

1

Shroff, Ness, Xiaojun Lin, and Bo Ji. Advances in Multi-Channel Resource Allocation: Throughput, Delay, and Complexity. Springer International Publishing AG, 2016.

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

Lin, Xiaojun, Bo Ji, and Ness B. Shroff. Advances in Multi-Channel Resource Allocation: Throughput, Delay, and Complexity. Morgan & Claypool Publishers, 2016.

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

Lin, Xiaojun, Bo Ji, and Ness B. Shroff. Advances in Multi-Channel Resource Allocation: Throughput, Delay, and Complexity. Morgan & Claypool Publishers, 2016.

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

Scholnick, Ellin K., and Patricia H. Miller. Categories, Gender, and Development. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190658540.003.0014.

Full text
Abstract:
Developmental psychologists typically have viewed gender development as learning which group one belongs to and what behaviors are associated with each group. A typical chapter on gender development would focus on delineating the components of gender such as male-female differences and debates about the origin of those differences. It would present accounts of the development of a gender identity as a male or a female as well as the consequences of personal gender identity throughout the life span. This chapter takes a different track: It contends that those scientific accounts of the study of gender are themselves a product of a gender system, which provides both the meaning and evaluation of gender categories. The authors show how our ways of thinking about gender categories arise from the gendered organization of society, allocation of power, and cultural beliefs.
APA, Harvard, Vancouver, ISO, and other styles
5

Australian Soil and Land Survey Field Handbook. CSIRO Publishing, 2009. http://dx.doi.org/10.1071/9780643097117.

Full text
Abstract:
The Australian Soil and Land Survey Field Handbook specifies methods and terminology for soil and land surveys. It has been widely used throughout Australia, providing one reference set of definitions for the characterisation of landform, vegetation, land surface, soil and substrate. The book advocates that a comprehensive suite of land and soil attributes be recorded in a uniform manner. This approach is more useful than the allocation of land or soil to preconceived types or classes. The third edition includes revised chapters on location and vegetation as well as some new landform elements. These updates have been guided by the National Committee on Soil and Terrain, a steering committee comprising representatives from key federal, state and territory land resource assessment agencies. Essential reading for all professionals involved in land resource surveys, this book will also be of value to students and educators in soil science, geography, ecology, agriculture, forestry, resource management, planning, landscape architecture and engineering.
APA, Harvard, Vancouver, ISO, and other styles
6

Sime, Stuart. A Practical Approach to Civil Procedure. 25th ed. Oxford University Press, 2022. http://dx.doi.org/10.1093/he/9780192859365.001.0001.

Full text
Abstract:
A Practical Approach to Civil Procedure guides the reader through the procedural requirements employed in the civil courts. The volume provides an overview of the key statutory provisions, rules, practice directions, and case law which govern the various stages of a civil litigation claim. Providing practical guidance, the text charts the progress of a typical civil litigation claim, from funding litigation, the importance of alternative dispute resolution processes, issuing and serving proceedings, case management, and through to trial, enforcement, and appeal. Relevant sample documentation is featured throughout and introduces the forms and documents which will be encountered in practice, while key points summaries featured at the end of chapters highlight the essential points covered. This edition has been revised to incorporate rule changes up to the Civil Procedure (Amendment) Rules 2022 and the 144th Update. Changes incorporated into the new edition include: • Replacement rules on acknowledging service • Replacement rules on default judgment • New track allocation rules for road traffic accident claims • Case law developments on Qualified One-Way Costs Shifting • New Supreme Court decision on limitation • Revised PD 51U on disclosure of documents in the Business and Property Courts • Case law developments on privilege • Recent developments on seeking permission to appeal • Measures to assist vulnerable parties and witnesses • Developments on search orders and case law on imaging orders • End of the Siskina rule in relation to interim injunctions and freezing orders • Broad Idea v Convoy Collatera and its impact on freezing injunctions
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Throughput allocation"

1

Gao, Xiaozheng, Kai Yang, Dusit Niyato, and Shimin Gong. "Throughput-Maximized Relay Mode Selection and Resource Sharing." In Resource Allocation in Backscatter-Assisted Communication Networks, 73–96. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-5127-4_5.

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

Garnaev, Andrey, Shweta Sagari, and Wade Trappe. "Fair Allocation of Throughput Under Harsh Operational Conditions." In Multiple Access Communications, 108–19. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23440-3_9.

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

Amaldi, Edoardo, Stefano Coniglio, and Leonardo Taccari. "Maximum Throughput Network Routing Subject to Fair Flow Allocation." In Lecture Notes in Computer Science, 1–12. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-14115-2_1.

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

Amaldi, Edoardo, Stefano Coniglio, and Leonardo Taccari. "Maximum Throughput Network Routing Subject to Fair Flow Allocation." In Lecture Notes in Computer Science, 1–12. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09174-7_1.

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

Kucharzak, Michal, and Krzysztof Walkowiak. "On Modelling of Fair Throughput Allocation in Overlay Multicast Networks." In Smart Spaces and Next Generation Wired/Wireless Networking, 529–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22875-9_48.

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

Hong, Bo, and Viktor Prasanna. "Bandwidth-Aware Resource Allocation for Heterogeneous Computing Systems to Maximize Throughput." In High-Performance Computing, 295–312. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2006. http://dx.doi.org/10.1002/0471732710.ch15.

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

Huang, Zheng, Wenbin Gong, and FengWei Shao. "A Beidou Laser Link Allocation Scheme Based on Network Throughput Optimization." In Lecture Notes in Electrical Engineering, 505–14. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-3142-9_48.

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

Mishra, Sadhana, Ranjeet Singh Tomar, and Mayank Sharma. "Analysis of Throughput and Spectral Efficiency of the CR Users with Channel Allocation." In Lecture Notes in Electrical Engineering, 1–13. Singapore: Springer Singapore, 2022. http://dx.doi.org/10.1007/978-981-16-8554-5_1.

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

Li, Wei, Kai Xing, and Jing Xu. "A Localized Channel Allocation Approach for Realtime Reliable and High Throughput Communication in Multi-channel Networks." In Wireless Algorithms, Systems, and Applications, 602–11. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21837-3_59.

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

Zhao, Wei, Yanlong Zhai, Han Zhang, and Duzheng Qing. "Resource Allocation and Optimization of Simulation Models Based on Improved Genetic Algorithm in High-Throughput Simulation." In Theory, Methodology, Tools and Applications for Modeling and Simulation of Complex Systems, 632–41. Singapore: Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-10-2669-0_67.

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

Conference papers on the topic "Throughput allocation"

1

Gelado, Isaac, and Michael Garland. "Throughput-oriented GPU memory allocation." In PPoPP '19: 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3293883.3295727.

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

Yao, Chuting, Jia Guo, and Chenyang Yang. "Achieving high throughput with predictive resource allocation." In 2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP). IEEE, 2016. http://dx.doi.org/10.1109/globalsip.2016.7905946.

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

Li, Dong, Minsoo Rhu, Daniel R. Johnson, Mike O'Connor, Mattan Erez, Doug Burger, Donald S. Fussell, and Stephen W. Redder. "Priority-based cache allocation in throughput processors." In 2015 IEEE 21st International Symposium on High Performance Computer Architecture (HPCA). IEEE, 2015. http://dx.doi.org/10.1109/hpca.2015.7056024.

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

Nissel, Ronald, and Markus Rupp. "Dynamic spectrum allocation in cognitive radio: Throughput calculations." In 2016 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom). IEEE, 2016. http://dx.doi.org/10.1109/blackseacom.2016.7901564.

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

Khan, Humayun Zubair, Mudassar Ali, Muhammad Naeem, Imran Rashid, Adil Masood Siddiqui, Muhammad Imran, and Shahid Mumtaz. "Resource Allocation and Throughput Maximization in Decoupled 5G." In 2020 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2020. http://dx.doi.org/10.1109/wcnc45663.2020.9120853.

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

Po-Hao Chang, Chia-Hong Jhang, and Kuo-Hsiang Kuo. "Throughput-based subcarrier allocation for multiuser OFDM system." In 2009 IEEE Radio and Wireless Symposium (RWS). IEEE, 2009. http://dx.doi.org/10.1109/rws.2009.4957366.

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

Hofmann, Sandra, Dominic Schupke, and Frank H. P. Fitzek. "Optimal Throughput Allocation in Air-to-Ground Networks." In GLOBECOM 2020 - 2020 IEEE Global Communications Conference. IEEE, 2020. http://dx.doi.org/10.1109/globecom42002.2020.9348270.

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

Zhang, Dan, Kai Su, and Narayan B. Mandayam. "Network coding aware resource allocation to improve throughput." In 2012 IEEE International Symposium on Information Theory - ISIT. IEEE, 2012. http://dx.doi.org/10.1109/isit.2012.6283070.

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

Gupta, Piyush, and Alexander Stolyar. "Optimal Throughput Allocation in General Random-Access Networks." In 2006 40th Annual Conference on Information Sciences and Systems. IEEE, 2006. http://dx.doi.org/10.1109/ciss.2006.286657.

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

Jar, Marcel, and Gerhard Fettweis. "Throughput maximization for LTE uplink via resource allocation." In 2012 9th International Symposium on Wireless Communication Systems (ISWCS 2012). IEEE, 2012. http://dx.doi.org/10.1109/iswcs.2012.6328347.

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

Reports on the topic "Throughput allocation"

1

McPhedran, R., K. Patel, B. Toombs, P. Menon, M. Patel, J. Disson, K. Porter, A. John, and A. Rayner. Food allergen communication in businesses feasibility trial. Food Standards Agency, March 2021. http://dx.doi.org/10.46756/sci.fsa.tpf160.

Full text
Abstract:
Background: Clear allergen communication in food business operators (FBOs) has been shown to have a positive impact on customers’ perceptions of businesses (Barnett et al., 2013). However, the precise size and nature of this effect is not known: there is a paucity of quantitative evidence in this area, particularly in the form of randomised controlled trials (RCTs). The Food Standards Agency (FSA), in collaboration with Kantar’s Behavioural Practice, conducted a feasibility trial to investigate whether a randomised cluster trial – involving the proactive communication of allergen information at the point of sale in FBOs – is feasible in the United Kingdom (UK). Objectives: The trial sought to establish: ease of recruitments of businesses into trials; customer response rates for in-store outcome surveys; fidelity of intervention delivery by FBO staff; sensitivity of outcome survey measures to change; and appropriateness of the chosen analytical approach. Method: Following a recruitment phase – in which one of fourteen multinational FBOs was successfully recruited – the execution of the feasibility trial involved a quasi-randomised matched-pairs clustered experiment. Each of the FBO’s ten participating branches underwent pair-wise matching, with similarity of branches judged according to four criteria: Food Hygiene Rating Scheme (FHRS) score, average weekly footfall, number of staff and customer satisfaction rating. The allocation ratio for this trial was 1:1: one branch in each pair was assigned to the treatment group by a representative from the FBO, while the other continued to operate in accordance with their standard operating procedure. As a business-based feasibility trial, customers at participating branches throughout the fieldwork period were automatically enrolled in the trial. The trial was single-blind: customers at treatment branches were not aware that they were receiving an intervention. All customers who visited participating branches throughout the fieldwork period were asked to complete a short in-store survey on a tablet affixed in branches. This survey contained four outcome measures which operationalised customers’: perceptions of food safety in the FBO; trust in the FBO; self-reported confidence to ask for allergen information in future visits; and overall satisfaction with their visit. Results: Fieldwork was conducted from the 3 – 20 March 2020, with cessation occurring prematurely due to the closure of outlets following the proliferation of COVID-19. n=177 participants took part in the trial across the ten branches; however, response rates (which ranged between 0.1 - 0.8%) were likely also adversely affected by COVID-19. Intervention fidelity was an issue in this study: while compliance with delivery of the intervention was relatively high in treatment branches (78.9%), erroneous delivery in control branches was also common (46.2%). Survey data were analysed using random-intercept multilevel linear regression models (due to the nesting of customers within branches). Despite the trial’s modest sample size, there was some evidence to suggest that the intervention had a positive effect for those suffering from allergies/intolerances for the ‘trust’ (β = 1.288, p<0.01) and ‘satisfaction’ (β = 0.945, p<0.01) outcome variables. Due to singularity within the fitted linear models, hierarchical Bayes models were used to corroborate the size of these interactions. Conclusions: The results of this trial suggest that a fully powered clustered RCT would likely be feasible in the UK. In this case, the primary challenge in the execution of the trial was the recruitment of FBOs: despite high levels of initial interest from four chains, only one took part. However, it is likely that the proliferation of COVID-19 adversely impacted chain participation – two other FBOs withdrew during branch eligibility assessment and selection, citing COVID-19 as a barrier. COVID-19 also likely lowered the on-site survey response rate: a significant negative Pearson correlation was observed between daily survey completions and COVID-19 cases in the UK, highlighting a likely relationship between the two. Limitations: The trial was quasi-random: selection of branches, pair matching and allocation to treatment/control groups were not systematically conducted. These processes were undertaken by a representative from the FBO’s Safety and Quality Assurance team (with oversight from Kantar representatives on pair matching), as a result of the chain’s internal operational restrictions.
APA, Harvard, Vancouver, ISO, and other styles
2

Zilberman, David, Amir Heiman, and B. McWilliams. Economics of Marketing and Diffusion of Agricultural Inputs. United States Department of Agriculture, November 2003. http://dx.doi.org/10.32747/2003.7586469.bard.

Full text
Abstract:
Specific Research Objective. Develop a theory of technology adoption to analyze the role of promotional tools such as advertising, product sampling, demonstrations, money back guarantees and warranties in inducing technological change. Use this theory to develop criteria for assessing the optimal use of marketing activities in launching new agricultural input technologies. Apply the model to analyze existing patterns of marketing budget allocation among promotional tools for various agricultural input industries in the United States and Israel. Background to the Topic. Marketing tools (money-back guarantees [MBG] demonstration, free sampling and advertising) are used extensively to induce the adoption of agricultural inputs, but there is little understanding of their impacts on the diffusion of new technologies. The agricultural economic literature on technology adoption ignores marketing efforts by the private sector, which may result in misleading extension and technology transfer policies. There is a need to integrate marketing and economic approaches in analyzing technology adoption, especially in the area of agricultural inputs. Major Conclusion. Marketing tools play an important role in reducing uncertainties about product performance. They assist potential buyers to learn both about objective features, about a product, and about product fit to the buyer's need. Tools, such as MBGs and demonstration, provide different information about product fit but also require different degrees of cost for the consumer. In some situations they can be complimentary and optimal strategy combines the use of both. In other situations there will be substitution. Sampling is used to reduce the uncertainty about non-durable goods. An optimal level of informational tools declines throughout the life of a product but stays positive at a steady state. Implications. Recognizing the heterogeneity of consumers and the sources of their uncertainty about new technologies is crucial to develop a marketing strategy that will enhance the adoption of innovation. When fit uncertainty is high, allowing an MBG option, as well as a demonstration, may be an optimal strategy to enhance adoption.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Throughput allocation' 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