Sivarama P. Dandamudi

Learn More
Load sharing improves performance of distributed systems by distributing load from heavily-loaded nodes to lightly-loaded nodes in the system. We consider two basic dynamic load sharing policies: sender-initiated and receiver-initiated. In the sender-initiated policy, a heavily-loaded node attempts to transfer work to a lightly-loaded node and in the(More)
Multicomputer systems are distributed-memory The Cosmic Cube [25], the Finite Element Machine [20], the NCUBE/ten [13], and the Transputer system [30] are examples of multicomputer systems. The Butterfly Parallel Proces-'Or [513 the NYU U1tracomputer [l and the CEDAR system 191 are examples of multiprocessor systems. The IBM RP3 [23] is an example of a(More)
In parallel systems it is possible for several processors to request concurrent access to a shared data structure such as a synchronization variable. Such an access pattern causes what is known as hot-spot contention. In shared-memory multiprocessor systems that use a multistage interconnection network, hot-spot contention may result in "tree saturation"(More)
− Dynamic load sharing policies have been extensively studied. Most of the previous studies have assumed a homogeneous distributed system with a first-come-first-served (FCFS) node scheduling policy. In addition, job service times and inter-arrival times are assumed to be exponentially distributed. In this paper, we study the impact of these assumptions on(More)
ÐTraditional multiprocessor scheduling schemes have been one of either space-sharing or time-sharing. Space-sharing schemes perform better than time-sharing at low to moderate system loads. However, they have a disadvantage of wasting processing power within partitions at medium to high system loads. Time sharing schemes tend to perform better at medium to(More)