Sciweavers

475 search results - page 35 / 95
» Feasible distributed CSP models for scheduling problems
Sort
View
ECRTS
2004
IEEE
15 years 8 months ago
An Event Stream Driven Approximation for the Analysis of Real-Time Systems
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
Karsten Albers, Frank Slomka
PVG
2003
IEEE
212views Visualization» more  PVG 2003»
15 years 9 months ago
SLIC: Scheduled Linear Image Compositing for Parallel Volume Rendering
Parallel volume rendering offers a feasible solution to the large data visualization problem by distributing both the data and rendering calculations among multiple computers con...
Aleksander Stompel, Kwan-Liu Ma, Eric B. Lum, Jame...
ICTAC
2004
Springer
15 years 10 months ago
Replicative - Distribution Rules in P Systems with Active Membranes
Abstract. P systems (known also as membrane systems) are biologically motivated theoretical models of distributed and parallel computing. The two most interesting questions in the ...
Tseren-Onolt Ishdorj, Mihai Ionescu
LCPC
2004
Springer
15 years 10 months ago
Power-Aware Scheduling for Parallel Security Processors with Analytical Models
Techniques to reduce power dissipation for embedded systems have recently come into sharp focus in the technology development. Among these techniques, dynamic voltage scaling (DVS)...
Yung-Chia Lin, Yi-Ping You, Chung-Wen Huang, Jenq ...
INFOCOM
2010
IEEE
15 years 3 months ago
VBS: Maximum Lifetime Sleep Scheduling for Wireless Sensor Networks Using Virtual Backbones
—Wireless sensor network (WSN) applications require redundant sensors to guarantee fault tolerance. However, the same degree of redundancy is not necessary for multi-hop communic...
Yaxiong Zhao, Jie Wu, Feng Li, Sanglu Lu