Sciweavers

202 search results - page 28 / 41
» Complexity of Collective Communications on NoCs
Sort
View
SPAA
2003
ACM
14 years 19 days ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
INFOCOM
2006
IEEE
14 years 1 months ago
Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
Prasanna Chaporkar, Saswati Sarkar
INFOCOM
2010
IEEE
13 years 5 months ago
Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
Theus Hossmann, Thrasyvoulos Spyropoulos, Franck L...
GPEM
2007
87views more  GPEM 2007»
13 years 7 months ago
Motility, mixing, and multicellularity
Abstract. A fundamental issue in evolutionary biology is the transition from unicellular to multicellular organisms, and the cellular differentiation that accompanies the increase...
Cristian A. Solari, John O. Kessler, Raymond E. Go...
IJHPCA
2007
114views more  IJHPCA 2007»
13 years 7 months ago
An Approach To Data Distributions in Chapel
A key characteristic of today’s high performance computing systems is a physically distributed memory, which makes the efficient management of locality essential for taking adv...
R. E. Diaconescu, Hans P. Zima