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.
The following topics are dealt with: grid scheduling; peer-to-peer computing; power management; cloud computing; file systems; software resources management; data management; software fault tolerance; and E-science workflow systems virtualization.
Computing is being transformed to a model consisting of services that are commoditised and delivered in a manner similar to utilities such as water, electricity, gas, and telephony. In such a model, users access services based on their requirements without regard to where the services are hosted. Several computing paradigms have promised to deliver this utility computing vision and they include Grid...
Summary form only given. This talk (modestly) attend to address challenges and opportunities ahead of us for making parallel programming as efficient, as productive, as effective as possible, on both Multi-cores and large-scale infrastructures such as Grids and Clouds. We draw on our experience at simplifying the programming of applications that are distributed on local area network (LAN), on cluster...
Summary form only given. Online storage and content distribution systems within the "cloud" of the Internet have provided a wide variety of services ranging from file sharing, software downloads, to stored or live video streaming, to a large community. With the increasing popularity of such systems, however, server and bandwidth costs have become prohibitively expensive, as files are hosted...
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle allocation algorithm. During the auction, prices are iteratively negotiated and dynamically adjusted until market equilibrium is reached. The BarSAA algorithm features decentralized bidding decision making in a heterogeneous...
The use of today's multicluster grids exhibits periods of submission bursts with periods of normal use and even of idleness. To avoid resource contention, many users employ observational scheduling, that is, they postpone the submission of relatively low-priority jobs until a cluster becomes (largely) idle. However, observational scheduling leads to resource contention when several such users crowd...
We describe our experiences from implementing and integrating a new job scheduling algorithm in the gLite Grid middleware and present experimental results that compare it to the existing gLite scheduling algorithms. It is the first time that gLite scheduling algorithms are put under test and compared with a new algorithm under the same conditions. We describe the problems that were encountered and...
In the last few years, highly distributed, heterogeneous and dynamic environments have become usual contexts for scientific and business domains. In this work, we consider query scheduling over a grid-enabled distributed database, where the data may be partially or totally replicated into the component sites. Although there have been some previous proposals for query scheduling in distributed databases,...
Many load balancing strategies have been proposed for distributed hash tables, like Pastry. These strategies assume that hash functions spread even skewed key distributions almost evenly over the ID space. They neglect the problem that many applications produce data with common keys (multi-sets) that entail hash collisions and therewith load imbalance concerning query and storage load. A second drawback...
This paper presents ldquoSelf-Chordrdquo, a bio-inspired P2P algorithm that can be profitably adopted to build the information service of distributed systems, in particular Computational Grids and Clouds. Self-Chord inherits the ability of Chord-like structured systems for the construction and maintenance of an overlay of peers, but features enhanced functionalities deriving from the activity of ant-inspired...
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.