Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Munenori Kai"'
Autor:
Munenori Kai, Jumpei Kono
Publikováno v:
PACRIM
Task scheduling is one of the methods to minimize the processing time of a program in parallel processing. However, because task scheduling problems belong to strongly NP-hard combinatorial optimization problems [1], it is hard to find an optimal sol
Autor:
Munenori Kai, Taiga Tamura
Publikováno v:
PACRIM
Task scheduling is one of the optimization methods for parallel processing of programs. Task scheduling is intended to minimize execution time by allocating processing unit called task to appropriate computational resources. This method is considered
Autor:
Motoki Hasegawa, Munenori Kai
Publikováno v:
PACRIM
One of the key methods for the optimization of parallel processing in a program is task scheduling. This intends to minimize implementation time for the entire program by determining schedule for optimally allocating tasks, which are processing units
Publikováno v:
physica status solidi c. 6:1317-1320
The electronic states of manganese and lanthanide elements in SrGa 2 S 4 are calculated by the relativistic discrete variational Xα method using a FORTRAN program of DVSCATR in order to investigate the mechanism allowing the, 3d-3d transition of Mn
Autor:
Shibuya Tomonori, Munenori Kai
Publikováno v:
PACRIM
In order to process the task-graphed parallel solution objects in a shortest time, task scheduling is important. Task scheduling is, however, a strong NP-hard combinatorial optimization problem, and therefore it is difficult to obtain optimal solutio
Autor:
Kenta Hasumi, Munenori Kai
Publikováno v:
PACRIM
We the authors of this study use mobile agents with capability of strong migration to develop AgentSphere, a platform for an autonomous parallel and distributed processing system that significantly reduces loads of the complex execution control for i
Publikováno v:
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing.
In a heterogeneous processing environment in a computer network where multiple PCs running JavaVM on them are connected to, it is very useful to make any class instance movable among any PCs. However, JavaVM can't inherently load and execute unknown
Publikováno v:
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing.
The task scheduling problems belong to the class of NP complete or strong NP complete combinatorial optimization problem. Taking account of communication overhead into task graphs makes these problems more difficult to solve by depth first search alg
Publikováno v:
2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing.
The Distributed Large Memory system, DLM, was designed to provide a larger size of memory beyond that of local physical memory by using remote memory distributed over cluster nodes. The original DLM adopted a low cost page replacement algorithm which
Publikováno v:
2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing.
The authors have been developing a strong migration mobile agent system in Java. Using the system, we are developing the platform of an autonomic distributed processing system, called AgentSphere. In this research, a mechanism so that an agent can cr