Abstract: A cache system, having cache sets, a connection to a line identifying an execution type, a connection to a line identifying a status of speculative execution, and a logic circuit that can: allocate a first subset of cache sets when the execution type is a first type indicating non-speculative execution, allocate a second subset when the execution type changes from the first type to a second type indicating speculative execution, and reserve a cache set when the execution type is the second type. When the execution type changes from the second to the first type and the status of speculative execution indicates that a result of speculative execution is to be accepted, the logic circuit can reconfigure the second subset when the execution type is the first type; and allocate the at least one cache set when the execution type changes from the first to the second type.

Abstract: A system and method for preventing inefficient recalls in a hierarchical storage management (HSM) system are presented. Difference data may be received for updating a target file stored in a first storage system having at least an upper storage layer and a lower tape layer. The difference data may be stored in a stub file located on the upper storage layer and corresponding to the target file in the first storage system located on the lower tape layer. A recall operation may be executed that copies the target file from the lower tape layer to the upper storage layer. The difference data stored in the stub file may be copied to the target file copied onto the upper storage layer from the lower tape layer according to one or more predetermined events.

Abstract: For balanced partition placement in a distributed database, a first node in a set of nodes is identified, at an application executing using a processor and a memory, for a first primary partition of the distributed database, such that the primary partition and a first replica corresponding to the primary partition reside on different nodes in the set of nodes. A second node in the set of nodes is selected to place the first replica such that the second node does not include a second replica of a second primary partition, wherein the first primary partition and the second primary partition are co-resident on the first node. The first primary partition is placed on the first node and the first replica is placed on the second node.

Abstract: A storage system according to certain embodiments includes a client-side signature repository that includes information representative of a set of data blocks stored in primary storage. During restore operations, the system can use the client-side signature repository to identify data blocks located in primary storage. The system can also use the client-side signature repository to identify multiple locations within primary storage where instances of some of the data blocks to be restored are located. Accordingly, during a restore operation of one client computing device, the system can source a data block to be restored to the client computing device from another client computing device that is in primary storage.

Abstract: Embodiments presented herein describe techniques for deduplicating chunks of data across multiple clusters. A process executing in a storage system identifies one or more chunks in an incoming stream of data. For each chunk, a first fingerprint corresponding to the chunk is generated. The process determines whether the first fingerprint matches a second fingerprint listed in a corresponding entry in a deduplication map. Each entry of the deduplication map corresponds to a chunk stored in a location in one of the storage clusters. Upon determining that the first fingerprint matches the second fingerprint, the process writes, to a local persistent storage, a pointer referencing the location in that storage cluster.

Abstract: A computer-implemented method according to one embodiment includes identifying a request to create a consumer within a converged system, defining the consumer within a hierarchy of consumers, where the consumer represents a function in an organization, setting a storage capacity attribute for the consumer, and conditionally defining a data volume for the consumer, based at least in part on the storage capacity attribute.

Abstract: An apparatus obtains a set of content-based signatures for respective data pages of at least a portion of at least one storage volume replicated from a source storage system to a target storage system, issues a write for the set of content-based signatures to the target storage system, and reads from a designated location in the target storage system information indicating for each of the content-based signatures whether or not the corresponding data page is present in the target storage system. For one or more data pages not present in the target storage system, the apparatus writes the one or more data pages to respective logical addresses of the replicated storage volume in the target storage system. The issuing of a write, the reading from the designated location, and the writing of the one or more data pages are illustratively performed utilizing respective commands of a standard storage command protocol.

Abstract: Described herein is a method for tracking changes made by an application. Embodiments include determining, by a processor, a write-back of a cache line from a hardware unit associated with a socket of a plurality of sockets to a page table entry of a page table in a memory location associated with the processor. Embodiments include adding, by the processor, the cache line to a list of dirty cache lines. Embodiments include, for each respective cache line in the list of dirty cache lines, identifying, by the processor, a memory location associated with a respective socket of the plurality of sockets corresponding to the respective cache line and updating, by the processor, an entry of a page table replica at the memory location based on the respective cache line.

Abstract: A computer-implemented method for efficiently accessing a secondary storage in highly available clustered storage environment may include receiving a client-initiated data request at a secondary server coupled to a secondary storage; determining request information about the client-initiated data request; determining with the secondary server whether to process the client-initiated data request on the secondary storage based on the determined request information; and responsive to determining that the secondary server should process the client-initiated data request, processing the client-initiated data request by the secondary server to retrieve data from the secondary storage.

Abstract: An apparatus comprises a processing device configured to identify a snapshot lineage comprising snapshots of a given set of storage volumes, the snapshot lineage comprising (i) a local snapshot lineage stored on a storage system and (ii) a cloud snapshot lineage stored on cloud storage of a cloud external to the storage system. The processing device is also configured to select a snapshot to recover from the cloud snapshot lineage to the storage system, to create a set of new storage volumes on the storage system, to generate a recovery map linking each of a set of cloud storage volumes on the cloud storage that comprises data of the selected snapshot to at least one of the new storage volumes, and to recover the selected snapshot from the cloud snapshot lineage by copying data from the set of cloud storage volumes to corresponding linked ones of the new storage volumes.

Abstract: A hybrid memory system provides rapid, persistent byte-addressable and block-addressable memory access to a host computer system by providing direct access to a both a volatile byte-addressable memory and a volatile block-addressable memory via the same parallel memory interface. The hybrid memory system also has at least a non-volatile block-addressable memory that allows the system to persist data even through a power-loss state. The hybrid memory system can copy and move data between any of the memories using local memory controllers to free up host system resources for other tasks.

Abstract: Techniques for managing dynamically scalable virtualized compute instances within a provider network are described. A dynamically scalable instance has a baseline performance level and a maximum performance level associated with a computing resource, such as a processor, a memory, a network interface, etc. In response to receive a request to launch a dynamically scalable instance, one or more services select a computer system to host the requested instance from a pool of instance-hosting computer systems of a provider network. The instance-hosting computer systems include a monitoring agent that reports computing resource usage data to the one or more services. The one or more services monitor the resource usage of the instance-hosting computer systems and migrate instances so that the dynamically scalable instances can operate up to the maximum level of performance.

Abstract: A method, apparatus, system, and computer program product for managing a storage system. Data associated with a set of tags is identified by a computer system using a policy, wherein the policy defines the set of tags for a set of types of data used in a process performed in an organization using data in the storage system. A set of storage tiers for the data associated with the set of tags is determined by the computer system using the policy. The policy defines the set of storage tiers for the data associated with the set of tags when the data associated with the set of tags is used by the process. The data associated with the set of tags is moved by the computer system to the set of storage tiers as determined using the policy.

Abstract: Disclosed herein are system, method, and computer readable device embodiments for parallel replication of databases across row-store and column-store table formats. An embodiment operates by maintaining a replication log and a storage-level recovery log formatted according to separate respective log formats, logging a record-level SQL execution result, and replicating at least one database table from a primary server to at least one replica server. The primary server and the at least one replica server may each be configured to store data according to one table format of a row-store table format and a column-store table format, such that the primary server's table format is different from the at least one replica server's table format.

Abstract: The invention provides a memory apparatus including a memory cell array and a hierarchical error correction code (ECC) layer. The hierarchical ECC layer, includes N layers of ECC coder-decoder, wherein the hierarchical ECC layer enables one of the N layers to operate an encoding or decoding operation on processed data, and the hierarchical ECC layer enables another one of the N layers merely when the error bit number of the processed data reaches to N?1 pre-set error correction number(s), and N is a positive integer larger than 1.

Abstract: Logical mirroring of an initiator server running a memory aware file system to a multi-tiered target server by receiving at a first tier of the target server data that was modified at the initiator server and retaining at the first tier of the target server a first subset of the data and moving to a second tier of the target server a second subset of the data to efficiently utilize the multi-tiered target server.

Abstract: Disclosed is a computer-implemented method to increase the speed of extent migration. The method comprises determining a plurality of extents to migrate. The extents are stored in a source tier and the source tier is one tier of a tiered storage system. The method also comprises forming a first queue, wherein the first queue contains the plurality of extents to be migrated. The method further includes selecting a first extent to copy to a target tier. The copying comprises dividing the extent into a plurality of strides, forming a second queue containing the strides, selecting and copying the first stride, and removing the first stride from the second queue. The method further comprises changing a mapping table to point to the target tier, removing the first extent from the first queue, and releasing the first area of the first tier.

Abstract: A computing device includes a volatile memory that includes a first cache, a non-volatile storage that includes a second cache, and a cache service. The cache service, responsive to a cache miss, retrieves that asset and writes that asset to the first cache and not the second cache. The cache service reads the asset from the first cache responsive to requests for the asset until the asset is evicted from the first cache or until the asset is promoted to the second cache. The cache service promotes the asset to the second cache upon determining that a set of one or more criteria are satisfied including a predefined number of cache hits for the asset when it is in the first cache. The cache service reads the asset from the second cache responsive to requests for the asset until the asset is evicted from the second cache.

Abstract: Systems for rule-based data protection of virtualized computing entities. A method embodiment commences upon receiving specification parameters that correspond to one or more data protection schemes or data protection configurations such as schemes for making backups or snapshots. Based on the specification parameters and the data protection configurations, one or more resource entities associated with the data protection configurations are identified. Each of the resource entities are accessed and one or more applicable data protection administration rules that correspond to the respective resource entities are applied. The resource entities might be organized hierarchically. Determination of which data protection administration rules are applicable to the resource entities is based on the type of resource entity being considered. The combination of the resource entity type and respective applicable rules is used to generate entity-specific data protection commands.

Abstract: A system for performing auto-tiering is disclosed. The system may include a plurality of storage devices offering a plurality of resources and organized into storage tiers. The storage devices may store data for virtual machines. A receiver may receive I/O commands and performance data for the virtual machines. A transmitter may transmit responses to the I/O commands. An auto-tiering controller may select storage tiers to store the data for the virtual machines and may migrate data between storage tiers responsive to the performance data. The selection of the storage tiers may optimize the performance of all virtual machines across all storage tiers, factoring the change in performance of the virtual machines and a migration cost to migrate data between storage tiers.

Abstract: Mechanisms for efficient discovery of storage resources in a Rack Scale Architecture (RSA) system and associated methods, apparatus, and systems. A rack is populated with pooled system drawers including pooled compute drawers and pooled storage drawers communicatively coupled via input-output (IO) cables. Compute nodes including one or more processors, memory resources, and optional local storage resources are installed in the pooled compute drawers, and are enabled to be selectively-coupled to storage resources in the pooled storage drawers over virtual attachment links. During a discovery process, a compute node determines storage resource characteristics of storage resources it may be selectively-coupled to and the attachment links used to access the storage resources. The storage resource characteristics are aggregated by a pod manager that uses corresponding configuration information to dynamically compose compute nodes for rack users based on user needs.

Abstract: A method, computer program product, and computing system for identifying, at the computing device, one or more cache pages in a cache system. One or more cache pages may be refactored into one or more cache units within the one or more cache pages. A plurality of parallel IO requests may be executed on the one or more cache units within the one or more cache pages.

Abstract: A system and method for distributing data over a plurality of remote storage nodes. Data are split into segments and each segment is encoded into a number of codeword chunks. None of the codeword chunks contains any of the segments. Each codeword chunk is packaged with at least one encoding parameter and identifier, and metadata are generated for at least one file and for related segments of the at least one file. The metadata contains information to reconstruct from the segments, and information for reconstructing from corresponding packages. Further, metadata are encoded into package(s), and correspond to a respective security level and a protection against storage node failure. A plurality of packages are assigned to remote storage nodes to optimize workload distribution. Each package is transmitted to at least one respective storage node as a function iteratively accessing and retrieving the packages of metadata and file data.

Abstract: Implementations of the present disclosure relate to a method, system and computer program product for managing a storage system. Specifically, in one implementation of the present disclosure, there is provided a method for managing a storage system. The method comprises: obtaining topological information of a storage device in a first tier and a storage device in a second tier in the storage system; obtaining a storage rule specifying storage of a data object in the storage device in the first tier or the storage device in the second tier; and in response to determining the storage rule conforming to the topological information, managing the data object in the storage system according to the storage rule. In other implementations of the present disclosure, there is provided a corresponding system and computer program product.

Abstract: Various systems and methods for computer memory management are described herein. A system for computer memory management includes a first memory device including a mapping table; a second memory device including a staging area; a third memory device including a dedup data region; and a controller operable to: receive a memory access request, the memory access request including an address and data; write the data to the staging area; and update the mapping table with the address.

Abstract: A storage controlling apparatus, includes: a memory configured to store a program; and a processor configured to control a plurality of storage devices based on the program, wherein the processor: collects information relating to a data access performed for the plurality of storage devices; and decides performance degradation of a first storage device from among the plurality of storage devices based on a response achievement time period for a first data access request performed for the first storage device, and a response time period average value and a response time period standard deviation which are calculated based on response achievement time periods with respect to a plurality of data access requests performed for the first storage device before the first data access request.

Abstract: A computer-implemented method for utilizing cloud storage as a rank comprises allocating storage space on one or more cloud storage devices via a cloud interface; mapping the allocated storage space to corresponding virtual local addresses; grouping the virtual local addresses to create one or more virtual local ranks from the allocated storage space on the one or more cloud storage devices; converting local data access requests for the one or more virtual local ranks to cloud data access requests configured for the cloud interface; and communicating the cloud data access requests to the one or more cloud storage devices via the cloud interface.

Abstract: Host aware storage tiering including receiving, by a storage controller on a storage server, a disconnect signal indicating an end of a first client session for a client, wherein the first client session comprises accesses to a plurality of data blocks on the storage server; determining, by the storage controller, that at least one data block of the plurality of data blocks was moved to a first tier storage during the first client session; storing, by the storage controller, an indication that the at least one data block was moved to the first tier storage; receiving a connect signal indicating a beginning of a second client session for the client; and moving, in response to the connect signal, the at least one data block into the first tier storage.

Abstract: Processing within a computing environment that supports pageable guests is facilitated. Processing is facilitated in many ways, including, but not limited to, associating guest and host state information with guest blocks of storage; maintaining the state information in control blocks in host memory; enabling the changing of states; and using the state information in management decisions. In one particular example, the guest state includes an indication of usefulness and importance of memory contents to the guest, and the host state reflects the ease of access to memory contents. The host and guest state information is used in managing memory of the host and/or guests.

Abstract: Methods and systems for implementing network-aware caching are disclosed. Respective performance characteristics are determined for accessing a plurality of storage locations from a client computing device. The storage locations comprise one or more shared network-access storage locations accessible to the client computing device over a network and optionally one or more dedicated storage locations of the client computing device. One of the storage locations is selected for storing data to which access is requested by the client computing device. The selected storage location is determined based on the respective performance characteristics of the storage locations. The data is cached in the selected storage location.

Abstract: One or more techniques and/or computing devices are provided for data synchronization. For example, an in-flight log may be maintained to track storage operations that are received by a first storage node, but have not been committed to both first storage of the first storage node and second storage of a second storage node that has a replication relationship, such as a disaster recovery relationship, with the first storage node. A dirty region log may be maintained to track regions within the first storage that have been modified by storage operations that have not been replicated to the second storage. Accordingly, a catchup synchronization phase (e.g., asynchronous replication by a resync scanner) may be performed to replicate storage operations (e.g., replicate data within dirty regions of the first storage that were modified by such storage operations) to the second storage until the first storage and the second storage are synchronized.

Abstract: A method for efficiently managing extents of backup volumes in a tiered storage system is disclosed. In one embodiment, such a method includes identifying a lifespan associated with a backup volume. The lifespan indicates how long extents of the backup volume are retained in a tiered storage system before being released. The method further assigns a temperature value to the extents that determines where the extents are stored in the tiered storage system. The method utilizes the lifespan to determine the temperature value, where the temperature value is inversely proportional to the lifespan. The method places the extents on tiers of the tiered storage system in accordance with their temperature value, such that higher temperature extents are placed on higher tiers of the tiered storage system, and lower temperature extents are placed on lower tiers of the tiered storage system. A corresponding system and computer program product are also disclosed.

Abstract: Example tiered storage systems, storage devices, and methods provide tier configuration for routing of data commands by peer storage devices. Each tiered storage device is configured to communicate with a plurality of peer storage devices with storage device identifiers. Each storage device is assigned to a performance tier in a tier configuration that determines which host data tier should be stored in the storage media of the storage device, the local performance tier for the storage device. If the local performance tier of the storage device does not match the host data tier for a data command or stored data element when the storage device determines the host data tier, the storage device selectively forwards the host data to another peer storage device with the performance tier that matches the host data tier.

Abstract: One or more storage systems are connected to one or more storage boxes comprising multiple storage devices. Multiple storage areas provided by one or more storage boxes include an allocated area, which is a storage area that is allocated to a virtual volume, and an empty area, which is a storage area that is not allocated to any logical volume. Multiple owner rights corresponding to multiple storage areas are set in one or more storage systems. A storage system having an empty area owner right changes an empty area to the allocated area by allocating the empty area. In a case where a configuration change (a relative change in the number of storage boxes with respect to the number of storage systems) is performed, a first storage system that exists after the configuration change sets, in the first storage system, either more or fewer owner rights than the owner rights, which have been allocated to the first storage system before the configuration change.

Abstract: A distributed storage system stores a storage volume as segments that are allocated as needed and assigned VSIDs according to a monotonically increasing counter. The storage volume may be provisioned by an orchestration layer that manages the storage volumes as well as containers executing executable components of the storage volume. A storage volume may be stored across multiple tiers with a storage node managing on which tier a segment is stored based on a volume tier policy and usage of the segments. The tiering policy may be used to relocate the entire storage volume to a tier, such as a cloud computing platform, after which an application may be restored on the tier. Segments on a tier with built in redundancy may be used as both primary and backup copies.

Abstract: In general the technology includes obtaining a detachable library, where the detachable library includes data files each of which are associated with a library scope identifier (ID). The technology further includes reattaching the detachable library to a node server, assigning a node scope ID and a cluster scope ID to each of the data files in the detachable library, creating a mapping index using the node scope IDs, the cluster scope IDs, and the library scope IDs, where each of mapping index entry in the mapping index is associated with a type, and processing a request from a client using the mapping index, wherein the request includes a cluster scope ID.

Abstract: Provided are systems and methods for managing storage of machine data. In one embodiment, a method can be provided. The method can include receiving, from one or more data sources, raw machine data; processing the raw machine data to generate processed machine data; storing the processed machine data in a data store; and determining an allocated data size associated with the processed machine data stored in the data store, wherein the allocated data size is the size of the raw machine data corresponding to the processed machine data stored in the data store.

Abstract: In described examples, a memory module includes a memory array with a primary access port coupled to the memory array. Error correction logic is coupled to the memory array. A statistics register is coupled to the error correction logic. A secondary access port is coupled to the statistics register to allow access to the statistics register by an external device without using the primary interface.

Abstract: A method may include, in an information handling system comprising a processor and a management controller communicatively coupled to the processor and configured to provide management of the information handling system, executing by the management controller a management application for management of one or more storage resources of the information handling system, determining by the management controller whether one or more processor-attached storage resources are present in the information handling system, wherein the one or more processor-attached storage resources are coupled to the processor by other than a backplane of the information handling system, and responsive to determining that one or more processor-attached storage resources are present, executing by the management controller an adaptable virtual backplane that emulates a physical backplane to the management application as if the physical backplane were interfaced between the management application and the processor-attached storage resources.

Abstract: In one embodiment, a processor comprises a fabric interconnect to couple a first cache agent to at least one of a memory controller or an input/output (I/O) controller; and a first cache agent comprising a cache controller coupled to a cache; and a trace and capture engine to periodically capture a snapshot of state information associated with the first cache agent; trace events to occur at the first cache agent in between captured snapshots; and send the captured snapshots and traced events via the fabric interconnect to the memory controller or I/O controller for storage at a system memory or storage device.

Abstract: A method, computer system, and a computer program product for designing and executing at least one storlet is provided. The present invention may include receiving a plurality of restore operations based on a plurality of data. The present invention may also include identifying a plurality of blocks corresponding to the received plurality of restore operations from the plurality of data. The present invention may then include identifying a plurality of grain packs corresponding with the identified plurality of blocks. The present invention may further include generating a plurality of grain pack index identifications corresponding with the identified plurality of grain packs. The present invention may also include generating at least one storlet based on the generated plurality of grain pack index identifications. The present invention may then include returning a plurality of consolidated objects by executing the generated storlet.

Abstract: A computer-implemented method according to one embodiment includes identifying a storage environment, establishing a baseline associated with input and output requests within the storage environment, monitoring activity associated with the storage environment, comparing the activity to the baseline, and performing one or more actions, based on the comparing.

Abstract: A storage apparatus includes a plurality of storage devices, and a control unit for providing a predetermined storage area of the plurality of storage devices to the host computer as a virtual volume group including one or more virtual volumes. The control unit configures one or more data sets having one or more redundancy levels from the plurality of storage devices, provides a storage area of a storage pool including the plurality of data sets to a part of a storage area of the virtual volume, limits a combination of the storage devices configuring the data sets to be assigned to the virtual volume to a given number of combinations of two combinations or more, uniformly distributes the storage devices, and uses a given number of different combinations of the storage devices to be assigned to the virtual volume in units of the virtual volume group.

Abstract: A computing system comprises at least one processing unit, at least one memory controller in communication with the processing unit, and a main memory in communication with the processing unit through the memory controller. A memory hierarchy of the computing system includes at least one cache, the memory controller, and the main memory. The memory hierarchy is divided into a plurality of memory pools. The main memory comprises a set of memory modules split in ranks each having a rank address defined by a set of rank address bits. Each rank has a set of memory devices comprising one or more banks each having a bank address defined by a set of bank address bits. A plurality of threads execute on the processing unit, and are assigned to the memory pools based on one or more memory partitioning techniques, including bank partitioning, rank partitioning, or memory controller partitioning.

Abstract: Described are techniques for processing I/O operations that may include: issuing, by a process of an application on a host, an I/O operation; tagging the I/O operation with a tag value in accordance with a process name associated with the process that issued the I/O operation; sending the I/O operation from the host to a data storage system; and determining, on the data storage system, an service level objective (SLO) for the I/O operation in accordance with the tag value of the I/O operation. The process name may include a first portion and a second customizable or configurable portion used to distinguish between different instance of the same application process. It may be determined which of multiple time-dependent SLOs for the process name is active and used with the I/O operation based on a receipt or processing time associated with the I/O operation.

Abstract: A method for multiplying a first sparse matrix by a second sparse matrix in an associative memory device includes storing multiplicand information related to each non-zero element of the second sparse matrix in a computation column of the associative memory device; the multiplicand information includes at least a multiplicand value. According to a first linear algebra rule, the method associates multiplier information related to a non-zero element of the first sparse matrix with each of its associated multiplicands, the multiplier information includes at least a multiplier value. The method concurrently stores the multiplier information in the computation columns of each associated multiplicand. The method, concurrently on all computation columns, multiplies a multiplier value by its associated multiplicand value to provide a product in the computation column, and adds together products from computation columns, associated according to a second linear algebra rule, to provide a resultant matrix.

Abstract: Embodiments of the present invention are directed to hot cache line arbitration. An example of a computer-implemented method for hot cache line arbitration includes receiving a request for exclusive access to a cache line from a requestor of a drawer in a processing system. The method further includes bringing the cache line to a local cache of the drawer. The method further includes invalidating copies of the cache line in the processing system. The method further includes loading a remote fetch address register (RFAR) controller on other drawers in the processing system, wherein the RFAR comprises a local pending flag and a remote pending flag.

Abstract: Provided are a computer program product, system, and method for determining storage tiers for placement of data sets during execution of tasks in a workflow. A representation of a workflow execution pattern of tasks for a job indicates a dependency of the tasks and data sets operated on by the tasks. A determination is made of an assignment of the data sets for the tasks to a plurality of the storage tiers based on the dependency of the tasks indicated in the workflow execution pattern. A moving is scheduled of a subject data set of the data sets operated on by a subject task of the tasks that is subject to an event to an assigned storage tier indicated in the assignment for the subject task subject. The moving of the data set is scheduled to be performed in response to the event with respect to the subject task.

Abstract: Disclosed herein are techniques for managing the performance of a storage system. A subset of a plurality of storage units is associated with a rule that specifies a number of input and output transactions and a number of bits per time unit. The associations are adjusted in accordance with a performance policy and changes in the subset of the plurality of storage units.

Abstract: Integrated circuits that include memory interface and controller circuitry for communicating with external memory are provided. The memory interface and controller circuitry may include a user logic interface, a memory controller, and a physical layer input-output interface. The user logic interface may be operated in a first clock domain. The memory controller may be operated in a second clock domain. The physical layer interface may be operated in third clock domain that is an integer multiple of the second clock domain. The user logic interface may include only user-dependent blocks. The physical layer interface may include memory protocol agnostic blocks and/or memory protocol specific blocks. The memory controller may include both memory protocol agnostic blocks and memory protocol dependent blocks. The memory controller may include one or more color pipelines for scheduling memory requests in a parallel arbitration scheme.