๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Sorting a distributed file in a network

โœ Scribed by Lutz M Wegner

Publisher
Elsevier Science
Year
1984
Weight
709 KB
Volume
8
Category
Article
ISSN
0376-5075

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A time-optimal distributed sorting algor
A time-optimal distributed sorting algorithm on a line network
โœ Atsushi Sasaki ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 87 KB

We have achieved a strict lower time bound of n -1 for distributed sorting on a line network, where n is the number of processes. The lower time bound has traditionally been considered to be n because it is proved based on the number of disjoint comparison-exchange operations in parallel sorting on

File assignment in a computer network
File assignment in a computer network
โœ Derrell V Foster; Lawrence W Dowdy; James E Ames IV ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Elsevier Science โš– 693 KB
Secure parallel file distribution throug
Secure parallel file distribution through a streaming worm network
โœ Michael J. Sheehan ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Institute of Electrical and Electronics Engineers ๐ŸŒ English โš– 299 KB

This paper introduces the novel concept of streaming worms and applies the concept to secure parallel file transfer. A streaming worm (sworm) is a powerful class of software that can replicate itself as well as a chunk of arbitrary payload code on a predetermined set of nodes in a network very quick