Search results for "Distributed computing"
showing 10 items of 622 documents
PTNet: A parameterizable data center network
2016
This paper presents PTNet, a new data center topology that is specifically designed to offer a high and parameterized scalability with just one layer architecture. Furthermore, despite its high scalability, PTNet grants a reduced latency and a high performance in terms of capacity and fault tolerance. Consequently, compared to widely known data center networks, our new topology shows better capacity, robustness, cost-effectiveness and less power consumption. Conducted experiments and theoretical analyses illustrate the performance of the novel system. 2016 IEEE. Scopus
Exploring NoC Virtualization Alternatives in CMPs
2012
Chip Multiprocessor systems (CMPs) contain more and more cores in every new generation. However, applications for these systems do not scale at the same pace. Thus, in order to obtain a good utilization several applications will need to coexist in the system and in those cases virtualization of the CMP system will become mandatory. In this paper we analyze two virtualization strategies at NoC-level aiming to isolate the traffic generated by each application to reduce or even eliminate interferences among messages belonging to different applications. The first model handles most interferences among messages with a virtual-channels (VCs) implementation minimizing both execution time and netwo…
DSMAV: An improved solution for multi-attribute search based on load capacities
2016
DHT (Distributed Hash Table) such as CHORD or PARTRY facilitates information searching in scalable systems. Two popular DHT-based approaches for range or multi-attribute search are to rely on attribute-value tree and a combination of attributes and values. However, tradeoff between a load balancing mechanism and query efficiency is a challenging task for such information searching systems. In this paper, we propose improved algorithms for a system called DSMAV in which information resources are distributed fairly among nodes and found based on multi-attribute queries in a small number of hop counts. Our system creates identifiers from resource names, each of which is a combination of attrib…
P2PStudio - Monitoring, Controlling and Visualization Tool for Peer-to-Peer Networks Research
2006
Peer-to-Peer Studio has been developed as a monitoring, controlling and visualization tool for peer-to-peer networks. It uses a centralized architecture to gather events from a peer-to-peer network and can be used to visualize network topology and to send different commands to individual peer-to-peer nodes. The tool has been used with Chedar Peer-to-Peer network to study the behavior of different peer-to-peer resource discovery and topology management algorithms and for visualizing the results of NeuroSearch resource discovery algorithm produced by the Peer-to-Peer Realm network simulator. This paper presents the features, the architecture and the protocols of Peer-to-Peer Studio and the ex…
Evaluation of SLA-based decision strategies for VM scheduling in cloud data centers
2016
Service level agreements (SLAs) gain more and more importance in the area of cloud computing. An SLA is a contract between a customer and a cloud service provider (CSP) in which the CSP guarantees functional and non-functional quality of service parameters for cloud services. Since CSPs have to pay for the hardware used as well as penalties for violating SLAs, they are eager to fulfill these agreements while at the same time optimizing the utilization of their resources.In this paper we examine SLA-aware VM scheduling strategies for cloud data centers. The service level objectives considered are resource usage and availability. The sample resources are CPU and RAM. They can be overprovision…
Predictive models for energy saving in Wireless Sensor Networks
2011
ICT devices nowadays cannot disregard optimizations toward energy sustainability. Wireless Sensor Networks, in particular, are a representative class of a technology where special care must be given to energy saving, due to the typical scarcity and non-renewability of their energy sources, in order to enhance network lifetime. In our work we propose a novel approach that aims to adaptively control the sampling rate of wireless sensor nodes using prediction models, so that environmental phenomena can be consistently modeled while reducing the required amount of transmissions; the approach is tested on data available from a public dataset.
A Formal Semantics and a Client Synthesis for a BPEL Service
2008
A complex Web service described with languages like BPEL4WS, consists of an executable process and its observable behaviour (called an abstract process) based on the messages exchanged with the client. The abstract process behaviour is non deterministic due to the internal choices during the service execution. Furthermore the specification often includes timing constraints which must be taken into account by the client. Thus given a service specification, we identify the synthesis of a client as a key issue for the development of Web services. To this end, we propose an approach based on (dense) timed automata to first describe the observable service behaviour and then to build correct inte…
A Generic Approach to Scheduling and Checkpointing Workflows
2018
This work deals with scheduling and checkpointing strategies to execute scientific workflows on failure-prone large-scale platforms. To the best of our knowledge, this work is the first to target fail-stop errors for arbitrary workflows. Most previous work addresses soft errors, which corrupt the task being executed by a processor but do not cause the entire memory of that processor to be lost, contrarily to fail-stop errors. We revisit classical mapping heuristics such as HEFT and MinMin and complement them with several checkpointing strategies. The objective is to derive an efficient trade-off between checkpointing every task (CkptAll), which is an overkill when failures are rare events, …
Extracting modular-based backbones in weighted networks
2021
Abstract Networks are an adequate representation for modeling and analyzing a great variety of complex systems. However, understanding networks with millions of nodes and billions of connections can be pretty challenging due to memory and time constraints. Therefore, selecting the relevant nodes and edges of these large-scale networks while preserving their core information is a major issue. In most cases, the so-called backbone extraction methods are based either on coarse-graining or filtering approaches. Coarse-graining techniques reduce the network size by gathering similar nodes into super-nodes, while filter-based methods eliminate nodes or edges according to a statistical property.In…
On the Robust Synthesis of Logical Consensus Algorithms for Distributed Intrusion Detection
2013
We introduce a novel consensus mechanism by which the agents of a network can reach an agreement on the value of a shared logical vector function depending on binary input events. Based on results on the convergence of finite--state iteration systems, we provide a technique to design logical consensus systems that minimize the number of messages to be exchanged and the number of steps before consensus is reached, and that can tolerate a bounded number of failed or malicious agents. We provide sufficient joint conditions on the input visibility and the communication topology for the method's applicability. We describe the application of our method to two distributed network intrusion detecti…