Search results for "Distributed"

Targeted steel frames by means of innovative moment resisting connections

2021

Abstract The present paper proposes the use of stepped cross section devices on steel frames aiming at reproducing a pre-established target push-over curve. To this aim a Limited Resistance Plastic Device (LRPD) to be inserted along selected structural members is proposed. The following two main specific features for LRPD are required: any elastic flexural stiffness variation of the original selected member must be avoided; an ultimate plastic bending moment value equal to an assigned percentage of the original limit resistance value must be ensured. Steel frames equipped with LRPD are modeled by means of an extension of a recently proposed Fibre Smart Displacement Based (FSDB) beam element…

Memory Resource Management for Real-Time Systems

2007

Dynamic memory storage has been widely used for years in computer science. However, its use in real-time systems has not been considered as an important issue, and memory management has not receive much consideration, whereas today's real-time applications are often characterized by highly fluctuating memory requirements. In this paper we present an approach to dynamic memory management for real-time systems. In response to application behavior and requests, the underlying memory management system adjusts resources to meet changing demands and user needs. The architectural framework that realizes this approach allows adaptive allocation of memory resources to applications involving both per…

The differences between distributed shared memory caching and proxy caching

2000

The authors discuss the similarities in caching between the extensively studied distributed shared memory systems and the emerging proxy systems. They believe that several of the techniques used in distributed shared memory systems can be adapted and applied to proxy systems.

Socio-technical Congruence Sabotaged by a Hidden Onshore Outsourcing Relationship: Lessons Learned from an Empirical Study

2012

Despite the popularity of outsourcing arrangements, distributed software development is still regarded as a complex endeavor. Complexity primarily comes from the challenges in communication and coordination among participating organizations. In this paper we discuss lessons learned from participatory research carried out in a highly distributed onshore outsourcing project. Previous research established that socio-technical congruence principles alleviate distributed work. In practice we have found that alignment between the systems structure and organizational structure can be studied from different abstraction levels and also during different phases of project lifecycle. We have found that…

A Distributed approach to the Remote Control and Programming Improvement.

2006

Modelling of a prosumer’s substation in a district heating network: validation and dynamic analysis

Thermal grids will play a key role in the development of local energy communities and the achievement of 100% renewable societies. However, challenges are related to the capability of dealing with the increasing number of producers which could supply heat to thermal grids. Indeed, as in the case of the electricity grid, heat could be available for some hours in a day from RES plants installed at user level and distributed in the network (also referred to as “prosumers”). To achieve more reliable results when performing energy analyses of these innovative applications, there is a need to rely on accurate models of each component. For instance, substations are of paramount importance in the i…

Quantized Dissensus in Networks of Agents subject to Death and Duplication

2012

Dissensus is a modeling framework for networks of dynamic agents in competition for scarce resources. Originally inspired by biological cells behaviors, it fits also marketing, finance and many other application areas. Competition is often unstable in the sense that strong agents, those having access to large resources, gain more and more resources at the expense of weak agents. Thus, strong agents duplicate when reaching a critical amount of resources, whereas weak agents die when loosing all their resources. To capture all these phenomena we introduce systems with a discrete time gossip and unstable state dynamics interrupted by discrete events affecting the network topology. Invariancy o…

A Novel Energy Model for MANETs based on Graphs with Activation Windows

2005

Energy usage optimization is still an important issue and a critical design factor for mobile ad hoc networks (MANETs). Only recently a few proposals appeared that consider energy-aware optimizations for routing protocols. In this paper we describe an analytical model for MANETs which is based on graphs with activation windows. The activation windows allow to model the on-off status of the network devices. Moreover, we propose an algorithm with pseudo-polynomial complexity, called STP algorithm (STPA), that based on the current position and state of the nodes determines the shortest time path between the source node and the destination node.

Lifespan-Aware Routing for Wireless Sensor Networks

2010

Wireless Sensor Networks (WSNs) have the capability to become the eyes and ears for the future networked society allowing monitoring of any habitat or object's properties remotely and independently of an energy source. Services based on this technology may change the way we monitor and control remote areas and objects. In this paper we propose a different approach to routing data across Wireless Sensor Networks. We argue that a distance-vector protocol using a lifespan-aware metric is a plausible solution to the task of routing information in WSN in a manner that both saves energy of the individual node and manages summarized energy of the system equally and fairly. The concept is designed …

TBRA: A scalable routing algorithm in highly mobile large scale pure ad hoc wireless mesh networks

2009

In highly mobile pure ad-hoc wireless mesh networks, fast rerouting within low routing discovery delay is a mandatory requirement for routing algorithm to support interactive applications such as VoIP. Also, the communication overhead should be thwarted when networks grow to a large scale. We propose a Tree-Based Routing Algorithm - TBRA to facilitate such two goals. On one hand, TBRA has very low routing discovery delay due to its proactive property. On the other hand, TBRA performs more efficiently than other proactive protocols with respect to low communication overhead, which thanks to its short routing packet length, less numbers and smaller routing table size. Our modeling analysis an…