On group extensions

Thesis (M.A.)--Boston University Bibliography

Control-based Scheduling in a Distributed Stream Processing System

Stream processing systems receive continuous streams of messages with raw information and produce streams of messages with processed information. The utility of a stream-processing system depends, in part, on the accuracy and timeliness of the output. Streams in complex event processing systems are processed on distributed systems; several steps are taken on different processors to process each incoming message, and messages may be enqueued between steps. This paper deals with the problems of distributed dynamic control of streams to optimize the total utility provided by the system. A challenge of distributed control is that timeliness of output depends only on the total end-toend time and is otherwise independent of the delays at each separate processor whereas the controller for each processor takes action to control only the steps on that processor and cannot directly control the entire network. This paper identifies key problems in distributed control and analyzes two scheduling algorithms that help in an initial analysis of a difficult problem

Reliable Synchronization Primitives for Java

Java is an architecture-independent, object-oriented language designed to facilitate code-sharing across the Internet in general, via the Web in particular. Java is multithreaded, providing thread creation and synchronization constructs based on generalized monitors. Although these primitives are appropriate for many windowing applications, they are not necessarily well-suited for the larger class of multithreaded programs that occur as part of distributed systems. We demonstrate how the Java primitives, in conjunction with the object-oriented aspects of the language, can be used to implement a collection of other traditional synchronization paradigms. These paradigms are formally specified, their implementations are rigorously verified, and their use is illustrated with several examples

Novel use Of Hydroxyurea in an African Region with Malaria (NOHARM): a trial for children with sickle cell anemia

Hydroxyurea treatment is recommended for children with sickle cell anemia (SCA) living in high-resource malaria-free regions, but its safety and efficacy in malaria-endemic sub-Saharan Africa, where the greatest sickle-cell burden exists, remain unknown. In vitro studies suggest hydroxyurea could increase malaria severity, and hydroxyurea-associated neutropenia could worsen infections. NOHARM (Novel use Of Hydroxyurea in an African Region with Malaria) was a randomized, double-blinded, placebo-controlled trial conducted in malaria-endemic Uganda, comparing hydroxyurea to placebo at 20 ± 2.5 mg/kg per day for 12 months. The primary outcome was incidence of clinical malaria. Secondary outcomes included SCA-related adverse events (AEs), clinical and laboratory effects, and hematological toxicities. Children received either hydroxyurea (N = 104) or placebo (N = 103). Malaria incidence did not differ between children on hydroxyurea (0.05 episodes per child per year; 95% confidence interval [0.02, 0.13]) vs placebo (0.07 episodes per child per year [0.03, 0.16]); the hydroxyurea/placebo malaria incidence rate ratio was 0.7 ([0.2, 2.7]; P = .61). Time to infection also did not differ significantly between treatment arms. A composite SCA-related clinical outcome (vaso-occlusive painful crisis, dactylitis, acute chest syndrome, splenic sequestration, or blood transfusion) was less frequent with hydroxyurea (45%) than placebo (69%; P = .001). Children receiving hydroxyurea had significantly increased hemoglobin concentration and fetal hemoglobin, with decreased leukocytes and reticulocytes. Serious AEs, sepsis episodes, and dose-limiting toxicities were similar between treatment arms. Three deaths occurred (2 hydroxyurea, 1 placebo, and none from malaria). Hydroxyurea treatment appears safe for children with SCA living in malaria-endemic sub-Saharan Africa, without increased severe malaria, infections, or AEs. Hydroxyurea provides SCA-related laboratory and clinical efficacy, but optimal dosing and monitoring regimens for Africa remain undefined. This trial was registered at www.clinicaltrials.gov as #NCT01976416

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

We simulate competitive two-component growth on a one dimensional substrate of $L$ 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

Solving the Bin-Packing Problem by Means of Tissue P System with 2-Division

The ability of tissue P systems with 2-division for solving NP problems in polynomial time is well-known and many solutions can be found in the literature to several of such problems. Nonetheless, there are very few papers devoted to the Bin-packing problem. The reason may be the difficulties for dealing with different number of bins, capacity and number of objects by using exclusively division rules that produce two offsprings in each application. In this paper we present the design of a family of tissue P systems with 2 division which solves the Bin-packing problem in polynomial time by combining design techniques which can be useful for further research

Synchronization Landscapes in Small-World-Connected Computer Networks

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

Dense Building Instrumentation Application for City-Wide Structural Health Monitoring

The Community Seismic Network (CSN) has partnered with the NASA Jet Propulsion Laboratory (JPL) to initiate a campus-wide structural monitoring program of all buildings on the premises. The JPL campus serves as a proxy for a densely instrumented urban city with localized vibration measurements collected throughout the free-field and built environment. Instrumenting the entire campus provides dense measurements in a horizontal geospatial sense for soil response; in addition five buildings have been instrumented on every floor of the structure. Each building has a unique structural system as well as varied amounts of structural information via structural drawings, making several levels of assessment and evaluation possible. Computational studies with focus on damage detection applied to the campus structural network are demonstrated for a collection of buildings. For campus-wide real-time and post-event evaluation, ground and building response products using CSN data are illustrating the usefulness of higher spatial resolution compared to what was previously typical with sparser instrumentation

Community seismic network and localized earthquake situational awareness

Community-hosted seismic networks are a solution to the need for large numbers of sensors to operate over a seismically active region in order to accurately measure the size and location of an earthquake, assess resulting damage, and provide alerts. The Community Seismic Network is one such strong-motion network, currently comprising hundreds of elements located in California. It consists of low-cost, three-component, MEMS accelerometers capable of recording accelerations up to twice the level of gravity. The primary product of the network is to produce measurements of shaking of the ground and multiple locations of every upper floor in buildings, in the seconds during and following a major earthquake. Each sensor uses a small, dedicated ARM processor computer running Linux, and analyzes time series data in real time at hundreds of samples per second. The network reports on shaking parameters that indicate intensity of the structural response levels such as maximum floor acceleration and velocity, displacement of a floor in a building, as well as data products that depend on the response time histories. To do this, Cloud computing has been expanded through the use of statically defined subsets of sensors called cloudlets. These are smaller subsets of similar sensors that carry out customized calculations for those locations. The measurements are reported as rapidly as possible following an earthquake so that they may be incorporated into structural diagnosis and prognosis applications that can be used by first responders to prioritize their initial disaster management efforts. The cloudlet displays are customized for specific buildings and they show in real time: instantaneous displacement, inter-story drift, and resonant frequency and mode shapes using system identification software tools. The real-time display products are useful for decision-making about whether the potential for damage exists, what level of damage may have occurred and where, and whether total business disruption is necessary. City-wide dense monitoring makes it possible for emergency response managers to prioritize the target locations requiring first response on a block-by-block scale based on reports of shaking intensity

Update statistics in conservative parallel discrete event simulations of asynchronous systems

We model the performance of an ideal closed chain of L processing elements that work in parallel in an asynchronous manner. Their state updates follow a generic conservative algorithm. The conservative update rule determines the growth of a virtual time surface. The physics of this growth is reflected in the utilization (the fraction of working processors) and in the interface width. We show that it is possible to nake an explicit connection between the utilization and the macroscopic structure of the virtual time interface. We exploit this connection to derive the theoretical probability distribution of updates in the system within an approximate model. It follows that the theoretical lower bound for the computational speed-up is s=(L+1)/4 for L>3. Our approach uses simple statistics to count distinct surface configuration classes consistent with the model growth rule. It enables one to compute analytically microscopic properties of an interface, which are unavailable by continuum methods.Comment: 15 pages, 12 figure