Sciweavers

1994 search results - page 149 / 399
» Computation of Optical Flow Using Dynamic Programming
Sort
View
KBSE
2007
IEEE
15 years 4 months ago
Testing concurrent programs using value schedules
Concurrent programs are difficult to debug and verify because of the nondeterministic nature of concurrent executions. A particular concurrency-related bug may only show up under ...
Jun Chen, Steve MacDonald
PPAM
2005
Springer
15 years 3 months ago
Scheduling Moldable Tasks for Dynamic SMP Clusters in SoC Technology
Abstract. The paper presents an algorithm for scheduling parallel programs for execution in a parallel architecture based on dynamic SMP processor clusters with data transfers on t...
Lukasz Masko, Pierre-François Dutot, Gregor...
ASM
2000
ASM
15 years 2 months ago
An ASM Dynamic Semantics for Standard ML
Abstract. The Abstract State Machines (ASM) methodology is a methodology for formally specifying computing systems. We use the ASM methodology to give the dynamic semantics of the ...
Steven C. Cater, James K. Huggins
FCCM
2011
IEEE
331views VLSI» more  FCCM 2011»
14 years 1 months ago
Synthesis of Platform Architectures from OpenCL Programs
—The problem of automatically generating hardware modules from a high level representation of an application has been at the research forefront in the last few years. In this pap...
Muhsen Owaida, Nikolaos Bellas, Konstantis Dalouka...
NCA
2007
IEEE
15 years 4 months ago
Scheduling Bulk File Transfers with Start and End Times
The advancement of optical networking technologies has enabled e-science applications that often require transport of large volumes of scientific data. In support of such data-in...
Kannan Rajah, Sanjay Ranka, Ye Xia