FRAMEWORK OF MEEING CEDULING IN COMPUER YEM Goran Marnovc, Faculy of Elecrcal Engneerng, J.J. rossmayer Unversy of Ose, goran.marnovc@efos.hr ABRAC Developmen of compuer echnologes s a necessary bu no he only precondon for solvng problems by means of compuer suppored cooperave wor (CCW). he proposed framewor for meeng schedulng encompasses parameers of group members, obs hey carry ou, meengs as well as schedulng procedures. In addon o nowledge and experence requred for he usage of oday s powerful compuer echnologes, as well as for solvng concree problems, group members,.e. humans, can be descrbed by a seres of ndvdual and socologcal properes whch can represen an advanage bu also a shorcomng of successful CCW. For he purpose of enablng as successful cooperaon nervals,.e. meengs, as possble, organzaon, nfrasrucure and mng parameers of meengs are presened sysemacally. Jobs carred ou a meengs of humans or her resources are adaped o mplemenaon no a greaer number of schedulng algorhms. he proposed framewor s as such applcable o a wde range of CCW problems, parcularly n he sense of modern echnologes and her nfluence on a human. Keywords: Compuer uppored Cooperave Wor (CCW), Group, uman Facors, Meeng, chedulng. INRODUCION World globalzaon exss n educaon, economcs, research, publshng, eneranmen, ndusry, medcne, resource managemen and almos all areas of human lfe. Logcally, he mporance of nowledge and nformaon, bu also he need for cooperaon n problem solvng has consan progressed. Problems caused n such a huge area appear acually worldwde and are herefore much more complcaed han he problems produced or supposed o be solved by a human as an ndvdual. he suppor comes n he form of global means of compuer sysems, communcaon and neworng on all levels and especally he Inerne, www, moble communcaon and compuaonal grds. Real-me problems are raher exensve, parcularly n case of hard deadlnes. A human represens an acve componen n Compuer uppored Cooperave Wor (CCW) and requres specal aenon. Organzaons of any form reach her goals by usng compuer echnologes and ools enablng neworng of ndvduals and groups n a cooperave un. Accordng o [19], ha erm s nown as CCW. Varous erms have been used for CCW, such as worgroup compung, compuer asssed communcaon, compuer suppored groups, ec. Accordng o [10], CCW s a generc erm whch combnes undersandng of he way people wor n groups wh enablng echnologes of compuer neworng, and assocaed hardware, sofware, servces and echnques. CCW mples a consan flow of nowledge and experence of group members, communcaon whch enables flexbly and redundancy, eamwor above ndvdual wor, as well as he envronmen n whch members cooperae. he envronmen s represened by he wor he group s carryng ou. CCW s also observed hrough he erm groupware. I ncludes specalzed compuer ads desgned for he use of collaborave wor groups and frequenly nvolves sofware, hardware, servces and/or group suppor. Groupware are compuer-based sysems ha suppor groups of people engaged n a common as and provde an nerface o a shared envronmen. Regardless of he developmen of compuer and especally neworng echnologes, a me-crcal or real-me problem remans neresng. he reason for ha s ha compuers, sofware suppor and communcaon are used n CCW as a suppor o cooperave wor, whle group members and wor beng carred ou by hem represen schedulng facors. he man purpose of hs paper s o nclude all sgnfcan organzaon and mng parameers of CCW hrough he proposed meeng schedulng model. he model s focused on he properes of group members meengs a whch hey cooperae and do her ob. pecal aenon s gven o hose group members ha possess boh nowledge and capables, bu also o shorcomngs of eam wor. he model should provde a possbly of a beer CCW facor esmaon and seng of correspondng mng demands on he wor beng carred ou by he group. Parameers comprsed by he model enable VOL IX, No. 2, 2008 560 Issues n Informaon ysems
Framewor of Meeng chedulng n Compuer ysems vrualzaon of a human compuer nerface. Regardless of he model assumng he group members are compuer-, sofware- and communcaon-suppored, can be appled n he cases when group members are compuers wh humans beng exclusvely exernal users, as presened n [22]. CCW and s basc prncples are descrbed n he nroducory par of hs paper. he second chaper gves a me-space classfcaon of CCW sysems, reasons for her usage as well as examples of asynchronous and synchronous applcaons. he hrd chaper descrbes he schedulng problem n CCW, whereas he fourh one presens he meeng schedulng model n CCW. he paper concludes wh a shor analyss of he proposed model and mplemenaon feaures. CCW APPLICAION Accordng o [21], CCW echnology s bascally classfed wh respec o he place and me of group members wor. If group members wor ogeher a he same me, we al abou a synchronous CCW [13]. Oherwse, he CCW s asynchronous. Regardng a worng locaon, group members can wor collocaed or face-o-face group. On he oher hand, we dffer non-collocaed or dsance groups. Locaon and me have a very mporan nfluence on group funconaly, formaon and wor. CCW has more posve consequences. I can enable a faser, effcen and ransparen communcaon [7], reduce worng coss, expand horzons of group members regardng problem undersandng and solvng, smplfy group coordnaon, mprove neracon, as well as usably and avalably of compuer sysems [15]. In he nex chapers well nown asynchronous and synchronous applcaons of CCW echnology are descrbed. Asynchronous CCW Mos popular asynchronous applcaons are e-mal (ncludng malng lss), news groups, hyperex, blogs, faceboos, ec. hey enable an exchange of dfferen forms of nformaon beween wo and more persons or groups of persons. Mulple accesses o a www and oher forms of documens and nformaon are fundamenal properes of hese applcaons [12]. Group calendars enable schedulng, proec leadng and coordnaon beween a greaer number of people. ynchronous or real-me CCW hared wheboards enable wo or more users o see and draw on he shared wheboard from dfferen locaons. he locaon a whch every applcaon parcpan draws whch color he or she uses, ec. s nown a any nsan. Vdeo communcaon enables a fas vdeo ln. In addon o muual conversaon, enables cooperaon n varous suaons hrough observng acves a a dsan locaon. Dfferen cha sysems enable more people o wre and read messages n exual or vsual (vdeo) form and exchange hem n real-me a some publc place. hereby s possble o realze he access conrol, nroducon of he moderaor leadng a dscusson, proposal of dscusson opcs, bu also an enrely free and sporadc communcaon. Decson suppor sysems conan ools for bransormng, crczng of deas, assocang weghs and possbles o evens, and vong. Very good examples of a real-me applcaon are mul-player games, accessed mosly hrough he Inerne. he problem of real-me operang depends on a varey of CCW properes, as n [18]. ome of hem are encompassed by he proposed model. Accordng o [14], due o he presence of very fas compuer newors, powerful compuaonal clusers and grds, wreless and moble echnologes n all aspecs of human lfe, he aforemenoned applcaons have faced new ways of applcaon wh new requess beng placed as well. CCW CEDULING Cooperaon effecveness of group members sgnfcanly prescrbes group effecveness. ha cooperaon s argeed o beer undersandng of ass, effcen resource managemen and developmen of cooperaon sraegy. uccessful groups suppor muual respec of members, nclude all avalable nowledge n he cooperaon process [7], carry ou careful resource sharng and open dfferen vewpons regardng he gven problem and her recognon [6]. Group members acqure new nowledge and experence n me, ge used o each oher and adus o he cooperaon process. nce he group possesses ceran nowledge and experence, can mae decsons and s compuer suppored, we al abou arfcal nellgence of he group. Accordng o [15], he schedulng problem can be descrbed as machng ass on processor(s) and sharng of processor me n he assgned me slos. chedulng n he CCW sysem s more complex. VOL IX, No. 2, 2008 561 Issues n Informaon ysems
Framewor of Meeng chedulng n Compuer ysems Group members cooperae n order o carry ou a ceran ob. me nervals when hey cooperae are called a meeng. Durng he meeng, members use avalable compuer and newor resources and cooperae. chedulng of meengs means ha obs are scheduled o group members n solvng he gven ass. Only some of he quesons ha should be answered by meeng schedulng are: meeng me, meeng duraon, meeng parcpans, meeng place, ec. nce here s no opmal schedulng algorhm for solvng all suaons, for hs problem we use arfcal nellgence procedures smlar o [17] and heursc procedures as n [11]. Inellgen schedulers mus be famlar wh neress and prores of possble group members supposed o be me. Calendar schedule of every person ang par n he meeng s forwarded o hs/her local scheduler, who maes he man meeng schedule. Mos ofen schedulers wor concurrenly n order o shoren schedulng me, ncrease relably concernng calendar nerpreaon and enable proecon of prvae neress. Local schedulers mus also cooperae and exchange nformaon abou meengs. Mos frequenly he scheduler sysem s based on one prncpal and a seres of local schedulers. chedulng procedure auonomy requres a dealed defnon of he meeng goal, group champon selecon among group members, as well as suppor of varous user and neracon ypes, as descrbed n [23]. MEEING CEDULING IN CCW mlarly o [16], he CCW sysem can be presened by group ( G ), ob rused o group ( J ), cooperaon ( C ) and schedulng ( ). Parameers of all levels are lsed n alphabecal order n Appendx. Group Group G consss of n members. Every member M of group G can be shown by (1): { A, ε, s, ϖ, ω, dsr, I, C hsp } M =, (1) M Group member parameers are descrbed n he ex o follow. A M member avalably accordng o he schedule. A personal schedule of a member consss of an ordered se of pons n me boundng schedule mng gaps. hese pons buld he calendar schedule. Every pon conans a daum on he exac dae and me. ε experence level of a group member. I corresponds o he me spen n he group or on smlar obs. s specal nowledge level of a group member. I depends on he me and success spen on specal educaons, worshops or smlar acves relaed o group acves. ϖ personal neres level of a group member. For he group effcacy, he level of personal neres should be as low as possble. On he oher hand, mus no be lower han he socologcal level soc whch movaes a member o parcpae n group wor, smlarly o [4]. Accordng o (2), ha socologcal level s deermned by he level of ancpaed recprocy a member may expec from he group ( rec ), expeced ncreased repuaon ( rep ), sense of effcacy ( eff ), and sense of communy ( comm ). ( rec, rep, eff comm) M soc M =, (2) ω general neres level of a group member. I should be as hgh as possble. dsr he law of sascal dsrbuon of group member avalably or an avalably sample. I s especally mporan n case of sporadc requess for meengs. I s obaned by a sascal analyss of avalably me. I group member nfrasrucure level. A member wh a beer nfrasrucure,.e. beer compuer suppor and communcaon owards he group, as n [12] and [1], s more easly ncorporaed no he group. For he purpose of model smplcy, an equal nfrasrucure level s somemes assumed for all members. In real lfe, he suaon s compleely dfferen; s he group member nfrasrucure whch s he mos obvous ndcaor of member heerogeney. Inernal orderng of he group member nfrasrucure depends on he so-called plaform parameers shown n [15] and by (3). hese parameers dffer as compuer ( comp ) and communcaon ( com ) parameers. comp O, arch, cl,, mem, hdd I = com ne, ICN, mob, nicn, scluser, com X sp, X conc 2, (3) Compuer parameers are plaform operang sysem ( O ), machne archecure ( arch ), processor speed VOL IX, No. 2, 2008 562 Issues n Informaon ysems
Framewor of Meeng chedulng n Compuer ysems ( cl ), number of processors n machne ( ), memory sze ( mem ) and sorage or ds space ( hdd ). Communcaon parameers are nomnaed newor speed ( ne ), nerconnecon newor opology ( ICN ), member mobly members can be moble f hey are conneced by a moble [14] or a wreless newor [20], whereby a hgher level of mobly s naurally offered by a moble newor ( mob ), number of arbrary nerconnecons ( n ICN ), cluser sze ( s cluser ), overlapped compuaon/ 2 communcaon ( com ), exernal suppor o machne ( X sp ) and machne capably of resource concesson ( X conc ). C addonal creds gven o a member by he hos or group champon members. hsp - human sandpons of a group member. Alhough here are many human sandpons, accordng o (4), hey can be reduced o he ehcal, culural, relgous and polcal level. { eh, cul, rel pol} hsp =, (4) he goal of he meeng may o a ceran degree be nconssen wh he gven prncples of he group member. Accordng o [9], ehcal prncples may mply socal, envronmenal, scenfc and oher prncples. I s desrable o have a group member of he hghes culural level possble, snce s favorable o cooperaon wh oher group members as well as he group as a whole. A member can be expeced no o parcpae n he meeng below a argeed culural level. hs also holds for relgous and polcal sandpons. Members are expeced o be relgously and polcally oleran, bu hey canno be forced no parcpaon n he meeng whch sgnfcanly dsagrees wh her relgous or polcal orenaon. In conras o oher group member parameers, human sandpons represen a compleely nalenable rgh of every member no oblged o subec hem o group neress. On he oher hand, he group may be more or less supporve of hose prncples. If sandpons of he group and he member dffer sgnfcanly, would be mos reasonable for boh sdes o brea off her relaons. Accordng o [1], a group s sad o be heerogeneous f s members muually dffer n a leas one of he gven parameers. In real lfe, group members may be expeced o dffer n a greaer number of parameers. I would be dffcul o show heerogeney for all members n all parameers, and f were shown, would be almos useless n case of meeng schedulng. herefore, s expressed by a group performance ndcaor for every member M of group G, whch s denoed by M. ha group ndcaor, accordng o expresson (5), corresponds o he mean value of all parameers M par of = 1,2,...x for some member M. Accordng o (6), group ndcaors M placed n vecor G show heerogeney among members of groupg. x M par M = (5) x =,..., (6) G = 1 [ M, M M n ] 1 2 Represenaon of group heerogeney n a greaer number of parameers would requre a marx noaon of. Jobs G Job J ha should be carred ou by he group consss of m ass 1, 2, Κ, m. Every as can be presened by (7). ome of he as parameers follow from [17]. where: ( c,, p,, hard / sof, pmn dupl) = (7) d a, c execuon me. d deadlne. p perod for perodc as. a nerarrval me for aperodc as. hard sof ype of deadlne. pmn - possbly of ermnang he as durng execuon (preempably). dupl - possbly of as duplcaon. mlarly o he group, ob J can also be heerogeneous, snce ass mang do no have o be muually equal. In conras o group heerogeney, heerogeney of ob J s expressed by some of he mos mporan ndvdual ndcaors for every as. ha vecor J conans values of hese ndvdual parameers, and specfcally n (8) execuon me s n he wors case c. VOL IX, No. 2, 2008 563 Issues n Informaon ysems
Framewor of Meeng chedulng n Compuer ysems [ c c ] J = 1, 2,..., c m (8) Represenaon of ob heerogeney n a greaer number of parameers would requre a marx noaon. udyng heerogeney should guaranee a meeng schedule of hgh qualy, such ha a member of a ceran heerogeney level (group ndcaor values of s performances) wll be assocaed a ob of a ceran heerogeney level (of ceran duraon, requess on resources, ec.). Cooperaon nervals Members of a group ha execue a ob or a seres of ass mus cooperae. Cooperaon nervals are called meengs ( C ). he schedulng procedure bols down o schedulng obs o group members,.e. fllng n her schedule by meengs. he -h meeng or cooperaon C can be shown as n (9), where ρ represens organzaonal and nfrasrucural properes, δ mng properes of he meeng and hsp human sandpon properes. Expresson (10) represens parameers ρ. { ρ,δ hsp } C =, (9) { GM, χ, org, ε, s, ϖ, I, ϕ, cham } ρ = (10) where: GM group members ncluded n he ob execuon (meeng). I s obaned by selecng members for a ceran ob and schedulng obs. elecon crera are carred ou accordng o some of he elemens descrbng hem. A member s seleced who s avalable n he requesed nerval, possesses a ceran level of experence, specal nowledge, general neress and a sasfacory level of nfrasrucure. A se of group members mus be defned pror o schedulng, bu can be subsued durng meeng (by elmnang nadequae members and nvolvng members of hgher qualy). χ meeng hoss mus be defned pror o schedulng, bu can be alered durng he meeng, also for he purpose of mprovng he qualy of hoss. A hos can be a group member, a group member wh a specal saus, or a rened member. A hos s beer f he/she belongs o he group and agrees wh general or common neress of he group. org esmaed level of meeng organzaon. I should be as hgh as possble, as requred n [21]. Esmaon s done eher by he hoss or group members. Before he meeng, org maes parcpans aware of he mporance of he forhcomng meeng. Afer he meeng, should clear organzaonal shorcomngs of fuure meengs. Furher secons gve parameers descrbng expeced levels of experence, nowledge, neres and nfrasrucure properes of poenal group members. hey are used for recrumen of members no he group by comparng parameers of a member ha would le o on he group wh a boundary value. A boundary value s ofen an average parameer value. ε expeced experence level of group members s a mnmal experence level, whch should be sasfed by he group member onng he group. s expeced level of specal nowledge necessary a he meeng. I corresponds o he mnmal value of he specal nowledge level ha a member should have n order o on he group. ϖ allowed level of personal neress of group members. For some member, mus be greaer han or equal o he allowed,.e. average value. I level of nfrasrucure orderng of a poenal group member I. ϕ meeng prory level. I should be nown before he sar of nvaon of poenal members for a meeng. I s deermned by hoss of he meeng. cham number of champons n he meeng. her as n fuure meengs s o recru new group members. Expresson (21) shows meeng mng parameers. {,Δ, c,,,, p, } δ = c c s d D a (11) where: c meeng duraon. me planned for a successful end of he meeng,.e. ob. I depends on he organzaonal level and some oher parameers. Δ c meeng prolongaon me. I s a reserve me for a possble prolongaon of he meeng. I depends fnally on ob complexy and he meeng organzaon. c - real duraon of meeng. s meeng sar me. d meeng deadlne. VOL IX, No. 2, 2008 564 Issues n Informaon ysems
Framewor of Meeng chedulng n Compuer ysems D decson me n whch he meeng mus be acceped or canceled. p he perod n whch he meeng s carred ou. a nerarrval me beween consecuve meengs of he same groups. Meeng human sandpons parameers ( hsp ) are shown by (4). hese parameers can sgnfcanly nfluence group cooperaon, whch wll mosly be manfesed hrough group member avalably. nce members canno nfluence human sandpons of he group, he group should no pose hem as a drec creron of nvolvng members no meeng. On he oher hand, napproprae human sandpons of he hos or champon members should resul n removal of her favorable saus n he group. chedulng chedulng s a procedure of schedulng avalable compuer and communcaon resources or capaces for he ass beng execued. Creaed me schedule deermnes he me when he as approaches he resources. he mos scheduled resource n he compuer sysem s a processor one or more of hem. Numerous schedulng schemes presened n [3] have been developed ha are based on analycal or heursc procedures. A schedulng resul can be esmaed hrough sasfacon of hard mng requess wh accepable ulzaon. Meeng schedulng n CCW also represens resource schedulng o users [16]. owever, resources represen a ob o be done, and he users of hese resources are group members. Group members can also be users of he ob beng execued by he group. In order o carry ou CCW, group members mus cooperae,.e. hey mus have a meeng. hese meengs can be carred ou as drec group member meengs, hus becomng meengs of all resources or goods hey have a her dsposal; whereby we have n mnd compuer resources, bases of nowledge or goods whch can be used for general neres of he group dong compuer suppored cooperave wor. Basc schedulng procedure parameers are gven by expresson (12): γ, dep, c, pmn = L, F,, where: dynamc sac, re, al, dupl, aucon, (12) γ - obecve funcon or an opmal schedulng creron. Accordng o [3], for ndvdual ass hose are execuon me, flow me, laency, delay, earlness, whereas for a se of ass of he schedule as a whole hose would be maespan, mean flow me, mean weghed me, maxmum laency and ulzaon. dep - as dependency. he schedulng problem of muually dependen ass s much harder han he schedulng problem of muually ndependen ass whose schedule referrng o ob execuon s no mporan. c - expeced or acheved schedulng duraon. I s he me planned for solvng some schedulng problem, mos ofen srcly lmed, so ha he choce of algorhms becomes resrced o low complexy algorhms execuable n polynomal me. Recen leraure, as n [2], presens a lo of NPhard schedulng problems, so ha n addon o he so-called pure algorhm approach, a seres of relaxaon condons, approxmaon algorhms, as well as rules for schedulng and heursc procedures s nroduced. pmn - schedulng preempon. hs s one of he relaxaon crera mplyng ha he schedulng procedure self can be nerruped by some oher acvy or some oher schedulng procedure n he envronmen. re - reschedulng mechansm. Accordng o [8], reschedulng represens a dynamc procedure of renewng he exsng schedule as a response o sgnfcan dsorders or changes whereby he nformaon on possble fuure sysem operaon s also aen no consderaon. Reschedulng mechansms may sgnfcanly mprove boh resource managemen and meeng schedulng. al - schedulng algorhms used. Numerous deermnsc and sochasc schedulng algorhms are descrbed n [17]. Bu, only some are drecly applcable n meeng schedulng. dupl - as mulplcaon/duplcaon, whch s lned o parameer dupl n expresson (7). L - locaon of a scheduler. he schedulng procedure self can be carred ou a one locaon (cenralzed). Cenralzed schedulng s mosly done under supervson,.e. s arranged by he ob (applcaon) hos. Decenralzed schedulng s enrused wh he bes group members. F - faul olerance mplemened n he schedulng procedure. he goal s o ncrease relably and avalably of meengs, bu mosly reduces o redundancy ncrease. VOL IX, No. 2, 2008 565 Issues n Informaon ysems
Framewor of Meeng chedulng n Compuer ysems - accepable envronmen heerogeney by he schedulng procedure. Regardless of he fac ha envronmen heerogeney ncreases schedulng complexy, accordng o [1], obs conssng of varous ass can be done very successfully by varous group members. ence, an approprae schedulng algorhm s necessary, whch would mae he bes possble machng,.e., schedulng, a he group level ( M, wh he machng drecon dependng on he appled schedulng algorhm). dynamc sac - mng properes of schedulng execuon. Accordng o [15], can be sac, dynamc or combned (sac-dynamc). Bes schedulng s naurally expeced from sac-dynamc schedulng procedures. Afer he nal sac schedule, f necessary, durng schedule execuon (dynamc) hey can change he schedule. aucon - possbly of aucon whn he schedulng procedure. Accordng o [5], aucon means ha group members can bd obs or ass o be carred ou. In conras o a classcal evaluaon of group members on he bass of whch hey are assgned obs by he hos or champon, bddng,.e. fgh for obs, s run drecly among members. I s based upon offerng beer condons under whch obs of he group are o be done. 2. Defne hardness of mng requess, whch depends on he applcaon synchronous or asynchronous. 3. Defne he nal parameers of avalable members M for group formng. 4. elec group members accordng o organzaonal,.e. nfrasrucural properes of he group from se ρ and he properes of members from M. 5. elec he mng parameer or parameers from se δ accordng o whch meeng schedulng wll be execued c. For a greaer number of parameers, schedulng s erave and mullayered. 6. Implemen a scheduler on local and/or he level no CCW. 7. By applyng he crera descrbed n sep 4, carry ou schedulng and mae a calendar schedule of cooperaon K. 8. Apply evaluaon crera of schedulng. 9. Mae schedulng correcons (durng a dynamc phase or a reschedulng procedure). Fgure 1. Meeng chedulng Procedure he meeng schedulng procedure s based upon he prevously descrbed model. Accordng o he funcon, parameers of he descrbed model can be classfed no organzaonal and mng, and from he schedulng pon of vew, hey can be nernal and exernal, as well as npu and oupu. Inernal parameers se condons n whch schedulng s done, whereas he exernal ones are represened by he neracon wh envronmen,.e. he group. Fgure 1 presens he CCW meeng schedulng procedure. In hs paper he lowes schedulng level are he meengs. We can also do schedulng a he lower level of muually dependen ass, as well as schedule hem o group members. hs aes place more ofen f group members are referred o as compuers, no compuer suppored human wor. uccessful schedulng mples nvolvng as many parameers of he descrbed model as possble no he schedulng crera. he procedure s based on several basc assumpons and seps: 1. Defne ob J ha should be execued by G. Almos all mng parameers can be he ey o schedulng. hen schedulng bols down o sorng accordng o a relevan parameer and formng of an execuon queue. For example, meengs le a meeng whose deadlne s shorer, or a meeng ha has he shores real duraon me, or a meeng wh he hghes nal prory, ec. can be prorzed. VOL IX, No. 2, 2008 566 Issues n Informaon ysems
Framewor of Meeng chedulng n Compuer ysems Exensve explanaon of he schedulng procedure s no gven n hs paper. CONCLUION Increased hroughpu of compuer newors, Inerne echnology and moble communcaons conrbues sgnfcanly o avalably of powerful compuer resources, bu also o a muual connecon beween humans. Besdes asynchronous CCW applcaons, hs has enabled developmen of numerous synchronous CCW applcaons wh hard mng requess, such as elemedcne, decson mang n producon processes, and conrol of compuer, bu also naural, resources. he proposed framewor of meeng schedulng aes no accoun a grea number of general CCW parameers, bu also parameers of he group and s members, obs hey only do n meeng nervals, as well as properes of hese meengs. he framewor also descrbes a possbly of mplemenng he gven parameers no he schedulng procedure. Alhough reles on he schedulng heory and schedulng of compuer resources, he paper focuses on he human. General and specfc nowledge of a human, hs/her care dreced owards her own compuer nfrasrucure, he level of adapably of personal neress o group neress, as well as socologcal undersandng of cooperaon among group members, are he ey o successful cooperaon n problem solvng. Organzaonal/nfrasrucural and mng parameers of meengs are of specal mporance, snce on he bass of hem s possble o organze a meeng n accordance wh a correspondng schedulng procedure. he advanage of he proposed approach s a full negraon no new compuer and communcaon echnologes, bu also a socologcal vewpon adaped o hese echnologes, whch does no neglec human ds/advanages. he proposed framewor for schedulng meengs n CCW s a resul of a years-long applcaon and modfcaon of he descrbed prncples used n handlng resources n dsrbued compuer sysems, n whch happens very ofen ha a human represens he weaes ln as o problem solvng hrough cooperaon. Curren and fuure research deals wh furher applcaon and evaluaon of models n moble and grd envronmens, whch wll defnely resul n many new dmensons of CCW, especally of a human n hese new echnologcal condons. REFERENCE 1. Bharadway V., & Reddy Y.V. (2003). A framewor o suppor collaboraon n heerogeneous envronmen, ACM IGGROUP Bullen, 24(3), 103-116. 2. Blazewcz J., Kovalyov M.Y., Machowa M., rysram D., & Weglarz J. (2006). Preempable Malleable as chedulng Problem. IEEE ransacons on Compuers, 55(4), 486-490. 3. Brucer P., Dhaenens-Flpo C., Knus., Kravcheno.A., & Werner F (2000). Complexy Resuls for Parallel Machne Problems wh a ngle erver, Journal of chedulng, 5, 429-457. 4. Carayon P. (2006). uman facors of complex socoechncal sysems, Appled Ergonomcs, 37, Elsever, 525-535. 5. Chen J., Chen X., Kauffman R.J., & ong X. (2006). Cooperaon n Group-Buyng Aucons, Proc. of 39 h Annual awa Inernaonal Conf. on ysem cences (IC'06), 121c. 6. Chen I.Y.L., u A., uang J., Lan B., & hen Y.. (2006). Ubquous collaborave learnng n nowledge-aware vrual communes, Proc. of IEEE Inernaonal Conf. on ensor Newors, Ubquous and rusworhy Compung (UC 06), 84-89. 7. Cogburn D.L., Zhang L., & Khohule M. (2002). Gong global, locally: he soco-echncal nfluences on performance n dsrbued collaborave learnng eams, ACM In. Conf. Proc. eres, 30, 2002 Annual Research Conference ouh Afrcan Ins. Compuer cenfc Informaon echnology Enablemen hrough echnology, 52-64. 8. Vera G.E., errmann J.W., & Ln E (2003). Reschedulng Manufacurng ysems: A Framewor of raeges, Polces, and Mehods, Journal of chedulng, 6(1), 39-62. 9. enrch J., & enrch N. (2006). Culure, evoluon and he puzzle of human cooperaon, Cognve ysems Res., 7, Elsever, 220-245. 10. Kamsn A., & abr M.I.M. (2004). he collaborave sysem sraeges, Proc. 2004 ACM In. ymp. on Informaon and Communcaon echnologes, 158-165. 11. Kozero R., & Maes P. (1993). A learnng nerface agen for schedulng meengs, Proc. of 1 s ACM Inellgen User Inerfaces, 81-88. 12. LeJeune N. (2003). Crcal componens for successful collaborave learnng n C1, Journal VOL IX, No. 2, 2008 567 Issues n Informaon ysems
Framewor of Meeng chedulng n Compuer ysems of Compuer uppored Collaboraon, 19(1), 275-285. 13. L D., Zhou L., & Munz R.R. (2000). A New Paradgm of User Inenon Preservaon n Real- me Collaborave Edng ysems, Proc. of 7 h IEEE In. Conf. on Paralell and Dsrbued ysems (ICPAD'00), 401-408. 14. Looney C.A., & Valacch J.. (2005). Moble echnologes and collaboraon, Proc. 38 h IEEE Ann. awa In. Conf. ysem cences, 31. 15. Marnovc G. (2003). Owner/User Role n Compuaonal Grd Exenson by Non-dedcaed Resources, Proc. ACM In. ymp. on upporng Group Wor (Group 03), 221-228. 16. Marnovc G., & Budn L. (2002). Real-me Meeng chedulng Model by Compuer uppored Cooperave Wor, Inellgen Informaon Processng, Kluwer, 289-292. 17. Pnedo M. (2001). chedulng: heory, Algorhms, and ysems (2 nd Ed.), PR. 18. Rnus., Wal M., Johnson-hroop K.A., Maln J.., urley J.P., mh J.W., & Zhang J. (2005). uman-cenered desgn of a dsrbued nowledge managemen sysem, Journal of Bomedcal Informacs, 38, Elsever, 4-17. 19. chmd K. & mone C. (2000). Mnd he gap! owards a unfed vew of CCW, Proc. of 4 h In. Conf. on Desgn of Cooperave ysems (COOP 00), 205-221. 20. umya., Inoue A., hba., Kao J., hgeno., & Oada K. (2004), A CCW sysem for dsrbued search/collecon ass usng wearable compuers, Proc. 6 h IEEE Worshop Moble Compung ysems and Applcaons (WMCA 04), 20-27. 21. osvold D., Wes M.A., & mh KG (2003). eamwor and cooperaon, Fundamenals of organzaonal effecveness, In. andboo of Organzaonal and Cooperave Worng, John Wley & ons, 3-8. 22. olone W., Ahn G.J., Pa., & ong.p. (2005). Access conrol n collaborave sysems, ACM Compung urveys, 37(1), 29-41. 23. Zhuge. (2002). A nowledge grd model and plaform for global nowledge sharng, Exper ysems wh Appl., 22(4), Pergamon, 313-320. hs wor s suppored by research proec gran No. 165-0362980-2002 from he Mnsry of cence, Educaon and pors of he Republc of Croaa. APPENDIX able 1. Parameer Names Parameer ymbol Name G - Group arch Machne archecure A M Member avalably cl Processor speed com Communcaon parameers comm ense of communy comp Compuer parameers 2 com Overlapped compung/ communcaon C Addonal creds o members eff ense of effcacy hdd Ds space hsp uman sandpons (ehcal, culural, relgous, polcal) Group heerogeney I M Infrasrucure level ICN Inerconnecon newor Number of processors mem Memory sze mob Member mobly M Group member ne Newor speed n ICN Arbrary nerconnecons O Operang sysem rec Ancpaed recprocy rep Expeced repuaon s Cluser sze cluser s pecal nowledge level soc M ocologcal level X Machne capably of resource conc concesson X Exernal suppor o machne ε ω ϖ sp c dupl Experence level General neres level Personal neres level J - ob Execuon me as duplcaon VOL IX, No. 2, 2008 568 Issues n Informaon ysems
Framewor of Meeng chedulng n Compuer ysems ymbol Name pmn as preempably as deadlne d a Inerarrval me for aperodc as hard sof ype of deadlne J p c cham GM I org p Job heerogeney Perod for perodc as as C - cooperaon nerval Real meeng duraon Number of champons Group members ncluded n he ob execuon Infrasrucure orderng Level of meeng organzaon Meeng perod s Expeced level of specal nowledge Meeng nerarrval me a Meeng sar me s c Meeng duraon Meeng deadlne d ymbol Name D Decson-accep or cancel meeng δ mng properes ε Expeced experence level χ ϕ Meeng hos Meeng prory level ϖ Allowed level of member personal neress Δ c Meeng prolongaon me - schedulng al Algorhm aucon Possbly of aucon c chedulng duraon F Faul olerance Accepable envronmen heerogeney Locaon of scheduler L pmn re chedulng preempon Reschedulng mechansm dynamc sac mng properes of schedulng as dependency dep dupl as mulplcaon/duplcaon γ Obecve funcon VOL IX, No. 2, 2008 569 Issues n Informaon ysems