💾 Archived View for complete.org › one-to-many-with-filespooler captured on 2024-08-24 at 23:36:52. Gemini links have been rewritten to link to archived content

View Raw

More Information

⬅️ Previous capture (2024-08-18)

-=-=-=-=-=-=-

One-To-Many with Filespooler

In some cases, you may want to use Filespooler[1] to send the data from one machine to many others. An example of this could be using gitsync-nncp over Filespooler[2] where you would like to propagate the changes to many computers.

1: /filespooler/

2: /gitsync-nncp-over-filespooler/

This setup is quite easy with Filespooler. All you need to do is transport the queue files to each destination. I use NNCP[3]'s multicast areas support (see Using Filespooler over NNCP[4] for details about NNCP with Filespooler) for this, but you could really use any transport.

3: /nncp/

4: /using-filespooler-over-nncp/

Since each receiving machine maintains its own queue and sequence file, ordering is preserved on each one.

For a different topology, see Many-To-One with Filespooler[5].

5: /many-to-one-with-filespooler/

--------------------------------------------------------------------------------

Links to this note

6: /using-filespooler-over-syncthing/

Filespooler[7] is a way to execute commands in strict order on a remote machine, and its communication method is by files. This is a perfect mix for Syncthing[8] (and others, but this page is about Filespooler and Syncthing).

7: /filespooler/

8: /syncthing/

9: /filespooler/

Filespooler lets you request the remote execution of programs, including stdin and environment. It can use tools such as S3, Dropbox, Syncthing[10], NNCP[11], ssh, UUCP[12], USB drives, CDs, etc. as transport; basically, a filesystem is the network for Filespooler.
Filespooler is particularly suited to distributed and Asynchronous Communication[13].

10: /syncthing/

11: /nncp/

12: /uucp/

13: /asynchronous-communication/

More on www.complete.org

Homepage

Interesting Topics

How This Site is Built

About John Goerzen

Web version of this site

(c) 2022-2024 John Goerzen