Search Results - "Parallel and Distributed Processing, 2nd IEEE Symposium On"

Datarol: a massively parallel architecture for functional languages by Amamiya, M., Taniguchi, R.

“…Proposes a parallel machine architecture which incorporates an ultra-multiprocessing facility for parallel execution of functional programs. The machine…”
Get full text

Embedding of cycles and grids in star graphs by Jung-Sing Jwo, Lakshmivarahan, S., Dhall, S.K.

“…The use of star graphs as a viable interconnection scheme for parallel computers has been examined by a number of authors. An attractive feature of this class…”
Get full text

A topological property of hypercubes: node disjoint paths by Madhavapeddy, S., Sudborough, I.H.

“…A graph G=(V,E) ( mod V mod >or=2n) satisfies property P/sub n/ if given any 2n distinct vertices s/sub 1/,s/sub 2/, . . ., s/sub n/, g/sub 1/,g/sub 2/, . . .,…”
Get full text

Fault tolerant distributed shared memory algorithms by Stumm, M., Songnian Zhou

“…Distributed shared memory (DSM) has received increased attention as a mechanism for interprocess communication in loosely-coupled distributed systems because…”
Get full text

Dynamic-level scheduling for heterogeneous processor networks by Sih, G.C., Lee, E.A.

“…Dynamic-level scheduling is an effective compile-time scheduling technique which accounts for interprocessor communication overhead when mapping…”
Get full text

Composite routing protocols by Arora, A., Gouda, M., Herman, T.

“…A novel routing protocol for computer networks is designed by combining two routing protocols that adapt to changes in the network topology. The first routing…”
Get full text

LR-algorithm: concurrent operations on priority queues by Ayani, R.

“…The heap representation of priority queues is one of the most widely used methods. However, the conventional implementation tends to be inadequate for parallel…”
Get full text

Multi-version memory: software cache management for concurrent B-trees by Weihl, W.E., Wang, P.

“…The authors describe a new concurrent B-tree algorithm. The algorithm is designed to work well in large-scale parallel or distributed systems in which the…”
Get full text

Execution replay on distributed memory architectures by Leu, E., Schiper, A., Zramdini, A.

“…Debugging parallel programs on MIMD machines is a difficult task because successive executions of the same program can lead to different behaviors. To solve…”
Get full text

Energy complexity of optical computations by Tyagi, A., Reif, J.

“…The paper provides lower bounds on the energy consumption and demonstrates an energy-time trade-off in optical computations. All the lower bounds are shown to…”
Get full text

Correct two-phase and one-phase deadlock detection algorithms for distributed systems by Kshemkalyani, A.D., Singhal, M.

“…The authors propose a correction to the two-phase deadlock detection algorithm, which has been shown to be incorrect. They prove the correctness of the…”
Get full text

Deterministic load balancing in computer networks by Xiaotie Deng, Hai-Ning Liu, Bing Xiao

“…The paper presents theoretical analysis of the deterministic complexity of the load balancing problem (LBP). Because of difficulty of the general problem,…”
Get full text

An optimal algorithm for guaranteeing sporadic tasks in hard real-time systems by Silly, M., Chetto, H., Elyounsi, N.

“…Guaranteeing that time critical tasks will meet their timing constraints is an important aspect of real-time systems research. Indeed, a real time system is…”
Get full text

The complexity of processing tree queries in distributed databases by Chihping Wang

“…Semi-joins have been introduced to reduce the cost of processing distributed queries. The determine the optimal semi-join processing strategy, one must…”
Get full text

Algorithms for end-to-end scheduling to meet deadlines by Bettati, R., Liu, J.W.S.

“…In a multiprocessor or distributed system, jobs may need to be executed on more than one processor. When all the jobs execute on different processors in turn…”
Get full text

A broadcast/reduce architecture for high-speed data compression by Zito-Wolf, R.J.

“…The author presents a parallel architecture for high-speed data compression based on textual substitution using a sliding window. The architecture combines a…”
Get full text

Parallel dynamic programming by Viswanathan, V., Huang, S.-H.S., Hongfei Liu

“…Recurrence formulations for various problems such as finding an optimal order of matrix multiplication, finding an optimal binary search tree and optimal…”
Get full text

A parallel architecture for data compression by Henriques, S., Ranganathan, N.

“…The authors describe a parallel algorithm and architecture for implementing the LZ technique for data compression. Data compression is the reduction of…”
Get full text

Scheduling tasks with AND/OR precedence constraints by Gillies, D.W., Liu, J.W.-S.

“…In traditional precedence-constrained scheduling a task is ready to execute when all its predecessors are complete. Such a task is called an AND task. The…”
Get full text

An optimal parallel minimax tree algorithm by Kirkpatrick, D.G., Przytycka, T.

“…An log n time n/log n processor CREW PRAM algorithm to construct an alphabetic minimax tree is presented. The algorithm achieves these optimal bounds by a…”
Get full text