8 research outputs found

    (h,k)-Arbiters for h-out-of-k mutual exclusion problem

    Get PDF
    Abstracth-Out-of-k mutual exclusion is a generalization of the 1-mutual exclusion problem, where there are k units of shared resources and each process requests h(1⩽h⩽k) units at the same time. Though k-arbiter has been shown to be a quorum-based solution to this problem, quorums in k-arbiter are much larger than those in the 1-coterie for 1-mutual exclusion. Thus, the algorithm based on k-arbiter needs many messages. This paper introduces the new notion that each request uses different quorums depending on the number of units of its request. Based on the notion, this paper defines two (h,k)-arbiters for h-out-of-k mutual exclusion: a uniform (h,k)-arbiter and a (k+1)-cube (h,k)-arbiter. The quorums in each (h,k)-arbiter are not larger than the ones in the corresponding k-arbiter; consequently, it is more efficient to use (h,k)-arbiters than the k-arbiters. A uniform (h,k)-arbiter is a generalization of the majority coterie for 1-mutual exclusion. A (k+1)-cube (h,k)-arbiter is a generalization of square grid coterie for 1-mutual exclusion

    Section critique à entrées multiples tolérante aux fautes et utilisant des détecteurs de défaillances

    Get PDF
    Nous présentons dans cet article un nouvel algorithme tolérant aux fautes de K-exclusion mutuelle. Cet algorithme à permission est une extension de l'algorithme de Raymond [Ray89]. Il tolère n − 1 fautes et reste efficace malgré les défaillances. L'algorithme repose sur un détecteur de fautes non fiable. Une évaluation de performances montre l'efficacité de notre approche en présence de fautes

    A Fault-Tolerant Algorithm For Distributed Resource Allocation

    Get PDF
    Resource allocation is a usual problem that must be faced during a distributed system design. Despite the large number of algorithms proposed in literature to solve this problem, most papers lack of detailed descriptions about how to turn these algorithms into real-world reliable protocols. This article presents a fault-tolerant algorithm for distributed resource allocation named SLOTS which is implemented as an executable protocol. It allocates resources among members in a fairly manner using simple heuristics and employing a donation approach. SLOTS supports the dynamic behavior of clusters and provides high availability services. It bases its fault-tolerance properties and membership changes in atomic sets of operations (like transactions) using services provided by an underlying Group Communication System.Facultad de Informátic

    A Fault-Tolerant Algorithm For Distributed Resource Allocation

    Get PDF
    Resource allocation is a usual problem that must be faced during a distributed system design. Despite the large number of algorithms proposed in literature to solve this problem, most papers lack of detailed descriptions about how to turn these algorithms into real-world reliable protocols. This article presents a fault-tolerant algorithm for distributed resource allocation named SLOTS which is implemented as an executable protocol. It allocates resources among members in a fairly manner using simple heuristics and employing a donation approach. SLOTS supports the dynamic behavior of clusters and provides high availability services. It bases its fault-tolerance properties and membership changes in atomic sets of operations (like transactions) using services provided by an underlying Group Communication System.Facultad de Informátic

    A fault-tolerant algorithm for distributed resource allocation

    Get PDF
    Resource allocation is a usual problem that must be faced during a distributed system design. Despite the large number of algorithms proposed in literature to solve this problem, most papers lack of detailed descriptions about how to turn these algorithms into real-world reliable protocols. This article presents a fault-tolerant algorithm for distributed resource allocation named SLOTS which is implemented as an executable protocol. It allocates resources among members in a fairly manner using simple heuristics and employing a donation approach. SLOTS supports the dynamic behavior of clusters and provides high availability services. It bases its fault-tolerance properties and membership changes in atomic sets of operations (like transactions) using services provided by an underlying Group Communication System.La participación de Toni Cortes en este trabajo ha sido financiada por el Gobierno de España (subvención SEV2015-0493 del programa Severo Ochoa) por el Ministerio Español de Ciencia e Innovación (contrato TIN2015-65316) y la Generalitat de Catalunya (contrato 2014-SGR-1051). La participación de Fernando G. Tinetti en este trabajo ha sido financiada por la UNLP (Facultad de Informática) y la CIC Provincia de Buenos Aires, Argentina.Peer ReviewedPostprint (author's final draft

    Central and Eastern European Literary Theory and the West

    Get PDF
    The twentieth century saw intensive intellectual exchange between Eastern and Central Europe and the West. Yet political and linguistic obstacles meant that many important trends in East and Central European thought and knowledge hardly registered in Western Europe and the US. This book uncovers the hidden westward movements of Eastern European literary theory and its influence on Western scholarship

    Central and Eastern European Literary Theory and the West

    Get PDF
    The twentieth century saw intensive intellectual exchange between Eastern and Central Europe and the West. Yet political and linguistic obstacles meant that many important trends in East and Central European thought and knowledge hardly registered in Western Europe and the US. This book uncovers the hidden westward movements of Eastern European literary theory and its influence on Western scholarship

    Maritime expressions:a corpus based exploration of maritime metaphors

    Get PDF
    This study uses a purpose-built corpus to explore the linguistic legacy of Britain’s maritime history found in the form of hundreds of specialised ‘Maritime Expressions’ (MEs), such as TAKEN ABACK, ANCHOR and ALOOF, that permeate modern English. Selecting just those expressions commencing with ’A’, it analyses 61 MEs in detail and describes the processes by which these technical expressions, from a highly specialised occupational discourse community, have made their way into modern English. The Maritime Text Corpus (MTC) comprises 8.8 million words, encompassing a range of text types and registers, selected to provide a cross-section of ‘maritime’ writing. It is analysed using WordSmith analytical software (Scott, 2010), with the 100 million-word British National Corpus (BNC) as a reference corpus. Using the MTC, a list of keywords of specific salience within the maritime discourse has been compiled and, using frequency data, concordances and collocations, these MEs are described in detail and their use and form in the MTC and the BNC is compared. The study examines the transformation from ME to figurative use in the general discourse, in terms of form and metaphoricity. MEs are classified according to their metaphorical strength and their transference from maritime usage into new registers and domains such as those of business, politics, sports and reportage etc. A revised model of metaphoricity is developed and a new category of figurative expression, the ‘resonator’, is proposed. Additionally, developing the work of Lakov and Johnson, Kovesces and others on Conceptual Metaphor Theory (CMT), a number of Maritime Conceptual Metaphors are identified and their cultural significance is discussed
    corecore