Scheduling (computing) (Total 612200 Papers Found)

Unlike wired networks, packets transmitted on wireless channels are often subject to burst errors which cause back to back packet losses. Most wireless LAN link layer protocols recover from packet losses by retransmitting lost segments. When the wireless channel is in a burst error state, most retransmission attempts fail, thereby causing poor utilization of the wireless channel. Furthermore, in the event of multiple sessions sharing a wireless link, FIFO packet scheduling can cause the HOL bloc ...
We develop opportunistic scheduling policies for cognitive radio networks that maximize the throughput utility of the secondary (unlicensed) users subject to maximum collision constraints with the primary (licensed) users. We consider a cognitive network with static primary users and potentially mobile secondary users. We use the technique of Lyapunov optimization to design an online flow control, scheduling, and resource allocation algorithm that meets the desired objectives and provides explic ...
This paper considers the problem of determining the achievable rates in multi-hop wireless mesh networks with orthogonal channels. We classify wireless networks with orthogonal channels into two types, half duplex and full duplex, and consider the problem of jointly routing the flows and scheduling transmissions to achieve a given rate vector. We develop tight necessary and sufficient conditions for the achievability of the rate vector. We develop efficient and easy to implement Fully Polynomial ...
This paper proposes a power profile manipulation approach which merges two distinct research directions in low power testing: minimization of test power dissipation and test application time reduction under power constraints. It is shown how complementary techniques can be easily combined through this approach to significantly increase test concurrency under power constraints. This is achieved in two steps: in the first step power dissipation is considered a design objective and consequently it ...
In this paper a new approach for design jlow management is presented. We describe how the inputlouput relations between tools can be defined in a j%nwnap. For this, several concepts are introduced, such as defiing activities for tools, run-time activity identification, hierarchical jlow graphs, modijkation versus extension, and the possibility to have loops in the j?owmap. We also address tool scheduling and the integration of design Jow management in the architecture of afiarne-bared &sign syst ...
Managers of multiple projects with overly constrained resources face difficult decisions in how to allocate resources to minimize the average delay per project or the time to complete the whole set of projects. We address the static resource-constrained multi-project scheduling problem (RCMPSP) with two lateness objectives, project lateness and portfolio lateness. In this context, past research has reported conflicting results on the performance of activity priority rule heuristics and does not ...
A fundamental issue for IS academics and practitioners is how collaborative IT tools can be effectively used to improve group work. Collaborative IT tools are integrated sets of IT functionalities that facilitate communication and information sharing among interconnected entities. Integrating the literature on group support systems with recent work on IT capabilities, this paper introduces the construct of collaborative IT tools leveraging capability. It is defined as the ability of groups to ef ...
Database systems for real-time applications must satisfy timing constraints associated with transactions, in addition to maintaining data consistency. Recently, interests in object-oriented databases have been growing for nontraditional applications of database systems, and several real-time applications are being developed using an objectoriented paradigm. The object-oriented approach seems promising for developing complex real-time database applications. However, it is not clear whether object ...
Effective scheduling is a key concern for the execution of performance driven applications, such as workflows in dynamic and cost driven environment including Cloud. The majority of existing scheduling techniques are based on meta-heuristics that produce good schedules with advance reservation given the current state of Cloud services or heuristics that are dynamic in nature, and map the workflow tasks to services on-the-fly, but lack the ability of generating schedules considering workflow-leve ...
A GPU's computing power lies in its abundant memory bandwidth and massive parallelism. However, its hardware thread schedulers, despite being able to quickly distribute computation to processors, often fail to capitalize on program characteristics effectively, achieving only a fraction of the GPU's full potential. Moreover, current GPUs do not allow programmers or compilers to control this thread scheduling, forfeiting important optimization opportunities at the program level. This paper present ...
  • Koji Sato, Shiro Sakata,
  • 2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS)
  • 2011
In considering home network environment, there is a possibility which provides limited/specific services by configuring the network in accordance with the particular context when linked to a variety of devices. In this paper, a distributed TDMA slot scheduling with prioritized control based on Lamport's bakery algorithm is proposed. The scheduling aims at the realization of media access control methods which can constitute a localized network by measuring the distance to respective node. The pro ...
In this paper we argue that a programming language for real-time systems should support the declaration of timeconstraints, and that those constraints should attach to a well-developed notion of reactions. To make our claims more precise, we introduce Timber, which is a concurrent programming language based on a model of non-blocking, reactive objects. Timber supports both upper and lower time constraints on a reaction, where an upper constraint corresponds to a classical deadline, and a lower c ...
Device-to-device (D2D) discovery in long-term evolution (LTE) cellular network is a major issue in recent 3rd generation partnership project (3GPP) standardization meeting to support commercial/social services and public safety in disaster environment. For the D2D discovery signal transmission, physical uplink shared channel (PUSCH)-like channel structure is being generally considered. In such a channel structure, the discovery signal may be multiplexed with cellular physical uplink control chan ...
Work which may later be pruned is called speculative work. In this paper we present and evaluate a simple and efficient strategy, used in the Muse OR-parallel Prolog system, for better scheduling of speculative work. The strategy concentrates workers on the leftmost available work in the Prolog tree as long as there exists enough parallelism, thus emulating the sequential Prolog execution as much as possible. This strategy therefore makes it less probable that unnecessary work is executed. A new ...
Deadlock detection scheduling is an important, yet oft-overlooked problem that can significantly affect the overall performance of deadlock handling.An excessive initiation of deadlock detection increases overall message usage, resulting in degraded system performance in the absence of deadlocks; while a deficient initiation of deadlock detection increases the deadlock persistence time, resulting in an increased deadlock resolution cost in the presence of deadlocks. Such a performance tradeoff, ...
The Cloud computing has become the fast spread in the field of computing, research and industry in the last few years. As part of the service offered, there are new possibilities to build applications and provide various services to the end user by virtualization through the internet. Task scheduling is the most significant matter in the cloud computing because the user has to pay for resource using on the basis of time, which acts to distribute the load evenly among the system resources by maxi ...
We consider the sequencing of a series of jobs that arrive at a single processor over time. At each job’s arrival time, a due date must be quoted for the job, and the job must complete processing before its quoted due date. The objective is to minimize the sum (or average) of quoted due dates, or equivalently, the average quoted lead time. In this paper, we propose on-line heuristics for this problem and characterize the conditions under which these heuristics are asymptotically optimal. Compu ...
In this paper, we consider the problem of designing controllers for linear plants to be implemented in embedded platforms under stringent real-time constraints. These include preemptive scheduling schemes, under which the execution time allowed for control software tasks is uncertain. In a conservative Hard Real-Time (HRT) design approach, only a control algorithm that (in the worst case) is executable within the minimum time slot guaranteed by the scheduler would be employed. In the spirit of m ...
In the last two decades, the continuous increase of computational power has produced an overwhelming flow of data, which called for a paradigm shift in the computing architecture and large scale data processing mechanisms. MapReduce is a simple and powerful programming model that enables easy development of scalable parallel applications that can process vast amounts of data on large clusters of commodity machines. MapReduce isolates the application from the details of running a distributed prog ...
Future mobile communication networks are scheduled to integrate LEO (Low Earth Orbit) satellites as access points. These networks are conceived to provide various services, multiplexed on the same transmission medium. To meet the requirements for an efficient and flexible mobile access, a CDMA/PRMA protocol (Code Division Multiple Access / Packet Reservation Multiple Access) has been proposed. It is based on a so-called channel access function, which governs the access permission probability dep ...
The Open Pit Mine Production Scheduling Problem (OPMPSP) studied in recent years is usually based on a single geological estimate of material to be excavated and processed over a number of decades. However techniques have now been developed to generate multiple stochastic geological estimates that more accurately describe the uncertain geology. While some attempts have been made to use such multiple estimates in mine production scheduling, none of these allow mining and processing decisions to f ...
In multiuser multiple-input multiple-output (MIMO) downlink systems, orthogonal space division multiplexing (OSDM) techniques have been studied to approach the optimum performance of dirty paper coding with low complexity. Assuming a large number of users in the multiuser system, a proper user scheduling is needed to utilize the OSDM. In addition, the performance of the chosen users can be maximized by properly configuring the numbers of data streams, or the transmission modes. In this paper, we ...
We focus on adaptive policies for load balancing in clustered web servers, based on the size distribution of the requested documents. The proposed scheduling policy, ADAPTLOAD, adapts its balancing parameters on-the-fly, according to changes in the behavior of the customer population such as fluctuations in the intensity of arrivals or document popularity. Detailed performance comparisons via simulation using traces from the 1998 World Cup show that ADAPTLOAD is robust as it consistently outperf ...
We consider a cross-layer design of wireless ad-hoc networks. Traditional networking approaches optimize separately each of the three layers: physical layer, medium access and routing. This may lead to largely suboptimal network designs. In this work, we propose a jointly optimal design of the three layers, and we show a significant performance improvement over the conventional approach. In the first part of this thesis, our goal is to select appropriate performance metrics for the joint optimiz ...
FlexRay, as the next generation bus for automotive industry, have the prominent features including high data rates, time/event-triggered behavior, redundancy, fault-tolerance and deterministic. It has application for safety critic domain. According to the design and analysis processes of V model, a survey of the work on scheduling analysis of FlexRay bus was given. Secondly, an error in any of these systems results, not only malfunctions, but also loss of human lives. Verification and validation ...
  • Tony Saleh, Mira Thoumy,
  • 2018 7th International Conference on Industrial Technology and Management (ICITM)
  • 2018
This research explores the effect of the implementation status of Enterprise Resource Planning ERP system on operational performance. Through the use of questionnaire, the collected data indicated that the implementation status of ERP modules have a positive varying effect on operational performance measures. The results also showed that each of the modules have an impact on the overall operational performance, specifically Controlling 37.5%, Sales and distribution 37.4%, Customer relationship m ...
In a Local Area Network of computers, often a machine wants to learn of the existence of all the others satisfying some condition. Specifically, there are a number of existing discovery algorithms which permit an enumerator to reliably discover protocol participants, many of them idealised. This paper provides a new technique which controls the load placed on the network, minimises the time to completion, handles networks with significant loss, and scales over many orders of magnitude. Most sign ...
This paper proposes a method that dynamically improves a statistical model of system degradation by incorporating uncertainty. The method is illustrated by a case example of fouling, or degradation, in a heat exchanger in a cogeneration desalination plant. The goal of the proposed method is to select the best model from several representative condenser fouling models including linear, falling rate, and asymptotic fouling, and to validate and improve model parameters over the duration of operatio ...
In this paper, a systematic practice for verifying a scheduler and a CTC using a virtual cluster tool (VCT) model are presented, which emulates the operational behavior of a real cluster tool with high fidelity. The model architecture and modeling strategies of the VCT were also explained. This paper also presented the use of a formal model-based automatic error-detection technique and discussed experiences of verifying a real cluster tool controller using the VCT. ...
To improve the reliability and economic of the power system becomes a focus for power scholars. The establishment of economic dispatch model for power system is of great significance.In this paper, a slight increase of consumption rates and other criteria is applied, considering the output limits of the generator active power and the loss of transmission line, it establishes an economic dispatch model of the combined power system. According to the model, it also gives the economic scheduling alg ...
  • Daojun Xue, Yang Qin, Chee Kheong Siew,
  • 2005 13th IEEE International Conference on Networks Jointly held with the 2005 IEEE 7th Malaysia International Conf on Communic
  • 2005
We consider the scheduling problem in a new optical transport network called time-domain wavelength interleaved networks (TWIN). Due to the innovative architecture of TWIN, four issues are essential in the designing of scheduling schemes: there are no transmitting/receiving conflicts; propagation delays are observed; throughput is maximized; queueing delay and delay variance are kept as small as possible. We formulate the scheduling problem into an integer linear programming (ILP) problem and pr ...
There are different types of computational approaches like deterministic, random and evolutionary. Evolutionary techniques are also known as nature inspired techniques as these types of techniques have stolen the idea from nature. Genetic algorithm (GA) is one of the most commonly used evolutionary techniques which is used to solve different NP-hard computational problems. GA is based upon the principle of human genetic. Past research shows that it has been effectively used to solve the differen ...
This paper presents the design of a fuzzy gain scheduled proportional-integral (FGSPI) controller for load frequency control (LFC) of two-area multi unit power system with and without superconducting magnetic energy storage (SMES) unit in each area. The power system comprises of two reheat type thermal units of same capacity in each area. The dynamic response has been studied for 1% step load perturbation in area-1, using settling times, overshoots and undershoots of the tie-line power and ...
Almost all of the research on the economic lot scheduling problem (ELSP) has assumed that setup times are sequence-independent even though sequence-dependent problems are common in practice. Furthermore, most of the solution approaches that have been developed solve for a single optimal schedule when in practice it is more important to provide managers with a range of schedules of different length and complexity. In this paper, we develop a heuristic procedure to solve the ELSP problem with sequ ...
This paper introduces SER – Scheduling by Edge Reversal with Hibernation, a novel distributed algorithm for the scheduling of atomic shared resources in the context of dynamic load reconfiguration. The new algorithm keeps the simplicity and daintiness of the Scheduling by Edge Reversal (SER) distributed algorithm, originally conceived to support the heavy load condition. Both SER and SER distributed algorithms share the same communication and computational complexities and can also be seen as ...
We consider scheduling in wireless networks and formulate it as a Maximum Weighted Independent Set (MWIS) problem on a "conflict" graph that captures interference among simultaneous transmissions. We propose a novel, low-complexity, and fully distributed algorithm that yields high-quality feasible solutions. Our proposed algorithm consists of two phases, each of which requires only local information and is based on message-passing. The first phase solves a relaxation of the MWIS problem using a ...
The use of cloud computing that provides resources on demand to various types of users, including enterprises as well as engineering and scientific institutions, is growing rapidly. An effective resource management middleware is necessary to harness the power of the underlying distributed hardware in a cloud. Two of the key operations provided by a resource manager are resource allocation (matchmaking) and scheduling. This paper concerns the problem of matchmaking and scheduling an open stream o ...
One of the most important problems in the eecient use of parallel systems is to distribute the workload evenly among the servers. An instance of this problem is the problem of independent allocations where the tasks can be executed independently. This paper presents an overview on some results obtained by several authors for the independent allocation problem using an approach of Azar, Broder, Karlin, and Upfal. The algorithms presented here apply to several problems, including Load-Balancing in ...
The IEEE 802.16 Working Group on Broadband Wireless Access is developing the standard for broadband wireless access networks in Metropolitan Area Network (MAN), also know as WiMAX. One of the features of the 802.16 MAC layer is that it is designed to differentiate service among traffic categories with different multimedia requirements. Based on these assumptions and considering that the standard does not specify a scheduling algorithm, an original analytical model was proposed based on Latency-R ...
In view of the demands for production scheduling of modern manufacturing corporation, the Job-shop Dynamic Scheduling (JDS) model is originally set up based on the theory of resource optimization. Due to the complicated nature of the JDS, a framework Heuristic Immune Algorithm (HIA) for production scheduling is put forward. Finally, the method mentioned above is applied to solve the JDS of Shanghai Volksvagen, Automobile Co.Ltd. , and the most optimal scheduling can be attained. The simulation r ...
Hybridization is the burning topic now-a-days. Therefore, extensive studies are taking place on this topic. It leads to more efficiency and robustness of the hybridized algorithms. Hybrid algorithms can be used to solve various set of problems like scheduling, engineering design problems, medical image processing, data clustering, geometric place optimization problems etc. In all, it can be said that hybridization is very promising technique. It offers potential advantages. Therefore, this paper ...
Wide area networks, based on wavelength division multiplexed (WDM) optical networks, have limitations resulting from signal quality degradations, as the signals propagates along the fiber network. To overcome this problem, the notion of 3R regeneration has been investigated recently. At selected nodes in the WDM network, 3R regeneration facilities are included to reshape, reamplify and retime the signals. Scheduled traffic model (STM) has been proposed recently to take advantage of situations wh ...
Most cluster tool scheduling studies assume identical access times between chambers, or do not discuss impact of the access times although the optimal scheduling rule and the cycle time can depend on the access times or physical configuration of parallel chambers. We examine cyclic scheduling problems for cluster tools that have non-identical access times. We first develop Petri net models of tool behaviors and analyze the cycle time by identifying the workloads of the process steps. We prove th ...
Problems requiring the synthesis of a collection of plans accomplishing distinct (but mostly related) goals has received increasing attention within Al. Such problems are typically formulated as multiagent planning problems, emphasizing a problem decomposition wherein individual agents assume responsibility for the generation of individual plans while taking into account the goals and beliefs of other agents in the system. One consequence of such a problem decomposition is a simplified view of r ...
Flexible job shop scheduling problem (FJSP) is an important extension of the classical job shop scheduling problem, where each operation could be processed on more than one machine and vice versa. Since it has been proven that this problem is strongly NP-hard, it is difficult to achieve an optimal solution with traditional optimization algorithms. In this paper a new approach is proposed to solve the multi-objective FJSP. This new approach has three steps. First, an initial population of feasibl ...
Up to now the parameter space approach was either utilized for robustness analysis or for design of fixed gain controllers. This paper presents an extension of this method which allows the design of gain scheduling controllers which simultaneously stabilize a finite number of representatives of an uncertain plant. The approach is applied to an automotive control example. ...
A grid is a wide-area computing environment for cross-domain resource sharing and service integration. Software agents are one of mainstream technologies for management of geographically distributed grid resources. In this work, self-organization mechanisms are investigated for multiple agents to cooperate with each other so that an overall grid load balancing and resource scheduling can be achieved. In particular, an ant-like self-organizing mechanism is introduced and proved to be powerful to ...
Space missions have a growing interest in putting multi-core processors onboard spacecraft. For many missions processing power significantly slows operations. We investigate how continual planning and scheduling algorithms can exploit multi-core processing and outline different potential design decisions for a parallelized planning architecture. This organization of choices and challenges helps us with an initial design for parallelizing the CASPER planning system for a mesh multi-core processor ...