Results 1  10
of
106,091
Average Execution Times of Series–Parallel Networks
"... The papers investigates a model for series–parallel processing structures developed by E. Gelenbe. We show that, under the so–called combinatorial distribution assumption, the average total execution time of a series–parallel processing structure cannot grow essentially slower than n 1/2, where n is ..."
Abstract
 Add to MetaCart
The papers investigates a model for series–parallel processing structures developed by E. Gelenbe. We show that, under the so–called combinatorial distribution assumption, the average total execution time of a series–parallel processing structure cannot grow essentially slower than n 1/2, where n
Average Execution Time Analysis of a Selfstabilizing Leader Election Algorithm
"... This paper deals with the selfstabilizing leader election algorithm of Xu and Srimani [10] that finds a leader in a tree graph. The worst case execution time for this algorithm is O(N 4),whereN is the number of nodes in the tree. We show that the average execution time for this algorithm, assuming ..."
Abstract
 Add to MetaCart
This paper deals with the selfstabilizing leader election algorithm of Xu and Srimani [10] that finds a leader in a tree graph. The worst case execution time for this algorithm is O(N 4),whereN is the number of nodes in the tree. We show that the average execution time for this algorithm, assuming
Minimization of Average Execution Time Based on Speculative FPGA Configuration Prefetch
"... Abstract—One of the main drawbacks that significantly impacts the performance of dynamically reconfigurable systems (like FPGAs), is their high reconfiguration overhead. Configuration prefetching is one method to reduce this penalty by overlapping FPGA reconfigurations with useful computations. In t ..."
Abstract
 Add to MetaCart
improvement. The algorithm takes into consideration profiling information (such as branch probabilities and execution time distributions), correlated with the application characteristics. Compared to the previous stateofart, we reduce the reconfiguration penalty with 34 % on average, and with up to 59
FaultTolerant Average Execution Time Optimization for GeneralPurpose MultiProcessor SystemOnChips, Design
 In the Proceedings of Automation & Test in Europe Conference & Exhibition, 2024 April 2009, pp 484489. 57 Journal of Distributed and Parallel Systems (IJDPS) Vol.2, No.1
, 2011
"... Abstract 1 Faulttolerance is due to the semiconductor technology development important, not only for safetycritical systems but also for generalpurpose (nonsafety critical) systems. However, instead of guaranteeing that deadlines always are met, it is for generalpurpose systems important to min ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
to minimize the average execution time (AET) while ensuring faulttolerance. For a given job and a soft (transient) error probability, we define mathematical formulas for AET that includes bus communication overhead for both voting (active replication) and rollbackrecovery with checkpointing (RRC). And
TimingSync Protocol for Sensor Networks
 The First ACM Conference on Embedded Networked Sensor System (SenSys
, 2003
"... Wireless adhoc sensor networks have emerged as an interesting and important research area in the last few years. The applications envisioned for such networks require collaborative execution of a distributed task amongst a large set of sensor nodes. This is realized by exchanging messages that are ..."
Abstract

Cited by 515 (8 self)
 Add to MetaCart
Wireless adhoc sensor networks have emerged as an interesting and important research area in the last few years. The applications envisioned for such networks require collaborative execution of a distributed task amongst a large set of sensor nodes. This is realized by exchanging messages
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 578 (50 self)
 Add to MetaCart
, many standard program properties, such as response for all nonzeno execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does
Illiquidity and stock returns: crosssection and timeseries effects,
 Journal of Financial Markets
, 2002
"... Abstract This paper shows that over time, expected market illiquidity positively affects ex ante stock excess return, suggesting that expected stock excess return partly represents an illiquidity premium. This complements the crosssectional positive returnilliquidity relationship. Also, stock ret ..."
Abstract

Cited by 864 (9 self)
 Add to MetaCart
returns are negatively related over time to contemporaneous unexpected illiquidity. The illiquidity measure here is the average across stocks of the daily ratio of absolute stock return to dollar volume, which is easily obtained from daily stock data for long time series in most stock markets. Illiquidity
Consensus Problems in Networks of Agents with Switching Topology and TimeDelays
, 2003
"... In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no timedelays, ii) networks with fixed topology and communication timedelays, and iii) maxconsensus problems (or leader ..."
Abstract

Cited by 1112 (21 self)
 Add to MetaCart
In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no timedelays, ii) networks with fixed topology and communication timedelays, and iii) maxconsensus problems (or
Distributed spacetimecoded protocols for exploiting cooperative diversity in wireless networks
 IEEE TRANS. INF. THEORY
, 2003
"... We develop and analyze space–time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network. The protocols exploit spatial diversity available among a collection of distributed terminals that relay messages for one another in such a m ..."
Abstract

Cited by 622 (5 self)
 Add to MetaCart
We develop and analyze space–time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network. The protocols exploit spatial diversity available among a collection of distributed terminals that relay messages for one another in such a
Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations
, 2005
"... How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include hea ..."
Abstract

Cited by 541 (48 self)
 Add to MetaCart
, and we observe some surprising phenomena. First, most of these graphs densify over time, with the number of edges growing superlinearly in the number of nodes. Second, the average distance between nodes often shrinks over time, in contrast to the conventional wisdom that such distance parameters should
Results 1  10
of
106,091