1461051666-31d7f935-187c-4cc2-9f8a-9cd0d6b26f80

We claim:

1. A method for fabricating a precious-metal electrode for a storage capacitor, which comprises:
providing a substrate;
applying a catalytically inactive insulation to the substrate;
applying a catalytically active connection region to the substrate, the catalytically active connection region being a precious metal material selected from the group consisting of a precious metal and an oxide of a precious metal;
producing the catalytically active connection region and the catalytically inactive insulation region; and
depositing selectively the precious metal material on the catalytically active connection region by passing an organometallic compound of a precious metal to the substrate at a temperature from 0 to 120 C.
2. The method according to claim 1, wherein the step of producing of the catalytically active connection region and the catalytically inactive insulation region includes patterning the connection region.
3. The method according to claim 1, wherein the step of producing the catalytically active connection region and the catalytically inactive insulation region includes planarizing the connection region and the insulation region.
4. The method according to claim 1, wherein the temperature is from 20 to 80 C. during the step of depositing selectively the precious metal material on the catalytically active connection region by passing the organometallic compound of the precious metal material to the substrate.
5. The method according to claim 4, wherein the temperature is from 40 to 70 C. during the step of depositing selectively the precious metal material on the catalytically active connection region by passing the organometallic compound of the precious metal material to the substrate.
6. The method according to claim 1, which further comprises choosing the organometallic compound of a precious metal from the group consisting of Pt(CO)2Cl2, Cp*PtMe2, and CpPtMe3.
7. The method according to claim 1, which further comprises using a reducing agent while depositing selectively the precious metal material on the catalytically active connection region.
8. The method according to claim 7, which further comprises using hydrogen (H2) as the reducing agent.
9. The method according to claim 1, which further comprises pressurizing from 104 to 10 bar during the depositing selectively of the precious metal material on the catalytically active connection region.
10. The method according to claim 9, which further comprises pressuring from 103 to 101 bar during the depositing selectively of the precious metal material on the catalytically active connection region.
11. The method according to claim 1, which further comprises selecting the catalytically inactive insulation region from the group consisting of SiO2, Si3N4, Al2O3, AlN, BN, MgO, La2O3, LaN, Y2O3, YN, Sc2O3, ScN, TiO2, Ta2O3, and oxides of lanthanides.
12. The method according to claim 1, which further comprises including in the catalytically active connection region elements selected from the group consisting of rhodium, iridium, ruthenium, osmium, and rhenium.
13. The method according to claim 1, which further comprises including in the catalytically active connection region oxides of elements selected from the group consisting of rhodium, iridium, ruthenium, osmium, and rhenium.
14. The method according to claim 1, which further comprises selecting the precious metal for the precious-metal electrode from the group consisting of platinum, palladium, rhodium, iridium, ruthenium, osmium, and rhenium.
15. The method according to claim 1, which further comprises depositing the connection region as a layer.
16. The method according to claim 2, which further comprises patterning the connection region using a hard mask.
17. The method according to claim 1, which further comprises depositing the insulation region as a layer.
18. The method according to claim 3, wherein the planarizing step includes a CMP step.
19. A method for fabricating a precious-metal electrode for a storage capacitor, which comprises:
providing a substrate;
applying a catalytically active connection region to the substrate, the catalytically active connection region being a precious metal material selected from the group consisting of a precious metal and an oxide of a precious metal;
applying a catalytically inactive insulation region to the substrate;
producing a catalytically active connection region and a catalytically inactive insulation region; and
depositing selectively the precious metal material on the catalytically active connection region by passing Pt(PF3)4 to the substrate at a temperature of from 80 to 150 C.
20. The method according to claim 19, wherein the step of producing the catalytically active connection region and the catalytically inactive insulation region includes patterning the connection region.
21. The method according to claim 19, wherein the step of producing the catalytically active connection region and the catalytically inactive insulation region includes planarizing the connection region and the insulation region.
22. The method according to claim 19, wherein the step of depositing selectively the precious metal material on the catalytically active connection region is conducted at a temperature from 100 to 120 C.
23. The method according to claim 19, which further comprises using a reducing agent while depositing selectively the precious metal material on the catalytically active connection region.
24. The method according to claim 23, which further comprises using hydrogen (H2) as the reducing agent.
25. The method according to claim 19, which further comprises pressurizing from 104 to 10 bar during the step of depositing selectively the precious metal material on the catalytically active connection region.
26. The method according to claim 25, which further comprises pressuring from 103 to 101 bar during the step of depositing selectively the precious metal material on the catalytically active connection region.
27. The method according to claim 19, which further comprises selecting the catalytically inactive insulation region from the group consisting of SiO2, Si3N4, Al2O3, AlN, BN, MgO, La2O3, LaN, Y2O3, YN, Sc2O3, ScN, TiO2, Ta2O3, and oxides of lanthanides.
28. The method according to claim 19, which further comprises including in the catalytically active connection region elements selected from the group consisting of rhodium, iridium, ruthenium, osmium, and rhenium.
29. The method according to claim 19, which further comprises including in the catalytically active connection region oxides of elements selected from the group consisting of rhodium, iridium, ruthenium, osmium, and rhenium.
30. The method according to claim 19, which further comprises selecting the precious metal for the precious-metal electrode from the group consisting of platinum, palladium, rhodium, iridium, ruthenium, osmium, and rhenium.
31. The method according to claim 19, which further comprises depositing the connection region as a layer.
32. The method according to claim 20, which further comprises patterning the connection region using a hard mask.
33. The method according to claim 19, which further comprises depositing the insulation region as a layer.
34. The method according to claim 21, wherein the planarizing step includes a CMP step.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A method for sub-block partitioning for hash-based deduplication by a processor device in a computing environment, the method comprising:
defining a minimal size and maximum size of the sub-blocks;
if one of a plurality of search criteria is not satisfied by one of a plurality of hash values, incrementing a current position of one of the plurality of hash values by at least one byte, and if the maximum size of the sub-block is not reached prior to satisfying one of the plurality of search criteria, calculating a next one of the plurality of hash values to test using the one of the plurality of search criteria;
if one of the plurality of search criteria is satisfied by one of the plurality of hash values, declaring a position of the one of the plurality of hash values as a boundary position of the sub-block;
if the maximum size of the sub-block is reached prior to satisfying one of the plurality of search criteria, declaring a position of an alternative one of the plurality of hash values that is selected based upon an alternative one of the plurality of search criteria as the boundary position of the sub-block; and
satisfying one of the plurality of search criteria if n bits at predefined positions of a value calculated by applying an XOR operation on last calculated k hash values are equal to one of an mth predefined different patterns of bits, and applying one of a plurality of operations that combines values of the last calculated k hash values and produces alternative values whose statistical distribution being the same as the statistical distribution of the plurality of hash values being combined.
2. The method of claim 1, further including, for each boundary start position of a sub-block, starting a search for the boundary position of the sub-block after the minimal size of the sub-block by using the plurality of search criteria to test the plurality of hash values that are generated during the search, wherein the plurality of hash values includes at least individual hash values and derived hash values that are derived from sets of underlying hash values.
3. The method of claim 1, wherein the one of the plurality of search criteria includes one of a first type search criteria and a second type search criteria, and the alternative one of the plurality of search criteria is a third type search criteria, and further wherein the first type search criteria is satisfied if n bits at predefined positions of a last calculated hash value are equal to one of an mth predefined different patterns of bits.
4. The method of claim 1, further including in the plurality of hash values a minimum hash value, a maximum hash value, a last calculated hash value, and last calculated k hash values.
5. The method of claim 1, further including identifying the boundary start position as one of a start of a block, a last selected boundary position, and one or more bytes following a last identified boundary end position.
6. The method of claim 3, further including satisfying the third type search criteria by selecting a boundary position of the sub-block by selecting one of the plurality of hash values that are calculated during the search by at least one of:
selecting the maximum hash value,
selecting the minimum hash value, and
selecting an nth largest or a smallest hash value.
7. The method of claim 6, further including providing a range of predefined positions of the plurality of hash values that are considered as input for a selection method, wherein the range of predefined positions is a subset of an entire available range for predefined positions.
8. The method of claim 1, further including using a rolling hash function to calculate the individual hash values at every byte position.
9. A system for sub-block partitioning for hash-based deduplication in a computing environment, comprising:
a processor device, operable in the computing environment, wherein the processor device:
defines a minimal size and maximum size of the sub-block,
if one of a plurality of search criteria is not satisfied by one of a plurality of hash values, increments a current position of one of the plurality of hash values by at least one byte, and if the maximum size of the sub-block is not reached prior to satisfying one of the plurality of search criteria, calculating a next one of the plurality of hash values to test using the one of the plurality of search criteria,
if one of the plurality of search criteria is satisfied by one of the plurality of hash values, declares a position of the one of the plurality of hash values as a boundary position of the sub-block,
if the maximum size of the sub-block is reached prior to satisfying one of the plurality of search criteria, declares a position of an alternative one of the plurality of hash values that is selected based upon an alternative one of the plurality of search criteria as the boundary position of the sub-block, and
satisfies one of the plurality of search criteria if n bits at predefined positions of a value calculated by applying a XOR operation on last calculated k hash values are equal to one of an mth predefined different patterns of bits, and applying one of a plurality of operations that combines values of the last calculated k hash values and produces alternative values whose statistical distribution being the same as the statistical distribution of the plurality of hash values being combined.
10. The system of claim 9, wherein the processor device, for each boundary start position of a sub-block, starts a search for the boundary position of the sub-block after the minimal size of the sub-block by using the plurality of search criteria to test the plurality of hash values that are generated during the search, wherein the plurality of hash values includes at least an individual hash value and derived hash values that are derived from sets of underlying hash values.
11. The system of claim 9, wherein the one of the plurality of search criteria includes one of a first type search criteria and a second type search criteria, and the alternative one of the plurality of search criteria is a third type search criteria, further wherein the processor device satisfies the first type search criteria if n bits at predefined positions of a last calculated hash value are equal to one of an mth predefined different patterns of bits.
12. The system of claim 9, wherein the processor device includes in the plurality of hash values a minimum hash value, a maximum hash value, a last calculated hash value, and last calculated k hash values.
13. The system of claim 9, wherein the processor device identifies the boundary start position as one of a start of a block, a last selected boundary position, and one or more bytes following a last identified boundary end position.
14. The system of claim 11, wherein the processor device satisfies the third type search criteria by selecting a boundary position of the sub-block by selecting one of the plurality of hash values that are calculated during the search by at least one of:
selecting the maximum hash value,
selecting the minimum hash value, and
selecting an nth largest or a smallest hash value.
15. The system of claim 14, wherein the processor device provides a range of predefined positions of the plurality of hash values that are considered as input for a selection method, wherein the range of predefined positions is a subset of an entire available range for predefined positions.
16. The system of claim 9, wherein the processor device uses a rolling hash function to calculate the individual hash values at every byte position.
17. A computer program product for sub-block partitioning for hash-based deduplication by a processor device, the computer program product embodied on a non-transitory computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising:
a first executable portion for defining a minimal size and maximum size of the sub-block;
a second executable portion for, if one of a plurality of search criteria is not satisfied by one of a plurality of hash values, incrementing a current position of one of the plurality of hash values by at least one byte, and if the maximum size of the sub-block is not reached prior to satisfying one of the plurality of search criteria, calculating a next one of the plurality of hash values to test using the one of the plurality of search criteria;
a third executable portion for, if one of the plurality of search criteria is satisfied by one of the plurality of hash values, declaring a position of the one of the plurality of hash values as a boundary position of the sub-block;
a fourth executable portion for, if the maximum size of the sub-block is reached prior to satisfying one of the plurality of search criteria, declaring a position of an alternative one of the plurality of hash values that is selected based upon an alternative one of the plurality of search criteria as the boundary position of the sub-block; and
a fifth executable portion for satisfying the second type search criteria if n bits at predefined positions of a value calculated by applying a XOR operation on last calculated k hash values are equal to one of an mth predefined different patterns of bits, and applying one of a plurality of operations that combines values of the last calculated k hash values and produces alternative values whose statistical distribution being the same as the statistical distribution of the plurality of hash values being combined.
18. The computer program product of claim 17, further including, for each boundary start position of a sub-block, a sixth executable portion for starting a search for a boundary position of the sub-block after the minimal size of the sub-block by using the plurality of search criteria to test the plurality of hash values that are generated during the search, wherein the plurality of hash values includes at least an individual hash value and derived hash values that are derived from sets of underlying hash values.
19. The computer program product of claim 17, wherein the one of the plurality of search criteria includes one of a first type search criteria and a second type search criteria, and the alternative one of the plurality of search criteria is a third type search criteria, and further including satisfying the first type search criteria if n bits at predefined positions of a last calculated hash value are equal to one of an mth predefined different patterns of bits.
20. The computer program product of claim 17, further including a sixth executable portion for including in the plurality of hash values that are calculated during the search a minimum hash value, a maximum hash value, a last calculated hash value, and last calculated k hash values.
21. The computer program product of claim 17, further including a sixth executable portion for identifying the boundary start position as one of a start of a block, a last selected boundary position, and one or more bytes following a last identified boundary end position.
22. The computer program product of claim 19, further including a sixth executable portion for satisfying the third type search criteria by selecting a boundary position of the sub-block by selecting one of the plurality of hash values that are calculated during the search by at least one of:
selecting the maximum hash value,
selecting the minimum hash value, and
selecting an nth largest or a smallest hash value.
23. The computer program product of claim 22, further including a seventh executable portion for providing a range of predefined positions of the plurality of hash values that are considered as input for a selection method, wherein the range of predefined positions is a subset of an entire available range for predefined positions.
24. The computer program product of claim 17, further including a sixth executable portion for using a rolling hash function to calculate the individual hash values at every byte position.