示例#1
0
文件: utils.go 项目: postfix/dolphin
func MesureCompleteState(quit chan bool, workers []*workers.Computable, tdata []models.SLPoint) {
	ticker_c := 1
	ticker := time.Tick(30 * time.Second)
	for {
		select {
		case <-quit:
			return
		case <-ticker:
			// We will compute the L2 Errors
			go func() {
				states := make([]models.State, len(workers))
				for k, wk := range workers {
					states[k] = wk.Est.State()
				}
				av := models.States(states).Average()
				err := 0.0
				for key, v := range tdata {
					p := av[key]
					err = err + (p-v.Y)*(p-v.Y)
				}
				err = math.Sqrt(err) / float64(len(tdata))
				fmt.Println("Mes,", ticker_c*30, "Error,", err)
				ticker_c++
			}()
		default:
			continue
		}
	}
}
示例#2
0
func SimpleWorker(queue mpi.MessagesQueue, cmpt *Computable, tau int) {
	i := 1
	vc := make(map[string]int) // version control map
	for {
		select {
		case data, ok := <-cmpt.Input:
			if !ok {
				return
			}
			if i == 1 {
				for _, v := range queue.Queues() {
					vc[v] = 0
				}
			}
			// ici on va faire des computations
			if i%tau == 0 && tau != 1 {
				stat := queue.ReadStates(vc)
				// Block of code just to covert to the good types
				states := make([]models.State, 0, len(stat))
				for _, v := range stat {
					states = append(states, v.(models.State))
				}
				// We know append the knew versions
				for key, v := range stat {
					vc[key] = v.Version()
				}
				if len(states) != 0 {
					acc := models.States(states).Average()
					cmpt.Est.Average(acc, data)
				} else {
					cmpt.Est.Compute(data)
				}
			} else {
				cmpt.Est.Compute(data)
			}
			queue.Write(cmpt.Name, cmpt.Est.State())
			i = i + 1
		}
	}
}
示例#3
0
func Worker(queue mpi.MessagesQueue, cmpt *models.DistributedSGD, tau int) {
	i := 1

	vc := make(map[string]int) // version control map

	var model1 []float64
	copy(cmpt.Instance.Model(), model1)

	model2 := cmpt.Instance.Model()
	for !cmpt.Stop(model1, model2) {
		if i == 1 {
			for _, v := range queue.Queues() {
				vc[v] = 0
			}
		}
		// ici on va faire des computations
		if i%tau == 0 && tau != 1 {
			stat := queue.ReadStates(vc)
			// Block of code just to covert to the good types
			states := make([]models.State, 0, len(stat))
			for _, v := range stat {
				states = append(states, v.(models.State))
			}
			// We know append the knew versions
			for key, v := range stat {
				vc[key] = v.Version()
			}
			if len(states) != 0 {
				acc := models.States(states)
				cmpt.Average(acc, i)
			}
		} else {
			cmpt.Compute(i)
		}
		queue.Write(cmpt.Name, cmpt.State())
		i = i + 1
	}
}