S-nets: A Petri net based model for performance evaluation of real-time scheduling algorithms

A new class of nets, called S-nets, is introduced for the performance analysis of scheduling algorithms used in real-time systems Deterministic timed Petri nets do not adequately model the scheduling of resources encountered in real-time systems, and need to be augmented with resource places and signal places, and a scheduler block, to facilitate the modeling of scheduling algorithms. The tokens are colored, and the transition firing rules are suitably modified. Further, the concept of transition folding is used, to get intuitively simple models of multiframe real-time systems. Two generic performance measures, called �load index� and �balance index,� which characterize the resource utilization and the uniformity of workload distribution, respectively, are defined. The utility of S-nets for evaluating heuristic-based scheduling schemes is illustrated by considering three heuristics for real-time scheduling. S-nets are useful in tuning the hardware configuration and the underlying scheduling policy, so that the system utilization is maximized, and the workload distribution among the computing resources is balanced.

Synthesis and cation binding properties of new bile acid-based crown ethers

A series of bile acid-based crown ethers (7a-c,12 and 13) were easily constructed from readily available precursors. Measurement of association constants (K-a) with alkali metal picrates in CHCl3 showed that azacrown ethers 7a-c and Chola-Cuowns 12 and 13 show greater binding towards Rb+ and K+. The presence of the aromatic moieties showed subtle changes in the binding properties. Insight II minimized structures show very different conformations of aromatic units in 7a-b and 13.

Efficient syntheses of benzothiazepines as antagonists for the mitochondrial sodium-calcium exchanger: Potential therapeutics for type II diabetes

Type II diabetes mellitus is a chronic metabolic disorder that can lead to serious cardiovascular, renal, neurologic, and retinal complications. While several drugs are currently prescribed to treat type II diabetes, their efficacy is limited by mechanism-related side effects (weight gain, hypoglycemia, gastrointestinal distress), inadequate efficacy for use as monotherapy, and the development of tolerance to the agents. Consequently, combination therapies are frequently employed to effectively regulate blood glucose levels. We have focused on the mitochondrial sodium-calcium exchanger (mNCE) as a novel target for diabetes drug discovery. We have proposed that inhibition of the mNCE can be used to regulate calcium flux across the mitochondrial membrane, thereby enhancing mitochondrial oxidative metabolism, which in turn enhances glucose-stimulated insulin secretion (GSIS) in the pancreatic beta-cell. In this paper, we report the facile synthesis of benzothiazepines and derivatives by S-alkylation using 2-aminobenzhydrols. The syntheses of other bicyclic analogues based on benzothiazepine, benzothiazecine, benzodiazecine, and benzodiazepine templates are also described. These compounds have been evaluated for their inhibition of mNCE activity, and the results from the structure-activity relationship (SAR) studies are discussed.

An O(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V,E). The expected running time of our algorithm is Õ(mc) where |E| = m and c is the maximum u-vedge connectivity, where u,v ∈ V. When the input graph is also simple (i.e., it has no parallel edges), then the u-v edge connectivity for each pair of vertices u and v is at most n-1; so the expected running time of our algorithm for simple unweighted graphs is Õ(mn).All the algorithms currently known for constructing a Gomory-Hu tree [8,9] use n-1 minimum s-t cut (i.e., max flow) subroutines. This in conjunction with the current fastest Õ(n20/9) max flow algorithm due to Karger and Levine [11] yields the current best running time of Õ(n20/9n) for Gomory-Hu tree construction on simpleunweighted graphs with m edges and n vertices. Thus we present the first Õ(mn) algorithm for constructing a Gomory-Hu tree for simple unweighted graphs.We do not use a max flow subroutine here; we present an efficient tree packing algorithm for computing Steiner edge connectivity and use this algorithm as our main subroutine. The advantage in using a tree packing algorithm for constructing a Gomory-Hu tree is that the work done in computing a minimum Steiner cut for a Steiner set S ⊆ V can be reused for computing a minimum Steiner cut for certain Steiner sets S' ⊆ S.