Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
271
Highly-Concurrent Multi-Word Synchronization
, 2010
"... The design of concurrent data structures is greatly facilitated by the availability of synchronization operations that atomically modify k arbitrary locations, such as k-read-modify-write (krmw). Aiming to increase concurrency in order to exploit the parallelism offered by today’s multi-core and mul ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
-core and multiprocessing architectures, we propose a highly-concurrent nonblocking software implementation of krmw, which induces only constant space complexity overhead. Our algorithm ensures that two operations delay each other only if they are within distance O(k) in the conflict graph, dynamically induced
Brief announcement: Dynamic-sized lock-free data structures
- In To appear in Proceedings of the Twenty-First Symposium on Principles of Distributed Computing
, 2002
"... Almost all previous dynamic-sized lock-free data structures are either unable to free memory to the memory allocator when it is no longer required, or require special system or hardware support. In the only exception we are aware of, a single thread failure can prevent further memory reclamation (se ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
(see full paper for reference). We recently posed a problem — the Repeat Offenders Problem (ROP) — and presented one solution and its correctness proof [3]. Solutions to this problem can be used to design dynamic-sized lockfree implementations of shared data structures that overcome all
Brief Announcement: Concurrent Data Structures for Efficient Streaming Aggregation
"... We briefly describe our study on the problem of streaming multiway aggregation [5], where large data volumes are re-ceived from multiple input streams. Multiway aggregation is a fundamental computational component in data stream management systems, requiring low-latency and high through-put solution ..."
Abstract
-
Cited by 3 (3 self)
- Add to MetaCart
-put solutions. We focus on the problem of designing con-current data structures enabling for low-latency and high-throughput multiway aggregation; an issue that has been overlooked in the literature. We propose two new concurrent data structures and their lock-free linearizable implementa-tions, supporting both
Transaction Safe Nonblocking Data Structures ⋆
"... This brief announcement focuses on interoperability of software transactions with ad hoc nonblocking algorithms. Specifically, we modify arbitrary nonblocking operations so that (1) they can be used both inside and outside transactions, (2) external uses serialize with transactions, and (3) internal ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
This brief announcement focuses on interoperability of software transactions with ad hoc nonblocking algorithms. Specifically, we modify arbitrary nonblocking operations so that (1) they can be used both inside and outside transactions, (2) external uses serialize with transactions, and (3
Transactions on Parallel and Distributed Systems
"... (MMOGs) can include millions of concurrent players spread across the world and interacting with each other within a single session. Faced with high resource demand variability and with misfit resource renting policies, the current industry practice is to over-provision for each game tens of self-own ..."
Abstract
- Add to MetaCart
(MMOGs) can include millions of concurrent players spread across the world and interacting with each other within a single session. Faced with high resource demand variability and with misfit resource renting policies, the current industry practice is to over-provision for each game tens of self
Brief Announcement: A General Technique for Non-blocking Trees
"... We introduce a template that can be used to implement a large class of non-blocking tree data structures efficiently. Using this template is significantly easier than designing the implementation from scratch. The template also drastically simplifies correctness proofs. Thus, the template allows us ..."
Abstract
- Add to MetaCart
We introduce a template that can be used to implement a large class of non-blocking tree data structures efficiently. Using this template is significantly easier than designing the implementation from scratch. The template also drastically simplifies correctness proofs. Thus, the template allows us
Self-concordance at work: Toward understanding the motivational effects of transformational leaders.
- Academy of Management Journal,
, 2003
"... We extend existing theories by linking transformational leadership to "self-concordance" at work. In two studies using diverse samples and methods, leader behaviors were associated with follower tendencies to set self-concordant goals. In general, followers of transformational leaders vie ..."
Abstract
-
Cited by 113 (3 self)
- Add to MetaCart
across organizations was a consequence of sampling error. Thus, we deemed it appropriate to aggregate our data across companies. Finally, to prevent interpretational problems inherent in simultaneous estimation of measurement and structural models, we tested a measurement model, loading each
Communication Facilities for Distributed TransactionProcessing Systems
, 1991
"... istributed transaction-processing systems must manage such functions as concurrency, recovery, and replication. One way to improve their efficiency and reliability is to increase software modularity, which means the separate components should execute in separate address spaces to permit hardware-en ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
-processor machines with no special IPC hardware support. (Some mainframes have hardware assistance where more than one address space can be accessed at the same time.) We are studying communication designs in the context of the Raid system, a robust and adaptable distributed database system for transaction
Results 1 - 10
of
271
