| Patent application number | Description | Published |
|---|
| 20100152841 | ADHESION PROMOTING PRIMER FOR COATED SURFACES - An expandable medical device includes a plurality of elongated struts, forming a substantially cylindrical device which is expandable from a first diameter to a second diameter. A plurality of different beneficial agents may be loaded into different openings within the struts for delivery to the tissue. For treatment of conditions such as restenosis, different agents are loaded into different openings in the device to address different biological processes involved in restenosis and are delivered at different release kinetics matched to the biological process treated. The different agents may also be used to address different diseases from the same drug delivery device. In addition, anti-thrombotic agents may be affixed to at least a portion of the surfaces of the medical device for the prevention of sub-acute thrombosis. To ensure that the different agents remain affixed to the device as well as to each other, primer layers may be utilized. | 06-17-2010 |
| 20100161039 | ADHESION PROMOTING TEMPORARY MASK FOR COATED SURFACES - An expandable medical device includes a plurality of elongated struts, forming a substantially cylindrical device which is expandable from a first diameter to a second diameter. A plurality of different beneficial agents may be loaded into different openings within the struts for delivery to the tissue. For treatment of conditions such as restenosis, different agents are loaded into different openings in the device to address different biological processes involved in restenosis and are delivered at different release kinetics matched to the biological process treated. The different agents may also be used to address different diseases from the same drug delivery device. In addition, anti-thrombotic agents may be affixed to at least a portion of the surfaces of the medical device for the prevention of sub-acute thrombosis. To ensure that the different agents remain affixed to the device as well as to each other, masking and de-masking processes may be utilized. | 06-24-2010 |
| 20100280600 | DUAL DRUG STENT - Implantable medical devices may be utilized to locally delivery one or more drugs or therapeutic agents to treat a wide variety of conditions, including the treatment of the biological organism's reaction to the introduction of the implantable medical device. These therapeutic agents may be released under controlled and directional conditions so that the one or more therapeutic agents reach the correct target area, for example, the surrounding tissue and/or the bloodstream. | 11-04-2010 |
| 20100304007 | ADHESION PROMOTING TEMPORARY MASK FOR COATED SURFACES - An expandable medical device includes a plurality of elongated struts, forming a substantially cylindrical device which is expandable from a first diameter to a second diameter. A plurality of different beneficial agents may be loaded into different openings within the struts for delivery to the tissue. For treatment of conditions such as restenosis, different agents are loaded into different openings in the device to address different biological processes involved in restenosis and are delivered at different release kinetics matched to the biological process treated. The different agents may also be used to address different diseases from the same drug delivery device. In addition, anti-thrombotic agents may be affixed to at least a portion of the surfaces of the medical device for the prevention of sub-acute thrombosis. To ensure that the different agents remain affixed to the device as well as to each other, masking and de-masking processes may be utilized. | 12-02-2010 |
| 20110029070 | ADHESION PROMOTING PRIMER FOR COATED SURFACES - An expandable medical device includes a plurality of elongated struts, forming a substantially cylindrical device which is expandable from a first diameter to a second diameter. A plurality of different beneficial agents may be loaded into different openings within the struts for delivery to the tissue. For treatment of conditions such as restenosis, different agents are loaded into different openings in the device to address different biological processes involved in restenosis and are delivered at different release kinetics matched to the biological process treated. The different agents may also be used to address different diseases from the same drug delivery device. In addition, anti-thrombotic agents may be affixed to at least a portion of the surfaces of the medical device for the prevention of sub-acute thrombosis. To ensure that the different agents remain affixed to the device as well as to each other, primer layers may be utilized. | 02-03-2011 |
| 20110113728 | E BEAM STERILIZATION OF MEDICAL DEVICES COMPRISING BIOACTIVE COATING - The invention provides a method for single-step terminal sterilization process for bio-active heparin coatings on materials and biomaterials containing heparin used in medical devices, such as catheters, tissue engineering scaffolds, or drug delivery carrier materials. This may include any medical device or implantable that could benefit from improved antithrombotic and biocompatible heparin surfaces. Other relevant device examples may include heparin or a heparin derivative coated stents to reduce clotting and restenosis, dental or ophthalmological implants. These materials may comprise additional polymeric compositions such as polyethyleneimine, dextran sulfate or their modified forms. These polymers together with heparin coatings may be applied to other substrate of medical devices such as metal, ceramics or biologically derived materials. | 05-19-2011 |
| Patent application number | Description | Published |
|---|
| 20120157121 | PEER-TO-PEER LOCATION SERVICE - Techniques are described for obtaining high-resolution physical locations for a wireless device by leveraging the high-resolution physical location capabilities of wireless peers of the wireless device to provide a peer-to-peer location service and facilitate location targeting. Wireless devices provide location updates to a computing cloud, which stores records associating wireless device identifiers with received location information for the corresponding wireless devices. A wireless device issues a peer discovery request to dynamically identify nearby wireless peers in its network. The wireless device then sends wireless device identifiers for the nearby wireless peers in a location request to the computing cloud, which estimates a location for the wireless device using the previously recorded location information for the nearby wireless peers. The computing cloud returns the estimated location to the requesting wireless device. | 06-21-2012 |
| 20120157123 | PEER-TO-PEER LOCATION SERVICE - Techniques are described for obtaining high-resolution physical locations for a wireless device by leveraging the high-resolution physical location capabilities of wireless peers of the wireless device to provide a peer-to-peer location service and facilitate location targeting. Wireless devices provide location updates to a computing cloud, which stores records associating wireless device identifiers with received location information for the corresponding wireless devices. A wireless device issues a peer discovery request to dynamically identify nearby wireless peers in its network. The wireless device then sends wireless device identifiers for the nearby wireless peers in a location request to the computing cloud, which estimates a location for the wireless device using the previously recorded location information for the nearby wireless peers. The computing cloud returns the estimated location to the requesting wireless device. | 06-21-2012 |
| 20130143599 | PEER-TO-PEER LOCATION SERVICE - Techniques are described for obtaining high-resolution physical locations for a wireless device by leveraging the high-resolution physical location capabilities of wireless peers of the wireless device to provide a peer-to-peer location service and facilitate location targeting. Wireless devices provide location updates to a computing cloud, which stores records associating wireless device identifiers with received location information for the corresponding wireless devices. A wireless device issues a peer discovery request to dynamically identify nearby wireless peers in its network. The wireless device then sends wireless device identifiers for the nearby wireless peers in a location request to the computing cloud, which estimates a location for the wireless device using the previously recorded location information for the nearby wireless peers. The computing cloud returns the estimated location to the requesting wireless device. | 06-06-2013 |
| 20130314238 | HARDWARE ATTITUDE DETECTION IMPLEMENTATION OF MOBILE DEVICES WITH MEMS MOTION SENSORS - Systems and methods for detecting an attitude of a device are disclosed. The system includes a processing system including at least a sensor processor and an application processor, which are distinct. The system further includes a memory system including one or more computer-readable media. The computer-readable media contains instructions that, if executed by the processing system, cause the system to perform operations. The operations include executing an application using the application processor, and receiving raw sensor readings from one or more sensors, using the sensor processor. The operations also include determining, using the sensor processor, a processed sensor metric comprising attitude data, and transmitting the processed sensor metric to the application. | 11-28-2013 |
| 20140078150 | GENERATING AN INDOOR MAP MODEL - A method and system for providing an indoor map representation are provided herein. Aspects of this disclosure provide a representation of an indoor map environment whereby navigable areas are represented by a series of convex polygons in adjacency relationships with one another. Image analysis may be performed on a floor plan image to identify navigable areas and to determine the boundaries of the polygons, such as by assigning one or more colors to navigable space and one or more colors to non-navigable space. Route-finding operations may be performed using the adjacency relationships to find a path from a source area to a destination area. | 03-20-2014 |
| 20140113665 | NAVIGATING USING AN INDOOR MAP REPRESENTATION - A method and system for providing an indoor map representation are provided herein. Aspects of this disclosure provide a representation of an indoor map environment whereby navigable areas are represented by a series of convex polygons in adjacency relationships with one another. Image analysis may be performed on a floor plan image to identify navigable areas and to determine the boundaries of the polygons, such as by assigning one or more colors to navigable space and one or more colors to non-navigable space. Route-finding operations may be performed using the adjacency relationships to find a path from a source area to a destination area. | 04-24-2014 |
| 20140118153 | HARDWARE ATTITUDE DETECTION IMPLEMENTATION OF MOBILE DEVICES WITH MEMS MOTION SENSORS - Systems and methods for detecting an attitude of a device are disclosed. The system includes a processing system including at least a sensor processor and an application processor, which are distinct. The system further includes a memory system including one or more computer-readable media. The computer-readable media contains instructions that, if executed by the processing system, cause the system to perform operations. The operations include executing an application using the application processor, and receiving raw sensor readings from one or more sensors, using the sensor processor. The operations also include determining, using the sensor processor, a processed sensor metric comprising attitude data, and transmitting the processed sensor metric to the application. | 05-01-2014 |
| Patent application number | Description | Published |
|---|
| 20080246577 | Method For Making Magnetic Components With N-Phase Coupling, And Related Inductor Structures - Methods and structures for constructing a magnetic core of a coupled inductor. The method provides for constructing N-phase coupled inductors as both single and scalable magnetic structures, where N is an integer greater than 1. The method additionally describes how such a construction of the magnetic core may enhance the benefits of using the scalable N-phase coupled inductor. The first and second magnetic cores may be formed into shapes that, when coupled together, may form a single scalable magnetic core. For example, the cores can be fashioned into shapes such as a U, an I, an H, a ring, a rectangle, and a comb, that cooperatively form the single magnetic core. | 10-09-2008 |
| 20090179723 | Method For Making Magnetic Components With M-Phase Coupling, And Related Inductor Structures - An M phase coupled inductor includes a magnetic core including a first end magnetic element, a second end magnetic element, and M legs disposed between and connecting the first and second end magnetic elements. M is an integer greater than one. The coupled inductor further includes M windings, where each winding has a substantially rectangular cross section. Each one of the M windings is at least partially wound about a respective leg. | 07-16-2009 |
| 20110279212 | Method For Making Magnetic Components With M-Phase Coupling, And Related Inductor Structures - An M phase coupled inductor includes a magnetic core including a first end magnetic element, a second end magnetic element, and M legs disposed between and connecting the first and second end magnetic elements. M is an integer greater than one. The coupled inductor further includes M windings, where each winding has a substantially rectangular cross section. Each one of the M windings is at least partially wound about a respective leg. | 11-17-2011 |
| 20130069755 | Method For Making Magnetic Components With M-Phase Coupling, And Related Inductor Structures - An M phase coupled inductor includes a magnetic core including a first end magnetic element, a second end magnetic element, and M legs disposed between and connecting the first and second end magnetic elements. M is an integer greater than one. The coupled inductor further includes M windings, where each winding has a substantially rectangular cross section. Each one of the M windings is at least partially wound about a respective leg. | 03-21-2013 |
| 20130113596 | Method For Making Magnetic Components With N-Phase Coupling, And Related Inductor Structures - Methods and structures for constructing a magnetic core of a coupled inductor. The method provides for constructing N-phase coupled inductors as both single and scalable magnetic structures, where N is an integer greater than 1. The method additionally describes how such a construction of the magnetic core may enhance the benefits of using the scalable N-phase coupled inductor. The first and second magnetic cores may be formed into shapes that, when coupled together, may form a single scalable magnetic core. For example, the cores can be fashioned into shapes such as a U, an I, an H, a ring, a rectangle, and a comb, that cooperatively form the single magnetic core. | 05-09-2013 |
| 20130187737 | Method For Making Magnetic Components With M-Phase Coupling, And Related Inductor Structures - An M phase coupled inductor includes a magnetic core including a first end magnetic element, a second end magnetic element, and M legs disposed between and connecting the first and second end magnetic elements. M is an integer greater than one. The coupled inductor further includes M windings, where each winding has a substantially rectangular cross section. Each one of the M windings is at least partially wound about a respective leg. | 07-25-2013 |
| 20130222099 | Method For Making Magnetic Components With M-Phase Coupling, And Related Inductor Structures - An M phase coupled inductor includes a magnetic core including a first end magnetic element, a second end magnetic element, and M legs disposed between and connecting the first and second end magnetic elements. M is an integer greater than one. The coupled inductor further includes M windings, where each winding has a substantially rectangular cross section. Each one of the M windings is at least partially wound about a respective leg. | 08-29-2013 |
| 20130229249 | Method For Making Magnetic Components With M-Phase Coupling, And Related Inductor Structures - An M phase coupled inductor includes a magnetic core including a first end magnetic element, a second end magnetic element, and M legs disposed between and connecting the first and second end magnetic elements. M is an integer greater than one. The coupled inductor further includes M windings, where each winding has a substantially rectangular cross section. Each one of the M windings is at least partially wound about a respective leg. | 09-05-2013 |
| 20140247104 | Method For Making Magnetic Components With M-Phase Coupling, And Related Inductor Structures - An M phase coupled inductor includes a magnetic core including a first end magnetic element, a second end magnetic element, and M legs disposed between and connecting the first and second end magnetic elements. M is an integer greater than one. The coupled inductor further includes M windings, where each winding has a substantially rectangular cross section. Each one of the M windings is at least partially wound about a respective leg. | 09-04-2014 |
| Patent application number | Description | Published |
|---|
| 20090021461 | Monochromatic liquid crystal display for colors - Techniques for providing backlight techniques in liquid crystal flat panel displays are disclosed. According to embodiment, the backlighting includes three color groups of light emitting diodes that are turned on successively. Pixels in an LCD are controlled in accordance with a display signal to transmit none, all or a determined amount of one or more of the colored lights from the three color groups of light emitting diodes in a cycle, resulting in an LCD with vivid colors and minimized tailing effects. | 01-22-2009 |
| 20110025727 | MICROSTRUCTURES FOR LIGHT GUIDE ILLUMINATION - Various embodiments disclose an illumination apparatus. The apparatus may comprise a light guide supporting propagation of light and having at least a portion of one of its edges comprising an array of microstructures. These microstructures may be incorporated in the input window of the light guide to control the light intensity distributed within the light guide. In certain embodiments, the directional intensity of the light entering the light guide may be modified to achieve a desired distribution across the light guide. | 02-03-2011 |
| 20120026212 | LED backlighting for liquid crystal display (LCD) - Techniques for providing LED-based backlighting in liquid crystal flat panel displays are disclosed. In one embodiment, the backlighting includes at least three color groups of light emitting diodes (LEDs) that are turned on successively for one frame of image. Liquid crystals (pixels) in an LCD are controlled in accordance with a display signal to transmit none, all or a determined amount of one or more of the colored lights from the three color groups of light emitting diodes in a cycle, resulting in an LCD with vivid colors and minimized tailing effects. | 02-02-2012 |
| 20120081406 | INTEGRATED BACKLIT FRONTLIGHT FOR REFLECTIVE DISPLAY ELEMENTS - This disclosure provides systems, methods and apparatus, including reflective display elements that are illuminated using a light source that is situated behind the pixel elements. In one aspect, a back light guide is disposed behind the pixel elements and is configured to inject light through light-injection apertures between reflective pixel elements. The light travels through the light-injection apertures and into a front light guide. The front light guide comprises light turning features configured to turn the light propagating through the light-injection apertures so that the light is redirected onto the reflective pixel elements, thereby illuminating the reflective pixel elements. | 04-05-2012 |
| 20120120080 | LIGHT GUIDE WITH DIFFUSIVE LIGHT INPUT INTERFACE - This disclosure provides systems, methods and apparatus for providing illumination by using a light guide to distribute light. In one aspect, the light guide has a surface, such as an edge, into which light is injected. The surface is treated to create a diffusive interface with a light source. For example, the surface may be subjected to abrasion to form a frosted surface that acts as the diffusive interface, or a diffusive structure may be attached to the edge, with the attached diffusive structure functioning as the diffusive interface. The diffusive interface diffuses light entering into the light guide, and can thereby increase the uniformity of light propagating within the light guide. The light guide may be provided with light turning features that redirect light out of the light guide. In some implementations, the redirected light may be applied to illuminate a display. | 05-17-2012 |
| 20120120081 | ILLUMINATION DEVICE WITH PASSIVATION LAYER - This disclosure provides systems, methods and apparatus for providing illumination by using a light guide to distribute light. In one aspect, a passivation layer is attached to the light guide of an illumination device. The passivation layer may be an optically transparent moisture barrier and may have a thickness and refractive index which allows it to function as an anti-reflective coating. The passivation layer may protect moisture-sensitive underlying features, such as metallized light turning features that may be present in the light guide. The light turning features may be configured to redirect light out of the light guide. In some implementations, the redirected light may be applied to illuminate a display. | 05-17-2012 |
| 20120120467 | HYBRID LIGHT GUIDE WITH FACETED AND HOLOGRAPHIC LIGHT TURNING FEATURES - The present disclosure provides systems, methods and apparatus to illuminate displays. In one aspect, an illumination device with a light guide can include both faceted and holographic light turning features. The holographic light turning features can be provided between the facets. The facets can eject light out of the light guide. The holographic light turning features also can eject light out of the light guide, or can collimate the light so that it propagates more nearly parallel to the major surfaces of the light guide, or both eject and collimate light. The ejected light can be used to illuminate a display. | 05-17-2012 |
| 20120170310 | LIGHT GUIDE WITH UNIFORM LIGHT DISTRIBUTION - This disclosure provides systems, methods and apparatus for providing illumination by using a light guide to distribute light. In one aspect, the light guide has a light input edge into which light is injected and transverse edges transverse to the light input edge. The transverse edges are smooth and act as specular reflectors. The light input edge is rough and provides a diffusive interface. The light emitters are adjacent and centered along the light input edge, with the pitch of the light emitters being about ΔL, where ΔL is the distance between the transverse edges divided by the number of light emitters. The light guide can be provided with light turning features that redirect light out of the light guide. In some implementations, the redirected light can be applied to illuminate a display. | 07-05-2012 |
| 20120274602 | WIRING AND PERIPHERY FOR INTEGRATED CAPACITIVE TOUCH DEVICES - This disclosure provides systems, methods and apparatus for a projected capacitive touch (PCT) sensor that may include thin sensor electrodes coated with additional layers to form an optical cavity that reinforces a wavelength range or color of incident light. The sensor electrodes and a cover glass border and/or decorations may be fabricated simultaneously. In some implementations, the thickness of the optical cavity will be selected such that the “color” of reflected light is black. The sensor electrodes may not be noticeable to a human observer. However, in some other implementations, the thickness of the optical cavity may be selected such that the sensor electrodes and/or the decorative portions will have another color. Routing wires of the touch sensor may be shielded by a grounded conductive layer in the border. | 11-01-2012 |
| 20120299890 | BALANCED LED BACKLIGHTING FOR LIQUID CRYSTAL DISPLAY (LCD) - Techniques for providing LED-based backlighting in liquid crystal flat panel displays are disclosed. In one embodiment, optical sensors are provided to sense illuminations from colored LED groups and provide feedback signals to a controller so that a desired ratio of the illuminations is maintained. As a result, true colors could be reproduced regardless of possible irregularities that may be happening to LEDs used in the colored LED groups to backlight an LCD panel. | 11-29-2012 |
| 20130176317 | LIGHT GUIDE WITH AT LEAST PARTIALLY NON-TRANSMISSIVE COATING ON LEDGE REGION - This disclosure provides systems, methods and apparatus related to an illumination system for a display device. In one aspect, the illumination system includes a light guide having a view region, which directly overlies display elements of a display, and a ledge region between the view region and a light source that injects light into the light guide. The ledge region is coated with an at least partially non-transmissive layer. The layer can be at least partially absorptive and/or at least partially reflective. In some implementations, the layer can include microstructures configured to turn steep-angle light such that it is redirected across the light guide at a shallower angle. In some implementations, the boundary between the ledge region and the view region of the light guide can have a nonlinear shape. | 07-11-2013 |
| 20130257880 | LIGHT GUIDE WITH INTERNAL LIGHT RECIRCULATION - This disclosure provides systems, methods, and apparatuses for illumination using illumination systems having a light guide. A light source is configured to inject light into a light input edge of the light guide. The light guide is configured to recirculate the injected light therein such that the light passes back and forth across the light guide one or more times. The light guide includes light-turning features that extract light out of the light guide. To promote light recirculation, the light-turning features have a per-pass light extraction efficiency of about 50% or less and one or more edges of the light guide may be reflective. The light extracted out of the light guide by the light-turning features may be used to illuminate a display. | 10-03-2013 |
| Patent application number | Description | Published |
|---|
| 20090316583 | METHOD AND APPARATUS FOR CALCULATING MPLS TRAFFIC ENGINEERING PATHS - Methods and apparatuses are provided for searching a least-cost path between a source node and a destination node in a communication network. A set of costs associated with least-cost paths from the source node to a set of intermediate nodes is first determined. A least-cost path in a reverse direction from the destination node to an intermediate node is also determined. The intermediate node is selected based at least on a first cost associated with the least-cost path from the destination node to the intermediate node, and a second cost associated with a least-cost path from the source node to the intermediate node that was first determined. Accordingly, the least-cost path between the source node and the destination node might then be calculated by using the second cost as heuristic information. | 12-24-2009 |
| 20100088706 | User Tolerance Based Scheduling Method for Aperiodic Real-Time Tasks - An apparatus comprising at least one processor configured to implement a method comprising analyzing a plurality of tasks, determining a privilege level for each of the task, determining a schedule for each of the tasks, and scheduling the tasks for execution based on the privilege level and the schedule of each task. Included is a memory comprising instructions for determining a privilege level for each of a plurality of tasks, wherein the privilege levels comprise periodic real-time, aperiodic real-time, and non-real time, determining an execution time for each of the tasks, and scheduling the tasks for execution on a processor based on the privilege level and the execution time of each task. | 04-08-2010 |
| 20100265956 | Border Gateway Protocol (BGP) Grouped Route Withdrawals - An apparatus comprising: a first Border Gateway Protocol (BGP) device configured to communicate with a second BGP device and implement grouped route withdrawals with the second BGP device. A method comprising: announcing, by a BGP speaker, a plurality of grouped routes, and withdrawing, by the BGP speaker, a plurality of previously announced grouped routes. | 10-21-2010 |
| 20100272104 | Implementation to Avoid the Acknowledgement-Implosion in a Multicast Group - In at least some embodiments, a multicast communication system includes sender and a plurality of receivers in communication with the sender. The sender is configured to multicast a data packet to the plurality of receivers. The plurality of receivers are configured to acknowledge the data packet received from the sender based on weakest member selection without a sender-side competitive time window | 10-28-2010 |
| 20100272105 | Determining the Group Address for an Ethernet-Based Multicast Communication - A communication system, comprising a multicast group address allocator in communication with a plurality of nodes configured as at least one multicast group, wherein, upon creation of a new multicast group from among the nodes, the multicast group address allocator is configured to assign a multicast address to the new multicast group based on the assigned multicast address falling into a hash-bin for each group member of the new multicast group. A multicast group address allocator, comprising a network interface in communication with a plurality of nodes, a controller coupled to the network interface, and a storage medium coupled to the controller, wherein, upon request, the controller assigns a multicast address to a new multicast group from among the nodes, wherein the controller accesses hash-bin information for the nodes and selects the multicast address based on the hash-bin information, and wherein the hash-bin information is stored in the storage medium. | 10-28-2010 |
| 20120136944 | Method For Dynamic Discovery of Control Plane Resources and Services - An apparatus comprising a processor configured to discover one or more peer processors associated with a network component in a dynamic manner by detecting an announcement message from a peer processor, wherein the announcement message is multicast from the peer processor when the peer processor is added or activated on the network component. | 05-31-2012 |
| 20120137012 | Method for Dynamic On Demand Startup of a Process or Resource - An apparatus comprising a processor configured to startup a new process on a peer processor to off-load a load of a local process on the processor in a dynamic manner based on monitoring an amount of resources used by the processor, wherein the startup of the new process on the peer processor is initiated when the amount of resources used by the local process reaches a threshold. | 05-31-2012 |
| 20120177038 | Method for Group-Based Multicast with Non-Uniform Receivers - An apparatus comprising a proxy configured to couple to a sender and a receiver and to receive data from the sender at a first rate and forward the data to the receiver at a second rate that is less than the first rate. A method comprising detecting a reception speed for each of a plurality of receivers in a multicast group, assigning the receivers to a first group and a second group based on the reception speed of each of the receivers, wherein the first group has a reception speed that is faster than a reception speed of the second group, and sending multicast data intended for all of the receivers to the receivers in the first group and to a proxy at a first rate, wherein the proxy buffers the multicast data and sends the multicast data to the receivers in the second group at a second rate. | 07-12-2012 |
| 20120209989 | Method for Dynamic Migration of a Process or Services from One Control Plane Processor to Another - An apparatus comprising a processor configured to migrate load from a source process running on the processor to a target process running on a peer processor in a dynamic manner by monitoring an amount of resources used by the source process, wherein the load is migrated when the amount of resources utilized by the source process exceeds a threshold. Also disclosed is a network component comprising a first processor configured to select a source process to migrate a load from the first processor based on available resources on the first processor and the source process; and a second processor configured upon receiving a migration request from the first processor to one of select and start a target process to which to migrate the load based on available resources for the second processor and the target process. | 08-16-2012 |
| 20120243443 | System and Method for Topology Transparent Zoning in Network Communications - An Autonomous System domain comprising a topology transparent zone comprising a plurality of topology transparent zone nodes at least some of which are topology transparent zone edge nodes, wherein the topology transparent zone nodes are interconnected with one another via a plurality of internal links, and a plurality of neighboring external nodes connected to the topology transparent zone edge nodes via a plurality of external links, wherein no link state advertisements (LSAs) describing the internal links are distributed to the neighboring external nodes. | 09-27-2012 |
| 20120327759 | Internet Group Management Protocol Version Three for Quality of Service Support - The disclosure includes a method comprising: receiving, by a first network element, a first communication from a client device, wherein the first communication comprises a multicast channel membership query report and QoS data. The disclosure also includes a method comprising: receiving, by a first network element, a first communication from a client device, wherein the first communication comprises a multicast channel membership query report and QoS data. The disclosure also includes an apparatus comprising: a client device connected to a network element and a network via the first network element, wherein the client device is configured to send a multicast channel membership report indicating the client device wishes to receive a multicast channel communication and indicating requested QoS data relating to the multicast channel communication. | 12-27-2012 |
| 20120327764 | Protocol Independent Multicast Last Hop Router Discovery - Disclosed is an apparatus comprising a first network node configured to transmit a first message to a second network node, wherein the first message comprises data designating the first network node as a member of a first multicast channel, and wherein the first message comprises data indicating a network address a third network node that is designated as a last hop router (LHR) of the first multicast channel. Also disclosed is a method comprising sending, by a first network node, a protocol independent multicast (PIM) join message, wherein the PIM join message comprises the network address of a PIM channel last hop router (LHR). | 12-27-2012 |
| 20120327775 | Protocol Independent Multicast with Quality of Service Support - An apparatus comprising a network node configured to communicate with a plurality of other network nodes via one or more logic links using protocol independent multicast (PIM), wherein the network node is further configured to transmit a PIM message comprising quality of service (QoS) data to at least one of the other network nodes. Also disclosed is a method comprising receiving, by a first network node, a first PIM join message comprising QoS data from a second network node, wherein the second network node is downstream from the first network node. Also disclosed is a method comprising: sending, by a first network node, a first PIM message comprising QoS data to a second network node, wherein the second network node is upstream from the first network node. | 12-27-2012 |
| 20130034103 | System and Method for Finding Segments of Path for Label Switched Path Crossing Multiple Domains - An apparatus comprising a path computation element (PCE) associated with a domain in a network and configured to find a segment of a Multiprotocol Label Switching (MPLS) Traffic Engineering (TE) Label Switched Path (LSP) that crosses a plurality of domains in the network using a Constraint Shortest Path First (CSPF) algorithm or a reverse CSPF algorithm that computes a plurality of shortest paths in the domain of which the segment is selected, wherein the CSPF algorithm or the reverse CSPF algorithm is selected to reduce the number of shortest path computations in the domain based on the number of starting nodes and ending nodes that are considered for computing the shortest paths in the domain. | 02-07-2013 |
| 20130089005 | Simple Topology Transparent Zoning in Network Communications - An autonomous system (AS) comprising a topology transparent zone (TTZ) comprising a plurality of TTZ nodes, wherein the plurality of TTZ nodes includes an edge node and an internal node, wherein each of the plurality of TTZ nodes is configured to connect to another TTZ node via an internal link, and a plurality of neighboring external nodes connected to the TTZ edge nodes via a plurality of external links, wherein no link state advertisements (LSAs) describing the internal links are distributed to the neighboring external nodes. | 04-11-2013 |
| 20130100953 | In Band Signaling in Next Generation-Multicast Virtual Private Network Using Receiver Driven Resource Reservation Protocol-Traffic Engineering Point-To-Multipoint - A method executed by a processor in a network node positioned inside a Multiprotocol Label Switching (MPLS) core network for establishing a Point to Multipoint (P2MP) Virtual Private Network (MVPN), comprising receiving a Protocol-Independent Multicast (PIM) Join message from a node outside the MPLS core network, wherein the PIM Join message comprises a source VPN identifier (ID) and propagating the source VPN ID across a P2MP Label Switched Path (LSP) established in the MPLS core network with in-band signaling using Resource Reservation Protocol-Traffic Engineering (RSVP-TE). | 04-25-2013 |
| 20130294453 | LAYER-3 SERVICES FOR UNITED ROUTER FARM - One embodiment of the present invention provides a computing system. The computing system includes a processor, a memory, a logical switch management mechanism, and a layer-2 path management mechanism. The logical switch management mechanism operates the computing system in conjunction with a plurality of remote switches as a single logical switch. The layer-2 path management mechanism includes a path calculation mechanism and a layer-2 forwarding table. The path calculation mechanism calculates layer-2 shortest paths among the computing system and the remote switches. The layer-2 forwarding table is for a first switch in the plurality of remote switches and created based on one or more of the shortest paths, wherein a respective entry in the forwarding table corresponds to a layer-2 network address. The layer-2 path management mechanism suppresses advertisement of the shortest paths outside of the logical switch, thereby hiding internal paths of the logical switch. | 11-07-2013 |
| 20130297757 | UNITED ROUTER FARM SETUP - One embodiment of the present invention provides a computing system. The computing system includes a processor, a memory, a discovery mechanism, a switch management mechanism, and a configuration management mechanism. The discovery mechanism discovers a remote switch. The switch management mechanism registers the remote switch and transmits a switch image to the remote switch, thereby allowing the remote switch to install the image. The configuration management mechanism configures the remote switch, thereby allowing the remote switch to be controlled by the computing system. | 11-07-2013 |
| 20130336191 | mRSVP-TE Based Fast Reroute in Detour (1:1) Protection Mode - An apparatus comprising a memory, and a processor coupled to the memory and configured to transmit a multicast Resource Reservation Protocol—Traffic Engineering (mRSVP-TE) path request (PATH) message upstream, wherein the PATH message requests reservation of a backup Label Switched Path (LSP) to protect an active LSP configured to transmit multicast data. The disclosure also includes a computer program product comprising computer executable instructions stored on a non-transitory computer readable medium such that when executed by a processor cause a network element (NE) to receive a multicast PATH message from a downstream node, wherein the NE acts as a Point of Local Repair (PLR) along an active LSP, wherein the active LSP is configured to transmit multicast data, and wherein the PATH message requests reservation of a backup LSP to protect the active LSP. | 12-19-2013 |
| 20130336192 | mRSVP-TE Based Fast Reroute in Facility (1:N) Protection Mode - An apparatus comprising a memory, and a processor coupled to the memory and configured to transmit a backup Label Switched Path (LSP) multicast Resource Reservation Protocol-Traffic Engineering (mRSVP-TE) path request (PATH) message upstream, wherein the backup LSP PATH message requests reservation of a first backup LSP to protect a first primary LSP configured to transmit multicast data, and wherein the backup LSP PATH message is transmitted to support a facility mode one to many ( | 12-19-2013 |
| 20140003245 | Providing PIM-SSM Support for mRSVP-TE Based Multicast Virtual Private Networks | 01-02-2014 |
| 20140003246 | Providing PIM-SM Support for mRSVP-TE Based Multicast Virtual Private Networks | 01-02-2014 |
| 20140003281 | Multicast Distribution Trees for mRSVP-TE Based Multicast Virtual Private Networks | 01-02-2014 |
| 20140003425 | Implementing a Multicast Virtual Private Network by Using Multicast Resource Reservation Protocol-Traffic Engineering | 01-02-2014 |
| 20140056300 | Method of Multiprotocol Label Switching Encapsulation for United Router Farm Forwarding - A network component for supporting packet forwarding in a United Router Farm (URF), the network component comprising a processor configured to receive a packet, encapsulate the packet using a URF header comprising a URF Layer Two (L2) header that indicates Media Access Control (MAC) addresses of current and next hops, an outer label that indicates a tunnel to a destination node in the URF, and an inner label that indicates an egress port on the destination node, and send the packet to a next hop in the URF after encapsulating the packet. | 02-27-2014 |
| 20140119367 | Encoding Packets for Transport Over SDN Networks - An ingress node in a Software Defined Network (SDN) comprising a receiver for receiving a data packet, a processor coupled to the receiver and further configured to obtain the data packet from the receiver in a transport protocol agnostic manner, and encapsulate the data packet in an SDN packet header, wherein the packet header comprises SDN flow-specific information provided by an SDN controller, and a transmitter coupled to the processor and further configured to transmit the encapsulated data packet across a single SDN toward an egress node in the SDN. | 05-01-2014 |
| 20140122683 | System and Method for Virtual Network Abstraction and Switching - Embodiments are provided herein to enable single level network abstraction for a service across one or more domains. The embodiments use a single network ID to identify a service and a corresponding virtual network topology across any number of domains at a physical network. A virtual network topology can be abstracted for each service, based on the physical underlying network topology. A network controller determines, for a service, the virtual network topology within a physical network, and binds the service to the virtual network topology via a virtual network ID, which defines a single forwarding domain of the virtual network topology across the physical network. The virtual network ID is then indicated to the nodes of the virtual network topology, thus enabling the nodes to identify and forward traffic for the service, within the single forwarding domain, between end clients from edge to edge of the physical network. | 05-01-2014 |
| 20140192645 | Method for Internet Traffic Management Using a Central Traffic Controller - A method for internet traffic management, comprising receiving a request for a path set from an application at a network traffic controller, wherein the request contains an intended traffic destination endpoint, evaluating a plurality of network devices in a network, identifying a plurality of paths usable by the application to transmit traffic from the application to the intended traffic destination endpoint, including the plurality of paths in the path set, and sharing the path set with the application. | 07-10-2014 |
| 20140241372 | Constructing A Topology-Transparent Zone - A network node used to construct a topology-transparent zone (TTZ). The network node may obtain a TTZ identifier (ID) that is uniquely associated with a TTZ. Additionally, the network node may obtain a first link that couples the network node to a second network node that is also assigned the TTZ ID and a second link that couples the network node to a third network node that is not assigned the TTZ ID. The network node may generate a router information (RI) link-state advertisement (LSA) that indicates whether the network node is a TTZ edge node or a TTZ internal node and that indicates the TTZ associated with the TTZ. The network node may distribute the RI LSA to the second network node that is also assigned the TTZ ID using the first link. | 08-28-2014 |
| 20140254427 | Discovering a Topology-Transparent Zone - A network node used to discover a topology-transparent zone (TTZ). In one example embodiment, the network node may obtain a TTZ identifier (ID) that is uniquely associated with the TTZ. Additionally, the network node may identify a link connected to a second network node that is also assigned the TTZ ID. In response to the command to initiate discovering the TTZ, the network node may generate a router information (RI) link-state advertisement (LSA) that comprises the TTZ ID and may distribute the RI LSA to the second network node using the link. In another example embodiment, the network node may not be configured as a TTZ edge node and may receive an RI LSA comprising the TTZ ID. The network node may store at least a portion of the information within the RI LSA and may flood the RI LSA using a plurality of links. | 09-11-2014 |
| 20150023150 | Establishing and Protecting Label Switched Paths Across Topology-Transparent Zones - A label switched path (LSP) establishing method comprising receiving a first path message from a network node outside of a topology-transparent zone (TTZ) along a path for the LSP, computing a TTZ path through the TTZ from the network component to an egress TTZ edge node along the LSP, sending a second path message to a TTZ internal node along the TTZ path, receiving a first reservation (RESV) message from the TTZ internal node that comprises a label allocated for the egress TTZ edge node, and sending a second RESV message that comprises a label allocated for the network component and the label allocated for the egress TTZ edge node to the network node. | 01-22-2015 |
| 20150043589 | Extending OpenFlow to Support Packet Encapsulation for Transport over Software-Defined Networks - A method for controlling a data flow in a domain of an OpenFlow protocol controlled software-defined network (SDN) comprising receiving a request from a network element for instructions to route the data flow through the OpenFlow SDN, determining a route for the data flow through the OpenFlow SDN, transmitting a unified header to the network element in the OpenFlow SDN, wherein the unified header facilitates transmission of data flows through the OpenFlow SDN that are encoded according to a plurality of network abstraction types, and transmitting instructions for forwarding the data flow along the route through the OpenFlow SDN, wherein the instructions for forwarding the data flow along the route through the OpenFlow SDN comprise one or more match fields, one or more mask values corresponding to the match fields, and one or more actions for the network element in the OpenFlow SDN to perform on the data flow. | 02-12-2015 |
| Patent application number | Description | Published |
|---|
| 20120045368 | Chemical Coating of Microwell for Electrochemical Detection Device - The described embodiments may provide a method of fabricating a chemical detection device. The method may comprise forming a microwell above a CMOS device. The microwell may comprise a bottom surface and sidewalls. The method may further comprise applying a first chemical to be selectively attached to the bottom surface of the microwell, forming a metal oxide layer on the sidewalls of the microwell, and applying a second chemical to be selectively attached to the sidewalls of the microwell. The second chemical may lack an affinity to the first chemical. | 02-23-2012 |
| 20130089466 | Chemical Coating of Microwell for Electrochemical Detection Device - The described embodiments may provide a method of fabricating a chemical detection device. The method may comprise forming a microwell above a CMOS device. The microwell may comprise a bottom surface and sidewalls. The method may further comprise applying a first chemical to be selectively attached to the bottom surface of the microwell, forming a metal oxide layer on the sidewalls of the microwell, and applying a second chemical to be selectively attached to the sidewalls of the microwell. The second chemical may lack an affinity to the first chemical. | 04-11-2013 |
| 20130189158 | HIGH CAPACITANCE MICROWELL - A system includes a sensor including a sensor pad and a well wall structure defining a well operatively coupled to the sensor pad. The well is further defined by a lower surface disposed over the sensor pad. The well wall structure defines an upper surface and defines a wall surface extending between the upper surface and the lower surface. The system further includes a conductive layer disposed over the lower surface and the wall surface. | 07-25-2013 |
| 20130189790 | SENSOR ARRAYS AND METHODS FOR MAKING SAME - A system includes a sensor including a sensor pad and includes a well wall structure defining a well operatively connected to the sensor pad. The sensor pad is associated with a lower surface of the well. The well wall structure defines an upper surface and a wall surface extending between the upper surface and the lower surface. The upper surface is defined by an upper buffer material having an intrinsic buffer capacity of at least 2×10 | 07-25-2013 |
| 20140113303 | Chemical Coating of Microwell for Electrochemical Detection Device - The described embodiments may provide a method of fabricating a chemical detection device. The method may comprise forming a microwell above a CMOS device. The microwell may comprise a bottom surface and sidewalls. The method may further comprise applying a first chemical to be selectively attached to the bottom surface of the microwell, forming a metal oxide layer on the sidewalls of the microwell, and applying a second chemical to be selectively attached to the sidewalls of the microwell. The second chemical may lack an affinity to the first chemical. | 04-24-2014 |
| 20140191292 | METHODS AND SYSTEMS FOR POINT OF USE REMOVAL OF SACRIFICIAL MATERIAL - A method of manufacturing a sensor, the method including forming an array of chemically-sensitive field effect transistors (chemFETs), depositing a dielectric layer over the chemFETs in the array, depositing a protective layer over the dielectric layer, etching the dielectric layer and the protective layer to form cavities corresponding to sensing surfaces of the chemFETs, and removing the protective layer. The method further includes, etching the dielectric layer and the protective layer together to form cavities corresponding to sensing surfaces of the chemFETs. The protective layer is at least one of a polymer, photoresist material, noble metal, copper oxide, and zinc oxide. The protective layer is removed using at least one of sodium hydroxide, organic solvent, aqua regia, ammonium carbonate, hydrochloric acid, acetic acid, and phosphoric acid. | 07-10-2014 |
| 20140191293 | METHODS FOR MANUFACTURING WELL STRUCTURES FOR LOW-NOISE CHEMICAL SENSORS - In one implementation, a method for manufacturing a chemical detection device is described. The method includes forming a chemical sensor having a sensing surface. A dielectric material is deposited on the sensing surface. A first etch process is performed to partially etch the dielectric material to define an opening over the sensing surface and leave remaining dielectric material on the sensing surface. An etch protect material is formed on a sidewall of the opening. A second etch process is then performed to selectively etch the remaining dielectric material using the etch protect material as an etch mask, thereby exposing the sensing surface. | 07-10-2014 |
| 20140209982 | SELF-ALIGNED WELL STRUCTURES FOR LOW-NOISE CHEMICAL SENSORS - In one implementation, a chemical detection device is described. The device includes a chemically-sensitive field effect transistor including a floating gate conductor coupled to a gate dielectric and having an upper surface, and a sensing material on the upper surface. The device also includes a fill material defining a reaction region extending above the sensing material, the reaction region overlying and substantially aligned with the floating gate conductor. | 07-31-2014 |
| 20140217477 | ELECTRIC FIELD DIRECTED LOADING OF MICROWELL ARRAY - An apparatus includes a device substrate including an array of sensors. Each sensor of the array of sensors can include a electrode structure disposed at a surface of the device substrate. The apparatus further includes a wall structure overlying the surface of the device substrate and defining an array of wells at least partially corresponding with the array of sensors. The well structure including an electrode layer and an insulative layer. | 08-07-2014 |
| 20140220697 | CHEMICAL SENSOR WITH CONDUCTIVE CUP-SHAPED SENSOR SURFACE - A system includes a sensor including a sensor pad and a well wall structure defining a well operatively coupled to the sensor pad. The well is further defined by a lower surface disposed over the sensor pad. The well wall structure defines an upper surface and defines a wall surface extending between the upper surface and the lower surface. The system further includes a conductive layer disposed over the lower surface and the wall surface. | 08-07-2014 |
| 20140264322 | CHEMICAL SENSOR WITH PROTRUDED SENSOR SURFACE - In one implementation, a chemical sensor is described. The chemical sensor includes a chemically-sensitive field effect transistor including a floating gate conductor having an upper surface. A conductive element protrudes from the upper surface of the floating gate conductor into an opening. A dielectric material defines a reaction region. The reaction region overlies and extends below an upper surface of the conductive element. | 09-18-2014 |
| 20140264469 | CHEMICAL SENSOR WITH SIDEWALL SENSOR SURFACE - In one embodiment, a chemical sensor is described. The chemical sensor includes a chemically-sensitive field effect transistor including a floating gate conductor. A material defines an opening overlying the floating gate conductor. The material comprises a conductive element having an inner surface defining a lower portion of a sidewall of the opening. A dielectric is on the conductive element and has an inner surface defining an upper portion of the sidewall. | 09-18-2014 |
| 20140264470 | CHEMICAL SENSORS WITH CONSISTENT SENSOR SURFACE AREAS - In one embodiment, a chemical sensor is described. The chemical sensor includes a chemically-sensitive field effect transistor including a floating gate conductor having an upper surface. A material defines an opening extending to the upper surface of the floating gate conductor. The material comprises a first dielectric underlying a second dielectric. A conductive element contacts the upper surface of the floating gate conductor and extends a distance along a sidewall of the opening, the distance defined by a thickness of the first dielectric. | 09-18-2014 |
| 20140264471 | CHEMICAL DEVICE WITH THIN CONDUCTIVE ELEMENT - In one implementation, a chemical device is described. The sensor includes a chemically-sensitive field effect transistor including a floating gate structure having a plurality of floating gate conductors electrically coupled to one another. A conductive element overlies and is in communication with an uppermost floating gate conductor in the plurality of floating gate conductors. The conductive element is wider and thinner than the uppermost floating gate conductor. A dielectric material defines an opening extending to an upper surface of the conductive element. | 09-18-2014 |
| 20140264472 | CHEMICAL SENSOR WITH CONSISTENT SENSOR SURFACE AREAS - In one embodiment, a chemical sensor is described. The chemical sensor includes a chemically-sensitive field effect transistor including a floating gate conductor having an upper surface. A material defines an opening extending to the upper surface of the floating gate conductor, the material comprising a first dielectric underlying a second dielectric. A conductive element contacts the upper surface of the floating gate conductor and extending a distance along a sidewall of the opening. | 09-18-2014 |
| Patent application number | Description | Published |
|---|
| 20090117745 | METHODS FOR SELECTIVELY ETCHING A BARRIER LAYER IN DUAL DAMASCENE APPLICATIONS - Methods for etching a dielectric barrier layer with high selectivity to a dielectric bulk insulating layer and/or a hardmask layer in a dual damascene structure are provided. In one embodiment, the method includes providing a substrate having a portion of a dielectric barrier layer exposed through a dielectric bulk insulating layer in an etch reactor, flowing a gas mixture containing SiF | 05-07-2009 |
| 20090140418 | METHOD FOR INTEGRATING POROUS LOW-K DIELECTRIC LAYERS - Described herein are methods for integrating low-k dielectric layers with various interconnect structures. In one embodiment, a method for restoring a porous dielectric layer includes forming an opening in the porous low-k dielectric layer. The method further includes forming an opening in a barrier layer. The method further includes depositing a restoring dielectric layer to seal a surface layer of pores of the porous dielectric layer. In one embodiment, the restoring dielectric layer is non-porous and hydrophobic to prevent the porous dielectric layer from adsorbing moisture and consequently increasing the dielectric constant of the porous dielectric layer. The method further includes performing a clean operation on the interconnect structure prior to metallization. The method further includes depositing, masking, and etching a metal layer. | 06-04-2009 |
| 20090286402 | METHOD FOR CRITICAL DIMENSION SHRINK USING CONFORMAL PECVD FILMS - A method and apparatus for forming narrow vias in a substrate is provided. A pattern recess is etched into a substrate by conventional lithography. A thin conformal layer is formed over the surface of the substrate, including the sidewalls and bottom of the pattern recess. The thickness of the conformal layer reduces the effective width of the pattern recess. The conformal layer is removed from the bottom of the pattern recess by anisotropic etching to expose the substrate beneath. The substrate is then etched using the conformal layer covering the sidewalls of the pattern recess as a mask. The conformal layer is then removed using a wet etchant. | 11-19-2009 |
| 20090293907 | METHOD OF SUBSTRATE POLYMER REMOVAL - Methods for cleaning a substrate are provided. In one embodiment, the method includes depositing a polymer on a substrate. A cleaning gas is provided to clean a frontside, a bevel edge, and a backside of the substrate. The cleaning gas may include various reactive chemicals such as H | 12-03-2009 |
| 20100022091 | METHOD FOR PLASMA ETCHING POROUS LOW-K DIELECTRIC LAYERS - Described herein are methods and apparatuses for etching low-k dielectric layers to form various interconnect structures. In one embodiment, the method includes forming an opening in a resist layer. The method further includes etching a porous low-k dielectric layer with a process gas mixture that includes a fluorocarbon gas and a carbon dioxide (CO | 01-28-2010 |
| 20100043821 | METHOD OF PHOTORESIST REMOVAL IN THE PRESENCE OF A LOW-K DIELECTRIC LAYER - Described herein are methods and apparatus for removing photoresist in the presence of low-k dielectric layers. In one embodiment, the method includes exciting a first mixture of gases having a ratio of a flow rate of reducing process gas to a flow rate of an oxygen-containing process gas that is between 1:1 and 100:1 to generate a first reactive gas mixture. Next, the method includes exposing the photoresist layer that overlays the low-k dielectric layer on a substrate to the first reactive gas mixture to selectively remove the photoresist layer from the dielectric layer. Next, the method includes exposing the photoresist layer to a second reactive gas mixture to selectively remove the photoresist layer from the dielectric layer. The first and second reactive gas mixtures contain substantially no ions when the substrate is exposed to these mixtures in order to minimize damage to the low-k dielectric layer. | 02-25-2010 |
| 20130149869 | SILICON ON INSULATOR ETCH - A method etching features through a stack of a silicon nitride layer over a silicon layer over a silicon oxide layer in a plasma processing chamber is provided. The silicon nitride layer is etched in the plasma processing chamber, comprising; flowing a silicon nitride etch gas; forming the silicon nitride etch gas into a plasma to etch the silicon nitride layer, and stopping the flow of the silicon nitride etch gas. The silicon layer is, comprising flowing a silicon etch gas, wherein the silicon etch gas comprises SF | 06-13-2013 |
| 20140030893 | METHOD FOR SHRINK AND TUNE TRENCH/VIA CD - A method for etching with CD reduction, an etch layer disposed below a silicon containing mask layer under a patterned organic mask with features with a first CD. Features are opened in the silicon containing mask layer using the patterned organic mask, comprising providing an opening gas with an etchant component and polymerizing component, forming the opening gas into a plasma, and providing a pulsed bias with a pulse frequency between 10 Hz and 1 kHz, which etches features through the silicon containing mask layer with a second CD, which is less than half the first CD, forming a pattern in the silicon containing mask layer. The pattern of the silicon containing mask layer is transferred to the etch layer. | 01-30-2014 |
| 20140038419 | METHOD FOR PROVIDING VIAS - A method for forming via holes in an etch layer disposed below a patterned organic mask with a plurality of patterned via holes is provided. The patterned organic mask is treated by flowing a treatment gas comprising H | 02-06-2014 |
| 20140051256 | ETCH WITH MIXED MODE PULSING - A method for etching a dielectric layer disposed below a patterned organic mask with features, with hardmasks at bottoms of some of the organic mask features is provided. An etch gas is provided. The etch gas is formed into a plasma. A bias RF with a frequency between 2 and 60 MHz is provided that provides pulsed bias with a pulse frequency between 10 Hz and 1 kHz wherein the pulsed bias selectively deposits on top of the organic mask with respect to the dielectric layer. | 02-20-2014 |
| 20140179106 | IN-SITU METAL RESIDUE CLEAN - A method for forming devices in an oxide layer over a substrate, wherein a metal containing layer forms at least either an etch stop layer below the oxide layer or a patterned mask above the oxide layer, wherein a patterned organic mask is above the oxide layer is provided. The substrate is placed in a plasma processing chamber. The oxide layer is etched through the patterned organic mask, wherein metal residue from the metal containing layer forms metal residue on sidewalls of the oxide layer. The patterned organic mask is stripped. The metal residue is cleaned by the steps comprising providing a cleaning gas comprising BCl | 06-26-2014 |
| Patent application number | Description | Published |
|---|
| 20090177697 | CORRELATION AND PARALLELISM AWARE MATERIALIZED VIEW RECOMMENDATION FOR HETEROGENEOUS, DISTRIBUTED DATABASE SYSTEMS - A method is provided for generating a materialized view recommendation for at least one back-end server that is connected to a front-end server in a heterogeneous, distributed database system that comprises parsing a workload of federated queries to generate a plurality of query fragments; invoking a materialized view advisor on each back-end server with the plurality of query fragments to generate a set of candidate materialized views for each of the plurality of query fragments; identifying a first set of subsets corresponding to all nonempty subsets of the set of candidate materialized views for each of the plurality of query fragments; identifying a second set of subsets corresponding to all subsets of the first set of subsets that are sorted according to a dominance relationship based upon a resource time for the at least one back-end server to provide results to the front-end server for each of the first set of subsets; and performing a cost-benefit analysis of each of the second set of subsets to determine a recommended subset of materialized views that minimizes a total resource time for running the workload against the at least one back-end server. | 07-09-2009 |
| 20090281818 | QUALITY OF SERVICE AWARE SCHEDULING FOR COMPOSITE WEB SERVICE WORKFLOWS - A method of assigning web service requests to service providers includes searching for an optimal assignment from all possible assignments using a genetic algorithm (GA) that represents possible assignments as chromosomes, and converging towards an assignment of web service request to service providers that maximizes overall business value for all workflows to the service providers. An adaptive mutation scheme is used to introduce mutation into populations of chromosomes. The mutation scheme includes a mutation rate that increases when chromosomes under evaluation fail to improve its workload against the metric over a certain number of generations. | 11-12-2009 |
| 20130006988 | PARALLELIZATION OF LARGE SCALE DATA CLUSTERING ANALYTICS - A cluster selector may determine a plurality of sample clusters, and may reproduce the plurality of sample clusters at each of a plurality of processing cores. A sample divider may divide a plurality of samples stored in a database with associated attributes into a number of sample subsets corresponding to a number of the plurality of processing cores, and may associate each of the number of sample subsets with a corresponding one of the plurality of processing cores. A joint operator may perform a comparison of each sample of each sample subset at each corresponding core of the plurality of processing cores with respect to each of the plurality of sample clusters reproduced at the corresponding processing core, based on associated attributes thereof. | 01-03-2013 |
| 20130066455 | DEMAND-DRIVEN COLLABORATIVE SCHEDULING FOR JUST-IN-TIME MANUFACTURING - A schedule manager may include a chromosome comparator configured to compare a plurality of schedule chromosomes, each schedule chromosome including a potential schedule of use of manufacturing resources within one or more time intervals in producing one or more items, and configured to compare each of the plurality of schedule chromosomes relative to constraints, to thereby output a selected subset of the plurality of schedule chromosomes. The schedule manager may include a chromosome combiner configured to combine schedule chromosomes of the selected subset to obtain a next generation of schedule chromosomes for output to the chromosome comparator and for subsequent comparison therewith of the next generation of schedule chromosomes with respect to the constraints, as part of an evolutionary loop of the plurality of schedule chromosomes between the chromosome comparator and the chromosome combiner, and a scheduler configured to select a selected schedule chromosome therefrom. | 03-14-2013 |
| 20130066774 | METHOD AND SYSTEM FOR WORKING CAPITAL MANAGEMENT - In accordance with aspects of the disclosure, a system and methods are provided for managing working capital by scheduling payments to be paid for accounts payable based on payments received for accounts receivable relative to one or more time intervals while maintaining a predetermined working capital reserve threshold. The systems and methods may include calculating accounts receivable patterns for each customer to determine a confidence level in receiving payments from each customer within the one or more time intervals, generating one or more potential payment schemes for each vendor, and generating a payment schedule for accounts payable for each vendor within the one or more time intervals based on the determined confidence level for each customer and the one or more potential payment schemes for each vendor while maintaining the predetermined working capital reserve threshold. | 03-14-2013 |
| 20130117752 | HEURISTICS-BASED SCHEDULING FOR DATA ANALYTICS - A scheduler may receive a plurality of jobs for scheduling of execution thereof on a plurality of computing nodes. An evaluation module may provide a common interface for each of a plurality of scheduling algorithms. An algorithm selector may utilize the evaluation module in conjunction with benchmark data for a plurality of jobs of varying types to associate one of the plurality of scheduling algorithms with each job type. A job comparator may compare a current job for scheduling against the benchmark data to determine a current job type of the current job. The evaluation module may further schedule the current job for execution on the plurality of computing nodes, based on the current job type and the associated scheduling algorithm. | 05-09-2013 |
| 20130346380 | DATABASE ACCESS ACCELERATION - A system includes a request analyzer configured to receive a plurality of database requests and classify the plurality of database requests as transaction requester or non-transaction requests, and further configured to route the transaction requests to a transaction server for application against a transaction database, including write access to an identified portion thereof, and to route the non-transaction requests to a non-transaction server to thereby read data obtained from a non-transaction database. The system also includes an update manager configured to update the non-transaction database, based on the application of the transaction requests against the transaction database. | 12-26-2013 |
| 20140019984 | FEEDBACK-DRIVEN TUNING FOR EFFICIENT PARALLEL EXECUTION - A parallel execution manager may determine a parallel execution platform configured to execute tasks in parallel using a plurality of available processing threads. The parallel execution manager may include a thread count manager configured to select, from the plurality of available processing threads and for a fixed task size, a selected thread count, and a task size manager configured to select, from a plurality of available task sizes and using the selected thread count, a selected task size. The parallel execution manager may further include an optimizer configured to execute an iterative loop in which the selected task size is used as an updated fixed task size to obtain an updated selected thread count, and the updated selected thread count is used to obtain an updated selected task size. Accordingly, a current thread count and current task size for executing the tasks in parallel may be determined. | 01-16-2014 |
| 20140031965 | PRODUCTION SCHEDULING MANAGEMENT - In accordance with aspects of the disclosure, systems and methods are provided for production scheduling management by scheduling production events for each of a plurality of production resources used to manufacture one or more products relative to one or more time intervals while considering constraints related to product dependency trees for each of the one or more products. The systems and methods may include determining the constraints related to the product dependency trees for each of the one or more products, generating one or more potential production scheduling schemes for use of each production resource within the one or more time intervals while considering the constraints related to the product dependency trees for each of the one or more products, and generating a production schedule for the production events within the one or more time intervals based on the one or more potential production scheduling schemes. | 01-30-2014 |
| 20140032514 | ASSOCIATION ACCELERATION FOR TRANSACTION DATABASES - An association rule accelerator may be used to access a transaction database storing a plurality of transactions, each transaction including one or more items. The association rule accelerator also may select a sampling rate based on an item frequency of frequent items within the transaction database, relative to a sampled item frequency of sampled items within a corresponding sampled transaction database. An an association rule selector may determine, using the selected sampling rate and corresponding sampled transaction database, frequent item sets within the sampled transactions, and may further determine an association rule relating at least two items of the sampled transactions, based on the frequent item sets. | 01-30-2014 |
| 20140067601 | SUPPLY CHAIN FINANCE PLANNING - In accordance with aspects of the disclosure, a system and methods are provided for supply chain finance planning by generating a loan plan with a relatively low interest payment for an orders set having collateral related assets while maintaining a working capital reserve at a predetermined threshold. The systems and methods may include retrieving account information for buyers related to the collateral related assets, retrieving lending information for lenders and evaluating interest payment patterns for each lender based on the collateral related assets, generating one or more potential loan schemes for each lender based on accounts receivable patterns for each buyer and the interest payment patterns for each lender, and generating the loan plan with the relatively low interest payment for the orders set having the collateral related assets while maintaining the working capital reserve at the predetermined threshold based on the potential loan schemes for each lender. | 03-06-2014 |
| 20140089331 | INTEGRATED ANALYTICS ON MULTIPLE SYSTEMS - The embodiments provide a federated system for supporting an application to perform analytics. The federated system includes a first distributed system for performing one or more first tasks including processing incoming data into a set of data blocks, an in-memory database system for performing one or more second tasks including receiving the set of data blocks from the first distributed system and storing the set of data blocks in an internal storage, and a second distributed system for performing one or more third tasks including receiving at least one data block of the set from the in-memory database system and performing analytics on the at least one data block. Execution of the first, second, and third tasks are controlled via a scripting language utilized by the application and associated with the in-memory database system. | 03-27-2014 |
| 20140100992 | MATCHING ORDERS WITH INCOMING SHIPMENTS - The embodiments provide a system for matching orders with incoming shipments. The system may include a product shipment handler configured to receive product shipment information specifying incoming products, a product order handler configured to receive product order information specifying a plurality of product orders and input parameter information associated with each product order, a job dispatcher configured to create a plurality of jobs based on the product shipment information and the product order information, a modeling tool configured to model each job as a separate constrained linear optimization problem, and a linear solver configured to solve each constrained linear optimization problem based on the input parameter information and the product shipment information including generating a delivery plan for each product order within a respective job that matches at least one incoming product with a corresponding product order over a period of time. | 04-10-2014 |
| 20140101024 | PREDICTING FINANCIAL OUTCOME - The embodiments provide a system for predicting financial outcome of an order. The system includes a discriminant model training module configured to receive historical orders from a data source and to generate discriminant model parameters based on the historical orders, a discriminant model engine configured to receive at least one order to be analyzed and to calculate a probability for each of a plurality of outcomes for the at least one order to be analyzed based on the discriminant model parameters, and a strategy comparison module configured to calculate an expected business value for at least one strategy based on, in part, the probabilities for the plurality of outcomes to evaluate a risk associated with the at least one order. | 04-10-2014 |
| 20140164170 | CONFIGURABLE MULTI-OBJECTIVE RECOMMENDATIONS - The method includes determining at least one business objective on which to base a recommendation list for a first item, associating a configurable target with the business objective, the configurable target being based on a goal for a second item, determining at least one business constraint relating the first item with the second item, the at least one business constraint being based on the business objective and the associated configurable target and generating the recommendation list for the first item based on a list of candidate items and the business constraint. | 06-12-2014 |
| 20140279662 | TRANSPORTATION TIME ESTIMATION BASED ON MULTI-GRANULAR MAPS - An index engine may receive historical path data characterizing transportation paths in terms of associated conditions, and may define path segments of varying levels of granularity based on the historical path data, wherein relatively shorter path segments have relatively finer levels of granularity than those of path segments of relatively coarser levels of granularity. The index engine may then index each path segment, based on its corresponding level of granularity and its associated conditions. Then, a query processor may receive a query for a new transportation route, and determine a predicted transportation time for the new transportation route, using the indexed path segments. | 09-18-2014 |
| 20140379520 | DECISION MAKING CRITERIA-DRIVEN RECOMMENDATIONS - The embodiments provide a system for decision-making criteria-based recommendations. The system may include a decision engine configured to receive a request for recommendations for an option problem associated with a product or service category, and determine options among a plurality of options for the product or service category based on preference information. The preference information may include activated decision-making criteria and corresponding weight values. The corresponding weight values may represent a relative importance of each activated decision-making criterion. The decision engine may be configured to determine options among the plurality of options including calculating scores for the plurality of options based on, in part, the activated decision-making criteria and the corresponding weight values and selecting the options among the plurality of options based on the calculated scores. The decision engine may be configured to provide a display of the determined options as the recommendations for the product or service category. | 12-25-2014 |
| 20140379638 | CONCURRENT REQUEST HANDLING FOR DATABASE TRANSACTIONS - A request handler may receive transaction requests for transactions to be executed using data of a database, and may classify a first transaction request of the transaction requests as a simple transaction request, and a second transaction request of the transaction requests as a complex transaction request. A key-value store engine may execute a first transaction satisfying the first transaction request, using a key-value store of pre-calculated results determined prior to receipt of the first transaction request, and based on the data, and may update a key-value delta reflecting a change, if any, of the key-value store caused by the first transaction. A relational store engine may cause the at least one processor to execute a second transaction satisfying the second transaction request, using a relational store including a subset of the data, and may update a relational delta reflecting a change, if any, of the relational store caused by the second transaction. A synchronizer may execute a synchronization of the key-value store and the relational store, based on the key-value delta and the relational delta. | 12-25-2014 |
| 20150063123 | METHODS AND SYSTEMS FOR ROUTING SELECTION BASED ON ROUTING DISTANCE AND CAPACITY - A system, computer-readable storage medium storing at least one program, and computer-implemented method for route selection based on payload delivery capacity and routing distance are described. Network demand information is obtained. The network demand information may include a network graph and information related to an outbound demand of each node of the network graph. A simplified demand graph based on the outbound demand of each node and a distance between each node pair is generated. A plurality of return routes for the simplified network graph is generated and a payload delivery capacity of each of the routes is calculated. An advised return route from the plurality of return routes is generated based in part on the payload delivery capacities of the plurality of return routes. | 03-05-2015 |
| 20150074066 | DATABASE OPERATIONS ON A COLUMNAR TABLE DATABASE - A computer system includes at least one processor and at least one memory operably coupled to the at least one processor. The memory includes a memory pool and a database partitioned into multiple fragments. Each of the fragments is allocated a block of memory from the memory pool and the fragments store compressed data in a columnar table format. A database operation is applied in a compressed format to the compressed data in at least one of the fragments. | 03-12-2015 |
| 20150081077 | PRODUCTION RESOURCE MANAGEMENT - In accordance with aspects of the disclosure, systems and methods are provided for managing production resources including scheduling production events for production resources used to manufacture products relative to time intervals while maintaining collaboration among the production resources. The systems and methods may include retrieving information related to each production resource, evaluating each production event for each product to determine a sequence of the production events, and generating potential production scheduling schemes for use of each production resource within the time intervals while maintaining collaboration among the production resources. The systems and methods may include generating a production schedule for the production events within the time intervals based on the potential production scheduling schemes for use of each production resource within the time intervals while maintaining collaboration among the production resources. | 03-19-2015 |
| 20150081360 | Order/Vehicle Assignment Based on Order Density - Example systems and methods of assigning shipping orders to delivery vehicles are presented. In one example, a delivery region may be segmented into delivery blocks. A shipping order density may be determined for each of the delivery blocks. Adjacent delivery blocks having corresponding shipping order densities may be merged to yield delivery areas. A cost of using each type of available delivery vehicle to transport a delivery job may be determined relative to a cargo capacity of the vehicle type, a delivery distance, and a shipping order density. Each of the delivery areas may be partitioned into delivery jobs based on the cost of using each of the vehicle types. Each of the delivery jobs may be assigned to one of the available delivery vehicles based on minimizing a total cost of using the vehicles to transport the delivery jobs. | 03-19-2015 |
| 20150081471 | PERSONAL RECOMMENDATION SCHEME - A system may include a similarity measurement processing unit configured to determine a plurality of similar users that are similar to a user based on similarity values including calculating the similarity values for pairs of users based on an importance vector and differences between rated items. The importance vector may include importance values corresponding to a plurality of items, and each importance value may represent a similarity importance of a corresponding item. Each similarity value may represent a level of similarity between the user and another user. Also, the system may include a rating processor configured to estimate a rating value of an unrated item for potential recommendation based on recommendations from the plurality of similar users, and provide a recommendation for the item based on the rating value. | 03-19-2015 |
| 20150081656 | PROVISION OF SEARCH REFINEMENT SUGGESTIONS BASED ON MULTIPLE QUERIES - A query collector may be configured to receive a plurality of queries applied by a search engine to obtain corresponding search results. A graph manager may be configured to generate, based on the plurality of queries, a directed graph of nodes, each node corresponding to at least one query and connected to another node, and further configured to merge at least two of the nodes based on a similarity of corresponding queries thereof, to obtain a merged node, and generate at least one representative query representing the merged node. A suggestion generator may be configured to match a current query with a matching node of the nodes, determine that the merged node is a successor node of the matching node within the directed graph, and provide the at least one representative query as a suggested query for a future search to be conducted by the search engine. | 03-19-2015 |
| 20150081911 | MIGRATION EVENT SCHEDULING MANAGEMENT - In accordance with aspects of the disclosure, systems and methods are provided for scheduling migration events for server resources in a server cluster relative to a time interval while considering load balance constraints and data transfer constraints of the server cluster. The systems and methods may include generating one or more potential migration scheduling schemes for migration of each server resource to at least one other server resource in the server cluster within the time interval while considering the load balance constraints and the data transfer constraints of the server cluster, and generating a migration event schedule for each migration event within the time interval based on the one or more potential migration scheduling schemes generated for migration of each server resource to at least one other server resource in the server cluster. | 03-19-2015 |
| 20150088417 | System and Method for Dynamic Path Optimization - Techniques of dynamic path optimization are disclosed. In some embodiments, a method comprises receiving an instruction to determine an optimal path from a source geographical location to a destination geographical location, and determining an optimal path from the source geographical location to the destination geographical location using corresponding historical traffic information for each one of a plurality of sub-paths. The historical traffic information for each sub-path may correspond to an estimated arrival time at a start location for the corresponding sub-path and be used to select sub-paths from the plurality of sub-paths. The selected sub-paths may define the optimal path. In some embodiments, the historical traffic information comprises an indication of traffic flow for the corresponding sub-path. In some embodiments, the indication of traffic flow comprises an average speed of traffic flow. | 03-26-2015 |
| 20150088571 | SYSTEM AND METHOD FOR TASK ASSIGNMENT IN WORKFLOWS - The method includes determining an assignment completion time distribution based on a task set defining a project, determining a project completion time distribution based on the assignment completion time distribution and the task set, determining a project cost based on assignments of the task set, and generating a list of project task assignments based on the project cost and the project completion time distribution. | 03-26-2015 |
| 20150088907 | METHOD AND SYSTEM FOR MANAGING DATABASES HAVING RECORDS WITH MISSING VALUES - The method includes selecting a target record from a dataset, the target record including a missing value, partitioning records of the dataset into at least two groups including co-related data, the partitioned records including records having a value for a same field as the missing value in the target record, predicting the missing value based on a relationship between fields in each of the at least two groups associated with the partitioned records, and setting the missing value of the target record to the predicted value. | 03-26-2015 |
| 20150089358 | MANAGING A DISPLAY OF CONTENT - Techniques for managing display of content include identifying a document to present to a user on a graphical user interface (GUI); extracting at least one property of the document, the property including metadata associated with the document; determining a correlation between the document and one or more document topics associated with the user; determining an amount of time to display a portion of the document to the user through the GUI based at least in part on the property and the correlation; and displaying the portion of the document to the user through the GUI for the determined amount of time. | 03-26-2015 |
| Patent application number | Description | Published |
|---|
| 20080235291 | Readable physical storage replica and standby database system - A standby database system or another replica data system replicates changes, made to data blocks at a source database system or another primary data copy, to replicas of the data blocks at the standby database system or other replica. While replicating the changes to the data blocks thereof, the standby database system (or other replica) receives queries (or reads) issued thereto and computes the queries based on data read from the data blocks thereof. | 09-25-2008 |
| 20120323849 | Method For Maximizing Throughput And Minimizing Transaction Response Times On The Primary System In The Presence Of A Zero Data Loss Standby Replica - A method and system is provided for reducing delay to applications connected to a database server that guarantees no data loss during failure or disaster. After storing a log record persistently in a local primary log, the log writer returns control to the application which continues running concurrently with the database server sending the session's log records to a standby database. A separate back channel is used by the standby to communicate, out-of-band to the primary, the location of the last log record stored persistently to the standby log. An application waiting for a transaction to commit may wait until the transaction's commit record has been persisted. | 12-20-2012 |
| 20140059020 | REDUCED DISK SPACE STANDBY - A method and system for replicating database data is provided. One or more standby database replicas can be used for servicing read-only queries, and the amount of storage required is scalable in the size of the primary database storage. One technique is described for combining physical database replication to multiple physical databases residing within a common storage system that performs de-duplication. Having multiple physical databases allows for many read-only queries to be processed, and the de-duplicating storage system provides scalability in the size of the primary database storage. Another technique uses one or more diskless standby database systems that share a read-only copy of physical standby database files. Notification messages provide consistency between each diskless system's in-memory cache and the state of the shared database files. Use of a transaction sequence number ensures that each database system only accesses versions of data blocks that are consistent with a transaction checkpoint. | 02-27-2014 |
| 20140095530 | CONTAINER DATABASE - A container database may contain multiple database dictionaries, each database dictionary defining a pluggable database. When database sessions are established on a container DBMS, each database session is given access to a pluggable database by establishing the respective database dictionary of the pluggable database as the database dictionary for that database session. Database commands issued through database session can only access the database objects defined in the database dictionary established for the database session. | 04-03-2014 |
| 20140095553 | TECHNIQUES FOR MOVING DATA FILES WITHOUT INTERRUPTING ACCESS - Techniques for moving data files without interrupting access are described. A first process moves a database file from a first location to a second location while the database file is accessible to one or more other processes for read or write operations. According to one technique, the first process communicates a move status and a copy range into the database file to one or more database server instances executing the one or more other processes. The one or more other processes then perform input/output (IO) operations on the database file based at least in part on the move status and the copy range communicated by the first process. | 04-03-2014 |
| 20140164331 | TECHNIQUES FOR BACKUP RESTORE AND RECOVERY OF A PLUGGABLE DATABASE - A container database stores redo records and logical timestamps for multiple pluggable databases. When it is detected that a first read-write instance of the pluggable database is opened and no other read-write instances of the pluggable database are open, offline range data associated with the pluggable database is updated. When it is detected that a second read-write instance of the pluggable database is closed, and the second read-write instance is the last open read-write instance, the offline range data associated with the pluggable database is updated. The pluggable database is restored to a logical timestamp associated with a restore request based on the offline range data. | 06-12-2014 |
| 20140196055 | HIGH PERFORMANCE LOG-BASED PROCESSING - Each of a plurality of Worker processes are allowed to perform any and all of the following tasks involving logged work items: (1) reading a subset of the work items from a log; (2) sequentially ordering work items for corresponding data objects; (3) applying a sequentially ordered set of work items to a corresponding data object; and (4) transmitting a subset of work items to a Worker process running on another database server in a cluster, if necessary. These tasks can be performed concurrently, at will, and as available, by the Worker processes. An improved checkpointing technique eliminates the need for the Worker processes to get to a synchronization point and stop. Instead, a Coordinator process examines the current state of progress of the Worker processes and computes a past point in the sequence of work items at which all work items before that point have been completely processed, and records this point as the checkpoint. | 07-10-2014 |
| 20140258223 | ADAPTIVE HIGH-PERFORMANCE DATABASE REDO LOG SYNCHRONIZATION - A method, system, and computer program product for adaptive high-performance database redo log synchronization. The method commences upon performing a write operation of a redo log entry, the write operation concluding with an indication of completion of the write operation of the redo log entry. Any number of committing processes may be waiting for the indication of completion, and upon indication of completion, then (using a first synchronization mode) the processes or proxy measures the waiting time as experienced by the committing processes (e.g., while waiting for the indication of completion of the write operation of the redo log entry). In some cases a second synchronization mode would introduce less latency than the first synchronization mode, so the system changes to a second synchronization mode. The system can also change mode when a predicted second mode waiting time is smaller than the measured waiting time. | 09-11-2014 |
| 20140258224 | AUTOMATIC RECOVERY OF A FAILED STANDBY DATABASE IN A CLUSTER - A method, system, and computer program product. The method for non-intrusive redeployment of a standby database facility comprises configuring a database system having a shared lock manager process to synchronize two or more concurrent access instances, then granting lock requests for access to a cache of database blocks. At some moment in time, the shared lock manager process may fail, and a monitor process detects the failure or other stoppage of the shared lock manager process. A new shared lock manager process and other processes are started, at least one of which serves for identifying the database blocks in the cache that have not yet been written to the database. The identified blocks are formed into a recovery set of redo operations. During this time, incoming requests for access to the cache of database blocks are briefly blocked, at least until the recovery set of redo operations has been formed. | 09-11-2014 |
| 20140279917 | Techniques To Parallelize CPU and IO Work of Log Writes - Techniques are provided for managing cached data objects in a mixed workload environment. In an embodiment, a system, log data is stored in one or more buffers. In response to receiving a request to perform a logical write, a first process writes a first portion of the log data to a log file in persistent storage. While the first portion of the log data is being written to the log file, a second process writes a second portion of the log data in the one or more buffers to the log file in persistent storage. In another embodiment, a request to perform a second logical write may be received before the first logical write completes. While the first log data is being written to the log file, one or more processes write second log data for the second logical write to the log file. | 09-18-2014 |
