Search results for "Distributed computing"
showing 10 items of 622 documents
Topology design to reduce energy consumption of distributed graph filtering in WSN
2017
The large number of nodes forming current sensor networks has made essential to introduce distributed mechanisms in many traditional applications. In the emerging field of graph signal processing, the distributed mechanism of information potentials constitutes a distributed graph filtering process that can be used to solve many different problems. An important limitation of this algorithm is that it is inherently iterative, which implies that the nodes incur in a repeated communication cost along the exchange periods of the filtering process. Since sensor nodes are battery powered and radio communications are one of the most energy demanding operations, in this work, we propose to redesign …
Approximation algorithm for constrained coupled-tasks scheduling problem
2014
International audience; We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. In such context, we propose some complexity results according to several parameters and we design an efficient polynomial-time approximation algorithm.
Two Job Cyclic Scheduling with Incompatibility Constraints
2001
The present paper deals with the problem of scheduling several repeated occurrences of two jobs over a finite or infinite time horizon in order to maximize the yielded profit. The constraints of the problem are the incompatibilities between some pairs of tasks which require a same resource.
Time and work generalised precedence relationships in project scheduling with pre-emption: An application to the management of Service Centres
2012
Abstract In this paper we present an application of project scheduling concepts and solution procedures for the solution of a complex problem that comes up in the daily management of many company Service Centres. The real problem has been modelled as a multi-mode resource-constrained project scheduling problem with pre-emption, time and work generalised precedence relationships with minimal and maximal time lags between the tasks and due dates. We present a complete study of work GPRs which includes proper definitions, a new notation and all possible conversions amongst them. Computational results that show the efficiency of the proposed hybrid genetic algorithm and the advantages of allowi…
Dependability-Based Reliability Analysis in URC Networks: Availability in the Space Domain
2019
Ultra-reliable low latency communication (URLLC), which refers to achieving almost 100% reliability at a certain (satisfactory) level of services and stringent latency, is one of the key requirements for 5G networks. However, most prior studies on reliable communication did not address space domain analysis. Neither were they pursued from a dependability perspective. This paper addresses the ultra-reliable communication (URC) aspect of URLLC and aims at advocating the concept of URC from a dependability perspective in the space domain. We perform in-depth analysis on URC considering both the spatial characteristics of cell deployment and user distributions, as well as service requirements. …
Per-user availability for ultra-reliable communication in 5G: Concept and analysis
2018
Emerging 5G mobile networks envisage ultra-reliable communication (URC) as one of the major requirements for anytime anywhere communication. Although URC has recently attracted a lot of attention in the research community, existing work seems to rely on approaching reliability merely from a time domain perspective. However, both time and space domain parameters affect reliability and need to be investigated. This paper introduces a dependability theory based definition for per-user availability targeted at 5G networks. The advocated definition promotes both space and time domain components for URC provisioning. Furthermore, we perform reliability and availability analysis and simulations co…
Time-Space Domain Availability Analysis Under Reliability Impairments
2019
Availability and reliability are two essential metrics for the design, deployment, and operation of future ultra-reliable low latency communication (URLLC) networks. Despite a vast amount of research efforts toward URLLC, very little attention has been made on the ultra-reliable communication (URC) aspect of URLLC from a dependability perspective. As an effort toward achieving anytime and anywhere communication, this letter consolidates a dependability theory-based availability concept for individual users by taking into account reliability impairments that affect URC in both spatial and temporal domains . To this end, we perform per-user availability analysis by considering channel status …
Achieving Ultra Reliable Communication in 5G Networks: A Dependability Perspective Availability Analysis in the Space Domain
2017
As part of the 5G communication paradigm, ultra reliable communication (URC) is envisaged as an important technology pillar for providing anywhere and anytime services to end users. While most existing studies on reliable communication do not investigate this problem from a dependability theory perspective, those dependability-based studies tend to define reliability merely in the time domain. In this letter, we advocate extending the concept of URC from the dependability perspective also in the space domain . We initiate definitions on cell availability and system availability. The availability and the probability of providing a guaranteed level of availability in a network are analyzed bo…
An Adaptive Routing Mechanism for Efficient Resource Discovery in Unstructured P2P Networks
2005
The widespread adoption of large-scale decentralized peer-to-peer (P2P) systems imposes huge challenges on distributed search and routing. Decentralized and unstructured P2P networks are very attractive because they require neither centralized directories, nor precise control over network topology or data placement. However their search mechanisms are extremely unscalable, generating large loads on the network participants. In this paper, to address this major limitation, we propose and evaluate the adoption of an innovative algorithm for routing user queries. The proposed approach aims at dynamically adapting the network topology to peer interests, on the basis of query interactions among …
DECENTRALIZED SUBSPACE PROJECTION IN LARGE NETWORKS
2018
A great number of applications in wireless sensor networks involve projecting a vector of observations onto a subspace dictated by prior information. Accomplishing such a task in a centralized fashion entails great power consumption, congestion at certain nodes, and suffers from robustness issues. A sensible alternative is to compute such projections in a decentralized fashion. To this end, recent works proposed schemes based on graph filters, which compute projections exactly with a finite number of local exchanges among sensor nodes. However, existing methods to obtain these filters are confined to reduced families of projection matrices or small networks. This paper proposes a method tha…