GSIM Focus Group
Purpose: to focus on the problem of generating the first publication-quality acceptance calculations with the GEANT-based code GSIM.
Core Group Members (33% of time or more)
|
David Rowntree (MIT) 33%
|
Jianguo Zhao (MIT) 33%
|
|
Kyungseon Joo (UVA) 33%
|
Franz Klein (JLAB) 33%
|
|
Laurent Farhi (Saclay) 40%
|
Will Brooks (JLAB) 33%
|
|
Mike Vineyard (UR) 33% (during summer, starting May 1998)
|
Contributing Members:
|
Cole Smith (UVA) ?%
|
Maurik Holtrop (UNH) 35%
|
|
Larry Dennis (FSU) 20% (until fall)
|
Stepan Stepanyan (YPI/JLAB) ?%
|
|
Dave Tedeschi (USC) 25%
|
Allena Opper (OU) 20%
|
|
Hall Crannell (CUA) 20%(summer), 10% during the year
|
Dan Sober (CUA) 20%(summer), 10% during the year
|
|
Burin Asavapibhop (UMASS) ?%
|
Junho Yun (ODU) ?%
|
|
Dennis Weygand (JLAB) ?%
|
Volker Burkert (JLAB) 10%
|
|
John Price (LTU)?%
|
Bryan Carnahan (CUA) 40%
|
|
1 UR student in summer ?%
|
Alex Vlassov (ITEP) ?%
|
|
Andi Klein (ODU) ?%
|
Rob Feuerbach (CMU) ?%
|
|
Hendrik Ayvazian (CUA) 40%Summer
|
Robert Pollard (ODU) ?%
|
|
Alex Skabelin (MIT)
|
Si McAleer (FSU)
|
|
Costy Loukachine (VPI), Summer 98
|
Steve Dytman (UPitt)
|
|
2 MIT students, Summer 98
|
Alan Coleman (W&M)
|
Regular `virtual' meetings, using speakerphone and Web-based whiteboard/slideshow program; minutes distributed to the offline and gsim mailing lists.
Web: Hall B home page -> GSIM home page -> GSIM Focus Group home page
How fast is GSIM, and how fast do we need it to be?
In ideal case:
W bins of 20 MeV, 0.9 GeV -> beam energy
Q-squared bins 0.2 -> 1.1*beam energy, 10 bins logarithmically spaced
Hadronic theta bins - 10 degree bins from 8 to 140 degrees
Hadronic phi bins 20 degree bins from -180 to 180
At 1.6 GeV, need 35 (W) x 10 (Q2) x 13 (theta) x 18 (phi) = 81,900 bins
82 kbin x 1 kevent/bin(3% statistics) x 3(electron fraction) = 246 million events
246 million events @ 3.1 second/event = 8800 cpu days
8800 cpu days @ 20 dedicated Linux cpu's = 14.7 months
(per energy, magnetic field setting, and event type)
Can probably tolerate 0.75 month, => need factor of 20 in:
(number of cpus) x (cpu speed increase) x (increase in code speed)
e.g., get 60 Linux cpu's and 10 Alpha's, and speed up code by a factor of 5
=> factor of 20
If aim for 10% statistics instead of 3%, above number becomes 6 weeks.
(But need more statistics at the higher energies)
=> there probably exists a feasible solution, given more work and cpu's <=
Comments on Other Methods for Calculating Acceptances
- Throwing multiparticle final states uniformly
- Throwing single particles, using single particle acceptances with a separate event generator
-
Particle correlations affect acceptance calculations
-
Effect of correlations on acceptance is minimized when:
-
correlations are not strong
-
acceptance is large
-
backgrounds are minimized
-
Using kinematic correlations in the event generator enforces kinematic boundaries via statistical errors from the acceptance calculation. The resulting error estimates are straightforward to interpret.
-
Not using kinematic correlations in the event generator produces finite acceptance for unphysical events which may accentuate background events. Cutting these out may prove difficult, especially for complicated final states.
-
Any scheme not using kinematic correlations to generate events for GSIM `wastes' cpu cycles by generating events in unphysical regions, and by not generating fewer events in physical regions where there are few real counts.
-
Any scheme using single particle acceptances will miss second-order effects such as multiple SC hits, complicated EC hit, two-adjacenttrack events or crossover tracks in DC, etc. May be adequate accuracy for some experiments, but not for all. (Can recover approximate single-particle acceptances from results of proposed scheme).
-
Need many bins for single-particle acceptances (e.g., target z and r).
-
Schemes using single particle acceptances will save somewhat on overall cpu time, but not dramatically. A better solution for moderate quality acceptance calculations would be to use FSIM.
==> The alternative schemes mentioned are workable, however, the proposed approach is somewhat technically superior.