• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 81
  • 76
  • 14
  • 8
  • 7
  • 3
  • 3
  • 2
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 230
  • 230
  • 67
  • 51
  • 50
  • 41
  • 38
  • 36
  • 35
  • 34
  • 31
  • 28
  • 23
  • 22
  • 22
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Management von verteilten ingenieurwissenschaftlichen Anwendungen in heterogenen Grid Umgebungen

Lindner, Peggy, January 2007 (has links)
Stuttgart, Univ., Diss., 2007.

Grid Computing - Eine Einführung

Petersen, Karsten 30 September 2003 (has links) (PDF)
Workshop Mensch-Computer-Vernetzung Eine Einführung in Geschichte und Ideen des Grid-Computing. Kurze Vorstellung des 'Globus-Toolkit'.

QoS-based scheduling of workflows on global grids

Yu, Jia Unknown Date (has links) (PDF)
Grid computing has emerged as a global cyber-infrastructure for the next-generation of e-Science applications by integrating large-scale, distributed and heterogeneous resources. Scientific communities are utilizing Grids to share, manage and process large data sets. In order to support complex scientific experiments, distributed resources such as computational devices, data, applications, and scientific instruments need to be orchestrated while managing the application workflow operations within Grid environments. This thesis investigates properties of Grid workflow management systems, presents a workflow engine and algorithms for mapping scientific workflow applications to Grid resources based on specified QoS (Quality of Service) constraints. (For complete abstract open document)

A framework for SLA-aware execution of Grid-based workflows theory and implementation

Dang, Minh-Quan January 2006 (has links)
Zugl.: Paderborn, Univ., Diss., 2006 / Hergestellt on demand

Grid workflow scheduling based on incomplete information /

Schneider, Jörg. January 2010 (has links)
Berlin, Techn. Univ., Diss., 2009.

Geschäftsmodelle für Grid Computing in der Medizin und der Biomedizin

Scholz, Stefan January 2009 (has links)
Zugl.: Hannover, Univ., Diss., 2009

Ein diensteorientiertes Abrechnungssystem für dynamische virtuelle Organisationen

Göhner, Matthias January 2009 (has links)
Zugl.: München, Univ. der Bundeswehr, Diss., 2009

Stochastic Approach to Brokering Heuristics for Computational Grids/Approche Stochastique d'Heuristiques de Méta-Ordonnancement dans les Grilles de Calcul

Berten, Vandy J.F. 08 June 2007 (has links)
Computational Grids are large infrastructures composed of several components such as clusters, or massively parallel machines, generally spread across a country or the world, linked together through some network such as Internet, and allowing a transparent access to any resource. Grids have become unavoidable for a large part of the scientific community requiring computational power such as high-energy physics, bioinformatics or earth observation. Large projects are emerging, often at an international level, but even if Grids are on the way of being efficient and user-friendly systems, computer scientists and engineers still have a huge amount of work to do in order to improve their efficiency. Amongst a large number of problems to solve or to improve upon, the problem of scheduling the work and balancing the load is of first importance. <p> This work concentrates on the way the work is dispatched on such systems, and mainly on how the first level of scheduling – generally name brokering, or meta-sheduling – is performed. We deeply analyze the behavior of popular strategies, compare their efficiency, and propose a new very efficient brokering policy providing notable performances, attested by the large number of simulations we performed and provided in the document. <p> The work is mainly split in two parts. After introducing the mathematical framework on which the following of the manuscript is based, we study systems where the grid brokering is done without any feed-back information, i.e. without knowing the current state of the clusters when the resource broker – the grid component receiving jobs from clients and performing the brokering – makes its decision. We show here how a computational grid behaves if the brokering is done is such a way that each cluster receives a quantity of work proportional to its computational capacity. <p> The second part of this work is rather independent from the first one, and consists in the presentation of a brokering strategy, based on Whittle's indices, trying to minimize as much as possible the average sojourn time of jobs. We show how efficient the proposed strategy is for computational grids, compared to the ones popular in production systems. We also show its robustness to several parameter changes, and provide several very efficient algorithms allowing to make the required computations for this index policy. We finally extend our model in several directions.

Resource allocation in the Grid a market engineering approach /

Schnizler, Björn. January 2007 (has links)
Zugl.: Karlsruhe, University, Diss., 2007.

A dependable middleware for enhancing the fault tolerance of distributed computations in grid environments

Luckow, André January 2009 (has links)
Zugl.: Potsdam, Univ., Diss., 2009

Page generated in 0.1215 seconds