نتایج جستجو برای: practical and speculative

تعداد نتایج: 16844915  

1996
Cliff B. Jones

This paper offers an assessment of what has been achieved in three decades of work on the semantics of programming languages and pinpoints some practical problems in computing which might stimulate further research. The examples sketched in this paper come from the author’s own research on concurrent object oriented languages, from database practice, and from more speculative research on Intern...

2000
Greg Barish Craig A. Knoblock Steven Minton

Practical deployments of information agents can suffer from sub-optimal performance and scalability for a number of reasons. In the case of web-based information integration, for example, data sources are remote and their latency can have a substantial effect on overall execution performance. Scalability can also be poor, since concurrent queries can cause multiple, simultaneous remote data ret...

Journal: :meltdownattack.com 2018
Paul Kocher Daniel Genkin Daniel Gruss Werner Haas Michael Hamburg Moritz Lipp Stefan Mangard Thomas Prescher Michael Schwarz Yuval Yarom

Modern processors use branch prediction and speculative execution to maximize performance. For example, if the destination of a branch depends on a memory value that is in the process of being read, CPUs will try guess the destination and attempt to execute ahead. When the memory value finally arrives, the CPU either discards or commits the speculative computation. Speculative logic is unfaithf...

Journal: :SSRN Electronic Journal 2009

Journal: :Journal of Economic Perspectives 1990

2003
Niko Demus Barli Daisuke Tashiro Chitaka Iwama Shuichi Sakai Hidehiko Tanaka

Speculative multithreading on chip multiprocessors has drawn great attention as a technique for exploiting thread level parallelism from sequential applications. This paper proposes a register communication mechanism required to handle inter-thread register dependencies during speculative multithreading execution. The key issues in designing this mechanism are, ensuring the correctness of execu...

Journal: :J. Parallel Distrib. Comput. 1996
Andrew Sohn

Solving the hard Satisfiability Problem is time consuming even for modest-sized problem instances. Solving the Random L-SAT Problem is especially difficult due to the ratio of clauses to variables. This report presents a practical approach to solving the Random L-SAT Problem on a large-scale distributed-memory multiprocessor. In particular, we use a parallel synchronous simulated annealing proc...

Journal: :SSRN Electronic Journal 1994

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید