Machine independent AND and OR parallel execution of logicprograms. I. The binding environment

We describe a binding environment for the AND and OR parallel execution of logic programs that is suitable for both shared and nonshared memory multiprocessors. The binding environment was designed with a view of rendering a compiler using this binding environment machine independent. The binding environment is similar to closed environments proposed by J. Conery. However, unlike Conery's scheme, it supports OR and independent AND parallelism on both types of machines. The term representation, the algorithms for unification and the join algorithms for parallel AND branches are presented in this paper. We also detail the differences between our scheme and Conery's scheme. A compiler based on this binding environment has been implemented on a platform for machine independent parallel programming called the Chare Kernel     

On loop transformations for generalized cycle shrinking

This paper describes several loop transformation techniques for extracting parallelism from nested loop structures. Nested loops can then be scheduled to run in parallel so that execution time is minimized. One technique is called selective cycle shrinking, and the other is called true dependence cycle shrinking. It is shown how selective shrinking is related to linear scheduling of nested loops and how true dependence shrinking is related to conflict-free mappings of higher dimensional algorithms into lower dimensional processor arrays. Methods are proposed in this paper to find the selective and true dependence shrinkings with minimum total execution time by applying the techniques of finding optimal linear schedules and optimal and conflict-free mappings proposed by W. Shang and A.B. Fortes     

Scheduling DAG's for asynchronous multiprocessor execution

A new approach is given for scheduling a sequential instruction stream for execution “in parallel” on asynchronous multiprocessors. The key idea in our approach is to exploit the fine grained parallelism present in the instruction stream. In this context, schedules are constructed by a careful balancing of execution and communication costs at the level of individual instructions, and their data dependencies. Three methods are used to evaluate our approach. First, several existing methods are extended to the fine grained situation. Our approach is then compared to these methods using both static schedule length analyses, and simulated executions of the scheduled code. In each instance, our method is found to provide significantly shorter schedules. Second, by varying parameters such as the speed of the instruction set, and the speed/parallelism in the interconnection structure, simulation techniques are used to examine the effects of various architectural considerations on the executions of the schedules. These results show that our approach provides significant speedups in a wide-range of situations. Third, schedules produced by our approach are executed on a two-processor Data General shared memory multiprocessor system. These experiments show that there is a strong correlation between our simulation results, and these actual executions, and thereby serve to validate the simulation studies. Together, our results establish that fine grained parallelism can be exploited in a substantial manner when scheduling a sequential instruction stream for execution “in parallel” on asynchronous multiprocessors     

Neural network control of communications systems

Neural networks appear well suited to applications in the control of communications systems for two reasons: adaptivity and high speed. This paper describes application of neural networks to two problems, admission control and switch control, which exploit the adaptivity and speed property, respectively. The admission control problem is the selective admission of a set of calls from a number of inhomogeneous call classes, which may have widely differing characteristics as to their rate and variability of traffic, onto a network. It is usually unknown in advance which combinations of calls can be simultaneously accepted so as to ensure satisfactory performance. The approach adopted is that key network performance parameters are observed while carrying various combinations of calls, and their relationship is learned by a neural network structure. The network model chosen has the ability to interpolate or extrapolate from the past results and the ability to adapt to new and changing conditions. The switch control problem is the service policy used by a switch controller in transmitting packets. In a crossbar switch with input queueing, significant loss of throughput can occur when head-of-line service order is employed. A solution can be based on an algorithm which maximizes throughput. However since this solution is typically required in less than one microsecond, software implementation policy is infeasible. We will carry out an analysis of the benefits of such a policy, describe some existing proposed schemes for its implementation, and propose a further scheme that provides this submicrosecond optimization.     

Robust crossfeed design for hovering rotorcraft

Control law design for rotorcraft fly-by-wire systems normally attempts to decouple the angular responses using fixed-gain crossfeeds. This approach can lead to poor decoupling over the frequency range of pilot inputs and increase the load on the feedback loops. In order to improve the decoupling performance, dynamic crossfeeds should be adopted. Moreover, because of the large changes that occur in the aircraft dynamics due to small changes about the nominal design condition, especially for near-hovering flight, the crossfeed design must be ‘robust’. A new low-order matching method is presented here to design robust crossfeed compensators for multi-input, multi-output (MIMO) systems. The technique minimizes cross-coupling given an anticipated set of parameter variations for the range of flight conditions of concern. Results are presented in this paper of an analysis of the pitch/roll coupling of the UH-60 Black Hawk helicopter in near-hovering flight. A robust crossfeed is designed that shows significant improvement in decoupling perfomance and robustness over the fixed-gain or single point dynamic compensators. The design method and results are presented in an easily used graphical format that lends significant physical insight to the design procedure. This plant precompensation technique is an appropriate preliminary step to the design of robust feedback control laws for rotorcraft.     

MEETING THE IT CHALLENGES OF BUSINESS The Changing Mandate for MBAs

What is the implication for business when information technology (IT) changes in the workplace without a commensurate change in the composition of business programs educating tomorrow's employees? A survey of MBA graduates forms the basis of this article on the IT skills needed in the marketplace.     

Large-deviation inequalities for parameter estimators in stochastic systems

Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 95–112, March–April, 1994.     

Modified surface-active monomers for adhesive bonding to dentin

PMGDM, a PMDM-type adhesive monomer, was synthesized from pyromellitic dianhydride and glycerol dimethacrylate. Only the para isomer of PMDM, a solid, is used in dental adhesives. The adhesive monomer PMGDM is a liquid and consists of a mixture of para- and meta isomers. This study shows that PMGDM has several advantages over PMDM. For example, the adhesive can be applied at a greater thickness, and additives and/or additional initiators for improved curing can be incorporated. Use of the liquid monomer PMGDM also provided a convenient means of varying the thickness of the adhesive layer between dentin and composite. The adhesive bonds were tested in both shear and tensile modes. PMDM was used as the control. The reliability of the bonds, as judged from the Weibull modulus and Weibull characteristic strength, was improved by (1) use of more concentrated solutions of PMGDM adhesive, (2) use of an adhesive thickness of about 25 microns, and (3) modification of PMGDM with a diluent monomer which is expected to enhance the degree of cure and/or the dentin-wetting properties of the adhesive resin.     

Two cell-wall-associated aminopeptidases from Lactobacillus helveticus and the purification and characterization of APII from strain ITGL1

Lactobacillus helveticus ITGL1 is able to hydrolyse many amino-acyl and dipeptidyl-p-nitroanilides. Analysis of heat inactivation kinetics, metal ion and protease inhibitor effects, and the subcellular location of aminopeptidase activities in both the parental strain and mutants deficient in lysyl-p-nitroanilide hydrolysis, led to the characterization of two cell-wall-associated aminopeptidases, APII and APIV. APII, which catalysed L-lysine p-nitroanilide hydrolysis, was purified about 28-fold to homogeneity from cell-wall extracts of L. helveticus ITGL1 and characterized. The purified enzyme appeared to be monomeric, with a molecular mass of 97 kDa. Aminopeptidase activity was greatest at pH 6.5 and 50 degrees C. APII was completely inhibited by bestatin, chelating agents such as EDTA or 1,10-phenanthroline and the divalent cations Zn2+ and Cu2+. The activity of the EDTA-treated enzyme was restored by Co2+, Ca2+ or Mn2+. Although APII was able to degrade several dipeptides and tripeptides with hydrophobic N-terminal amino acid (Leu, Ala), it was inactive on peptides containing Pro or Gly, and may thus contribute to the development of cheese flavour by processing bitter peptides.