42 research outputs found

    Multiplication and Modulo are Lattice Linear

    Full text link
    In this paper, we analyze lattice linearity of multiplication and modulo operations. We demonstrate that these operations are lattice linear and the parallel processing algorithms that we study for both these operations are able to exploit the lattice linearity of their respective problems. This implies that these algorithms can be implemented in asynchronous environments, where the nodes are allowed to read old information from each other and are still guaranteed to converge within the same time complexity. These algorithms also exhibit properties similar to snap-stabilization, i.e., starting from an arbitrary state, the system follows the trace strictly according to its specification

    Lattice Linear Problems vs Algorithms

    Full text link
    Modelling problems using predicates that induce a partial order among global states was introduced as a way to permit asynchronous execution in multiprocessor systems. A key property of such problems is that the predicate induces one lattice in the state space which guarantees that the execution is correct even if nodes execute with old information about their neighbours. Thus, a compiler that is aware of this property can ignore data dependencies and allow the application to continue its execution with the available data rather than waiting for the most recent one. Unfortunately, many interesting problems do not exhibit lattice linearity. This issue was alleviated with the introduction of eventually lattice linear algorithms. Such algorithms induce a partial order in a subset of the state space even though the problem cannot be defined by a predicate under which the states form a partial order. This paper focuses on analyzing and differentiating between lattice linear problems and algorithms. It also introduces a new class of algorithms called (fully) lattice linear algorithms. A characteristic of these algorithms is that the entire reachable state space is partitioned into one or more lattices and the initial state locks into one of these lattices. Thus, under a few additional constraints, the initial state can uniquely determine the final state. For demonstration, we present lattice linear self-stabilizing algorithms for minimal dominating set and graph colouring problems, and a parallel processing 2-approximation algorithm for vertex cover. The algorithm for minimal dominating set converges in n moves, and that for graph colouring converges in n+2m moves. The algorithm for vertex cover is the first lattice linear approximation algorithm for an NP-Hard problem; it converges in n moves. Some part is cut due to 1920 character limit. Please see the pdf for full abstract.Comment: arXiv admin note: text overlap with arXiv:2209.1470

    Lattice Linearity in Assembling Myopic Robots on an Infinite Triangular Grid

    Full text link
    In this paper, we study the problem of gathering distance-1 myopic robots on an infinite triangular grid. We show that the algorithm developed by Goswami et al. (SSS, 2022) is lattice linear. This implies that a distributed scheduler, assumed therein, is not required for this algorithm: it runs correctly in asynchrony. It also implies that the algorithm works correctly even if the robots are equipped with a unidirectional \textit{camera} to see the neighbouring robots (rather than an omnidirectional one, which would be required under a distributed scheduler). Due to lattice linearity, we can predetermine the point of gathering. We also show that this algorithm converges in 2n2n rounds, which is lower than that (2.5(n+1)2.5(n+1) rounds) shown in Goswami et al.Comment: arXiv admin note: text overlap with arXiv:2302.0720

    Technical Report: Using Static Analysis to Compute Benefit of Tolerating Consistency

    Full text link
    Synchronization is the Achilles heel of concurrent programs. Synchronization requirement is often used to ensure that the execution of the concurrent program can be serialized. Without synchronization requirement, a program suffers from consistency violations. Recently, it was shown that if programs are designed to tolerate such consistency violation faults (\cvf{s}) then one can obtain substantial performance gain. Previous efforts to analyze the effect of \cvf-tolerance are limited to run-time analysis of the program to determine if tolerating \cvf{s} can improve the performance. Such run-time analysis is very expensive and provides limited insight. In this work, we consider the question, `Can static analysis of the program predict the benefit of \cvf-tolerance?' We find that the answer to this question is affirmative. Specifically, we use static analysis to evaluate the cost of a \cvf and demonstrate that it can be used to predict the benefit of \cvf-tolerance. We also find that when faced with a large state space, partial analysis of the state space (via sampling) also provides the required information to predict the benefit of \cvf-tolerance. Furthermore, we observe that the \cvf-cost distribution is exponential in nature, i.e., the probability that a \cvf has a cost of cc is A.BcA.B^{-c}, where AA and BB are constants, i.e., most \cvf{s} cause no/low perturbation whereas a small number of \cvf{s} cause a large perturbation. This opens up new aveneus to evaluate the benefit of \cvf-tolerance

    App for Resume-Based Job Matching with Speech Interviews and Grammar Analysis: A Review

    Full text link
    Through the advancement in natural language processing (NLP), specifically in speech recognition, fully automated complex systems functioning on voice input have started proliferating in areas such as home automation. These systems have been termed Automatic Speech Recognition Systems (ASR). In this review paper, we explore the feasibility of an end-to-end system providing speech and text based natural language processing for job interview preparation as well as recommendation of relevant job postings. We also explore existing recommender-based systems and note their limitations. This literature review would help us identify the approaches and limitations of the various similar use-cases of NLP technology for our upcoming project.Comment: 4 pages, 2 figures, literature revie

    The World's Biggest Country: India's Demographic Trajectory and it's Impact on Muslims, the Parliament and the Labour Market

    Get PDF
    India's dynamic population has undergone significant shifts over the years. Recently, surpassing China's total population presents a unique opportunity for growth and development. While facing the challenges of managing a large population, India also grapples with economic and resource-related complexities. Additionally, there are internal challenges stemming from communal differences among religious communities and representation in governance. These factors necessitate well-informed and effective policymaking. To ensure the smooth functioning of this vibrant democracy, it is crucial to focus on economic progress and enhancing quality of life. Understanding key concepts like demographic shifts, variations in age groups, uneven population growth, skill disparities, and resource requirements is paramount for a comprehensive approach. This paper explores various facets of India's population dynamics and addresses the hurdles in achieving sustainable growth and effective governance

    Clinical profile of patients with prosthetic heart valve thrombosis undergoing fibrinolytic therapy and NYHA class as a predictor of outcome

    Get PDF
    Background: Prosthetic heart valve thrombosis (PHVT) is a potentially fatal complication of heart valve replacement with mechanical prostheses mainly due to thrombosis.Aim: The study aimed to evaluate the clinical profile of the patients presenting with PHVT undergoing fibrinolytic therapy and analyzing patients with respect to New York Heart Association (NYHA) functional class on presentation and its association with outcome of fibrinolytic therapy.Settings & design: This was prospective, observational study conducted from June, 2016 to April, 2017. Total 133 patients with prosthetic heart valve thrombosis were included. Materials and methods: Routine blood investigations included complete hemogram, liver and renal function tests. Prothrombin time with INR was done on admission. The diagnosis of PHVT was assessed by fluoroscopy and/or echocardiography (transthoracic/transesophageal). Follow-up at 6 months was scheduled for all patients.Statistical analysis: Parametric values between two groups were performed using the independent sample t-test or chi-square test, as appropriate. Univariate and multivariate logistic regression was used to find out factors associated with outcome.Results: All patients received fibrinolytic therapy in which 108 (81.2%) were treated with streptokinase and 25 (18.8%) were treated with urokinase. On presentation, 48.9% patients were in NYHA class III, 41.4% in NYHA class IV and 9.77% in NYHA class II. Fibrinolytic therapy was successful in 105 patients (78.9%) and it failed in 28 patients (21.1%). Mortality in NYHA class II was 0%, NYHA class III was 4.6% and in NYHA class IV was 23.6%. During 6 months follow up prosthetic heart valve thrombosis recurred in 12 (11.43%) patients.Conclusion: From our single centre experience, fibrinolytic therapy is fairly effective first line therapy for prosthetic heart valve thrombosis and NYHA functional class on presentation can predict the outcome of fibrinolytic therapy

    The Forward Physics Facility at the High-Luminosity LHC

    Get PDF
    corecore