Abstract: Parallel Prefix addition is a technique for improving
the speed of binary addition. Due to continuing integrating intensity
and the growing needs of portable devices, low-power and highperformance
designs are of prime importance. The classical parallel
prefix adder structures presented in the literature over the years
optimize for logic depth, area, fan-out and interconnect count of logic
circuits. In this paper, a new architecture for performing 8-bit, 16-bit
and 32-bit Parallel Prefix addition is proposed. The proposed prefix
adder structures is compared with several classical adders of same
bit width in terms of power, delay and number of computational
nodes. The results reveal that the proposed structures have the least
power delay product when compared with its peer existing Prefix
adder structures. Tanner EDA tool was used for simulating the adder
designs in the TSMC 180 nm and TSMC 130 nm technologies.
Abstract: The shortest path question is in a graph theory model
question, and it is applied in many fields. The most short-path
question may divide into two kinds: Single sources most short-path,
all apexes to most short-path. This article mainly introduces the
problem of all apexes to most short-path, and gives a new parallel
algorithm of all apexes to most short-path according to the Dijkstra
algorithm. At last this paper realizes the parallel algorithms in the
technology of C # multithreading.
Abstract: In this paper, a new hybrid of genetic algorithm (GA)
and simulated annealing (SA), referred to as GSA, is presented. In
this algorithm, SA is incorporated into GA to escape from local
optima. The concept of hierarchical parallel GA is employed to
parallelize GSA for the optimization of multimodal functions. In
addition, multi-niche crowding is used to maintain the diversity in
the population of the parallel GSA (PGSA). The performance of the
proposed algorithms is evaluated against a standard set of multimodal
benchmark functions. The multi-niche crowding PGSA and normal
PGSA show some remarkable improvement in comparison with the
conventional parallel genetic algorithm and the breeder genetic
algorithm (BGA).
Abstract: The speculative locking (SL) protocol extends the twophase locking (2PL) protocol to allow for parallelism among conflicting transactions. The adaptive speculative locking (ASL) protocol provided further enhancements and outperformed SL protocols under most conditions. Neither of these protocols consider the impact of network latency on the performance of the distributed database systems. We have studied the performance of ASL protocol taking into account the communication overhead. The results indicate that though system load can counter network latency, it can still become a bottleneck in many situations. The impact of latency on performance depends on many factors including the system resources. A flexible discrete event simulator was used as the testbed for this study.
Abstract: Coagulation of water involves the use of coagulating
agents to bring the suspended matter in the raw water together for
settling and the filtration stage. Present study is aimed to examine the
effects of aluminum sulfate as coagulant in conjunction with Moringa
Oleifera Coagulant Protein as coagulant aid on turbidity, hardness,
and bacteria in turbid water. A conventional jar test apparatus was
employed for the tests. The best removal was observed at a pH of 7
to 7.5 for all turbidities. Turbidity removal efficiency was resulted
between % 80 to % 99 by Moringa Oleifera Coagulant Protein as
coagulant aid. Dosage of coagulant and coagulant aid decreased with
increasing turbidity. In addition, Moringa Oleifera Coagulant Protein
significantly has reduced the required dosage of primary coagulant.
Residual Al+3 in treated water were less than 0.2 mg/l and meets the
environmental protection agency guidelines. The results showed that
turbidity reduction of % 85.9- % 98 paralleled by a primary
Escherichia coli reduction of 1-3 log units (99.2 – 99.97%) was
obtained within the first 1 to 2 h of treatment. In conclusions,
Moringa Oleifera Coagulant Protein as coagulant aid can be used for
drinking water treatment without the risk of organic or nutrient
release. We demonstrated that optimal design method is an efficient
approach for optimization of coagulation-flocculation process and
appropriate for raw water treatment.
Abstract: Mobile agent has motivated the creation of a new
methodology for parallel computing. We introduce a methodology
for the creation of parallel applications on the network. The proposed
Mobile-Agent parallel processing framework uses multiple Javamobile
Agents. Each mobile agent can travel to the specified
machine in the network to perform its tasks. We also introduce the
concept of master agent, which is Java object capable of
implementing a particular task of the target application. Master agent
is dynamically assigns the task to mobile agents. We have developed
and tested a prototype application: Mobile Agent Based Parallel
Computing. Boosted by the inherited benefits of using Java and
Mobile Agents, our proposed methodology breaks the barriers
between the environments, and could potentially exploit in a parallel
manner all the available computational resources on the network.
This paper elaborates performance issues of a mobile agent for
parallel computing.
Abstract: Due to the increasing and varying risks that economic units face with, derivative instruments gain substantial importance, and trading volumes of derivatives have reached very significant level. Parallel with these high trading volumes, researchers have developed many different models. Some are parametric, some are nonparametric. In this study, the aim is to analyse the success of artificial neural network in pricing of options with S&P 100 index options data. Generally, the previous studies cover the data of European type call options. This study includes not only European call option but also American call and put options and European put options. Three data sets are used to perform three different ANN models. One only includes data that are directly observed from the economic environment, i.e. strike price, spot price, interest rate, maturity, type of the contract. The others include an extra input that is not an observable data but a parameter, i.e. volatility. With these detail data, the performance of ANN in put/call dimension, American/European dimension, moneyness dimension is analyzed and whether the contribution of the volatility in neural network analysis make improvement in prediction performance or not is examined. The most striking results revealed by the study is that ANN shows better performance when pricing call options compared to put options; and the use of volatility parameter as an input does not improve the performance.
Abstract: One of the criteria in production scheduling is Make
Span, minimizing this criteria causes more efficiently use of the
resources specially machinery and manpower. By assigning some
budget to some of the operations the operation time of these activities
reduces and affects the total completion time of all the operations
(Make Span). In this paper this issue is practiced in parallel flow
shops. At first we convert parallel flow shop to a network model and
by using a linear programming approach it is identified in order to
minimize make span (the completion time of the network) which
activities (operations) are better to absorb the predetermined and
limited budget. Minimizing the total completion time of all the
activities in the network is equivalent to minimizing make span in
production scheduling.
Abstract: A satured liquid is warmed until boiling in a parallelepipedic boiler. The heat is supplied in a liquid through the horizontal bottom of the boiler, the other walls being adiabatic. During the process of boiling, the liquid evaporates through its free surface by deforming it. This surface which subdivides the boiler into two regions occupied on both sides by the boiled liquid (broth) and its vapor which surmounts it. The broth occupying the region and its vapor the superior region. A two- fluids model is used to describe the dynamics of the broth, its vapor and their interface. In this model, the broth is treated as a monophasic fluid (homogeneous model) and form with its vapor adiphasic pseudo fluid (two-fluid model). Furthermore, the interface is treated as a zone of mixture characterized by superficial void fraction noted α* . The aim of this article is to describe the dynamics of the interface between the boiled fluid and its vapor within a boiler. The resolution of the problem allowed us to show the evolution of the broth and the level of the liquid.
Abstract: Influence of octane and benzene on plant cell
ultrastructure and enzymes of basic metabolism, such as nitrogen
assimilation and energy generation have been studied. Different
plants: perennial ryegrass (Lolium perenne) and alfalfa (Medicago
sativa); crops- maize (Zea mays L.) and bean (Phaseolus vulgaris);
shrubs – privet (Ligustrum sempervirens) and trifoliate orange
(Poncirus trifoliate); trees - poplar (Populus deltoides) and white
mulberry (Morus alba L.) were exposed to hydrocarbons of different
concentrations (1, 10 and 100 mM). Destructive changes in bean and
maize leaves cells ultrastructure under the influence of benzene
vapour were revealed at the level of photosynthetic and energy
generation subcellular organells. Different deviations at the level of
subcellular organelles structure and distribution were observed in
alfalfa and ryegrass root cells under the influence of benzene and
octane, absorbed through roots. The level of destructive changes is
concentration dependent. Benzene at low 1 and 10 mM concentration
caused the increase in glutamate dehydrogenase (GDH) activity in
maize roots and leaves and in poplar and mulberry shoots, though to
higher extent in case of lower, 1mM concentration. The induction
was more intensive in plant roots. The highest tested 100mM
concentration of benzene was inhibitory to the enzyme in all plants.
Octane caused induction of GDH in all grassy plants at all tested
concentrations; however the rate of induction decreased parallel to
increase of the hydrocarbon concentration. Octane at concentration 1
mM caused induction of GDH in privet, trifoliate and white mulberry
shoots. The highest, 100mM octane was characterized by inhibitory
effect to GDH activity in all plants. Octane had inductive effect on
malate dehydrogenase in almost all plants and tested concentrations,
indicating the intensification of Trycarboxylic Acid Cycle.
The data could be suggested for elaboration of criteria for plant
selection for phytoremediation of oil hydrocarbons contaminated
soils.
Abstract: The evaluation of residual reliability of large sized
parallel computer interconnection systems is not practicable with
the existing methods. Under such conditions, one must go for
approximation techniques which provide the upper bound and lower
bound on this reliability. In this context, a new approximation method
for providing bounds on residual reliability is proposed here. The
proposed method is well supported by two algorithms for simulation
purpose. The bounds on residual reliability of three different categories
of interconnection topologies are efficiently found by using
the proposed method
Abstract: Migration in breast cancer cell wound healing assay
had been studied using image fractal dimension analysis. The
migration of MDA-MB-231 cells (highly motile) in a wound healing
assay was captured using time-lapse phase contrast video microscopy
and compared to MDA-MB-468 cell migration (moderately motile).
The Higuchi fractal method was used to compute the fractal
dimension of the image intensity fluctuation along a single pixel
width region parallel to the wound. The near-wound region fractal
dimension was found to decrease three times faster in the MDA-MB-
231 cells initially as compared to the less cancerous MDA-MB-468
cells. The inner region fractal dimension was found to be fairly
constant for both cell types in time and suggests a wound influence
range of about 15 cell layer. The box-counting fractal dimension
method was also used to study region of interest (ROI). The MDAMB-
468 ROI area fractal dimension was found to decrease
continuously up to 7 hours. The MDA-MB-231 ROI area fractal
dimension was found to increase and is consistent with the behavior
of a HGF-treated MDA-MB-231 wound healing assay posted in the
public domain. A fractal dimension based capacity index has been
formulated to quantify the invasiveness of the MDA-MB-231 cells in
the perpendicular-to-wound direction. Our results suggest that image
intensity fluctuation fractal dimension analysis can be used as a tool
to quantify cell migration in terms of cancer severity and treatment
responses.
Abstract: Scheduling of diversified service requests in
distributed computing is a critical design issue. Cloud is a type of
parallel and distributed system consisting of a collection of
interconnected and virtual computers. It is not only the clusters and
grid but also it comprises of next generation data centers. The paper
proposes an initial heuristic algorithm to apply modified ant colony
optimization approach for the diversified service allocation and
scheduling mechanism in cloud paradigm. The proposed optimization
method is aimed to minimize the scheduling throughput to service all
the diversified requests according to the different resource allocator
available under cloud computing environment.
Abstract: Decrease in hardware costs and advances in computer
networking technologies have led to increased interest in the use of
large-scale parallel and distributed computing systems. One of the
biggest issues in such systems is the development of effective
techniques/algorithms for the distribution of the processes/load of a
parallel program on multiple hosts to achieve goal(s) such as
minimizing execution time, minimizing communication delays,
maximizing resource utilization and maximizing throughput.
Substantive research using queuing analysis and assuming job
arrivals following a Poisson pattern, have shown that in a multi-host
system the probability of one of the hosts being idle while other host
has multiple jobs queued up can be very high. Such imbalances in
system load suggest that performance can be improved by either
transferring jobs from the currently heavily loaded hosts to the lightly
loaded ones or distributing load evenly/fairly among the hosts .The
algorithms known as load balancing algorithms, helps to achieve the
above said goal(s). These algorithms come into two basic categories -
static and dynamic. Whereas static load balancing algorithms (SLB)
take decisions regarding assignment of tasks to processors based on
the average estimated values of process execution times and
communication delays at compile time, Dynamic load balancing
algorithms (DLB) are adaptive to changing situations and take
decisions at run time.
The objective of this paper work is to identify qualitative
parameters for the comparison of above said algorithms. In future this
work can be extended to develop an experimental environment to
study these Load balancing algorithms based on comparative
parameters quantitatively.
Abstract: The simple methods used to plan and measure non
patterned production system are developed from the basic definition
of working efficiency. Processing time is assigned as the variable
and used to write the equation of production efficiency.
Consequently, such equation is extensively used to develop the
planning method for production of interest using one-dimensional
stock cutting problem. The application of the developed method
shows that production efficiency and production planning can be
determined effectively.
Abstract: Sorting appears the most attention among all computational tasks over the past years because sorted data is at the heart of many computations. Sorting is of additional importance to parallel computing because of its close relation to the task of routing data among processes, which is an essential part of many parallel algorithms. Many parallel sorting algorithms have been investigated for a variety of parallel computer architectures. In this paper, three parallel sorting algorithms have been implemented and compared in terms of their overall execution time. The algorithms implemented are the odd-even transposition sort, parallel merge sort and parallel rank sort. Cluster of Workstations or Windows Compute Cluster has been used to compare the algorithms implemented. The C# programming language is used to develop the sorting algorithms. The MPI (Message Passing Interface) library has been selected to establish the communication and synchronization between processors. The time complexity for each parallel sorting algorithm will also be mentioned and analyzed.
Abstract: The spectral action balance equation is an equation that
used to simulate short-crested wind-generated waves in shallow water
areas such as coastal regions and inland waters. This equation consists
of two spatial dimensions, wave direction, and wave frequency which
can be solved by finite difference method. When this equation with
dominating propagation velocity terms are discretized using central
differences, stability problems occur when the grid spacing is chosen
too coarse. In this paper, we introduce the splitting modified donorcell
scheme for avoiding stability problems and prove that it is
consistent to the modified donor-cell scheme with same accuracy. The
splitting modified donor-cell scheme was adopted to split the wave
spectral action balance equation into four one-dimensional problems,
which for each small problem obtains the independently tridiagonal
linear systems. For each smaller system can be solved by direct or
iterative methods at the same time which is very fast when performed
by a multi-cores computer.
Abstract: To successfully provide a fast FIR filter with FTT algorithms, overlapped-save algorithms can be used to lower the computational complexity and achieve the desired real-time processing. As the length of the input block increases in order to improve the efficiency, a larger volume of zero padding will greatly increase the computation length of the FFT. In this paper, we use the overlapped block digital filtering to construct a parallel structure. As long as the down-sampling (or up-sampling) factor is an exact multiple lengths of the impulse response of a FIR filter, we can process the input block by using a parallel structure and thus achieve a low-complex fast FIR filter with overlapped-save algorithms. With a long filter length, the performance and the throughput of the digital filtering system will also be greatly enhanced.
Abstract: In this paper, a new reverse converter for the moduli set {2n, 2n–1, 2n–1–1} is presented. We improved a previously introduced conversion algorithm for deriving an efficient hardware design for reverse converter. Hardware architecture of the proposed converter is based on carry-save adders and regular binary adders, without the requirement for modular adders. The presented design is faster than the latest introduced reverse converter for moduli set {2n, 2n–1, 2n–1–1}. Also, it has better performance than the reverse converters for the recently introduced moduli set {2n+1–1, 2n, 2n–1}
Abstract: An efficient parallel form in digital signal processor can improve the algorithm performance. The butterfly structure is an important role in fast Fourier transform (FFT), because its symmetry form is suitable for hardware implementation. Although it can perform a symmetric structure, the performance will be reduced under the data-dependent flow characteristic. Even though recent research which call as novel memory reference reduction methods (NMRRM) for FFT focus on reduce memory reference in twiddle factor, the data-dependent property still exists. In this paper, we propose a parallel-computing approach for FFT implementation on digital signal processor (DSP) which is based on data-independent property and still hold the property of low-memory reference. The proposed method combines final two steps in NMRRM FFT to perform a novel data-independent structure, besides it is very suitable for multi-operation-unit digital signal processor and dual-core system. We have applied the proposed method of radix-2 FFT algorithm in low memory reference on TI TMSC320C64x DSP. Experimental results show the method can reduce 33.8% clock cycles comparing with the NMRRM FFT implementation and keep the low-memory reference property.