mirror of
https://gitlab.com/scemama/QCaml.git
synced 2024-12-22 12:23:31 +01:00
Merge branch 'master' of lpqlx139:~/QCaml
Conflicts: MOBasis/HF12.ml
This commit is contained in:
commit
b0135a48f4
@ -56,6 +56,7 @@ let array_4_init d1 d2 d3 d4 fx =
|
|||||||
let x =
|
let x =
|
||||||
Bigarray.(Array2.create Float64 fortran_layout d1 d2)
|
Bigarray.(Array2.create Float64 fortran_layout d1 d2)
|
||||||
in
|
in
|
||||||
|
Printf.printf "Array 4: %d %d %d\n%!" Parallel.rank k l;
|
||||||
for j=1 to d2 do
|
for j=1 to d2 do
|
||||||
for i=1 to d1 do
|
for i=1 to d1 do
|
||||||
x.{i,j} <- fx i j k l
|
x.{i,j} <- fx i j k l
|
||||||
@ -121,6 +122,7 @@ let array_5_init d1 d2 d3 d4 d5 fx =
|
|||||||
let x =
|
let x =
|
||||||
Bigarray.(Array3.create Float64 fortran_layout d1 d2 d3)
|
Bigarray.(Array3.create Float64 fortran_layout d1 d2 d3)
|
||||||
in
|
in
|
||||||
|
Printf.printf "Array 5: %d %d %d\n%!" Parallel.rank l m;
|
||||||
for k=1 to d3 do
|
for k=1 to d3 do
|
||||||
for j=1 to d2 do
|
for j=1 to d2 do
|
||||||
for i=1 to d1 do
|
for i=1 to d1 do
|
||||||
@ -710,9 +712,11 @@ let make ~simulation ~mo_basis ~aux_basis_filename () =
|
|||||||
h_one a i Spin.Alfa *. f_two a j k l Spin.Alfa Spin.Alfa +.
|
h_one a i Spin.Alfa *. f_two a j k l Spin.Alfa Spin.Alfa +.
|
||||||
h_one a j Spin.Alfa *. f_two i a k l Spin.Alfa Spin.Alfa +.
|
h_one a j Spin.Alfa *. f_two i a k l Spin.Alfa Spin.Alfa +.
|
||||||
h_two a l i j Spin.Alfa Spin.Alfa *. f_one a k Spin.Alfa +.
|
h_two a l i j Spin.Alfa Spin.Alfa *. f_one a k Spin.Alfa +.
|
||||||
h_two a k j i Spin.Alfa Spin.Alfa *. f_one a l Spin.Alfa +.
|
h_two a k j i Spin.Alfa Spin.Alfa *. f_one a l Spin.Alfa ) +.
|
||||||
|
sum mos_cabs (fun a ->
|
||||||
sum mos_in (fun m -> -. h_two m a j i Spin.Alfa Spin.Alfa *.
|
sum mos_in (fun m -> -. h_two m a j i Spin.Alfa Spin.Alfa *.
|
||||||
f_two m a k l Spin.Alfa Spin.Alfa) +.
|
f_two m a k l Spin.Alfa Spin.Alfa) ) +.
|
||||||
|
sum mos_cabs (fun a ->
|
||||||
sum mos_cabs (fun b -> if b >= a then 0. else
|
sum mos_cabs (fun b -> if b >= a then 0. else
|
||||||
h_two b a j i Spin.Alfa Spin.Alfa *. f_two b a l k Spin.Alfa Spin.Alfa
|
h_two b a j i Spin.Alfa Spin.Alfa *. f_two b a l k Spin.Alfa Spin.Alfa
|
||||||
)
|
)
|
||||||
@ -727,10 +731,12 @@ let make ~simulation ~mo_basis ~aux_basis_filename () =
|
|||||||
h_one a i Spin.Alfa *. f_two a j k l Spin.Alfa Spin.Beta +.
|
h_one a i Spin.Alfa *. f_two a j k l Spin.Alfa Spin.Beta +.
|
||||||
h_one a j Spin.Alfa *. f_two a i l k Spin.Alfa Spin.Beta +.
|
h_one a j Spin.Alfa *. f_two a i l k Spin.Alfa Spin.Beta +.
|
||||||
h_two a l i j Spin.Alfa Spin.Beta *. f_one a k Spin.Alfa +.
|
h_two a l i j Spin.Alfa Spin.Beta *. f_one a k Spin.Alfa +.
|
||||||
h_two a k j i Spin.Alfa Spin.Beta *. f_one a l Spin.Alfa +.
|
h_two a k j i Spin.Alfa Spin.Beta *. f_one a l Spin.Alfa ) +.
|
||||||
|
sum mos_cabs (fun a ->
|
||||||
sum mos_in (fun m ->
|
sum mos_in (fun m ->
|
||||||
h_two m a j i Spin.Alfa Spin.Beta *. f_two m a l k Spin.Alfa Spin.Beta +.
|
h_two m a j i Spin.Alfa Spin.Beta *. f_two m a l k Spin.Alfa Spin.Beta +.
|
||||||
h_two m a i j Spin.Alfa Spin.Beta *. f_two m a k l Spin.Alfa Spin.Beta ) +.
|
h_two m a i j Spin.Alfa Spin.Beta *. f_two m a k l Spin.Alfa Spin.Beta ) ) +.
|
||||||
|
sum mos_cabs (fun a ->
|
||||||
sum mos_cabs (fun b ->
|
sum mos_cabs (fun b ->
|
||||||
h_two b a j i Spin.Alfa Spin.Beta *. f_two b a l k Spin.Alfa Spin.Beta
|
h_two b a j i Spin.Alfa Spin.Beta *. f_two b a l k Spin.Alfa Spin.Beta
|
||||||
)
|
)
|
||||||
|
@ -88,6 +88,44 @@ module Node = struct
|
|||||||
end
|
end
|
||||||
|
|
||||||
|
|
||||||
|
module InterNode = struct
|
||||||
|
|
||||||
|
let comm =
|
||||||
|
let rec aux accu name = function
|
||||||
|
| [] -> List.rev accu
|
||||||
|
| (newname, rank) :: rest when newname = name -> aux accu name rest
|
||||||
|
| (newname, rank) :: rest -> aux (rank :: accu) newname rest
|
||||||
|
in
|
||||||
|
|
||||||
|
let name = Unix.gethostname () in
|
||||||
|
Mpi.allgather (name, rank) Mpi.comm_world
|
||||||
|
|> Array.to_list
|
||||||
|
|> List.sort compare
|
||||||
|
|> aux [] ""
|
||||||
|
|> Array.of_list
|
||||||
|
|> Mpi.(group_incl (comm_group comm_world))
|
||||||
|
|> Mpi.(comm_create comm_world)
|
||||||
|
|
||||||
|
let rank =
|
||||||
|
Mpi.comm_rank comm
|
||||||
|
|
||||||
|
let master = rank = 0
|
||||||
|
|
||||||
|
let broadcast_generic broadcast x =
|
||||||
|
let x =
|
||||||
|
if master then Some (Lazy.force x)
|
||||||
|
else None
|
||||||
|
in
|
||||||
|
match broadcast x 0 comm with
|
||||||
|
| Some x -> x
|
||||||
|
| None -> assert false
|
||||||
|
|
||||||
|
let broadcast x = broadcast_generic Mpi.broadcast x
|
||||||
|
|
||||||
|
let barrier () = Mpi.barrier comm
|
||||||
|
end
|
||||||
|
|
||||||
|
|
||||||
module Vec = struct
|
module Vec = struct
|
||||||
|
|
||||||
type t =
|
type t =
|
||||||
|
@ -57,7 +57,6 @@ module Node : sig
|
|||||||
end
|
end
|
||||||
|
|
||||||
|
|
||||||
(*
|
|
||||||
(** {5 Inter-node operations} *)
|
(** {5 Inter-node operations} *)
|
||||||
module InterNode : sig
|
module InterNode : sig
|
||||||
|
|
||||||
@ -72,8 +71,10 @@ module InterNode : sig
|
|||||||
|
|
||||||
val broadcast : 'a lazy_t -> 'a
|
val broadcast : 'a lazy_t -> 'a
|
||||||
(** Broadcasts data to all the processes of the inter-node communicator. *)
|
(** Broadcasts data to all the processes of the inter-node communicator. *)
|
||||||
|
|
||||||
|
val barrier : unit -> unit
|
||||||
|
(** Wait for all processes among the node to reach this point. *)
|
||||||
end
|
end
|
||||||
*)
|
|
||||||
|
|
||||||
(** {5 Vector operations} *)
|
(** {5 Vector operations} *)
|
||||||
module Vec : sig
|
module Vec : sig
|
||||||
|
@ -391,7 +391,7 @@ let to_list data =
|
|||||||
|
|
||||||
|
|
||||||
let broadcast t =
|
let broadcast t =
|
||||||
t
|
Parallel.InterNode.broadcast (lazy t)
|
||||||
(*
|
(*
|
||||||
let size =
|
let size =
|
||||||
Parallel.broadcast (lazy t.size)
|
Parallel.broadcast (lazy t.size)
|
||||||
|
Loading…
Reference in New Issue
Block a user