Sciweavers

352 search results - page 39 / 71
» Good Programming in Transactional Memory
Sort
View
EUROMICRO
2000
IEEE
14 years 23 hour ago
Task Assignment and Scheduling under Memory Constraints
Many DSP and image processing embedded systems have hard memory constraints which makes it difficult to find a good task assignment and scheduling which fulfill these constrain...
Radoslaw Szymanek, Krzysztof Kuchcinski
HPCA
2001
IEEE
14 years 8 months ago
An Architectural Evaluation of Java TPC-W
The use of the Java programming language for implementing server-side application logic is increasing in popularity, yet there is very little known about the architectural require...
Harold W. Cain, Ravi Rajwar, Morris Marden, Mikko ...
SEFM
2008
IEEE
14 years 2 months ago
A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
Tuan-Hung Pham, Anh-Hoang Truong, Ninh-Thuan Truon...
ER
2001
Springer
111views Database» more  ER 2001»
14 years 3 days ago
Modeling Products for Versatile E-commerce Platforms - Essential Requirements and Generic Design Alternatives
Electronic commerce (e-commerce) covers a wide range of business transactions. Usually, a transactions includes products, i.e. goods or services. Often, e-commerce websites are int...
Ulrich Frank
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
13 years 11 months ago
Scalable Parallel Data Mining for Association Rules
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
Eui-Hong Han, George Karypis, Vipin Kumar