Sciweavers

202 search results - page 16 / 41
» Complexity of Collective Communications on NoCs
Sort
View
ICDCS
1999
IEEE
13 years 11 months ago
The Inter-group Router Approach to Scalable Group Composition
This paper examines the problem of building scalable, fault-tolerant distributed systems from collections of communicating process groups, while maintaining well-defined end-to-en...
Scott Johnson, Farnam Jahanian, Jigney Shah
VLDB
1997
ACM
140views Database» more  VLDB 1997»
13 years 11 months ago
Parallel Query Scheduling and Optimization with Time- and Space-Shared Resources
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or...
Minos N. Garofalakis, Yannis E. Ioannidis
LREC
2010
203views Education» more  LREC 2010»
13 years 8 months ago
MPC: A Multi-Party Chat Corpus for Modeling Social Phenomena in Discourse
In this paper, we describe our experience with collecting and creating an annotated corpus of multi-party online conversations in a chat-room environment. This effort is part of a...
Samira Shaikh, Tomek Strzalkowski, Aaron Broadwell...
INFOCOM
2012
IEEE
11 years 9 months ago
NSDMiner: Automated discovery of Network Service Dependencies
—Enterprise networks today host a wide variety of network services, which often depend on each other to provide and support network-based services and applications. Understanding...
Arun Natarajan, Peng Ning, Yao Liu, Sushil Jajodia...
MOBIHOC
2008
ACM
14 years 7 months ago
Rendezvous design algorithms for wireless sensor networks with a mobile base station
Recent research shows that significant energy saving can be achieved in wireless sensor networks with a mobile base station that collects data from sensor nodes via short-range co...
Guoliang Xing, Tian Wang, Weijia Jia, Minming Li