Spelling suggestions: "subject:"computational grids"" "subject:"eomputational grids""
51 |
Dynamic superscalar grid for technical debt reductionKillian, Rudi January 2018 (has links)
Thesis (MTech (Information Technology))--Cape Peninsula University of Technology, 2018. / Organizations and the private individual, look to technology advancements to increase their ability to make informed decisions. The motivation for technology adoption by entities sprouting from an innate need for value generation. The technology currently heralded as the future platform to facilitate value addition, is popularly termed cloud computing. The move to cloud computing however, may conceivably increase the obsolescence cycle for currently retained Information Technology (IT) assets. The term obsolescence, applied as the inability to repurpose or scale an information system resource for needed functionality. The incapacity to reconfigure, grow or shrink an IT asset, be it hardware or software is a well-known narrative of technical debt. The notion of emergent technical debt realities is professed to be all but inevitable when informed by Moore’s Law, as technology must inexorably advance. Of more imminent concern however are that major accelerating factors of technical debt are deemed as non-holistic conceptualization and design conventions. Should management of IT assets fail to address technical debt continually, the technology platform would predictably require replacement. The unrealized value, functional and fiscal loss, together with the resultant e-waste generated by technical debt is meaningfully unattractive. Historically, the cloud milieu had evolved from the grid and clustering paradigms which allowed for information sourcing across multiple and often dispersed computing platforms. The parallel operations in distributed computing environments are inherently value adding, as enhanced effective use of resources and efficiency in data handling may be achieved. The predominant information processing solutions that implement parallel operations in distributed environments are abstracted constructs, styled as High Performance Computing (HPC) or High Throughput Computing (HTC). Regardless of the underlying distributed environment, the archetypes of HPC and HTC differ radically in standard implementation. The foremost contrasting factors of parallelism granularity, failover and locality in data handling have recently been the subject of greater academic discourse towards possible fusion of the two technologies. In this research paper, we uncover probable platforms of future technical debt and subsequently recommend redeployment alternatives. The suggested alternatives take the form of scalable grids, which should provide alignment with the contemporary nature of individual information processing needs. The potential of grids, as efficient and effective information sourcing solutions across geographically dispersed heterogeneous systems are envisioned to reduce or delay aspects of technical debt. As part of an experimental investigation to test plausibility of concepts, artefacts are designed to generically implement HPC and HTC. The design features exposed by the experimental artefacts, could provide insights towards amalgamation of HPC and HTC.
|
52 |
Economic-based distributed resource management and scheduling for grid computingBuyya, Rajkumar, 1970- January 2002 (has links)
Abstract not available
|
53 |
A grid-based middleware for processing distributed data streamsChen, Liang, January 2006 (has links)
Thesis (Ph. D.)--Ohio State University, 2006. / Title from first page of PDF file. Includes bibliographical references (p. 146-157).
|
54 |
Conception et mise en oeuvre de mécanismes sécurisés d'échange de données confidentiellesSeitz, Ludwig Brunie, Lionel. Pierson, Jean-Marc. January 2006 (has links)
Thèse doctorat : Informatique : Villeurbanne, INSA : 2005. / Thèse bilingue français-anglais. Glossaire. Titre provenant de l'écran-titre. Bibliogr. p. 173-183.
|
55 |
Extensible message layers for resource-rich cluster computersUlmer, Craig D. 12 1900 (has links)
No description available.
|
56 |
Study of knapsack-based admission and allocation techniquesParra Hernández, Rafael 02 December 2009 (has links)
The allocation of resources among various project, units. or users is accomplished through the use of a systematic mechanism called resource allocation. The types of resources vary, depending upon the system under consideration. For instance, frequency spectrum and transmitter power might be the resources needed to allocate in an efficient manner on a cellular network system, so that the number of mobile users attended is maximized. On a Grid computing system, one needs to allocate resources such as processors, memory, disk space, and so on, in order that computational tasks run in the most efficient manner.
In order to evaluate resource allocation techniques performances, we first need to evaluate whether a particular resource allocation problem can be cast in the mathematical formu-lation we are exploring. We also need to decide which mechanism will be used, or if a new one needs to be constructed to solve the particular formulation. Finally, we need to evaluate whether the solution obtained is better than those obtained from other techniques that might express and solve the allocation problem in different ways.
In this dissertation, we propose a new resource allocation technique for a system described only by a formulation known as the Multichoice Multidimensional Knapsack Problem, or MMKP. We also propose and evaluate resource allocation techniques on two other sys¬tems: a cellular network and a Grid computing system; in this regard, the resource alloca¬tion problem is not expressed as an MMKP, although the formulations used are particular cases of the MMKP. The MMKP formulation is not applied because its use would not have allowed us to make a fair performance comparison with other more commonly used allo¬cation techniques. However, we believe that as more complex tasks are demanded from systems where resource allocation mechanisms are needed, an MMKP formulation could more suitably represent the allocation problem.
Numerical results indicate that the resource allocation techniques explored in this work present a better performance than previous techniques. Numerical results also indicate that the use of the proposed techniques and the use of suitable optimization criteria can be used to achieve a number of resource allocation goals.
|
57 |
Adjoint-based error estimation and grid adaptation for functional outputs from CFD simulationsBalasubramanian, Ravishankar, January 2005 (has links)
Thesis (Ph.D.) -- Mississippi State University. Computational Engineering. / Title from title screen. Includes bibliographical references.
|
58 |
Optimizing XML-based grid services on multi-core processors using an emulation frameworkBhowmik, Rajdeep. January 2007 (has links)
Thesis (M.S.)--State University of New York at Binghamton, Department of Computer Science, Thomas J. Watson School of Engineering and Applied Science, 2007. / Includes bibliographical references.
|
59 |
Parallelization of light scattering spectroscopy and its integration with computational grid environmentsPaladugula, Jithendar. January 2004 (has links)
Thesis (M.S.)--University of Florida, 2004. / Title from title page of source document. Document formatted into pages; contains 74 pages. Includes vita. Includes bibliographical references.
|
60 |
Large scale feature extraction and trackingDhume, Pinakin. January 2007 (has links)
Thesis (M.S.)--Rutgers University, 2007. / "Graduate Program in Electrical and Computer Engineering." Includes bibliographical references (p. 114-115).
|
Page generated in 0.1105 seconds