273 Hits in 11.4 sec

Distributed scheduling with decomposed optimization criterion: Genetic programming approach [chapter]

Franciszek Seredyński, Jacek Koronacki, Cezary Z. Janikow
1999 Lecture Notes in Computer Science  
A new approach to develop parallel and distributed scheduling algorithms for multiprocessor systems is proposed.  ...  Its main innovation lies in evolving a decomposition of the global optimization criteria. For this purpose a program graph is interpreted as a multi-agent system.  ...  : For each agent-player A k , associated with task k and initially allocated in node n of the multiprocessor system, create an initial subpopulation of size N with its actions.  ... 
doi:10.1007/bfb0097900 fatcat:ynin5li5ordv3bdxh5l6hhsavy

Two Round Scheduling (TRS) Scheme for Linearly Extensible Multiprocessor Systems

Abdus Samad, M. Qasim Rafiq, Omar Farooq
2012 International Journal of Computer Applications  
The scheduling problem is to maintain a balanced execution of all the tasks among the various available processors (nodes) in a multiprocessor network.  ...  Balancing the computational load over multiprocessor networks is an important problem in massively parallel systems.  ...  The number of tasks allocated to each processor has to be controlled in such a way that a high speed execution of processes may occur while maintaining high processor utilization.  ... 
doi:10.5120/4646-6910 fatcat:33zcfojkmzgk7h4v7qkmtbykvm

How network topology affects dynamic loading balancing

P.K.K. Loh, Wen Jing Hsu, Cai Wentong, N. Sriskanthan
1996 IEEE Parallel & Distributed Technology Systems & Applications  
The simulator they 'ue developed lets them measure these performances across a range of network topologies, including a 20 mesh, a 4 0 hypercube, a linear array, and a composite Fibonacci cube. multiprocessor  ...  The network distributes tasks once, before execution, and the allocation stays the same throughout the application's execution.  ...  ACKNO WDGMENTS We thank Chua Chze Koon for her help in developing the simulator and collating the simulation results.  ... 
doi:10.1109/88.532137 fatcat:tvfsxt6k7vgu5flvtnf64qt77i

Issues and Challenges of Load Balancing Algorithm in Cloud Computing Environment

Mahfooz Alam, Zaki Ahmad Khan
2017 Indian Journal of Science and Technology  
Objectives: To enlighten the issues and challenges of Load Balancing Algorithm (LBA) for cloud computing environment. In this study the authors proposed a LBA for cloud computing server.  ...  The use of proposed algorithm is to improve the overhead and load imbalance factor of the system. Application: The Load Balancing (LB) is a vital feature of cloud computing environment.  ...  In ACCLB algorithm, firstly assemble all requirement of cloud processor to allocate task to the appropriate node.  ... 
doi:10.17485/ijst/2017/v10i25/105688 fatcat:rjp4yjwr65h43neihkubzjho3u

Execution of compute-intensive applications into parallel machines

Catherine Houstis, Sarantos Kapidakis, Evangelos P. Markatos, Erol Gelenbe
1997 Information Sciences  
Finally, in the operating system layer, a fair allocation of the processors of the parallel machine is allocated to competing applications.  ...  The approach to scheduling and load balancing ranges from very specialized and directly dependent on the application, in the application layer, to a more general approach taken by the operating system  ...  The compiler and run-time approach to parallel application execution, is a more general approach and it addresses all applications. It takes a di erent p o i n t of view of an application.  ... 
doi:10.1016/s0020-0255(96)00174-0 fatcat:pszidonmirajdpcon4lsmucxxu

On-Line Hard Real-Time Scheduling of Parallel Tasks on Partitionable Multiprocessors

Davender Babbar, Phillip Krueger
1994 1994 International Conference on Parallel Processing (ICPP'94)  
O rder N u m b e r 951 6 9 5 4 O n -lin e h a rd rea l-tim e sch ed u lin g o f p arallel taskB on p a r titio n a b le m u ltip ro cesso rs B ab b a r, D avender, P h.D .  ...  In the unlikely event that the author did not send UMI a complete manuscript and there are missing pages, these will be noted.  ...  N i x x N2... x N d mesh consists o f M processors connected in an n-dimensional ar ray, where a node represents a processor and an edge denotes a communication link.  ... 
doi:10.1109/icpp.1994.140 dblp:conf/icpp/BabbarK94 fatcat:clfxfi6fczgivgd3rybe2er23e

Effective Load Balance Scheduling Schemes for Heterogeneous Distributed System

Zeba Khan, Mahfooz Alam, Raza Abbas Haidri
2017 International Journal of Electrical and Computer Engineering (IJECE)  
Load Balancing is the phenomena of spreading or distributing the workload among the processors so that all processors keep busy for all the time, in order to prevent ideal time of processors.  ...  It is an agreed fact that divides and conquers is the effective strategy for load balancing problems.  ...  Our approach is to reduce the LIF despite that each task has dissimilar execution time. To perform for this work the LIF can be rewritten of equation (1) as = − 1 Since, '1' is a constant factor.  ... 
doi:10.11591/ijece.v7i5.pp2757-2765 fatcat:igjhhxbw55hhhf2punfpe3w6qq

On-Line Dynamic Voltage Scaling for EDZL Scheduling on Symmetric Multiprocessor Real-Time Systems

Xuefeng Piao, Moonju Park
2015 International Journal of Multimedia and Ubiquitous Engineering  
In Section 5, we present a new on-line DVS algorithm based on the deadline re-assignment method.  ...  EDZL (Earliest Deadline Zero Laxity) scheduling is known to be at least as EDF (Earliest Deadline First) in task scheduling on symmetric multiprocessor real-time systems; however, there are few works on  ...  Acknowledgements This work was supported by the Incheon National University Research Grant in 2014.  ... 
doi:10.14257/ijmue.2015.10.7.18 fatcat:2lcq2la7wfhbhcmfup5xhyzmuy

What to Make of Multicore Processors for Reliable Real-Time Systems? [chapter]

Theodore P. Baker
2010 Lecture Notes in Computer Science  
This paper reviews some of what is known about multiprocessor scheduling of task systems with deadlines, including recent advances in the analysis of arbitrary sporadic task systems under fixed-priority  ...  Now that multicore microprocessors have become a commodity, it is natural to think about employing them in all kinds of computing, including high-reliability embedded real-time systems.  ...  For partitioned rm, a utilization bound of (n − 1)(2 1/2 − 1) + (m − n + 1)(2 1/(m−n+1) − 1) for m processors and n tasks was derived in [35] . For large n, this reduces to (m + 1)(2 1/2 − 1).  ... 
doi:10.1007/978-3-642-13550-7_1 fatcat:472cqsnvp5a7fejcnvuhsij27u

Scheduling of Jobs in a Hypercube Processing System

Inder Khosla, Sourav Bhattacharya, Wei-Tek Tsai
1996 Journal of the Operational Research Society  
SHIN (1987) Processor allocation in an n-cube multiprocessor using gray codes. [EEE Trans. on Computers 36, 1396-1407. . G. I. CHEN and T. H.  ...  Given the (busy, free) status of each PE in an n-cube, it is a non- trivial task to find out how many jobs should be migrated and in what fashion so as to minimize the total relocation cost function.  ... 
doi:10.1057/jors.1996.75 fatcat:wsowwscmivbmld6jvcqphoimi4

Data Storing in Multitenant Clouds using Split and Merge Method

Aswini. S, Prasanna. S
2018 International Journal of Trend in Scientific Research and Development  
It is used for achieving a better service provisioning and resource utilization ratio, hence improving the overall  ...  During task assignment, the total work load is regulated to the processors in such a way that a subset of the processors a`re guaranteed to have an individual processor load of at least 55.2%.  ...  A new technique for assigning tasks to processors is developed and the schedulability of the algorithm is analyzed for worst-case performance.  ... 
doi:10.31142/ijtsrd9609 fatcat:bsh6q62q6fd5recwaro47tgfxm

Prelude: A system for portable parallel software [chapter]

William Weihl, Eric Brewer, Adrian Colbrook, Chrysanthos Dellarocas, Wilson Hsieh, Anthony Joseph, Carl Waldspurger, Paul Wang
1992 Lecture Notes in Computer Science  
Efficiently mapping a program onto a machine involves choosing an appropriate grain size for tasks; determining where to place tasks and data; determining when and where to migrate tasks and data; scheduling  ...  The interconnection medium can be either a bus, a direct network such as a k-ary n-cube, or an indirect network such as a butterfly.  ... 
doi:10.1007/3-540-55599-4_147 fatcat:zhzfbixfqfdpbpnmxgs5sxqqle

Heuristics for Dynamic Task Mapping in NoC-based Heterogeneous MPSoCs

Ewerson Carvalho, Ney Calazans, Fernando Moraes
2007 18th IEEE/IFIP International Workshop on Rapid System Prototyping (RSP '07)  
MPSoCs may employ NoCs to integrate multiple programmable processor cores, specialized memories, and other IPs in a scalable way.  ...  Multiprocessor Systems-on-Chip (MPSoCs) is a trend in VLSI design, since they minimize the "design crisis" (gap between silicon technology and actual SoC design capacity) and reduce the time to market.  ...  The task may be, for example, a software task to be executed in an embedded processor, a hardware task to be executed in an embedded FPGA or in a co-processor, or an input/output operation.  ... 
doi:10.1109/rsp.2007.26 dblp:conf/rsp/CarvalhoCM07 fatcat:2zc6kz32kbehtcuhhkrx4pj454

Energy Efficient Scheduling of Real-Time Tasks on Multicore Processors

Euiseong Seo, Jinkyu Jeong, Seonyeong Park, Joonwon Lee
2008 IEEE Transactions on Parallel and Distributed Systems  
These approaches must be modified for multicore processors, however, since normally all the cores in a chip must run at the same performance level.  ...  Multicore processors deliver a higher throughput at lower power consumption than unicore processors. In the near future, they will thus be widely used in mobile real-time systems.  ...  The partitioned state of T on S is denoted P, and the partitioned task set allocated to core C n is denoted as P n .  ... 
doi:10.1109/tpds.2008.104 fatcat:ie6xovjmiffwnp7apt73afarta

Parallel execution of logic programs by load sharing

Zheng Lin
1997 The Journal of Logic Programming  
LIN to a large number of processors being used. A traditional task scheduler relies heavily on shared resources, i.e., shared memory or an interconnection network, to perform its functions.  ...  As the scale of a nmltiprocessor system grows, and the speed of implementing resolution in local processors improves, task scheduling becomes increasingly frequent.  ...  Detecting available tasks at run time and migrating tasks among processors incur overhead.  ... 
doi:10.1016/s0743-1066(96)00014-3 fatcat:u5qsrq33unbwzhr4t5lqlnl4km
« Previous Showing results 1 — 15 out of 273 results