The object of this paper is to study invariant submanifolds M of Kenmotsu manifolds M̃ admitting a quarter symmetric metric connection and to show that M admits quarter symmetric metric connection. Further it is proved that the second fundamental forms σ and σ with respect to LeviCivita connection and quarter symmetric metric connection coincide. Also it is shown that if the second fundamental f...

The Connection Machine Model CM-5 Supercomputer is a massively parallel computer system designed to ooer performance in the range of 1 teraaops (10 12 oating-point operations per second). The CM-5 obtains its high performance while ooering ease of programming, exibility, and reliability. The machine contains three communication networks: a data network, a control network, and a diagnostic netwo...

Vector prefix and reduction are collective communication primitives in which all processors must cooperate. We present two parallel algorithms, the direct algorithm and the split algorithm, for vector prefix and reduction computation on coarse-grained, distributed-memory parallel machines. Our algorithms are relatively architecture independent and can be used effectively in many applications su...

It is generally agreed that memory requirements should be taken into account in the scheduling of parallel jobs. However, so far the work on combined processor and memory scheduling has not been based on detailed information and measurements. To rectify this problem, we present an analysis of memory usage by a production workload on a large parallel machine, the 1024-node CM-5 installed at Los ...

In this paper we show some important randomization techniques for the parallel processing of discrete problems. In particular, we present several parallel randomized algorithms frequently used for sorting, packet routing, shortest paths problems, matching problems, depth rst search, minimum cost spanning trees, and maximal independent set problems. We also discuss the connection between randomi...

This paper describes the procedure used to create a queueing model for servers which are currently in parallel connection with different dispatch probabilities. The system response time of parallel Web servers is improved by calculating dispatch probabilities. The system response time is calculated first. The equation for the lowest system response time is obtained by adjusting the equation to ...

We develop a new model of a spinning particle in Brans-Dicke space-time using a metric-compatible connection with torsion. The particle's spin vector is shown to be Fermi-parallel (by the Levi-Civita connection) along its worldline (an autoparallel of the metric-compatible connection) when neglecting spin-curvature coupling.

We show that a 7-dimensional non-compact Ricci-flat Riemannian manifold with Riemannian holonomy G2 can admit non-integrable G2 structures of type R⊕S 2 0 (R )⊕R in the sense of Fernández and Gray. This relies on the construction of some G2 solvmanifolds, whose Levi-Civita connection is known to give a parallel spinor, admitting a 2-parameter family of metric connections with non-zero skew-symm...

This paper reports the state of development of PThomas, a network based document retrieval system implemented on a massively parallel fine-grained computer, the Connection Machine. The program is written in C*, an enhancement of the C programming language which exploits the parallelism of the Connection Machine. The system is based on Oddy’s original Thomas program, which was highly parallel in...

We study almost Kähler manifolds whose curvature tensor satisfies the second curvature condition of Gray (shortly AK 2). This condition is interpreted in terms of the first canonical Hermitian connection. It turns out that this condition forces the torsion of this connection to be parallel in directions orthogonal to the Kähler nullity of the almost complex structure. We prove a local structure...