Sciweavers

334 search results - page 33 / 67
» Concurrency Among Strangers
Sort
View
IPPS
1999
IEEE
13 years 11 months ago
Dynamic Process Composition and Communication Patterns in Irregularly Structured Applications
In this paper we describe one experiment in which a new coordination language, called MANIFOLD, is used to restructure an existing sequential Fortran code from computational uid dy...
C. T. H. Everaars, Barry Koren, Farhad Arbab
INFOCOM
1993
IEEE
13 years 11 months ago
Power-Optimal Layout of Passive, Single-Hop, Fiber-Optic Interconnections Whose Capacity Increases with the Number of Stations
Passive, single-hop interconnections among N stations, each with several transmitters and receivers, provide a communication path between any two stations using one of the transmi...
Yitzhak Birk
INFOCOM
1993
IEEE
13 years 11 months ago
Burstiness Bounds for Some Burst Reducing Servers
In [18], we propose a framework to study a stream of trafic or message as it is transferred over an ATM connection. A message is modeled as a deierministic fluid flow, and an ATM ...
Steven H. Low, Pravin Varaiya
VLDB
1992
ACM
122views Database» more  VLDB 1992»
13 years 11 months ago
Using Flexible Transactions to Support Multi-System Telecommunication Applications
Service order provisioning is an important telecommunication application that automates the process of providing telephone services in response to the customer requests. It is an ...
Mansoor Ansari, Linda Ness, Marek Rusinkiewicz, Am...
DEXAW
2004
IEEE
181views Database» more  DEXAW 2004»
13 years 11 months ago
Algebraic Optimization of Data Delivery Patterns in Mobile Sensor Networks
Database-like query processing over a network of sensors has become an attractive paradigm for building sensor applications. A sensor query is characterized by data streams among ...
Vladimir Zadorozhny, Panos K. Chrysanthis, Alexand...