...1! Project Scope Definition and WBS In this course, we will explore project cost and schedule control! The focus of this week is developing the scope and the work breakdown structure (WBS). We will use the WBS to specifically detail the tasks required to complete any project. The scope is the starting document of a project. It defines the project. The WBS is created from the scope and is the basis on which several other project documents, such as the budget and schedule, will be derived from. Because the WBS is one of the foundations to our planning effort, it is critical to know and understand this tool. Shortcomings in the scope or WBS will translate to the rest of our planning documents resulting in real failures during project execution to attain goals in scope, cost, and schedule. It is, therefore, of primary importance that the scope and WBS are inclusive and detailed. Just remember that as a project manager, your family comes first but the project scope and WBS are not far behind. Introduction Cost and schedule form two sides of the iron triangle of project management with the third side being the collection of scope, quality, and performance. This makes cost and schedule paramount concerns to a project manager. Cost and schedule control on a project are vital to a successful project. As you know, this course is named Project Schedule and Cost Control, which may imply that the project is underway and it's time to go to work. However, the process for project control...
Words: 14442 - Pages: 58
...discuss how you can apply any two (2) Project Scheduling Principles to any project of your choice The project of my choice is the Roofing of a building, Attached is the gnatt chart to illustrate how the chart can be used 1, Identify the work to be done 2, Schedule the activities to be done 3, Allocate resources Based on the chart the work to be done is identified and divided as follows to complete the roofing work, hence we have 5 project to execute under roofing work. 1, TAKING LEVELS (WALL PLATES, KING POST POSTIONS). 2, ROOF CARCASS. 3, ROOFING SHEET INSTALLATION. 4, CEILIING NOGGINGS. 5, ELECRICAL PIPING. The whole project would take 3 weeks to complete. The first three works will proceed one after the other (finish to start) ie Taking Levels(wall plates , king post positions) must be completed before the Roof Carcass is started, which in turn must be completed before roofing sheet installation is started. Ceiling noggins come after roofing sheet installation but with a lag of 1 day, this implies that ceiling noggins does not have to wait till roof sheet installation is complete, but can start while the roof sheet installation is yet completed (1 day to completion) as some aspect of the roof installation should have been completed already(by then). In the other hand Electrical piping must finish the same day as the ceiling noggins (Finish to Finish) and it’s to start two days to the end of ceiling noggins. Having identify the work to be done, the schedule...
Words: 326 - Pages: 2
...Chapter 5: CPU Scheduling Operating System Concepts – 8th Edition Silberschatz, Galvin and Gagne ©2009 Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Operating Systems Examples Algorithm Evaluation Operating System Concepts – 8th Edition 5.2 Silberschatz, Galvin and Gagne ©2009 Objectives To introduce CPU scheduling, which is the basis for multiprogrammed operating systems To describe various CPU-scheduling algorithms To discuss evaluation criteria for selecting a CPU-scheduling algorithm for a particular system Operating System Concepts – 8th Edition 5.3 Silberschatz, Galvin and Gagne ©2009 Basic Concepts Maximum CPU utilization obtained with multiprogramming CPU–I/O Burst Cycle – Process execution consists of a cycle of CPU execution and I/O wait CPU burst distribution Operating System Concepts – 8th Edition 5.4 Silberschatz, Galvin and Gagne ©2009 Alternating Sequence of CPU and I/O Bursts Operating System Concepts – 8th Edition 5.5 Silberschatz, Galvin and Gagne ©2009 Histogram of CPU-burst Times Operating System Concepts – 8th Edition 5.6 Silberschatz, Galvin and Gagne ©2009 CPU Scheduler Selects from among the processes in ready queue, and allocates the CPU to one of them Queue may be ordered in various ways Switches from running to waiting state Switches from running...
Words: 3375 - Pages: 14
...interrupt or trap: 1) Upon modification of the program counter (PC) register, a nonexistent programed memory location, unimplemented in the microcontroller, is addressed. Answer: Event categorize as address error trap. 2) The stack pointer (SP) value exceeds the value of the SPLIM (Stack Pointer LIMit – set by the user) register, i.e. the stack is exceeded from the upper side. Answer: Event categorize as stack error trap. 3) User is trying to access the instruction y = t /0. Answer: Event categorize as arithmetic error trap 4) Ahmed is trying to open a document by double clicking on mouse. Answer: interrupt 5) Typing in MS word using keystroke. Answer: interrupt Q5: Select a mechanism for the given policies: 1) Process scheduling Sol: The process scheduler is the component of the operating system that is responsible for deciding whether the currently running process should continue running and, if not, which process should run next. There are four events that may occur where the scheduler needs to step in and make this decision: 1) The current process goes from the running to the waiting state because it issues an I/O request or some operating system request that cannot be satisfied immediately. 2) The current process terminates. 3) A timer interrupt causes the scheduler to run and decide that a process has run for its allotted interval of time and it is time to move it from the running to the ready state. 4) An I/O operation is complete for a process that requested...
Words: 1247 - Pages: 5
...The Process of Line balancing: * Line balancing is essential for an effective product layout. * It is difficult to achieve equal work content to all stages in a process so therefore this will result in an imbalance hence a balancing loss. In the case of a line imbalance, extra resources need to be allocated to ensure the process is brought back to an efficient level of activity. With as high as possible the level of effectiveness for each stage in the process. * If a line is not properly balanced and therefore there is an imbalance the effectiveness of this is known as a balancing loss. The measure of a balancing loss is where the problem occurs of unequal allocation of work as part of the overall time needed to produce a product or service. * Perfect balancing would mean that work content is evenly allocated to each stage of the process. * The effectiveness of the balancing activity is measured by the balancing loss. * The longest stage in the process is called a bottleneck; it governs the flow of items through the whole process. Balancing Technique: * Various numbers of techniques available, must decide which is the best for the goal you are aiming for. Precedence Technique: * “This technique is a representation of the ordering of the elements which compose the total work content of the product or service” (Topic four product layout page 197) Worked Example: * Is the technique who the number of stages equal the total work content...
Words: 1560 - Pages: 7
...the operating system is the kernel. The kernel is a control program that functions in privileged state that allows all hardware instructions to be executed. It reacts to interrupts from external devices and to service requests and traps from processes. The kernel creates and terminates processes and responds to requests for service. Operating systems are resource managers. The main resource is computer hardware in the form of processors, storage, input/output devices, communication devices, and data. Operating system functions include: • Implementing the user interface. • Sharing hardware among users. • Allowing users to share data among themselves. • Preventing users from interfering with one another. • Scheduling resources among users. • Facilitating input/output. • Recovering from errors. • Accounting for resource usage. • Facilitating parallel operations. • Organizing data for secure and rapid access. • Handling network communications. Processes run applications, which are linked together with libraries that perform standard services. The kernel supports the processes by providing a path to the peripheral devices. The kernel responds to service...
Words: 2421 - Pages: 10
...Who is the creater of CP/M? [Kildall] Who is the head of the Multics project. [Carbato] Which OS’s process scheduler reduces priority and increases quantum. [CTSS] Which one is the difference between a semaphore and monitor. [Last choice] If a system has 16 drives and each process can have 4 drives. What is the maximum number of n that the system is deadlock free. [5] Given the sequence below which processes will cause a page fault. (for FIFO – LRU) Write a loop that would create 10 child processes. (No more than 10). If a file is shared by two processes, can have read-only and the other read-write access. If yes how, if not what prevent it. What are some of the security features in UNIX or NT. How does NTFS directory system work. How does UNIX directory system work. Pick a Unix UNIX process scheduler and explain how (not why or when) it favors I/O bound processes to CPU bound processes. Explain and compare I/O software (programmed, interrupt, DMA). What is the problem with RAID4 and explain how RAID5 solves the problem. Disk arm scheduling algorithms readuce read time but what does Linux additionally do. How does Workingset Clock algorithm work. If seektime is 8msec and each track is 160KB. What is the access time to read 4KB. Couffman listed four requirements for a deadlock. Describe fourth one and how to prevent it. What are the advantages of inverted page tables. What is a soft link. Implement soft link and hard links...
Words: 278 - Pages: 2
...Scheduling (when to do the job) is the process by which all resources needed for specific jobs are allocated, coordinated, and synchronized at the proper time and place, with necessary access, so that work can be executed with minimal delay and completed by the agreed upon date, within budget estimates. The schedule establishes when jobs will be done and what resources can best be applied to their performance. Resources include manpower, materials, tools and special equipment. Access refers to when the equipment will be prepared and accessible so that it can be worked on in safe (locked out/tagged out) condition, with necessary precautions taken, permits obtained, and any specialized documentation, drawings, or information in hand. Proper time relates to job start, duration of execution, and completion within the time frame agreed upon with the internal customer during the weekly coordination meeting. The Weekly Expectation Scheduling is the locus from which all maintenance activity is executed. Scheduling should be viewed as the “point” function and “marketing arm” of the system because it yields the earliest tangible results (often within weeks of start up). All individuals and groups perform better and accomplish more with clearly established, communicated and published expectations. When the maintenance function is managed without a weekly schedule, there are no specific expectations as to what is to be accomplished with the resources for which payroll checks will be...
Words: 2773 - Pages: 12
...generated by both the addition of the Grade 4-6 program and an unexpected jump in application requests, the Board of Directors has authorized a project to research and develop an information system capable of supporting the school’s expansion. Of immediate concern is the substantial increase in administrative and accounting activity, which is currently being administered by one full time employee with assistance from faculty as their schedules permit. The proposed system will increase productivity and allow the current organizational structure to efficiently accomplish daily operations and activities until the school is in a position to increase the administrative staff and fund the remaining system requirements. The new system will automate current processes by eliminating the paper and manual processes, which are both inefficient and time-consuming. Furthermore, the proposed database will allow staff to quickly retrieve compiled data in order to make informed decisions regarding enrollment, bookkeeping, scheduling and student status. Recommendation Initially, the new system must track and process scheduling, after care hours and attendance, tuition payments and invoicing. As the program expands and funding permits, the system will incorporate scheduling, full spreadsheet functionality and report generation. Phase I of the project includes: • Upgrading Administrative workstations • Upgrade network • Developing After Care attendance and rate tracking system • Developing...
Words: 900 - Pages: 4
...Computer Science and Network Security, VOL.8 No.8, August 2008 A Hierarchical Scheduling and Replication Strategy A. Horri, R. Sepahvand, Gh. Dastghaibyfard Department of Computer Science & Engineering, College of Engineering, Shiraz University, Molla Sadra Ave, Shiraz, Iran 71348-51154 3- Deciding what replica files to keep or delete when there is shortage of storage in a site i.e. long-term optimization or dynamic replication strategy. Replication can be static or dynamic. In static replication the replicas have to be manually created, deleted and managed and it becomes tedious with the increase in files and user jobs. So it has the drawback that can not adapt to changes in user behavior. In real scenario, where the data amounts to peta bytes, and the user community is in the order of thousands around the world; static replication does not sound to be feasible. Dynamic replication strategies overcome the problem, where replica creation, deletion and management are done automatically. Dynamic replication strategies have the ability to adapt to changes in user behavior. Dynamic strategies are explained in section-2. In replication consistency is an important issue that needs to be considered. To overcome this problem as in other papers, it is assumed that: access pattern is read only for all replicas in data grid. The remainder of paper is organized as follows. Related work on replication and scheduling is given in section 3. A 3-layerd hierarchical structure is proposed for replication...
Words: 3673 - Pages: 15
...job in the ready queue if a higher Arrives priority job requires service. 1.) First Come First Served (FCFS) - executes jobs in their order of arrival (the job that comes first will get to the CPU first). - implemented easily using a first in first out (FIFO) queue. - FCFS is non-preemptive. - PROBLEM: the average turnaround times and waiting times are HIGH. 2.) Shortest Job First (SJF) – the job with the shortest estimated time is the next one to receive service. - cannot be implemented at the short term scheduling level since there is no way to know the length of the next CPU burst. - can be implemented at the long term scheduling level by asking users to estimate their job time limit. - can be preemptive or non-preemptive. - SJF gives the minimum average waiting time. - PROBLEM: long jobs may never get to execute. 3.) Priority Scheduling: the highest priority job is the next one to receive service. - Priority scheduling can be preemptive or non-preemptive. - PROBLEM: starvation – a low priority job may never be...
Words: 906 - Pages: 4
...|To: |Positrol Workholding | |From: | | |CC: | | |Date: | | |Re: |Job Process Scheduling | | | | Introduction The difference in the job process scheduling will be measured based on table 1 that was given. We are comparing the differences between First Come, First Served (FCFS), Shortest Operating Time (SOT) and Earliest Due Date (EDD) to find which sequencing rule may work the best. Highlights Lateness: The findings (SOT) had the best average of lateness (-3.8), but would still have 3 jobs come up short. On the other hand (EDD) had a slightly lower average at (-2.1), but had no jobs arrive late. With that being said both of these alternative had better averages than the (FCFS) method that positrol workholding is currently using. Jobs: To have the best efficiency and make sure the customers are happy, most jobs should be completed on time which is not the case for the methods (FCFS) and (SOT). They both would have 3 late jobs, whereas (EDD) method would have 0 late jobs, meaning they would all be completed on time. Flow Time: The last...
Words: 1183 - Pages: 5
...Gulati, and Gupta. Various factors such as Educational Qualification, Work Experience, Socializing and many other factors have been taken into consideration. I hope the analysis I have done satisfies your concerns. Regards. Committee Member 2 Executive Summary : Mr. Ashok, who is in charge of the General Shift at Sparkling Glass Limited , is going to retire after few months. He has been responsible not only to do the basic routine work but also manage the Production Planning, Scheduling and Costing work. Therefore, the company needs to appoint someone on his behalf. Four people have taken into consideration for the post :1. 2. 3. 4. Khanna. Panjabi. Gupta. Gulati. The analysis talks about which persons fits best for the job on analyzing on Educational Qualification, Experience, Knowledge on Planning & Management , and Social Quality and Unions. After analyzing, Mr. Gupta seems fit to be promoted because he is qualified as a Glass technologist, manages the Production Planning, Costing and Scheduling work, had maintained a relationship with the workers which was adequate enough 3 TABLE OF CONTENT Sl. No. 1 2 3 4 5 6 7 Content Situation Analysis Problem Statement Options Available Criteria For Evaluation Evaluation of Options Recommendation Action Plan Page 5 6 6 6 7-8 8 8 4 1. Situation Analysis : The committee has examined all the four candidates resume. While evaluating them the members...
Words: 961 - Pages: 4
...1. |Round robin scheduling is essentially the preemptive version of __________fsecond | | | | |1) |FIFO | |2) |Shortest job first | |3) |Shortest remaining | |4) |Longest time first | | |Correct Answer: FIFO [hide] | | | |Marks: 1 | | | | | | | | | | |2. |A page fault occurs | | | |1) |when the page is not in the memory | |2) |when the page is in the memory | |3) |when...
Words: 2016 - Pages: 9
...for a service, the server dispatcher creates multiple threads in one server that can be assigned to various client requests simultaneously. Each thread is associated with a separate context or request to the server. This feature is useful in both conversational and RPC servers which otherwise may stay idle waiting for the client side of a conversation. iii. Completion phase- When the application is shut down or stopped, the server performs any termination processing that is necessary such as closing a resource manager. 2. Advantages and Disadvantages of implementing multithreading As user space threads * Switching threads is faster when thread management is done in user space. * Fast thread switching. * Fast thread scheduling. * A multithreaded program operates faster on computer systems that have multiple CPU’s with multiple cores. * A multithreaded application remains responsive to input. This makes it possible for the application to remain responsive to user input while executing tasks. * Superior application responsiveness. If...
Words: 853 - Pages: 4
