This paper presents a framework of using resource metrics to characterize the various models of parallel computation. Our framework reeects the approach of recent models to abstract architectural details into several generic parameters, which we call resource metrics. We examine the diierent resource metrics chosen by diierent parallel models, categorizing the models into four classes: the basi...

We investigate the issue of stalling in the LogP model. In particular, we introduce a novel quantitative characterization of stalling, referred to as -stalling, which intuitively captures the realistic assumption that once the network’s capacity constraint is violated, it takes some time (at most ) for this information to propagate to the processors involved. We prove a lower bound that shows t...

Pseudomonas putida strain DOT-T1E is highly tolerant to organic solvents, with a logP(ow) (the logarithm of the partition coefficient of a solvent in a two-phase water-octanol system of > or =2.5. Solvent tolerant microorganisms can be exploited to develop double-phase (organic solvent and water) biotransformation systems in which toxic substrates or products are kept in the organic phase. We t...

We have developed a new method, i.e., XLOGP3, for logP computation. XLOGP3 predicts the logP value of a query compound by using the known logP value of a reference compound as a starting point. The difference in the logP values of the query compound and the reference compound is then estimated by an additive model. The additive model implemented in XLOGP3 uses a total of 87 atom/group types and...

Performance modeling is important for implementing efficient parallel applications and runtime systems. The LogP model captures the relevant aspects of message passing in distributed-memory architectures. In this paper we describe an efficient method that measures LogP parameters for a given message passing platform. Measurements are performed for messages of different sizes, as covered by the ...

We investigate the issue of stalling in the LogP model. In particular, we introduce a novel quantitative characterization of stalling, referred to as δ-stalling, which intuitively captures the realistic assumption that once the network’s capacity constraint is violated, it takes some time (at most δ) for this information to propagate to the processors involved. We prove a lower bound that shows...

ion for algorithm design and programming, while LogP provides better control of machine resources. Comparisons and evaluations between the two models have been made in [29,62,104]. In [29], a variant of LogP that disallows the so-called stalling behavior is considered. The authors create cross simulations between the two models showing their equivalence in algorithmic design when using asymptot...

We present an analysis of the period-V -amplitude plane for RR0 Lyrae stars (fundamental mode pulsators) with “normal” light curves in the bulge using the MACHO bulge fields. Although bulge globular clusters have RR Lyraes that divide into two reasonable distinct groups according to the average period of the RR0 Lyraes (Oosterhoff 1939), there is no evidence of a gap between Oosterhoff I and II...

Hundred ninety three drugs of different pharmacological activity were studied. Lipophilicity of a drug is one of the parameters, which influence its biological activity. The n-octanol-water partition coefficients were calculated for these compounds by use of different theoretical procedures (AlogPs, IAlogP, miLogP, ClogP, logP(Kowwin), and xlogP). Particular theoretical partition coefficients w...

serve as a basis for the design and analysis of fast, portable parallel algorithms, such as algorithms that can be implemented effectively on a wide variety of current and future parallel machines. If we look at the body of parallel algorithms developed under current parallel models, many are impractical because they exploit artificial factors not present in any reasonable machine, such as zero...