Sciweavers

360 search results - page 45 / 72
» Speculative Computation in Multilisp
Sort
View
ICFP
2007
ACM
15 years 11 months ago
Feedback directed implicit parallelism
In this paper we present an automated way of using spare CPU resources within a shared memory multi-processor or multi-core machine. Our approach is (i) to profile the execution o...
Tim Harris, Satnam Singh
SIGECOM
2004
ACM
132views ECommerce» more  SIGECOM 2004»
15 years 5 months ago
A dynamic pari-mutuel market for hedging, wagering, and information aggregation
I develop a new mechanism for risk allocation and information speculation called a dynamic pari-mutuel market (DPM). A DPM acts as hybrid between a pari-mutuel market and a contin...
David M. Pennock
ICCS
2009
Springer
15 years 6 months ago
Experience with Approximations in the Trust-Region Parallel Direct Search Algorithm
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...
S. M. Shontz, V. E. Howle, P. D. Hough
HPCS
2008
IEEE
15 years 6 months ago
Improving Communication Progress and Overlap in MPI Rendezvous Protocol over RDMA-enabled Interconnects
Overlapping computation with communication is a key technique to conceal the effect of communication latency on the performance of parallel applications. MPI is a widely used mess...
Mohammad J. Rashti, Ahmad Afsahi
IPPS
2008
IEEE
15 years 6 months ago
Reducing the run-time of MCMC programs by multithreading on SMP architectures
The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov Chain Mont...
Jonathan M. R. Byrd, Stephen A. Jarvis, A. H. Bhal...