Loading...
Search for:
computer-graphics
0.011 seconds
Total 114 records
ISP: Using idle SMs in hardware-based prefetching
, Article Proceedings - 17th CSI International Symposium on Computer Architecture and Digital Systems, CADS 2013 ; October , 2013 , Pages 3-8 ; 9781479905621 (ISBN) ; Abdi, M ; Baniasadi, A ; Hessabi, S ; Computer Society of Iran; IPM ; Sharif University of Technology
IEEE Computer Society
2013
Abstract
The Graphics Processing Unit (GPU) is the most promising candidate platform for faster rate of improvement in peak processing speed, low latency and high performance. The highly programmable and multithreaded nature of GPUs makes them a remarkable candidate for general purpose computing. However, supporting non-graphics computing on graphics processors requires addressing several architecture challenges. In this paper, we focus on improving performance by better hiding long waiting time to transfer data from the slow global memory. Thereupon study an effective light-overhead prefetching mechanism, which utilizes idle processing elements. Our results show that we can potentially improve...
A Fast Algorithm for Shadow Generation with Low Distortion Based on Shadow Map Technique
, M.Sc. Thesis Sharif University of Technology ; Jamzad, Mansour (Supervisor)
Abstract
Shadows are one of the most important details in graphical images. There exist many shadow generation algorithms each of which suffers from some problems. High processing time and ill-shaped shadow borders, known as alasing, are some of such problems. In this paper, we propose a heuristic method based on standard shadow map technique, named rotated shadow maps, to generate excellent hard shadows. Our method uses some shadow maps which are generated from the same view but objects are slightly rotated around the center of view area. Rotated shadow maps can be considered as an independent hard shadow generation algorithm. Also it can be combined with other shadow map based approaches. Utilizing...
Visibility of a moving segment
, Article Proceedings of the 2009 International Conference on Computational Science and Its Applications, ICCSA 2009, 29 June 2009 through 2 July 2009, Yongin ; 2009 , Pages 169-176 ; 9780769537016 (ISBN) ; Ghodsi, M ; Sharif University of Technology
2009
Abstract
In this paper we define topological segment visibility, and show how to compute and maintain it as the observer moves in the plane. There are n non-intersecting line segment objects in the plane, and we have a segment observer among them. As the topological visibility of a line segment has not been studied before, we first consider static case of the problem, in which the observer and objects are static, and then we study dynamic case of the problem, in which the observer can move among obstacles
The price of anarchy in network creation games
, Article PODC'07: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing, Portland, OR, 12 August 2007 through 15 August 2007 ; 2007 , Pages 292-298 ; 1595936165 (ISBN); 9781595936165 (ISBN) ; Hajiaghayi, M ; Mahini, H ; Zadimoghaddam, M ; Sharif University of Technology
2007
Abstract
We study Nash equilibria in the setting of network creation games introduced recently by Fabrikant, Luthra, Maneva, Papadimitriou and Shenker. In this game we have a set of selfish node players, each creating some incident links, and the goal is to minimize times the cost of the created links plus sum of the distances to all other players. Fabrikant et al. proved an upper bound O(p ) on the price of anarchy, i.e., the relative cost of the lack of coordination. Albers, Eilts, Even-Dar, Mansour, and Roditty show that the price of anarchy is constant for = O(pn) and for ≥ 12 n [dlg] n, and that the price of anarchy is 15 1 + (min{α 2/n , n2 })1/3 for any . The latter bound shows the first...
Sensor module for multi-channel wireless photoplethysmography system
, Article 2007 5th Student Conference on Research and Development, SCORED, Selangor, 11 December 2007 through 12 December 2007 ; 2007 ; 1424414709 (ISBN); 9781424414703 (ISBN) ; Mohd Ali, M. A ; Zahedi, E ; Sharif University of Technology
2007
Abstract
The digital sensor module is developed to sample the input signal fed from a photo-sensor probe at sampling times ranging from 400-4000 μs equivalent to sampling rates of 2500-250 sample/second (S/s), respectively. The module produces 16-bit data packets which are transmitted serially and plotted to output the photoplethysmography signal (PPG). It displays accurate sampling values (packets) similar to the calculated ones. ©2007 IEEE
Login to internet websites by next generation game console
, Article 2006 2nd IEEE/IFIP International Conference in Central Asia on Internet, ICI 2006, Tashkent, 19 September 2006 through 21 September 2006 ; 2006 ; 1424405432 (ISBN); 9781424405435 (ISBN) ; Sharif University of Technology
IEEE Computer Society
2006
Abstract
By a great leap, the computer game industry has today reached fame as big as filmmaking industry. Upon introduction of the new generation of game consoles, this industry will witness spectacular progress. One of these next generation consoles is Nintendo console named "Wii". This console has a new game pad which utilizes motion sensors. On the other hand, facilities such as internet connection are added in new consoles and they are not merely for playing. It is observed that placing password for creating usernames by game consoles is difficult. By the use of the specifications of Wii console game pads, a method for user authentication and entering password is proposed in this paper. By using...
3-D simulation of turbulent density
, Article 2006 2nd ASME Joint U.S.-European Fluids Engineering Summer Meeting, FEDSM 2006, Miami, FL, 17 July 2006 through 20 July 2006 ; Volume 2006 , 2006 ; 0791837831 (ISBN); 9780791837832 (ISBN) ; Firoozabadi, B ; Afshin, H ; Ghasvari Jahromi, H ; Sharif University of Technology
2006
Abstract
Density current is a dense fluid, which is continuously released from a source and spreads down a sloping surface inside a lighter, motionless fluid. A low-Reynolds number k-ε model (Launder and Sharma, 1974) has been used to simulate the behavior of 3-D density currents. Density current with a uniform velocity and concentration enters the channel via a sluice gate into a lighter ambient fluid and moves forward down-slope. The model has been verified with the experimental data sets. Although the k-ε Launder and Sharma model is applied here to a conservative density current, it seems the analysis is valid in general for turbidity current laden with fine particles. Copyright © 2006 by ASME
Power-efficient prefetching on GPGPUs
, Article Journal of Supercomputing ; Volume 71, Issue 8 , August , 2015 , pp. 2808-2829 ; ISSN: 09208542 ; Hessabi, S ; Abdi, M ; Baniasadi, A ; Sharif University of Technology
Abstract
The graphics processing unit (GPU) is the most promising candidate platform for achieving faster improvements in peak processing speed, low latency and high performance. The highly programmable and multithreaded nature of GPUs makes them a remarkable candidate for general purpose computing. However, supporting non-graphics computing on graphics processors requires addressing several architectural challenges. In this paper, we focus on improving performance by better hiding long waiting time for transferring data from the slow global memory. Furthermore, we show that the proposed method can reduce power and energy. Reduction in access time to off-chip data has a noticeable role in reducing...
Study of water entry of circular cylinder by using analytical and numerical solutions
, Article Journal of the Brazilian Society of Mechanical Sciences and Engineering ; Volume 34, Issue 3 , July , 2012 , Pages 225-232 ; 16785878 (ISSN) ; Dashtimanesh, A ; Djeddi, S. R ; Sharif University of Technology
2012
Abstract
Water impact phenomenon in the case of a circular cylinder is an important issue in offshore industry where cross members may be in the splash zone of the incident wave. An analytical method as well as a numerical solution are employed to study the water entry problem of a circular section. The procedure for derivation of the analytical formulas is demonstrated step by step. The volume of fluid (VOF) simulation of the water entry problem is also performed to offer comparison of the results of the linearized analytical solution with a fully nonlinear and viscous fluid flow solution. To achieve this, the FLOW- 3D code is utilized. Some consideration has also been given to the points of...
Blur identification in noisy images using radon transform and power spectrum modeling
, Article IWSSIP 2005 - 12th International Workshop on Systems, Signals and Image Processing(SSIP-SPI, 2005), Chalkida, 22 September 2005 through 24 September 2005 ; 2005 , Pages 347-352 ; 0907776205 (ISBN); 9780907776208 (ISBN) ; Jamzad, M ; Sharif University of Technology
2005
Abstract
Motion blur is one of the most common blurs that degrades images. Restoration of such images are highly dependent to estimation of motion blur parameters. Many researchers since 1976 have developed algorithms to estimate linear motion blur parameters. These algorithms are different in their performance, time complexity, precision and their robustness in noisy environments. In this paper we have presented a novel algorithm to estimate linear motion blur parameters such as direction and extend by using Radon transform to find direction and power spectrum modeling to find its extend. The most benefit of this algorithm is its robustness and precision in noisy images. This algorithm is a...
Cluster-based approach for improving graphics processing unit performance by inter streaming multiprocessors locality
, Article IET Computers and Digital Techniques ; Volume 9, Issue 5 , August , 2015 , Pages 275-282 ; 17518601 (ISSN) ; Falahati, H ; Hessabi, S ; Sharif University of Technology
Institution of Engineering and Technology
2015
Abstract
Owing to a new platform for high performance and general-purpose computing, graphics processing unit (GPU) is one of the most promising candidates for faster improvement in peak processing speed, low latency and high performance. As GPUs employ multithreading to hide latency, there is a small private data cache in each single instruction multiple thread (SIMT) core. Hence, these cores communicate in many applications through the global memory. Access to this public memory takes long time and consumes large amount of power. Moreover, the memory bandwidth is limited which is quite challenging in parallel processing. The missed memory requests in last level cache that are followed by accesses...
NETAL: A new graph-based method for global alignment of protein-protein interaction networks
, Article Bioinformatics ; Volume 29, Issue 13 , 2013 , Pages 1654-1662 ; 13674803 (ISSN) ; Khadem, A ; Hashemifar, S ; Arab, S. S ; Sharif University of Technology
2013
Abstract
Motivation: The interactions among proteins and the resulting networks of such interactions have a central role in cell biology. Aligning these networks gives us important information, such as conserved complexes and evolutionary relationships. Although there have been several publications on the global alignment of protein networks; however, none of proposed methods are able to produce a highly conserved and meaningful alignment. Moreover, time complexity of current algorithms makes them impossible to use for multiple alignment of several large networks together.Results: We present a novel algorithm for the global alignment of protein-protein interaction networks. It uses a greedy method,...
High-throughput stream categorization and intrusion detection on GPU
, Article 8th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2010, 26 July 2010 through 28 July 2010 ; August , 2010 , Pages 81-84 ; 9781424478859 (ISBN) ; Eslamiy, H ; Totoniy, E ; Khademy, A ; Sharif University of Technology
Abstract
We present a design and implementation of a high-throughput deep packet inspection performing both stream categorization and intrusion detection on GPU platform using CUDA. This implementation is capable of matching 64 ethernet packet streams against 25 given regular expressions at 524 Mb/s rate on a computer system with GeForce GTX 295 graphic card
Cross ambiguity function analysis of the '8k-mode' DVB-T for passive radar application
, Article 4th Microwave and Radar Week MRW-2010 - 11th International Radar Symposium, IRS 2010 - Conference Proceedings, 16 June 2010 through 18 June 2010, Vilnius ; June , 2010 , Pages 279-282 ; 9789955690184 (ISBN) ; Bastani, M ; Behnia, F ; Nayebi, M. M ; Sharif University of Technology
2010
Abstract
One of non-cooperative illuminators recently considered for passive radar applications is the DVB-T (Digital Video Broadcasting - Terrestrial) station. The thumbtack ambiguity function of the DVB-T signal in addition to being stationary makes such signal a good candidate for such applications. However, certain ambiguities in its ambiguity function necessitates certain issues to be carefully considered when DVB-T signals are to be utilized. In this paper, after studying the origins of these ambiguities, we propose special processing schemes to resolve them
Advantages of the DVB-T signal for passive radar applications
, Article 4th Microwave and Radar Week MRW-2010 - 11th International Radar Symposium, IRS 2010 - Conference Proceedings, 16 June 2010 through 18 June 2010 ; 2010 , Pages 274-278 ; 9789955690184 (ISBN) ; Bastani, M ; Behnia, F ; Nayebi, M. M ; Sharif University of Technology
2010
Abstract
One of the attractive opportunistic signals for passive radar applications is the DVB-T (Digital Video Broadcasting- Terrestrial) signal. The thumbtack ambiguity function of the DVB-T signal in addition to being stationary makes such signal a good candidate for such applications. In this paper we want to consider its feasibility for this application in more details. So we first examin this signal for the main parts of the the passive radar: Resolving ambiguities before evaluating CAF and direct path intereference rejection, and then consider its processing gain in detecting targets
ASHA: An adaptive shared-memory sharing architecture for multi-programmed GPUs
, Article Microprocessors and Microsystems ; Volume 46 , 2016 , Pages 264-273 ; 01419331 (ISSN) ; Samavatian, M. H ; Sarbazi Azad, H ; Sharif University of Technology
Elsevier B.V
2016
Abstract
Spatial multi-programming is one of the most efficient multi-programming methods on Graphics Processing Units (GPUs). This multi-programming scheme generates variety in resource requirements of stream multiprocessors (SMs) and creates opportunities for sharing unused portions of each SM resource with other SMs. Although this approach drastically improves GPU performance, in some cases it leads to performance degradation due to the shortage of allocated resource to each program. Considering shared-memory as one of the main bottlenecks of thread-level parallelism (TLP), in this paper, we propose an adaptive shared-memory sharing architecture, called ASHA. ASHA enhances spatial...
Derivation of a low-frequency model for a 3D wound core transformer
, Article 2017 25th Iranian Conference on Electrical Engineering, ICEE 2017, 2 May 2017 through 4 May 2017 ; 2017 , Pages 1319-1323 ; 9781509059638 (ISBN) ; Hajipour, E ; Moradnouri, A ; Vakilian, M ; Sharif University of Technology
Abstract
3D wound core is a newly proposed core structure, which is used for construction of distribution transformers. Although many advantages have been proposed for transformer with 3D wound core and it has found increasing application in some countries such as China and Iran, no model has been presented so far in the literature for such transformers. In this paper, a low frequency model, derived based on the duality principle for transformer with 3D wound core, which can be used for both steady state and low-frequency transient studies. The validity of the model in steady state condition is then verified by experimental results. © 2017 IEEE
Similarity measures for intersection of camera view frustums
, Article Iranian Conference on Machine Vision and Image Processing, MVIP ; Volume 2017-November , 2018 , Pages 171-175 ; 21666776 (ISSN); 9781538644041 (ISBN) ; Shirzad, H ; Kasaei, S ; Sharif University of Technology
IEEE Computer Society
2018
Abstract
For a moving camera recognizing that it has seen a place before now, is one the most important issues in the 3D reconstruction problems. In these problems, the main goal is to create a three-dimensional model from a sequence of 2D captured images during different times. That part of the scene which is rendered by a camera is often modeled by a frustum. Calculating the amount of intersection of two camera view frustums at different times can help to solve this problem. However, there are two major difficulties. First, calculating the intersection of two frustums, in general, is so complicated. And second, there are some uncertainties in the moving camera parameters over time. In this paper,...
LTRF: enabling high-capacity register files for GPUs via hardware/software cooperative register prefetching
, Article 23rd International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2018, 24 March 2018 through 28 March 2018 ; 2018 , Pages 489-502 ; 9781450349116 (ISBN) ; Mirhosseini, A ; Ehsani, S. B ; Sarbazi Azad, H ; Drumond, M ; Falsafi, B ; Ausavarungnirun, R ; Mutlu, O ; Sharif University of Technology
Association for Computing Machinery
2018
Abstract
Graphics Processing Units (GPUs) employ large register files to accommodate all active threads and accelerate context switching. Unfortunately, register files are a scalability bottleneck for future GPUs due to long access latency, high power consumption, and large silicon area provisioning. Prior work proposes hierarchical register file, to reduce the register file power consumption by caching registers in a smaller register file cache. Unfortunately, this approach does not improve register access latency due to the low hit rate in the register file cache. In this paper, we propose the Latency-Tolerant Register File (LTRF) architecture to achieve low latency in a two-level hierarchical...
Designing, modeling and wrench feasible workspace analysis of a 3D cable suspended robot for heavy loads handling applications
, Article 39th International Symposium on Robotics, ISR 2008, Seoul, 15 October 2008 through 17 October 2008 ; 2008 , Pages 934-939 ; Zohoor, H ; Sharif University of Technology
2008
Abstract
The objective of this paper is designing, modeling and wrench feasible workspace analysis of a 3D cable suspended robot as IRPM (Incompletely Restrained Positioning Mechanism). This type of robots supports a load platform in space by less than or equal to six spatially arranged cables. We use the model of 6 cables spanned in the same manner as a Stewart parallel mechanism. This mechanism is suitable for the accurate positioning of heavy loads. Concentrating on the operations of heavy loads handling, studying the workspace and ways of increasing it is of high importance. Several workspaces exist amongst which the constant and total orientation statically reachable combined and wrench feasible...