Abstract: A method includes receiving a netlist for a chip including a bus and determining, by one or more processors and based on the netlist, a first routing topology for the bus and through a routing region of the chip by comparing a demand of the bus to a capacity of a plurality of cells of the routing region. The method also includes generating a layout for the chip based on the first routing topology.

Abstract: A method includes receiving a netlist for a chip including a bus and determining, by one or more processors and based on the netlist, a first routing topology for the bus and through a routing region of the chip by comparing a demand of the bus to a capacity of a plurality of cells of the routing region. The method also includes generating a layout for the chip based on the first routing topology.

Abstract: An exemplary embodiment of a system, method and/or computer program product for creating a fare analytic database, may include: receiving, by at least one processor, fare(s) and fare related data; and creating a graph database of the fare(s) and fare related data; where the creating may include: creating one or more node(s) of the graph database representing at least one component of the fare and fare related data; creating one or more relationship(s) between a plurality of the nodes; and applying at least one property to the node(s) and the relationship(s). A fare analytic engine may further incorporate the database, and the engine may process queries traversing the database for fare and fare related data; and functional programming methods may be used to generate Boolean byte code routines from fare restrictions, according to exemplary embodiments disclosed.

Abstract: An exemplary embodiment of a system, method and/or computer program product for creating a fare analytic database, may include: receiving, by at least one processor, fare(s) and fare related data; and creating a graph database of the fare(s) and fare related data; where the creating may include: creating one or more node(s) of the graph database representing at least one component of the fare and fare related data; creating one or more relationship(s) between a plurality of the nodes; and applying at least one property to the node(s) and the relationship(s). A fare analytic engine may further incorporate the database, and the engine may process queries traversing the database for fare and fare related data; and functional programming methods may be used to generate Boolean byte code routines from fare restrictions, according to exemplary embodiments disclosed.

Abstract: A method and apparatus for determining the propagation delay of a selected net in a circuit design is described. In one exemplary embodiment, a selected net is received, where the selected net includes a plurality of characteristics that represent the physical and/or parasitic parameters of the net. A net is a set of one or more wires that connects a set of circuit junctions between a pair of endpoints of that net. In addition, a simulation is performed on the selected net using the plurality of characteristics. The circuit design system computes the propagation delay for the selected net based on the simulation and makes available the propagation delay of that net. The propagation delay for a net is the delay for a signal traveling between the endpoints of the net.

Abstract: In one embodiment of the invention, an update circuit having a bus driver to drive a bus dynamically receives an update compensation code. The bus driver receives data at a data clock signal. The update compensation code controls impedance matching at the bus driver according to the data. A code generator generates the update compensation code at a base clock signal. The base clock signal is synchronized with the data clock signal. The base clock signal has an update interval and a quiet interval. A distribution ring interface distributes the update compensation code to the update circuit synchronously with the base clock signal.