Site and query scheduling policies in multicomputer databasesystems

We study run-time issues, such as site allocation and query scheduling policies, in executing read-only queries in a hierarchical, distributed memory, multicomputer system. The particular architecture considered is based on the hypercube interconnection. The data are stored in a base cube, which is controlled by a control cube and host node hierarchy. Input query trees are transformed into operation sequence trees, and the operation sequences become the units of scheduling. These sequences are scheduled dynamically at run-time. Algorithms for dynamic site allocation are provided. Several query scheduling policies that support interquery concurrency are also studied. Average query completion times and initiation delays are obtained for the various policies using simulations     

Evaluation of a parallel branch-and-bound algorithm on a class ofmultiprocessors

We propose and evaluate a parallel “decomposite best-first” search branch-and-bound algorithm (dbs) for MIN-based multiprocessor systems. We start with a new probabilistic model to estimate the number of evaluated nodes for a serial best-first search branch-and-bound algorithm. This analysis is used in predicting the parallel algorithm speed-up. The proposed algorithm initially decomposes a problem into N subproblems, where N is the number of processors available in a multiprocessor. Afterwards, each processor executes the serial best-first search to find a local feasible solution. Local solutions are broadcasted through the network to compute the final solution. A conflict-free mapping scheme, known as the step-by-step spread, is used for subproblem distribution on the MIN. A speedup expression for the parallel algorithm is then derived using the serial best-first search node evaluation model. Our analysis considers both computation and communication overheads for providing realistic speed-up. Communication modeling is also extended for the parallel global best-first search technique. All the analytical results are validated via simulation. For large systems, when communication overhead is taken into consideration, it is observed that the parallel decomposite best-first search algorithm provides better speed-up compared to other reported schemes     

Partitioned encoding schemes for algorithm-based fault tolerance inmassively parallel systems

Considers the applicability of algorithm based fault tolerance (ABET) to massively parallel scientific computation. Existing ABET schemes can provide effective fault tolerance at a low cost For computation on matrices of moderate size; however, the methods do not scale well to floating-point operations on large systems. This short note proposes the use of a partitioned linear encoding scheme to provide scalability. Matrix algorithms employing this scheme are presented and compared to current ABET schemes. It is shown that the partitioned scheme provides scalable linear codes with improved numerical properties with only a small increase in hardware and time overhead     

The performance of cache-based error recovery in multiprocessors

Several variations of cache-based checkpointing for rollback error recovery from transient errors in shared-memory multiprocessors have been recently developed. By modifying the cache replacement policy, these techniques use the inherent redundancy in the memory hierarchy to periodically checkpoint the computation state. Three schemes, different in the manner in which they avoid rollback propagation, are evaluated in this paper. By simulation with address traces from parallel applications running on an Encore Multimax shared-memory multiprocessor, we evaluate the performance effect of integrating the recovery schemes in the cache coherence protocol. Our results indicate that the cache-based schemes can provide checkpointing capability with low performance overhead, but with uncontrollable high variability in the checkpoint interval     

Unicast-based multicast communication in wormhole-routed networks

Multicast communication, in which the same message is delivered from a source node to an arbitrary number of destination nodes, is being increasingly demanded in parallel computing. System supported multicast services can potentially offer improved performance, increased functionality, and simplified programming, and may in turn be used to support various higher-level operations for data movement and global process control. This paper presents efficient algorithms to implement multicast communication in wormhole-routed direct networks, in the absence of hardware multicast support, by exploiting the properties of the switching technology. Minimum-time multicast algorithms are presented for n-dimensional meshes and hypercubes that use deterministic, dimension-ordered routing of unicast messages. Both algorithms can deliver a multicast message to m-1 destinations in [log ₂ m] message passing steps, while avoiding contention among the constituent unicast messages. Performance results of implementations on a 64-node nCUBE-2 hypercube and a 168-node Symult 2010 2-D mesh are given     

Structuring fault-tolerant object systems for modularity in adistributed environment

The object-oriented approach to system structuring has found widespread acceptance among designers and developers of robust computing systems. The authors propose a system structure for distributed programming systems that support persistent objects and describe how properties such as persistence and recoverability can be implemented. The proposed structure is modular, permitting easy exploitation of any distributed computing facilities provided by the underlying system. An existing system constructed according to the principles espoused here is examined to illustrate the practical utility of the proposed approach to system structuring     

A semantic modeling approach for image retrieval by content

We introduce a semantic data model to capture the hierarchical, spatial, temporal, and evolutionary semantics of images in pictorial databases. This model mimics the user's conceptual view of the image content, providing the framework and guidelines for preprocessing to extract image features. Based on the model constructs, a spatial evolutionary query language (SEQL), which provides direct image object manipulation capabilities, is presented. With semantic information captured in the model, spatial evolutionary queries are answered efficiently. Using an object-oriented platform, a prototype medical-image management system was implemented at UCLA to demonstrate the feasibility of the proposed approach.     

Genetic aspects of Crohn disease and ulcerative colitis. Empirical risk of recurrence and case presentation

Nutrient uptake by the hindlimb was investigated utilising the arteriovenous difference technique in 5 Thoroughbred horses fed to maintenance a diet of 100% roughage or 52% oat grain and 48% roughage. Arterial blood was obtained from a catheter inserted into the carotid artery while venous blood was simultaneously collected from a catheter placed into the iliac vein via the medial saphenous vein. The arteriovenous difference for glucose was significant and represented a mean extraction of 10 +/- 1% with no effect of diet. If fully oxidised, glucose uptake (corrected for lactate and pyruvate arteriovenous difference) was sufficient to account for 78 +/- 13% or 107 +/- 15% of the oxygen consumed by the hindlimb in horses fed a roughage or 52% oat grain diet respectively. Acetate was also a major metabolite of the hindlimb, showing a 39 +/- 5% extraction with no effect of diet. However, the 52% oat grain diet did induce a significant decline in the concentration of acetate in arterial blood. The potential contribution to oxidation in the hindlimb was significantly reduced from 32 +/- 4% in horses fed roughage to 21 +/- 3% when fed 52% oat grain. D-3-Hydroxybutyrate uptake could account for 9 +/- 1% of the oxidation by the hindlimb with no effect of diet. The technique for measuring nutrient uptake across the hindlimb using the arteriovenous difference is relatively simple and would be valuable in investigating fuel use by muscle during exercise.     

Providing information to clients about psychological tests: A survey of attorneys' and law students' attitudes.

Surveyed 70 practicing attorneys and 150 law students to determine the extent to which they felt it was their responsibility to inform clients they referred for psychological testing about the testing process and about the validity scales on tests. Results showed that almost 50% of the attorneys and over 33% of the students believe that clients referred for testing always or usually should be informed of validity scales on tests. These results suggest that many test takers, particularly in forensic settings, may have information about validity scales that facilitates their giving biased responses without detection. Psychologists doing forensic evaluations should be alert to this possibility and should consider using more than one approach to detect response distortions. (PsycINFO Database Record (c) 2010 APA, all rights reserved)