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.
In this paper, we propose a flexible workflow scheduler that facilitates the replacement of the objective function according to the user's needs. The possibility of replacing the objective function extends the usability of the scheduler for a variety of objectives. The proposed flexible scheduler uses Particle Swarm Optimization (PSO) to assist the production of schedules on cloud resources. We perform...
Academic institutions are moving toward automated management of the educational process. One aspect of this process is the exam scheduling. The large number of students, classes, professors, and venues renders the manual scheduling process tedious and useless. In this paper, we describe the efforts of the Arab East College for High Education in Saudi Arabia in scheduling exams in the least number...
Recently due to the increasing pressure to improve the efficiency of port operations, a great deal of research has been devoted to optimizing container terminal operations. Most papers deal with either the berth allocation problem or the crane scheduling problem. However only a limited number of papers deal with both, berth allocation and crane scheduling through either a combined model of the two...
The development of distributed systems based on poorly specified abstractions can hinder unambiguous understanding and the creation of common formal analysis methods. In this paper, we outline the design of a system modeling language called DS2, and point out how its primitives are well matched with concerns that naturally arise during distributed system design. We present an operational semantics...
This paper proposes an N-modular redundancy (NMR) technique with low energy-overhead for hard real-time multi-core systems. NMR is well-suited for multi-core platforms as they provide multiple processing units and low-overhead communication for voting. However, it can impose considerable energy overhead and hence its energy overhead must be controlled, which is the primary consideration of this paper...
The ascending increase in the numbers of Plug-in Electric Vehicles (PEVs) in the world brought forward many new challenges to the power grid and utility networks. Some of these challenges are related to finding and managing additional power resources for these PEVs. Green power is one of the alternatives but, we still need to find a cheap way to store this power, PEVs could play a significant role...
In this paper, we propose a procedure based on Particle Swarm Optimization (PSO) to guide the user in splitting an amount of CPU capacity (sum of frequencies) among a fixed number of resources in order to minimize the execution time (makespan) of the workflow. The proposed procedure was evaluated and compared with a naive approach, which selects only identical CPU frequency configurations for resources...
Inis paper proposes the improved method 01 resource block group allocation to user's equipment (UE). This method resolves the disadvantage of Max C/I ratio method when single user station with highest SNR may occupy the channel for a long time.
Examination scheduling is a very important task that has to be done in all academic institutions periodically. Formulating exam schedules manually requires immense time and effort, due to the presence of a large number of conflicting constraints that must be satisfied. In this study, we tackle the examination scheduling problem that is specific to the female section in our college, and particularly...
The importance of electric vehicles (EVs) have been increasing in recent years. The electricity demands of EVs may have significant impacts on the electric power grid if the charging is not scheduled properly. This paper views PEV charging as a single stage decision making problem and proposes the use of pursuit algorithm for solving the decision making problem with the goal of minimizing the cost...
Modern reconfigurable devices such as FPGAs can be reconfigured at run time. Some of them can be dynamically partially reconfigured, which means part of the FPGA is changed without interrupting other parts. This feature adds tremendous flexibility to the Reconfigurable Computing (RC) Field but also introduces challenges. Reconfigurable Operating Systems tend to ease applications development and most...
This paper presents new energy-aware QoS scheduling and call admission control algorithms for WiMAX IEEE 802.16e broadband wireless access standard. The scheduling algorithm works at MAC layer and is designed towards minimizing power consumption at mobile stations supporting multiple UGS connections, while meeting the QoS requirements of the connections. The scheduling algorithm uses a novel idea...
Airborne backbone networks are useful in tactical applications to interconnect sub-networks. A major challenge in such networks, normally comprising large numbers of highly mobile nodes, is the design of the medium access control (MAC) and routing protocols. We propose integration of MAC and routing functions, which use the attributes of a clustering scheme that addresses scalability. The reactive...
In this paper, we present an extension of the classical Resource Constrained Project Scheduling Problem (RCPSP). We present a new type of resource constraints in which staff members are involved. We present a new model where staff members can have several skills with different proficiency, i.e., a staff member is able to perform more than one kind of activity as well as the time need is complete the...
The class scheduling problem can be modeled by a graph where the vertices and edges represent the courses and the common students, respectively. The problem is to assign the courses a given number of time slots (colors), where each time slot can be used for a given number of class rooms. The Vertex Coloring (VC) algorithm is a polynomial time algorithm which produces a conflict free solution using...
In this paper we explore a fundamental joint routing and scheduling problem in wireless mesh networks (WMNs) that employ time division multiple access (TDMA). The problem, referred to as the minimum cost single flow routing and scheduling (MC-SFRS) problem, deals with incremental update of transmission schedules necessitated by dynamic arrival of new flows and termination of existing flows during...
Managed languages such as Java and C# are increasingly being considered for hard real-time applications because of their productivity and software engineering advantages. Automatic memory management, or garbage collection, is a key enabler for robust, reusable libraries, yet remains a challenge for analysis and implementation of real-time execution environments. This paper comprehensively compares...
IEEE 802.22 wireless regional area network (WRAN) is an emerging cognitive radio-based system. One of the major challenges for WRANs is how to efficiently schedule both channel sensing and data transmission for multiple adjacent WRAN cells. This challenge is known as coexistence problem. In this paper, we propose four schemes that aim at reducing the coexistence-problem effect. These schemes are based...
We revisit the problem of scheduling the sources transmissions in a many-to-one flow to provide reliable communication between n sources and a single destination. The performance of coding-aware scheduling is studied based on both digital network coding (DNC) and analog network coding (ANC). We discuss some special cases in which an optimal ANC-based schedule can be constructed efficiently. Finally,...
One has a large workload that is ldquodivisiblerdquo-its constituent work's granularity can be adjusted arbitrarily;-and one has access to p remote computers that can assist in computing the workload. The problem is that the remote computers are subject to interruptions of known likelihood that kill all work in progress. One wishes to orchestrate sharing the workload with the remote computers in a...
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.