Sciweavers

1732 search results - page 27 / 347
» New Challenges in Parallel Optimization
Sort
View
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
14 years 8 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
IPPS
2005
IEEE
14 years 1 months ago
Extended Golomb Rulers as the New Recovery Schemes in Distributed Dependable Computing
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all computers are up and running, we would like the load to be evenly distri...
Kamilla Klonowska, Lars Lundberg, Håkan Lenn...
CISS
2008
IEEE
14 years 2 months ago
On wireless network scheduling with intersession network coding
Abstract—Cross-layer optimization including congestion control, routing, and scheduling has shown dramatic throughput improvement over layered designs for wireless networks. In p...
Chih-Chun Wang, Ness B. Shroff
PIMRC
2008
IEEE
14 years 2 months ago
Double Hopping: A new approach for Dynamic Frequency Hopping in Cognitive Radio networks
—One of the major challenges in designing cellular Cognitive Radio (CR) networks is the avoidance of Secondary User (SU) interference to so called Primary Users (PUs) operating i...
Daniel Willkomm, Mathias Bohge, Daniel Hollos, Jam...
CC
2007
Springer
157views System Software» more  CC 2007»
14 years 2 months ago
New Algorithms for SIMD Alignment
Optimizing programs for modern multiprocessor or vector platforms is a major important challenge for compilers today. In this work, we focus on one challenging aspect: the SIMD ALI...
Liza Fireman, Erez Petrank, Ayal Zaks