106 research outputs found

    Scheduling distributed data-intensive applications on global grids

    No full text
    © 2006 Dr. Srikumar VenugopalThe next generation of scientific experiments and studies are being carried out by large collaborations of researchers distributed around the world engaged in analysis of huge collections of data generated by scientific instruments. Grid computing has emerged as an enabler for such collaborations as it aids communities in sharing resources to achieve common objectives. Data Grids provide services for accessing, replicating and managing data collections in these collaborations. Applications used in such Grids are distributed data-intensive, that is, they access and process distributed datasets to generate results. These applications need to transparently and efficiently access distributed data and computational resources. This thesis investigates properties of data-intensive computing environments and presents a software framework and algorithms for mapping distributed data-oriented applications to Grid resources. (For complete abstract open document

    Will Siri ever dream of electric sheep?

    No full text
    The idea of a personal robot assistant, has always been a staple of science fiction, writes Srikumar Venugopal for The Conversation. . The 1940s had Zolo to scare away officious mailmen and refresh bouquets, while the Jetsons had Rosie to deal with prickly bosses. HAL 9000, the most evil red light in filmdom, may not have been keen to “open the pod bay doors” but it could still belt out a mean rendition of Daisy Bell.   Read in full  Image: Flickr / striati

    Bol Processor BP2

    No full text
    Bol Processor 2 (BP2) is a music composition/improvisation software producing arrangements of sound-objects with a set of rules similar to formal grammars. The inference engine produces strings of symbols feeding an algorithm for the expansion of (polymetric) polyphonic/polyrhythmic structures, and ultimately a time-setting algorithm dealing with constraints on sound-objects. First interfaced with MIDI and Csound, BP2 has a great potential for modelling durations and melodic patterns in speech synthesis.Link on SourceForge: http://bolprocessor.sourceforge.netBol Processor 2 (BP2) es uno software de composición y improvisación de música producir arreglos de sonido de objetos con un conjunto de normas similares a las gramáticas formales. El motor de inferencia produce cadenas de símbolos que alimente un algoritmo para la expansión de (polimétrico) polifónicos/polirrítmica estructuras, y en última instancia, un algoritmo de establecimiento de tiempo de hacer frente a las limitaciones en el sonido-objetos. En primer lugar interconectado con MIDI y Csound, BP2 tiene un gran potencial para el modelado de las duraciones y los patrones melódicos en la síntesis de voz.Enlace en SourceForge: http://bolprocessor.sourceforge.netBol Processor 2 (BP2) est un logiciel de composition/improvisation générant des structures d'objets sonores à partir d'un ensemble de règles similaires à celles des grammaires formelles. Le moteur d'inférence produit des chaînes de symboles auxquelles sont appliquées un algorithme d'expansion de structures polyphoniques/polyrythmiques (polymetriques), puis un algorithme de temporalisation utilisant des contraintes sur les objets sonores. Interfacé à l'origine avec MIDI et Csound, BP2 peut être utilisé pour modéliser les durées et les formes mélodiques en synthèse de la parole.Lien sur SourceForge : http://bolprocessor.sourceforge.netBEL, B. Acquisition et représentation de connaissances en musique. Thèse de Doctorat en Sciences (nouveau régime) : Université de Droit, d'Economie et des Sciences d'Aix-Marseille III. Sous la direction de M. Alain Guénoche. Novembre 1990. Paris: EDILIVRES. 2008http://tel.archives-ouvertes.fr/tel-0000969

    A study in grid simulation and scheduling

    No full text
    Grid computing is emerging as an essential tool for large scale analysis and problem solving in scientific and business domains. Whilst the idea of stealing unused processor cycles is as old as the Internet, we are still far from reaching a position where many distributed resources can be seamlessly utilised on demand. One major issue preventing this vision is deciding how to effectively manage the remote resources and how to schedule the tasks amongst these resources. This thesis describes an investigation into Grid computing, specifically the problem of Grid scheduling. This complex problem has many unique features making it particularly difficult to solve and as a result many current Grid systems employ simplistic, inefficient solutions. This work describes the development of a simulation tool, G-Sim, which can be used to test the effectiveness of potential Grid scheduling algorithms under realistic operating conditions. This tool is used to analyse the effectiveness of a simple, novel scheduling technique in numerous scenarios. The results are positive and show that it could be applied to current procedures to enhance performance and decrease the negative effect of resource failure. Finally a conversion between the Grid scheduling problem and the classic computing problem SAT is provided. Such a conversion allows for the possibility of applying sophisticated SAT solving procedures to Grid scheduling providing potentially effective solutions

    God on the hill and other stories

    No full text
    What makes this book poignant and relevant is the counterpoint to archaeological narratives it posits. Though archaeologists tell us that these megalithic dolmens, menhirs and the like were funerary or commemorative structures, local villagers near the monuments insist that they were the houses of a now-extinct race of dwarves called Moriyas. The stories in this collection are inspired by actual monuments and sites in India. As architect-author Srikumar M Menon went along collecting data about the monuments, he could not help collecting stories too. Srikumar’s stories also draw attention to outdated theories on the development of disciplines such as the ‘history of architecture’. Legislation and barbed wire fencing are grossly inadequate to protect these primitive monuments that our prehistoric ancestors built

    Efficient Node Bootstrapping for Decentralised Shared-Nothing Key-Value Stores

    No full text
    Part 3: StorageInternational audienceDistributed key-value stores (KVSs) have become an important component for data management in cloud applications. Since resources can be provisioned on demand in the cloud, there is a need for efficient node bootstrapping and decommissioning, i.e. to incorporate or eliminate the provisioned resources as a members of the KVS. It requires the data be handed over and the load be shifted across the nodes quickly. However, the data partitioning schemes in the current-state shared nothing KVSs are not efficient in quick bootstrapping. In this paper, we have designed a middleware layer that provides a decentralised scheme of auto-sharding with a two-phase bootstrapping. We experimentally demonstrate that our scheme reduces bootstrap time and improves load-balancing thereby increasing scalability of the KVS

    A Set Coverage-based Mapping Heuristic for Scheduling Distributed Data-Intensive Applications on Global Grids

    No full text
    Data-intensive Grid applications need access to large datasets that may each be replicated on different resources. Minimizing the overhead of transferring these datasets to the resources where the applications are executed requires that appropriate computational and data resources be selected. In this paper, we introduce a heuristic for the selection of resources based on a solution to the Set Covering Problem (SCP). We then pair this mapping heuristic with the well-known MinMin scheduling algorithm and conduct performance evaluation through extensive simulations

    An Economy-based Algorithm for Scheduling Data-Intensive Applications on Global Grids

    No full text
    Data Grids have become the de facto platform for the next generation of eScience experiments that will be carried out through large collaborations spread around the world. As the number of entities within a data grid increases, scheduling of applications in order to make the most efficient use of the available resources such as computational, storage and network facilities becomes a challenge. Previous work has suggested a computational economy metaphor for resource management within compute and data grids. However, the issue of scheduling jobs that require distributed data within an economy-based data grid has not been studied in detail so far
    corecore