Approximation Algorithms for Average Stretch Scheduling

We study the basic problem of preemptive scheduling of a stream of jobs on a single processor. Consider an on-line stream of jobs, and let the ith job arrive at time r(i) and have processing time p(i). If C(i) is the completion time of job i, then the flow time of i is C(i) − r(i) and the stretch of i is the ratio of its flow time to its processing time; that is, . Flow time measures the time that a job is in the system regardless of the service it requests; the stretch measure relies on the intuition that a job that requires a long service time must be prepared to wait longer than jobs that require small service times. We present the improved algorithmic results for the average stretch metric in preemptive uniprocessor scheduling. Our first result is an off-line polynomial-time approximation scheme (PTAS) for average stretch scheduling. This improves upon the 2-approximation achieved by the on-line algorithm srpt that always schedules a job with the shortest remaining processing time. In a recent work, Chekuri and Khanna (Proc. 34th Ann. Symp. Theory Comput., 297–305, 2002) have presented approximation algorithms for weighted flow time, which is a more general metric than average stretch; their result also yields a PTAS for average stretch. Our second set of results considers the impact of incomplete knowledge of job sizes on the performance of on-line scheduling algorithms. We show that a constant-factor competitive ratio for average stretch is achievable even if the processing times (or remaining processing times) of jobs are known only to within a constant factor of accuracy.     

A survey of checkpointing algorithms for parallel and distributed computers

Checkpoint is defined as a designated place in a program at which normal processing is interrupted specifically to preserve the status information necessary to allow resumption of processing at a later time.Checkpointing is the process of saving the status information. This paper surveys the algorithms which have been reported in the literature for checkpointing parallel/distributed systems. It has been observed that most of the algorithms published for checkpointing in message passing systems are based on the seminal article by Chandy and Lamport. A large number of articles have been published in this area by relaxing the assumptions made in this paper and by extending it to minimise the overheads of coordination and context saving. Checkpointing for shared memory systems primarily extend cache coherence protocols to maintain a consistent memory. All of them assume that the main memory is safe for storing the context. Recently algorithms have been published for distributed shared memory systems, which extend the cache coherence protocols used in shared memory systems. They however also include methods for storing the status of distributed memory in stable storage. Most of the algorithms assume that there is no knowledge about the programs being executed. It is however felt that in development of parallel programs the user has to do a fair amount of work in distributing tasks and this information can be effectively used to simplify checkpointing and rollback recovery.     

Time-Constrained Scheduling of Weighted Packets on Trees and Meshes

Abstract. The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in traditional packet routing problems) as well as a release time and a deadline. The objective is to schedule the maximum number of packets subject to deadline constraints. This problem is studied in [1], where it is shown that the problem is NP-Complete even when the underlying topology is a linear array. Approximation algorithms are also provided in [1] for the linear array and the unidirectional ring for both the case where packets may be buffered in transit and the case where they may not be. In this paper we extend the results of [1] in two directions. First, we consider the more general network topologies of trees and two-dimensional meshes. Second, we associate with each packet a measure of utility, called a weight, and study the problem of maximizing the total weight of the packets that are scheduled subject to their timing constraints. For the bufferless case, we provide constant factor approximation algorithms for the time-constrained scheduling problem with weighted packets on trees and meshes. We also provide logarithmic approximations for the same problems in the buffered case. These results are complemented by new lower bounds, which demonstrate that we cannot hope to achieve the same results for general network topologies. For example, we show that if k packets are required to follow prescribed paths in an arbitrary graph, then unless NP = ZPP, there is no polynomial-time k ^1-ε -approximation, for any ε > 0 , to the optimal set of packets that can be scheduled.     

Experimental investigations on the fatigue behaviour of cold-worked deformed bars

The importance of fatigue of reinforcing steel in reinforced concrete structural members is discussed. The mechanism of fatigue failure of reinforcing bars and the factors affecting it are explained. The details of an experimental investigation for the determination of the fatigue characteristics of cold-worked deformed bars embedded in concrete beams are described. The results of the fatigue tests are discussed and recommendations for design are given.     

Induction of apoptotic nuclei by interferon-gamma and by predesquamin in cultured keratinocytes

Predesquamin is a glycoprotein found in the transition layer and the lower stratum corneum of human epidermis. Interferon-gamma (IFN-gamma) induces the synthesis of predesquamin by keratinocytes in culture. We now show ultrastructurally that exogenous addition of either predesquamin or IFN-gamma to cultured keratinocytes induces apoptotic nuclei with condensed chromatin. Degradation of cellular DNA is also evident as a ladder pattern in an agarose gel. After incubation with both predesquamin and IFN-gamma (but not either alone), the mobility of plasmid DNA in a gel shows retardation specific for guanine residues. This binding to the DNA may impart to it a conformational change that facilitates access by endogenous cellular nucleases. In epidermal cells cultured with IFN-gamma supplementation, we also show by RT-PCR that there is an upregulation of the genes c-myc, p53, gadd45, dsRNA-activated protein kinase, and 2'-5'-oligo(A)-dependent RNase, which have all been implicated in apoptosis in other cell types. These results are pertinent to the mechanism of occurrence of apoptosis in the epidermis in vivo, where predesquamin and IFN-gamma are endogenous. Programmed cell death is an inherent step in the terminal differentiation and desquamation of the epidermis.     

Validation of Decision Tables Used in Process Control

Process control rules may be specified using decision tables. Such a specification is superior when logical decisions to be taken in control dominate. In this paper we give a method of detecting redundancies, incompleteness, and contradictions in such specifications. Using such a technique thus ensures the validity of the specifications.     

Role of glutathione modulation in acrylonitrile-induced gastric DNA damage in rats

Acrylonitrile (VCN) or its reactive metabolites irreversibly interact with gastric DNA in vivo and cause DNA damage. The effect of glutathione (GSH) modulation on VCN-induced genotoxicity and unscheduled DNA repair synthesis (UDRS) in DNA of gastric mucosal tissues was investigated. VCN-induced UDRS was determined: in control rats, rats with depleted gastric GSH contents, and rats treated with sulfhydryl compounds. A single oral dose (23 mg/kg) of VCN induced a time- and dose-dependent increase in gastric UDRS and decrease in GSH levels. While maximal UDRS in gastric mucosa was observed 2 h following oral administration of 23 mg/kg VCN, maximal GSH depletion (50% of control) was detected 4 h following treatment. Increasing the VCN dose to 46 mg/kg caused a further decrease in gastric GSH level (27% of control), while UDRS was elevated. Inhibition of VCN oxidation by treatment of the animals with the cytochrome P450 inhibitor, SKF 525-A, prior to VCN administration caused 65% reduction in VCN-induced UDRS. Treatment of rats with the GSH depletor diethylmaleate (DEM) prior to VCN administration caused 167% increase in UDRS in gastric mucosal tissues. Treatment of the animals with the sulfhydryl compounds, cysteine and penicillamine, prior to VCN administration protected against VCN-induced UDRS. The results demonstrated an inverse and highly significant correlation between gastric GSH levels and VCN-induced UDRS (r = -0.873, P < 0.0001). In conclusion, our study indicates that VCN bioactivation and the homeostasis of gastric GSH may play a major, role in the initial processes underlying VCN-induced gastric carcinogenesis.     

Integrative process plan model and representation for intelligent distributed manufacturing planning

Process planning is one of the key functions for product design and manufacturing. Process plans have very great impact on all phases of product design and manufacture. Therefore, it is necessary to establish a high level of interaction between different product design activities and their tight integration into a coherent system. In this paper we describe a process plan model that allows for such integration. The framework for integration is briefly described and the process plan model that considers three dimensions of planning is explained. The manufacturing process plan model is defined as a three-dimensional model with the following dimensions: time/order, variability/alternatives, and aggregation. All three dimensions are defined and explained as they relate to overall manufacturing planning. The nature of these dimensions is illustrated with several examples. The implementation of the framework and the model within the distributed system IMPlanner is presented. The prototype has been implemented in the Java language and the model for data storage has been implemented in XML. The benefits of integrated consideration are described for several currently implemented applications such as feature modelling, process visualization, process network generation, cell formation, and scheduling.     

Performance of IEEE 802.11 under Jamming

We study the performance of the IEEE 802.11 MAC protocol under a range of jammers that covers both channel-oblivious and channel-aware jamming. We consider two channel-oblivious jammers: a periodic jammer that jams deterministically at a specified rate, and a memoryless jammer whose interfering signals arrive according to a Poisson process. We also develop new models for channel-aware jamming, including a reactive jammer that only jams non-colliding transmissions and an omniscient jammer that optimally adjusts its strategy according to current states of the participating nodes. Our study comprises of a theoretical analysis of the saturation throughput of 802.11 under jamming, an extensive simulation study, and a testbed to conduct real world experimentation of jamming IEEE 802.11 using a software defined radio (GNU Radio combined with USRP boards). In our theoretical analysis, we use a discrete-time Markov chain analysis to derive formula for the saturation throughput of 802.11 under memoryless, reactive and omniscient jamming. One of our key results is a characterization of optimal omniscient jamming that establishes a lower bound on the saturation throughput of 802.11 under arbitrary jammer attacks. We validate the theoretical analysis by means of Qualnet simulations. Finally, we measure the real-world performance of periodic, memoryless and reactive jammers using our GNURadio/ USRP aided experimentation testbed.