An Integrated Approach to Locality-Conscious Processor Allocation and Scheduling of Mixed-Parallel Applications

Complex parallel applications can often be modeled as directed acyclic graphs of coarse-grained application tasks with dependences. These applications exhibit both task and data parallelism, and combining these two (also called mixed parallelism) has been shown to be an effective model for their execution. In this paper, we present an algorithm to compute the appropriate mix of task and data parallelism required to minimize the parallel completion time (makespan) of these applications. In other words, our algorithm determines the set of tasks that should be run concurrently and the number of processors to be allocated to each task. The processor allocation and scheduling decisions are made in an integrated manner and are based on several factors such as the structure of the task graph, the runtime estimates and scalability characteristics of the tasks, and the intertask data communication volumes. A locality-conscious scheduling strategy is used to improve intertask data reuse. Evaluation through simulations and actual executions of task graphs derived from real applications and synthetic graphs shows that our algorithm consistently generates schedules with a lower makespan as compared to Critical Path Reduction (CPR) and Critical Path and Allocation (CPA), two previously proposed scheduling algorithms. Our algorithm also produces schedules that have a lower makespan than pure task- and data-parallel schedules. For task graphs with known optimal schedules or lower bounds on the makespan, our algorithm generates schedules that are closer to the optima than other scheduling approaches.     

Hyperprolactinemia in end‐stage renal disease and effects of frequent hemodialysis

Introduction: End‐stage renal disease is associated with elevations in circulating prolactin concentrations, but the association of prolactin concentrations with intermediate health outcomes and the effects of hemodialysis frequency on changes in serum prolactin have not been examined. Methods: The FHN Daily and Nocturnal Dialysis Trials compared the effects of conventional thrice weekly hemodialysis with in‐center daily hemodialysis (6 days/week) and nocturnal home hemodialysis (6 nights/week) over 12 months and obtained measures of health‐related quality of life, self‐reported physical function, mental health and cognition. Serum prolactin concentrations were measured at baseline and 12‐month follow‐up in 70% of the FHN Trial cohort to examine the associations among serum prolactin concentrations and physical, mental and cognitive function and the effects of hemodialysis frequency on serum prolactin. Findings: Among 177 Daily Trial and 60 Nocturnal Trial participants with baseline serum prolactin measurements, the median serum prolactin concentration was 65 ng/mL (25th–75th percentile 48–195 ng/mL) and 81% had serum prolactin concentrations >30 ng/mL. While serum prolactin was associated with sex (higher in women), we observed no association between baseline serum prolactin and age, dialysis vintage, and baseline measures of physical, mental and cognitive function. Furthermore, there was no significant effect of hemodialysis frequency on serum prolactin in either of the two trials. Discussion: Serum prolactin concentrations were elevated in the large majority of patients with ESRD, but were not associated with several measures of health status. Circulating prolactin levels also do not appear to decrease in response to more frequent hemodialysis over a one‐year period.     

The Effects of Initial Conditions on Photoacoustic Waveforms Generated by a Gaussian Heating Source Moving in One Dimension

Although the photoacoustic effect is almost universally generated by radiation whose intensity is varied in time either by amplitude modulation of a continuous optical source or through the use of pulsed irradiation, it is possible to produce sound by movement of a continuous source in space. Here, the characteristics of sound production by movement of a light source in one dimension are discussed by solution to the wave equation for pressure. Solutions to the wave equation for the velocity potential, from which the acoustic pressure can be determined, are found using the D’Alembert integral and by Fourier transformation of the wave equation. The characteristics of the waveform generated by a Gaussian heat source moving uniformly in space are found to depend on the initial conditions for movement of the source.     

A test of the fail-safe N for self-help programs.

A meta-analysis of published studies on the clinical efficacy of selected self-help programs (F. Scogin et al; see record 1990-15222-001) indicated that such conditions were more effective than no-treatment controls. Calculation of a fail-safe N showed that 53 nonsignificant studies would have to exist to render the conclusions of the meta-analysis invalid. Results indicate that unpublished research is unlikely to threaten the validity of the original meta-analysis. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Hypercube sandwich approach to conferencing

This paper presents a novel cascaded conference network that provides distributed processing and signal transmission among members of disjoint sets of generic send/receive devices called conferees. It assumes an online request model in which idle groups of conferees may request the formation of a conference interconnection. Once a conference is established, all conferees remain connected until the entire conference is dissolved. The Hypercube Sandwich Network (HSN) consists of two components. A bidirectional permutation network is used for routing purposes to and from a hypercube of special processing elements for the purpose of conference formation. The HSN achieves strictly nonblocking performance for N conferees using O(Nlog N) processing elements, and this is shown to be tight to within a log ^1/4 N factor. Previous constructions required a quadratic number of processing elements for strictly nonblocking performance or could only provide wide-sense nonblocking conferencing. If the stronger requirement is made that the communication delay is logarithmic in the conference size, a simple algorithm is presented for wide-sense nonblocking conferencing in an HSN with O(N log N) processing elements.An earlier version of this paper was presented at the 1995 International Conference on Parallel Processing Techniques and Applications.     

Experimental Evaluation and Formal Analysis of High‐Level Tasks with Dynamic Obstacle Anticipation on a Full‐Sized Autonomous Vehicle

Certifying the behavior of autonomous systems is essential to the development and deployment of systems in safety‐critical applications. This paper presents an approach to using a correct‐by‐construction controller with the probabilistic results of dynamic obstacle anticipation, and validates the approach with experimental data obtained from Cornell's full‐scale autonomous vehicle. The obstacle anticipation (used to calculate the probability of collision with dynamic obstacles around the vehicle) is abstracted to a set of Boolean observations, which are then used by the synthesized controller (a state machine generated from temporal logic task specifications). The obstacle anticipation, sensor abstraction, and synthesized controller are implemented on a full‐scale autonomous vehicle, and experimental data are collected and compared with a formal analysis of the probabilistic behavior of the system. A comparison of the results shows good agreement between the formal analysis and the experimental results.     

PaaSword: A Holistic Data Privacy and Security by Design Framework for Cloud Services

Enterprises increasingly recognize the compelling economic and operational benefits from virtualizing and pooling IT resources in the cloud. Nevertheless, the significant and valuable transformation of organizations that adopt cloud computing is accompanied by a number of security threats that should be considered. In this paper, we outline significant security challenges presented when migrating to a cloud environment and propose PaaSword – a novel holistic framework that aspires to alleviate these challenges. Specifically, the proposed framework involves a context-aware security model, the necessary policies enforcement mechanism along with a physical distribution, encryption and query middleware.     

A new dynamic hydrogen reference electrode for applications in thin-film sensor systems

The realization and applicability of a new dynamic hydrogen reference electrode (DHRE) within an electrochemical microcell for sensor applications is reported. The electrodes are fabricated in thin-film technology and fixed within a flow-through device. An experimental setup for accurate electrochemical potential measurements is described. Smooth platinum, platinized platinum and pHEMA coated electrodes are investigated with regard to their initialization behavior, stability, reproducibility and interference with electrolytes. It is found that platinized platinum DHREs show excellent stability and reproducibility. For uncoated electrodes, the electrochemical potential is established within seconds. The potential is independent of the pH value within the range of pH 4–10. Interference with sulfate and phosphate is observed. Thus, the platinized platinum DHRE is well suited for bioanalytical sensor applications, where the pH value is buffered and the concentrations of the disturbing anions are constant or very low.     

Complexity and computability of solutions to linear programming systems

Through key examples and constructs, exact and approximate, complexity, computability, and solution of linear programming systems are reexamined in the light of Khachian's new notion of (approximate) solution. Algorithms, basic theorems, and alternate representations are reviewed. It is shown that the Klee-Minty example hasnever been exponential for (exact) adjacent extreme point algorithms and that the Balinski-Gomory (exact) algorithm continues to be polynomial in cases where (approximate) ellipsoidal centered-cutoff algorithms (Levin, Shor, Khachian, Gacs-Lovasz) are exponential. By model approximation, both the Klee-Minty and the new J. Clausen examples are shown to be trivial (explicitly solvable) interval programming problems. A new notion of computable (approximate) solution is proposed together with ana priori regularization for linear programming systems. New polyhedral constraint contraction algorithms are proposed for approximate solution and the relevance of interval programming for good starts or exact solution is brought forth. It is concluded from all this that the imposed problem ignorance of past complexity research is deleterious to research progress on computability or efficiency of computation.This research was partly supported by Project NR047-071, ONR Contract N00014-80-C-0242, and Project NR047-021, ONR Contract N00014-75-C-0569, with the Center for Cybernetic Studies, The University of Texas at Austin.