Reading List
This page is my reading list of various articles on AI and Cloud and some random notes.
# Tools, Libraries, Frameworks
## Omnigent
[Omnigent AI Harness](https://omnigent.ai/)
Omnigent is being used by DataBricks. Its a harness layer, which allows to multiplex models, agents.
[Coding agent from scratch](https://github.com/Camrahd/claud_code)
## Graphs and Context:
(https://adam-slack.medium.com/designing-context-graphs-around-how-organisations-work-part-1-79067ebbb27a)
(https://adam-slack.medium.com/copying-data-into-context-graphs-part-2-27aaa5710a95)
(https://adam-slack.medium.com/context-graphs-knowledge-graphs-and-agent-memory-part-0-948adfacf74b)
Why does the first token from an LLM take longer than the rest?
Every autoregressive LLM response has two distinct phases:
𝗣𝗿𝗲𝗳𝗶𝗹𝗹
The model processes your entire prompt in one parallel pass, building the KV cache for every input token. This is compute-heavy — attention scales with the square of sequence length, so longer prompts mean more work before anything comes out.
𝗗𝗲𝗰𝗼𝗱𝗲
Once the first token is generated, the model produces every subsequent token one at a time, reusing the cached K/V from prefill instead of reprocessing the whole prompt. This is memory-bound rather than compute-bound, so each token after the first is much cheaper.
The gap between sending your prompt and seeing that first token is called 𝗧𝗶𝗺𝗲 𝗧𝗼 𝗙𝗶𝗿𝘀𝘁 𝗧𝗼𝗸𝗲𝗻 (𝗧𝗧𝗙𝗧) — and it exists in every decoder-only model: GPT, Llama, Claude, Qwen, Mistral, all of them. Longer prompts and larger contexts directly translate into longer TTFT, even if decode speed stays constant.
Here’s the part people often miss: 𝗧𝗧𝗙𝗧 doesn’t go away with 𝘀𝗽𝗲𝗰𝘂𝗹𝗮𝘁𝗶𝘃𝗲 𝗱𝗲𝗰𝗼𝗱𝗶𝗻𝗴 either. Speculative decoding speeds up the decode phase — a small draft model proposes several tokens ahead, and the main model verifies them in one batched pass instead of generating strictly one token at a time. That reduces the time to get from token 2 onward. But the very first token still has to come from a full prefill pass over the prompt on the main model. TTFT is a prefill-phase cost; speculative decoding is a decode-phase optimization. They solve different problems.
Practical takeaway for anyone building or serving LLM applications: if you care about responsiveness, look at TTFT and inter-token latency separately. Prompt caching / prefix caching attacks TTFT (by skipping redundant prefill on repeated context). Speculative decoding, batching, and KV cache optimizations attack decode throughput. Conflating the two leads to optimizing the wrong bottleneck
Memory Management in ADK
Production Ready AI Systems1. How to Master ML System Design
→ https://lnkd.in/d89ywdkp
→ Step by step guide (went through it - its good)
2. Stanford MLSys Seminars (playlist)
→ https://lnkd.in/gP3UDqwn
→ How Netflix/Uber actually scale
🔹Interview examples:
1. Spotify ML Question - Design a Recommendation System
→ https://lnkd.in/dr87ADq8
2. Instagram ML Question - Design a Ranking Model
→ https://lnkd.in/dqMxqgNc
🔹 Github Repo:
1. System Design Primer
→ https://lnkd.in/gmAg4nBb
→ Master the patterns that matter
• AGP – Secure gateway between agents and enterprise systems
• Tool Abstraction Protocol – Makes tools structured and callable
• OAP – Open interoperability across frameworks
• RDF-Agent – Knowledge graph–driven semantic reasoning
• AgentOS – Runtime for long-lived enterprise agents
• TDF – Structured task planning and constraints modeling
• FCP – Safe function calling and structured execution
Comments
Post a Comment