Sciweavers

116 search results - page 3 / 24
» Fundamental Network Processor Performance Bounds
Sort
View
TPDS
1998
118views more  TPDS 1998»
13 years 4 months ago
Optimizing Computing Costs Using Divisible Load Analysis
—A bus oriented network where there is a charge for the amount of divisible load processed on each processor is investigated. A cost optimal processor sequencing result is found ...
Jeeho Sohn, Thomas G. Robertazzi, Serge Luryi
TON
1998
186views more  TON 1998»
13 years 5 months ago
Virtual path control for ATM networks with call level quality of service guarantees
— The configuration of virtual path (VP) connection services is expected to play an important role in the operation of large-scale asynchronous transfer mode (ATM) networks. A m...
Nikolaos Anerousis, Aurel A. Lazar
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
14 years 5 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
BIRTHDAY
2003
Springer
13 years 10 months ago
Distributed Cooperation and Adversity: Complexity Trade-Offs
The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundament...
Chryssis Georgiou, Alexander Russell, Alexander A....
RTAS
2005
IEEE
13 years 11 months ago
Timing Analysis for Sensor Network Nodes of the Atmega Processor Family
Low-end embedded architectures, such as sensor nodes, have become popular in diverse fields, many of which impose real-time constraints. Currently, the Atmel Atmega processor fam...
Sibin Mohan, Frank Mueller, David B. Whalley, Chri...