An Implementation of Ray Tracing Algorithm for the Multiprocessor Machines
Aleksandar B. Samardžić, Dušan Starčević, Milan Tuba (2006)
The Yugoslav Journal of Operations Research
Similarity:
Aleksandar B. Samardžić, Dušan Starčević, Milan Tuba (2006)
The Yugoslav Journal of Operations Research
Similarity:
Edmund Burke, Yuri Bykov, James Newall, Sanja Petrović (2003)
The Yugoslav Journal of Operations Research
Similarity:
Jan Sadecki (2002)
International Journal of Applied Mathematics and Computer Science
Similarity:
The present paper discusses real parallel computations. On the basis of a selected group of dynamic programming algorithms, a number of factors affecting the efficiency of parallel computations such as, e.g., the way of distributing tasks, the interconnection structure between particular elements of the parallel system or the way of organizing of interprocessor communication are analyzed. Computations were implemented in the parallel multitransputer SUPER NODE 1000 system using from...
Tijmen P. Collignon, Martin B. Van Gijzen (2010)
International Journal of Applied Mathematics and Computer Science
Similarity:
Efficient iterative solution of large linear systems on grid computers is a complex problem. The induced heterogeneity and volatile nature of the aggregated computational resources present numerous algorithmic challenges. This paper describes a case study regarding iterative solution of large sparse linear systems on grid computers within the software constraints of the grid middleware GridSolve and within the algorithmic constraints of preconditioned Conjugate Gradient (CG) type methods....
Adam Piórkowski, Jan Werewka (2010)
International Journal of Applied Mathematics and Computer Science
Similarity:
The minimization of the total completion time for asynchronous transmission in distributed systems is discussed. Attention is focused on the problem of message scheduling on part of the sender. Messages to be sent form a queue, and the order in which they are to be sent has to be first established. The methods of scheduling messages, which minimize the factor of the total completion time, are presented herein. The message-scheduling problem becomes considerably complicated when the stream...
Thomas Stützle, Sebastian Linke (2002)
Mathware and Soft Computing
Similarity:
A number of extensions of Ant System, the first ant colony optimization (ACO) algorithm, were proposed in the literature. These extensions typically achieve much improved computational results when compared to the original Ant System. However, many design choices of Ant System are left untouched including the fact that solutions are constructed, that real-numbers are used to simulate pheromone trails, and that explicit pheromone evaporation is used. In this article we experimentally...
Liptai, Kálmán, Kusper, Gábor, Radványi, Tibor (2007)
Annales Mathematicae et Informaticae
Similarity:
Jiaqi Zhao, Yousri Mhedheb, Jie Tao, Foued Jrad, Qinghuai Liu, Achim Streit (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Jiaqi Zhao, Yousri Mhedheb, Jie Tao, Foued Jrad, Qinghuai Liu, Achim Streit (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Helena Ramalhinho Lourenço, Daniel Serra (2002)
Mathware and Soft Computing
Similarity:
The Generalized Assignment Problem consists of assigning a set of tasks to a set of agents at minimum cost. Each agent has a limited amount of a single resource and each task must be assigned to one and only one agent, requiring a certain amount of the agent's resource. We present the application of a MAX-MIN Ant System (MMAS) and a greedy randomized adaptive search procedure (GRASP) to the generalized assignment problem based on hybrid approaches. The MMAS heuristic can be seen as an...
Yizi Shang, Guiming Lu, Ling Shang, Guangqian Wang (2011)
Computer Science and Information Systems
Similarity: