LogoLogo
  • Overview
    • Intro
    • Fair Math Actor
      • Fair Math Controller
      • Fair Math VM
      • Setup an Actor
    • Hello (CIFAR) world!
  • FHE Computer
    • Overview
    • Architectural Layers
      • Application Layer
      • Orchestration Layer
      • Verification Layer
      • Execution Layer
      • Data Layer
    • ISA
      • fhe
      • arith
      • tensor
      • polycircuit
    • Operating System
      • Computer State
      • Application
        • Running Applications
        • External Functions
        • Interactive APPS
      • Execution Graph and Tasks
        • Atomic and Composite Instructions
        • Instruction Unrolling
        • Task Dependencies
        • Execution Graph
      • Process
        • Process lifecycle
        • Resource Allocation and Isolation
      • Order Book
        • Matching Mechanism
        • Task Complexity
        • Instruction Complexity
        • Task re-Delegation
      • Context
        • Context Structure
      • FHE Component Repository
    • Fair Math Actors
      • Task State Monitoring
      • Execution Pairs
      • Rewards and Penalties
    • Ethereum Endpoint
    • CIFAR10 App
  • Whitepapers
    • FHE Computer
    • FHERMA
  • FHERMA
  • Resources
    • Computer CLI
    • FHERMA
    • POLYCIRCUIT (CPP)
    • OpenFHE-rs
    • Talks and Podcasts
  • Social
    • Twitter
    • Linkedin
    • Website
    • Github
Powered by GitBook
LogoLogo
On this page
  1. FHE Computer
  2. Operating System

Execution Graph and Tasks

In the Fair Math Computer, a task is the smallest unit of execution managed by the orchestration layer. A task consists of the following components:

  1. Instructions A task includes an ordered set of instructions that define its operations. This set must not be empty.

  2. Variables These are the variables used or created by the instructions in the task.

  3. Metadata Metadata provides additional information about the task, including:

    • Resource requirements (e.g., memory or compute power needed).

    • Estimated complexity of the task.

    • Execution constraints, such as deadlines or specific capabilities required.

A task is valid if it has at least one instruction and all instructions are compatible with the dependencies of the application.

PreviousInteractive APPSNextAtomic and Composite Instructions

Last updated 5 months ago

Page cover image