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.
This paper proposes a new scheduling scheme which based on user perception, Channel- and QoS-Aware (known as E-MQS scheduler) for real-time traffics in LTE downlink direction. The proposed scheduling scheme is based on the extension of the E-model and the consideration of Maximum Queue Size (MQS) as a an essential factor for the metric. The proposed scheduling scheme is evaluated in LTE heterogeneous...
Remote GPU execution has been proven to increase GPU occupancy and reduce job waiting time in multi-GPU batch-queue systems, by allowing jobs to utilize remote GPUs when there are not enough unoccupied local GPUs available. However, for GPU communication intensive applications, remote GPU communication overhead may account for more than 70% of the applications' execution times. The need for using...
The development of cloud computing technology has been continuously growing since its invention and has attracted the attention of many researchers in the academia and the industry, particularly during the recent years. The majority of organizations, whether large corporate businesses or typical small companies, are moving towards employing this cutting edge technology. Using private cloud provides...
A kind of ant colony optimization algorithm based on Petri nets has been proposed to solve the problem of hybrid flow shop scheduling. First put forward the scheduling model of manufacturing system based on Petri net, then improve the traditional algorithm of ant scheduling algorithm. Finally this algorithm is used in a company which produces automotive glass and has the features of hybrid flow shop...
Cloud computing is an emerging computing technology for large data center that maintains computational resources through the internet, rather than on local computers. The large data centers maintain Cloud computing applications with lots of cost because of power consumption, which results in a new research issue, called Green Cloud computing. Since MapReduce is one of popular Cloud computing models,...
Literature on Differential Fault Analysis (DFA) on AES-128 shows that it is more difficult to attack AES when the fault is induced in the key schedule, than when it is injected in the intermediate states. Recent research shows that DFA on AES key schedule still requires two faulty cipher texts, while it requires only one faulty cipher text and a brute-force search of AES-128 keys when the fault...
In this paper, a frame of guided weapon with network has been proposed, the pitching loop, yawing loop and rolling loop share the network resource by time-division. To maximum the overall performance of the three control loops, an intelligent feedback scheduler is designed to allocate available network resource dynamically according to the limited network bandwidth and variable workload. The scheduler...
The relay-assisted Orthogonal Frequency-Division Multiple Access (OFDMA) cellular system is one of the most promising technology thanks to the enhancements of the system capacity and coverage it provides. However, some special features may lower its positive aspects. In multiple relay case, the asymmetric link problem in the two stages forming the relaying process may result in important resource...
Long Term Evolution (LTE)-Advanced is expected to aggregate multiple Component Carrier (CC)s to fulfil the high data rate requirement. It may serve users with different capabilities in accessing these CCs, e.g., some can access all CCs, whereas some may operate on only one CC. This gives challenges to the packet scheduler to maximize the system performance over all CCs. In this paper we provide a...
In this paper, we consider the problem for maximizing the throughput of a discrete-time wireless network, where only certain sets of links can transmit simultaneously. It is well known that each set of such links can be represented by a configuration vector and the convex hull of the configuration vectors determines the capacity region of the wireless network. In the literature, packet scheduling...
The acoustic propagation speed under water poses significant challenges to the design of underwater sensor networks and their medium access control protocols. Similar to the air, scheduling transmissions under water have significant impacts on throughput, energy consumption, and reliability. Although the conflict scenarios and required scheduling constraints for deriving a collision-free schedule...
In this paper, we present an embedded platform for real-time emulation of nonlinear electrical circuits in an embedded processor. Electrical systems, if complex, are better implemented if split into number of tasks. These tasks will have different priorities and timing deadlines and hence must be managed by an Operating System. We present and evaluate an iteration time based adaptive time step scheduling...
The earliness/tardiness (E/T) case of Hybrid Flow-shop Scheduling problem (HFSP) is an NP hard problem, which is difficult to deal with, however, the local assignment existing in the practical production increases the complexity of this problem. How to solve the combinatorial optimization problem effectively and optimally is still an open issue today. In this paper, differential evolution algorithm...
This paper investigates the multiply-by-7 Elliptic Curve (EC) point P Scalar Multiplication algorithm for reduced computational complexity and enhanced inherent parallel property based on the Area-Time (AT2) metric. The findings were compared with those obtained when the algorithm was again realized on the Jacobian projective coordinate and the Non-Adjacent Form (NAF). The investigation revealed 27%...
This paper presents a mechanism of integrating the concept of reliability with trust management policy in the distributed scheduling algorithms. This algorithm focuses on the distributed computing systems involving collaborative computing. Trust management is achieved with the concept of bidirectional reputation points that are assigned to resource providers and resource consumers. Moreover, concept...
A goal in soft real-time systems is to maintain quality of service in the presence of variations in computation times while efficiently utilizing the system. Several feedback-based scheduling algorithms have been proposed for this application. This paper presents a prediction-based bandwidth reservation policy with the same goal. A proof is presented to show stability, of the job queue. Simulation...
Chip multiprocessor technique has been implemented in embedded systems due to the tremendous computation requirements. Three dimension chip multiprocessor architecture has been studied recently for integrating more functionalities and providing higher performance. The high temperature on chip is a critical issue for the 3D architecture. In this paper, we propose an online thermal prediction model...
The average channel capacity for 3GPP LTE downlink multiuser Multiple Input Multiple Output (MIMO) systems is analyzed in this paper. A packet scheduler is used to exploit the available multiuser diversity in all the three physical domains (i.e., space, time and frequency). A mathematical model is established to derive the channel capacity of multiuser MIMO systems with the frequency domain packet...
Security critical real time applications running over clusters are growing rapidly. Real-time tasks scheduling on cluster become more challenging when security requirement of application is considered. As an application running on cluster demand both timeliness and security, scheduling algorithm should have better performance in terms of both number of tasks accepted and security value received. Running...
A wide range of emerging real-time services require different levels of Quality of Services (QoS) guarantees over wireless networks. Scheduling algorithms play a key role in meeting these QoS requirements. Most of research in this area have been focused on deterministic delay bounds and the statistical bounds of differentiated real-time services are not well known. This paper provides the mathematical...
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.