Sciweavers

5005 search results - page 136 / 1001
» The Design and Analysis of Parallel Algorithms
Sort
View
IPPS
2000
IEEE
15 years 5 months ago
Study of a Multilevel Approach to Partitioning for Parallel Logic Simulation
Parallel simulation techniques are often employed to meet the computational requirements of large hardware simulations in order to reduce simulation time. In addition, partitionin...
Swaminathan Subramanian, Dhananjai Madhava Rao, Ph...
IPPS
2006
IEEE
15 years 6 months ago
A design environment for mobile applications
In this paper we show how high-level UML models of mobile computing applications can be analysed for classical performance measures such as throughput. The approach proceeds by co...
Stephen Gilmore, Valentin Haenel, Jane Hillston, J...
106
Voted
SPAA
1995
ACM
15 years 4 months ago
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
130
Voted
ICDM
2007
IEEE
131views Data Mining» more  ICDM 2007»
15 years 7 months ago
Parallel Mining of Frequent Closed Patterns: Harnessing Modern Computer Architectures
Inspired by emerging multi-core computer architectures, in this paper we present MT CLOSED, a multi-threaded algorithm for frequent closed itemset mining (FCIM). To the best of ou...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...
79
Voted
PODC
1999
ACM
15 years 5 months ago
Analysis of Timing-Based Mutual Exclusion with Random Times
Various timing-based mutualexclusion algorithms have been proposed that guarantee mutual exclusion if certain timing assumptions hold. In this paper, we examine how these algorith...
Eli Gafni, Michael Mitzenmacher