منابع مشابه
Towards energy-fairness for broadcast scheduling with minimum delay in low-duty-cycle sensor networks
Broadcast scheduling for low-duty-cycle wireless sensor networks (WSNs) has been extensively studied recently. However, existing solutions mainly focused on optimizing delay and (or) total energy consumption without considering load distribution among nodes. Due to limited energy supply for sensor nodes, heavily loaded sensors often run out of energy quickly, reducing the lifetime of the whole ...
متن کاملStream Scheduling
Media applications can be cast as a set of computation kernels operating on sequential data streams. This representation exposes the structure of an application to the hardware as well as to the compiler tools. Stream scheduling is a compiler technology that applies knowledge of the high-level structure of a program in order to target stream hardware as well as to perform high-level optimizatio...
متن کاملBatch Sampling: Low Overhead Scheduling for Sub-Second Parallel Jobs
Large-scale data analytics frameworks are shifting towards shorter task durations and larger degrees of parallelism to provide low latency. However, scheduling highly parallel jobs that complete in hundreds of milliseconds poses a major scaling challenge for cluster schedulers, which will need to place millions of tasks per second on appropriate nodes while offering millisecondlevel latency and...
متن کاملTowards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts
Symmetric ciphers purposed for Fully Homomorphic Encryption (FHE) have recently been proposed for two main reasons. First, minimizing the implementation (time and memory) overheads that are inherent to current FHE schemes. Second, improving the homomorphic capacity, i.e. the amount of operations that one can perform on homomorphic ciphertexts before bootstrapping, which amounts to limit their l...
متن کاملQoS Guaranteed Input Queued Scheduling Algorithms with Low Delay
| The enhanced Birkho -von Neumann decomposition (EBVND) algorithm, a new class of scheduling algorithms for input queued (IQ) switches, is introduced. Theoretical analysis shows that the performance of EBVND is better than the Birkho von Neumann decomposition algorithm in terms of throughput and cell delay, and can also provide rate and cell delay guarantees. Wave front Birkho -von Neumann dec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computers Communications & Control
سال: 2010
ISSN: 1841-9836,1841-9836
DOI: 10.15837/ijccc.2010.5.2232