Sciweavers

167 search results - page 21 / 34
» An Algebraic Framework for Optimizing Parallel Programs
Sort
View
IPPS
2003
IEEE
14 years 23 days ago
Task Graph Scheduling Using Timed Automata
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
Yasmina Abdeddaïm, Abdelkarim Kerbaa, Oded Ma...
IEEEPACT
1998
IEEE
13 years 11 months ago
A Matrix-Based Approach to the Global Locality Optimization Problem
Global locality analysis is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout optimizations. Pure loop tran...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
CONCURRENCY
2007
101views more  CONCURRENCY 2007»
13 years 7 months ago
OpenUH: an optimizing, portable OpenMP compiler
OpenMP has gained wide popularity as an API for parallel programming on shared memory and distributed shared memory platforms. Despite its broad availability, there remains a need ...
Chunhua Liao, Oscar Hernandez, Barbara M. Chapman,...
ICDE
1997
IEEE
114views Database» more  ICDE 1997»
14 years 8 months ago
Modeling Multidimensional Databases
We propose a data model and a few algebraic operations that provide semantic foundation to multidimensional databases. The distinguishing feature of the proposed model is the symm...
Rakesh Agrawal, Ashish Gupta, Sunita Sarawagi
NJC
2006
125views more  NJC 2006»
13 years 7 months ago
PRO: A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms
Abstract. We present a new parallel computation model called the Parallel ResourceOptimal computation model. PRO is a framework being proposed to enable the design of efficient and...
Assefaw Hadish Gebremedhin, Mohamed Essaïdi, ...