Abstract Previously, higher-order Hamiltonians (HoH) had been shown to offer an advantage in both metrology and quantum energy storage. Here, we axiomatize a model of computation that allows us consider such for the purposes computation. From this axiomatic model, formally prove HoH-based algorithm can gain up quadratic speed-up over classical sequential algorithms—for any possible We show how ...

This paper investigates open source applications to seek for opportunities of flow-based parallelization. Domain of streaming application are targeted such as sentence parsing, image processing and data packet investigation. Component flow of application is identified and profiling is conducted to discover bottleneck of program executions. After parallelization attempt, challenges of flow-based...

Within the NICE project, supported by the Dutch Foundation HPCN, the multi-block Navier-Stokes flow solver ENSOLV is being parallelized. In this article first results of the block-loop parallelization of ENSOLV are presented. We discuss the performance results of this parallelization on a 16-processor NEC SX-4, a shared memory parallel vector computer. The results are compared to those of the l...

Data dependences are known to hamper e cient parallelization of programs. Memory expansion is a general method to remove dependences in assigning distinct memory locations to dependent writes. Parallelization via memory expansion requires both moderation in the expansion degree and e ciency at run-time. We present a general storage mapping optimization framework for imperative programs, applica...