Sciweavers

349 search results - page 30 / 70
» A New Approach to Scalable Linda-systems Based on Swarms
Sort
View
95
Voted
IPPS
2007
IEEE
15 years 4 months ago
Adaptive Distributed Database Replication Through Colonies of Pogo Ants
We address the problem of optimizing the distribution of partially replicated databases over a computer network. Replication is used to increase data availability in the presence ...
Sarah Abdul-Wahid, Razvan Andonie, Joseph Lemley, ...
TON
2008
135views more  TON 2008»
14 years 9 months ago
Measurement-based admission control at edge routers
Abstract-- It is very important to allocate and manage resources for multimedia traffic flows with real-time performance requirements in order to guarantee quality-of-service (QoS)...
Seung Yeob Nam, Sunggon Kim, Dan Keun Sung
TCAD
2010
90views more  TCAD 2010»
14 years 4 months ago
Fast, Nearly Optimal ISE Identification With I/O Serialization Through Maximal Clique Enumeration
The last decade has witnessed the emergence of the application-specific instruction-set processor (ASIP) as a viable platform for embedded systems. Extensible ASIPs allow the user ...
Ajay K. Verma, Philip Brisk, Paolo Ienne
MIDDLEWARE
2005
Springer
15 years 3 months ago
MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks
Abstract. Design of distributed architectures for content-based publish-subscribe (pub-sub) service networks has been a challenging problem. To best support the highly dynamic and ...
Fengyun Cao, Jaswinder Pal Singh
ICWS
2009
IEEE
14 years 7 months ago
An Efficient Service Discovery Algorithm for Counting Bloom Filter-Based Service Registry
The Service registry, the yellow pages of ServiceOriented Architecture (SOA), plays a central role in SOAbased service systems. The service registry has to be scalable to manage l...
Shuxing Cheng, Carl K. Chang, Liang-Jie Zhang