Excursions in Modern Mathematics (9th Edition)
9th Edition
ISBN: 9780134468372
Author: Peter Tannenbaum
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 8, Problem 58E
Consider the project digraph shown in
a. Find the critical path and critical time for the project.
b. Find the critical-time priority list.
c. Schedule the project with
d. Explain why any schedule for
e. Schedule the project with
f. Explain why the schedule found in (e) is an optimal schedule for three processors.
Figure 8-43
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
the operation times for the major functional units in this implementation are the following:
Memory units: 200 picoseconds (ps)
ALU and adders: 50 ps
Register file (read or write): 25 ps
Assuming that the multiplexors, control unit, PC accesses, sign extension unit, and wires have no delay, which of the following implementations would be faster and by how much?
An implementation in which every instruction operates in 1 clock cycle of a fixed length.
An implementation where every instruction executes in 1 clock cycle using a variable length clock, which for each instruction is only as long as it needs to be. (Such an approach is not terribly practical, but it will allow us to see what is being sacrificed when all the instructions must execute in a single clock of the same length.)
To compare the performance, assume the following instruction mix: 20% loads, 15% stores, 40% ALU instructions, 20% branches, and 5% jumps.
You work for a company that makes cell phones and have been made project manager for the design of a new cell phone. Your supervisors have already scoped the project, so you have a list showing the work breakdown structure, and this includes major project activities. You must plan the project schedule and calculate project duration. Your boss wants the schedule on his desk tomorrow morning! You have been given the information in Exhibit 4.13. It includes all the activities required in the project and the duration of each activity. Also, dependencies between the activities have been identified. Remember that the preceding activity must be fully completed before work on the following activity can be started. Your project is divided into five major subprojects. Subproject “P” involves developing specifications for the new cell phone. Here, decisions related to such things as battery life, size of the phone, and features need to be made. These details are based on how a customer…
You work for a company that makes cell phones and have been made project manager for the design of a new cell phone. Your supervisors have already scoped the project, so you have a list showing the work breakdown structure, and this includes major project activities. You must plan the project schedule and calculate project duration. Your boss wants the schedule on his desk tomorrow morning! You have been given the information in Exhibit 4.13. It includes all the activities required in the project and the duration of each activity. Also, dependencies between the activities have been identified. Remember that the preceding activity must be fully completed before work on the following activity can be started. Your project is divided into five major subprojects. Subproject “P” involves developing specifications for the new cell phone. Here, decisions related to such things as battery life, size of the phone, and features need to be made. These details are based on how a customer…
Chapter 8 Solutions
Excursions in Modern Mathematics (9th Edition)
Ch. 8 - For the digraph shown in Fig. 8-25, find a.the...Ch. 8 - For the digraph shown in Fig. 8-26, find Figure...Ch. 8 - For the digraph in Fig. 8-25, find a.all path of...Ch. 8 - For the digraph in Fig. 8-26, find a.a path of...Ch. 8 - For the digraph in Fig. 8-25, find a.all cycles of...Ch. 8 - For the digraph in Fig. 8-26, find a.all cycles of...Ch. 8 - Prob. 7ECh. 8 - For the digraph in Fig.8-26, find a.all vertices...Ch. 8 - a.Draw a digraph with vertex-set V={A,B,C,D} and...Ch. 8 - a.Draw a digraph with vertex-set V={A,B,C,D} and...
Ch. 8 - Prob. 11ECh. 8 - Consider the digraph with vertex-set V={V,W,X,Y,Z}...Ch. 8 - Prob. 13ECh. 8 - Prob. 14ECh. 8 - Prob. 15ECh. 8 - A mathematics textbook consists of 10 chapters....Ch. 8 - Prob. 17ECh. 8 - The digraph in Fig. 8-29 is an example of a...Ch. 8 - Prob. 19ECh. 8 - Wobble, a start-up company, is developing a search...Ch. 8 - A project consists of eight tasks labeled A...Ch. 8 - A project consists of eight tasks labeled A...Ch. 8 - Prob. 23ECh. 8 - Prob. 24ECh. 8 - Prob. 25ECh. 8 - A ballroom is to be set up for a large wedding...Ch. 8 - Prob. 27ECh. 8 - Prob. 28ECh. 8 - Exercises 29 through 32 refer to a project...Ch. 8 - Exercises 29 through 32 refer to a project...Ch. 8 - Prob. 31ECh. 8 - Exercises 29 through 32 refer to a project...Ch. 8 - Prob. 33ECh. 8 - Exercises33 and 34 refer to the Martian Habitat...Ch. 8 - Prob. 35ECh. 8 - Prob. 36ECh. 8 - Prob. 37ECh. 8 - Using the priority list G,F,E,D,C,B,A, schedule...Ch. 8 - Prob. 39ECh. 8 - Using the priority list G,F,E,D,C,B,A, schedule...Ch. 8 - Prob. 41ECh. 8 - Prob. 42ECh. 8 - Prob. 43ECh. 8 - Use the decreasing-time algorithm to schedule the...Ch. 8 - Prob. 45ECh. 8 - Use the decreasing-time algorithm to schedule the...Ch. 8 - Prob. 47ECh. 8 - Consider the project described by the digraph...Ch. 8 - Consider the project described by the digraph...Ch. 8 - Consider the project described by the digraph...Ch. 8 - Consider the project digraph shown in Fig.8-40....Ch. 8 - Consider the project digraph shown in Fig.8-40....Ch. 8 - Prob. 53ECh. 8 - Consider the project digraph shown in Fig.8-41....Ch. 8 - Schedule the Apartments Unlimited project given in...Ch. 8 - Schedule the project given in Exercise26 Table8-5...Ch. 8 - Consider the project described by the project...Ch. 8 - Consider the project digraph shown in Fig.8-43,...Ch. 8 - Prob. 59ECh. 8 - Symmetric and totally asymmetric digraphs. A...Ch. 8 - Prob. 61ECh. 8 - Let W represent the sum of the processing times of...Ch. 8 - You have N=2 processors to process M independent...Ch. 8 - You have N=3 processors to process M independent...Ch. 8 - You have N=2 processor to process M+1 independent...
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- Scott and Associates, Inc., is an accounting firm that has three new clients. Project leaders will be assigned to the three clients. Based on the different backgrounds and experiences of the leaders, the various leader-client assignments differ in terms of projected completion times. The possible assignments and the estimated completion times in days are as follows. Client Project Leader Jackson Elis Smith 22 24 24 (a) Develop a network representation of this problem. (Submit a file with a maximum size of 1 MB.) This answer has not been graded yet Min (b) Formulate the problem as a linear program. (Express your answers in the form x, where x, represents the completion time from leader / to client J.) st. Jackson Elis Smith Client 1 Client 2 Client 3 x20 for all, J. Solve Relationship Assignment Time (days) "11 *12 *13 *21 10 16 32 *22 *31 *32 711 What is the total time required (in days)? daysarrow_forwardDraw a network showing the quantities obtained in the final iteration and the optimal value of z.arrow_forwardDuring each 6-hour period of the day, the Bloomington Police Department needs at least the number of policemen shown in the following table. Policemen can be hired to work either 12 consecutive hours or 18 consecutive hours. Policemen are paid $15 per hour for each of the first 12 hours a day they work and are paid $22.5 per hour for each of the next 6 hours they work in a day. Formulate an LP that can be used to minimize the cost of meeting Bloomington’s daily police requirements and solve it via Excel. Time Period Number of required policemen 12:00AM----6:00AM 12 6:00AM----12:00PM 8 12:00PM----6:00PM 6 6:00PM----12:00AM 15arrow_forward
- A company manufactures a product at its plants in A, B, and C, then ships the product to six customers in G, H, J, K, and L, The monthly capacity of plants A, B, and Care 7400, 7300, and 10000 units, respectively. The monthly demand from customers G, H, J, K, and Lare 3000, 500, 4600, 7500, and 8900 units, respectively. Use Excel Solver to find the optimal distribution plant that will give the lowest total monthly shipping cost if the shipping cost per unit (in dollars per unit) are as follows: - from A to G, H, J, K, and L are 4, 9, 20, 6, and 13 dollars per unit, respectively; from B to G, H, J, K, and L are 12, 7, 3, 10, and 6 dollars per unit, respectively; from C to G, H, J, K, and L are 7, 6, 12, 2, and 9 dollars per unit, respectively. - The optimal total shipping costs is dollars per month.arrow_forwardThe Lawson Fabric Mill Produces five different fabrics. Each fabric can be woven on one or more of the mill’s 36 looms. The sales department’s forecast of demand for the next month is shown in below Table 1, along with data on the selling price per yard, variable cost per yard, and purchase price per yard. The mill operates 24 hours a day and is scheduled for 30 days during the coming month. The mill has two types of looms: draw and regular. The draw looms are more versatile and can be used for all five fabrics. The regular looms can produce only three of the fabrics. The mill has a total of 36 looms: 8 are draw and 28 are regular. The rate of production for each fabric on each type of loom is given in below Table 2. The time required to change over from producing one fabric to another is negligible and does not have to be considered. The Lawson Fabric Mill satisfies all demand with either its own fabric or fabric purchased from another mill. Fabrics that cannot be woven at the…arrow_forwardAn optimization study is conducted for a plant layout and operations. The final design for the operations layout may have several options. The process will initially utilize six devices running at the same time, then, five groups of employs will conduct manually the final process. State the possible number of different process routes that will be adopted. Select one:arrow_forward
- 10. Use the decreasing time algorithm to create a priority list for the digraph below, then schedule the project with two processors. ***Picture*** Task 6 is done by = ***Processor 1 or 2 *** starting at time = ______ Task 9 is done by = ***Processor 1 or 2 *** starting at time =________ The finishing time for the schedule is _____________arrow_forwardNeu Fabrication Company operates 360 days a year and uses 150 cartridges each day. Using a continuous inventory system, Neu orders 10,800 cartridges at a time. The orders are timed so that the new cartridges arrive just as inventory runs out (i.e. inventory level = 0), and replenishment is instantaneous. How long is the order cycle time? (i.e. How many business days between orders?) O 60 45 072 O 360arrow_forwardthat the amounts of time (in minutes) required for assembling the frames, installing the wheels, and decorating for the Starstreak and Superstreak models are as given in the following table: Frame Wheels Decoration Starstreak 25 6. 16 Superstreak 14 9 12 Assume also that each day the company has available 135 hours of labor for assembling frames, 95 hours of labor for installing wheels, and 110 hours of labor for decoration. Assume also that the profit on each Starstreak bike is $22.00 and the profit on each Superstreak bike is $26.00. How many bikes of each type should the company make in order maximize its profit?arrow_forward
- Suppose that in order to save money, the Golden Eagles Nest dining area is considering limiting the number of cashiers to one even during peak hours, but before making that decision, wants to know how much congestion the reduction in cashiers would cause. Suppose that the average transaction takes thirty (30) seconds, so the cashier can handle at most two (2) customers per minute. Suppose that during peak hours, an average of 2.2 students visit the dining area per minute; what percentage of days would the cashier NOT be able to keep up on his/her/eir own? i.e. calculate P(X > 2) and express your answer in decimal format rounded to two decimal places.arrow_forwardSolve each of the following linear programs using the simplex algorithm You should give the initial tableau and each further tableau produced during the execution of the algorithm. If the program has an optimal solution, give this solution and state its objective value. If it does not have an optimal solution, say why. Ideally you should indicate the highlighted row and columns in each pivot step as well as the row operations you carry out. This is in order to gain credit even if the final answer is incorrect. 1. 2. maximize 2x1 + 3x2 + 5x3+4 subject to x1 + x2 + 2x3 + x4≤ 2, 3x₂ + 3x3 + 3x4≤ 6, 3x₁ + 2x2 + 2x3 + I4 ≤7, X1, T2, T3, T4 20 maximize 2x₁ +4x₂ - 3 subject to -2x1 + x3 ≤ 3, 1x₁2x2 + 4x3 ≤ 2, x1 + x2 3x3 ≤ 2, 2x₁ - x₂ + x3 ≥ −6, I1, I2, I3 20arrow_forwardSuppose that in order to save money, the Golden Eagles Nest dining area is considering limiting the number of cashiers to one even during peak hours, but before making that decision, wants to know how much congestion the reduction in cashiers would cause. Suppose that the average transaction takes thirty (30) seconds, so the cashier can handle at most two (2) customers per minute. Suppose that during peak hours, an average of 3.0 students visit the dining area per minute; what is the standard deviation of the distribution? Round your answer to two decimal places.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Discrete Mathematics and Its Applications ( 8th I...MathISBN:9781259676512Author:Kenneth H RosenPublisher:McGraw-Hill Education
Mathematics for Elementary Teachers with Activiti...MathISBN:9780134392790Author:Beckmann, SybillaPublisher:PEARSON
Thinking Mathematically (7th Edition)MathISBN:9780134683713Author:Robert F. BlitzerPublisher:PEARSON
Discrete Mathematics With ApplicationsMathISBN:9781337694193Author:EPP, Susanna S.Publisher:Cengage Learning,
Pathways To Math Literacy (looseleaf)MathISBN:9781259985607Author:David Sobecki Professor, Brian A. MercerPublisher:McGraw-Hill Education
Discrete Mathematics and Its Applications ( 8th I...
Math
ISBN:9781259676512
Author:Kenneth H Rosen
Publisher:McGraw-Hill Education
Mathematics for Elementary Teachers with Activiti...
Math
ISBN:9780134392790
Author:Beckmann, Sybilla
Publisher:PEARSON
Thinking Mathematically (7th Edition)
Math
ISBN:9780134683713
Author:Robert F. Blitzer
Publisher:PEARSON
Discrete Mathematics With Applications
Math
ISBN:9781337694193
Author:EPP, Susanna S.
Publisher:Cengage Learning,
Pathways To Math Literacy (looseleaf)
Math
ISBN:9781259985607
Author:David Sobecki Professor, Brian A. Mercer
Publisher:McGraw-Hill Education
Minimum cuts and maximum flow rate; Author: Juddy Productions;https://www.youtube.com/watch?v=ylxhl1ipWss;License: Standard YouTube License, CC-BY