Snap inc. (20240296066). ASYNCHRONOUS TASK FRAMEWORK simplified abstract

From WikiPatents
Jump to navigation Jump to search

ASYNCHRONOUS TASK FRAMEWORK

Organization Name

snap inc.

Inventor(s)

Ryan Olson of Seattle WA (US)

ASYNCHRONOUS TASK FRAMEWORK - A simplified explanation of the abstract

This abstract first appeared for US patent application 20240296066 titled 'ASYNCHRONOUS TASK FRAMEWORK

The patent application presents a framework for asynchronous task scheduling in server systems, where tasks are scheduled and performed asynchronously.

  • Tasks are marshalled (converted to bytes) and stored in queues for scheduling.
  • The tasks are retrieved from the queues, unmarshalled (converted back to units of work), and sent to a service for execution.
  • The approach includes transparently brokering HTTP/RPC calls through a high-throughput message queue system.

Potential Applications: - Task scheduling in server systems - High-throughput message queue systems - Automation of task execution in various services

Problems Solved: - Efficient task scheduling and execution in server systems - Handling high volumes of tasks asynchronously

Benefits: - Improved performance and efficiency in task scheduling - Scalability for handling large volumes of tasks - Automation of task execution processes

Commercial Applications: - Cloud computing services - Enterprise task management systems - Communication platforms with automated task handling

Questions about the technology: 1. How does this framework improve task scheduling efficiency in server systems? 2. What are the key advantages of using a high-throughput message queue system for task execution?

Frequently Updated Research: - Stay updated on advancements in asynchronous task scheduling frameworks - Monitor developments in high-throughput message queue systems for task handling.


Original Abstract Submitted

systems, devices, media, and methods are presented that provide an asynchronous task scheduling framework in which tasks are asynchronously scheduled for performance by a server system. scheduling of a task is performed by marshalling the task (units of work converted to bytes) and storing the task in queues and retrieving the task from the queues and unmarshalling the retrieved tasks (bytes to units of work). the unmarshalled task is sent to a service (e.g., an email service) for performance. examples of the approach introduce wrapping a hypertext transfer protocol (http)/remote procedure call (rpc) call and brokering it transparently through a high-throughput message queue system.