Sciweavers

1686 search results - page 211 / 338
» Programs as polygraphs: computability and complexity
Sort
View
IPPS
2008
IEEE
15 years 10 months ago
Intermediate checkpointing with conflicting access prediction in transactional memory systems
Transactional memory systems promise to reduce the burden of exposing thread-level parallelism in programs by relieving programmers from analyzing complex inter-thread dependences...
M. M. Waliullah, Per Stenström
EUROPAR
2007
Springer
15 years 10 months ago
Esodyp+: Prefetching in the Jackal Software DSM
Abstract. Prefetching transfers a data item in advance from its storage location to its usage location so that communication is hidden and does not delay computation. We present a ...
Michael Klemm, Jean Christophe Beyler, Ronny T. La...
ICDCS
2005
IEEE
15 years 9 months ago
Rapid Development and Flexible Deployment of Adaptive Wireless Sensor Network Applications
Wireless sensor networks (WSNs) are difficult to program and usually run statically-installed software limiting its flexibility. To address this, we developed Agilla, a new midd...
Chien-Liang Fok, Gruia-Catalin Roman, Chenyang Lu
ICDCS
2005
IEEE
15 years 9 months ago
On Exploring Channel Allocation in the Diverse Data Broadcasting Environment
In recent years, data broadcasting becomes a promising technique to design a mobile information system with power conservation, high scalability and high bandwidth utilization. Ho...
Hao-Ping Hung, Ming-Syan Chen
RTSS
2005
IEEE
15 years 9 months ago
Voltage Scaling Scheduling for Periodic Real-Time Tasks in Reward Maximization
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...
Jian-Jia Chen, Tei-Wei Kuo