Sciweavers

34 search results - page 6 / 7
» Complexity of scheduling with analog network coding
Sort
View
PPPJ
2006
ACM
14 years 11 days ago
Enabling Java mobile computing on the IBM Jikes research virtual machine
Today’s complex applications must face the distribution of data and code among different network nodes. Java is a wide-spread language that allows developers to build complex so...
Giacomo Cabri, Letizia Leonardi, Raffaele Quitadam...
ICCD
2003
IEEE
147views Hardware» more  ICCD 2003»
14 years 3 months ago
An Efficient VLIW DSP Architecture for Baseband Processing
The VLIW processors with static instruction scheduling and thus deterministic execution times are very suitable for highperformance real-time DSP applications. But the two major w...
Tay-Jyi Lin, Chin-Chi Chang, Chen-Chia Lee, Chein-...
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 3 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
CODES
2006
IEEE
14 years 14 days ago
Integrated analysis of communicating tasks in MPSoCs
Predicting timing behavior is key to efficient embedded real-time system design and verification. Especially memory accesses and co-processor calls over shared communication net...
Simon Schliecker, Matthias Ivers, Rolf Ernst
NCA
2006
IEEE
14 years 13 days ago
Parallelization of Geant4 Using TOP-C and Marshalgen
Geant4 is a very large, highly accurate toolkit for Monte Carlo simulation of particle-matter interaction. It has been applied to high-energy physics, cosmic ray modeling, radiati...
Gene Cooperman, Viet Ha Nguyen, Igor Malioutov