Sciweavers

244 search results - page 35 / 49
» Basic Compiler Algorithms for Parallel Programs
Sort
View
EMSOFT
2004
Springer
15 years 5 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
PLDI
1997
ACM
15 years 4 months ago
Dynamic Feedback: An Effective Technique for Adaptive Computing
This paper presents dynamic feedback, a technique that enables computations to adapt dynamically to different execution environments. A compiler that uses dynamic feedback produce...
Pedro C. Diniz, Martin C. Rinard
IEEEPACT
2000
IEEE
15 years 4 months ago
A Lightweight Algorithm for Dynamic If-Conversion during Dynamic Optimization
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
Kim M. Hazelwood, Thomas M. Conte
IPPS
2009
IEEE
15 years 6 months ago
Implementing and evaluating multithreaded triad census algorithms on the Cray XMT
Commonly represented as directed graphs, social networks depict relationships and behaviors among social entities such as people, groups, and organizations. Social network analysi...
George Chin Jr., Andrès Márquez, Sut...
HPCC
2007
Springer
15 years 6 months ago
Software Pipelining for Packet Filters
Packet filters play an essential role in traffic management and security management on the Internet. In order to create software-based packet filters that are fast enough to work...
Yoshiyuki Yamashita, Masato Tsuru