Beyond the mere collection of computers, a network is the home of competing and cooperating execution flows. In this paper we show how to design network protocols based on molecule-like entities such that the corresponding execution flows can by analyzed as if they were chemical processes. Our goal is to create robust protocol implementations which are resilient to unreliable execution. We intr...

Beyond the mere collection of computers, a network is the home of competing and cooperating execution flows. In this paper we show how to design network protocols based on molecule-like entities such that the corresponding execution flows can by analyzed as if they were chemical processes. Our goal is to create robust protocol implementations which are resilient to unreliable execution. We intr...

We design an efficient on-line approach, FlowMate, for partitioning flows at a busy server into flow groups that share bottlenecks. These groups are periodically input to congestion coordination, aggregation, load balancing, admission control, or pricing modules. FlowMate uses inband packet delay measurements to the receivers to determine shared bottlenecks among flows. Packet delay information...

assembly line production is one of the widely used basic principles in production system. the problem of assembly line balancing deals with the distribution of activities among the workstations so that there will be maximum utilization of human resources and facilities without disturbing the work sequence. research works reported in the literature mainly deals with minimization of idle time i.e...

Computational fluid dynamics (CFD) flow simulations are extremely expensive in terms of CPU time and memory. In this study, parallel computing and grid adaptation techniques are employed to achieve high efficiency and accuracy in a hybrid unstructured flow solver. However, adaptive local grid refinement/coarsening causes the unequal distribution of workload among the processors at run time. A s...

Existing local iterative algorithms for load-balancing are ill-suited to many large-scale interconnection networks. The main reasons are complicated Laplace spectrum computations and flow scheduling strategies. Many large-scale networks are modular and/or hierarchically structured, a prime example being the class of swapped or OTIS networks that have received much attention in recent years. We ...

This paper presents a scalability and load balancing study of the All-Path protocols, a family of distributed switching protocols based on path exploration. ARP-Path is the main protocol and it explores every possible path reaching from source to destination by using ARP messages, selecting the lowest latency path. Flow-Path and Bridge-Path are respectively the flow-based and bridge-based versi...