Patents by Inventor Mark E. Pascual
Mark E. Pascual has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 10263858Abstract: A system and method for generating a simulation environment are provided. In example aspects, in response to a request from a user of an environment simulation system, specifying a desired web performance metric to result from the execution of a particular content item, the environment simulation system constructs a simulation environment. The environment simulation system is configured to test the particular content item within the constructed simulation environment and compare a baseline web performance metric to the requested web performance metric. In some aspects, if the requested web performance metric is not achieved, the environmental simulation system is configured to perform tuning and continue simulating until the requested web performance metric is achieved. Once tuning is complete, a user can modify a content item and continue simulating to observe improvements in web performance of a content item for a user in a particular geographic region.Type: GrantFiled: February 7, 2017Date of Patent: April 16, 2019Assignee: Microsoft Technology Licensing, LLCInventors: Prasanna Vijayanathan, Anant Rao, Sreedhar Veeravalli, Mark E. Pascual
-
Publication number: 20180227211Abstract: A system and method for generating a simulation environment are provided. In example aspects, in response to a request from a user of an environment simulation system, specifying a desired web performance metric to result from the execution of a particular content item, the environment simulation system constructs a simulation environment. The environment simulation system is configured to test the particular content item within the constructed simulation environment and compare a baseline web performance metric to the requested web performance metric. In some aspects, if the requested web performance metric is not achieved, the environmental simulation system is configured to perform tuning and continue simulating until the requested web performance metric is achieved. Once tuning is complete, a user can modify a content item and continue simulating to observe improvements in web performance of a content item for a user in a particular geographic region.Type: ApplicationFiled: February 7, 2017Publication date: August 9, 2018Inventors: Prasanna Vijayanathan, Anant Rao, Sreedhar Veeravalli, Mark E. Pascual
-
Patent number: 9137193Abstract: The disclosed embodiments provide a system that facilitates access to content associated with a group. During operation, the system provides, to a first user in the group, a digest email comprising a set of links to the content. Next, the system increases a relevance of the digest email to the first user by selecting a subject header for the digest email based on usage patterns associated with at least one of the first user and one or more other users related to the first user.Type: GrantFiled: December 6, 2012Date of Patent: September 15, 2015Assignee: LinkedIn CorporationInventors: Xiaohui Wu, Ian M. McCarthy, Mark E. Pascual, Vinh V. To
-
Publication number: 20140164526Abstract: The disclosed embodiments provide a system that facilitates access to content associated with a group. During operation, the system provides, to a first user in the group, a digest email comprising a set of links to the content. Next, the system increases a relevance of the digest email to the first user by selecting a subject header for the digest email based on usage patterns associated with at least one of the first user and one or more other users related to the first user.Type: ApplicationFiled: December 6, 2012Publication date: June 12, 2014Applicant: LINKEDIN CORPORATIONInventors: Xiaohui Wu, Ian M. McCarthy, Mark E. Pascual, Vinh V. To
-
Patent number: 7737994Abstract: A multi-chip system and method are disclosed that utilizes a plurality of graphics pipelines to perform large kernel convolution. Each graphics pipeline includes a standard rendering unit and a video data convolve unit. Each video data convolve unit receives video pixel data from the video output of the standard rendering unit. The video data convolve units are connected in a chain. Each group of one or more video data convolve units in the chain convolves the video pixel data received by the group. The last video data convolve unit in the chain outputs a stream of convolved pixels.Type: GrantFiled: September 26, 2003Date of Patent: June 15, 2010Assignee: Oracle America, Inc.Inventors: Michael A. Wasserman, Ewa M. Kubalska, Nathaniel David Naegle, Brian D. Emberling, Paul R. Ramsey, Mark E. Pascual
-
Patent number: 7023444Abstract: A rendering unit positions a supertile so that it intersects a primitive. The rendering unit repeatedly walks over bins of the supertile, applying a layer of texture to the bins of the supertile in each iteration of said repeated walking. The rendering unit advances to the next texture layer after having applied the current texture layer to each candidate bin of the supertile. The results of each texture layer application to the bins may be stored in a texture accumulation buffer. The size of the supertile corresponds to the size of the texture accumulation buffer. After applying a last layer of texture to the bins of the supertile, the supertile may be advanced to a new position. The rendering unit traverses the primitive with the supertile so that the union of areas visited by the supertile covers the primitive.Type: GrantFiled: March 20, 2003Date of Patent: April 4, 2006Assignee: Sun Microsystems, Inc.Inventors: Brian D. Emberling, Michael G. Lavelle, Assana M. Fard, Nandini Ramani, David C. Kehlet, Michael A. Wasserman, Ewa M. Kubalska, Mark E Pascual
-
Patent number: 6975317Abstract: A graphics system and method for rendering a plurality of triangles. Information regarding the triangle may first be received. The method may then determine the longest edge or major edge of the triangle and also determine the direction or axis of the longest edge of the triangle. The method may then perform edge walking on the major edge (e.g., along the axis of the major edge) of the triangle, followed by span walking. The edge walking is preferably always performed on the major or longest edge of the triangle, prior to the span walking, and regardless of the orientation of the major edge of the triangle. This operates to load balance the edge walker and the span walker for the plurality of triangles.Type: GrantFiled: March 12, 2002Date of Patent: December 13, 2005Assignee: Sun Microsystems, Inc.Inventors: Patrick Shehane, Michael G. Lavelle, Mark E. Pascual, Wing-Cheong Tang, Nandini Ramani
-
Patent number: 6963342Abstract: A system and method for assigning operations to multiple pipelines in a graphics system is disclosed. The graphics system may include an arbitration unit coupled to a plurality of calculation pipelines. The arbitration unit is operable to provide graphics operations to selected ones of the calculation pipelines. Each of the calculation pipelines is operable to perform a graphics operation. Each of the calculation pipelines may include digital logic and/or a processing element for performing the graphics operations. An operation may be assigned to a pipeline if the pipeline is performing a low latency operation. A low latency operation may comprise an operation that is performed by one of the calculation pipelines in less time than a pre-determined number of clock cycles.Type: GrantFiled: February 28, 2002Date of Patent: November 8, 2005Assignee: Sun Microsystems, Inc.Inventors: Mark E. Pascual, Michael G. Lavelle, Nandini Ramani, Patrick Shehane
-
Patent number: 6943791Abstract: A system and method are disclosed for utilizing a Z slope test to select polygons that may be candidates for multiple storage methods. The method may calculate the absolute Z slope from vertex data and compare the calculated value with a specified threshold value. In some embodiments, for polygons that have an absolute Z slope less than the threshold value, parameter values may be rendered for only one sample position of multiple neighboring sample positions. The parameter values rendered for the one sample position may then be stored in multiple memory locations that correspond to the multiple neighboring sample positions. In some embodiments, storing parameter values in multiple memory locations may be achieved in a single write transaction. In some embodiments, utilization of the Z slope test method may be subject to user input and in other embodiments may be a dynamic decision controlled by the graphics system.Type: GrantFiled: March 11, 2002Date of Patent: September 13, 2005Assignee: Sun Microsystems, Inc.Inventors: Mark E. Pascual, Michael G. Lavelle, Michael F. Deering, Nandini Ramani
-
Patent number: 6924820Abstract: A system and method for rasterizing and rendering graphics data is disclosed. Vertices may be grouped to form primitives such as triangles, which are rasterized using two-dimensional arrays of samples bins. To overcome fragmentation problems, the system's sample evaluation hardware may be configured to over-evaluate samples each clock cycle. Since a number of the samples will typically not survive evaluation because they will be outside the primitive being rendered, the remaining surviving samples may be combined into sets, with one set being forwarded to subsequent pipeline stages each clock cycle in order to attempt to keep the pipeline utilization high.Type: GrantFiled: September 25, 2001Date of Patent: August 2, 2005Assignee: Sun Microsystems, Inc.Inventors: Nandini Ramani, David C. Kehlet, Michael G. Lavelle, Mark E. Pascual, Ewa M. Kubalska, Yi-Ming Tian
-
Patent number: 6900803Abstract: A graphics system and method are disclosed that may optimize the rate of pixel generation to match the rate at which a memory may be designed to receive pixel data. If a memory is configured to store multiple pixels substantially simultaneously, it may be advantageous to render an equivalent number of pixels substantially simultaneously and at the same rate. An edge walker that utilizes multiple sets of accumulators to generate multiple scan lines substantially simultaneously and a span walker that utilizes multiple sets of accumulators to render multiple pixel values substantially simultaneously is described.Type: GrantFiled: March 12, 2002Date of Patent: May 31, 2005Assignee: Sun Microsystems, Inc.Inventors: Patrick Shehane, Michael G. Lavelle, Mark E. Pascual, Wing-Cheong Tang, Nandini Ramani
-
Patent number: 6867778Abstract: A system and method for rendering a polygon, such as a triangle. The method may comprise receiving geometry data (or vertex data) defining vertices of the polygon. The method may compute initial vertex x,y values at end points proximate to each of the vertices of the polygon, and a slope value along each edge of the polygon. The computed slope may be a quantized slope value having a first number of bits of precision. The first number of bits of precision may produce inaccuracies for interpolated x,y values computed at the end points of an edge of the polygon. The method may then interpolate x,y values along each respective edge of the polygon using the computed slope along the respective edge of the polygon. Finally the method may store final x,y values for each respective edge of the polygon. The final x,y values comprise the interpolated x,y values for non-end points of the respective edge, and the computed initial vertex x,y values for each of the end points of the respective edge.Type: GrantFiled: February 28, 2002Date of Patent: March 15, 2005Assignee: Sun Microsystems, Inc.Inventors: Wing-Cheong Tang, Michael G. Lavelle, Mark E. Pascual, Patrick Shehane, Nandini Ramani
-
Publication number: 20040183807Abstract: A rendering unit positions a supertile so that it intersects a primitive. The rendering unit repeatedly walks over bins of the supertile, applying a layer of texture to the bins of the supertile in each iteration of said repeated walking. The rendering unit advances to the next texture layer after having applied the current texture layer to each candidate bin of the supertile. The results of each texture layer application to the bins may be stored in a texture accumulation buffer. The size of the supertile corresponds to the size of the texture accumulation buffer. After applying a last layer of texture to the bins of the supertile, the supertile may be advanced to a new position. The rendering unit traverses the primitive with the supertile so that the union of areas visited by the supertile covers the primitive.Type: ApplicationFiled: March 20, 2003Publication date: September 23, 2004Inventors: Brian D. Emberling, Michael G. Lavelle, Assana M. Fard, Nandini Ramani, David C. Kehlet, Michael A. Wasserman, Ewa M. Kubalska, Mark E. Pascual
-
Publication number: 20040174364Abstract: The method for line patterning may include receiving line data for a first line. The line data for the first line may include an original starting point and an original endpoint. The first line may be divided into one or more line segments, which may include generating a new starting point and a new endpoint for one or more of the one or more line segments. The new line segments may then be rasterized from the new endpoint to the new starting point. In other words, each line segment may be rasterized from right to left, thus avoiding problems associated with multiple consecutive accesses of pixel addresses in the pixel buffer. The original or intended line pattern of the line is preserved since the zeros and ones are drawn or rendered in their appropriate locations as if they were being drawn left to right, even though they are actually rasterized from right to left.Type: ApplicationFiled: March 3, 2003Publication date: September 9, 2004Inventors: Patrick D. Shehane, Michael G. Lavelle, Mark E. Pascual, Wing-Cheong Tang, Nandini Ramani
-
Patent number: 6784894Abstract: A graphics system configured to operate on a collection of vertices to determine mappings from an initial order to secondary and tertiary ordering. The initial order corresponds to the ordering of the vertices in an input buffer. The secondary (tertiary) ordering corresponds to the ordering of the vertices along a triangle major (minor) axis. The graphics system computes horizontal and vertical displacements along edges of the triangle in the initial ordering, and uses the signs of the horizontal displacements and vertical displacements to access a mapping table which determines the mappings. The mappings may be used to rasterize the triangle in terms of pixels (or samples).Type: GrantFiled: May 18, 2001Date of Patent: August 31, 2004Assignee: Sun Microsystems, Inc.Inventors: Michael W. Schimpf, Michael G. Lavelle, Mark E. Pascual, Nandini Ramani
-
Patent number: 6731300Abstract: A graphics system may be configured to render anti-aliased dots in terms of samples and to generate pixels by filtering the samples. The pixels are supplied to one or more display devices. The means used to generate the samples may perform the computation of radial distance at positions on a grid in a rendering coordinate space, and interpolate estimates for the radial distances of samples around the dot as needed based on the radii at the grid positions.Type: GrantFiled: May 18, 2001Date of Patent: May 4, 2004Assignee: Sun Microsystems, Inc.Inventors: Nandini Ramani, Michael A. Wasserman, Michael G. Lavelle, Mark E. Pascual, Kevin Tang, Daniel M. Chao
-
Publication number: 20030174133Abstract: A graphics system and method for rendering a plurality of triangles. Information regarding the triangle may first be received. The method may then determine the longest edge or major edge of the triangle and also determine the direction or axis of the longest edge of the triangle. The method may then perform edge walking on the major edge (e.g., along the axis of the major edge) of the triangle, followed by span walking. The edge walking is preferably always performed on the major or longest edge of the triangle, prior to the span walking, and regardless of the orientation of the major edge of the triangle. This operates to load balance the edge walker and the span walker for the plurality of triangles.Type: ApplicationFiled: March 12, 2002Publication date: September 18, 2003Inventors: Patrick Shehane, Michael G. Lavelle, Mark E. Pascual, Wing-Cheong Tang, Nandini Ramani
-
Publication number: 20030174130Abstract: A graphics system and method are disclosed that may optimize the rate of pixel generation to match the rate at which a memory may be designed to receive pixel data. If a memory is configured to store multiple pixels substantially simultaneously, it may be advantageous to render an equivalent number of pixels substantially simultaneously and at the same rate. An edge walker that utilizes multiple sets of accumulators to generate multiple scan lines substantially simultaneously and a span walker that utilizes multiple sets of accumulators to render multiple pixel values substantially simultaneously is described.Type: ApplicationFiled: March 12, 2002Publication date: September 18, 2003Inventors: Patrick Shehane, Michael G. Lavelle, Mark E. Pascual, Wing-Cheong Tang, Nandini Ramani
-
Publication number: 20030169255Abstract: A graphics system for providing two-sided lighting. The graphics system may include a media processor and a hardware accelerator. The media processor may be configured to receive a stream of vertices, and to perform a two-sided lighting computation on each vertex resulting in front color and back color for each vertex. The hardware accelerator may be configured to (a) receive the vertices of the first stream along with the front and back color for each vertex, (b) assemble the vertices into polygons, (c) compute an orientation for each of the polygons, (d) select the front color or the back color of the vertices forming each polygon based on a result of the orientation computation for each polygon, and (e) render each polygon using the selected color of the vertices forming the polygon.Type: ApplicationFiled: March 11, 2002Publication date: September 11, 2003Inventors: Michael G. Lavelle, Wayne A. Morse, Charles F. Patton, Ewa M. Kubalska, Mark E. Pascual, Nandini Ramani
-
Publication number: 20030169252Abstract: A system and method are disclosed for utilizing a Z slope test to select polygons that may be candidates for multiple storage methods. The method may calculate the absolute Z slope from vertex data and compare the calculated value with a specified threshold value. In some embodiments, for polygons that have an absolute Z slope less than the threshold value, parameter values may be rendered for only one sample position of multiple neighboring sample positions. The parameter values rendered for the one sample position may then be stored in multiple memory locations that correspond to the multiple neighboring sample positions. In some embodiments, storing parameter values in multiple memory locations may be achieved in a single write transaction. In some embodiments, utilization of the Z slope test method may be subject to user input and in other embodiments may be a dynamic decision controlled by the graphics system.Type: ApplicationFiled: March 11, 2002Publication date: September 11, 2003Inventors: Mark E. Pascual, Michael G. Lavelle, Michael F. Deering, Nandini Ramani