MVS in the classroom

Extending a stand-alone personal computer to integrate multiple operating systems concurrently

Today’s high-performance RISC microprocessors have been highly tuned for integer and floating point application performance. These architectures have paid less attention to operating system requirements. At the same time, new operating system designs often have overlooked modern architectural trends which may unavoidably change the relative cost of certain primitive operations. The result is that operating system performance is well below application code performance on contemporary RISCS. This paper examines recent directions in computer architecture and operating systems, and the implications of changes in each domain for the other. The requirements of three components of operating system design are discussed in detail: interprocess communication, virt ual memory, and thread management. For each component, we relate operating system functional and performance needs to the mechanisms available on commercial RISC architectures such as the MIPS R2000 and R3000, Sun SPARC, IBM RS6000, Motorola 88000, and Intel i860. Our analysis reveals a number of specific reasons why the performance of operating system primitives on RISCS has not scaled with integer performance. In addition, we identify areas in which architectures could better (and cost-effectively) accommodate operating system needs, and areas in which operating system design could accommodate certain necessary characteristics of cost-effective highperformance microprocessors. This work was supported in part by the National Science Foundation under Grants No. CCR-8703049, CCR-8619663, and CCR-8907666, by the Washington Technology Center, by the Digital Equipment Corporation Systems Research Center and External Research Program, and by IBM and AT&T Fellowships. Bershad is now with the School of Computer Science, Carnegie Mellon University. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission. 01991 ACM 0-89791 -380 -9/91 /0003 -0108 . ..$1 .50

As cloud-network integration, 5G and 6G, all-optical network, and IP-based services evolve, operational systems of operators face new challenges. The current operational systems suffer from inconsistent technical architecture, insufficient data sharing, lack of decoupling capability, and inadequate intelligence, leading to a high maintenance workload and poor customer experience. This paper analyzes the requirements of intelligent operation systems for operators and innovatively proposes an architecture and design scheme for intelligent operational systems based on cloud-network integration. The paper summarizes the practical experience of the new generation of cloud-network operation and maintenance systems and proposes improvements and outlooks for the development of the next generation of operational management systems.

33 - Windows 95/NT

In broadcast channels, network utility maximization formulates a scheduling problem in order to maximize a sum of given utility functions. It is known that the network utility maximization is achieved if a gradient method is used. In this paper, however, we show that the network utility maximization is achieved only if a gradient method is used. That proves the equivalence between a problem formulated by the network utility maximization and a problem with a gradient method. The gradient method simplifies the object function of a scheduling problem by modifying utility functions to a gradient form, so that it makes easy to deal with the problem. We apply the gradient method to a problem with utility functions given by generalized proportional fairness. It is revealed that using the gradient method for the generalized proportional fairness is equivalent to applying a binomial approximation. Simulation results are presented with various scheduling parameters.

Embedded operating system (OS) kernels provide basic execution primitives that can be used commonly by many appliances. The recent emergence of digital appliances requires more advanced features, such as networking and GUI. Those features dramatically complicate the appliances' software systems and increase their code sizes. In order to develop such large and complex software systems, we propose a system architecture that co-locates multiple embedded operating systems on a microkernel. The proposed architecture employs a microkernel to provide protected execution environments for the existing embedded kernels. In each protected execution environment, a kernel and its applications run just as they run directly on hardware since they share the same protection domain. Our approach can achieve the maximum reusability of the existing software resources including embedded OS kernels and their applications; thus, it protects the existing software resources. We have developed the system that consists of TL4 microkernel and a /spl mu/ITRON embedded kernel, and shows the feasibility of our approach through evaluations.

These days, the problems of scheduling and security are increasingly pressing as a result of the rapidly growing number of implementations that are operated in operating systems. Process scheduling and scheduling security is the most effective methodology of operating a system which can improve and degrade the performance of the computer system. The performance of scheduling algorithm in operating system can be measured by scheduling principles like average waiting time, average turnaround time, response time, throughput etc. Much research carried out over operating system security and round robin scheduling used in time sharing operating system in previous years to resolve the issues regarding to improvement in the performance of round robin (RR) scheduling and improving the security in the scheduling approach. This study discussed the security issues in operating systems, scheduling security and discrete structure of a new approach for RR scheduling. The researcher has suggested a list of policy for scheduling method security and proposed a new approach for RR scheduling and investigated the scheduling principles. The proposed methodology covers distinctive strategy for selection manner of process from ready queue than RR and used diverges time quantum. The proposed methodology has been validated experimentally by comparing with a numerous scheduling algorithm namely as Round Robin (RR), Adaptive Round Robin (ARR), Round Robin Remaining time (RRRT), improved Round Robin (IRR), an additional improvement on the improved Round Robin (AAAIRR), and an Enhanced Round Robin (ERR). Numerous simulations have been conducted to validate the effectiveness of the proposed algorithm to compelling the performance of system. At the conclusion the performance of computing system is dependent on security of operating system as well as secluding methods.

Order acceptance and scheduling (OAS) problems are realistic for enterprises. They have to select the appropriate orders according to their capacity limitations and profit consideration, and then complete these orders by their due dates or no later than their deadlines. OAS problems have attracted significant attention in supply chain management. However, there is an issue that has not been studied well. To our best knowledge, no prior research examines the carbon emission cost and the time-of-use electricity cost in the OAS problems. The carbon emission during the on-peak hours is lower than the one in mid-peak and off-peak hours. However, the electricity cost during the on-peak hours is higher than the one during mid-peak and off-peak hours when time-of-use electricity (TOU) tariff is used. There is a trade-off between sustainable scheduling and the electricity cost. To calculate the objective value, a carbon tax and carbon dioxide emission factor are included when we evaluate the carbon emission cost. The objective function is to maximize the total revenue of the accepted orders and then subtract the carbon emission cost and the electricity cost under different time intervals on a single machine with sequence-dependent setup times and release date. This research proposes a mixed-integer linear programming model (MILP) and a relaxation method of MILP model to solve this problem. It is of importance because the OAS problems are practical in industry. This paper could attract the attention of academic researchers as well as the practitioners.

In classical scheduling problem, it is assumed that all orders must be processed. In the order acceptance and scheduling (OAS) problem, some orders are rejected due to limited capacity. In make-to-order production environment, in which the OAS problem occurs, accepting all orders may cause overloads, delay in deliveries and unsatisfied customers. Oguz et al. (2010) introduced the OAS problem with sequence-dependent setup times and release dates. In this paper, we propose a new mixed integer programming formulation with O(n2) decision variables and O(n2) constraints for the same problem. We conduct a computational analysis comparing the performance of our formulation with Oguz et al. (2010) formulation. We use the benchmark instances, which are available in the literature. We observe that our formulation can solve all the instances up to 50 orders in a reasonable time, while Oguz et al. (2010) formulation can solve only the instances with 10 orders in the same time limit.

Research methodology This case was a real-life situation faced by the author. Names were changed, so students would not know that the author was the protagonist. The case had been developed over several years as a capstone to the capital budgeting section of an MBA finance course and an advanced undergraduate course. Case overview/synopsis Trey and Lauren Gallo were considering the purchase of a vacation condo that also generated rental income. The current owners were willing to sell at a lowball offer of $605,000 as the pandemic entered its 13th month. The Gallos felt they needed to act fast to get this deal. However, the risks were extraordinary, as the pandemic had reduced rental income by 50% and borders had just recently closed. The case provides all data needed to compute rental revenues, capital expenditure, operational expenditures and financing costs. Students are expected to compute the NPV and IRR of free cashflows. Students will compute and evaluate the cost of capital using the condo’s projected debt structure, a choice of several proxy betas and a project risk premium. The case also uses extensive sensitivity analysis. This case differs from corporate capital budgeting problems because it evaluates both levered and unlevered cashflows, and the cashflows include savings from personal use. The case has been successfully used in MBA finance courses and advanced undergraduate finance courses. The case can be used as a capstone case for capital budgeting or a comprehensive exam in undergraduate, MBA and executive programs. The case questions can also be spread throughout a course to cover the topics of financial statement forecasting, free cash flows, capital budgeting, cost of capital and sensitivity analysis. Complexity academic level Earlier versions of this case have been used in an advanced undergraduate corporate finance course and MBA finance courses. The case is generally used as a capstone to the material on capital budgeting. Students should have already covered material on financial statements, loan cashflows, levered and unlevered cashflows, CAPM, proxy betas, weighted average cost of capital, NPV and IRR. This case is also appropriate for courses in real estate finance and personal finance.

With the exponential improvement of the recent information technologies, the use of cloud-based services, Internet of Things (IoT), and Big Data in the manufacturing industries of key national sectors such as shipping, energy, material science, refining, chemicals, banking, defense, etc., is unavoidable. Recently, cloud computing has been a hot subject. As large businesses such as Google and Microsoft have introduced launching cloud-based apps, advertising with cloud usage, and even releasing an open-source-based Cloud OS, cloud computing has lately seen a substantial rise in popularity. As the public becomes more conscious of cloud-based computing, the need for protection will rise as popularity grows. Extensive focus has been drawn to several research questions in cloud computing for the operating system in the cloud. Throughout this study, we discussed the cloud-based operating system (OS) architecture in cloud computing, issues related to the Cloud OS, and critical challenges while implementing and designing Cloud OS. Furthermore, a comprehensive review is presented by the author in the overall article.

This paper describes a course in hardware description and synthesis (hardware compilation), taught as an introductory graduate course at Chalmers University of Technology, and as an advanced undergraduate course at the University of Malta. The functional programming language Haskell was used both to describe circuits and circuit synthesis schemes.

A Swappable Logic Unit (SLU) is an FPGA-based logic circuit that can be managed by a virtual hardware operating system. Since the SLU concept is still in its infancy, it is unreasonable to expect circuit design systems to be enhanced to include SLU awareness at this stage. Therefore, this paper describes a tool that can be used as a back end to any XC6200 circuit design system. It analyses XC6200 circuitry, to detect SLUs and then collect information about their external interfaces. This information is needed by an operating system so that it can manage the SLUs when they are in use.

Here, we describe a free, web-based simulation of the lac operon, "LacOp," that is designed to enhance the learning of prokaryotic gene regulation and pathways in advanced high school and undergraduate genetics courses. This new electronic resource was created by a team of students in an advanced undergraduate course and is hosted online (http://flask-env.rnwhymamqf.us-west-2.elasticbeanstalk.com/lacop). LacOp has a simple web interface compatible with a range of devices, including smartphones. To determine whether the LacOp simulation enhances student learning from traditional instruction, we introduced the lac operon to undergraduate genetics students through a traditional classroom experience followed by use of the LacOp simulation. Students worked on their own using the included tutorial to create and test the effect of various genotypes on E. coli lactose metabolism and regulation. Upon completion of the tutorial, students showed measurable gains in conceptual understanding of the lac operon. These students also reported a generally favorable opinion of the LacOP simulation as a use of their instructional time.

This article describes a simple two-player game which illustrates basic concepts of brinkmanship, to include calculations of probability and expected outcomes, and risk-taking profiles. The game befits a single 50-minute class period with introduction, gameplay, and discussion. The game can supplement the study of conflict from classic Cold War case studies of crisis bargaining, to arms control, or negotiating international protocols for global climate change such as the Paris Agreement. The Brinkmanship Game was developed for the seventh week of a 10-week graduate course called Game Theory and Decisionmaking: Exploring Strategic Situations. The course features a flipped classroom with class time devoted to experimentation, gameplay, and discussion of readings and games; lectures are online. The Brinkmanship Game would be appropriate for students in any advanced undergraduate or graduate level course in international relations, security studies, negotiation, or game theory. The Brinkmanship Game provides an active learning opportunity that can be valuable for encouraging students to come to their own understanding of concepts of mutual risk-taking. The authors have found the game to be effective in the classroom and hope it may prove valuable to those searching for ways to motivate students and to help them learn.