Sciweavers

17329 search results - page 3314 / 3466
» Improved non-approximability results
Sort
View
PLDI
2003
ACM
15 years 11 months ago
Compile-time composition of run-time data and iteration reorderings
Many important applications, such as those using sparse data structures, have memory reference patterns that are unknown at compile-time. Prior work has developed runtime reorderi...
Michelle Mills Strout, Larry Carter, Jeanne Ferran...
PPOPP
2003
ACM
15 years 11 months ago
Compiler support for speculative multithreading architecture with probabilistic points-to analysis
Speculative multithreading (SpMT) architecture can exploit thread-level parallelism that cannot be identified statically. Speedup can be obtained by speculatively executing threa...
Peng-Sheng Chen, Ming-Yu Hung, Yuan-Shin Hwang, Ro...
SENSYS
2003
ACM
15 years 11 months ago
Practical lazy scheduling in sensor networks
Experience has shown that the power consumption of sensors and other wireless computational devices is often dominated by their communication patterns. We present a practical real...
Ramana Rao Kompella, Alex C. Snoeren
SENSYS
2003
ACM
15 years 11 months ago
CODA: congestion detection and avoidance in sensor networks
Event-driven sensor networks operate under an idle or light load and then suddenly become active in response to a detected or monitored event. The transport of event impulses is l...
Chieh-Yih Wan, Shane B. Eisenman, Andrew T. Campbe...
SIGCOMM
2003
ACM
15 years 11 months ago
A comparison of hard-state and soft-state signaling protocols
One of the key infrastructure components in all telecommunication networks, ranging from the telephone network, to VC-oriented data networks, to the Internet, is its signaling sys...
Ping Ji, Zihui Ge, James F. Kurose, Donald F. Tows...
« Prev « First page 3314 / 3466 Last » Next »