A set of 39 tasks are assigned to a set of 13 processors. The processors are all distinct. Each task is assigned to exactly one processor. A processor can be assigned more than one task. (a) How many ways are there to assign the tasks if the tasks are all different and there are no restrictions on the numbe of tasks that can go to any particular processor? 39^13 Preview (b) How many ways are there to assign the tasks if the tasks are all identical and there are no restrictions on the numbe of tasks that can go to any particular processor? Preview (c) How many ways are there to assign the tasks if the tasks are all different and each processor must receive the same

A set of 39 tasks are assigned to a set of 13 processors. The processors are all distinct. Each task is assigned to exactly one processor. A processor can be assigned more than one task. (a) How many ways are there to assign the tasks if the tasks are all different and there are no restrictions on the numbe of tasks that can go to any particular processor? 39^13 Preview (b) How many ways are there to assign the tasks if the tasks are all identical and there are no restrictions on the numbe of tasks that can go to any particular processor? Preview (c) How many ways are there to assign the tasks if the tasks are all different and each processor must receive the same

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

When a program is adapted to run on multiple processors in a multiprocessor system, the execution time on each processor is comprised of computing time and the overhead time required for locked critical sections and/or to send data from one processor to another. Assume a program requires t = 100 s of execution time on one processor. When run p processors, each processor requires t/p s, as well as an additional 4 s of overhead, irrespective of the number of processors. Compute the per-processor execution time for 2, 4, 8, 16, 32, 64, and 128 processors. For each case, list the corresponding speedup relative to a single processor and the ratio between actual speedup versus ideal speedup (speedup if there was no overhead).
Q2/ Consider three different processors P1, P2, and P3 with the clock rates and CPIs given in the following table. Processor Clock Rate CPI P1 4 2 P2 2.5 1.0 P3 3 1.5 If the processors each execute a program in 10 seconds, find the number of cycles and the number of instructions. Which processor has the highest performance expressed in instructions per second if all processors have the same instructions set architecture? Q/3 Our favorite program runs in 10 seconds on computer A, which has a 400Mhz. clock. We are trying to help a computer designer build a new machine B, that will run this program in 6 seconds. The designer can use new technology to substantially increase the clock rate, but has informed us that this increase will affect the rest of the CPU design, causing machine B to require 1.2 times as many clock cycles as machine A for the same program. What clock rate should we tell the designer to target? Answer: Q 4/ Suppose we have two implementations of the…
Fill in blank Suppose that there is only one CPU and we have three processes P1, P2, P3 arrived for execution at time 0, 1, 2 respectively. Their burst time are 8, 5, 2 respectively. None of these processes will perform I/O operations. Consider non-preemptive scheduling. With the FCFS scheduling algorithm, the average turnaround time of these processes will be----- and the average response time will be ------ With the SJF scheduling algorithm, the average turnaround time of these processes will be ----- and the average response time will be -----
Please elaborate on the idea of parallel processing, which is also known as multiprocessing. Performing operations simultaneously. The Option Blue line of supercomputers from IBM can do three trillion computations per second. For this purpose, around a thousand computers are networked together. Is there a certain kind of software that is best suited to run in parallel? How has parallel processing changed the way we think about the structure of computers? To what extent can the average computer user benefit from parallel processing in the present day?
. Consider a system that has multiple processors where eachprocessor has its own cache, but main memory is shared among allprocessors.1. a) Which cache write policy would you use?2. b) The cache coherency problem. With regard to the systemjust described, what problems are caused if a processor has acopy of memory block A in its cache and a second processor,also having a copy of A in its cache, then updates mainmemory block A? Can you think of a way (perhaps morethan one) of preventing this situation, or lessening itseffects?
Question Show how the following values would be stored bybyte-addressable machines with 32- bit words, using little endianand then big endian format. Assume each value starts at address301816. Draw a diagram of memory for each, placing the appropriatevalues in the correct (and labeled) memory locations. a. 56789ABC16 b. 2014111910 The memory unit of a computer has256K words of 32 bits each. The computer has an instruction formatwith 4 fields: an opcode field; a mode field to specify 1 of 7addressing modes; a register address field to specify one of 16registers; and a memory address field. Assume an instruction is 32bits long. Answer the following: a. How large must the mode field be? b. How large must the register field be? c. How large must theaddress field be? d. How large is the opcode field? 4. In a computerinstruction format, the instruction length is 12 bits and the sizeof an address field is 4 bits. Is it possible to have: 13 2-address instructions 45 1-address instructions…
Principle of locality is defined by Stallings as the tendency of a processor to access the same set of memory locations repetitively over a short period of time. Locality is a universal behavior of all computational processes: They tend to refer repeatedly to subsets of their resources over extended time intervals. Use your own words to answer the following questions: What is the distinction between spatial locality and temporal locality? In general, what are strategies for exploiting spatial locality and temporal locality? How does the principle of locality relate to the use of multiple memory levels?
hi can u anwser this qustion plesc ? Consider a Computer which has a memory which is capable of storing 4096 K words and each word in memory can be of size 32 bits. The computer supports a total of “K” addressing modes, and it has “M” computer registers. The computer supports instructions, where each instruction consists of following fields: Mode Operation code Register Register Memory AddressGiven that each instruction will be stored in one memory word, discuss with a suitable diagram the format of instruction by specifying number of bits for each field of instruction. Discuss each field of instruction.Note: Choose your own values for K (number of addressing modes) and M (number of Registers) k=8 m=50
Suppose a given processor has access to two levels of memory. Level 1 contains 1000 words and has an access time of 0.01 μs; level 2 contains 100,000 words and has an access time of 0.1 μs. Assume that if a word to be accessed is in level 1, then the processor accesses it directly. If it is in level 2, then the word is first transferred to level 1 and then accessed by the processor. For simplicity, ignore the time required for the processor to determine whether the word is in level 1 or level 2. Suppose 95% of the memory accesses are found in level 1, define the hit ratio (H) and find the average access time.
A superscalar computing system with the 2nd degree of Superscalar and with 3 processing units. The instructions are: I1: Require 2 execution cycles I2: Require 4 execution cycles I3& I4: Conflict for resources I3& I4: Require 2 execution cycles I5: Data dependency on I4 I6 to I9: No constraints Analyze the performance of this system in terms of clock cycles count for the following three cases. In-order issue and In-order completion In-order issue and out-of-order completion Out-of-order issue and out-of-order completion
a) Suppose two threads T1 and T2 are running concurrently in the same process with a single CPU. Suppose T1 does “Load X into register R1” machine instruction. Then the CPU scheduler switches the CPU to T2. Will T2 see the same vaue of R1 as loaded here by T1? (YES or NO)? Explain in less than 50 words. Be specific. (b) Suppose two threads T1 and T2 are running concurrently in the same process with a single CPU. Is it possible to have a moment (time instant) where both threads have made a request to Memory Unit to read some data (ex. as part of a “Load … into register …” instruction) and Memory Unit has not yet completed either of these two requests? Explain in less than 50 words.
1) Which of the following best explains why machine instruction is written in binary code? a. Machine instruction are written in binary code because computers can only understand non sequential set of instructions which can easily be translated using binary number b. Machine instruction are written in binary code to execute sequence faster by telling the computer what instruction to perform if machine state is "1" and what instruction to neglect if machine state is "0" c. Machine instruction are written in binary sequence so that it can easily be understood by operating system whereby if machine state is "1" it means not to perform instruction while if machine state is "0" it means to execute instruction d. Machine instruction are written in binary because humans cannot understand binary number thereby protecting its content from hacking 2) Which of the following best describe the difference of information system and information technology? a. Information…