Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Menu

PL EN
PL EN
Main page / Reports / The Optimal Pessimistic Transactional Memory Algorithm
Submit a comment

Report

Works title

The Optimal Pessimistic Transactional Memory Algorithm

Authors

[ 1 ] Instytut Informatyki, Wydział Informatyki, Politechnika Poznańska | [ P ] employee

Work ID

r474939_2016

Keywords
EN
  • transactional memory
  • concurrency control
  • pessimistic TM
  • Irrevocable transactions
Date

26.04.2016

Language

english

Number of pages or volume of work

29

Type of work

research report

System created by Poznań University of Technology and Poznan Supercomputing and Networking Center
This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.