Distributed System Design 1st Edition Jie Wu - Solutions

Enhance your understanding of "Distributed System Design 1st Edition" by Jie Wu with our comprehensive solutions and answers. Explore a wide range of solved problems and step-by-step answers, ideal for students and instructors alike. Our solutions PDF and online answer key provide detailed chapter solutions and a robust test bank to support your learning journey. Access the instructor manual and textbook solutions, tailored to guide you through complex concepts. Enjoy free download options for select materials, ensuring you have the resources you need at your fingertips for effective study and mastery of this subject.

=+9. What are the fundamental differences between the management control system and the process control system of a plant?
=+lO. Consider, using an example from manufacturing, how inadequate communication may contribute to a system's failure.
=+I J. Identify the key communications in your organization. What are the sources of noise which may exist in this system? Also consider how the development of communications technology has affected the structure and operation of the organization.
=+12. Use the prototype system model of Fig. 2.27 to expand the system which you described in Question 7. Identify the influential environmental factors, the wider system (if any) and the three necessary sub-systems; describe the operational subsystem; indicate what sorts of data are obtained and
=+13. Review sections 2.2.1-2.2.3. Take each of the five steps of the 5W procedure in turn, and find the related system features which are outlined in these sections.
=+14. Choose a situation from your work environment which contains problems and assemble the possible system(s) involved by applying the 5W procedure. Outline the answers to the questions associated with each of the steps.
=+IS. The following checklist has been provided by one policy studies institute for the important issues of managing innovation in a manufacturing organization. An innovative business should:• understand the importance of innovation;• have a deliberate policy of research and development;•
Given a 4-cube with faulty nodes {0001, 0011, 1000, 1010, 1111},• Determine the safety level of each node.• Prove that if the source node is safe, then there is a healthy Hamiltonian path from the source to any destination in any cube. (Hint: Use induction based on the distance between the
=+1. Develop a systems structure of a particular manufacturing organization, including its functions, its material and information flow together with its relationships and control structures.
=+2. Identify the role and operations of various functions within the overalI framework of manufacturing, including: sales and contract; production planning;product design and development; material and capacity requirements planning; production resource acquisition; production control; and
=+3. Understand the principles of the systems approach to production resource acquisition and the techniques of manufacturing planning and control, including: aggregate planning approaches, disaggregate planning approaches, and integrated planning approaches.
=+4. Understand the principles and techniques of various AMT areas, including:factory layout; the machining centre and numerical control; robots and AGYs; machining celIs and FMS; automatic and flexible assembly; CADI CAM, CAE, CAPP, and CAPM; computer integrated manufacturing; and quality control.
=+5. Identify the important problem areas and the associated key issues in modern manufacturing systems.
=+• What is the difference between this and the previous design?
=+• Should the work be based on a totally new design, or can it be simply a modification of a previous concept?
=+• How difficult is the task involved?
=+• What is the amount of work involved?
=+• Which task team is suitable (or available) for such a project?
=+1. Is the in-house producibility adequate?
=+2. Do the sub-contractors have adequate producibility for the bought-out items?
=+3. If the answer to question 1 or 2 is 'no', what can be done about it?
(a) Provide a shortest-path routing algorithm for the mesh interconnection network.(b) Provide a shortest-path routing algorithm for the mesh with up to one faulty link.(c) Provide a routing algorithm for the mesh with up to three faulty links. We assume each node knows local information in both
=+• Which order/delivery should be inspected?
=+• Which feature of the items/services should be inspected?
=+• Should a 100 per cent inspection be conducted?
=+• If sampling inspection is appropriate, which method is the most efficient and economical?
=+• What procedures must be used to communicate with suppliers about nonconforming items/services?
=+• What procedures must be used for dealing with defective items which have been delivered?
=+I. In Chapter 2, a number of systems concepts were introduced, including: system, sub-system, system element, relationship, process, boundary, emergent property, feedback control, and communication. Take each of these in turn, and show how IDEFo as a system descriptiop. tool expresses or reflects
=+2. Draw an IDEFo model to describe a manufacturing operation that you are concerned with.
=+3. A rna!1afacturing organization is a typical system within which many systems concepts may be applied. Discuss this in terms of structure, function, relationship and control, etc., and hence identify what is required for its efficient operation.
=+4. It was claimed in this chapter that: 'Purchasing is a manufacturing function for which a systems approach is of vital importance.' Discuss.
=+5. What manufacturing functions have benefited from the development and implementation of AMTs? In particular, discuss the role of process planning in a computerintegrated manufacturing system.
=+6. What parameters, problems, techniques and systems are involved in manufacturing planning and control? Which is best: centralized or decentralised control?
=+1. understand in general terms the principles, structure and techniques of the hard systems approach to systems design and problem-solving, and to use this approach in certain specific problem situations;
=+2. understand in general terms the principles, structure and techniques of the soft systems approach to systems design and problem-solving, and to become familiar enough with the methodology to apply it where appropriate;
Suppose that U-mesh routing is used for the following multicasting: s = (0, 0) and d = {(2, 0),(5, 3), (1, 6), (3, 5), (3, 3), (4, 2), (1, 5)}. Show all the routing paths to each destination and demonstrate that it is step-wise contention-free, i.e., there is no contention within each routing step.
=+3. explain the fundamental similarities and differences between the two approaches, and be able to choose the most suitable approach according to the particular circumstances;
=+4. appreciate the relevance of the systems concepts (as outlined in Chapter 2)in relation to these systems methodologies.
=+(a) What relevant background and environment information is required?
=+(b) Is the journey feasible? There may be constraints on distance, time, money and means of transportation - today it is not possible, for example, to travel to Mars, or to reach New York from London in one hour - not with today's means of transportation technology anyway?
=+(c) What are the most important factors to consider when planning the journey? For example, if we are in a hurry to meet a business appointment then the time taken by the journey is clearly an important factor.On the other hand, if the purpose of the journey is to reach a holiday destination,
=+3. What are the possible routes and means? There may be a number of alternative means to reach B from A, travelling by road, rail, sea or air; each of these may again entail a number of possible routes. In order to make a choice, we must first gather as much information as we possibly can.
=+4. Which route to take? We should now analyse the possible consequences of each choice of route, and choose the best based on the information we have.We must have effective means to carry out this evaluation process - perhaps
=+a calculator to sum up the total time or money needed by each of the choices in this particular case.
=+S. Start the journey and keep an eye on progress. According to the journey plan derived from the completion of the previous steps, we can now begin the journey. However, in order successfully to reach B, we have to monitor continuously the progress of the journey. On our way we may have to alter
Suppose that a 6 × 6 mesh has been partitioned into two subnetworks (a low-channel network and a high-channel network). Determine the routing paths for the following multicastings:• s = (4, 5) and d = {(1, 2), (2, 4), (3, 1), (5, 4), (6, 5)}• s = (2, 4) and d = {(1, 1), (2, 3), (3, 3), (4, 4),
=+1. Identify at least two disadvantages of comparing system outcomes by using the overall utility approach described in section 4.2.5.
=+2. Revise the hard systems approach by rereading section 4.2. Pay particular attention to both the overall characteristics of the approach and the particular issues associated with the specific steps. Repeat this process if necessary until you are confident that you understand the approach well
=+3. Revise the soft systems approach by reading section 4.3, and then apply the methodology to a suitable, real-world problem situation in relation to your job or within your organization. Prepare a report of this project (2000 words).4. Having carried out Questions 2 and 3, compare the hard and
=+1. In the experts' opinion, is the initial impression of the model's stated hypotheses credible?
=+2. Do sensitivity analysis studies (varying input parameters) show output patterns which compare with their assumed counterparts in the real world?
=+3. Does the model 'act' like the real world?
=+1. Define and initialize variables, define arrays for the distribution tables, define entry, machine and message points:,
Using Lan’s greedy tree-based algorithm to derive a multicast tree for multicast set {0110, 0100, 1100, 0010, 1111} in a 4-cube, assume that node 0000 is the source.
=+O!.,ARRIV AL=(oo:oo)%MCING=(OO:oo)@BF_SIZE=(SO)*ENTRY =(XY(7, IS»*MACHINE=(XY(6S,IS»*MSG-FLW=(XY(3S,9»@NO_DONE=(O)% T_TOT=(OO:oo)%T_MN=(OO:OO); Random time of arrivals; Random time machining; Maximum number allowed in buffer; Entry location on the screen; Machine position; Message location on
=+2. Define job descriptions, overlay file and data collection point, etc, as shown below. The J = directive specifies the make-up of the job:Job number = I Symbol used to represent part on screen = P Route to take = No. 1 Controlling parameters = the parts in this job are to be released only after
=+0=(=)L=(SO)U=(I,Machine, *MACHINE)J =(I,P ,1,2,2,SO,100OO); Overlay File with the same name; Wip Limit to SO objects; Collect the utilization of machine; Job #1 - parts
=+3. Define routes. Route 2 enters the cumulative distribution as shown above, whereas Route 1 defines the main part of the program where the machining process actually takes place:Enter parts into the shop Move around buffer area Move to machine Perform machining operation Calculate mean
=+The coding of this route is as shown. The BR instruction specifies the beginning of the route, and shows that a part should enter the system at screen location *ENTRY, and with a delay corresponding to %ARRIV AL.The functions of the rest of the instructions in this routine are very
=+1. Based on the characteristics of computer simulation reviewed in section 5.3, give some examples of manufacturing problems which are best solved analytically and of problems which are best tackled by simulation. Outline the reasons for your choice.
=+2. Read and try to understand the underlying logic of the BASIC program presented in Box 5.2. Run this program on your computer and then attempt the following questions by modifying the relevant parameter values in the model:
Suppose that the coordinate sequence is cs = {2, 1, 3} at source node 0 of a 3-cube. Determine the edge-disjoint multiple binomial tree and multiple paths to each node of the 3-cube.
=+(a) What are the values of performance data given by the system under the existing operation conditions?
=+(b) What is the throughput time of 500 parts instead of lOOO?
=+(c) If the machine capacity is reduced by 30%, how does this affect the operation of the system?
=+(d) What is the effect if the machine capacity is increased by 30%?
=+(e) What is the effect if the workload to the system is increased by half? What if it is reduced by half?
=+(f) What is the effect if the parts arrive in the system in a more orderly manner (that is. if their distribution has a smaller variance)? How about if they arrive more randomly?
=+3. Figure 5.32 illustrates a machining cell which consists of two identical machining centres and a robot. The robot serves the two machining centres by loading and unloading them respectively at the start and the end of a machining operation. Draw an activity cycle diagram to describe this
=+Fig. 5.32 Cell consisting of two machines and a loading robot
=+4. Choose a real-life activity (such as a machining operation) and collect a number of samples of the time the activity takes (40-50 will be sufficient). Compile a cumulative distribution for this set of samples according the steps outlined in this chapter.Use the resulting graph and a table of
=+5. Modify the simulation program that you have developed in Question 2 so that it now allows the use of user-defined distributions. Then use this to simulate the process involved in Question 4. Compare your results with the real situation.
Suppose the postal model is used for broadcasting and l = 8.What is the maximum number of nodes that can be reached in time unit 10.Derive the corresponding broadcast tree.
=+6. Jobs randomly arrive at a single-station machining cell at an average rate of 8 per hour.The processing time of the work-station is negative exponentially distributed with a mean of 7 minutes per job. Find:
=+(a) The machine utilization(b) The minimum size of buffer store to cope with average queue length
=+(c) The average time for a job to go through the system If the due dates of these jobs are to be assigned by the following formula:d; == '; + 100 where d; is the due date of job i,'; is the arrival time of job i, and 100 represents the throughput allowance in minutes:
=+(d) What is the probability of a job being late for delivery?
=+(e) At what speed must the machine operate so that on average the proportion of late jobs is restricted to less than 20%?(f) If the hourly cost of running the machining centres is £M per hour per machine and the fixed penalty for late deliveries is £C per late part, for what values of M and C
=+7. The production operation of a product in a small factory involves a particular process which is performed on a single facility. During an eight hour working day, on average 45 products require to be processed by this facility, which completes the production process at an average speed of 8.5
=+If the situation can be described by a Poisson process, how much will the process cost if the average queue length before this facility is reduced to half its present value, assuming that it costs an additional £5 for every minute of reduction in the processing time?
Describe Chandy, Misra, and Hass’s algorithm for the OR model using an example.
=+8. Discuss the possible ways in which the theoretical results of queuing theory as listed in this chapter may be used to check the validity of a computer simulation model.Modify the BASIC simulation model given in section 5.4.1 so that both the arrival and service time are now represented by
=+9. Having discussed the modelling approaches of discrete simulation models using a general-purpose programming language, and reviewed the necessary techniques of probability and statistics such as probability distribution and random variable generation, the reader is now in a position to write
=+when appropriate. It should call three 'phase' sub-routines which respectively determine the time of the next event, call the immediate activity routine(s) concerned, and then scan and initiate any other possible activities; and a set of task-specific activity routines which, when their
=+10. If you have obtained the demonstration diskettes, run simulation model MCI. Use the interactive simulation facilities provided by PCModel to look at the simulation parameters and machine utilizations, etc. Note the queuing situation and the average throughput time of the parts.
=+11. Following on from Question 10 run simulation model MC2. Note the queuing situation and the average throughput time of the parts and compare these to those given by MCI.
Prove in Mitchell and Merritt’s algorithm that the id of a process that is outside a cycle will never be circulated inside a cycle.
=+12. Following on from Question 11, modify model MC2 so that the machining time in the two-machine model is now exponentially distributed, then experiment with the model to find the machine capacity (Le. mean machining time) to achieve:(a) mean machine utilization around 90% between the two
=+13. Figure 5.33 is the overlay of a machining cell consisting of four identical machining centres which are loaded and unloaded by a robot (supplied as CELL.OLY on Demonstration Diskette No.1). Each loading operation will take 10 seconds to complete, and each unloading 8 seconds. Parts arrive at
=+Write a PCModel program to simulate the cell, and use the model to answer the following questions:
=+(a) How long on average will this cell take to put through a batch of 2000 parts?What about 5000 parts? Your estimate should be based on the average of a number of independent samples (use different random seeds to obtain independent samples by using the instruction RS( ». Calculate the
=+(b) Estimate the mean throughput time. Discuss the WIP situation in the cell.
=+(c) Estimate the mean utilization of the robot. Is it playing a satisfactory role in the system?Hint: The program should have a similar structure as that of MC2.MDL. There is, however, an additional requirement to test the availability of the robot each time a part is to be loaded or unloaded.
=+EL; Begin link; Test location *ROBOT for occupancy, and; When free, grab the robot and set busy; Load part for a time %LOADING; Release robot; End of loading and return The unloading operation can be simulated in a similar manner. The useful X- and Y-coordinates on this overlay are as
Suppose that each process is assigned a unique priority number. Provide a detailed design for a deadlock prevention mechanism that can support dynamic priority of each process.
Give suitable examples to show that if one of the four necessary conditions for a deadlock is absent, there will be no deadlock.
In your own words define a deadlock situation and illustrate this concept using an example.
If the range of process id is given, i.e., id(i) Î [a..b] where a and b are integers, improve Lynch’s variable-speed algorithm by reducing its time complexity.
In the Lynch’s time-slice algorithm suppose we change the algorithm such that process P isends its id in round(a) n(b)Change the rest of the algorithm accordingly to ensure it can still select a leader correctly. In addition the time complexity should remain the same.

Showing 6600 - 6700 of 7343

First
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74

Distributed System Design 1st Edition Jie Wu - Solutions

Step by Step Answers