Bissoy.com
Doctors Medicines MCQs Q&A

If __________ is high relative to uptime, the database has existed in a lock state for a significant amount of time.

If __________ is high relative to uptime, the database has existed in a lock state for a significant amount of time. Correct Answer globalLock.totalTime

The value of totalTime represents the time, in microseconds, since the database last started and creation of the globalLock.

Related Questions

Consider a computer system with multiple shared resource types, with one instance per resource type. Each instance can be owned by only one process at a time. Owning and freeing of resources are done by holding a global lock (L). The following scheme is used to own a resource instance: function OWNRESOURCES(Resource R) Acquire lock L / / a global lock if R is available then Acquire R Release lock L else if R is owned by another process P then Terminate P, after releasing all resources owned by P Acquire R Restart P Release lock L end if end if end function Which of the following choice(s) about the above scheme is/are correct?
A multithreaded program P executes with x number of threads used y number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-re-entrant. i.e. if a thread holds a lock l, then it cannot re-acquire lock l without releasing it. If a thread is unable to acquire a lock, it blocks until the lock becomes available. The minimum value of x and the minimum value of y together for which execution of p can result in a deadlock are:
In a database system, unique timestamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the timestamps of transactions T1 and T2 respectively. Besides, T1 holds a lock on the resource R, and T2 has requested a conflicting lock on the same resource R. The following algorithm is used to prevent deadlocks in the database system assuming that a killed transaction is restarted with the same timestamp. If TS(T2) < TS(T1) then T1 is killed else T2 waits. Assume any transaction that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?
You are the administrator of a SQL Server 2000 computer. The server contains a database named FinanceData that is used by a client/server application. Each employee has a SQL Server login that the application uses to access the server.Your company hires a new employee named Andrew. You create a SQL Server login named Andrew. You also create a database user named Andrew in the database and grant the database user full permissions in the database.Whenever Andrew runs the client/server application, he receives the following error message: "Invalid object name." Andrew also reports that he cannot access the database by using the application.You need to ensure that Andrew can use the application. Which Transact-SQL statement should you execute?
The pie chart given below shows the amount spent by a boy on the purchase of six different items. The total amount spent on all these six items is Rs. 54000. The amount spent on a specific item is represented as a degree with reference to the total amount spent on all these six items. Which of the following statement(s) is/are correct? I. The amount spent on article A is Rs.900 less than the amount spent on article B. II. The amount spent on article C is Rs 2400 more than the amount spent on article D. III. The ratio of the amount spent on article B to the amount spent on article E is 4 : 1.
Below are given statements followed by some conclusions. You have to take the given statements to be true even if they seem to be at variance with the commonly known facts and then decide which of the given conclusions logically follow(s) from the given statements. Statements: I) All lock is book. II) No book is colored. Conclusions: I) All book is lock. II) No lock is Colored.  
In the following question below are given three statements followed by three conclusions. Taking the given statements to be true even if they seem to be at variance from commonly known facts, read all the conclusions and then decide which of the given conclusion logically follows the given statements. Statements: I. All Key are Lock. II. No Lock is Mat. III. All Mat are Glass. Conclusions: I. Some Glass being a Lock is a possibility. II. Some Glass are Key. III. No Key is Mat.
In a lock-gate, the reaction between two gates is (where P = Resultant pressure on the lock gate, and α = Inclination of the gate with the normal to the side of the lock)
A letter lock consists of 4 rings, each ring contains 9 non-zero digits. This lock can be opened by setting four digit code with the proper combination of each of the 4 rings. Maximum how many codes can be formed to open the lock ?
In a lock-gate, the reaction between two gates is (where P = Resultant pressure on the lock gate and $$\alpha $$ = Inclination of the gate with the normal to the side of the lock)