Several protocols have been proposed to synchronize the logical processes (LP’s) of a parallel discrete event simulation (PDES). While most protocols have been known to perform well under certain conditions, the general observation has been that the performance of protocols is sensitive to the application being simulated, sometimes even to a particular instance of it. In this technical note, we...

we give an algorithm, called t*, for finding the k shortest simplepaths connecting a certain pair of nodes, s and t, in a acyclic digraph.first the nodes of the graph are labeled according to the topologicalordering. then for node i an ordered list of simple s − i paths iscreated. the length of the list is at most k and it is created by usingtournament trees. we prove the correctness of t* and ...

Energy efficiency, one of the key factors for sensor network, is a challenging work. It is agreed that sink routing is the main influencing factor for energy efficiency and selecting an optimal routing path becomes critical. It is hard for source participant (sink nodes, namely trustor) to select a trustworthy target participant (data collecting sensor nodes, namely trustee), especially when th...

This paper presents a clock selection algorithm for control-flow intensive behaviors that are characterized by the presence of conditionals and deeply-nested loops. Unlike previous works, which are primarily geared towards data-dominated behaviors, this algorithm examines the effects of branch probabilities and their interaction with allocation constraints. We demonstrate, using examples, how c...

As the access links of the Internet get faster, there is an incentive for the end hosts to demand higher throughputs. To meet their demands with minimum change at the Internet core, it is necessary to explore the existing core capacity efficiently. Multipath transport protocols try to address this problem by allocating traffic efficiently and fairly over some preselected paths, thus utilizing t...

The optimal representative set selection problem is defined thus: given a set of test requirements and a test suite that satisfies all test requirements, find a subset of the test suite containing a minimum number of test cases that still satisfies all test requirements. Existing methods for solving the representative set selection problem do not guarantee that obtained representative sets are ...