Conferences related to Scheduling

Back to Top

2014 14th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid)

The CCGrid symposium provides a major international forum for presenting and sharing recent research accomplishments and technological developments in the field of Cluster,Cloud and Grid computing. The symposium is attended by researchers and practitioners from both industry and academia. In 2013 the conference will be held in Chicago Illinois USA.


IEEE INFOCOM 2014 - IEEE Conference on Computer Communications

The IEEE Conference on Computer Communications addresses key topics and issues related to computer communications, with emphasis on traffic management and protocols for both wired and wireless networks. Material is presented in a program of technical sessions, panel discussions and workshops.


2013 IEEE 27th International Conference on Advanced Information Networking and Applications (AINA)

The conference covers theory, design and application of computer networks and distributed computing and information systems.


2012 19th International Conference on High Performance Computing (HiPC)

HiPC is an international meeting on high performance computing. It serves as a forum to present current work by researchers from around the world as well as highlight activities in Asia in the high performance computing area. The meeting focuses on all aspects of high performance computing systems and their scientific, engineering, and commercial applications.


2012 24th Chinese Control and Decision Conference (CCDC)

Chinese Control and Decision Conference is an annual international conference to create a forum for scientists, engineers and practitioners throughout the world to present the latest advancement in Control, Decision, Automation, Robotics and Emerging Technologies.

  • 2011 23rd Chinese Control and Decision Conference (CCDC)

    Chinese Control and Decision Conference is an annual international conference to create a forum for scientists, engineers and practitioners throughout the world to present the latest advancement in Control, Decision, Automation, Robotics and Emerging Technologies.

  • 2010 Chinese Control and Decision Conference (CCDC)

    Chinese Control and Decision Conference is an annual international conference to create a forum for scientists, engineers and practitioners throughout the world to present the latest advancement in Control, Decision, Automation, Robotics and Emerging Technologies

  • 2009 Chinese Control and Decision Conference (CCDC)

    Chinese Control and Decision Conference is an annual international conference to create a forum for scientists, engineers and practitioners throughout the world to present the latest advancement in Control, Decision, Automation, Robotics and Emerging Technologies.


More Conferences

Periodicals related to Scheduling

Back to Top

Broadcasting, IEEE Transactions on

Broadcast technology, including devices, equipment, techniques, and systems related to broadcast technology, including the production, distribution, transmission, and propagation aspects.


Communications Magazine, IEEE

IEEE Communications Magazine was the number three most-cited journal in telecommunications and the number eighteen cited journal in electrical and electronics engineering in 2004, according to the annual Journal Citation Report (2004 edition) published by the Institute for Scientific Information. Read more at http://www.ieee.org/products/citations.html. This magazine covers all areas of communications such as lightwave telecommunications, high-speed data communications, personal communications ...


Lightwave Technology, Journal of

All aspects of optical guided-wave science, technology, and engineering in the areas of fiber and cable technologies; active and passive guided-wave componentry (light sources, detectors, repeaters, switches, fiber sensors, etc.); integrated optics and optoelectronics; systems and subsystems; new applications; and unique field trials.


Network and Service Management, IEEE Transactions on

The online-only IEEE Transactions on Network and Service Management (TNSM) will be committed to the timely publication of archival-quality papers that advance the state-of-the-art and practical applications of network and service management. Both theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. This Transactions will focus on ...


Smart Grid, IEEE Transactions on

The IEEE Transactions on Smart Grid is intended to be a cross disciplinary and internationally archival journal aimed at disseminating the results of research on smart grid that relates to energy generation, transmission, distribution and delivery. The journal will publish original research on theories, technologies, design, policies, and implementation of smart grid. The Transactions will welcome manuscripts on design, implementation ...


More Periodicals

Most published Xplore authors for Scheduling

Back to Top

Xplore Articles related to Scheduling

Back to Top

Packet-Mode Emulation of Output-Queued Switches

Hagit Attiya; David Hay; Isaac Keslassy IEEE Transactions on Computers, 2010

Most common network protocols transmit variable size packets, whereas contemporary switches still operate with fixed- size cells, which are easier to transmit and buffer. This necessitates packet segmentation and reassembly modules, resulting in significant computation and communication overhead that might be too costly as switches become faster and bigger. It is, therefore, imperative to investigate an alternative mode of scheduling ...


Wind integration and the need for advanced decision support tools

C. R. Philbrick 2011 IEEE Power and Energy Society General Meeting, 2011

Integration of wind power will require significant changes to traditional methods used for system planning and operations. In particular, the probabilistic nature of wind will require modifications of traditional unit commitment and economic dispatch tools. These modifications are needed to allow planning studies to more accurately capture the impact that operation policies have on grid reliability and production cost. These ...


Interdependence of booking and queuing in remote laboratory scheduling

D. Lowe; N. Orou Remote Engineering and Virtual Instrumentation (REV), 2012 9th International Conference on, 2012

Optimized scheduling can significantly improve the utilization level of Remote Access Laboratories (RAL) resources and decrease the waiting time. Current RAL systems have typically supported either booking or queuing, though rarely both. In this paper we investigate issues that arise when a single RAL resource (or pool of resources) supports both modes for gaining access. This research analyses the scheduling ...


Ranking the solution techniques for reactive scheduling problem in operating room

Vahid Farrokhi; Imed Kacem; Lá szló Pokorá di Control, Decision and Information Technologies (CoDIT), 2014 International Conference on, 2014

The main aim of this paper is to express the techniques which can solve reactive scheduling problem in operating room and then compare them for ranking. On the one hand importance of scheduling for operating rooms in hospitals is increasing for the reasons like hospitals reputations and expenses and on the other hand in real world, scheduling of operating rooms ...


The Identification of Enterprise Dynamic Competitor Based on Cluster Analysis

Zhong Zheng 2011 International Conference on Information Management, Innovation Management and Industrial Engineering, 2011

Unlike former methods for competitor identification, this paper for the first time applies a two-dimensional index system (market commonality and resource similarity) as criteria. Based on the dynamic competitor analysis framework put forward by Professor Chen Mingzhe, the author employed quantitative statistics methods of cluster analysis and matching analysis to identify and classify the dynamic competitors for the target enterprise ...


More Xplore Articles

Educational Resources on Scheduling

Back to Top

eLearning

Packet-Mode Emulation of Output-Queued Switches

Hagit Attiya; David Hay; Isaac Keslassy IEEE Transactions on Computers, 2010

Most common network protocols transmit variable size packets, whereas contemporary switches still operate with fixed- size cells, which are easier to transmit and buffer. This necessitates packet segmentation and reassembly modules, resulting in significant computation and communication overhead that might be too costly as switches become faster and bigger. It is, therefore, imperative to investigate an alternative mode of scheduling ...


Wind integration and the need for advanced decision support tools

C. R. Philbrick 2011 IEEE Power and Energy Society General Meeting, 2011

Integration of wind power will require significant changes to traditional methods used for system planning and operations. In particular, the probabilistic nature of wind will require modifications of traditional unit commitment and economic dispatch tools. These modifications are needed to allow planning studies to more accurately capture the impact that operation policies have on grid reliability and production cost. These ...


Interdependence of booking and queuing in remote laboratory scheduling

D. Lowe; N. Orou Remote Engineering and Virtual Instrumentation (REV), 2012 9th International Conference on, 2012

Optimized scheduling can significantly improve the utilization level of Remote Access Laboratories (RAL) resources and decrease the waiting time. Current RAL systems have typically supported either booking or queuing, though rarely both. In this paper we investigate issues that arise when a single RAL resource (or pool of resources) supports both modes for gaining access. This research analyses the scheduling ...


Ranking the solution techniques for reactive scheduling problem in operating room

Vahid Farrokhi; Imed Kacem; Lá szló Pokorá di Control, Decision and Information Technologies (CoDIT), 2014 International Conference on, 2014

The main aim of this paper is to express the techniques which can solve reactive scheduling problem in operating room and then compare them for ranking. On the one hand importance of scheduling for operating rooms in hospitals is increasing for the reasons like hospitals reputations and expenses and on the other hand in real world, scheduling of operating rooms ...


The Identification of Enterprise Dynamic Competitor Based on Cluster Analysis

Zhong Zheng 2011 International Conference on Information Management, Innovation Management and Industrial Engineering, 2011

Unlike former methods for competitor identification, this paper for the first time applies a two-dimensional index system (market commonality and resource similarity) as criteria. Based on the dynamic competitor analysis framework put forward by Professor Chen Mingzhe, the author employed quantitative statistics methods of cluster analysis and matching analysis to identify and classify the dynamic competitors for the target enterprise ...


More eLearning Resources

IEEE.tv Videos

No IEEE.tv Videos are currently tagged "Scheduling"

IEEE-USA E-Books

  • Index

    Online decision making under uncertainty and time constraints represents one of the most challenging problems for robust intelligent agents. In an increasingly dynamic, interconnected, and real-time world, intelligent systems must adapt dynamically to uncertainties, update existing plans to accommodate new requests and events, and produce high-quality decisions under severe time constraints. Such online decision-making applications are becoming increasingly common: ambulance dispatching and emergency city-evacuation routing, for example, are inherently online decision-making problems; other applications include packet scheduling for Internet communications and reservation systems. This book presents a novel framework, online stochastic optimization, to address this challenge.This framework assumes that the distribution of future requests, or an approximation thereof, is available for sampling, as is the case in many applications that make either historical data or predictive models available. It assumes additionally that the distribution of future requests is independent of current decisions, which is also the case in a variety of applications and holds significant computational advantages. The book presents several online stochastic algorithms implementing the framework, provides performance guarantees, and demonstrates a variety of applications. It discusses how to relax some of the assumptions in using historical sampling and machine learning and analyzes different underlying algorithmic problems. And finally, the book discusses the framework's possible limitations and suggests directions for future research.

  • Bandwidth Management

    This chapter contains sections titled: Differences between Wired and Wireless Communications Schedulers based on Generalized Processor Sharing Schedulers for Throughput Maximization Delay Performance of Wireless Schedulers QoS in Wireless Scheduling and Admission Control

  • Advanced Topics

    Almost all real-world systems are nonlinear, stochastic, and time varying, yet many controller design and analysis problems in computing systems can be addressed by simple linear, deterministic, time-invariant techniques. This chapter provides a brief introduction to several advanced control techniques. Gain scheduling uses auxiliary measurements to switch between controllers; in effect using multiple linear controllers for a nonlinear system. Self-tuning regulators continually update the controller parameters on-line. Minimum- variance controllers address systems with stochastics. Fluid flow analysis can be used to build models from first principles. Fuzzy control uses qualitative rules (instead of mathematical equations) to describe controller actions.

  • RealTime Operating Systems

    Real-time operating systems must provide three specific functions with respect to tasks: scheduling, dispatching, and inter-communication and synchronization. In this chapter we examine various techniques for providing these services in real-time and embedded systems. Various aspects of commercial real-time operating systems are also discussed.

  • Multiple Frequency Selection in DVFS-Enabled Processors to Minimize Energy Consumption

    This chapter contains sections titled: Introduction Energy Efficiency in HPC Systems Exploitation of Dynamic Voltage-Frequency Scaling Preliminaries Energy-Aware Scheduling via DVFS Experimental Results Conclusion References

  • No title

    Link reversal is a versatile algorithm design technique that has been used in numerous distributed algorithms for a variety of problems. The common thread in these algorithms is that the distributed system is viewed as a graph, with vertices representing the computing nodes and edges representing some other feature of the system (for instance, point-to-point communication channels or a conflict relationship). Each algorithm assigns a virtual direction to the edges of the graph, producing a directed version of the original graph. As the algorithm proceeds, the virtual directions of some of the links in the graph change in order to accomplish some algorithm-specific goal. The criterion for changing link directions is based on information that is local to a node (such as the node having no outgoing links) and thus this approach scales well, a feature that is desirable for distributed algorithms. This monograph presents, in a tutorial way, a representative sampling of the work on link-rev rsal- based distributed algorithms. The algorithms considered solve routing, leader election, mutual exclusion, distributed queueing, scheduling, and resource allocation. The algorithms can be roughly divided into two types, those that assume a more abstract graph model of the networks, and those that take into account more realistic details of the system. In particular, these more realistic details include the communication between nodes, which may be through asynchronous message passing, and possible changes in the graph, for instance, due to movement of the nodes. We have not attempted to provide a comprehensive survey of all the literature on these topics. Instead, we have focused in depth on a smaller number of fundamental papers, whose common thread is that link reversal provides a way for nodes in the system to observe their local neighborhoods, take only local actions, and yet cause global problems to be solved. We conjecture that future interesting uses of link reversal are ye to be discovered. Table of Contents: Introduction / Routing in a Graph: Correctness / Routing in a Graph: Complexity / Routing and Leader Election in a Distributed System / Mutual Exclusion in a Distributed System / Distributed Queueing / Scheduling in a Graph / Resource Allocation in a Distributed System / Conclusion

  • A Petri Net Algorithm for Scheduling of Generic Restoration Actions

    This paper is concerned with scheduling of the restoration actions. Generic restoration actions (GRAs) have been identified in our previous research based on a variety of restoration strategies used by utilities. This paper proposed a scheduling method using the Petri Net (PN) techniques. The PN model incorporates the conditions that have to be met before an action can be taken. The time required to perform an action is also modeled in the net. A token passing and a backward search processes are used to identify the sequence of restoration actions and their timing. The advantages of the proposed methods are (1) the time required to restore a subsystem can be estimated, (2) a systematical method is obtained for identification of the sequence of actions. The PN method has been tested with simulation cases.

  • No title

    Graphical models (e.g., Bayesian and constraint networks, influence diagrams, and Markov decision processes) have become a central paradigm for knowledge representation and reasoning in both artificial intelligence and computer science in general. These models are used to perform many reasoning tasks, such as scheduling, planning and learning, diagnosis and prediction, design, hardware and software verification, and bioinformatics. These problems can be stated as the formal tasks of constraint satisfaction and satisfiability, combinatorial optimization, and probabilistic inference. It is well known that the tasks are computationally hard, but research during the past three decades has yielded a variety of principles and techniques that significantly advanced the state of the art. In this book we provide comprehensive coverage of the primary exact algorithms for reasoning with such models. The main feature exploited by the algorithms is the model's graph. We present inference-based, m ssage-passing schemes (e.g., variable-elimination) and search-based, conditioning schemes (e.g., cycle-cutset conditioning and AND/OR search). Each class possesses distinguished characteristics and in particular has different time vs. space behavior. We emphasize the dependence of both schemes on few graph parameters such as the treewidth, cycle-cutset, and (the pseudo-tree) height. We believe the principles outlined here would serve well in moving forward to approximation and anytime-based schemes. The target audience of this book is researchers and students in the artificial intelligence and machine learning area, and beyond.

  • Behavior Sequence Transformations and Models with Shadow Servers

    This chapter contains sections titled: Background, Example 1: Preemptive Priority Scheduling, Example 2: Simultaneous Resource Possession, Example 3: Serialization, Conclusion

  • Cumulative Scheduling with Task Intervals

    This paper presents a set of propagation rules to solve cumulative constraints. As in our previous paper on jobshop scheduling [8], our goal is to propose to the CLP community techniques that allow a constraint satisfaction program to obtain performances which are competitive with ad-hoc approaches. The rules that we propose are a mix of an extension of the concept of task intervals to the cumulative case and the use of a traditional resource histogram. We also explain how to use a branching scheme inherited from operations research to address complex multi-resources problems (similar to the use of edge-finding for jobshop scheduling). We show that the complex propagation patterns associated with our rules make a strong arguments for using logic programming. We also identify a phenomenon of phase transition in our examples that illustrates why cumulative scheduling is hard.



Standards related to Scheduling

Back to Top

No standards are currently tagged "Scheduling"