Showing 2 open source projects for "memory profile .net"

View related business solutions
  • Ship Agents Faster Icon
    Ship Agents Faster

    Transform your applications and workflows into powerful agentic systems at global scale.

    Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
    Get Started Free
  • AI-powered service management for IT and enterprise teams Icon
    AI-powered service management for IT and enterprise teams

    Enterprise-grade ITSM, for every business

    Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
    Try it Free
  • 1
    Evio

    Evio

    Fast event-loop networking for Go

    Evio is a Go networking framework built around a high-performance event loop (much like libuv or libevent) but tailored for Go, bypassing the standard net package to make direct epoll/kqueue syscalls on supported OSes for maximum throughput. The library is used where ultra-low latency and high packet rates matter (for example, proxy servers or real-time packet handling). It supports TCP, UDP, and UNIX sockets, multiple address binding, and built-in load balancing across event loops (loops...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    HttpRouter

    HttpRouter

    A high performance HTTP request router that scales well

    HttpRouter is a lightweight high performance HTTP request router (also called multiplexer or just mux for short) for Go. In contrast to the default mux of Go's net/http package, this router supports variables in the routing pattern and matches against the request method. It also scales better. The router is optimized for high performance and a small memory footprint. It scales well even with very long paths and a large number of routes. A compressing dynamic trie (radix tree) structure is used for efficient matching. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next