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.
Integrated scheduling algorithm based on dynamic essential short path, calculates essential path length of operations on the same device and schedules operation on essential short path previously, so it can avoid the problem of forming essential long path and extending the product finishing time effectively; Reverse dynamic critical paths integrated scheduling algorithm, schedules father nodes firstly,...
To maximize the utilization of system resources with satisfying diverse quality of service (QoS) requirements, a novel multiple utility factors-based parallel (MUFP) packet scheduling algorithm is proposed for the broadcast base station (BBS) and cell base station (CBS) mixed mode of broadband wireless multimedia (BWM) systems. MUFP takes into consideration QoS requirements, queue dynamics and channel...
Hardware tasks scheduling is the effect of reconfigurable system performance of important factor.This paper presents a VLSCA algorithm which considers the placement according to the vertex position of hardware task and the adjacent units numbers of temporal dimension.At the same time,this algorithm introduces the compactness of task in three-space as an important index of choosing reasonable placement,which...
Several different users can be arranged by MIMO (Multiple-Input Multiple-Output) multi-user systems to communicate with a base station at the same time in one time slot. Besides, with the increases of scheduling users, much larger capability and diversity gain of the system can be obtained. As for a scheduling algorithm, exhaustive method is an approach that can get the largest capability of the system...
For advanced per-flow service disciplines at high-speed network links, it is essential to maintain priority queues in sorted order. The scalable priority queue implementation requires managing a large number of queues at ever increasing line speeds. In this paper, we propose novel solutions to the management of priority queues using a previously proposed pipelined Counting Priority Index (pCPI) structure...
Some current Internet applications (e.g., Grid/Cloud computing storage, video-conference) demand service differentiation, not only in terms of packet forwarding, but also at the connection level. To satisfy the demands for delay-sensitive and low-blocking applications, immediate reservation (IR) and advance reservation (AR) can be performed. Independent resource reservation of each type of network...
3GPP's Long Term Evolution is defined by the standardization body's Release 8 and 9, and provides more than a substrate for 3GPP's IMT-Advanced candidate, namely LTE-Advanced, which is due to be defined in Release 10. Both LTE and LTE-Advanced have SC-FDMA in their uplink, a multi-carrier access technique requiring contiguous subcarriers allocations for each UE. No scheduling algorithm, however, is...
Uplink resource allocation with intercell interference mitigation in LTE networks is investigated. A non-cooperative probabilistic interference avoidance scheme and a pricing-based cooperative power control scheme are proposed. A scheduling algorithm is presented and used with the proposed interference mitigation schemes. In the absence of power control, scheduling with the probabilistic interference...
Grid computing comprises of distributed computer systems which are geographically dispersed to share the combination of resources in a heterogeneous environment. Grid computing is one of the latest technologies to solve very complex problems in scientific applications, using the resource sharing concept in the dynamic virtual organizations. The main problem occurs in most of the organization is that...
In a multiuser MIMO cellular system where there are many candidate users, it is critical to select a user group which maximizes the overall throughput of the system. However, the optimal scheduling strategy is computationally prohibitive when the total number of users is large. In this paper, we propose a determinant based user selection algorithm which reduces the search complexity without much performance...
In multiuser multiple input multiple output (MIMO) systems, it is optimal to serve multiple users at the same time in order to achieve high data rates. However, the use of a transmit beamforming technique requires a well designed user selection scheme to obtain good performances. The optimal scheduling solution can only be obtained through a highly computationally complex exhaustive search. In addition,...
In this paper, we investigate an interference alignment (IA) technique introduced by Cadambe and Jafar in mutually interfering broadcast channels (IFBCs). First, we study the spatial multiplexing gain (SMG) for the 3-cell IFBC where all base stations and mobile users are equipped with multiple antennas. To achieve the derived optimal SMG, we extend the IA algorithm designed for K-user multi-input...
Multi-path routing is essential in wireless sensor data collection to overcome the high loss rates in wireless environments. In this paper, we propose an efficient scheduling algorithm for data collection through multi-path routing structures in wireless sensor networks. The message complexity of our proposed scheduling algorithm is O(n(Δ + 3)), where n is the number of sensor nodes in...
One of the major challenges to integrate the wireless LAN technology into portable devices is the limited battery life. The IEEE 802.11e introduced an advanced architecture to improve 802.11 power saving mechanism, named Scheduled Automatic Power Save Delivery (S-APSD). In S-APSD, the access point negotiates periodical schedules with wireless Stations (STA) to deliver buffered traffic and thus prevents...
Task scheduling is an important part of high performance multi-core building. The shortcomings of existing task scheduling algorithms is analyzed, and a new efficient heuristic task scheduling algorithm, namely,HCDDSL is proposed in this paper. Firstly, the new algorithm optimizes DAG graph by using clustering, then the nodes are descended by the values of Succ_sum,the task schedule has been processed...
Sarkar's edge zeroing heuristic [22] for scheduling precedence constrained task graphs on parallel systems can be viewed as a priority based algorithm in which the priority is assigned to edges. In this algorithm, the priority is taken as the edge weight. This can also be viewed as a module dependent priority function that is defined for pairs of modules. We have extended this idea in which the priority...
Internet traffic has increased at a very fast pace in recent years. The traffic demand requires that future packet switching systems should be able to switch packets in a very short time, i.e., just a few nanoseconds. Algorithms with lower computation complexity are more desirable for this high-speed switching design. Among the existing algorithms that can achieve 100% throughput for input-queued...
In TDMA based wireless mesh networks, routing and scheduling algorithms are essential to provide QoS support for mesh clients. In order to maximize the network throughput and minimize session delay, the routing and scheduling algorithms should produce a minimum length schedule. A linear programming formulation enables an optimal solution, however has very high computational cost. In this paper, we...
Publish/subscribe paradigm is seen as a good candidate in constructing distributed applications due to its unique and powerful features such as anonymity, asynchrony and many-to-many communication. As applications based on publish/subscribe increases greatly it is required to support different quality of service properties. However, most current solutions adopt simple matching strategies without distinguishing...
We recently proposed the two-step scheduling framework (TSS) for multi-card optical switches: first, input ports on each card are assigned a different wavelength, then for every wavelength a matching is found among all cards. The proposed framework significantly improves the scheduler scalability and seamlessly adheres to the modular switch architectural constraints. In this paper TSS is evaluated...
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.