Write a function, named "wait_die_scheduler" that takes a list of actions, and returns a list of actions according to the follow
ing rules. The actions given to the scheduler will only consist of WRITE and COMMIT actions. (Hence only exclusive locks need be implemented.) Each transaction will end with a COMMIT action. Before examining each action, attempt to perform an action for each of the transactions encountered (ordered by their names). After all the actions have been examined, continue to attempt to perform an action from each transaction until there are no more actions to be done. You will need to add LOCK, UNLOCK, and ROLLBACK actions to the list of actions to be returned, according to the Wait-Die protocol. If releasing more than one lock (for instance after a COMMIT), release them in order by the name of their object. Use the deferred transaction mode (only requesting locks when needed).
1 answer:
You might be interested in
Solution :
class Employee:
#Define the
#constructor.
def ____(
, ID_number,
, email):
#Set the values of
#the data members of the class.
= name
_number = ID_number
= salary
self.email_address = email
#Define the function
#make_employee_dict().
def make_employee_dict(list_names, list_ID, list_salary, list_email):
#Define the dictionary
#to store the results.
employee_dict = {}
#Store the length
#of the list.
list_len = len(list_ID)
#Run the loop to
#traverse the list.
for i in range(list_len):
#Access the lists to
#get the required details.
name = list_names[i]
id_num = list_ID[i]
salary = list_salary[i]
email = list_email[i]
#Define the employee
#object and store
#it in the dictionary.
employee_dict[id_num] = Employee(name, id_num, salary, email)
#Return the
#resultant dictionary.
return employee_dict