-
Lecture Notes in Engineering and Computer Science. 01/2010;
-
[show abstract]
[hide abstract]
ABSTRACT: Abstract—In scheduling, the main factor that affects searchingspeed and mapping performance is the number of resources orthe size of search space. In grid computing, the schedulerperformance plays an essential role in the overall performance.So, it is obvious the need for scalable scheduler that can managethe growing in resources (i.e. scalable). With the assumption thateach resource has its own specifications and each job has its ownrequirements; then searching the whole search space (all theresources) can waste plenty of scheduling time. In this paper, wepropose a two-phase scheduler that uses min-min algorithm tospeed up the mapping time with almost the same efficiency. Thescheduler is also based on the assumption that the resources ingrid computing can be classified into clusters. The scheduler triesfirst to schedule the jobs to the suitable cluster (i.e. first phase)and then each cluster schedule the incoming jobs to the suitableresources (i.e. second phase). The scheduler is based onmultidimensional QoS to enhance the mapping as much as it can.The simulation results show that the use of two-phase strategycan support the scalable scheduler.
International Journal of Advanced Computer Sciences and Applications. 01/2010;
-
[show abstract]
[hide abstract]
ABSTRACT: Problem statement: In order to facilitate XML query processing, labeling schemes are used to determine the structural relationships between XML nodes. However, labeling schemes have to reliable the existing nodes or recalculate the label values when a new node is inserted into the XML document during XML update process. EXEL as a labeling scheme is able to remove relabeling for existing nodes during XML update process. Also, it is able to compute the structural relationship between nodes effectively. However, for the case of skewed insertions where nodes are always inserted at a fixed place, the label size of EXEL scheme increases very fast. Approach: This study discussed how to control the increment of label size for the EXEL scheme. In addition, EXEL does not consider the process of deleting labels. We also study how to reuse the deleted labels for future label insertions. Results: We proposed an algorithm which is able to control the label size increment. Conclusion: It required less storage size to store the inserted binary bit string and thus can improve query performance.
Journal of Computer Science. 01/2010;
-
[show abstract]
[hide abstract]
ABSTRACT: Problem statement: In this study, a general plan of hybrid architecture for quantum algorithms is proposed. Approach: Analysis of the quantum algorithms shows that these algorithms were hybrid with two parts. First, the relationship of classical and quantum parts of the hybrid algorithms was extracted. Then a general plan of hybrid structure was designed. Results: This plan was illustrated the hybrid architecture and the relationship of classical and quantum parts of the algorithms. This general plan was used to increase implementation performance of quantum algorithms. Conclusion/Recommendations: Moreover, simulation results of quantum algorithms on the hybrid architecture proved that quantum algorithms can be implemented on the general plan as well.
Journal of Computer Science. 01/2009;
-
[show abstract]
[hide abstract]
ABSTRACT: Replication is a well known technique to improve reliability and performance for a Data Grid. Keeping consistent content at all distributed replica is an important subject in Data Grid. Replicaconsistency protocol using classical propagation method called the radial method suffers from high overhead at the master replica site, while line method suffers from high delay time. In Data Grid not allreplicas can be dealt with in the same way, since some will be in greater demand than others. Updating first replica having most demand, a greater number of clients would access the updated content in a shorter period of time. In this study, based on asynchronous aggressive update propagation technique, a scalable replica consistency protocol is developed to maintain replica consistency in data grid which aimed to reaching delay reduction and load balancing, such that the high access weight replicas updated faster than the others. The simulation results shows that the proposed protocol is capable of sending the updates to high access replicas in a short period while reducing the total update propagation repose time and reached load balancing.
Journal of Computer Science. 01/2008;
