The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A self adaptive communication protocol is proposed for peer to peer distributed computing. This protocol can configure itself automatically in function of application requirements and topology changes by choosing the most appropriate communication mode between peers. The protocol was designed in order to be used in conjunction with a decentralized environment for high performance distributed computing...
Scheduling large amounts of tasks in distributed computing platforms composed of millions of nodes is a challenging goal, even more in a fully decentralized way and with low overhead. Thus, we propose a new scalable scheduler for task workflows with deadlines following a completely decentralized architecture. It's built upon a tree-based P2P overlay that supports efficient and fast aggregation of...
In the technique known as network coordinates, the network latency between nodes is modeled as the distance between points in a metric space. Actual network latencies, however, exhibit numerous triangle inequality violations, which result in significant error between the actual latency and the distance as determined by the network coordinates. In this work, we show how graph clustering techniques...
Recently there has been an effort to build scalable and reliable application-level multicast solutions that combine the resilience of pure gossip-based with the efficiency of tree-based schemes. However, such solutions assume that participants have unlimited resources, for instance, that they can send an unbounded number of messages to mask network omissions. Such scenario is not realistic, specially...
The commercial success of Cloud computing and recent developments in Grid computing have brought platform virtualization technology into the field of high performance computing. Virtualization offers both more flexibility and security through custom user images and user isolation. In this paper, we deal with the problem of distributing virtual machine (VM) images to a set of distributed compute nodes...
Nowadays, MMOGs are extensively used as they provide the ability for centralized gaming with many players. MMOGs can be classified into three different categories: MMRPOG that are role games, MMORTS based on real-time strategy games and MMOFPS named as first person shooter games. The computational requirements of these categories are different. In this paper we focus on MMOFPS, whose main gaming requirements...
Data and service delivery have been historically based on a ''network centric'' model, with datacentres being the focal sources. The amount of energy consumed by these datacentres has become an emerging issue for the companies operating them. Thus, many contributions have proposed solutions to improve the energy efficiency of current datacentre architecture and deployments. A recently proposed approach...
Peer-to-Peer (P2P) systems receive growing acceptance, and the need of identifying the states of nodes appears increasingly in a variety of P2P based applications. In this paper, we propose Hermes, an algorithm to efficiently spread and maintain the states of all nodes in large scale systems. Hermes uses an improved push & pull style gossip process to spread the states of all nodes, and proposes...
A fundamental problem in large scale Grids is the need for efficient and scalable techniques for resource discovery and scheduling. In traditional resource scheduling systems a single scheduler handles information about all computing resources and schedules jobs. This centralized approach has a serious scalability problem, since it introduces a bottleneck, as well as a single point of failure. Some...
New service providers, completely separated from the Internet Service Providers (ISP), are growing today in the Internet scenario to create new multimedia services through the P2P approach. These providers are manifesting great interest not only for classical multimedia applications, like video streaming and video on demand, but also for other applications, like for example video-conferencing, multi-party...
This paper presents the design of a P2P data persistent platform. Durable access and integrity of the data are ensured despite massive attacks. This platform, named DataCube, exploits the properties of cluster-based peer-to-peer substrates to implement a compound of full replication and rateless erasure codes. DataCube guarantees durable access and integrity of data despite adversarial attacks. In...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.