The existing air transportation system is approaching a bottleneck because its dominant huband- spoke model results in a concentration of a large percentage of the air traffic at a few hub airports. Advanced technologies are greatly needed to enhance the transportation capabilities of the small airports in the U.S.A., and distribute the high volume of air traffic at the hub airports to those small airports, which are mostly non-controlled airports. Currently, two major focus areas of research are being pursued to achieve this objective. One focus concentrates on the development of tools to improve operations in the current Air Traffic Management system. A more long-term research effort focuses on the development of decentralized Air Traffic Management techniques. This dissertation takes the latter approach and seeks to analyze the degree of decentralization for scheduling aircraft landings in the dynamic operational environment at single runway noncontrolled airports. Moreover, it explores the feasibility and capability of scheduling aircraft landings within uninterrupted free-flight environment in which there is no existence of Air Traffic Control (ATC). First, it addresses the approach of developing static optimization algorithms for scheduling aircraft landings and, thus, analyzes the capability of automated aircraft landing scheduling at single runway non-controlled airports. Then, it provides detailed description of the implementation of a distributed Air Traffic Management (ATM) system that achieves decentralized aircraft landing scheduling with acceptable performance whereas a solution to the distributed coordination issues is presented. Finally real-time Monte Carlo flight simulations of multi-aircraft landing scenarios are conducted to evaluate the static and dynamic performance of the aircraft landing scheduling algorithms and operation concepts introduced. Results presented in the dissertation demonstrate that decentralized aircraft landing scheduling at single runway non-controlled airports can be achieved. It is shown from the flight simulations that reasonable performance of decentralized aircraft landing scheduling is achieved with successful integration of publisher/subscriber communication scheme and aircraft landing scheduling model. The extension from the non-controlled airport application to controlled airport case is expected with suitable amendment, where the reliance on centralized air traffic management can be reduced gradually in favor of a decentralized management to provide more airspace capacity, flight flexibility, and increase operation robustness.

In this thesis, we propose a cell scheduling mechanism to overcome some drawback of Carry-Over Round Robin (CORR) algorithm. Compare with CORR, the modified scheme reduces complexity of implementation and allocates bandwidth more fairly. In general, it simplifies CORR algorithm, which applies some design to maintain the maximum frame size. We prove that the maximum frame size is not necessary for deriving end-to-end delay. We also show that it results in fair distribution of bandwidth. As long as the schedulers and traffic shapers work independently, significant underutilization is expected. In order to solve this problem, we borrow the concept of CORR which divides each allocation cycle into two subcycles¡Xa major cycle and a minor cycle. By designing some information feedback to shapers, schedulers can transmit more cells in minor cycles. Hence we can improve bandwidth utilization successfully.

Abstract Processor-in-memory (PIM) architectures have been proposed in the recent years. One major objective of PIM is to reduce the performance gap between the CPU and memory. To exploit the potential benefits of PIM, we designed a statement-base parallelizing system ¡V SAGE(Statement-Analysis-Grouping-Evaluation) in [1][2][3]. From our pervious research, we find that the execution schedule is a critical factor to the performance of PIM systems. In this paper, we provide new scheduling mechanism for one-host and one-memory processors (1H-1M) and one-host and n-memory processors (1H-nM), respectively, to fully utilize all of the memory processors in PIM architectures. The experimental results of these two mechanisms are also discussed.

In the age of deep submicron VLSI, we can design various system applications in a single chip. On this system-on-chip design, there are ASIC circuitry, processor core together with software components, and hardware modules. During system design, we need to select the forms of execution for kinds of system functions.It is called hardware/software partitioning. Different hardware/software partitioning, affect the achievable cost and performance of the accordingly elaborated system chip designs. In this research, we explore research and software design issues of an estimation method for hardware/software partitioning. It consists of these tasks: ¡Esoftware scheduling ¡Ehardware/software co-scheduling ¡Ecost and performance estimation for hardware/software partitioning For a system description, given a chosen hardware/software partitioning and a set of allocated resources, we can perform the corresponding cost and performance estimation task that can be utilized directly by system designs or can be called by a hardware/software partitioning optimization program. We designed the experimental software for this estimation method. We also carried out a set of experiments based upon real and synthesized design cases.

GPRS is one of popular topics for mobile communication. To satisfy the Quality of Service (QoS) requirement for multimedia transmission, the QoS is divided into four classes, which are conversational, interactive, streaming and background class. When mobile communication network transmits the multimedia data, it needs a proper scheduling algorithm to assign the radio resource and make every data meet the requirement of the QoS in GPRS system. In this thesis, we discuss the properties of every traffic class. For each traffic class, we propose a transmission method. The proposed methods are integrated with the link adaptation to develop a scheduling algorithm to suit the QoS requirement in the GPRS system. In addition, we introduce the FIFO scheduling algorithm and the scheduling algorithm that has priority. Our methods are then compared with those existing algorithms. We use OPNET simulation system to study the FIFO scheduling algorithm, the priority-scheduling algorithm and our new scheduling algorithms. The effects on the delay time, packet loss ratio and throughput for every scheduling algorithm are analyzed and compared. The simulations show that the new scheduling algorithm can satisfy all QoS requirements, and the performance of the new scheduling algorithm is better than that of the other scheduling algorithms in the interactive class.

<p>In Industrial automated process plants, the wired communication system is being replacing by the newly developed wireless communication system as it is easy to use, scalable, simple, reliable, and provide more flexibility for installing and operating process automation equipments. The <strong>WirelessHART</strong> network is becoming popular for wireless communication system in industrial automation plant system. However this network works on the TDMA bus arbitration technique. Each network device needs to be scheduled by the user (network operator) to allow the communications between the field devices and a gateway. Some companies like DUST have already manufactured the device hardware to implement this wireless communication system on industrial automation plant. A Simulator of this system is necessary to imitate the system performance on computer using the computer programming to simulate the result of each timeslot. Purpose of designing this simulator is to use the timeslots more efficiently and to offer collision free communications between network devices. It is may be time taking process to build the simulator in the beginning but at the end it provides cost and time effective solutions. </p><p>This report describes how the simulator has been designed for the system at various phases e.g. architecture, design, and implementation etc.</p>

The process of large-scale change is difficult in any organizational structure, and this is particularly true in the field of education. This qualitative study investigated the change process used by five high schools in eastern Pennsylvania while initiating, implementing and sustaining a large-scale change from traditional to block scheduling. This study looks at the entire large-scale change process from inception through evaluation. Through the lens of the large-scale change to block scheduling, the researcher analyzed change in five schools with similar demographics to determine whether similarities existed in the change process and whether school change can be linked to a specific model of change. This study, conducted using a three interview protocol (Seidman, 1998), was guided by one primary research question: What is the process used by high schools to plan, implement and sustain large-scale change? Three research sub-questions supported the primary question: 1) What was the impetus for change to block scheduling?; 2) What process was used by the district to plan and implement the change to block scheduling?; and 3) How has the change to block scheduling been sustained by the district? The participants interviewed included five superintendents, five high school principals and twenty classroom teachers who worked at the participating schools during the transition to block scheduling. Several common characteristics were identified which contributed to the successful implementation of a large-scale change initiative. These include the creation of a committee to plan and implement the change, involvement of stakeholders, and the use of professional development to support the change. A major implication of this study is the identification of the importance of effective leadership during the change process. It was found that the impetus for change involved an organizational leader with a vision for change. One interesting finding was that though all five schools were successful in implementing the change, very little has been done to help sustain the change. Contrary to the research in the literature, this study found that ongoing professional development is not essential to sustaining large-scale change. / Dr. George R. Bieger, Indiana University of Pennsylvania Dr. Patricia S. Smeaton, East Stroudsburg University of Pennsylvania Dr. Patricia A. Pinciotti East Stroudsburg University of Pennsylvania

Thesis (Ph. D.)--Lehigh University, 2000. / Includes vita. Includes bibliographical references (leaves 125-135).

Thesis (Ph. D.)--School of Industrial and Systems Engineering, Georgia Institute of Technology, 2004. Directed by Chen Zhou. / Vita. Includes bibliographical references (leaves 87-90).

Thesis--PlanB (M.S.)--University of Wisconsin--Stout, 2001. / Includes bibliographical references.