International Business Machines Corporation

Xilinx, Inc.

Affymetrix, Inc.

Chun Zhang

Chunqiang Tang

Rong Nickle Chang

Guy Maring Lohman

Fausto Bernardini

Tao Tao

Edward Cholchin So

Fan Zhang

Nimrod Megiddo

Giulia C Kennedy

Jun Rao

Karthik Rajagopal Gomadam

Perng Chang-shing

Yaron Turpaz

Peter Haas

Vanja Josifovski

Chang-Shing Perng

Bing Tian

Chaithanya Dudha

Satish B Sivaswamy

Krishna Garlapati

Mehrdad Eslami Dehkordi

Frederic Revenu

Garik Mkrtchyan

Nithin Kumar Guggilla

Anup Kumar Sultania

Nicholas A Mezei

Klaus Sonnenleiter

Frank Mueller

Sunjit Tara

Jichun Wang

Thomas O Satter

Synthetizing a hardware description language code into a netlist comprising loads and a multi-clock buffer (MBUF). The MBUF receives a global clocking signal and generates a first and a second related clocking signals. The loads are grouped into a first and a second groups receiving the first and the second clocking signals respectively. A first/second clock modifying leaf are placed between a common node and the first/group groups respectively, wherein the common node is positioned closer in proximity to the first/second groups in comparison to a clock source generating the global clocking signal. The first/second clock modifying leaves receive a least divided clocking signal from the MBUF and generate the first/second clocking signals respectively. The least divided clocking signal is routed from the MBUF to the first/second clock modifying leaves. The first/second clocking signals are routed from the first/second clock modifying leaves to the first/second group respectively.

Synchronous clock domain crossing skew optimization and multi-clock buffer (MBUFG)

Examples described herein provide a method for optimizing a netlist for an integrated circuit device. The method generally includes receiving a netlist comprising a first lookup table, and upstream logic, wherein the upstream logic receives a plurality of input signals and comprises at least one output connected as at least one input to the first lookup table, wherein the first lookup table comprises an unused input and multiple outputs; mapping the plurality of input signals directly to the at least one input and the unused input of the first lookup table; validating the mapping by monitoring the multiple outputs of the first lookup table; and upon a successful validation, optimizing the netlist by removing the upstream logic and reconnecting the plurality of input signals to the at least one input and the unused input of the first lookup table.

Multiple output constrained input lookup table generation

Disclosed approaches of processing a circuit design include determining a subset of addresses of a first RAM of the circuit design that are accessed more often than a frequency threshold. A specification of a second RAM is created for the subset of addresses. A decoder circuit is added to the circuit design. The decoder circuit is configured to enable the second RAM and disable the first RAM in response to an input address in the subset of addresses, and to enable the first RAM and disable the second RAM in response to an input address other than addresses in the subset of addresses.

Partitioning memory blocks for reducing dynamic power consumption

A computer-implemented method for determining resources utilized by a service request in a data processing system. The method includes determining monitored relationship types from monitoring data, determining relationship domains, determining intra-domain relationships from relationships that are internal to the relationship domains and determining cross-domain relationships from the intra-domain relationships that are linked between pairs of the relationship domains, and determining resources utilized by the service request from the intra-domain and cross-domain relationships. The domains are derived from one of the relationship types that is monitored by a single monitoring application.

System and method for determining and optimizing resources of data processing system utilized by a service request

System and method for determining and optimizing resources of a data processing system utilized by a service request

A computer system for visualizing recombination events in a group of individuals is provided. According to one aspect of the invention, high-density SNP genotype data is obtained from related individuals in a family. A pedigree is created, haplotypes are reconstructed and likely recombination breakpoints are identified with the use of publicly available computer programs. A software tool is then used facilitate the visualization of the recombination events in the family.

Computer software for visualizing genotyping data

Throughput of a high-volume throughput-centric computer system is controlled by dynamically adjusting a concurrency level of a plurality of events being processed in a computer system to meet a predetermined target for utilization of one or more resources of a computer system. The predetermined target is less than 100% utilization of said one or more resources. The adjusted concurrency level is validated using one or more queuing models to check that said predetermined target is being met. Parameters are configured for adjusting the concurrency level. The parameters are configured so that said one or more resources are shared with one or more external programs. A statistical algorithm is established that minimizes total number of samples collected. The samples may be used to measure performance used to further dynamically adjust the concurrency level. A dynamic thread sleeping method is designed to handle systems that need only a very small number of threads to saturate bottleneck resources and hence are sensitive to concurrency level changes.

Black-box performance control for high-volume throughput-centric systems

Checking health of information technology infrastructure based on log data, in one aspect, may collect log data non-intrusively from a production system, said log data at least associated with transactions occurring in the production system and resource utilization of the production system, may normalize said log data into a plurality of log data types, may perform data regression analysis using said plurality of log data types to estimate resources consumed by each of said transactions and throughput of each of said transactions, and may use a queuing model to predict performance of the information technology infrastructure under various workloads.

Healthcheck of information technology infrastructure based on log data

A system for automating data partitioning in a parallel database includes plural nodes connected in parallel. Each node includes a database server and two databases connected thereto. Each database server includes a query optimizer. Moreover, a partitioning advisor communicates with the database server and the query optimizer. The query optimizer and the partitioning advisor include a program for recommending and evaluating data table partitions that are useful for processing a workload of query statements. The data table partitions are recommended and evaluated without requiring the data tables to be physically repartitioned.

System and method for automating data partitioning in a parallel database

Computer software for visualizing recombination events in a group of individuals from recombination breakpoints and assignments in high density SNP genotyping data by generating a color-coded view for each individual chromosome and a whole genome view for the group

Provided is a method for modeling the cost of XML as well as relational operators. As with traditional relational cost estimation, a set of system catalog statistics that summarizes the XML data is exploited; however, the novel use of a set of simple path statistics is also proposed. A new statistical learning technique called transform regression is utilized instead of detailed analytical models to predict the overall cost of an operator. Additionally, a query optimizer in a database is enabled to be self-tuning, automatically adapting to changes over time in the query workload and in the system environment.

Method for estimating the cost of query processing

Growing community of inventors

San Jose, CA, United States of America

Chun Zhang