Computers and Technology, 10.03.2020 19:42 hschuman01osrzvf
Consider the following protocol for concurrency control. The database system assigns each transaction a unique and strictly increasingly id at the start of the transaction. For each data item, the database system also keeps the id of the last transaction that has modified the data item, called the transaction-id of the data item. Before a transaction T wants to read or write on a data item A, the database system checks whether the transaction-id of A is greater than the id of T . If this is the case, the database system allows T to read/write A. Otherwise, the database system aborts and restarts T.
Question1:
Does this protocol allow only a serializable schedule for transactions? If not, you may suggest a change to the protocol so that all schedules permitted by this protocol are serializable. You should justify your answer.
Question 2:
Propose a change to this protocol or the modified version you have designed for part (a) that increases its degree of concurrency, i. e., it allows more serializable schedules.
Answers: 2
Computers and Technology, 22.06.2019 06:50
Match the personality traits with their description
Answers: 1
Computers and Technology, 23.06.2019 09:30
Name the range function that would generate the following list of integers values: 0,1,2,3,4,5.
Answers: 1
Computers and Technology, 23.06.2019 17:30
When making changes to optimize part of a processor, it is often the case that speeding up one type of instruction comes at the cost of slowing down something else. for example, if we put in a complicated fast floating-point unit, that takes space, and something might have to be moved farther away from the middle to accommodate it, adding an extra cycle in delay to reach that unit. the basic amdahl's law equation does not take into account this trade-off. a. if the new fast floating-point unit speeds up floating-point operations by, on average, 2ă—, and floating-point operations take 20% of the original program's execution time, what is the overall speedup (ignoring the penalty to any other instructions)? b. now assume that speeding up the floating-point unit slowed down data cache accesses, resulting in a 1.5ă— slowdown (or 2/3 speedup). data cache accesses consume 10% of the execution time. what is the overall speedup now? c. after implementing the new floating-point operations, what percentage of execution time is spent on floating-point operations? what percentage is spent on data cache accesses?
Answers: 2
Computers and Technology, 24.06.2019 03:30
It is not necessary to develop strategies to separate good information and bad information on the internet. true or false
Answers: 1
Consider the following protocol for concurrency control. The database system assigns each transactio...
Mathematics, 21.10.2021 06:00
Mathematics, 21.10.2021 06:00
History, 21.10.2021 06:10
Mathematics, 21.10.2021 06:10
Mathematics, 21.10.2021 06:10
Mathematics, 21.10.2021 06:10
Mathematics, 21.10.2021 06:10
Mathematics, 21.10.2021 06:10
Mathematics, 21.10.2021 06:10
Mathematics, 21.10.2021 06:10