• Nenhum resultado encontrado

[PDF] Top 20 An Efficient Scheduling Algorithm for Irregular Data Redistribution

Has 10000 "An Efficient Scheduling Algorithm for Irregular Data Redistribution" found on our website. Below are the top 20 most common "An Efficient Scheduling Algorithm for Irregular Data Redistribution".

An Efficient Scheduling Algorithm for Irregular Data Redistribution

An Efficient Scheduling Algorithm for Irregular Data Redistribution

... Dynamic data redistribution is used to enhance the performance of an algorithm and to achieve data locality in parallel programs on distributed memory ...The data ... See full document

6

TAAG: An Efficient Task Allocation Algorithm for Grid Environment

TAAG: An Efficient Task Allocation Algorithm for Grid Environment

... a scheduling algorithm arises from the requirement for most modern systems to perform ...multiplexing. Scheduling in a grid is not considered as a single problem, instead a family of problems, with ... See full document

9

A Comparison of Efficient Algorithms for Scheduling Parallel Data Redistribution

A Comparison of Efficient Algorithms for Scheduling Parallel Data Redistribution

... The optimal solution can be found in polynomial time if the setup cost is zero and in the case we are only interested in minimizing the number of preemptions [8]. Finally, in [1] can be found a polynomial time ... See full document

9

AN EFFICIENT FAULT TOLERANT SCHEDULING APPROACH FOR COMPUTATIONAL GRID

AN EFFICIENT FAULT TOLERANT SCHEDULING APPROACH FOR COMPUTATIONAL GRID

... Min-Min algorithm. The addition of transmission time in scheduling criteria enables the sight over the transmission cost of data’s or packets where the actual grid resources being distributed in ...the ... See full document

6

Abstract: This work presents an algorithm for solving exactly a scheduling problem with identical

Abstract: This work presents an algorithm for solving exactly a scheduling problem with identical

... presents an algorithm for solving exactly a scheduling problem with identical parallel machines and malleable tasks, subject to arbitrary release dates and due ...present an integer ... See full document

6

Bandwidth-Adaptive Scheduling for Quality of Service Enhancement of Real-Time Multimedia Applications in Network Processor Based Router

Bandwidth-Adaptive Scheduling for Quality of Service Enhancement of Real-Time Multimedia Applications in Network Processor Based Router

... of an integrated network processor IXP2400 shown in ...through an on-chip scratchpad memory or via 128 special purpose next neighbor ...registers. Data transferring across the MEs and locations ... See full document

7

Comput. Appl. Math.  vol.31 número2

Comput. Appl. Math. vol.31 número2

... into an equivalent constrained global optimization ...Finally, an algorithm based on the proposed filled function for solving nonlinear systems of equalities and inequalities is ...function ... See full document

15

Multiprocessor Scheduling Using Parallel Genetic Algorithm

Multiprocessor Scheduling Using Parallel Genetic Algorithm

... A master is the main processor store the full population of chromosomes and assigns a certain fraction of the individuals to slave processors, where the slaves evaluate fitness value for the assigned fraction and return ... See full document

5

An efficient algorithm for some highly nonlinear fractional PDEs in mathematical physics.

An efficient algorithm for some highly nonlinear fractional PDEs in mathematical physics.

... proposed algorithm is highly efficient and appropriate for fractional PDEs and hence can be extended to other complex problems of diversified nonlinear ... See full document

17

No-wait Flowshop Scheduling Using Genetic Algorithm

No-wait Flowshop Scheduling Using Genetic Algorithm

... In this paper, we considered the problem of scheduling jobs in a no-wait flowshop. The problem is known to be NP-hard. A spreadsheet based general purpose GA solution methodology was presented. The spreadsheet GA ... See full document

4

Project Scheduling problem using metaheuristic algorithm

Project Scheduling problem using metaheuristic algorithm

... each other. SGS method is split to two methods itself. They are named serial SGS and parallel SGS. Next, we'll explain both[23].In most scientific studies to solve resources attribution question which have used ... See full document

11

An Efficient Prediction of Breast Cancer Data using Data Mining Techniques

An Efficient Prediction of Breast Cancer Data using Data Mining Techniques

... is an important, real-world medical problem. Thus, finding an accurate and effective diagnosis method is very ...Cancer data can be useful to predict the outcome of some diseases or discover the ... See full document

6

An Efficient Parallel Algorithm for Longest Common Subsequence Problem on GPUs

An Efficient Parallel Algorithm for Longest Common Subsequence Problem on GPUs

... is an important problem in computational biology and finding the longest common subsequence (LCS) of multiple bi- ological sequences is an essential and effective tech- nique in sequence ...develop ... See full document

6

Flow shop scheduling using genetic algorithm

Flow shop scheduling using genetic algorithm

... ,QWKHSUHVHQWVWXG\*$LVDSSOLHGWRVROYHWKHIORZVKRSVFKHGXOLQJSUREOHP'LIIHUHQWVL]HVRISUREOHPV DUHFRQVLGHUHGIRUDQDO\VLV,QLPSOHPHQWLQJ*$VLQJOHSRLQWFURVVRYHUWZRSRLQWFURVVRYHUVKLIWPXWDWLRQDQG UDQG[r] ... See full document

9

Imaging Method: An Efficient Algorithm for Moving Target Tracking by UWB Radar

Imaging Method: An Efficient Algorithm for Moving Target Tracking by UWB Radar

... radar data pre-processing, background subtraction, the fusion of the data obtained by the particular receiving channels of a radar, detection, localization and the tracking ...then an overview of the ... See full document

20

An Ant-based approach to Power-Efficient Algorithm for Wireless Sensor Networks

An Ant-based approach to Power-Efficient Algorithm for Wireless Sensor Networks

... We assume the bandwidth B of each link is divided into two parts for bidirectional communications, and the links are constructed according to the Drop-Tail model (a finite FIFO queue). After source nodes produce a ... See full document

5

Optimum Efficient Mobility Management Scheme for IPv6

Optimum Efficient Mobility Management Scheme for IPv6

... propose an Optimum Efficient Mobility Management (OEMM) scheme in which Firstly; we employ an algorithm to evaluate the performance of MIPv6 and HMIPv6 against some key parameters using ... See full document

10

AN EFFICIENT INITIALIZATION METHOD FOR K-MEANS CLUSTERING OF HYPERSPECTRAL DATA

AN EFFICIENT INITIALIZATION METHOD FOR K-MEANS CLUSTERING OF HYPERSPECTRAL DATA

... K-means clustering (MacQueen, 1967) is a method commonly used to automatically partition a dataset into K groups. It proceeds by selecting K initial cluster centers and then iteratively refining them as follows. 1) ... See full document

5

A new fuzzy algorithm for ecological ranking

A new fuzzy algorithm for ecological ranking

... Ecological ranking is a prerequisite to many kinds of environmental decisions. It requires a set of “objects” (e.g., competing sites for species reintroduction, or competing alternatives of environmental management) to ... See full document

3

Efficient FM Algorithm for VLSI Circuit Partitioning

Efficient FM Algorithm for VLSI Circuit Partitioning

... FM algorithm initial partitioning matrix of the given circuit is assigned randomly, as a result for larger circuit having hundred or more nodes will take long time to arrive at the final partition if the initial ... See full document

5

Show all 10000 documents...