On the Complexity of Universal Leader Election

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have not been proven for randomized algorithms. The "obvious" lower bounds of O(m) messages (m is the number of edges in the network) and O(D) time (D is the network diameter) are non-trivial to show for randomized (Monte Carlo) algorithms. (Recent results that show that even O(n) (n is the number of nodes in the network) is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms (except for the limited case of comparison algorithms, where it was also required that some nodes may not wake up spontaneously, and that D and n were not known).

We establish these fundamental lower bounds in this paper for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (such algorithms should work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make anyuse of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time algorithm is known. A slight adaptation of our lower bound technique gives rise to an O(m) message lower bound for randomized broadcast algorithms.

An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. (The answer is known to be negative in the deterministic setting). We answer this problem partially by presenting a randomized algorithm that matches both complexities in some cases. This already separates (for some cases) randomized algorithms from deterministic ones. As first steps towards the general case, we present several universal leader election algorithms with bounds that trade-off messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.

On the Complexity of Universal Leader Election

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This article focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have not been proven for randomized algorithms. In particular, the seemingly obvious lower bounds of Ω(m) messages, where m is the number of edges in the network, and Ω(D) time, where D is the network diameter, are nontrivial to show for randomized (Monte Carlo) algorithms. (Recent results, showing that even Ω(n), where n is the number of nodes in the network, is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms, except for the restricted case of comparison algorithms, where it was also required that nodes may not wake up spontaneously and that D and n were not known. We establish these fundamental lower bounds in this article for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (namely, algorithms that work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make any use of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time leader election algorithm is known. A slight adaptation of our lower bound technique gives rise to an Ω(m) message lower bound for randomized broadcast algorithms. 

An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. The answer is known to be negative in the deterministic setting. We answer this problem partially by presenting a randomized algorithm that matches both complexities in some cases. This already separates (for some cases) randomized algorithms from deterministic ones. As first steps towards the general case, we present several universal leader election algorithms with bounds that tradeoff messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.

An analysis of the impact of bus contention on the WCET in multicores

The use of multicores is becoming widespread inthe field of embedded systems, many of which have real-time requirements. Hence, ensuring that real-time applications meet their timing constraints is a pre-requisite before deploying them on these systems. This necessitates the consideration of the impact of the contention due to shared lowlevel hardware resources like the front-side bus (FSB) on the Worst-CaseExecution Time (WCET) of the tasks. Towards this aim, this paper proposes a method to determine an upper bound on the number of bus requests that tasks executing on a core can generate in a given time interval. We show that our method yields tighter upper bounds in comparison with the state of-the-art. We then apply our method to compute the extra contention delay incurred by tasks, when they are co-scheduled on different cores and access the shared main memory, using a shared bus, access to which is granted using a round-robin arbitration (RR) protocol.

Response time analysis of COTS-Based multicores considering the contention on the shared memory bus

The current industry trend is towards using Commercially available Off-The-Shelf (COTS) based multicores for developing real time embedded systems, as opposed to the usage of custom-made hardware. In typical implementation of such COTS-based multicores, multiple cores access the main memory via a shared bus. This often leads to contention on this shared channel, which results in an increase of the response time of the tasks. Analyzing this increased response time, considering the contention on the shared bus, is challenging on COTS-based systems mainly because bus arbitration protocols are often undocumented and the exact instants at which the shared bus is accessed by tasks are not explicitly controlled by the operating system scheduler; they are instead a result of cache misses. This paper makes three contributions towards analyzing tasks scheduled on COTS-based multicores. Firstly, we describe a method to model the memory access patterns of a task. Secondly, we apply this model to analyze the worst case response time for a set of tasks. Although the required parameters to obtain the request profile can be obtained by static analysis, we provide an alternative method to experimentally obtain them by using performance monitoring counters (PMCs). We also compare our work against an existing approach and show that our approach outperforms it by providing tighter upper-bound on the number of bus requests generated by a task.

On the radius of centrality in evolving communication networks

In this article, we investigate how the choice of the attenuation factor in an extended version of Katz centrality influences the centrality of the nodes in evolving communication networks. For given snapshots of a network, observed over a period of time, recently developed communicability indices aim to identify the best broadcasters and listeners (receivers) in the network. Here we explore the attenuation factor constraint, in relation to the spectral radius (the largest eigenvalue) of the network at any point in time and its computation in the case of large networks. We compare three different communicability measures: standard, exponential, and relaxed (where the spectral radius bound on the attenuation factor is relaxed and the adjacency matrix is normalised, in order to maintain the convergence of the measure). Furthermore, using a vitality-based measure of both standard and relaxed communicability indices, we look at the ways of establishing the most important individuals for broadcasting and receiving of messages related to community bridging roles. We compare those measures with the scores produced by an iterative version of the PageRank algorithm and illustrate our findings with two examples of real-life evolving networks: the MIT reality mining data set, consisting of daily communications between 106 individuals over the period of one year, a UK Twitter mentions network, constructed from the direct \emph{tweets} between 12.4k individuals during one week, and a subset the Enron email data set.

On the continuity of pullback attractors for evolution processes

In this paper we give general results on the continuity of pullback attractors for nonlinear evolution processes. We then revisit results of [D. Li, P.E. Kloeden, Equi-attraction and the continuous dependence of pullback attractors on parameters, Stoch. Dyn. 4 (3) (2004) 373-384] which show that, under certain conditions, continuity is equivalent to uniformity of attraction over a range of parameters (""equi-attraction""): we are able to simplify their proofs and weaken the conditions required for this equivalence to hold. Generalizing a classical autonomous result [A.V. Babin, M.I. Vishik, Attractors of Evolution Equations, North Holland, Amsterdam, 1992] we give bounds on the rate of convergence of attractors when the family is uniformly exponentially attracting. To apply these results in a more concrete situation we show that a non-autonomous regular perturbation of a gradient-like system produces a family of pullback attractors that are uniformly exponentially attracting: these attractors are therefore continuous, and we can give an explicit bound on the distance between members of this family. (C) 2009 Elsevier Ltd. All rights reserved.

Limit on the fermion masses in technicolor models

Recently it has been pointed out that no limits can be put on the scale of fermion mass generation (M) in technicolor models, because the relation between the fermion masses (m(f)) and M depends on the dimensionality of the interaction responsible for generating the fermion mass. Depending on this dimensionality it may happen that m(f) does not depend on M at all. We show that exactly in this case m(f) may reach its largest value, which is almost saturated by the top quark mass. We make a few comments on the question of how large a dynamically generated fermion mass can be.

Maternal separation on the ethanol-preferring adult rat liver structure

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Surface cloud radiative forcing from broadband radiation measurements on the Antarctic plateau

Surface based measurements systems play a key role in defining the ground truth for climate modeling and satellite product validation. The Italian-French station of Concordia is operative year round since 2005 at Dome C (75°S, 123°E, 3230 m) on the East Antarctic Plateau. A Baseline Surface Radiation Network (BSRN) site was deployed and became operational since January 2006 to measure downwelling components of the radiation budget, and successively was expanded in April 2007 to measure upwelling radiation. Hence, almost a decade of measurement is now available and suitable to define a statistically significant climatology for the radiation budget of Concordia including eventual trends, by specifically assessing the effects of clouds and water vapor on SW and LW net radiation. A well known and robust clear sky-id algorithm (Long and Ackerman, 2000) has been operationally applied on downwelling SW components to identify cloud free events and to fit a parametric equation to determine clear-sky reference along the Antarctic daylight periods (September to April). A new model for surface broadband albedo has been developed in order to better describe the features the area. Then, a novel clear-sky LW parametrization, based on a-priori assumption about inversion layer structure, combined with daily and annual oscillations of the surface temperature, have been adopted and validated. The longwave based method is successively exploited to extend cloud radiative forcing studies to nighttime period (winter). Results indicated inter-annual and intra-annual warming behaviour, i.e. 13.70 W/m2 on the average, specifically approaching neutral effect in summer, when SW CRF compensates LW CRF, and warming along the rest of the year due prevalentely to CRF induced on the LW component.

Quantum effects on adsorption and diffusion of hydrogen and deuterium in microporous materials

Monte Carlo and molecular dynamics simulations and neutron scattering experiments are used to study the adsorption and diffusion of hydrogen and deuterium in zeolite Rho in the temperature range of 30-150 K. In the molecular simulations, quantum effects are incorporated via the Feynman-Hibbs variational approach. We suggest a new set of potential parameters for hydrogen, which can be used when Feynman-Hibbs variational approach is used for quantum corrections. The dynamic properties obtained from molecular dynamics simulations are in excellent agreement with the experimental results and show significant quantum effects on the transport at very low temperature. The molecular dynamics simulation results show that the quantum effect is very sensitive to pore dimensions and under suitable conditions can lead to a reverse kinetic molecular sieving with deuterium diffusing faster than hydrogen.

On the relationship between Bayesian error bars and the input data density

We investigate the dependence of Bayesian error bars on the distribution of data in input space. For generalized linear regression models we derive an upper bound on the error bars which shows that, in the neighbourhood of the data points, the error bars are substantially reduced from their prior values. For regions of high data density we also show that the contribution to the output variance due to the uncertainty in the weights can exhibit an approximate inverse proportionality to the probability density. Empirical results support these conclusions.

The hydrodynamic behaviour and mass transfer characteristics of single droplets in a pulsed sieve plate column

The literature relating to the performance of pulsed sieve plate liquid-liquid extraction columns and the relevant hydrodynamic phenomenon have been surveyed. Hydrodynamic behaviour and mass transfer characteristics of droplets in turbulent and non-turbulent conditions have also been reviewed. Hydrodynamic behaviour, i.e. terminal and characteristic velocity of droplets, droplet size and droplet breakup processes, and mass transfer characteristics of single droplets (d≤0.6 cm) were investigated under pulsed (mixer-settler & transitional regimes) and non-pulsed conditions in a 5.0 cm diameter, 100 cm high, pulsed sieve plate column with three different sieve plate types and variable plate spacing. The system used was toluene (displaced) - acetone - distilled water. Existing photographic techniques for following and recording the droplet behaviour, and for observing the parameters of the pulse and the pulse shape were further developed and improved. A unique illumination technique was developed by which a moving droplet could be photographed using cine or video photography with good contrast without using any dye. Droplet size from a given nozzle and droplet velocity for a given droplet diameter are reduced under pulsing condition, and it was noted that this effect is enhanced in the presence of sieve plate. The droplet breakup processes are well explained by reference to an impact-breakup mechanism. New correlations to predict droplet diameter based on this mechanism are given below.vskip 1.0cm or in dimensionless groups as follows:- (We)crit= 3.12 - 1.79 (Eo)crit A correlation based on the isotropic turbulence theory was developed to calculate droplet diameter in the emulsion regime.vskip 1.0cm Experimental results show that in the mixer-settler and transitional regimes, pulsing parameters had little effect on the overall dispersed phase mass transfer coefficient during the droplet formation and unhindered travel periods.

New Upper Bound for the Edge Folkman Number Fe(3,5;13)

2000 Mathematics Subject Classification: 05C55.

Capacity estimates for optical transmission based on the nonlinear Fourier transform

What is the maximum rate at which information can be transmitted error-free in fibre-optic communication systems? For linear channels, this was established in classic works of Nyquist and Shannon. However, despite the immense practical importance of fibre-optic communications providing for >99% of global data traffic, the channel capacity of optical links remains unknown due to the complexity introduced by fibre nonlinearity. Recently, there has been a flurry of studies examining an expected cap that nonlinearity puts on the information-carrying capacity of fibre-optic systems. Mastering the nonlinear channels requires paradigm shift from current modulation, coding and transmission techniques originally developed for linear communication systems. Here we demonstrate that using the integrability of the master model and the nonlinear Fourier transform, the lower bound on the capacity per symbol can be estimated as 10.7 bits per symbol with 500 GHz bandwidth over 2,000 km.

Effect of the calcium level and limestone particle size on the performance of semi-heavy layers in the second cycle of egg production

An experiment was carried out at the Research and Development Unit of Brotas aiming at evaluating dietary calcium level and limestone particle size on the production performance of commercial (Hy-Line Brown) layers in the second lay cycle. Experiment duration was 112 days. A total number of 288 hens, with 83 weeks of age in the beginning of the experiment, were used in a completely randomized experimental design in a factorial arrangement of 2x3, with two calcium levels (3.5 and 4.0%) and three limestone particle size compositions: 100% fine limestone (FL), 30% coarse limestone (CL) + 70% fine limestone (FL), and 50% (CL) + 50% (FL), with six replicates of eight birds each. Egg weight (g), egg production (%), egg mass (%), feed intake (g), feed conversion ratio (kg/dz and kg/kg), mortality (%), and egg loss (%) were evaluated. The analysis of variance did not detect significant differences (p>0.05) among treatments on any of the evaluated performance parameters. It was concluded that the tested calcium levels and limestone particle composition did not influence the performance of semi-heavy layers in second production cycle.