摘要:
Composition based on a crosslinkable polyethylene comprising from 0.05 to 0.24 hydrolysable silane groups per 100 —CH2— units and having a standard density SD of at least 954 kg/m3 and a melt flow index MI5 of less than 1.5 g/10 min. Pipes for the transportation of fluids under pressure, which can be obtained by extruding this composition and then hydrolysing it.
摘要:
Composition based on a crosslinkable polyethylene comprising from 0.05 to 0.24 hydrolysable silane groups per 100 —CH2— units and having a standard density SD of at least 954 kg/m3 and a melt flow index MI5 of less than 1.5 g/10 min. Pipes for the transportation of fluids under pressure, which can be obtained by extruding this composition and then hydrolysing it.
摘要翻译:基于可交联聚乙烯的组合物,其包含每100个-CH2-单元0.05至0.24个可水解硅烷基团,并且具有至少954kg / m 3的标准密度SD和小于1.5g / 10min的熔体流动指数MI5 。 用于在压力下输送流体的管道,其可以通过挤出该组合物然后水解而获得。
摘要:
A system and method is provided for improving efficiency, power, and bandwidth consumption in parallel processing. Rather than requiring memory polling to ensure ordered execution of processes or threads in wavefronts, the techniques disclosed herein provide a system and method to allow any process or thread in a wavefront to run out of order as long as needed, but ensure ordered execution of multiple ordered instructions when needed. These operations are handled efficiently in hardware, but are flexible enough to be implemented in all manner of programming models.
摘要:
A graphics processing system comprises at least one memory device storing a plurality of pixel command threads and a plurality of vertex command threads. An arbiter coupled to the at least one memory device is provided that selects a pixel command thread from the plurality of pixel command threads and a vertex command thread from the plurality of vertex command threads. The arbiter further selects a command thread from the previously selected pixel command thread and the vertex command thread, which command thread is provided to a command processing engine capable of processing pixel command threads and vertex command threads.
摘要:
Systems and methods for pipelined synchronization in a write-combining cache are described herein. An embodiment to transmit data to a memory to enable pipelined synchronization of a cache includes obtaining a plurality of synchronization events for transactions with said memory, calculating one or more matches between said events and said data stored in one or more cache-lines of said cache, storing event time stamps of events associated with said matches, generating one or more priority values based on said event time stamps, concurrently transmitting said data to said memory based on said priority values.
摘要:
A method for determining the appearance of a pixel includes receiving fragment data for a pixel to be rendered; storing the fragment data; and determining an appearance value for the pixel based on the stored fragment data, wherein a portion of the stored fragment data is dropped when the number of fragment data per pixel exceeds a threshold value enabling large savings in memory footprint without impacting perceivably on the image quality. A graphics processor includes a rasterizer operative to generate fragment data for a pixel to be rendered in response to primitive information; and a render back end circuit, coupled to the rasterizer, operative to determine a pixel appearance value based on the fragment data by dropping the fragment data having the least effect on pixel appearance.
摘要:
A method and apparatus for generating hierarchical depth culling characteristics includes determining a first minimum depth value and a first maximum depth value for a first graphical element. The graphical element may be a primitive. The first minimum depth value may be a minimum Z-plane depth of a pixel within the primitive and a first maximum depth value is a maximum Z-plane value for a pixel within the primitive. The method and apparatus further includes determining a second minimum depth value and a second maximum depth value for a second graphical element, which may be a tile. The method and apparatus further includes calculating an intersection depth range having an intersection minimum depth value and an intersection maximum depth value based on the intersection of the first minimum depth value and the first maximum depth value and the second minimum depth value and the second maximum depth value.
摘要:
A graphics processing system comprises at least one memory device storing a plurality of pixel command threads and a plurality of vertex command threads. An arbiter coupled to the at least one memory device is provided that selects a command thread from either the plurality of pixel or vertex command threads based on relative priorities of the plurality of pixel command threads and the plurality of vertex command threads. The selected command thread is provided to a command processing engine capable of processing pixel command threads and vertex command threads.
摘要:
A method and corresponding apparatus for calculating the centroid of a fragment to be rendered is disclosed. The method calls for moving the sampling point of a pixel from its initial center point to the center of the fragment containing a portion of an image to be rendered. The method comprises the steps of receiving a coverage mask containing at least one sample point of the pixel fragment under consideration; determining which of the sample points are within the fragment; determining a value representative of the number of sample points that are within the fragment; determining offset values of the fragment centroid based on the number of sample points within the fragment; and determining the barycentric coordinates of the centroid of the fragment. The centroid of the fragment is where sampling of the primitive will occur. By sampling at the centroid of the fragment, rendered image quality is improved due to the reduced anti-aliasing effects at the edges of the primitive.
摘要:
A system and method is provided for improving efficiency, power, and bandwidth consumption in parallel processing. Rather than using memory polling to ensure that enough space is available in memory locations for, for example, write instructions, the techniques disclosed herein provide a system and method to automate this evaluation mechanism in environments such as data-parallel processing to efficiently check available space in memory locations before instructions such as write threads are allowed. These operations are handled efficiently in hardware, but are flexible enough to be implemented in all manner of programming models.