Speculative, parallel abstractions allow that, once a result is computed, the remaining (unnecessary) speculative computations can be safely stopped. However, it is difficult to know when it is safe to stop an ongoing computation. This paper presents a refinement of the parallel speculative ParT abstraction [3] with an affine type system that allows in-place updates, and killing speculative com...

Recently researchers have shown interest in integrating Reconfigurable logic into conventional processors as a Reconfigurable Function Unit (RFU). A context-full RFU supports holding intermediate results inside itself, which eliminates some data movement overheads and has some other benefits. Most contemporary processors support out-of-order execution and speculation. When a context-full RFU is...

In 2008, the Ontario Long Term Care Association was awarded funding from HealthForceOntario to assist with its nursing recruitment strategy based on research it had initiated in 2007. The research goal was to understand the career motivations and perceptions of students enrolled in registered nursing (RN) and registered practical nursing (RPN) programs in Ontario to develop and test a message t...

This paper presents an algorithm which extends the relatively new notion of speculative concurrency control by delaying the commitment of transactions, thus allowing other con icting transactions to continue execution and commit rather than restart. This algorithm propagates uncommitted data to other outstanding transactions thus allowing more speculative schedules to be considered. The algorit...

In this paper we show that if the government can levy taxes to back the currency, speculative hyperinflations are ruled out as equilibrium outcomes. This is so even though convertibility is never observed in equilibrium. The only observational difference between a pure fiat money economy and a convertible economy as the one described in this paper is the potential of the former to exhibit specu...

Deterministic worst-case execution for satisfying hard-real-time constraints, and speculative execution with rollback for improving average-case throughput, appear to lie on opposite ends of a spectrum of performance requirements and strategies. Nonetheless, we show that there are situations in which speculative execution can improve the performance of a hard real-time system, either by enhanci...

DRAFT February 12, 5 pm (Choose " print layout view " in Word) The influence of speculative stocks on value stocks is examined through a set of economics experiments. The speculative asset is designed to model a company involved in a rapidly growing market that will be saturated at some unknown point. Using a control experiment where both assets are similar value stocks, we find statistical sup...

The speculative execution of critical sections, whether done using HTM via the transactional lock elision pattern or using a software solution such as STM or a sequence lock, has the potential to improve software performance with minimal programmer effort. The technique improves performance by allowing critical sections to proceed in parallel as long as they do not conflict at run time. In this...

Speculative, parallel abstractions allow that, once a result is computed, the remaining (unnecessary) speculative computations can be safely stopped. However, it is difficult to know when it is safe to stop an ongoing computation. This paper presents a refinement of the parallel speculative ParT abstraction [3] with an affine type system that allows in-place updates, and killing speculative com...