💾 Archived View for complete.org › processing-filespooler-queues-without-filespooler captured on 2024-08-24 at 23:41:23. Gemini links have been rewritten to link to archived content

View Raw

More Information

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

Processing Filespooler Queues Without Filespooler

All of the Filespooler[1] examples so far have focused on using `fspl queue-process` to process queue items.

1: /filespooler/

However, you can manually process things also by having Filespooler decode the packet for you. OK, so this isn't technically "without Filespooler" but could be "without Filespooler queues".

This can take one of several approaches:

1. You could use `fspl queue-info` and `fspl queue-payload` to get the metadata and the payload of the queue, respectively, and process it yourself.

2. You could use `fspl stdin-info`, `fspl stdin-payload`, or `fspl stdin-process` to deal with Filespooler-format data that may or may not have ever been written to a Filespooler queue. Note that these methods do not provide for sequenced processing.

You might use these if you have a different layer providing queueing, or have more specialized needs. Consult the Filespooler Reference[2] for more details on these commands.

2: /filespooler-reference/

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

Links to this note

3: /verifying-filespooler-job-integrity/

Sometimes, one wants to verify the integrity and authenticity of a Filespooler[4] job file before processing it.

4: /filespooler/

5: /filespooler/

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

6: /syncthing/

7: /nncp/

8: /uucp/

9: /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