python.RunDependentMCTaskIterator Namespace Reference

Classes
class	taskIterator

Functions
def	getRunLumiInfoFragment (jobnumber, task, maxEvents, totalEvents, skipEvents, sequentialEventNumbers=False)
def	getRandomlySampledRunLumiInfoFragment (jobnumber, task, maxEvents, totalEvents, skipEvents, sequentialEventNumbers=False)
def	getFragment (jobnumber, task, maxEvents)
def	findPlaceInTask (jobnumber, task, maxEvents)
def	taskLookupTable (task)
def	defineSequentialEventNumbers (jobnumber, fragment, totalEvents, skipEvents)

Function Documentation

defineSequentialEventNumbers()

def python.RunDependentMCTaskIterator.defineSequentialEventNumbers	(		jobnumber,
			fragment,
			totalEvents,
			skipEvents
	)

Calculate sequential event numbers for the defined getFragment.

Definition at line 164 of file RunDependentMCTaskIterator.py.

def defineSequentialEventNumbers(jobnumber,fragment,totalEvents,skipEvents):
    """ Calculate sequential event numbers for the defined getFragment.
    """
    new_frag = []
    evt_nbr = jobnumber * totalEvents + skipEvents
    for t in fragment:
        for i in range(t['evts']):
            evt_nbr += 1
            new_frag.append({
                'run': t['run'],
                'lb': t['lb'],
                'starttstamp': t['starttstamp'],
                'evts': 1,
                'evt_nbr': evt_nbr,
                'mu': t['mu'],
            })
    return new_frag

findPlaceInTask()

def python.RunDependentMCTaskIterator.findPlaceInTask	(		jobnumber,
			task,
			maxEvents
	)

Get the 'i'th job in the task, where each job tries to do maxEvents events.
The 'force_new' flag in the LB list ends the task before that LB, ignoring maxEvents.
Returns a taskIterator. Can raise StopIteration, so you should nest in try.

Definition at line 91 of file RunDependentMCTaskIterator.py.

def findPlaceInTask(jobnumber,task,maxEvents):
    """ Get the 'i'th job in the task, where each job tries to do maxEvents events.
    The 'force_new' flag in the LB list ends the task before that LB, ignoring maxEvents.
    Returns a taskIterator. Can raise StopIteration, so you should nest in try.
    """
    jobnumber = max(int(jobnumber),0)
    i, jobs = (0,taskIterator(task,maxEvents))
    while True:
        if (i == jobnumber): return jobs
        i += 1
        next(jobs)
    #exit by exception
#

getFragment()

def python.RunDependentMCTaskIterator.getFragment	(		jobnumber,
			task,
			maxEvents
	)

Calculate the specific configuration of the current job in the digi task.

Definition at line 80 of file RunDependentMCTaskIterator.py.

def getFragment(jobnumber,task,maxEvents):
    """ Calculate the specific configuration of the current job in the digi task.
    """
    try: tIter = findPlaceInTask(jobnumber,task,maxEvents)
    except StopIteration:
        raise IndexError('There are only %i jobs in this task (not %i).' % (len([1 for i in taskIterator(task,maxEvents)]) + 1,jobnumber + 1))
    try: tIter.__next__()
    except StopIteration:
        pass
    return tIter.donejob
#

getRandomlySampledRunLumiInfoFragment()

def python.RunDependentMCTaskIterator.getRandomlySampledRunLumiInfoFragment	(		jobnumber,
			task,
			maxEvents,
			totalEvents,
			skipEvents,
			sequentialEventNumbers = False
	)

Calculate the specific configuration of the current job in the digi
task. Sample the mu values randomly.

Definition at line 42 of file RunDependentMCTaskIterator.py.

def getRandomlySampledRunLumiInfoFragment(jobnumber,task,maxEvents,totalEvents,skipEvents,sequentialEventNumbers=False):
    """Calculate the specific configuration of the current job in the digi
    task. Sample the mu values randomly.
    """
    # init random generator
    random.seed(jobnumber)
 
    # generate task inverse
    lookup_table=taskLookupTable(task)
    max_index = len(lookup_table) - 1
 
    # sample mu profile
    new_frag = []
    evt_nbr = jobnumber * totalEvents + skipEvents
    for i in range(maxEvents):
        evt_nbr += 1
 
        index = lookup_table[random.randint(0, max_index)]
        t = task[index]
 
        item = {
            'run': t['run'],
            'lb': t['lb'],
            'starttstamp': t['starttstamp'],
            'evts': 1,
            'mu': t['mu'],
        }
 
        if 'force_new' in t:
            item['force_new'] = t['force_new']
 
        if sequentialEventNumbers:
            item['evt_nbr'] = evt_nbr
 
        new_frag.append(item)
 
    return sorted(new_frag, key=itemgetter('run', 'starttstamp'))
 

getRunLumiInfoFragment()

def python.RunDependentMCTaskIterator.getRunLumiInfoFragment	(		jobnumber,
			task,
			maxEvents,
			totalEvents,
			skipEvents,
			sequentialEventNumbers = False
	)

Calculate the specific configuration of the current job in the digi
task. Try to make each fragment utilize the same amount of CPU and
Cache resources.  Exploits the fact that the task when sorted by
mu value will have long finishing pieces near the beginning and
short pieces near the end.  A more even solution is obtained by
pairing chunks of maxEvents/2 from the beginning and end of the
sorted task.

Definition at line 14 of file RunDependentMCTaskIterator.py.

def getRunLumiInfoFragment(jobnumber,task,maxEvents,totalEvents,skipEvents,sequentialEventNumbers=False):
    """Calculate the specific configuration of the current job in the digi
    task. Try to make each fragment utilize the same amount of CPU and
    Cache resources.  Exploits the fact that the task when sorted by
    mu value will have long finishing pieces near the beginning and
    short pieces near the end.  A more even solution is obtained by
    pairing chunks of maxEvents/2 from the beginning and end of the
    sorted task.
    """
    hiMaxEvents,loMaxEvents=0,0
    if(maxEvents%2==0):
        hiMaxEvents=loMaxEvents=int(maxEvents/2)
    else:
        hiMaxEvents=int((maxEvents-1)/2)
        loMaxEvents=int((maxEvents+1)/2)
    hi_mu_frag=[]
    lo_mu_frag=[]
    if hiMaxEvents > 0:
        hi_mu_frag=getFragment(jobnumber,sorted(task,key=lambda job: job['mu'],reverse=True),hiMaxEvents)
    if loMaxEvents > 0:
        lo_mu_frag=getFragment(jobnumber,sorted(task,key=lambda job: job['mu']),loMaxEvents)        
    
    fragment=sorted(sum([hi_mu_frag,lo_mu_frag],[]),key=lambda job: job['run'])
    if sequentialEventNumbers:
        return defineSequentialEventNumbers(jobnumber,fragment,totalEvents,skipEvents)
    else:
        return fragment
 

taskLookupTable()

def python.RunDependentMCTaskIterator.taskLookupTable

(

task

)

Generate task lookup table

Definition at line 155 of file RunDependentMCTaskIterator.py.

def taskLookupTable(task):
    """ Generate task lookup table
    """
    table = []
    for i, item in enumerate(task):
        for k in range(item['evts']):
            table.append(i)
    return table