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

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

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

Embedding of cycles and grids in star graphs von 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 …”
Volltext

A topological property of hypercubes: node disjoint paths von 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/, . . ., …”
Volltext

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

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

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

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

Composite routing protocols von 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 …”
Volltext

LR-algorithm: concurrent operations on priority queues von 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 …”
Volltext

Multi-version memory: software cache management for concurrent B-trees von 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 …”
Volltext

Execution replay on distributed memory architectures von 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 …”
Volltext

Energy complexity of optical computations von 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 …”
Volltext

An optimal algorithm for guaranteeing sporadic tasks in hard real-time systems von 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 …”
Volltext

The complexity of processing tree queries in distributed databases von 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 …”
Volltext

Deterministic load balancing in computer networks von 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, …”
Volltext

Correct two-phase and one-phase deadlock detection algorithms for distributed systems von 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 …”
Volltext

A broadcast/reduce architecture for high-speed data compression von 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 …”
Volltext

Algorithms for end-to-end scheduling to meet deadlines von 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 …”
Volltext

A parallel architecture for data compression von 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 …”
Volltext

Scheduling tasks with AND/OR precedence constraints von 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 …”
Volltext

Parallel dynamic programming von 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 …”
Volltext

Decentralized decision-making in adaptive task sharing von Rotithor, H.G., Pyo, S.S.

“… Adaptive task sharing in a distributed computing system involves system state elimination and decision-making under uncertainty. The paper presents …”
Volltext