LOADING

AN ACO-BASED ALGORITHM FOR HETEROGENEOUS COMPUTING ENVIRONMRNTS USING PRIORITY QUEUES

In parallel and distributed computing environments, task scheduling, where the basic idea is minimizing time loss and maximizing performance, is an absolutely critical component. Scheduling in these environments is NP-hard, so it is important that we continue to search and find the most efficient and effective ways of mapping tasks to processors. One such effective approach is known as Ant Colony Optimization (ACO). This popular optimization technique is inspired by the foraging behavior of ants in their colonies to find the shortest paths between their nests and food sources.

About This Event

Register your interest


by clicking any of the buttons below

Location

1649 Norman Street, Los Angeles,
90011

Email/Phone

hello@eventure.com
8 (800) 807-2437

Follow Us

Contact Us