In accordance with embodiments, there are provided mechanisms and methods for creating, exporting, viewing and testing, and importing custom applications in a multitenant database environment. These mechanisms and methods can enable embodiments to provide a vehicle for sharing applications across organizational boundaries. The ability to share applications across organizational boundaries can enable tenants in a multi-tenant database system, for example, to easily and efficiently import and export, and thus share, applications with other tenants in the multi-tenant environment.

A method is disclosed for distributed routing data with latencies using relay nodes. The method includes automatically measuring one-way latencies between a plurality of nodes comprising a first node, a second node, and a relay node, producing a first signal associated with a proof of uptime for the relay node, producing a second signal associated with a proof of bandwidth for the relay node, after the proof of uptime and the proof of bandwidth of the relay node are validated, automatically identifying a relayed data routing path from the first node to the second node via the relay node based on the one-way latencies between the plurality of nodes, in response to a command to transfer data from the first node to the second node, and transferring data from the first node to the second node along the relayed data routing path.

VLSI layouts of generalized multi-stage and pyramid networks for broadcast, unicast and multicast connections are presented using only horizontal and vertical links with spacial locality exploitation. The VLSI layouts employ shuffle exchange links where outlet links of cross links from switches in a stage in one sub-integrated circuit block are connected to inlet links of switches in the succeeding stage in another sub-integrated circuit block so that said cross links are either vertical links or horizontal and vice versa. Furthermore the shuffle exchange links are employed between different sub-integrated circuit blocks so that spatially nearer sub-integrated circuit blocks are connected with shorter links compared to the shuffle exchange links between spatially farther sub-integrated circuit blocks. In one embodiment the sub-integrated circuit blocks are arranged in a hypercube arrangement in a two-dimensional plane. The VLSI layouts exploit the benefits of significantly lower cross points, lower signal latency, lower power and full connectivity with significantly fast compilation. The VLSI layouts with spacial locality exploitation presented are applicable to generalized multi-stage and pyramid networks, generalized folded multi-stage and pyramid networks, generalized butterfly fat tree and pyramid networks, generalized multi-link multi-stage and pyramid networks, generalized folded multi-link multi-stage and pyramid networks, generalized multi-link butterfly fat tree and pyramid networks, generalized hypercube networks, and generalized cube connected cycles networks for speedup of s≥1. The embodiments of VLSI layouts are useful in wide target applications such as FPGAs, CPLDs, pSoCs, ASIC placement and route tools, networking applications, parallel & distributed computing, and reconfigurable computing.

VLSI layouts of generalized multi-stage and pyramid networks for broadcast, unicast and multicast connections are presented using only horizontal and vertical links with spacial locality exploitation. The VLSI layouts employ shuffle exchange links where outlet links of cross links from switches in a stage in one sub-integrated circuit block are connected to inlet links of switches in the succeeding stage in another sub-integrated circuit block so that said cross links are either vertical links or horizontal and vice versa. Furthermore the shuffle exchange links are employed between different sub-integrated circuit blocks so that spatially nearer sub-integrated circuit blocks are connected with shorter links compared to the shuffle exchange links between spatially farther sub-integrated circuit blocks. In one embodiment the sub-integrated circuit blocks are arranged in a hypercube arrangement in a two-dimensional plane. The VLSI layouts exploit the benefits of significantly lower cross points, lower signal latency, lower power and full connectivity with significantly fast compilation. The VLSI layouts with spacial locality exploitation presented are applicable to generalized multi-stage and pyramid networks, generalized folded multi-stage and pyramid networks, generalized butterfly fat tree and pyramid networks, generalized multi-link multi-stage and pyramid networks, generalized folded multi-link multi-stage and pyramid networks, generalized multi-link butterfly fat tree and pyramid networks, generalized hypercube networks, and generalized cube connected cycles networks for speedup of s≥1. The embodiments of VLSI layouts are useful in wide target applications such as FPGAs, CPLDs, pSoCs, ASIC placement and route tools, networking applications, parallel & distributed computing, and reconfigurable computing.

Distribution devices are each connected to a single or a plurality of line switching networks and a single or a plurality of packet switching networks, selects either the line switching network or the packet switching network as the distribution destination on the basis of distribution policy information in a case where data to which the service providing device or the calculation device is set as a transmission destination, and transmits the received data to the selected switching network is received, and the distribution device captures the received data on the basis of the aggregation policy information and transmit the data to the service providing device or the calculation device corresponding to the transmission destination of the captured data in a case where data transmitted by the other distribution device is received from the line switching network or the packet switching network.

Distribution devices are each connected to a single or a plurality of line switching networks and a single or a plurality of packet switching networks, selects either the line switching network or the packet switching network as the distribution destination on the basis of distribution policy information in a case where data to which the service providing device or the calculation device is set as a transmission destination, and transmits the received data to the selected switching network is received, and the distribution device captures the received data on the basis of the aggregation policy information and transmit the data to the service providing device or the calculation device corresponding to the transmission destination of the captured data in a case where data transmitted by the other distribution device is received from the line switching network or the packet switching network.

A module unit for connecting a data bus participant to a local bus. The module unit has a first input interface and a first output interface which can be connected to the local bus, a first data connection interface which can be connected to the data bus participant, and a first switch which is adapted so as to assume a first or a second switch state depending on a control input from the data bus participant, connect the first input interface to the first output interface in the first switch state, and connect the first data connection interface to the first output interface in the second switch state.

A module unit for connecting a data bus participant to a local bus. The module unit has a first input interface and a first output interface which can be connected to the local bus, a first data connection interface which can be connected to the data bus participant, and a first switch which is adapted so as to assume a first or a second switch state depending on a control input from the data bus participant, connect the first input interface to the first output interface in the first switch state, and connect the first data connection interface to the first output interface in the second switch state.

A technique includes receiving, by a user device from a base station, a first message indicating a plurality of sets of uplink control channel resources for the uplink transmission of a type of uplink control information, each set of uplink control channel resources having a resource configuration; receiving, by the user device from the base station, a second message that is different from the first message, the second message indicating a selected uplink control channel resources, of the plurality of sets of uplink control channel resources, for the uplink transmission of a type of uplink control information; and sending, by the user device to the base station, uplink control information via the selected set of uplink control channel resources.

A method and apparatus of a network element that processes a packet in the network element is described. In an exemplary embodiment, the network element receives a data packet that includes a destination address. The network element receives a packet, with a packet switch unit, wherein the packet was received by the network element on an ingress interface. The network element further determines if the packet is to be stored in an external queue. In addition, the network element identifies the external queue for the packet based on one or more characteristics of the packet. The network element additionally forwards the packet to a packet storage unit, wherein the packet storage unit includes storage for the external queue. Furthermore, the network element receives the packet from the packet storage unit and forwards the packet to an egress interface corresponding to the external queue.