Search Results for "memory pool"
Sort By:
Showing 3 open source projects for "memory pool"
View related business solutions-
$300 Free Credits to Build on Google CloudStart your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
-
Ship Agents FasterGemini 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.
-
1
Open Crypto Tracker
Bitcoin Alts portfolio tracker, email / text / alexa / telegram alerts
100% FREE / open source / PRIVATE cryptocurrency portfolio tracker. Email / text / alexa / telegram price alerts, price charts, mining calcs, leverage / gain / loss / balance stats, news feeds +more. Privately track Bitcoin / Ethereum / unlimited cryptocurrencies. Customize as many assets / markets / alerts / charts as you want. Over 50 Exchanges / 40 Trading Pairs Supported (exchanges / pairings list at bottom of README.txt): https://tinyurl.com/ct-readme Nearly Unlimited Assets... -
2
twemproxy
A fast, light-weight proxy for memcached and redis
twemproxy (pronounced "two-em-proxy"), aka nutcracker is a fast and lightweight proxy for memcached and redis protocol. It was built primarily to reduce the number of connections to the caching servers on the backend. This, together with protocol pipelining and sharding enables you to horizontally scale your distributed caching architecture. Fast and lightweight. Maintains persistent server connections. Keeps connection count on the backend caching servers low. Enables pipelining of requests... -
3
The project will develop an in – memory object cache utilizing the LRU (least-recently-used) algorithm. The cache will store the objects that are most accessed within a fixed size memory pool. Thus system is keep statistics and calculates tradeoffs.
- Previous
- You're on page 1
- Next
