The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Test failure data produced during post-silicon validation contain accurate design- and process-specific information about the DUD (design-under-debug). Prior research efforts and industry practice focused on feeding this information back to the design flow via bug root-cause analysis. However, the value of this silicon data for helping further improvement of the post-silicon validation process has...
Speed-limiting paths are critical paths that limit the performance of one or more silicon chips. This paper present a data mining methodology for analyzing speed-limiting paths extracted from AC delay test measurements. Based on data collected on 15 packaged silicon units of a four-core microprocessor design, we show that the proposed methodology can efficiently discovered actionable, design-related...
Due to the magnitude and complexity of design and manufacturing processes, it is unrealistic to expect that models and simulations can predict all aspects of silicon behavior accurately. When unexpected behavior is observed in the post-silicon stage, one desires to identify the causes and consequently identify the fixes. This paper studies one formulation of the design-silicon mismatch problem. To...
Considering the characteristics of the propagation of worm, we can analyze it by epidemic model. In this paper, considering that to re-assembly system and the use of anti-virus software will take a period of time, so we introduce a time-delay to describe this period of time. On this basis, we build a SIDRQ model for Internet worm virus propagation depended on the two-factor model. By using the theory...
Due to the rapid spreading nature of Internet worms, it is necessary to implement automatic mitigation on the Internet. Inspired by worm vaccinations, we propose a novel epidemic model which combines both vaccinations and dynamic quarantine methods, referred to as SEIQV model. Using SEIQV model, we obtain the basic reproduction number that governs whether or not a worm is extinct. The impact of different...
HCF controlled channel access (HCCA), defined in the IEEE 802.11e document, provides a sample scheduler to allocate transmission opportunity (TXOP) to QoS-aware stations (QSTAs). Since the calculation of TXOP duration is based on mean data rate, it is efficient for constant bit rate (CBR) traffic. For variable bit rate (VBR) traffic, however, delay bound of some admitted traffic flows may be violated...
In this paper we propose a hardware reduction methodology through detailed algorithmic analysis and exploiting datapath symmetry for 2D Kurtotic Fast ICA. The relationship of the hardware saving with respect to input data frame-length and maximum iteration for convergence is also explored. An example architecture following the developed hardware reduction methodology consumes 3:55 mm2 silicon area...
We propose RPROB, an infinite family of anonymous communication systems, each of which corresponds to a binomial mix. Any instance of RPROB provides resistance against global active adversary with capabilities to monitor every external activity, to delay and to create messages in the system. Our proposal is to solve the limitation of APROB channel that concerns only global delaying adversary. Experimental...
This paper presents performance analysis of different Fast Adders. The comparison is done on the basis of three performance parameters i.e. Area, Speed and Power consumption. Further, we present a design methodology of hybrid carry lookahead/carry skip adders (CLSKAs). This modified carry skip adder is modeled by using both fix and variable block size. In conventional carry skip adder, each block...
We propose a new class of message routing schemes for mobile wireless networks with intermittent network connectivity. The proposed schemes are based on swarm intelligence (SI) and exploit the statistical properties of time-varying network connectivity for opportunistic message forwarding. We also consider a special form of our proposed schemes which can be viewed as a marriage between the SI and...
Variable bit rate (VBR) traffic may have a wide range of packet sizes and generation intervals. While the former can be handled in the IEEE 802.11e uplink scheduling, e.g., by adapting transmission opportunity (TXOP) durations according to backlogged traffic reports, the latter may cause packet losses if service intervals of the scheduling do not fit the generation intervals. In this paper, a scheduler...
This paper studies the stability of linear neutral delay differential systems with two delays. Based on the generalized Sturm criterion and the Sylvester resultant technique, algebraic criterion for delay-independent stability of neutral differential systems will be obtained. As an application, an example is given at last.
We consider the global and preemptive scheduling problem of multi-mode real-time systems upon identical multiprocessor platforms. Since it is a multi-mode system, the system can change from one mode to another such that the current task set is replaced with a new task set. Ensuring that deadlines are met requires not only that a schedulability test is performed on tasks in each mode but also that...
A new way of constructing N-way arbiters is proposed. The main idea is to perform arbitrations between all pairs of requests, and then make decision on what grant to issue based on their outcomes. Crucially, all the mutual exclusion elements in such an arbiter work in parallel.This `flat' arbitration is prone to new threats such as formation of cycles (leading to deadlocks), but at the same time opens...
This paper studies a topical capacitated network design problem that arises in the telecommunication industry. In this problem, given point-to-point demand between various pairs of nodes, a minimum cost survivable network must be designed by installing capacitated equipments (routers, line cards, ...) on nodes as well as link facilities on arcs. This realistic problem finds its motivation in the rapidly...
The IEEE 802.11e standard defines a reference scheduler that allocates transmission opportunities (TXOP) to traffic streams based on mean data rate and minimum physical rate. However, the reference scheduler is only efficient for streams with strict constant bit rate (CBR) characteristics. This paper presents a scheduling scheme named as the selectivity function scheduler (SFS) for the IEEE 802.11e...
Decoding of cyclic burst error correcting codes, such as Meggitt, error-trapping decoding, have generally been implemented using linear feedback shift registers(LFSR). However, such sequential decoding schemes are not suitable for modern high-speed channels that demand high-speed parallel decoding. Data storage and propagation delay are the main limitation. This paper proposes a parallel error-trapping...
This paper studies the problem of quadratic stabilization for a class of multi-time delay uncertain discrete systems. Suppose that the time-varying uncertain parameters are norm-bounded, but it is not required to satisfy a strict matched conditions, state and input for the system are both with multi-time delay. New sufficient conditions of quadratic stabilization is given for the system by generalized...
Optical Burst Switching (OBS) has been proposed to increase the resource utilization achieved by Optical Circuit Switching (OCS), which is impaired by its coarse granularity. A crucial step toward OBS maturity deals with the feature of lossless guaranteed transfers. No contention resolution mechanism, even combined with efficient pro-active mechanisms has been able to provide such a guarantee so far...
In this paper, we consider the problem of reducing network delay in stochastic network utility optimization problems. We start by studying the recently proposed quadratic Lyapunov function based algorithms (QLA). We show that for every stochastic problem, there is a corresponding deterministic problem, whose dual optimal solution ldquoexponentially attractsrdquo the network backlog process under QLA...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.