![]() | |
#1
| |||
| |||
|
#2
| |||
| |||
|
|
Hi, I am new to the field so I apologize if this question seems trivial. I am currently working on distributed software transactional memory (STM). Since database transactions are the semantic inspiration for STM, I was wondering about the level of concurrency of distributed database transactions. Specifically, are subtransactions concurrent or are they sequential? If they are sequential, doesn't this prolong the duration of the transaction and hence increase the chances of conflicts and hence retries? Has this problem, possible "retry thrashing", if you will, been considered in the literature? Again I apologize if this question seems trivial, but I am relatively new to the field. How sweet...Rediscovery that concurrency is better handled at database |
#3
| |||
| |||
|
|
Hi, I am new to the field so I apologize if this question seems trivial. I am currently working on distributed software transactional memory (STM). Since database transactions are the semantic inspiration for STM, I was wondering about the level of concurrency of distributed database transactions. Specifically, are subtransactions concurrent or are they sequential? If they are sequential, doesn't this prolong the duration of the transaction and hence increase the chances of conflicts and hence retries? Has this problem, possible "retry thrashing", if you will, been considered in the literature? Again I apologize if this question seems trivial, but I am relatively new to the field. How sweet...Rediscovery that concurrency is better handled at database |
#4
| |||
| |||
|
|
Hi, I am new to the field so I apologize if this question seems trivial. I am currently working on distributed software transactional memory (STM). Since database transactions are the semantic inspiration for STM, I was wondering about the level of concurrency of distributed database transactions. Specifically, are subtransactions concurrent or are they sequential? If they are sequential, doesn't this prolong the duration of the transaction and hence increase the chances of conflicts and hence retries? Has this problem, possible "retry thrashing", if you will, been considered in the literature? Again I apologize if this question seems trivial, but I am relatively new to the field. How sweet...Rediscovery that concurrency is better handled at database |
#5
| |||
| |||
|
|
Hi, I am new to the field so I apologize if this question seems trivial. I am currently working on distributed software transactional memory (STM). Since database transactions are the semantic inspiration for STM, I was wondering about the level of concurrency of distributed database transactions. Specifically, are subtransactions concurrent or are they sequential? If they are sequential, doesn't this prolong the duration of the transaction and hence increase the chances of conflicts and hence retries? Has this problem, possible "retry thrashing", if you will, been considered in the literature? Again I apologize if this question seems trivial, but I am relatively new to the field. How sweet...Rediscovery that concurrency is better handled at database |
#6
| |||
| |||
|
|
Hi, I am new to the field so I apologize if this question seems trivial. I am currently working on distributed software transactional memory (STM). Since database transactions are the semantic inspiration for STM, I was wondering about the level of concurrency of distributed database transactions. Specifically, are subtransactions concurrent or are they sequential? If they are sequential, doesn't this prolong the duration of the transaction and hence increase the chances of conflicts and hence retries? Has this problem, possible "retry thrashing", if you will, been considered in the literature? Again I apologize if this question seems trivial, but I am relatively new to the field. How sweet...Rediscovery that concurrency is better handled at database |
#7
| |||
| |||
|
|
Hi, I am new to the field so I apologize if this question seems trivial. I am currently working on distributed software transactional memory (STM). Since database transactions are the semantic inspiration for STM, I was wondering about the level of concurrency of distributed database transactions. Specifically, are subtransactions concurrent or are they sequential? If they are sequential, doesn't this prolong the duration of the transaction and hence increase the chances of conflicts and hence retries? Has this problem, possible "retry thrashing", if you will, been considered in the literature? Again I apologize if this question seems trivial, but I am relatively new to the field. How sweet...Rediscovery that concurrency is better handled at database |
#8
| |||
| |||
|
|
Hi, I am new to the field so I apologize if this question seems trivial. I am currently working on distributed software transactional memory (STM). Since database transactions are the semantic inspiration for STM, I was wondering about the level of concurrency of distributed database transactions. Specifically, are subtransactions concurrent or are they sequential? If they are sequential, doesn't this prolong the duration of the transaction and hence increase the chances of conflicts and hence retries? Has this problem, possible "retry thrashing", if you will, been considered in the literature? Again I apologize if this question seems trivial, but I am relatively new to the field. How sweet...Rediscovery that concurrency is better handled at database |
#9
| |||
| |||
|
|
Hi, I am new to the field so I apologize if this question seems trivial. I am currently working on distributed software transactional memory (STM). Since database transactions are the semantic inspiration for STM, I was wondering about the level of concurrency of distributed database transactions. Specifically, are subtransactions concurrent or are they sequential? If they are sequential, doesn't this prolong the duration of the transaction and hence increase the chances of conflicts and hence retries? Has this problem, possible "retry thrashing", if you will, been considered in the literature? Again I apologize if this question seems trivial, but I am relatively new to the field. How sweet...Rediscovery that concurrency is better handled at database |
#10
| |||
| |||
|
|
Hi, I am new to the field so I apologize if this question seems trivial. I am currently working on distributed software transactional memory (STM). Since database transactions are the semantic inspiration for STM, I was wondering about the level of concurrency of distributed database transactions. Specifically, are subtransactions concurrent or are they sequential? If they are sequential, doesn't this prolong the duration of the transaction and hence increase the chances of conflicts and hence retries? Has this problem, possible "retry thrashing", if you will, been considered in the literature? Again I apologize if this question seems trivial, but I am relatively new to the field. How sweet...Rediscovery that concurrency is better handled at database |
![]() |
| Thread Tools | |
| Display Modes | |
| |