Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (9030)
- Missouri University of Science and Technology (1896)
- City University of New York (CUNY) (957)
- Brigham Young University (710)
- University of Texas at Arlington (661)
-
- Syracuse University (479)
- University of Central Florida (475)
- University of Nevada, Las Vegas (392)
- Chulalongkorn University (258)
- Regis University (254)
- Portland State University (242)
- TÜBİTAK (230)
- Old Dominion University (197)
- San Jose State University (192)
- University of South Carolina (188)
- Wright State University (186)
- Technological University Dublin (152)
- Washington University in St. Louis (148)
- University of South Florida (137)
- Edith Cowan University (111)
- Purdue University (111)
- University of Nebraska - Lincoln (108)
- Nova Southeastern University (101)
- Zayed University (97)
- California Polytechnic State University, San Luis Obispo (96)
- Dartmouth College (94)
- University of New Mexico (94)
- University at Albany, State University of New York (89)
- Air Force Institute of Technology (88)
- Kennesaw State University (75)
- Keyword
-
- Machine learning (601)
- Artificial intelligence (410)
- Deep learning (342)
- Machine Learning (264)
- College for Professional Studies (253)
-
- School of Computer & Information Science (236)
- Security (196)
- Artificial Intelligence (191)
- Natural language processing (184)
- Deep Learning (183)
- Computer Science (180)
- Privacy (145)
- Social media (140)
- Algorithms (138)
- Computer science (137)
- MS Computer and Information Technology (136)
- Data mining (135)
- Neural networks (129)
- Reinforcement learning (123)
- Computer vision (121)
- Natural Language Processing (121)
- Cybersecurity (117)
- Twitter (116)
- Software engineering (115)
- AI (110)
- Classification (109)
- Regis University MSCIT thesis (108)
- Cloud computing (106)
- Optimization (106)
- Clustering (96)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8502)
- Computer Science Faculty Research & Creative Works (907)
- Theses and Dissertations (831)
- Computer Science Technical Reports (411)
- Faculty Publications (381)
-
- Computer Science and Engineering Theses - Archive (364)
- Electronic Theses and Dissertations (331)
- Publications and Research (291)
- Electrical and Computer Engineering Faculty Research & Creative Works (282)
- Computer Science and Engineering Dissertations - Archive (270)
- Open Educational Resources (262)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (258)
- Regis University Student Publications (comprehensive collection) (254)
- Masters Theses (236)
- UNLV Theses, Dissertations, Professional Papers, and Capstones (236)
- Turkish Journal of Electrical Engineering and Computer Sciences (230)
- Dissertations and Theses (203)
- Dissertations and Theses Collection (Open Access) (189)
- Electrical Engineering and Computer Science - Technical Reports (176)
- Master's Projects (167)
- Dissertations, Theses, and Capstone Projects (145)
- Electrical Engineering and Computer Science - All Scholarship (138)
- McKelvey School of Engineering Graduate Student Theses & Dissertations (137)
- USF Tampa Graduate Theses and Dissertations (122)
- Doctoral Dissertations (119)
- Electronic Theses and Dissertations, 2020-2023 (119)
- All Works (97)
- Computer Science Faculty Publications (94)
- Northeast Parallel Architecture Center (92)
- Dissertations (89)
- Publication Type
- File Type
Articles 19411 - 19440 of 20575
Full-Text Articles in Entire DC Network
Studies Of Qcd In E+E- → Hadrons At Ecm = 130 And 136 Gev, D. Buskulic, M. Thulasidas
Studies Of Qcd In E+E- → Hadrons At Ecm = 130 And 136 Gev, D. Buskulic, M. Thulasidas
Research Collection School Of Computing and Information Systems
Studies of QCD in e+e−→e+e−→ Hadrons at Ecm=Ecm=} 130 and 136 GeV The ALEPH Collaboration An analysis of the properties of hadronic final states produced in electron-positron annihilation at centre-of-mass energies of 130 and 136 GeV is presented. The measurements are based on a data sample of 5.7 pb−1pb−1 collected in November 1995 with the \Aleph detector at LEP. Inclusive charged particle distributions, jet rates and event-shape distributions are measured and the results are compared with the predictions of QCD-based models. From the measured distributions quantities are determined for which the dependence on the centre-of-mass energy can be predicted by …
Inductive Neural Logic Network And The Scm Algorithm, Ah-Hwee Tan, Loo-Nin Teow
Inductive Neural Logic Network And The Scm Algorithm, Ah-Hwee Tan, Loo-Nin Teow
Research Collection School Of Computing and Information Systems
Neural Logic Network (NLN) is a class of neural network models that performs both pattern processing and logical inferencing. This article presents a procedure for NLN to learn multi-dimensional mapping of both binary and analog data. The procedure, known as the Supervised Clustering and Matching (SCM) algorithm, provides a means of inferring inductive knowledge from databases. In contrast to gradient descent error correction methods, pattern mapping is learned by an inductive NLN using fast and incremental clustering of input and output patterns. In addition, learning/encoding only takes place when both the input and output match criteria are satisfied in a …
Abstraction Of An Object-Oriented Vocabulary By Providing A Standardized Interface, Hemant Kothavade
Abstraction Of An Object-Oriented Vocabulary By Providing A Standardized Interface, Hemant Kothavade
Theses
Controlled vocabularies are ubiquitous in varied application fields. They are particularly helpful in the medical field since they can unify disparate terminologies and provide information in a compact, comprehensible manner. In this thesis, we present a mechanism to efficiently retrieve and update knowledge stored in a controlled vocabulary modeled as an Object-Oriented Database (OODB) system. We aim to provide a standardized interface to the vocabulary, such that the implementation details of the vocabulary are transparent to all users. The user of this standardized interface will typically be an application programmer who is trying to provide the vocabulary's knowledge-base to end …
A One-Pass Algorithm For Accurately Estimating Quantiles For Disk-Resident Data, Khaled Alsabti, Sanjay Ranka, Vineet Singh
A One-Pass Algorithm For Accurately Estimating Quantiles For Disk-Resident Data, Khaled Alsabti, Sanjay Ranka, Vineet Singh
College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects
The '-quantile of an ordered sequence of data values is the element with rank ' \Theta n, where n is the total number of values. Accurate estimates of quantiles are required for the solution of many practical applications. In this paper, we present a new algorithm for estimating the quantile values for disk-resident data. Our algorithm has the following characteristics: (1) It requires only one pass over the data; (2) It is deterministic; (3) It produces good lower and upper bounds of the true values of the quantiles; (4) It requires no a priori knowledge of the distribution of the …
Semantics Vs. Syntax Vs. Computations: Machine Models For Type-2 Polynomial-Time Bounded Functionals, James S. Royer
Semantics Vs. Syntax Vs. Computations: Machine Models For Type-2 Polynomial-Time Bounded Functionals, James S. Royer
College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects
This paper investigates analogs of the Kreisel-Lacombe-Shoenfield Theorem in the context of the type-2 basic feasible functionals. We develop a direct, polynomial-time analog of effective operation in which the time bounding on computations is modeled after Kapron and Cook's scheme for their basic polynomial-time functionals. We show that if P = NP, these polynomial-time effective operations are strictly more powerful on R (the class of recursive functions) than the basic feasible functions. We also consider a weaker notion of polynomial-time effective operation where the machines computing these functionals have access to the computations of their procedural parameter, but not to …
Concurrent Simulation Of Plasma Reactors, Marc Rieffel, Stephen Taylor, Jerrell Watts, Sadasivan Shankar
Concurrent Simulation Of Plasma Reactors, Marc Rieffel, Stephen Taylor, Jerrell Watts, Sadasivan Shankar
College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects
This paper summarizes the computational techniques behind a novel concurrent simulation method used for studying the neutral flow inside plasma reactors. The technique is intended to cope with low pressure flow (less than 1.5 Torr) in realistic three-dimensional geometries. It is based on the Direct Simulation Monte Carlo method to accurately model rarefied gas flow. The concurrent formulation operates on a broad variety of shared-memory multiprocessors, multicomputers, and networked workstations.
Practical Algorithms For Selection On Coarse-Grained Parallel Computers, Ibraheem Al-Furaih, Srinivas Aluru, Sanjay Goil, Sanjay Ranka
Practical Algorithms For Selection On Coarse-Grained Parallel Computers, Ibraheem Al-Furaih, Srinivas Aluru, Sanjay Goil, Sanjay Ranka
College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects
In this paper, we consider the problem of selection on coarse-grained distributed memory parallel computers. We discuss several deterministic and randomized algorithms for parallel selection. We also consider several algorithms for load balancing needed to keep a balanced distribution of data across processors during the execution of the selection algorithms. We have carried out detailed implementations of all the algorithms discussed on the CM-5 and report on the experimental results. We demonstrate that the randomized algorithms are superior to their deterministic counterparts.
Integer Sorting Algorithms For Coarse-Grained Parallel Machines, Khaled Alsabti, Sanjay Ranka
Integer Sorting Algorithms For Coarse-Grained Parallel Machines, Khaled Alsabti, Sanjay Ranka
College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects
Integer sorting is a subclass of the sorting problem where the elements have integer values and the largest element is polynomially bounded in the number of elements to be sorted. It is useful for applications in which the size of the maximum value of element to be sorted is bounded. In this paper, we present a new distributed radix-sort algorithm for integer sorting. The structure of our algorithm is similar to radix sort except that it typically requires less number of communication phases. We present experimental results for our algorithm on two distributed memory multiprocessors, the Intel Paragon and the …
The Software Architecture Of A Virtual Distributed Computing Environment, Haluk Topcuoglu, Salim Hariri, Wojtek Furmanski, Jon Valente
The Software Architecture Of A Virtual Distributed Computing Environment, Haluk Topcuoglu, Salim Hariri, Wojtek Furmanski, Jon Valente
Electrical Engineering and Computer Science - All Scholarship
The requirements of grand challenge problems and the deployment of gigabit networks makes the network computing framework an attractive and cost effective computing environment with which to interconnect geographically distributed processing and storage resources. Our project, Virtual Distributed Computing Environment (VDCE), provides a problem-solving environment for high-performance distributed computing over wide area networks. VDCE delivers well-defined library functions that relieve end-users of tedious task implementations and also support reusability. In this paper we present the conceptual design of VDCE software architecture, which is defined in three modules: a) the Application Editor, a user-friendly application development environment that generates the Application …
Parallel Domain Decomposition And Load Balancing Using Space-Filling Curves, Srinivas Aluru, Faith E. Sevilgen
Parallel Domain Decomposition And Load Balancing Using Space-Filling Curves, Srinivas Aluru, Faith E. Sevilgen
Electrical Engineering and Computer Science - All Scholarship
Partitioning techniques based on space-filling curves have received much recent attention due to their low running time and good load balance characteristics. The basic idea underlying these methods is to order the multidimensional data according to a space-filling curve and partition the resulting one-dimensional order. However, space-filling curves are defined for points that lie on a uniform grid of a particular resolution. It is typically assumed that the coordinates of the points are representable using a fixed number of bits, and the run-times of the algorithms depend upon the number of bits used. In this paper, we present a simple …
Selective Crossover: Towards Fitter Offspring, Chilukuri K. Mohan
Selective Crossover: Towards Fitter Offspring, Chilukuri K. Mohan
Electrical Engineering and Computer Science - All Scholarship
A new general-purpose crossover operator is proposed. The representation of a candidate solution is slightly perturbed, and the ensuing changes in fitness are calculated. Such fitness changes (for parents) are used in constructing the offspring resulting from crossover. Experiments with several sets of problems demonstrate that this approach leads to rapid increases in average and best fitness, and performs much better than traditional general-purpose crossover operators.
A Global Computing Environment For Networked Resources, Haluk Topcuoglu, Salim Hariri
A Global Computing Environment For Networked Resources, Haluk Topcuoglu, Salim Hariri
Electrical Engineering and Computer Science - All Scholarship
Current advances in high-speed networks and WWW technologies have made network computing a cost-effective, high-performance computing alternative. New software tools are being developed to utilize efficiently the network computing environment. Our project, called Virtual Distributed Computing Environment (VDCE), is a high-performance computing environment that allows users to write and evaluate networked applications for different hardware and software configurations using a web interface. In this paper we present the software architecture of VDCE by emphasizing application development and specification, scheduling, and execution/runtime aspects.
Simulated Annealing And Genetic Algorithms For Partial Shape Matching, Ender Ozcan, Chilukuri K. Mohan
Simulated Annealing And Genetic Algorithms For Partial Shape Matching, Ender Ozcan, Chilukuri K. Mohan
Electrical Engineering and Computer Science - All Scholarship
Partial shape matching may be viewed as an optimization problem, to be solved using methods such as simulated annealing (SA) and genetic algorithms (GAs). We apply and compare both these methods for matching input shapes with model shapes described in terms of features such as line segments and angles. The quality of matching is gauged using a measure derived from attributed shape grammars [10, 11]. Current results show that both SA and GA succeed in the shape matching task; the GA is faster and yields the global optimum more often than the versions of SA implemented.
Experiments With "Hp Java", Bryan Carpenter, Yuh-Jye Chang, Geoffrey C. Fox, Donald Leskiw
Experiments With "Hp Java", Bryan Carpenter, Yuh-Jye Chang, Geoffrey C. Fox, Donald Leskiw
Northeast Parallel Architecture Center
We consider the possible role of Java as a language for High Performance Computing. After discussing reasons why Java may be a natural candidate for a portable parallel programming language, we describe several case studies. These cover Java socket programming, message-passing through a Java interface to MPI, and class libraries for data-parallel programming in Java.
Hpjava: Data Parallel Extensions To Java, Bryan Carpenter, Guansong Zhang, Geoffrey C. Fox, Xinying Li
Hpjava: Data Parallel Extensions To Java, Bryan Carpenter, Guansong Zhang, Geoffrey C. Fox, Xinying Li
Northeast Parallel Architecture Center
We outline an extension of Java for programming with distributed arrays. The basic programming style is Single Program Multiple Data (SPMD), but parallel arrays are provided as new language primitives. Further extensions include three distributed control constructs, the most important being a data-parallel loop construct. Communications involving distributed arrays are handled through a standard library of collective operations. Because the underlying programming model is SPMD programming, direct calls to MPI or other communication packages are also allowed in an HPJava program.
A Comparison Of Annealing Techniques For Academic Course Scheduling, M.A. Saleh Elmohamed, Geoffrey C. Fox, Paul Coddington
A Comparison Of Annealing Techniques For Academic Course Scheduling, M.A. Saleh Elmohamed, Geoffrey C. Fox, Paul Coddington
Northeast Parallel Architecture Center
In this study we have tackled the NP-hard problem of academic class scheduling (or timetabling) at the university level. We have investigated a variety of approaches based on simulated annealing, including mean-field annealing, simulated annealing with three different cooling schedules, and the use of a rule-based preprocessor to provide a good initial solution for annealing. The best results were obtained using simulated annealing with adaptive cooling and reheating as a function of cost, and a rule-based preprocessor. This approach enabled us to obtain valid schedules for the timetabling problem for a large university, using a complex cost function that includes …
A Load Balancing Technique For Multiphase Computations, Jerrell Watts, Marc Rieffel, Stephen Taylor
A Load Balancing Technique For Multiphase Computations, Jerrell Watts, Marc Rieffel, Stephen Taylor
College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects
Parallel computations comprised of multiple, tightly interwoven phases of computation may require a different approach to dynamic load balancing than single-phase computations. This paper presents a load sharing method based on the view of load as a vector, rather than as a scalar. This approach allows multiphase computations to achieve higher efficiency on large-scale multicomputers than possible with traditional techniques. Results are presented for two large-scale particle simulations running on 128 nodes of an Intel Paragon and on 256 processors of a Cray T3D, respectively.
Standardization Of A Communication Middleware For High-Performance Real-Time Systems, Arkady Kanevsky, Anthony Skjellum, Jerrell Watts
Standardization Of A Communication Middleware For High-Performance Real-Time Systems, Arkady Kanevsky, Anthony Skjellum, Jerrell Watts
Electrical Engineering and Computer Science - All Scholarship
The last several years saw an emergence of standardization activities for real-time systems including standardization of operating systems (series of POSIX standards [1]), of communication for distributed (POSIX.21 [10]) and parallel systems (MPI/RT [5]) and real-time object management (realtime CORBA [9]). This article describes the ongoing standardization work and implementation of communication middleware for high performance real-time computing. The real-time message passing interface (MPI/RT) advances the non-real-time high-performance communication standard Message Passing Interface Standard (MPI), emphasizing changes that enable and support real-time communication, and is targeted for embedded, fault-tolerant and other real-time systems. MPI/RT is the only communication middleware layer …
Resource Access Control For An Internet User Agent, Nataraj Nagaratnam, Steven B. Byrne
Resource Access Control For An Internet User Agent, Nataraj Nagaratnam, Steven B. Byrne
Electrical Engineering and Computer Science - All Scholarship
The rapid increase in the Internet's connectivity has lead to proportional increase in the development of Web-based applications. Usage of downloadable content has proved effective in a number of emerging applications including electronic commerce, software components on-demand, and collaborative systems. In all these cases, Internet user agents (like browsers, tuners) are widely used by the clients to utilize and execute such downloadable content. With this new technology of using downloadable content comes the problem of the downloaded content obtaining unauthorized access to the client's resources. In effect, granting a hostile remote principal the requested access to client's resources may lead …
Scis Networking - January 1997, Nova Southeastern University
Scis Networking - January 1997, Nova Southeastern University
CCIS Networking / SCIS Networking magazines
No abstract provided.
An Efficient K-Means Clustering Algorithm, Khaled Alsabti, Sanjay Ranka, Vineet Singh
An Efficient K-Means Clustering Algorithm, Khaled Alsabti, Sanjay Ranka, Vineet Singh
Electrical Engineering and Computer Science - All Scholarship
In this paper, we present a novel algorithm for performing k-means clustering. It organizes all the patterns in a k-d tree structure such that one can find all the patterns which are closest to a given prototype efficiently. The main intuition behind our approach is as follows. All the prototypes are potential candidates for the closest prototype at the root level. However, for the children of the root node, we may be able to prune the candidate set by using simple geometrical constraints. This approach can be applied recursively until the size of the candidate set is one for each …
Webflow - A Visual Programming Paradigm For Web/Java Based Coarse Grain Distributed Computing, Dimple Bhatia, Vanco Burzevski, Maja Camuseva, Geoffrey C. Fox
Webflow - A Visual Programming Paradigm For Web/Java Based Coarse Grain Distributed Computing, Dimple Bhatia, Vanco Burzevski, Maja Camuseva, Geoffrey C. Fox
Northeast Parallel Architecture Center
We present here the recent work at NPAC aimed at developing WebFlow---a general purpose Web based visual interactive programming environment for coarse grain distributed computing. We follow the 3-tier architecture with the central control and integration WebVM layer in tier-2, interacting with the visual graph editor applets in tier-1 (front-end) and the legacy systems in tier-3. WebVM is given by a mesh of Java Web servers such as Jeeves from JavaSoft or Jigsaw from MIT/W3C. All system control structures are implemented as URL-addressable servlets which enable Web browser-based authoring, monitoring, publication, documentation and software distribution tools for distributed computing. We …
Random Number Generators For Parallel Computers, Paul D. Coddington
Random Number Generators For Parallel Computers, Paul D. Coddington
Northeast Parallel Architecture Center
Random number generators are used in many applications, from slot machines to simulations of nuclear reactors. For many computational science applications, such as Monte Carlo simulation, it is crucial that the generators have good randomness properties. This is particularly true for large-scale simulations done on high-performance parallel computers. Good random number generators are hard to find, and many widely-used techniques have been shown to be inadequate. Finding high-quality, efficient algorithms for random number generation on parallel computers is even more difficult. Here we present a review of the most commonly-used random number generators for parallel computers, and evaluate each generator …
Java For Parallel Computing And As A General Language For Scientific And Engineering Simulation And Modeling, Geoffrey C. Fox, Wojtek Furmanski
Java For Parallel Computing And As A General Language For Scientific And Engineering Simulation And Modeling, Geoffrey C. Fox, Wojtek Furmanski
Northeast Parallel Architecture Center
We discuss the role of Java and Web technologies for general simulation. We classify the classes of concurrency typical in problems and analyze separately the role of Java in user interfaces, coarse grain software integration, and detailed computational kernels. We conclude that Java could become a major language for computational science, as it potentially offers good performance, excellent user interfaces, and the advantages of object-oriented structure.
Pcrc-Based Hpf Compilation, Guansong Zhang, Bryan Carpenter, Geoffrey C. Fox, Xiaoming Li
Pcrc-Based Hpf Compilation, Guansong Zhang, Bryan Carpenter, Geoffrey C. Fox, Xiaoming Li
Northeast Parallel Architecture Center
This paper describes an ongoing effort supported by ARPA PCRC (Parallel Compiler Runtime Consortium) project. In particular, we discuss the design and implementation of an HPF compilation system based on PCRC runtime. The approaches to issues such as directive analysis and communication detection are discussed in detail. The discussion includes fragments of code generated by the compiler.
A Prototype Fortran-To-Java Converter, Geoffrey C. Fox, Xiaoming Li, Zheng Qiang, Wu Zhigang
A Prototype Fortran-To-Java Converter, Geoffrey C. Fox, Xiaoming Li, Zheng Qiang, Wu Zhigang
Northeast Parallel Architecture Center
This is a report on a prototype of a FORTRAN 77 to Java converter, f2j. Translation issues are identified, approaches are presented, a URL is provided for interested readers to download the package, and some unsolved problems are brought up. F2j allows value added to some of the investment onFORTRAN code, in particular, those well established FORTRAN libraries for scientific and engineering computation.
A Comparison Of Optimization Heuristics For The Data Mapping Problem, Nikos Chrisochoides, Nashat Mansour, Geoffrey C. Fox
A Comparison Of Optimization Heuristics For The Data Mapping Problem, Nikos Chrisochoides, Nashat Mansour, Geoffrey C. Fox
Northeast Parallel Architecture Center
In this paper we compare the performance of six heuristics with suboptimal solutions for the data distribution of two dimensional meshes that are used for the numerical solution of Partial Differential Equations (PDEs) on multicomputers. The data mapping heuristics are evaluated with respect to seven criteria covering load balancing, interprocessor communication, flexibility and ease of use for a class of single-phase iterative PDE solvers. Our evaluation suggests that the simple and fast block distribution heuristic can be as effective as the other five complex and computational expensive algorithms.
Evaluation Of High Performance Fortran Through Application Kernels, Hon W. Yau, Geoffrey C. Fox, Ken Hawick
Evaluation Of High Performance Fortran Through Application Kernels, Hon W. Yau, Geoffrey C. Fox, Ken Hawick
Northeast Parallel Architecture Center
Since the definition of the High Performance Fortran (HPF) standard, we have been maintaining a suite of application kernel codes with the aim of using them to evaluate the available compilers. This paper presents the results and conclusions from this study, for sixteen codes, on compilers from IBM, DEC, and the Portland Group Inc. (PGI), and on three machines: a DEC Alphafarm, an IBM SP-2, and a Cray T3D. From this, we hope to show the prospective HPF user that scalable performance is possible with modest effort, yet also where the current weaknesses lay.
Tango - A Collaborative Environment For The World-Wide Web, Lukasz Michal Beca, Gang Cheng, Geoffrey C. Fox, Tomasz Jurga, Konrad Olszewski, Marek Podgorny, Piotr Sokolowski, Tomasz Stachowiak, Krzysztof Walczak
Tango - A Collaborative Environment For The World-Wide Web, Lukasz Michal Beca, Gang Cheng, Geoffrey C. Fox, Tomasz Jurga, Konrad Olszewski, Marek Podgorny, Piotr Sokolowski, Tomasz Stachowiak, Krzysztof Walczak
Northeast Parallel Architecture Center
Geographical and logical growth of the World-Wide Web is accompanied by a fast technological development. Web can be successfully used as a platform for implementation of diverse applications. Distributed and collaborative systems are among the most challenging Web applications. TANGO is an integration platform which enables implementation of Web-based collaborative environments. The system provides means for fast integration of Web- and non-Web-applications into one multi-user collaborative systems. In this paper we describe the functional model, requirements, system design and certain implementation issues of the TANGO system.
A Compiler Algorithm For Optimizing Locality In Loop Nests, Mahmut Kandemir, J. Ramanujam, Alok Choudhary
A Compiler Algorithm For Optimizing Locality In Loop Nests, Mahmut Kandemir, J. Ramanujam, Alok Choudhary
Electrical Engineering and Computer Science - All Scholarship
This paper describes an algorithm to optimize cache locality in scientific codes on uniprocessor and multiprocessor machines. A distinctive characteristic of our algorithm is that it considers loop and data layout transformations in a unified framework. We illustrate through examples that our approach is very effective at reducing cache misses and tile size sensitivity of blocked loop nests; and can optimize nests for which optimization techniques based on loop transformations alone are not successful. An important special case is the one in which data layouts of some arrays are fixed and cannot be changed. We show how our algorithm can …