The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Real-Time Bidding allows an advertiser to purchase media inventory through an auction system that unfolds in the order of milliseconds. Media providers are increasingly being integrated into such programmatic buying platforms. It is typical for a contemporary Real-Time Bidding system to receive millions of bid requests per second at peak time, and have a large portion of these to be irrelevant to...
Several decentralized load balancing policies have been proposed to address the issue of scalability in grids.However, the communication overhead incurred in exchanging state information remains a burden. In this paper, we propose a dynamic, decentralized load balancing policy which performs very competitively in heterogeneous grids. The policy uses an effective mechanism for state information exchange,...
HLA-based simulations, as any distributed computing application, can undergo critical performance issues due to load imbalances on large-scale, heterogeneous, non-dedicated distributed systems. Such imbalances are produced by HLA simulation entities that can dynamically change their computation and communication load during their execution time, so an initial static load deployment is incapable of...
The performance of the existing non-contiguous processor allocation strategies has been traditionally carried out by means of simulation based on synthetic workload models to generate streams of incoming jobs. To validate the performance of the existing algorithms, there is need to evaluate the algorithms' performance based on real workload traces. In this paper, we evaluate the performance of several...
We consider a self-managing, self-organizing pool of virtualized computer servers that provides infrastructure as a service (IaaS) for enterprise computing workloads. A global controller automatically manages the pool in a top down manner by periodically varying the number of servers used and re-assigning workloads to different servers. It aims to use as few servers as possible to minimize power usage...
Multi-nexthop routing mechanisms is the key point in network congestion, and the essential question is how to forward packets among multi-nexthop to reach equiponderant forwarding. This paper proposes an equiponderant forwarding strategy in multi-nexthop routing, which forwards the packets according to the actual capability of each node, and resolves the equiponderant forwarding problem of multi-nexthop...
Recently, two SRP-based synchronization protocols for hierarchically scheduled real-time systems based on fixed priority preemptive scheduling (FPPS) have been presented, i.e., HSRP and SIRAP. Preventing depletion of budget during global resource access, the former implements an overrun mechanism, while the later exploits a skipping mechanism. A theoretical comparison of the performance of these mechanisms...
Embedded systems often require small code size due to their tight memory constraints. Although the reduced encoding architectures such as the ARM THUMB or the MIPS-16 can successfully reduce the code size due to its half-sized instructions, they suffer from higher spills due to their shortened register fields which constrain available registers, thus affecting the code size and the performance negatively...
This work investigates the problem of dynamic, intra-query load balancing in parallel database queries across heterogeneous nodes in a way that takes into account the inherent cost of adaptations and thus avoids both over-reacting and deciding when to adapt in a completely heuristic manner. The latter may lead to serious performance degradation in several cases, such as periodic and random imbalances...
Cross-border flows of electricity and the related cost recovery mechanisms have been discussed extensively within the TSO community as power markets have increasingly been integrated and the subsequent exchanges of electricity have increase considerably. Simple tariffication schemes typically fail to explain all effects of mutual usage between market participants such as generators and loads in interconnected...
This paper presents a new method for transmission loss allocation based on complex power flow tracing. Building on previous works of the author, the paper presents a generalized model for the transmission line, which is used as the building block for the complex power flow tracing algorithm. The developed line model is similar to the famous generalized circuit constants, ABCD, model. While the ABCD...
We consider the problem of maximizing the weighted sum data rate in multi-cell and multi-carrier wireless data systems in the presence of interference. We present a scheme that jointly considers load balancing, user scheduling, and interference mitigation to improve the system performance. Our proposed scheme iteratively applies two processes. The first process solves the sub-problem of load balancing...
The status quo of enterprises' load imbalance in most clusters makes the economical function of the clusters far under the level which them should have. In order to improve the function, it is necessary to carry out working procedures, parts, components and products' order allocation in clusters. At present, there is no an effective and mature method of order allocation for enterprises in a cluster,...
In this paper dynamic spectrum trading is addressed, where time-frequency resources are traded between network operators on a short-term basis to meet current demands. Specifically, we derive the probability of system overload for the entire network as well as for a single operator. Numerical results demonstrate that by dynamically adjusting the resource assignment to operators on a short-term basis,...
This study addresses the issue of quantitative measure of fair resource allocation in multiservice networks considering to self-similarity properties in traffic.
Based on the research of existing scheduling algorithms, max-min algorithm and min-min algorithm was analyzed, a modified scheduling algorithm filter-min-min algorithm was proposed. Simulation shows it is reasonable and efficient.
A load-based relay selection algorithm that improves the fairness of resource allocation is proposed for relay-based OFDMA systems. This algorithm takes into account the traffic load condition (bandwidth requirement) of relay link users and direct link users. The transmission mode (direct transmission mode or relay transmission mode) of each user will be adjusted based on the user average data rate;...
This paper focuses on how to design a store buffer (STB) well suited to first-level multibanked data caches. The goal is to forward data from in-flight stores into dependent loads within the latency of a cache bank. Taking into account the store lifetime in the processor pipeline and the data forwarding behavior, we propose a particular two-level STB design in which forwarding is done speculatively...
In this paper, we propose a resource management model that extends the contract net protocol by integrating the advantages of the matchmaking technique. Our model addresses the issues of matchmaker overload and the lack of up-to-date resource state information suffered by the original matchmaking model. It also enables resource requesters to obtain a list of qualified resources with which they can...
Scheduling large-scale applications on the Grid is a fundamental challenge and is critical to application performance and cost. Large-scale applications typically contain a large number of homogeneous and concurrent activities which are main bottlenecks, but open great potentials for optimization. This paper presents a new formulation of the well-known NP-complete problems and two novel algorithms...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.