Sciweavers

246 search results - page 21 / 50
» A Proof System for Asynchronously Communicating Deterministi...
Sort
View
IPCO
1998
99views Optimization» more  IPCO 1998»
15 years 1 months ago
Non-approximability Results for Scheduling Problems with Minsum Criteria
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeging...
AMAST
2000
Springer
15 years 4 months ago
The Algebra of Multi-tasking
Modelling multi-tasking behaviour is an important phase of real-time system design. It is shown how task scheduling principles can be captured in a CCS-based process algebra via ex...
Colin J. Fidge
ICC
2007
IEEE
164views Communications» more  ICC 2007»
15 years 6 months ago
Communication Limits with Low Precision Analog-to-Digital Conversion at the Receiver
— We examine the Shannon limits of communication systems when the precision of the analog-to-digital conversion (ADC) at the receiver is constrained. ADC is costly and powerhungr...
Jaspreet Singh, Onkar Dabeer, Upamanyu Madhow
IANDC
2010
83views more  IANDC 2010»
14 years 10 months ago
Static analysis of topology-dependent broadcast networks
Broadcast semantics poses significant challenges over point-to-point communication when it comes to formal modelling and analysis. Current approaches to analysing broadcast netwo...
Sebastian Nanz, Flemming Nielson, Hanne Riis Niels...
PPOPP
2009
ACM
16 years 8 days ago
MPIWiz: subgroup reproducible replay of mpi applications
Message Passing Interface (MPI) is a widely used standard for managing coarse-grained concurrency on distributed computers. Debugging parallel MPI applications, however, has alway...
Ruini Xue, Xuezheng Liu, Ming Wu, Zhenyu Guo, Weng...