Abstract: A system, such as a system of a computing resource service provider, tracks infrastructure-level changes to execution environments caused by or otherwise associated with activity associated with executable code. In one embodiment, the activity is associated with development and/or testing of the executable code, and a monitoring service generates a log of changes to the associated infrastructure caused by the activity over a designated period of time. The log of changes is used to generate a template that in turn causes configuration of a target execution environment in accordance with the monitored changes.

Abstract: A method and system for exporting a 3D object in an application to a file having a 3D file format is disclosed. The method includes a receiving a request for exporting a 3D object in an application to a file having a 3D file format where the 3D object includes a plurality of components. Upon receiving the request, the components are examined to determine if any of them are a 2D text component. When it is determined that at least one of the components is a 2D text component, a database may be referenced to identify a text character that corresponds to the 2D text component, before replacing the 2D text component with a corresponding 3D model in the file.

Abstract: An infrastructure floor tile for supporting and positioning a server rack in a datacenter includes a body including top, bottom and side surfaces and a first alignment surface on the top surface. The first alignment surface includes at least one of a projection and a recess. When a server rack is positioned on the first alignment surface of the infrastructure floor tile, the server rack is aligned by the first alignment surface relative to the body. N horizontal channels extend from one of the side surfaces to an opposite one of the side surfaces, where N is an integer greater than one. N vertical channels extending from the top surface of the body to the N horizontal channels, respectively. Power, cooling fluid and/or data lines are connected to the server rack through at least one of the N horizontal channels and at least one of the N vertical channels.

Abstract: An infrastructure floor tile for supporting and positioning a server rack in a datacenter includes a body including top, bottom and side surfaces and a first alignment surface on the top surface. The first alignment surface includes at least one of a projection and a recess. When a server rack is positioned on the first alignment surface of the infrastructure floor tile, the server rack is aligned by the first alignment surface relative to the body. N horizontal channels extend from one of the side surfaces to an opposite one of the side surfaces, where N is an integer greater than one. N vertical channels extending from the top surface of the body to the N horizontal channels, respectively. Power, cooling fluid and/or data lines are connected to the server rack through at least one of the N horizontal channels and at least one of the N vertical channels.

Abstract: Embodiments of the present invention relate to multiple parallel lookups using a pool of shared memories by proper configuration of interconnection networks. The number of shared memories reserved for each lookup is reconfigurable based on the memory capacity needed by that lookup. The shared memories are grouped into homogeneous tiles. Each lookup is allocated a set of tiles based on the memory capacity needed by that lookup. The tiles allocated for each lookup do not overlap with other lookups such that all lookups can be performed in parallel without collision. Each lookup is reconfigurable to be either hash-based or direct-access. The interconnection networks are programed based on how the tiles are allocated for each lookup.

Abstract: Embodiments of the present invention relate to multiple parallel lookups using a pool of shared memories by proper configuration of interconnection networks. The number of shared memories reserved for each lookup is reconfigurable based on the memory capacity needed by that lookup. The shared memories are grouped into homogeneous tiles. Each lookup is allocated a set of tiles based on the memory capacity needed by that lookup. The tiles allocated for each lookup do not overlap with other lookups such that all lookups can be performed in parallel without collision. Each lookup is reconfigurable to be either hash-based or direct-access. The interconnection networks are programmed based on how the tiles are allocated for each lookup.

Abstract: Embodiments of the present invention relate to multiple parallel lookups using a pool of shared memories by proper configuration of interconnection networks. The number of shared memories reserved for each lookup is reconfigurable based on the memory capacity needed by that lookup. The shared memories are grouped into homogeneous tiles. Each lookup is allocated a set of tiles based on the memory capacity needed by that lookup. The tiles allocated for each lookup do not overlap with other lookups such that all lookups can be performed in parallel without collision. Each lookup is reconfigurable to be either hash-based or direct-access. The interconnection networks are programmed based on how the tiles are allocated for each lookup.

Abstract: Embodiments of the present invention relate to multiple parallel lookups using a pool of shared memories by proper configuration of interconnection networks. The number of shared memories reserved for each lookup is reconfigurable based on the memory capacity needed by that lookup. The shared memories are grouped into homogeneous tiles. Each lookup is allocated a set of tiles based on the memory capacity needed by that lookup. The tiles allocated for each lookup do not overlap with other lookups such that all lookups can be performed in parallel without collision. Each lookup is reconfigurable to be either hash-based or direct-access. The interconnection networks are programed based on how the tiles are allocated for each lookup.

Abstract: Embodiments of the present invention relate to multiple parallel lookups using a pool of shared memories by proper configuration of interconnection networks. The number of shared memories reserved for each lookup is reconfigurable based on the memory capacity needed by that lookup. The shared memories are grouped into homogeneous tiles. Each lookup is allocated a set of tiles based on the memory capacity needed by that lookup. The tiles allocated for each lookup do not overlap with other lookups such that all lookups can be performed in parallel without collision. Each lookup is reconfigurable to be either hash-based or direct-access. The interconnection networks are programed based on how the tiles are allocated for each lookup.

Abstract: Embodiments of the present invention relate to multiple parallel lookups using a pool of shared memories by proper configuration of interconnection networks. The number of shared memories reserved for each lookup is reconfigurable based on the memory capacity needed by that lookup. The shared memories are grouped into homogeneous tiles. Each lookup is allocated a set of tiles based on the memory capacity needed by that lookup. The tiles allocated for each lookup do not overlap with other lookups such that all lookups can be performed in parallel without collision. Each lookup is reconfigurable to be either hash-based or direct-access. The interconnection networks are programmed based on how the tiles are allocated for each lookup.

Abstract: Embodiments of the present invention relate to a centralized network analytic device, the centralized network analytic device efficiently uses on-chip memory to flexibly perform counting, traffic rate monitoring and flow sampling. The device includes a pool of memory that is shared by all cores and packet processing stages of each core. The counting, the monitoring and the sampling are all defined through software allowing for greater flexibility and efficient analytics in the device. In some embodiments, the device is a network switch.

Abstract: Embodiments of the present invention relate to multiple parallel lookups using a pool of shared memories by proper configuration of interconnection networks. The number of shared memories reserved for each lookup is reconfigurable based on the memory capacity needed by that lookup. The shared memories are grouped into homogeneous tiles. Each lookup is allocated a set of tiles based on the memory capacity needed by that lookup. The tiles allocated for each lookup do not overlap with other lookups such that all lookups can be performed in parallel without collision. Each lookup is reconfigurable to be either hash-based or direct-access. The interconnection networks are programmed based on how the tiles are allocated for each lookup.

Abstract: A method is disclosed in which a server generates and transmits a reply to a mobile device via a wireless communication link in response to receiving a request from a mobile device. The reply includes first pattern information and data elements retrieved from a logical data model. The mobile device renders a first page on a screen thereof in response to receiving the reply. The first page includes visual representations of the data elements, and the first page presents the visual representations in a first pattern corresponding to the first pattern information.

Abstract: A method, apparatus and system for processing control packets in a routing device by comparing the timestamp of the received packets to an expiry time associated with a first neighbor node in a suspended animation (SA) list and in response to the timestamp being more than the expiry time, removing all the neighbor nodes having an expiry time less than that of the timestamp.

Abstract: A method and system for efficiently processing regular expressions associated with new BGP packets uses the caches results of prior processing of regular expressions associated with a prior matching BGP packet within the same epoch.

Abstract: A method is disclosed in which a server generates and transmits a reply to a mobile device via a wireless communication link in response to receiving a request from a mobile device. The reply includes first pattern information and data elements retrieved from a logical data model. The mobile device renders a first page on a screen thereof in response to receiving the reply. The first page includes visual representations of the data elements, and the first page presents the visual representations in a first pattern corresponding to the first pattern information.

Abstract: A computer receives a schema that lacks information required by a directory access protocol (e.g. LDAP) and automatically generates information that conforms to the directory access protocol and supplies the generated information as output in a new schema. Such automatic schema transformation allows a human who is creating the schema, to enable usage of the directory access protocol to interface with a directory implementing the schema, without knowing the directory access protocol. The computer of some embodiments receives the schema being input, in a predetermined human-readable language (e.g. XML). Hence, an XML developer who lacks knowledge of LDAP can use traditional XML tools to prepare an LDAP-incompatible schema, for use in implementing a directory (e.g. address book) that is accessed by an LDAP client (e.g. cell phone) via an LDAP server. The new schema can be output in any form (e.g. text/binary) and in any language.

Abstract: A method, system, and article of manufacture for querying an implicit hierarchy is disclosed. According to one approach, implicit hierarchies can be queried by accessing the relevant catalog tables for the attribute relevant to the query. Each identified entry in the relevant catalog table is followed through its implied hierarchical chains until all relevant entries have been identified. The catalog table containing the normalized form of the DN for each user can be consulted to identify the entry identifier for each entry corresponding to implicit hierarchy being queried, which can be searched in the appropriate catalog table to search the chain of entries for the implied hierarchy. In an approach, one or more templates may be used to generate a query language statement to perform the query upon the implicit hierarchy.

Abstract: A system, method, computer program and article of manufacture for membership list management is described. A rules-based membership list is built and cached. Any modifications to the member objects are incrementally added to the cache, and are submitted to a change log. Queries access the membership in the cache instead of having to execute the rules to build the list. The change log entries allow membership modification notifications to be sent to any subscribing application.

Abstract: Embodiments of the invention provide a trust framework for governing service-to-service interactions. This trust framework can provide enhanced security and/or manageability over prior systems. Merely by way of example, in some cases, an information store can be used to store information security information (such as trust information, credentials, etc.) for a variety of services across an enterprise. In other cases, the trust framework can provide authentication policies to define and/or control authentication between services (such as, for example, types of authentication credentials and/or protocols are required to access a particular service—either as a user and/or as another service—and/or types of authentication credentials and/or protocols a service may be enabled to use to access another service). Alternatively and/or additionally, the trust framework can provide authorization policies to define and/or control authorization between services.