1,241 research outputs found

    Parallel Program Archetypes

    Get PDF
    A parallel program archetype is an abstraction that captures the common features of a class of problems with similar computational structure and combines them with a parallelization strategy to produce a pattern of dataflow and communication. Such abstractions are useful in application development, both as a conceptual framework and as a basis for tools and techniques. This paper describes an approach to parallel application development based on archetypes and presents two example archetypes with applications

    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

    Integrating Task and Data Parallelism with the Collective Communication Archetype

    Get PDF
    A parallel program archetype aids in the development of reliable, efficient parallel applications with common computation/communication structures by providing stepwise refinement methods and code libraries specific to the structure. The methods and libraries help in transforming a sequential program into a parallel program via a sequence of refinement steps that help maintain correctness while refining the program to obtain the appropriate level of granularity for a target machine. The specific archetype discussed here deals with the integration of task and data parallelism by using collective (or group) communication. This archetype has been used to develop several applications

    Roughening of the (1+1) interfaces in two-component surface growth with an admixture of random deposition

    Full text link
    We simulate competitive two-component growth on a one dimensional substrate of LL sites. One component is a Poisson-type deposition that generates Kardar-Parisi-Zhang (KPZ) correlations. The other is random deposition (RD). We derive the universal scaling function of the interface width for this model and show that the RD admixture acts as a dilatation mechanism to the fundamental time and height scales, but leaves the KPZ correlations intact. This observation is generalized to other growth models. It is shown that the flat-substrate initial condition is responsible for the existence of an early non-scaling phase in the interface evolution. The length of this initial phase is a non-universal parameter, but its presence is universal. In application to parallel and distributed computations, the important consequence of the derived scaling is the existence of the upper bound for the desynchronization in a conservative update algorithm for parallel discrete-event simulations. It is shown that such algorithms are generally scalable in a ring communication topology.Comment: 16 pages, 16 figures, 77 reference

    Synchronization Landscapes in Small-World-Connected Computer Networks

    Full text link
    Motivated by a synchronization problem in distributed computing we studied a simple growth model on regular and small-world networks, embedded in one and two-dimensions. We find that the synchronization landscape (corresponding to the progress of the individual processors) exhibits Kardar-Parisi-Zhang-like kinetic roughening on regular networks with short-range communication links. Although the processors, on average, progress at a nonzero rate, their spread (the width of the synchronization landscape) diverges with the number of nodes (desynchronized state) hindering efficient data management. When random communication links are added on top of the one and two-dimensional regular networks (resulting in a small-world network), large fluctuations in the synchronization landscape are suppressed and the width approaches a finite value in the large system-size limit (synchronized state). In the resulting synchronization scheme, the processors make close-to-uniform progress with a nonzero rate without global intervention. We obtain our results by ``simulating the simulations", based on the exact algorithmic rules, supported by coarse-grained arguments.Comment: 20 pages, 22 figure

    Host Biomarkers Are Associated With Response to Therapy and Long-Term Mortality in Pediatric Severe Malaria.

    Get PDF
    Background. Host responses to infection are critical determinants of disease severity and clinical outcome. The development of tools to risk stratify children with malaria is needed to identify children most likely to benefit from targeted interventions.Methods. This study investigated the kinetics of candidate biomarkers of mortality associated with endothelial activation and dysfunction (angiopoietin-2 [Ang-2], soluble FMS-like tyrosine kinase-1 [sFlt-1], and soluble intercellular adhesion molecule-1 [sICAM-1]) and inflammation (10 kDa interferon γ-induced protein [CXCL10/IP-10] and soluble triggering receptor expressed on myeloid cells-1 [sTREM-1]) in the context of a randomized, double-blind, placebo-controlled, parallel-arm trial evaluating inhaled nitric oxide versus placebo as adjunctive therapy to parenteral artesunate for severe malaria. One hundred eighty children aged 1–10 years were enrolled at Jinja Regional Referral Hospital in Uganda and followed for up to 6 months.Results. There were no differences between the 2 study arms in the rate of biomarker recovery. Median levels of Ang-2, CXCL10, and sFlt-1 were higher at admission in children who died in-hospital (n = 15 of 180; P < .001, P = .027, and P = .004, respectively). Elevated levels of Ang-2, sTREM-1, CXCL10, and sICAM-1 were associated with prolonged clinical recovery times in survivors. The Ang-2 levels were also associated with postdischarge mortality (P < .0001). No biomarkers were associated with neurodisability.Conclusions. Persistent endothelial activation and dysfunction predict survival in children admitted with severe malaria

    Distributed Consensus, Revisited

    Get PDF
    We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves Consensus among asynchronous distributed processes in the presence of a particular class of failure detectors (Diamond S or, equivalently, Omega), under the hypothesis that only a minority of processes may crash. The model is defined as a global transition system that is unambigously generated by local transition rules. The model is syntax-free in that it does not refer to any form of programming language or pseudo code. We use our model to formally prove that the algorithm is correct

    Automatic generation of hardware/software interfaces

    Get PDF
    Enabling new applications for mobile devices often requires the use of specialized hardware to reduce power consumption. Because of time-to-market pressure, current design methodologies for embedded applications require an early partitioning of the design, allowing the hardware and software to be developed simultaneously, each adhering to a rigid interface contract. This approach is problematic for two reasons: (1) a detailed hardware-software interface is difficult to specify until one is deep into the design process, and (2) it prevents the later migration of functionality across the interface motivated by efficiency concerns or the addition of features. We address this problem using the Bluespec Codesign Language~(BCL) which permits the designer to specify the hardware-software partition in the source code, allowing the compiler to synthesize efficient software and hardware along with transactors for communication between the partitions. The movement of functionality across the hardware-software boundary is accomplished by simply specifying a new partitioning, and since the compiler automatically generates the desired interface specifications, it eliminates yet another error-prone design task. In this paper we present BCL, an extension of a commercially available hardware design language (Bluespec SystemVerilog), a new software compiling scheme, and preliminary results generated using our compiler for various hardware-software decompositions of an Ogg Vorbis audio decoder, and a ray-tracing application.National Science Foundation (U.S.) (NSF (#CCF-0541164))National Research Foundation of Korea (grant from the Korean Government (MEST) (#R33-10095)

    Drucker\u27s Insights on Market Orientation and Innovation: Implications for Emerging Areas in High-Technology Marketing

    Get PDF
    In 1954, Drucker boldly declared that organizations have only two basic functions, marketing and innovation. While true for any organization, this insight is particularly pertinent for technology-based businesses. The complicated environment surrounding high-tech companies creates a great need for sophisticated marketing, yet these companies continue to have under-developed competencies in marketing and in understanding customer needs. In its first two sections, this essay explores Drucker’s insights with respect to two particularly salient issues for high-tech companies: developing and implementing a market orientation, and sustained break-through innovations. We review Drucker’s insights and synthesize them with the scholarly research on these issues. In the third section, we discuss three emerging areas in high-tech marketing where academics and managers could build on Drucker’s insight to guide future research and practice: market-driving, customer co-creation, and corporate social responsibility. The illustrative examples provided by these emerging areas highlight that even today, Drucker’s writings continue to offer remarkable guidance to scholars and managers who are willing to take the time to reflect, understand, and incorporate these insights in the unique context of high-tech industries
    corecore