Home / Knowledge Computational GRID and Metacomputers

Primary document · 25–29 August 2026

Computational GRID and Metacomputers

A concept for federated databases, distributed computing and metacomputer infrastructure.

Materials for the article "Computational GRID and metacomputers"
The first page of the presentation from the package of primary materials.

Brief annotation

About the document

A concept for federated databases, distributed computing and metacomputer infrastructure.

Presentation

Vychislitelnyi_GRID_Metakompyutery_Federativnye_bazy_Bolshie_vychisleniya.pptx

Page — from —
Width

Downloading the document...

For viewing prepared PDF-copy of the presentation. PowerPoint animations and transitions are not played.

Scroll through the pages and change the scale on the viewbar.

EQUILIBRIUM · SFERA · SPECZASHCHITA · ARCHIVE OF HERITAGE

Author: Sokolov Sergey Leonidovich · 29 August 2026

Status: Architectural hypothesis for technical, legal and independent expert verification

02 / MANUAL SOLUTION

Allow 90-day pilot on three autonomous circuits

To check whether it is possible to assemble a temporary metacomputer for the task, perform a calculation next to the data and release the reproduced result - without centralizing the primary arrays.

Main thesis
Don't build another supercomputer. Create a trusted layer that combines disparate power, data, and rules into a managed metacomputer for the duration of a specific task.

ParameterProposal
PerimeterThree independent administrative domains: HPC/CPU, GPU/container circuit and domain data node.
ScriptsClosely related computation; mass ensemble; federated analytics with the transfer of computation to data.
ModeSynthetic, anonymized or specially authorized data; without automatic inclusion of critical production sets.
ResultWorking prototype, policy log, origin manifest, time/value/network exchange measurement and independent protocol.
Decision on the 90th dayGO, CONDITIONAL GO or STOP by pre-approved criteria.

Recommended solution
Approve the design pilot; industrial scaling, real sensitive data and inter-circuit records allow only individual solutions.

03 / PROBLEM AND PURPOSE EFFECT

There are capacities, but they do not form a common managed resource.

Clusters, clouds, accelerators and databases belong to different organizations, use different queues, policies, identifiers and result formats.

  • Break 1. It is difficult to know where CPU, GPU are, memory, network, licenses, and local data.
  • Break 2. Planners manage the site well, but do not see the powers and capabilities of neighboring domains.
  • Break 3. Copying large arrays to the center creates delays, takes, leak risk, and owner dispute.
  • Break 4. Closely related HPC tasks, mass ensembles, and AI loads require different executive circuits.
  • Break 5. A result without a code version, inputs, policies, and environment cannot be independently reproduced.
  • Break 6. Cost, energy, waiting in line, and network egress are often considered separate.

Target effect
Reduce the path from a computational query to a verifiable result, while maintaining local sovereignty of sites and data owners.

04 / TERMS MAP

Four definitions define the limits of the system

ConceptWorking definitionA hard border
Computational GridFederation of resources of different control contours with general rules of identification, detection, routing, start and accounting.Not a single cluster and not a global administrator.
MetacomputerTemporary logic machine, assembled under the task from suitable CPU, GPU, HPC, cloud and edge resources.Does not promise shared memory and low latency between all nodes.
Federated Data LayerCatalog, semantics, policy and execution of permitted requests over offline sources.Not a single world base and not automatic replication of sources.
Large calculationsTasks that exceed the capabilities of a single node or circuit by data, operations, memory, accelerators, or response time.The size is determined by the task profile, not the advertising label.

Criteria GRID are based on the work of Ian Foster: coordination of resources of different administrative domains, open universal protocols and non-trivial quality of service [1–2].

Formula
GRID = TRUST + CATALOGUE + PRIVACY + MARCHRUTIZATION + EXECUTION + TRAINING + PROOF

05 / PRINCIPLES AND INVARIANTS

A federation is strong only with predefined restrictions.

1. Local Sovereignty. The site retains the owner, local planner, quotas, access rules, and the right to refuse.

2. If possible, the code, plan, and allowed projection are moved to the data, not the entire source array.

3. The general layer sees only the required resource card, policy, state and agreed result.

4. Open contracts. canonical descriptions of the task, resource, data and result are separated from the specific product.

5. Different Load Routes. MPI/HPC, HTC, AI/GPU, SQL- federation and streaming tasks are not reduced to one queue.

6. Policy like code tolerance, data zone, deadline, target, egress limit and authority are checked before and during launch.

7. Reproducibility: The result contains versions of code, environment, inputs, parameters, policies, and checksums.

8. Independent verification. the operator does not confirm its own safety and correctness alone.

Invariant
The local outline can reject the task; the general layer does not bypass local policy and does not require a single root access.

06 / PLACE IN ECOSYSTEM

GRID turns an analytical query into a verifiable computational execution

ContourRoleLimit of responsibility
EQUILIBRIUMIt forms a question, scenario, risk model, and outcome requirements.It does not own the source data and does not administer the site.
Computational GridPicks up resources, builds a plan, gets tolerances, starts and controls the task.Does not replace local planners and owners.
System of funds / ECO-PPAEstablishes the project mandate, budget, contract, data and expected outcome.It is not a computing backend.
SPECZASHCHITADeployment, reinforcement, operation, response and cooperation.They don’t do their own work alone.
SFERAParticipants, competencies, use cases, knowledge and feedback.Does not replace the admissions authority and scheduler.
Heritage archiveVersions, origin, access decisions, manifestos, and permitted results.It is not necessary to centralize sensitive sources.

Formula
QUESTION → PASSPORT OF THE TASK → METACOMPUTER → CALCULATION → VERIFICATION → ARCHIVE → NEW CYCLE

07 / TASK ARCHITECTURE

Five planes share powers and flows

1. Trust. Federal identification, attributes, roles, certificates, service accounts, review and decision log.

2. Management. resource catalog, job broker, policy engine, orchestrator, quotas, SLA and adapters to local systems.

3. Calculations. SlurmMPI, HTCondor/workflow, Kubernetes Jobs, GPU/FPGA and other specialized executive contours.

4. Data. domain databases, object and file storages, directories, connectors, pushdown, staging and release projections.

5. Evidence. telemetry, accounting, lineage, checksums, manifestos, independent verification and Heritage Archive.

Separation of flows
The control layer transmits tasks and state; mass data goes through the permitted data path directly between sites or is processed on-site.

Open interfaces reduce vendor binding; local products are connected by adapters [3–4].

08 / CONTOUR OF CONFIDENCE AND MANAGEMENT

Before launch, the system should answer seven questions

QuestionVerified objectGateway Result
Who?User, service, organization, role, attributes.Confirmed identity.
Why?Purpose of processing, project, legal and contractual basis.Authorized appointment.
Huh?Code, container, model, version, dependencies, SBOM.Accepted artefact.
Over what?Dataset ID, data class, owner, permitted projection.Allowed entrances.
Where?Outline, region, hardware profile, trusted area.Permissible accommodation.
How long?CPU/GPU, memory, time, egress, budget, energy.Quota and limits.
What can be released?Aggregates, model, report, artifact, sensitivity.The result policy.

The Zero Trust
Network location is not a sufficient basis of trust. Access is assessed for a specific subject, resource and context, and the decision is enforced at the point of application of the policy [24].

09 / METACOMPUTERS FORMATION

The metacomputer is collected for the duration of the task and then disassembled

  1. The task passport fixes the target, code, data, SLA, limitations, error price and result criteria.
  2. The directory returns compatible sites, software versions, accelerators, network conditions, and data locality.
  3. The broker builds several execution plans and evaluates queue time, data portability, cost, and risk.
  4. Policy engine checks each site, data set, image, authority and valid result.
  5. The orchestrator reserves resources and translates the canonical assignment into Slurm, HTCondor or Kubernetes.
  6. During execution, telemetry, checkpoints, policy events, resource accounting, and lineage are collected.
  7. After verification, the result is issued; temporary credentials are withdrawn, and the staging is cleared by policy.

Limitation
WAN does not turn into a local bus. A closely related MPI problem is usually placed entirely in one low-latency HPC circuit; tasks, data, and results are federalized between sites [10].

10 / LOADING AND MARCHRUTIZATION CLASSES

The right backend is more important than a single universal queue

ClassSignPreferred routeKey metrics
HPC / MPIClose communication, low latency, collective exchanges.Slurm + MPI in one site.Time-to-solution, scaling.
HTC / ensemblesMany independent or loosely coupled launches.HTCondor + DAG/workflow.Set/day, success rate.
AI / GPUAccelerators, large models, containers, data nearby.Kubernetes Jobs or GPU-section Slurm.GPU utilisation, time/age.
Big DataScan/join/aggregation over domain sources.Federated query + pushdown/materialization.Bytes moved, query latency.
Edge / StreamReal time, limited channel, local context.Local execution of + units.Delay, loss of events.
WorkflowA chain of different stages and sites.Orchestrator + checkpoints + lineage.Critical path, repeatability.

Slurm manages resources and queues within the cluster [5–7]; HTCondor optimizes the accumulated amount of calculations over time8–9]; Kubernetes Jobs is one of the backends for completed container tasks [11–13].

11 / FEDERAL DATABASE

The request passes between the contours, the primary data remains with the owner

Catalog. publishes Dataset ID, owner, schema, version, quality, classification, statistics and endpoint without the mandatory publication of the data itself.

Semantics. domain dictionaries and versioned mappings link terms; a single giant scheme is not required.

The request plan. filter, projection, aggregation and allowable join are transferred to the source; the transfer plan and evaluation are checked before launch.

Data path. Arrow Flight/Flight SQL or other gateways transmit allowed large flows; transport does not replace authorization.

Materialization. Agreed derivative sets and results are recorded as versioned snapshots; the sources remain domain-specific.

Record. interdomain OLTP is not considered atomic without a proven distributed commit; local record, idempotent jobs and sagas are preferred.

Rule of admission
Full scan, cross-source cross join and unlimited egress are prohibited by default. First, pushdown, selectivity, result limit and allowable cost [15–19] are proved.

12 / DATA CONTRACT AND ORIGIN

Each entry and result receives a passport, not just a file name

Contract fieldMinimum content
IdentityCanonical dataset_id / result_id, owner, domain, contact, destination.
VersionSchema, snapshot, time slice, checksum, date of relevance.
SemanticsVocabulary terms, units, encodings, time zone, null/collation semantics.
QualityCompleteness, accuracy, allowable omissions, statistics and the date of its updating.
PolicyClass, Target, Subjects, Zones, Term, Egress, Masking, Retention.
InterfaceEndpoint, protocol, query capabilities, pushdown, rate/size limits.
Lineagejob_id/run_id, code, image, parameters, inputs, outputs, conversions.
ReleaseValidator, tolerance, restriction of interpretation, validity period of the result.

Heritage archive
Stores the manifest, versions, access decisions, evidence, and permitted results. Sensitive sources may remain with the owner; the archive retains the reference and origin [20–22].

13 / LIFE CYCLE OF THE TASK

Eight gateways make the launch manageable and controversial

GatewayDecisionObligatory trace
J0 · RequestThere is a question owner and a measurable result.Passport request.
J1 ·The load, data and zone are defined.Class of task and data.
J2 ·Subject and purpose are allowed.Policy decision + basis.
J3 ·Allowable route and backend are selected.Plan, time/price/egress estimates.
J4 ·Quotas, devices, data and window are highlighted.Reservation / allocation IDs.
J5 ·Task within policy and SLA.Telemetry, events, checkpoints.
J6 · VerificationThe result is correct and safe to release.Tests, validator, checksum.
J7 · ArchiveThe chain is reproducible; accesses are revoked.Manifest, lineage, release record.

Fail closed
If there is no mandatory attribute, policy, statistics, signature, validator or exit limit, the task does not move to the next gateway.

14 / SOVEREIGNTY AND SAFETY

Protection is built around the resource, data and output of the result

Identity. Short-lived service credentials, mTLS, trust federation, attributes and quick feedback.

Authorization. policy decision for each call and task; the local point of application does not trust the central solution without verification.

Isolation. separation of tenant/job, sandbox, network policy, protected secrets, signed images, and allowlist artifacts.

Data. classification, minimization, masking, encryption, keys in the local outline and egress control.

Result. check for disclosure, aggregation, line/volume limits, labeling, owner approval.

Supply chain. source code version, SBOM, build signature, scan, provenance and playable image.

Incident. task isolation, credentials recall, preservation of evidence, owner notification and independent review.

Russian Outline
Prior to the pilot, a legal classification of data and systems is required 149-FZ, 152-FZ, 187-FZ and by-laws. This document is not a legal opinion[25–27].

15 / RELIABILITY AND SAFETY

A single domain failure should not become a federation failure.

MalfunctionResponsePilot check
Unavailable PlaygroundRedesign only on a compatible and permitted resource.Artificial domain shutdown.
Network BreakLocal continuation, event buffer, checkpoint or secure stop.Channel restriction/loss of communication.
Node failureStep repeat, recovery from checkpoint, idempotency.Kill node / pod / task.
Expired admissionNew policy decision; without it, stop and recall.Revocation of role during the assignment.
Changed schemeFail fast or versioned adapter; record the fact of incompatibility.Controlled schema drift.
Unreliable resultQuarantine, repeat, independent inspection and release ban.Fault injection / corrupted output.
Control plane failureBackup status; local jobs do not get new privileges.Restarting the orchestrator.

Formula
RELIABILITY = IDEMPOTENCE + CHECKPOINT + LOCALIZATION OF THE CANCEL + OBSERVATION + VERIFICATION

16 / OBSERVATION AND RESOURCE ACCOUNTING

A single trace links the question, plan, launch, data, and result

SignalWhat to MeasureManagement sense
Tracejob_id/run_id, gateways, adapters, backend, data endpoints.Where there was a delay or rejection.
Metricsqueue time, wall time, CPU/GPU/memory, bytes moved, retries.Efficiency and bottlenecks.
LogsPolicy decisions, planner events, mistakes, manual actions.Investigation and liability.
ProfilesCode resource consumption and hot spots.Optimization of the application.
Accountingresource-time, licenses, egress, energy, site rate.The cost of the task and quota.
Lineageversions of inputs, code, image, parameters and outputs.reproducibility of the result.

Unit of calculation
The account refers to a specific job/run and is confirmed by the local site. The proposed pilot tolerance for the discrepancy between consolidated and local accounting is not more than ±5%.

OpenTelemetry links trades, metrics, and logs through a common context [23]; Slurm supports task and step resource accounting [7].

17 / PILOT TOPOLOGY

Three domains are enough to test the principle of federation

DomainResource and local controlAdapterThe tested hypothesis
A · HPC/CPUSlurm, MPI, parallel to FS, local IAM/QoS.Grid→Slurm.A closely related task remains on one site.
B · GPU/containersKubernetes Jobs or GPU-section Slurm, registry, device plugs.Grid→K8s/Slurm.Selection of accelerator and reproducible image.
C · Data/edgeDomain database/object storage, own policy and gateway.Federated query/Flight.Calculation to data and release of projection.
  • Total layer. Federated identity, catalogs, policy engine, broker, orchestrator, telemetry and lineage.
  • Local layer. Owners retain planners, data, keys, quotas, logs, and right STOP.
  • independent control. Separately checks safety, measurements, reproducibility and GO criteria.

Not included automatically
Critical CII, combat personal data, intercontour OLTP and promise of production SLA. Their connection requires a separate admission.

18 / THREE Scenarios

Pilot checks different computational modes with one rule system

ScenarioRouteVerified result
1. Biosphere Risk Ensemble ModelingHundreds of independent options → HTC; aggregation → HPC/analytical node.Shortening of time-to-first-result, success of repetitions, lineage of each option.
2. GPU-analysis of spatial dataContainer and model to the permitted GPU/data; release mask/unit.Selection of the device, image control, absence of unauthorized source output.
3. Federated water, soil and biodiversity analyticsCatalog → pushdown to domain sources → agreed result.Volume of movement, correctness of semantics, request plan and reproducibility.

Baseline
Prior to integration, each scenario is executed in an existing way. The comparison is built with a fixed base in time, manual labor, bytes moved, cost and quality of the result.

Scenarios are a proposal for approbation, not a statement of performance achieved.

19 / PLAN ON 90 DAYS

Five control stages lead from passport to independent solution

PeriodWorksControl output
Days 1–15Three tasks, baseline, owners, classification of data, boundaries, SLA and STOP-criteria.Pilot Passport and Architectural Solutions.
Days 16–30Domain connectivity, federal identity, resource/data directories, policy model.Three registered nodes and dry tolerances.
Days 31–55Broker, adapters, workflow, telemetry, accounting, lineage and first end-to-end startup.A working prototype and a manifesto of the result.
Days 56–75Repeated runs, load, node failure, network rupture, power withdrawal, egress control.Sustainability and Security Protocol.
Days 76–90Independent verification, reproducibility, cost, runbooks, liability model.Conclusion GO / CONDITIONAL GO / STOP.

Change management
Any extension of data, sites, powers or public promises is issued as a new version of the perimeter and is re-allowed.

20 / KPI AND NOTE CRITERIA

GO requires both functional, safe and economic results

CriterionProposed pilot threshold
FederationConnected ≥3 independent administrative domains; local policies are maintained.
Scripts3 cross-cutting scenarios of different load classes were performed.
ReliabilityAfter stabilization ≥95% Starts without manual recovery.
SpeedFor 2 out of 3 time-to-first-result scenarios, it is better to baseline at least 30%.
Sovereignty0 Unauthorized primary data transfers between circuits.
Policy100% inter-circuit operations are verified and logged.
Lineage100% released results have owner, inputs, code, parameters and versions.
Reproducibility≥90% the test results are repeated in the prescribed tolerance.
ConnectivityNew compatible node connects ≤5 working days according to the instructions.
AccountingDifference between consolidated and local resource/value accounting ≤±5%.
SecurityThere are no unclosed criticisms; there is an independent protocol.

All numerical thresholds are the pilot’s design criteria. They are not an industry standard and are adjusted prior to launch along with the baseline.

21 / RISKS AND MANAGEMENT MODEL

The main risk is to create the appearance of unity where clear boundaries are needed.

RiskEarly SignalControl measure
Global rootThe center requires permanent privileges at all nodes.Short-lived rights, local PEP, role-sharing.
Centralization of dataThe pilot begins by copying all sets.Catalog and pushdown; egress budget; local snapshots.
Universal PlannerThe same policy for MPI, HTC, AI and SQL.Load classification and adapters to the backend.
Semantic ErrorThe names of the fields coincide, but the meaning/units differ.Glossary, mappings, quality checks and versions.
Vendor lock-inThe canonical model repeats API of one product.Open contracts and adapter replacement test.
Hidden costDoes not take into account queue, egress, license, energy.Single job accounting and reconciliation of sites.
Non-reproducibleThe result is released without a snapshot input or code version.J6/J7 fail closed; manifesto required.
Self-checkThe operator alone confirms the security and KPI.Independent validator and acceptance protocol.

STOP-criteria
Unresolved egress, circumvention of local politics, loss of origin, critical vulnerability without compensation or the inability to independently verify the pilot.

22 / SOLUTION AND NEXT

GRID creates a common order of trusted computing, not a common store of resources

Final thesis
The site stores resources, data and rules. GRID adds overall identity, catalog, planning, evidence, and safe release of the result.

GO. all critical criteria are met; the next queue with new nodes and loads is allowed.

CONDITIONAL GO. value is confirmed, but there is a limited list of closing gaps and a deadline for rechecking.

STOP. sovereignty, security, reproducibility or economics are not confirmed; the prototype is archived without industrial expansion.

Next Post GoSubject
InteroperabilityTest of the second product in each class: scheduler, catalog, data transport, observability.
ScaleConnecting new organizations, quotas, multi-level policies, and load modelling.
EconomyTariff units, reservation, cost allocation, energy and dispute mechanism.
Law and TrustFederation agreement, responsibility, certificates, audit, response and exit procedure.

Requested action
Appoint a pilot owner, three domain owners and an independent validator; approve a passport and baseline within 15 days.

23 / OFFICIAL AND PRIMARY SOURCES · 1

GRID, planning and executive contours

[1] Ian Foster: What Is the Grid? A Three Point Checklist

[2] Foster, Kesselman, Tuecke: The Anatomy of the Grid

[3] Open Grid Forum: Standards and interoperability

[4] Open Grid Forum: Authorization Framework (GFD.38)

[5] Slurm Workload Manager: Overview

[6] Slurm Workload Manager: Federation Guide

[7] Slurm Workload Manager: Accounting and Resource Limits

[8] HTCondor: High-Throughput Computing and its Requirements

[9] HTCondor Manual: Job Scheduling

[10] MPI Forum: MPI 5.0 Standard

[11] Kubernetes: Jobs

[12] Kubernetes: Scheduling Framework

[13] Kubernetes: Device Plugins

[14] Globus: Collections and Endpoints

Date of treatment: 29 August 2026 Versions of software products and documents should be re-checked before pilot design.

24 / OFFICIAL AND PRIMARY SOURCES · 2

Federated data, origin, observation and safety

[15] Trino: Concepts and federated catalogs

[16] Trino PostgreSQL connector: Pushdown

[17] PostgreSQL: postgres_fdw Remote Query Optimization

[18] Apache Iceberg: Table Specification

[19] Apache Arrow: Flight RPC and Flight SQL

[20] W3C: Data Catalog Vocabulary DCAT 3

[21] W3C: PROV-O — provenance ontology

[22] OpenLineage: Object Model

[23] OpenTelemetry: Signals and context propagation

[24] NIST SP 800-207: Zero Trust Architecture

[25Federal Law No 149-FZ "On Information, Information Technology and Information Protection"

[26Federal Law No 152-FZ "About personal data"

[27Federal Law No 187-FZ "On the security of critical information infrastructure of the Russian Federation"

Legal references are given for guidance. Applicability of norms, editorial and regulatory requirements is confirmed by specialized lawyers and owners of information systems before data access.

Source materials

Originals and versions of the document

  • Vychislitelnyi_GRID_Metakompyutery_Federativnye_bazy_Bolshie_vychisleniya.docxDOCX · main document
  • Vychislitelnyi_GRID_Metakompyutery_Federativnye_bazy_Bolshie_vychisleniya.pptxPPTX · related version

Other editions in web format

Each version is disclosed separately; the sequence of the source document is saved.

Computational GridVychislitelnyi_GRID_Metakompyutery_Federativnye_bazy_Bolshie_vychisleniya.pptx · web text

Metacomputers, Federal Bases, and Big Computing

General procedure of trusted calculation

Local ownership of resources and data

Sokolov Sergey Leonidovich

The solution now is a limited 90-day pilot

REQUEST FOR SOLUTION

Perimeter

tasks, baseline, data, owners, STOP-criteria

Connection

Identity, directories, policies and adaptors

DAYS

End-to-end launch

HPC, GPU/AI and Federal Analytics

3 Autonomous Domains

3 Load class

1 independent protocol

Tests

node failure, revocation, egress and reproducibility

Decision

GO, CONDITIONAL GO or STOP by measurable KPI

Industrial scaling - only a separate solution

Sokolov Sergey Leonidovich

Isolated capacity does not form a common resource

THE PROBLEM

What breaks the end-to-end calculation

HPC

MPI / CPU / low latency

different identities, queues, quotas and task formats

copy large arrays instead of computing next to data

GPU

AI / Accelerators / Containers

One universal policy for MPI, HTC, AI and SQL

DATA

result without input version, code, environment and access decision

domain databases / objects / edge

separate account of queue, egress, accelerators, energy and cost

Centralization in just one place carries the problem — but does not solve it

Sokolov Sergey Leonidovich

Four definitions define the limits of the system

TERMS

the Federation of Resources of Different Management Circuits

COMPUTER GRID

not a single cluster

temporary logic machine, assembled for the task

METACOMPUTER

not total WAN-memory

catalog, policy and permissioned query over offline sources

FEDERAL DATA SLAY

not a global database

a task beyond the capabilities of a single node or circuit

LARGE COMPUTING

Not an advertising label

GRID = Trust + catalog + Policy + route + execution + Accounting + Proof

Sokolov Sergey Leonidovich

Three invariants keep the federation from centralizing

ARCHITECTURAL PRINCIPLES

Local Sovereignty

Calculating to data

Verified result

The site retains the scheduler, quotas, keys, data, and right STOP.

The code, plan, and permitted projection are moved; the sources remain with the owner.

Versions of inputs, code, environment, policies, and lineage are mandatory.

default deny

policy-as-code

Open contracts

Different backend

independent verification

Sokolov Sergey Leonidovich

GRID connects the question, calculation and proof

LOCATION IN THE ECOSYSTEM

EQUILIBRIUM

GRID

VERIFICATION

ARCHIVE

question, scenario, risk and requirements

plan, resources, tolerances and performance

correctness, safety and release

version, lineage and permitted result

SFERA

SPECZASHCHITA

ECO-PPA / FUNDS

participants, competencies, cases and knowledge

Deployment, operation and response

mandate, contract, budget and expected results

No circuit combines data ownership, execution and final self-testing

Sokolov Sergey Leonidovich

Five planes share powers and flows

TARGET ARCHITECTURE

telemetry · accounting · lineage · Control amounts · Archive

5 · PROOF

catalog · semantics · pushdown · staging · permitted projections

4 · DATA

Slurm/MPI · HTCondor/workflow · Kubernetes Jobs · GPU/edge

3 · COMPUTERING

resource catalog · broker · organizer · policy engine · quotas

2 · GOVERNANCE

identity · Roles · attributes · Certificates · Review · Audit

1 · TRUST

CONTROL PLANE

DATA PLANE

Sokolov Sergey Leonidovich

Metacomputer is going to the task and then disappears

DYNAMIC ASSEMBLY

PASSPORT

CATALOGUE

PLAN

ADDRESS

STARTING

target · code · data · SLA

CPU/GPU · Software · Zone · Queue

Time · Egress · Price · Risk

identity · policy · quota

Slurm · Condor · K8s

IN TIME

telemetry · checkpoints · policy events · resource accounting

AFTER

result check · manifest · rights review · cleaning staging

WAN does not become a local bus: a closely related MPI problem is placed in one low-latency HPC-circuit

Sokolov Sergey Leonidovich

The request passes between the contours - the sources remain

FEDERAL DATA SLAY

Domain A

QUERY + POLICY

Domain B

DB / Object Storage

owner · policy · keys

catalog · semantics · plan

pushdown · egress budget

Permitted projection

unit · snapshot · result

Mandatory inspections

PROHIBITED BY SILENCE

  • statistics and request plan are relevant
  • filter / projection / aggregation are performed at the source
  • transfer volume and result size are limited
  • Semantics of units, time, null and types agreed
  • interdomain record is not assumed to be atomic without proof

full scan

cross-source cross join

unlimited egress

"One World BD"

Sokolov Sergey Leonidovich

Eight locks make the task manageable

LIFE CYCLE

Request

Class

Rights

Plan

who + why + over what + where + how many + what can be released

Archive

Verification

Launch

Reserve

No mandatory attribute, signature, limit or validator - the next gateway is closed

Sokolov Sergey Leonidovich

Safety, observation and reproducibility are uniform

TRUST IN THE RESULT

PROTECTION

OBSERVATION

REPRODUCTIVENESS

identity

short credentials

Local Keys

Isolation

Egress Control

trace

metrics

logs

profiles

accounting

Input snapshot

code version

image and parameters

policy decision

lineage

Russian contour: applicability 149-FZ, 152-FZ, 187-FZ and by-law measures are qualified by the owners of the systems before the data are admitted

Sokolov Sergey Leonidovich

Three Autonomous Domains Test the GRID Principle

PILOT TOPOLOGY

A · HPC / CPU

GRID CONTROL

B · GPU / AI

Slurm · MPI · Local IAM/QoS

catalog · broker · policy · orchestrator

Kubernetes Jobs or GPU-section Slurm

Local owners retain keys, data, quotas and the right to emergency stop

C · DATA / EDGE

Domain DB · Object Storage · Gateway

Independent control: safety · reproducibility · KPI · protocol GO/STOP

Sokolov Sergey Leonidovich

Three scenarios go through five stages in 90 days

PILOT PLAN

Biosphere Ensemble

GPU-space analysis

Water · Soil · biodiversity

HTC + aggregation

container to data

federated query + pushdown

1–15

16–30

31–55

56–75

76–90

Passport

and baseline

Domains

and Policy

Prototype

The First Run

Load

and refusals

verification

and solution

Before integration, each scenario fixes the existing baseline: time · manual labor · bytes moved · cost · quality

Sokolov Sergey Leonidovich

STOP

CRITERIA OF NOTES

GO requires both use, control and reproducibility

  • 3 Domain · 3 script
  • ≥95% successful launches after stabilization
  • −30% time-to-first-result for 2 from 3 Scenario
  • 0 Unauthorized primary data movements
  • 100% operations with policy log and 100% results with lineage
  • Disagreement of Resource Accounting ≤ ±5%

Circumvention of local policy

Unresolved Egress

Loss of Origin of Result

Critical vulnerability without compensation

Impossibility of independent verification

Thresholds: Pilot design criteria, not industry standard

Sokolov Sergey Leonidovich

The next step is to approve the pilot’s passport in 15 days

DECISION

GRID does not create a common store of resources,

a General procedure for trusted computing

Appointing a Pilot Owner

Identify the owners of three domains

Appoint an independent validator

Approve tasks, baseline and STOP-criteria

Proposed solution: allow a design pilot without industrial clearance

Sokolov Sergey Leonidovich

Sources indicated in the presentation 22
  • https://www.mcs.anl.gov/~itf/Articles/WhatIsTheGrid.pdf
  • https://arxiv.org/abs/cs/0103025
  • https://csrc.nist.gov/pubs/sp/800/207/final
  • https://slurm.schedmd.com/overview.html
  • https://htcondor.readthedocs.io/en/latest/overview/high-throughput-computing-requirements.html
  • https://kubernetes.io/docs/concepts/workloads/controllers/job/
  • https://ogf.org/ogf/doku.php/standards/standards.html
  • https://docs.globus.org/guides/overviews/collections-and-endpoints/
  • https://www.w3.org/TR/prov-o/
  • https://openlineage.io/docs/spec/object-model/
  • https://www.mpi-forum.org/docs/mpi-5.0/mpi50-report.pdf
  • https://kubernetes.io/docs/concepts/extend-kubernetes/compute-storage-net/device-plugins/
  • https://trino.io/docs/current/overview/concepts.html
  • https://trino.io/docs/current/connector/postgresql.html#pushdown
  • https://www.postgresql.org/docs/current/postgres-fdw.html#POSTGRES-FDW-REMOTE-QUERY-OPTIMIZATION
  • https://arrow.apache.org/docs/format/Flight.html
  • https://iceberg.apache.org/spec/
  • https://opentelemetry.io/docs/concepts/signals/
  • https://pravo.gov.ru/proxy/ips/?docbody=&nd=102108264
  • https://pravo.gov.ru/proxy/ips/?docbody=&nd=102108261
  • https://publication.pravo.gov.ru/document/view/0001201707260023
  • https://slurm.schedmd.com/accounting.html

Source: Vychislitelnyi_GRID_Metakompyutery_Federativnye_bazy_Bolshie_vychisleniya.docx. Published without editorial retelling.

Back to the magazine