The origin of dolomite in Shahejie Formation shale of Jiyang Depression in eastern China were studied by means of petrologic identification, compositional analysis by X-ray diffraction, stable carbon and oxygen isotop...The origin of dolomite in Shahejie Formation shale of Jiyang Depression in eastern China were studied by means of petrologic identification, compositional analysis by X-ray diffraction, stable carbon and oxygen isotopic composition, and trace element and rare earth element analyses. The results show that the development of dolomite is limited in the lacustrine organic rich shale of Shahejie Formation in the study area. Three kinds of dolomite minerals can be identified: primary dolomite(D1), penecontemporaneous dolomite(D2), and ankerite(Ak). D1 has the structure of primary spherical dolomite, high magnesium and high calcium, with order degree of 0.3-0.5, and is characterized by the intracrystalline corrosion and coexistence of secondary enlargement along the outer edge. D2 has the characteristics of secondary enlargement, order degree of 0.5-0.7, high magnesium, high calcium and containing a little iron and manganese elements. Ak is characterized by high order degree of 0.7-0.9, rhombic crystal, high magnesium, high calcium and high iron. The micritic calcite belongs to primary origin on the basis of the carbon and oxygen isotopic compositions and the fractionation characteristics of rare earth elements. According to the oxygen isotopic fractionation equation between paragenetic dolomite and calcite, it is calculated that the formation temperature of dolomite in the shale is between 36.76-45.83 ℃, belonging to lacustrine low-temperature dolomite. Based on the maturation and growth mechanism of primary and penecontemporaneous dolomite crystals, a dolomite diagenetic sequence and the dolomitization process are proposed, which is corresponding to the diagenetic environment of Shahejie Formation shale in the study area.展开更多
We describe a method for efficiently hashing multiple messages of different lengths. Such computations occur in various scenarios, and one of them is when an operating system checks the integrity of its components dur...We describe a method for efficiently hashing multiple messages of different lengths. Such computations occur in various scenarios, and one of them is when an operating system checks the integrity of its components during boot time. These tasks can gain performance by parallelizing the computations and using SIMD architectures. For such scenarios, we compare the performance of a new 4-buffers SHA-256 S-HASH implementation, to that of the standard serial hashing. Our results are measured on the 2nd Generation Intel? CoreTM Processor, and demonstrate SHA-256 processing at effectively ~5.2 Cycles per Byte, when hashing from any of the three cache levels, or from the system memory. This represents speedup by a factor of 3.42x compared to OpenSSL (1.0.1), and by 2.25x compared to the recent and faster n-SMS method. For hashing from a disk, we show an effective rate of ~6.73 Cycles/Byte, which is almost 3 times faster than OpenSSL (1.0.1) under the same conditions. These results indicate that for some usage models, SHA-256 is significantly faster than commonly perceived.展开更多
j-lanes hashing is a tree mode that splits an input message to j slices, computes j independent digests of each slice, and outputs the hash value of their concatenation. We demonstrate the performance advantage of j-l...j-lanes hashing is a tree mode that splits an input message to j slices, computes j independent digests of each slice, and outputs the hash value of their concatenation. We demonstrate the performance advantage of j-lanes hashing on SIMD architectures, by coding a 4-lanes-SHA-256 implementation and measuring its performance on the latest 3rd Generation IntelR CoreTM. For messages whose lengths range from 2 KB to 132 KB, we show that the 4-lanes SHA-256 is between 1.5 to 1.97 times faster than the fastest publicly available implementation that we are aware of, and between ~2 to ~2.5 times faster than the OpenSSL 1.0.1c implementation. For long messages, there is no significant performance difference between different choices of j. We show that the 4-lanes SHA-256 is faster than the two SHA3 finalists (BLAKE and Keccak) that have a published tree mode implementation. Finally, we explain why j-lanes hashing will be faster on the coming AVX2 architecture that facilitates using 256 bits registers. These results suggest that standardizing a tree mode for hash functions (SHA-256 in particular) could be useful for performance hungry applications.展开更多
基金Supported by the National Natural Science Foundation of China(Grant Nos.42172153,41802172)Sinopec Key Laboratory Project(Grant No.KL21042)Shengli Oilfield Company Project(Grant No.YKS2101)。
文摘The origin of dolomite in Shahejie Formation shale of Jiyang Depression in eastern China were studied by means of petrologic identification, compositional analysis by X-ray diffraction, stable carbon and oxygen isotopic composition, and trace element and rare earth element analyses. The results show that the development of dolomite is limited in the lacustrine organic rich shale of Shahejie Formation in the study area. Three kinds of dolomite minerals can be identified: primary dolomite(D1), penecontemporaneous dolomite(D2), and ankerite(Ak). D1 has the structure of primary spherical dolomite, high magnesium and high calcium, with order degree of 0.3-0.5, and is characterized by the intracrystalline corrosion and coexistence of secondary enlargement along the outer edge. D2 has the characteristics of secondary enlargement, order degree of 0.5-0.7, high magnesium, high calcium and containing a little iron and manganese elements. Ak is characterized by high order degree of 0.7-0.9, rhombic crystal, high magnesium, high calcium and high iron. The micritic calcite belongs to primary origin on the basis of the carbon and oxygen isotopic compositions and the fractionation characteristics of rare earth elements. According to the oxygen isotopic fractionation equation between paragenetic dolomite and calcite, it is calculated that the formation temperature of dolomite in the shale is between 36.76-45.83 ℃, belonging to lacustrine low-temperature dolomite. Based on the maturation and growth mechanism of primary and penecontemporaneous dolomite crystals, a dolomite diagenetic sequence and the dolomitization process are proposed, which is corresponding to the diagenetic environment of Shahejie Formation shale in the study area.
文摘We describe a method for efficiently hashing multiple messages of different lengths. Such computations occur in various scenarios, and one of them is when an operating system checks the integrity of its components during boot time. These tasks can gain performance by parallelizing the computations and using SIMD architectures. For such scenarios, we compare the performance of a new 4-buffers SHA-256 S-HASH implementation, to that of the standard serial hashing. Our results are measured on the 2nd Generation Intel? CoreTM Processor, and demonstrate SHA-256 processing at effectively ~5.2 Cycles per Byte, when hashing from any of the three cache levels, or from the system memory. This represents speedup by a factor of 3.42x compared to OpenSSL (1.0.1), and by 2.25x compared to the recent and faster n-SMS method. For hashing from a disk, we show an effective rate of ~6.73 Cycles/Byte, which is almost 3 times faster than OpenSSL (1.0.1) under the same conditions. These results indicate that for some usage models, SHA-256 is significantly faster than commonly perceived.
文摘j-lanes hashing is a tree mode that splits an input message to j slices, computes j independent digests of each slice, and outputs the hash value of their concatenation. We demonstrate the performance advantage of j-lanes hashing on SIMD architectures, by coding a 4-lanes-SHA-256 implementation and measuring its performance on the latest 3rd Generation IntelR CoreTM. For messages whose lengths range from 2 KB to 132 KB, we show that the 4-lanes SHA-256 is between 1.5 to 1.97 times faster than the fastest publicly available implementation that we are aware of, and between ~2 to ~2.5 times faster than the OpenSSL 1.0.1c implementation. For long messages, there is no significant performance difference between different choices of j. We show that the 4-lanes SHA-256 is faster than the two SHA3 finalists (BLAKE and Keccak) that have a published tree mode implementation. Finally, we explain why j-lanes hashing will be faster on the coming AVX2 architecture that facilitates using 256 bits registers. These results suggest that standardizing a tree mode for hash functions (SHA-256 in particular) could be useful for performance hungry applications.
