Results 1 - 10 of 853

Speculative Lock Elision: Enabling Highly Concurrent Multithreaded Execution

by Ravi Rajwar, James R. Goodman , 2001
"... Serialization of threads due to critical sections is a fundamental bottleneck to achieving high performance in multithreaded programs. Dynamically, such serialization may be unnecessary because these critical sections could have safely executed concurrently without locks. Current processors cannot f ..."
Abstract - Cited by 227 (10 self) - Add to MetaCart
fully exploit such parallelism because they do not have mechanisms to dynamically detect such false inter-thread dependences. We propose Speculative Lock Elision (SLE), a novel micro-architectural technique to remove dynamically unnecessary lock-induced serialization and enable highly concurrent

The LRPD Test: Speculative Run-Time Parallelization of Loops with Privatization and Reduction Parallelization

by Lawrence Rauchwerger, David Padua , 1995
"... Current parallelizing compilers cannot identify a significant fraction of parallelizable loops because they have complex or statically insufficiently defined access patterns. As parallelizable loops arise frequently in practice, we advocate a novel framework for their identification: speculatively e ..."
Abstract - Cited by 261 (44 self) - Add to MetaCart
be exploited by loops transformed through privatization and reduction parallelization, our methods can speculatively apply these transformations and then check their validity at run--time. Another important contribution of this paper is a novel method for reduction recognition which goes beyond syntactic

SPECTRE: Speculation to hide communication latency

by Christopher J. Rossbach, Michael Isard
"... We describe work in progress on the Spectre system which aims to provide high performance computing over distributed shared memory, targeting workloads such as graph algorithms for which functional or dataflow de-compositions are inefficient. We exploit aggressive spec-ulation to hide the latency of ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
We describe work in progress on the Spectre system which aims to provide high performance computing over distributed shared memory, targeting workloads such as graph algorithms for which functional or dataflow de-compositions are inefficient. We exploit aggressive spec-ulation to hide the latency

Speculative Execution based on Value Prediction

by Freddy Gabbay, Freddy Gabbay - EE Department TR 1080, Technion - Israel Institue of Technology , 1996
"... This work presents a new approach for improving the parallelism that advanced computer architectures exploit at run-time from a sequential program (e.g. superscalar processors). The new approach termed value prediction suggests to predict outcome values of operations before they are executed and sup ..."
Abstract - Cited by 158 (4 self) - Add to MetaCart
This work presents a new approach for improving the parallelism that advanced computer architectures exploit at run-time from a sequential program (e.g. superscalar processors). The new approach termed value prediction suggests to predict outcome values of operations before they are executed

Clustered Speculative Multithreaded Processors

by Pedro Marcuello, Antonio González , 1999
"... In this paper we present a processor microarchitecture that can simultaneously execute multiple threads and has a clustered design for scalability purposes. A main feature of the proposed microarchitecture is its capability to spawn speculative threads from a single-thread application at run-time. T ..."
Abstract - Cited by 180 (10 self) - Add to MetaCart
In this paper we present a processor microarchitecture that can simultaneously execute multiple threads and has a clustered design for scalability purposes. A main feature of the proposed microarchitecture is its capability to spawn speculative threads from a single-thread application at run

Transparent Run-Time Defense Against Stack Smashing Attacks

by Arash Baratloo, Navjot Singh, Timothy Tsai - In Proceedings of the USENIX Annual Technical Conference , 2000
"... The exploitation of buffer overflow vulnerabilities in process stacks constitutes a significant portion of security attacks. We present two new methods to detect and handle such attacks. In contrast to previous work, the new methods work with any existing pre-compiled executable and can be used tran ..."
Abstract - Cited by 204 (3 self) - Add to MetaCart
The exploitation of buffer overflow vulnerabilities in process stacks constitutes a significant portion of security attacks. We present two new methods to detect and handle such attacks. In contrast to previous work, the new methods work with any existing pre-compiled executable and can be used

Confidence Estimation for Speculation Control

by Dirk Grunwald, Artur Klauser, Srilatha Manne, Andrew Pleszkun - In 25th Annual International Symposium on Computer Architecture , 1998
"... Modern processors improve instruction level parallelism by speculation. The outcome of data and control decisions is predicted, and the operations are speculatively executed and only committed if the original predictions were correct. There are a number of other ways that processor resources could b ..."
Abstract - Cited by 128 (3 self) - Add to MetaCart
be used, such as threading or eager execution. As the use of speculation increases, we believe more processors will need some form of speculation control to balance the benefits of speculation against other possible activities. Confidence estimation is one technique that can be exploited by architects

Value Locality And Speculative Execution

by Mikko Herman Lipasti , 1997
"... This thesis introduces a program attribute called value locality and proposes speculative execution under the weak dependence model. The weak dependence model lays a theoretical foundation for exploiting value locality and other program attributes by speculatively relaxing and deferring the detectio ..."
Abstract - Cited by 57 (1 self) - Add to MetaCart
This thesis introduces a program attribute called value locality and proposes speculative execution under the weak dependence model. The weak dependence model lays a theoretical foundation for exploiting value locality and other program attributes by speculatively relaxing and deferring

Automatic I/O Hint Generation through Speculative Execution

by Fay Chang, Garth A. Gibson - PROCEEDINGS OF THE 3RD SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION , 1999
"... Aggressive prefetching is an effective technique for reducing the execution times of disk-bound applications; that is, applications that manipulate data too large or too infrequently used to be found in file or disk caches. While automatic prefetching approaches based on static analysis or historica ..."
Abstract - Cited by 124 (6 self) - Add to MetaCart
is stalled on I/O by using these cycles to dynamically analyze the application and predict its future I/O accesses. Our approach is to speculatively pre-execute the application’s code in order to discover and issue hints for its future read accesses. Coupled with an

SecVisor: A Tiny Hypervisor to Provide Lifetime Kernel Code Integrity for Commodity OSes

by Arvind Seshadri, Mark Luk, Ning Qu, Adrian Perrig - SOSP'07 , 2007
"... We propose SecVisor, a tiny hypervisor that ensures code integrity for commodity OS kernels. In particular, SecVisor ensures that only user-approved code can execute in kernel mode over the entire system lifetime. This protects the kernel against code injection attacks, such as kernel rootkits. SecV ..."
Abstract - Cited by 217 (10 self) - Add to MetaCart
We propose SecVisor, a tiny hypervisor that ensures code integrity for commodity OS kernels. In particular, SecVisor ensures that only user-approved code can execute in kernel mode over the entire system lifetime. This protects the kernel against code injection attacks, such as kernel rootkits. Sec
Results 1 - 10 of 853