Sciweavers

5 search results - page 1 / 1
» Storage requirement estimation for data intensive applicatio...
Sort
View
CODES
2000
IEEE
13 years 9 months ago
Storage requirement estimation for data intensive applications with partially fixed execution ordering
In this paper, we propose a novel storage requirement estimation methodology for use in the early system design phases when the data transfer ordering is only partly fixed. At tha...
Per Gunnar Kjeldsberg, Francky Catthoor, Einar J. ...
DAC
2001
ACM
14 years 5 months ago
Detection of Partially Simultaneously Alive Signals in Storage Requirement Estimation for Data Intensive Applications
In this paper, we propose a novel storage requirement estimation methodology for use in the early system design phases when the data transfer ordering is only partially fixed. At ...
Per Gunnar Kjeldsberg, Francky Catthoor, Einar J. ...
ICCAD
2000
IEEE
100views Hardware» more  ICCAD 2000»
13 years 9 months ago
Automated Data Dependency Size Estimation with a Partially Fixed Execution Ordering
For data dominated applications, the system level design trajectory should first focus on finding a good data transfer and storage solution. Since no realization details are avail...
Per Gunnar Kjeldsberg, Francky Catthoor, Einar J. ...
POS
1994
Springer
13 years 8 months ago
Changing Persistent Applications
During the lifetime of an application, the objects and bindings in a persistent store may require modification in order to fix bugs or incorporate changes. Two mechanisms, Octopus...
Alex Farkas, Alan Dearle
VLSISP
2011
358views Database» more  VLSISP 2011»
12 years 11 months ago
Accelerating Machine-Learning Algorithms on FPGAs using Pattern-Based Decomposition
Machine-learning algorithms are employed in a wide variety of applications to extract useful information from data sets, and many are known to suffer from superlinear increases in ...
Karthik Nagarajan, Brian Holland, Alan D. George, ...