2011 IEEE/IFIP 41st International Conference on Dependable Systems &Amp; Networks (DSN) 2011
DOI: 10.1109/dsn.2011.5958224
|View full text |Cite
|
Sign up to set email alerts
|

Deadline-aware scheduling for Software Transactional Memory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 13 publications
(6 citation statements)
references
References 17 publications
0
6
0
Order By: Relevance
“…Irrevocable Transactions [21,29] is an STM system that converts a transaction into a special irrevocable mode. When a transaction is converted to this mode, it always has highest priority in data conflict resolution.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Irrevocable Transactions [21,29] is an STM system that converts a transaction into a special irrevocable mode. When a transaction is converted to this mode, it always has highest priority in data conflict resolution.…”
Section: Related Workmentioning
confidence: 99%
“…Irrevocable Transactions [21,29] is one solution that was proposed to avoid this type of abort. If this situation occurs, the transaction can be marked as irrevocable, or non-abortable, effectively converting the transaction into a critical section.…”
mentioning
confidence: 99%
“…If this is the case, the transaction appears in the list of committed transactions (scanned by the pointer current, lines 21-22). prevent endless looping(i); (21) current ← (↓ current).next; (22) same as lines 08 and 09; (23) if (∃ X ∈ lrs : X, − ∈ (↓ current).ws) then overwritten ← true end if (24) end while; (25) if (¬committed ∧ (¬overwritten ∨ ws = ∅)) (26) then allocate a new transaction descriptor DESCR; (27) DESCR ← ⊥, current, i, i tr sn , ws, i local state ; (28) committed • The second is when the transaction is not an update transaction and it has read a t-object that has then been overwritten (by a committed transaction). This is captured by the predicate at line 23.…”
Section: Speculative Execution Of the Selected Transaction (Lines 12-17)mentioning
confidence: 99%
“…Possible solutions are proposed and discussed in [27] and [31]. Irrevocable transactions suited to deadline-aware scheduling are presented in [23].…”
Section: Irrevocable Transactionsmentioning
confidence: 99%
“…Communication between the STM runtime and kernel module is implemented using a shared memory region to keep the overhead minimal [Maldonado et al 2010]. A preliminary version of this work, where only the case of a single transaction with a deadline was considered and with fewer evaluation results, was presented in Maldonado et al [2011].…”
Section: Introductionmentioning
confidence: 99%