Sciweavers

779 search results - page 87 / 156
» A Simple Program Transformation for Parallelism
Sort
View
ICPP
1998
IEEE
14 years 2 days ago
A memory-layout oriented run-time technique for locality optimization
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
Yong Yan, Xiaodong Zhang, Zhao Zhang
ISSS
2002
IEEE
139views Hardware» more  ISSS 2002»
14 years 22 days ago
Multiprocessor Mapping of Process Networks: A JPEG Decoding Case Study
We present a system-level design and programming method for embedded multiprocessor systems. The aim of the method is to improve the design time and design quality by providing a ...
Erwin A. de Kock
SIGMOD
2010
ACM
255views Database» more  SIGMOD 2010»
14 years 19 days ago
Large graph processing in the cloud
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
Rishan Chen, Xuetian Weng, Bingsheng He, Mao Yang
CLUSTER
2003
IEEE
14 years 1 months ago
Compiler Optimized Remote Method Invocation
We further increase the efficiency of Java RMI programs. Where other optimizing re-implementations of RMI use pre-processors to create stubs and skeletons and to create class spe...
Ronald Veldema, Michael Philippsen
PPAM
2005
Springer
14 years 1 months ago
SILC: A Flexible and Environment-Independent Interface for Matrix Computation Libraries
We propose a new framework, named Simple Interface for Library Collections (SILC), that gives users access to matrix computation libraries in a flexible and environment-independen...
Tamito Kajiyama, Akira Nukada, Hidehiko Hasegawa, ...