Skip to content
#edge computing Book Open access

META-COMPUTING

Sep 2026 · Zenodo (CERN European Organization for Nuclear Research)

Abstract

This monograph presents a conceptual and architectural framework for Meta-Computing as a mechanism for adaptive optimization of AI workloads in distributed computing systems. The work proposes a Meta-Computing Architecture (MCA) that integrates runtime observation, meta-level analysis, adaptive control, and continuous feedback to enable computational systems to evaluate and modify their execution strategies during runtime. The monograph introduces the Adaptive Meta-Optimization Algorithm (AMOA), Workload Complexity Index (WCI), Meta-Efficiency Score (MES), and Meta-Computing Feedback Loop (MCFL) as the principal components of the proposed framework. A mathematical model is developed to represent the relationship between computational state, workload complexity, optimization decisions, and feedback-driven adaptation. The proposed framework is evaluated through a simulation-based experimental study using distributed AI workload scenarios of varying complexity. The evaluation compares static execution with the proposed Meta-Computing approach using execution time and meta-efficiency as principal measures. The results indicate improved execution performance under the evaluated simulation conditions, with greater reductions in execution time observed as workload complexity increases. The work is presented as a foundational framework for further research into adaptive, self-optimizing, and increasingly autonomous computing systems. The monograph also identifies the limitations of simulation-based evaluation and discusses future directions including real-world distributed deployment, cloud and edge integration, learning-based meta-optimization, autonomous resource management, and advanced self-aware computing systems.

View source

Similar papers

#computer vision Review Sep 2017

Agile Software Development Methods: Review and Analysis

This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.

P. Abrahamsson, O. Salo, Jussi Ronkainen et al. · 727 citations · ⚡54
#computer vision Jun 2008

The impact of agile practices on communication in software development

The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.

M. Pikkarainen, Jukka Haikara, O. Salo et al. · 401 citations · ⚡48
#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.