Tracking metafiles coordinate asynchronous write-backs across clusters, reducing latency while maintaining data consistency during shutdowns.
A resource object factory manages connection factory lifecycles via caching, eliminating serialization overhead that slows server application connections.
An address space field enables PCIe devices to bypass translation logic by setting specific bits.
Segmenting memory controllers into ganged and un-ganged nodes allows dynamic routing of critical applications for reliability and non-critical tasks for speed.
A file sharing server uses cache extents to manage virtual logical unit mappings and reduce dynamic switching overhead.
Virtual clusters partition processor cores and distributed cache slices to reduce access latency and increase memory bandwidth.
Replication engine copies data and metadata to a destination array, eliminating downtime during storage array upgrades.
A die-to-die interconnect protocol transfers control and data words between stacked semiconductor dies via a shared data bus.
Predefined and user-defined storage profiles simplify configuration complexity by optimizing storage allocation for distinct application workloads.
A dynamic category compression method manages order sequences in data storage libraries by resuming and storing compressed states based on elapsed time.
Autonomous volume management eliminates manual maintenance PCs at backup sites, resolving complexity and operational inefficiency.
Banked register determiner identifies specific registers needed during mode switching, accelerating operating system transitions by reducing saved data volume.
A scatter gather cache module pre-fetches and stores SG element context to accelerate logical to physical address translation.
A hierarchical memory architecture uses a concentrator device to separate memory from the Front Side Bus.
Persistent metadata markers identify failed atomic writes in non-volatile solid-state storage, enabling index exclusion during restart recovery.
A transaction manager monitors runtime application behavior to dynamically enable or disable the IsSameRM optimization based on real-time feedback.
Segmented execution contexts extend activity functionality without increasing thread-local storage complexity.
Transaction execution manager arranges logs by execution time to recover data states, eliminating ambiguities during machine failures.
Converts array of structures to uniform memory blocks, reducing page faults and fragmentation in complex interconnectivity.
A high bandwidth write command method coordinates distributed cache invalidation through targeted requests and acknowledgments.
A cascaded interrupt controller architecture transmits priority and source index signals between hierarchical levels.
A flash memory module uses a coherence directory controller to map addresses and send coherency messages for fast data retrieval.
A memory controller architecture assists cache flushing to non-volatile memory using speculative snoops and writes.
A held cache state tracks sharers via data fields to reduce directory memory requirements.
A scripting framework executes business objects with exit nodes containing code snippets in various programming languages.
A controller allocates clusters from one end of the address range while a host allocates from the other, recording data in volatile memory to update the file allocation table.
Using dual port memory as working memory reduces chip size and power consumption while managing host access.
A cache controller selects unlocked memory locations using precalculated offset values to maximize hit rates.
Dynamic interleaving policies adapt to program streams, reducing page thrashing and row switching delays in multiple-bank memories.
A two-phase commit protocol assigns priority ranks to resource managers for ordered transaction execution.
A memory hub data bypass circuit temporarily stores write data to allow read data transfer, preventing collisions and reducing latency on bi-directional buses.
Computes disk block signatures to transfer only unique virtual machine image data, reducing network bandwidth consumption during cross-location synchronization.
A data allocation module assigns database components to physical storage areas based on estimated access frequencies.
A distributed cache management hierarchy designates subset nodes as managers to aggregate access information and control eviction decisions.
A flush mechanism coordinates data availability in shared memory between streaming multiprocessors.
A frame buffer logic manages dirty data notifications from an L2 cache using a page-stream sorter to organize memory addresses by bank page.
A memory controller prefetches data into cache using host access pattern algorithms to optimize tiered storage placement.
A disk array CPU updates firmware by remapping physical storage areas through its translation lookaside buffer.
Comparing instruction fetch reference tags upgrades cache line replacement status, distinguishing repeated accesses from unique ones to optimize eviction.
A multi-node bridge uses a directory to manage cache coherency across system nodes.
Separating the L2 system cache into distinct data and coherency directories resolves size constraints in large shared-memory multiprocessors.
Container space management balances data distribution across drive spindles while minimizing migration time during system expansion.
Time-bounded memory leases prevent deadlocks in large-scale multiprocessor systems by automatically releasing ownership when processes are delayed.
A coherence controller selectively initiates parallel activity for simple requests while blocking complex ones.
Segmenting virtual addresses into prefixed bit fields allows a state machine to program the DMA controller without halving the addressable memory space.
A message consumer automatically downloads required software components based on dependency identification embedded in received messages.
Interconnect circuitry buffers access transactions and performs hazard checks in parallel with snoop operations.