Sciweavers

1316 search results - page 191 / 264
» A New Scheduling Algorithm for Servers
Sort
View
ICCAD
1994
IEEE
112views Hardware» more  ICCAD 1994»
14 years 2 months ago
Selecting partial scan flip-flops for circuit partitioning
This paper presents a new method of selecting scan ipops (FFs) in partial scan designs of sequential circuits. Scan FFs are chosen so that the whole circuit can be partitioned in...
Toshinobu Ono
COMPSAC
2004
IEEE
14 years 1 months ago
Adaptive Time-Critical Resource Management Using Time/Utility Functions: Past, Present, and Future
Time/utility function time constraints (or TUFs) and utility accrual (UA) scheduling optimality criteria, constitute, arguably, the most effective and broadest approach for adapti...
Peng Li, Binoy Ravindran, E. Douglas Jensen
SIGMOD
1995
ACM
161views Database» more  SIGMOD 1995»
14 years 1 months ago
Applying Update Streams in a Soft Real-Time Database System
Many papers have examined how to e ciently export a materialized view but to our knowledge none have studied how to e ciently import one. To import a view, i.e., to install a stre...
Brad Adelberg, Hector Garcia-Molina, Ben Kao
IEICET
2008
121views more  IEICET 2008»
13 years 10 months ago
Multi-Constrained QoS Geographic Routing for Heterogeneous Traffic in Sensor Networks
Sensor nodes report the sensed data packets to the sink and depending on the application these packets may have diverse attributes: time-critical (TC) and non time-critical (NTC). ...
Md. Abdur Razzaque, Muhammad Mahbub Alam, Md. Mamu...
EGH
2009
Springer
13 years 8 months ago
Stream compaction for deferred shading
The GPU leverages SIMD efficiency when shading because it rasterizes a triangle at a time, running the same shader on all of its fragments. Ray tracing sacrifices this shader cohe...
Jared Hoberock, Victor Lu, Yuntao Jia, John C. Har...