15,134 research outputs found

    Space Efficient Breadth-First and Level Traversals of Consistent Global States of Parallel Programs

    Full text link
    Enumerating consistent global states of a computation is a fundamental problem in parallel computing with applications to debug- ging, testing and runtime verification of parallel programs. Breadth-first search (BFS) enumeration is especially useful for these applications as it finds an erroneous consistent global state with the least number of events possible. The total number of executed events in a global state is called its rank. BFS also allows enumeration of all global states of a given rank or within a range of ranks. If a computation on n processes has m events per process on average, then the traditional BFS (Cooper-Marzullo and its variants) requires O(mn1n)\mathcal{O}(\frac{m^{n-1}}{n}) space in the worst case, whereas ou r algorithm performs the BFS requires O(m2n2)\mathcal{O}(m^2n^2) space. Thus, we reduce the space complexity for BFS enumeration of consistent global states exponentially. and give the first polynomial space algorithm for this task. In our experimental evaluation of seven benchmarks, traditional BFS fails in many cases by exhausting the 2 GB heap space allowed to the JVM. In contrast, our implementation uses less than 60 MB memory and is also faster in many cases

    Self-organizing search lists using probabilistic back-pointers

    Get PDF
    A class of algorithms is given for maintaining self-organizing sequential search lists, where the only permutation applied is to move the accessed record of each search some distance towards the front of the list. During searches, these algorithms retain a back-pointer to a previously probed record in order to determine the destination of the accessed record's eventual move. The back-pointer does not traverse the list, but rather it is advanced occationally to point to the record just probed by the search algorithm. This avoids the cost of a second traversal through a significant portion of the list, which may be a significant savings when each record access may require a new page to be brought into primary memory. Probabilistic functions for deciding when to advance the pointer are presented and analyzed. These functions demonstrate average case complexities of measures such as asymptotic cost and convergence similar to some of the more common list update algorithms in the literature. In cases where the accessed record is moved forward a distance proportional to the distance to the front of the list, the use of these functions may save up to 50% of the time required for permuting the list

    A Business Process Management System based on a General Optimium Criterion

    Get PDF
    Business Process Management Systems (BPMS) provide a broad range of facilities to manage operational business processes. These systems should provide support for the complete Business Process Management (BPM) life-cycle (16): (re)design, configuration, execution, control, and diagnosis of processes. BPMS can be seen as successors of Workflow Management (WFM) systems. However, already in the seventies people were working on office automation systems which are comparable with today’s WFM systems. Recently, WFM vendors started to position their systems as BPMS. Our paper’s goal is a proposal for a Tasks-to-Workstations Assignment Algorithm (TWAA) for assembly lines which is a special implementation of a stochastic descent technique, in the context of BPMS, especially at the control level. Both cases, single and mixed-model, are treated. For a family of product models having the same generic structure, the mixed-model assignment problem can be formulated through an equivalent single-model problem. A general optimum criterion is considered. As the assembly line balancing, this kind of optimisation problem leads to a graph partitioning problem meeting precedence and feasibility constraints. The proposed definition for the "neighbourhood" function involves an efficient way for treating the partition and precedence constraints. Moreover, the Stochastic Descent Technique (SDT) allows an implicit treatment of the feasibility constraint. The proposed algorithm converges with probability 1 to an optimal solution.BPMS, control assembly system, stochastic optimisation techniques, TWAA, SDT

    SOME ASPECTS OF TOPOLOGICAL SORTING

    Get PDF
    In this paper, we provide an outline of most of the known techniques and principal results pertaining to computing and counting topological sorts, realizers and dimension of a finite partially ordered set, and identify some new directions
    corecore