timemanager.hh

Go to the documentation of this file.

// -*- mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-
// vi: set et ts=4 sw=4 sts=4:
/*****************************************************************************
 *   See the file COPYING for full copying permissions.                      *
 *                                                                           *
 *   This program is free software: you can redistribute it and/or modify    *
 *   it under the terms of the GNU General Public License as published by    *
 *   the Free Software Foundation, either version 3 of the License, or       *
 *   (at your option) any later version.                                     *
 *                                                                           *
 *   This program is distributed in the hope that it will be useful,         *
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of          *
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the            *
 *   GNU General Public License for more details.                            *
 *                                                                           *
 *   You should have received a copy of the GNU General Public License       *
 *   along with this program.  If not, see <http://www.gnu.org/licenses/>.   *
 *****************************************************************************/
#ifndef DUMUX_TIME_MANAGER_HH
#define DUMUX_TIME_MANAGER_HH
 
#warning "This file is deprecated. Use the TimeLoop class in common/timeloop.hh"
 
#include <algorithm>
 
#include <dune/common/float_cmp.hh>
#include <dune/common/timer.hh>
#include <dune/common/parallel/mpihelper.hh>
 
#include "properties.hh"
#include "parameters.hh"
 
namespace Dumux {
 
template <class TypeTag>
class TimeManager
{
    using Scalar = GetPropType<TypeTag, Properties::Scalar>;
    using Problem = GetPropType<TypeTag, Properties::Problem>;
 
    TimeManager(const TimeManager&)
    {}
public:
 
    TimeManager(bool verbose = true)
    {
        verbose_ =
            verbose &&
            Dune::MPIHelper::getCollectiveCommunication().rank() == 0;
 
        episodeIndex_ = 0;
        episodeStartTime_ = 0;
 
        time_ = 0.0;
        endTime_ = -1e100;
 
        timeStepSize_ = 1.0;
        previousTimeStepSize_ = timeStepSize_;
        timeStepIdx_ = 0;
        finished_ = false;
 
        episodeLength_ = 1e100;
    }
 
    void init(Problem &problem,
              Scalar tStart,
              Scalar dtInitial,
              Scalar tEnd,
              bool restart = false)
    {
        timer_.reset();
 
        problem_ = &problem;
        time_ = tStart;
        timeStepSize_ = dtInitial;
        previousTimeStepSize_ = dtInitial;
        endTime_ = tEnd;
 
        if (verbose_)
            std::cout << "Initializing problem '" << problem_->name() << "'\n";
 
        // initialize the problem
        problem_->init();
 
        // restart problem if necessary
        if(restart)
            problem_->restart(tStart);
        else
        {
            // write initial condition (if problem is not restarted)
            time_ -= timeStepSize_;
            if (problem_->shouldWriteOutput())
                problem_->writeOutput();
            time_ += timeStepSize_;
        }
 
        if (verbose_) {
            int numProcesses = Dune::MPIHelper::getCollectiveCommunication().size();
            std::cout << "Initialization took " << timer_.elapsed() <<" seconds on "
                      << numProcesses << " processes.\n"
                      << "The cumulative CPU time was " << timer_.elapsed()*numProcesses << " seconds.\n";
        }
 
    }
 
    void setTime(Scalar t)
    { time_ = t; }
 
    void setTime(Scalar t, int stepIdx)
    { time_ = t; timeStepIdx_ = stepIdx; }
 
    Scalar time() const
    { return time_; }
 
    Scalar endTime() const
    { return endTime_; }
 
    void setEndTime(Scalar t)
    { endTime_ = t; }
 
    double wallTime() const
    {  return timer_.elapsed(); }
 
    void setTimeStepSize(Scalar dt)
    {
        using std::min;
        timeStepSize_ = min(dt, maxTimeStepSize());
    }
 
    Scalar timeStepSize() const
    { return timeStepSize_; }
 
    Scalar previousTimeStepSize() const
    { return previousTimeStepSize_; }
 
    int timeStepIndex() const
    { return timeStepIdx_; }
 
    void setFinished(bool yesno = true)
    { finished_ = yesno; }
 
    bool finished() const
    { return finished_ || time() >= endTime(); }
 
    bool willBeFinished() const
    { return finished_ || time() + timeStepSize() >= endTime(); }
 
    Scalar maxTimeStepSize() const
    {
        if (finished())
            return 0.0;
 
        using std::max;
        using std::min;
        return min(min(episodeMaxTimeStepSize(),
                       problem_->maxTimeStepSize()),
                   max<Scalar>(0.0, endTime() - time()));
    }
 
    /*
     * @}
     */
 
 
    void startNextEpisode(Scalar tStart,
                          Scalar len,
                          const std::string &description = "")
    {
        ++ episodeIndex_;
        episodeStartTime_ = tStart;
        episodeLength_ = len;
        episodeDescription_ = description;
    }
 
    void startNextEpisode(Scalar len = 1e100)
    {
        ++ episodeIndex_;
        episodeStartTime_ = time_;
        episodeLength_ = len;
    }
 
    int episodeIndex() const
    { return episodeIndex_; }
 
    Scalar episodeStartTime() const
    { return episodeStartTime_; }
 
    Scalar episodeLength() const
    { return episodeLength_; }
 
    bool episodeIsFinished() const
    { return time() >= episodeStartTime_ + episodeLength(); }
 
    bool episodeWillBeFinished() const
    { return time() + timeStepSize() >= episodeStartTime_ + episodeLength(); }
 
    Scalar episodeMaxTimeStepSize() const
    {
        // if the current episode is over and the simulation
        // wants to give it some extra time, we will return
        // the time step size it suggested instead of trying
        // to align it to the end of the episode.
        if (episodeIsFinished())
            return 0.0;
 
        // make sure that we don't exceed the end of the
        // current episode.
        using std::max;
        return max<Scalar>(0.0, episodeLength() - (time() - episodeStartTime()));
    }
 
    /*
     * @}
     */
 
    void run()
    {
        timer_.reset();
 
        // do the time steps
        while (!finished())
        {
            // pre-process the current solution
            problem_->preTimeStep();
 
            // execute the time integration scheme
            problem_->timeIntegration();
            Scalar dt = timeStepSize();
 
            // post-process the current solution
            problem_->postTimeStep();
 
            // write the result to disk
            if (problem_->shouldWriteOutput())
                problem_->writeOutput();
 
            // prepare the model for the next time integration
            problem_->advanceTimeLevel();
 
            // write restart file if mandated by the problem
            if (problem_->shouldWriteRestartFile())
                problem_->serialize();
 
            // advance the simulated time by the current time step size
            time_ += dt;
            ++timeStepIdx_;
 
            if (verbose_) {
                std::cout
                    << "Time step "<<timeStepIndex()<<" done. "
                    << "Wall time:"<<timer_.elapsed()
                    <<", time:"<<time()
                    <<", time step size:"<<dt
                    <<"\n";
            }
 
            // notify the problem if an episode is finished
            if (episodeIsFinished()) {
                //define what to do at the end of an episode in the problem
                problem_->episodeEnd();
 
                //check if a time step size was explicitly defined in problem->episodeEnd()
                if (Dune::FloatCmp::eq<Scalar>(dt, timeStepSize()))
                {
                    // set the initial time step size of a an episode to the last real time step size before the episode
                    using std::max;
                    Scalar nextDt = max(previousTimeStepSize_, timeStepSize());
                    previousTimeStepSize_ = nextDt;
                    setTimeStepSize(nextDt);
                }
            }
            else
            {
                // notify the problem that the time step is done and ask it
                // for a suggestion for the next time step size
                // set the time step size for the next step
                previousTimeStepSize_ = timeStepSize();
                setTimeStepSize(problem_->nextTimeStepSize(dt));
            }
        }
 
        if (verbose_) {
            int numProcesses = Dune::MPIHelper::getCollectiveCommunication().size();
            std::cout << "Simulation took " << timer_.elapsed() <<" seconds on "
                      << numProcesses << " processes.\n"
                      << "The cumulative CPU time was " << timer_.elapsed()*numProcesses << " seconds.\n";
        }
    }
 
    template <class Restarter>
    void serialize(Restarter &res)
    {
        res.serializeSectionBegin("TimeManager");
        res.serializeStream() << episodeIndex_ << " "
                              << episodeStartTime_ << " "
                              << episodeLength_ << " "
                              << time_ + timeStepSize() << " "
                              << timeStepIdx_ + 1 << " ";
        res.serializeSectionEnd();
    }
 
    template <class Restarter>
    void deserialize(Restarter &res)
    {
        res.deserializeSectionBegin("TimeManager");
        res.deserializeStream() >> episodeIndex_
                                >> episodeStartTime_
                                >> episodeLength_
                                >> time_
                                >> timeStepIdx_;
        res.deserializeSectionEnd();
    }
 
    /*
     * @}
     */
 
private:
    Problem *problem_;
    int episodeIndex_;
    Scalar episodeStartTime_;
    Scalar episodeLength_;
    std::string episodeDescription_;
 
    Dune::Timer timer_;
    Scalar time_;
    Scalar endTime_;
 
    Scalar timeStepSize_;
    Scalar previousTimeStepSize_;
    int timeStepIdx_;
    bool finished_;
    bool verbose_;
};
}
 
#endif