Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
We describe the implementation and performance of an efficient parallel Gauss-Seidel algorithm that has been developed for irregular, sparse matrices from electrical power systems applications. Although, Gauss-Seidel algorithms are... more
We describe the implementation and performance of an efficient parallel Gauss-Seidel algorithm that has been developed for irregular, sparse matrices from electrical power systems applications. Although, Gauss-Seidel algorithms are inherently sequential, by performing specialized orderings on sparse matrices, it is possible to eliminate much of the data dependencies caused by precedence in the calculations. A two-part matrix ordering technique has been developed—first to partition the matrix into block-diagonal-bordered ...
Research Interests:
... Jang Sun Lee Sunghoon KO Sanjay Ranka Byung Eui Min ETRI Syracuse University University of Florida ETRI Daejon, Korea Syracuse, NY Gainesville, FL Daejon, Korea sunny @computer.etri.re.kr shko@ top.cis.syr.edu ranka@cise.ufl.edu... more
... Jang Sun Lee Sunghoon KO Sanjay Ranka Byung Eui Min ETRI Syracuse University University of Florida ETRI Daejon, Korea Syracuse, NY Gainesville, FL Daejon, Korea sunny @computer.etri.re.kr shko@ top.cis.syr.edu ranka@cise.ufl.edu bemin@computer.etri.re.kr ...
The performances of three recently published leaf sequencing algorithms for step-and-shoot intensity-modulated radiation therapy delivery that eliminates tongue-and-groove underdosage are evaluated. Proofs are given to show that the... more
The performances of three recently published leaf sequencing algorithms for step-and-shoot intensity-modulated radiation therapy delivery that eliminates tongue-and-groove underdosage are evaluated. Proofs are given to show that the algorithm of Que et al (2004 Phys. Med. Biol. 49 399-405) generates leaf sequences free of tongue-and-groove underdosage and interdigitation. However, the total beam-on times could be up to n times those of the sequences generated by the algorithms of Kamath et al (2004 Phys. Med. Biol. 49 N7-N19), which are optimal in beam-on time for unidirectional leaf movement under the same constraints, where n is the total number of involved leaf pairs. Using 19 clinical fluence matrices and 100000 randomly generated 15 x 15 matrices, the average monitor units and number of segments of the leaf sequences generated using the algorithm of Que et al are about two to four times those generated by the algorithm of Kamath et al.
Research Interests:
Skip to Main Content. Sign In. Please enter a valid username or password. Username Password. Forgot Username or Password. IEEE.org| IEEE Xplore Digital Library| IEEE Standards| IEEE Spectrum| More Sites. Cart(Loading....) Create Account... more
Skip to Main Content. Sign In. Please enter a valid username or password. Username Password. Forgot Username or Password. IEEE.org| IEEE Xplore Digital Library| IEEE Standards| IEEE Spectrum| More Sites. Cart(Loading....) Create Account |Sign In. Xplore. Access provided by: crawler. Sign Out. Browse: Books & eBooks; Conference Publications; Education & Learning; Journals & Magazines; Standards; By Topic Click to expand or collapse browse ...
The ongoing scaling of semiconductor technology is causing severe increase of on-chip power density and temperature in microprocessors. This has raised urgent requirement for both power and thermal management during each level of system... more
The ongoing scaling of semiconductor technology is causing severe increase of on-chip power density and temperature in microprocessors. This has raised urgent requirement for both power and thermal management during each level of system design. In this paper, we propose a formal technique based on model checking using extended timed automata to solve the processor frequency assignment problem in a
Research Interests:
Research Interests:
This paper describes deterministic communication-efficient algorithms for performing random data accesses with hot spots on a coarse-grained parallel machine. The general random access read-write operations with hot spots can be completed... more
This paper describes deterministic communication-efficient algorithms for performing random data accesses with hot spots on a coarse-grained parallel machine. The general random access read-write operations with hot spots can be completed inCμn/p(+ lower order terms) time and is optimal and scalable providedn⪢p3+p2τ/μ (nis the number of elements distributed acrosspprocessors, τ is the start-up overhead and 1/μ is the data transfer
Research Interests:

And 269 more