David B Levitt

US Patent:

7458050, Nov 25, 2008

Filed:

Mar 21, 2008

Appl. No.:

12/053384

Inventors:

Eli Arbel - Migdal Haemek, IL
Oded Fuhrmann - Zichron Yaakov, IL
Cynthia Rae Eisner - Zichron Yaacov, IL
Alexander Itskovich - Yoqneam Ilit, IL
David J. Levitt - Brooklyn NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/50

US Classification:

716 7, 716 2

Abstract:

A method to cluster Boolean functions for clock gating according to various exemplary embodiments can include identifying at least two small gating groups within a clock tree representative of an electrical network and at least two gating functions of the at least two small gating groups, wherein the at least two gating functions are Boolean functions; performing hierarchical clustering on the at least two gating functions using a similarity measure that describes a distance between the at least two gating functions such that the clustering forms a merge function of a cluster generated and displayed in a form of a dendrogram; assigning to each gating domain a merit value according to a power consumption profile of the gating domain using a merit function; and partitioning the cluster into gating groups using the dendrogram to construct a directed acyclic graph to determine a partition which maximize the overall power saving.

US Patent:

7562325, Jul 14, 2009

Filed:

Sep 24, 2008

Appl. No.:

12/236543

Inventors:

Eli Arbel - Migdal Haemek, IL
Oded Fuhrmann - Zichron Yaakov, IL
Cynthia Rae Eisner - Zichron Yaacov, IL
Alexander Itskovich - Yoqneam Ilit, IL
David J. Levitt - Brooklyn NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/50

US Classification:

716 7, 716 2

Abstract:

A system for clustering Boolean functions for clock gating according to various exemplary embodiments can include a computer configured to identify at least two small gating groups within a clock tree representative of an electrical network and at least two gating functions of the at least two small gating groups, wherein the at least two gating functions are Boolean functions; perform hierarchical clustering on the at least two gating functions using a similarity measure that describes a distance between the at least two gating functions such that the clustering forms a merge function of a cluster generated and displayed in a form of a dendrogram; assign to each gating domain a merit value according to a power consumption profile of the gating domain using a merit function; and partition the cluster into gating groups using the dendrogram to construct a directed acyclic graph to determine a partition which maximize the overall power saving.