نتایج جستجو برای: buffer space

تعداد نتایج: 535110  

1998
H. H. Chen D. D. Ling K. L. Shepard A. Chandrakasan R. W. Brodersen P. E. Landman N. R. Shanbhag B. Davari R. H. Dennard G. G. Shahidi D. Marculescu R. Marculescu F. N. Najm C.-Y. Tsui M. Pedram

Presented in this paper are: 1.) lower bounds on energy consumption of noisy digital gates and 2.) the concept of noise tolerance via coding for achieving energy efficiency in the presence of noise. A discrete channel model for noisy digital logic in deep submicron technology that captures the manifestation of circuit noise is presented. The lower bounds are derived via an information-theoretic...

2007
Norival R. Figueira Joseph Pasquale

We define a class of rate-based service disciplines called Lower-Bounded Rate (LBR) that provides upper bounds on end-to-end delay, end-to-end delay probability distribution, per-server buffer space requirements, and the probability distribution of per-server buffer space. This class includes VirtualClock, PGPS, and Leave-in-Time. We prove these upper bounds, and we also prove that for an impor...

2002
Sailesh Kumar Raja Venkatesh Joji Philip Sunil Shukla

Modern switches and routers often use dynamic RAM (DRAM) in order to provide large buffer storage space. However, the effective bandwidth of DRAM is frequently a limiting factor in the design of high-speed switches and routers. The focus of this paper is to introduce a packet-buffering architecture called the parallel packet buffering (PPB), which increases the effective memory bandwidth signif...

2000
Yvon JÉGOU

The use of the task migration paradigm has been shown to allow efficient execution of unstructured codes on distributed-memory, parallel architectures. With this model, the data distributed on the parallel processors are never moved. When access to a non-local variable is necessary, the current computation is suspended and then resumed on the processor in charge of this variable. Our implementa...

Journal: :CoRR 2004
Olivier Gay

Annexe A – Exercices sur les buffer overflows 90 Annexe B – Les codes utilisés dans le rapport-4/92

2011
A. Heinemeyer

Introduction Conclusions References

Journal: :CoRR 2016
Rodrigo C. de Lamare Tong Peng

his work proposes adaptive buffer-aided distributed space-time coding schemes and algorithms with feedback for wireless networks equipped with buffer-aided relays. The proposed schemes employ a maximum likelihood receiver at the destination and adjustable codes subject to a power constraint with an amplify-and-forward cooperative strategy at the relays. Each relay is equipped with a buffer and ...

Journal: :J. Inf. Sci. Eng. 2013
Jianwei Liao

TLB miss-based incremental, concurrent checkpoint mechanism for real-time and interactive applications called TIC-CKPT has been proposed, implemented and evaluated in this paper. TIC-CKPT allows setting the checkpoints overlaps with the execution of the chekcpointed processes. By resorting to tracking TLB misses to stop the first accesses to the target memory pages while saving memory address s...

2007
Inanc Inan Feyza Keceli Ender Ayanoglu

The IEEE 802.11e standard revises the Medium Access Control (MAC) layer of the former IEEE 802.11 standard for Quality-of-Service (QoS) provision in the Wireless Local Area Networks (WLANs). The Enhanced Distributed Channel Access (EDCA) function of 802.11e defines multiple Access Categories (AC) with AC-specific Contention Window (CW) sizes, Arbitration Interframe Space (AIFS) values, and Tran...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید