diff --git a/fixture/db.sql b/fixture/db.sql deleted file mode 100644 index 49871a1..0000000 --- a/fixture/db.sql +++ /dev/null @@ -1,345 +0,0 @@ --- MySQL dump 10.13 Distrib 5.5.49, for debian-linux-gnu (x86_64) --- --- Host: localhost Database: publiste --- ------------------------------------------------------ --- Server version 5.5.49-0+deb7u1 - -/*!40101 SET @OLD_CHARACTER_SET_CLIENT=@@CHARACTER_SET_CLIENT */; -/*!40101 SET @OLD_CHARACTER_SET_RESULTS=@@CHARACTER_SET_RESULTS */; -/*!40101 SET @OLD_COLLATION_CONNECTION=@@COLLATION_CONNECTION */; -/*!40101 SET NAMES utf8 */; -/*!40103 SET @OLD_TIME_ZONE=@@TIME_ZONE */; -/*!40103 SET TIME_ZONE='+00:00' */; -/*!40014 SET @OLD_UNIQUE_CHECKS=@@UNIQUE_CHECKS, UNIQUE_CHECKS=0 */; -/*!40014 SET @OLD_FOREIGN_KEY_CHECKS=@@FOREIGN_KEY_CHECKS, FOREIGN_KEY_CHECKS=0 */; -/*!40101 SET @OLD_SQL_MODE=@@SQL_MODE, SQL_MODE='NO_AUTO_VALUE_ON_ZERO' */; -/*!40111 SET @OLD_SQL_NOTES=@@SQL_NOTES, SQL_NOTES=0 */; - --- --- Table structure for table `Author` --- -SET FOREIGN_KEY_CHECKS=0; -- to disable them - -DROP TABLE IF EXISTS `Author`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `Author` ( - `id` int(5) NOT NULL AUTO_INCREMENT, - `uid` varchar(250) DEFAULT NULL, - `display` int(1) DEFAULT '0', - `master` tinytext, - `master_id` int(8) DEFAULT NULL, - PRIMARY KEY (`id`), - UNIQUE KEY `author_uid_unique` (`uid`), - KEY `master_id` (`master_id`), - CONSTRAINT `Author_ibfk_1` FOREIGN KEY (`master_id`) REFERENCES `Author` (`id`) ON DELETE CASCADE ON UPDATE CASCADE -) ENGINE=InnoDB AUTO_INCREMENT=1427 DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; -SET FOREIGN_KEY_CHECKS=1; - --- --- Dumping data for table `Author` --- - -LOCK TABLES `Author` WRITE; -/*!40000 ALTER TABLE `Author` DISABLE KEYS */; -INSERT INTO `Author` VALUES (83,'SpinnerSimon',1,'SpinnerSimon',83),(84,'KounevSamuel',1,'KounevSamuel',84),(85,'ZhuXiaoyun',0,'ZhuXiaoyun',85),(86,'UysalMustafa',0,'UysalMustafa',86),(87,'GroendaHenning',0,'GroendaHenning',87),(88,'HuberMatthias',0,'HuberMatthias',88),(90,'Mueller-QuadeJoern',0,'Mueller-QuadeJoern',90),(117,'AvritzerAlberto',0,'AvritzerAlberto',117),(133,'KrogmannKlaus',0,'KrogmannKlaus',133),(137,'ZschalerSteffen',0,'ZschalerSteffen',137),(138,'BauerMarkus',0,'BauerMarkus',138),(156,'GortonIan',0,'GortonIan',156),(166,'KuperbergMichael',0,'KuperbergMichael',166),(176,'RentschlerAndreas',0,'RentschlerAndreas',176),(186,'KlattBenjamin',0,'KlattBenjamin',186),(189,'MirandolaRaffaela',0,'MirandolaRaffaela',189),(205,'HauckMichael',0,'HauckMichael',205),(218,'BenderKonstantin',0,'BenderKonstantin',218),(244,'BlomerJakob',0,'BlomerJakob',244),(245,'BrosigFabian',0,'BrosigFabian',245),(246,'KreidlerAndreas',0,'KreidlerAndreas',246),(247,'KuettelJens',0,'KuettelJens',247),(248,'KuwertzAchim',0,'KuwertzAchim',248),(249,'LiebelGrischa',0,'LiebelGrischa',249),(250,'PopovicDaniel',0,'PopovicDaniel',250),(251,'StuebsMichael',0,'StuebsMichael',251),(252,'TurekAlexander M.',0,'TurekAlexander M.',252),(253,'VogelChristian',0,'VogelChristian',253),(254,'WeinsteinThomas',0,'WeinsteinThomas',254),(255,'WurthThomas',0,'WurthThomas',255),(261,'VaupelRobert',0,'VaupelRobert',261),(276,'BroschFranz',0,'BroschFranz',276),(279,'RathfelderChristoph',0,'RathfelderChristoph',279),(280,'StammelJohannes',0,'StammelJohannes',280),(283,'HuberNikolaus',0,'HuberNikolaus',283),(284,'PaclatCharles',0,'PaclatCharles',284),(296,'ComuzziMarco',0,'ComuzziMarco',296),(297,'KotsokalisConstantinos',0,'KotsokalisConstantinos',297),(298,'TheilmannWolfgang',0,'TheilmannWolfgang',298),(299,'WinklerUlrich',0,'WinklerUlrich',299),(300,'ZaccoGabriele',0,'ZaccoGabriele',300),(301,'CortellessaVittorio',0,'CortellessaVittorio',301),(312,'DurdikZoya',0,'DurdikZoya',312),(327,'FaberMichael',0,'FaberMichael',327),(339,'FunkeDaniel',0,'FunkeDaniel',339),(351,'GillyKatja',0,'GillyKatja',351),(352,'NouRamon',0,'NouRamon',352),(353,'JuizCarlos',0,'JuizCarlos',353),(378,'MuellerRalph',0,'MuellerRalph',378),(381,'FriedrichHolger',0,'FriedrichHolger',381),(383,'SachsKai',0,'SachsKai',383),(389,'KlemsMarkus',0,'KlemsMarkus',389),(390,'PretschnerAlexander',0,'PretschnerAlexander',390),(391,'TaiStefan',0,'TaiStefan',391),(393,'FarahbodRoozbeh',0,'FarahbodRoozbeh',393),(400,'AmrehnErich',0,'AmrehnErich',400),(401,'HinkelGeorg',0,'HinkelGeorg',401),(402,'WeberAndreas',0,'WeberAndreas',402),(416,'BuresTomas',0,'BuresTomas',416),(418,'SchweflinghausJochen',0,'SchweflinghausJochen',418),(419,'DingleN.',0,'DingleN.',419),(420,'JoshiK.',0,'JoshiK.',420),(421,'vanHoornAndre',0,'vanHoornAndre',421),(422,'vonQuastMarcel',0,'vonQuastMarcel',422),(428,'JuseKai S.',0,'JuseKai S.',428),(429,'BuchmannAlejandro',0,'BuchmannAlejandro',429),(443,'KapitzaRuediger',0,'KapitzaRuediger',443),(444,'BehlJohannes',0,'BehlJohannes',444),(445,'CachinChristian',0,'CachinChristian',445),(446,'DistlerTobias',0,'DistlerTobias',446),(447,'KuhnleSimon',0,'KuhnleSimon',447),(448,'Schroeder-PreikschatWolfgang',0,'Schroeder-PreikschatWolfgang',448),(449,'StengelKlaus',0,'StengelKlaus',449),(458,'JezequelJean-Marc',0,'JezequelJean-Marc',458),(463,'OkamotoRussell',0,'OkamotoRussell',463),(464,'DutzChristofer',0,'DutzChristofer',464),(465,'NikolovKiril',0,'NikolovKiril',465),(466,'TorresJordi',0,'TorresJordi',466),(467,'ReineckePhilipp',0,'ReineckePhilipp',467),(469,'JoshiKaustubh',0,'JoshiKaustubh',469),(470,'BabkaVlastimil',0,'BabkaVlastimil',470),(471,'StefanekAnton',0,'StefanekAnton',471),(472,'GilmoreStephen',0,'GilmoreStephen',472),(473,'RizouStamatia',0,'RizouStamatia',473),(474,'AlexakisSpiros',0,'AlexakisSpiros',474),(475,'KourtesisDimitrios',0,'KourtesisDimitrios',475),(476,'PantelopoulosStelios',0,'PantelopoulosStelios',476),(477,'BaconJean',0,'BaconJean',477),(478,'MeierPhilipp',0,'MeierPhilipp',478),(479,'WeisBoern',0,'WeisBoern',479),(482,'NoorshamsQais',0,'NoorshamsQais',482),(485,'TumaPetr',0,'TumaPetr',485),(492,'HochwarthChristian',0,'HochwarthChristian',492),(493,'WertAlexander',0,'WertAlexander',493),(503,'LoeschManuel',0,'LoeschManuel',503),(504,'MuehlGero',0,'MuehlGero',504),(505,'SchroeterArnd',0,'SchroeterArnd',505),(506,'ParzyjeglaHelge',0,'ParzyjeglaHelge',506),(507,'RichlingJan',0,'RichlingJan',507),(508,'MartinecTomacs',0,'MartinecTomacs',508),(509,'MarekLukacs',0,'MarekLukacs',509),(510,'SteinhauserAntonin',0,'SteinhauserAntonin',510),(513,'MayerlChristian',0,'MayerlChristian',513),(516,'AbeckSebastian',0,'AbeckSebastian',516),(526,'IosupAlexandru',0,'IosupAlexandru',526),(527,'RygielskiPiotr',1,'RygielskiPiotr',527),(528,'DingJason',0,'DingJason',528),(529,'CirneWalfredo',0,'CirneWalfredo',529),(530,'RosenbergFlorian',0,'RosenbergFlorian',530),(531,'AntunesNuno',0,'AntunesNuno',531),(532,'VieiraMarco',0,'VieiraMarco',532),(533,'PayneBryan D.',0,'PayneBryan D.',533),(534,'VerdejoAdrian Juan',0,'VerdejoAdrian Juan',534),(538,'HallerbachIgnacio Perez',0,'HallerbachIgnacio Perez',538),(539,'NenovPlamen',0,'NenovPlamen',539),(540,'MihailovDimiter',0,'MihailovDimiter',540),(543,'BuschAxel',0,'BuschAxel',543),(544,'ReebRoland',0,'ReebRoland',544),(545,'BruhnDominik',0,'BruhnDominik',545),(546,'RostamiKiana',0,'RostamiKiana',546),(547,'JuliaFerran',0,'JuliaFerran',547),(554,'PietzuchPeter',0,'PietzuchPeter',554),(555,'EyersDavid',0,'EyersDavid',555),(556,'ShandBrian',0,'ShandBrian',556),(562,'BeckerStefan',0,'BeckerStefan',562),(563,'EvansDavid',0,'EvansDavid',563),(564,'FalconeGiovanni',0,'FalconeGiovanni',564),(567,'WerleDominik',0,'WerleDominik',567),(583,'AppelStefan',0,'AppelStefan',583),(584,'CarterMarc',0,'CarterMarc',584),(585,'SchusterThomas',0,'SchusterThomas',585),(586,'SchusterNelly',0,'SchusterNelly',586),(587,'NimisJens',0,'NimisJens',587),(591,'SPEC',1,'SPEC',591),(593,'GomezSergio Garcia',0,'GomezSergio Garcia',593),(594,'KennedyJohn',0,'KennedyJohn',594),(595,'LorenzoliDavide',0,'LorenzoliDavide',595),(596,'RoeblitzThomas',0,'RoeblitzThomas',596),(597,'ThomasNigel',0,'ThomasNigel',597),(598,'BradleyJeremy',0,'BradleyJeremy',598),(604,'MadeiraHenrique',0,'MadeiraHenrique',604),(620,'LiljaDavid J.',0,'LiljaDavid J.',620),(621,'PankratiusVictor',0,'PankratiusVictor',621),(628,'GorslerFabian',0,'GorslerFabian',628),(640,'SwiatekPawel',0,'SwiatekPawel',640),(641,'GrzechAdam',0,'GrzechAdam',641),(642,'JuszczyszynKrzysztof',0,'JuszczyszynKrzysztof',642),(643,'TomczakJakub',0,'TomczakJakub',643),(644,'GonczarekAdam',0,'GonczarekAdam',644),(645,'Juan-VerdejoAdrian',0,'Juan-VerdejoAdrian',645),(646,'SurajbaliBholanathsingh',0,'SurajbaliBholanathsingh',646),(651,'CasaleGiuliano',0,'CasaleGiuliano',651),(652,'SchneiderPhilipp',0,'SchneiderPhilipp',652),(653,'AhmedNadia',0,'AhmedNadia',653),(654,'NehmeierMarco',0,'NehmeierMarco',654),(655,'WolffvonGudenbergJuergen',0,'WolffvonGudenbergJuergen',655),(1085,'MommChristof',0,'MommChristof',1085),(1091,'HappeJens',0,'HappeJens',1091),(1097,'WestermannDennis',0,'WestermannDennis',1097),(1099,'HappeLucia',0,'HappeLucia',1099),(1107,'GoldschmidtThomas',0,'GoldschmidtThomas',1107),(1109,'KoziolekAnne',0,'KoziolekAnne',1109),(1115,'WalterJuergen',1,'WalterJuergen',1115),(1121,'HerbstNikolas',1,'HerbstNikolas',1121),(1125,'BeckerSteffen',0,'BeckerSteffen',1125),(1127,'KoziolekHeiko',0,'KoziolekHeiko',1127),(1137,'vonKistowskiJoakim',1,'vonKistowskiJoakim',1137),(1141,'ReussnerRalf',0,'ReussnerRalf',1141),(1143,'KrebsRouven',0,'KrebsRouven',1143),(1148,'OsmanRasha',0,'OsmanRasha',1148),(1149,'CouldenDavid',0,'CouldenDavid',1149),(1151,'KnottenbeltWilliam',0,'KnottenbeltWilliam',1151),(1152,'BulejLubomir',0,'BulejLubomir',1152),(1153,'LibicPeter',0,'LibicPeter',1153),(1154,'MarekLukas',0,'MarekLukas',1154),(1155,'MartinecTomas',0,'MartinecTomas',1155),(1156,'PodzimekAndrej',0,'PodzimekAndrej',1156),(1157,'AitArezki',0,'AitArezki',1157),(1158,'LallementPatrick',0,'LallementPatrick',1158),(1159,'HeimburgerFrank',0,'HeimburgerFrank',1159),(1160,'BellurUmesh',0,'BellurUmesh',1160),(1161,'ShirabateAkhilesh',0,'ShirabateAkhilesh',1161),(1162,'BauseFalko',0,'BauseFalko',1162),(1163,'KritzingerPieter S.',0,'KritzingerPieter S.',1163),(1164,'WenHung-We',0,'WenHung-We',1164),(1165,'FuLi-Chen',0,'FuLi-Chen',1165),(1166,'HuangShih-Shinh',0,'HuangShih-Shinh',1166),(1167,'BuchholzPeter',0,'BuchholzPeter',1167),(1168,'KemperPeter',0,'KemperPeter',1168),(1181,'HeimlichOliver',0,'HeimlichOliver',1181),(1183,'SiegelStefan',0,'SiegelStefan',1183),(1184,'TischlerGerman',0,'TischlerGerman',1184),(1185,'KnottenbeltWilliamJ.',0,'KnottenbeltWilliam',1151),(1186,'KnottenbeltWilliam J.',0,'KnottenbeltWilliam',1151),(1187,'WolffJuergen',0,'WolffvonGudenbergJuergen',655),(1188,'KapovaLucia',0,'KapovaLucia',1188),(1189,'MartensAnne',0,'MartensAnne',1189),(1190,'DennisWestermann',0,'DennisWestermann',1190),(1191,'RouvenKrebs',0,'RouvenKrebs',1191),(1192,'JensHappe',0,'JensHappe',1192),(1197,'ReussnerRalf H.',0,'ReussnerRalf',1141),(1198,'vonKistowskiJoakim Gunnarson',0,'vonKistowskiJoakim',1137),(1199,'HerbstNikolas Roman',0,'HerbstNikolas',1121),(1201,'LuLei',0,'LuLei',1201),(1202,'HollerAnne',0,'HollerAnne',1202),(1203,'GriffithRean',0,'GriffithRean',1203),(1204,'MehtaArpit',0,'MehtaArpit',1204),(1205,'ManuelRouven Krebs',0,'ManuelRouven Krebs',1205),(1208,'SiegelS.',0,'SiegelS.',1208),(1209,'BeckPhilip-Daniel',0,'BeckPhilip-Daniel',1209),(1210,'BawidamannUwe',0,'BawidamannUwe',1210),(1211,'BlockHansfried',0,'BlockHansfried',1211),(1212,'BeckettJohn',0,'BeckettJohn',1212),(1213,'LangeKlaus-Dieter',0,'LangeKlaus-Dieter',1213),(1214,'ArnoldJeremy A.',0,'ArnoldJeremy A.',1214),(1215,'HupplerKarl',0,'HupplerKarl',1215),(1216,'HenningJohn L.',0,'HenningJohn L.',1216),(1217,'CaoPaul',0,'CaoPaul',1217),(1220,'vonKistowskiJoakim Gunnarsson',0,'vonKistowskiJoakim',1137),(1222,'BohlenderG.',0,'BohlenderG.',1222),(1223,'KaucherE.',0,'KaucherE.',1223),(1224,'KlatteR.',0,'KlatteR.',1224),(1225,'KulischU.',0,'KulischU.',1225),(1226,'MirankerW. L.',0,'MirankerW. L.',1226),(1227,'UllrichCh.',0,'UllrichCh.',1227),(1229,'v.GudenbergJ. Wolff',0,'WolffvonGudenbergJuergen',655),(1230,'v.Gudenberg J. Wolff',0,'WolffvonGudenbergJuergen',655),(1231,'SamuelNikolaus HuberFabian',0,'SamuelNikolaus HuberFabian',1231),(1232,'BrzostowskiKrzysztof',0,'BrzostowskiKrzysztof',1232),(1233,'ZollerDaniel',0,'ZollerDaniel',1233),(1234,'HothoAndreas',0,'HothoAndreas',1234),(1235,'YavuzCan Alexander',0,'YavuzCan Alexander',1235),(1236,'SchottWaldemar',0,'SchottWaldemar',1236),(1237,'RattuDharminder',0,'RattuDharminder',1237),(1238,'HildebrandtAdrian',0,'HildebrandtAdrian',1238),(1240,'Tran-GiaPhuoc',0,'Tran-GiaPhuoc',1240),(1241,'CarvalhoDiogo',0,'CarvalhoDiogo',1241),(1246,'\'SwikatekPawel',0,'SwiatekPawel',640),(1247,'\'SwiatekPawel',0,'SwiatekPawel',640),(1248,'SwikatekPawel',0,'SwiatekPawel',640),(1249,'NehmeierM.',0,'NehmeierMarco',654),(1250,'BradleyJeremy T.',0,'BradleyJeremy',598),(1257,'MarekLukaecs',0,'MarekLukaecs',1257),(1258,'EismannSimon',0,'EismannSimon',1258),(1259,'Aleksandar Milenkoski',0,'Aleksandar Milenkoski',1259),(1261,'KephartJeffrey O.',0,'KephartJeffrey O.',1261),(1262,'KwiatkowskaMarta',0,'KwiatkowskaMarta',1262),(1263,'LangeStanislav',0,'LangeStanislav',1263),(1264,'GebertSteffen',0,'GebertSteffen',1264),(1265,'SpoerhaseJoachim',0,'SpoerhaseJoachim',1265),(1266,'ZinnerThomas',0,'ZinnerThomas',1266),(1267,'KusnadyEnrico',0,'KusnadyEnrico',1267),(1268,'MatershevEvgeny',0,'MatershevEvgeny',1268),(1269,'ZippFrederik',0,'ZippFrederik',1269),(1271,'KiesnerMaximilian',0,'KiesnerMaximilian',1271),(1273,'KrcmarHelmut',0,'KrcmarHelmut',1273),(1274,'WillneckerFelix',0,'WillneckerFelix',1274),(1275,'DlugiMarkus',0,'DlugiMarkus',1275),(1276,'BrunnertAndreas',0,'BrunnertAndreas',1276),(1277,'AvrtizerAlberto',0,'AvrtizerAlberto',1277),(1278,'GehringAndreas',0,'GehringAndreas',1278),(1280,'BaehrManuel',0,'BaehrManuel',1280),(1281,'DanciuAlexandru',0,'DanciuAlexandru',1281),(1282,'HasselbringWilhelm',0,'HasselbringWilhelm',1282),(1283,'HegerChristoph',0,'HegerChristoph',1283),(1284,'JamshidiPooyan',0,'JamshidiPooyan',1284),(1285,'JungReiner',0,'JungReiner',1285),(1286,'KrossJohannes',0,'KrossJohannes',1286),(1287,'VoegeleChristian',0,'VoegeleChristian',1287),(1288,'LuftMatthias',0,'LuftMatthias',1288),(1289,'JuergenAndrian HildebrandtSimon',0,'JuergenAndrian HildebrandtSimon',1289),(1292,'IfflaenderLukas',1,'IfflaenderLukas',1292),(1293,'IfflanderLukas',0,'IfflaenderLukas',1292),(1295,'IflaenderLukas',0,'IfflaenderLukas',1292),(1296,'IflanderLukas',0,'IfflaenderLukas',1292),(1297,'SimkoViliam',0,'SimkoViliam',1297),(1298,'SittnerFelix',0,'SittnerFelix',1298),(1299,'AschenbrennerDoris',0,'AschenbrennerDoris',1299),(1300,'SchillingKlaus',0,'SchillingKlaus',1300),(1301,'SpradlingCloyce',0,'SpradlingCloyce',1301),(1302,'OkanovicDusan',0,'OkanovicDusan',1302),(1303,'EmmerichRobert',0,'EmmerichRobert',1303),(1304,'DemlerJakob',0,'DemlerJakob',1304),(1305,'WangWeikun',0,'WangWeikun',1305),(1306,'SchreckMarco',0,'SchreckMarco',1306),(1307,'LeonhardtAlexander',0,'LeonhardtAlexander',1307),(1309,'GruenerK.',0,'GruenerK.',1309),(1310,'KraemerW.',0,'KraemerW.',1310),(1311,'RumpS. M.',0,'RumpS. M.',1311),(1312,'BoehmH.',0,'BoehmH.',1312),(1313,'UrlaubT.',0,'UrlaubT.',1313),(1314,'SeemannJ.',0,'SeemannJ.',1314),(1315,'KlingsporM.',0,'KlingsporM.',1315),(1316,'YakovlevA.',0,'YakovlevA.',1316),(1317,'MenzelB.',0,'MenzelB.',1317),(1318,'MirankerW.L.',0,'MirankerW.L.',1318),(1319,'SchumacherG.',0,'SchumacherG.',1319),(1320,'BambergerL.',0,'BambergerL.',1320),(1321,'FischerH.C.',0,'FischerH.C.',1321),(1322,'WinterD.',0,'WinterD.',1322),(1323,'ZoellnerA.',0,'ZoellnerA.',1323),(1324,'KleinW.',0,'KleinW.',1324),(1325,'ErlM.',0,'ErlM.',1325),(1326,'NeagaM.',0,'NeagaM.',1326),(1327,'LerchM.',0,'LerchM.',1327),(1328,'WiechertW.',0,'WiechertW.',1328),(1329,'CorlissG.',0,'CorlissG.',1329),(1330,'HuC.',0,'HuC.',1330),(1331,'KearfottB.',0,'KearfottB.',1331),(1332,'WalsterB.',0,'WalsterB.',1332),(1333,'KreinovichV.',0,'KreinovichV.',1333),(1334,'KollaR.',0,'KollaR.',1334),(1335,'VodopivecA.',0,'VodopivecA.',1335),(1336,'EichelbergerH.',0,'EichelbergerH.',1336),(1337,'TischlerG.',0,'TischlerG.',1337),(1338,'MayerG.',0,'MayerG.',1338),(1339,'HofschusterW.',0,'HofschusterW.',1339),(1340,'PuchanJ.',0,'PuchanJ.',1340),(1341,'StuckyW.',0,'StuckyW.',1341),(1342,'UllrichC.',0,'UllrichC.',1342),(1343,'RallL.B.',0,'RallL.B.',1343),(1344,'VoshchininA.P.',0,'VoshchininA.P.',1344),(1345,'LohnerR.',0,'LohnerR.',1345),(1346,'BrauneK.',0,'BrauneK.',1346),(1347,'GruenerW.',0,'GruenerW.',1347),(1348,'KirchnerR.',0,'KirchnerR.',1348),(1349,'FischerG.',0,'FischerG.',1349),(1350,'HopfnerM.',0,'HopfnerM.',1350),(1351,'SeipelD.',0,'SeipelD.',1351),(1352,'GruppF.',0,'GruppF.',1352),(1353,'WahlerV.',0,'WahlerV.',1353),(1354,'NiederleA.',0,'NiederleA.',1354),(1355,'EbnerM.',0,'EbnerM.',1355),(1356,'GlaserD.',0,'GlaserD.',1356),(1357,'LusiardiJ.',0,'LusiardiJ.',1357),(1358,'vonGudenbergJuergen Wolff',0,'WolffvonGudenbergJuergen',655),(1359,'KuesterMartin',0,'KuesterMartin',1359),(1360,'StierChristian',0,'StierChristian',1360),(1361,'MuellerChristoph',0,'MuellerChristoph',1361),(1362,'ExampleJohny',0,'ExampleJohny',1362),(1363,'KatzenbergerVera',0,'KatzenbergerVera',1363),(1364,'DürandDieter',0,'DürandDieter',1364),(1365,'DuerandDieter',0,'DuerandDieter',1365),(1366,'OikonomouGiorgos',0,'OikonomouGiorgos',1366),(1367,'KousiourisGeorge',0,'KousiourisGeorge',1367),(1368,'EvangelinouAthanasia',0,'EvangelinouAthanasia',1368),(1369,'Main-Echo',0,'Main-Echo',1369),(1370,'Main-Post',0,'Main-Post',1370),(1371,'StollJonathan',0,'StollJonathan',1371),(1372,'JaegerBernd',0,'JaegerBernd',1372),(1373,'RainaKapil',0,'RainaKapil',1373),(1374,'HarrisMason',0,'HarrisMason',1374),(1375,'ChaudhrySaif',0,'ChaudhrySaif',1375),(1376,'ChasiriSivadon',0,'ChasiriSivadon',1376),(1377,'DavidVeronica',0,'DavidVeronica',1377),(1378,'LiuWenmao',0,'LiuWenmao',1378),(1379,'ChaudhuriAbhik',0,'ChaudhuriAbhik',1379),(1380,'FerrerHeberto',0,'FerrerHeberto',1380),(1381,'PrafullchandraHemma',0,'PrafullchandraHemma',1381),(1382,'SherryJ.D.',0,'SherryJ.D.',1382),(1383,'NgKelvin',0,'NgKelvin',1383),(1384,'GeXiaoyu',0,'GeXiaoyu',1384),(1385,'SingYao',0,'SingYao',1385),(1386,'PorYiak',0,'PorYiak',1386),(1389,'MilenkoskiAleksandar',1,'MilenkoskiAleksandar',1389),(1390,'Contributor)Aleksandar Milenkoski (Minor',0,'MilenkoskiAleksandar',1389),(1391,'einBLICK(Vera',0,'einBLICK(Vera',1391),(1392,'InformationsdienstRobert Emmerich',0,'InformationsdienstRobert Emmerich',1392),(1393,'DuerandWirtschaftswoche (Dieter',0,'DuerandWirtschaftswoche (Dieter',1393),(1394,'WirtschaftswocheDieter Duerand',0,'WirtschaftswocheDieter Duerand',1394),(1395,'Wirtschaftswoche(Dieter Duerand',0,'Wirtschaftswoche(Dieter Duerand',1395),(1396,'DuerandWirtschaftswoche Dieter',0,'DuerandWirtschaftswoche Dieter',1396),(1397,'DieterWirtschaftswoche',0,'DieterWirtschaftswoche',1397),(1398,'(DieterWirtschaftswoche',0,'(DieterWirtschaftswoche',1398),(1399,'einBLICK(Robert',0,'einBLICK(Robert',1399),(1400,'Emmerich)Informationsdienst Wissenschaft (Robert',0,'Emmerich)Informationsdienst Wissenschaft (Robert',1400),(1401,'RadioBayern 2',0,'RadioBayern 2',1401),(1402,'Bayern 2',0,'Bayern 2',1402),(1403,'ThieleChristoph',0,'ThieleChristoph',1403),(1404,'SimonXiaoyun Zhu Lei Lu Mustafa Uysal Anne Holler Rean Griffith Pradeep PadalaSamuel',0,'SimonXiaoyun Zhu Lei Lu Mustafa Uysal Anne Holler Rean Griffith Pradeep PadalaSamuel',1404),(1405,'PadalaPradeep',0,'PadalaPradeep',1405),(1406,'RundschauBayrischer Rundfunk -',0,'RundschauBayrischer Rundfunk -',1406),(1407,'SamuelPhilipp Meier Steffen Becker Anne Koziolek Heiko KoziolekFabian',0,'SamuelPhilipp Meier Steffen Becker Anne Koziolek Heiko KoziolekFabian',1407),(1408,'MularzDiane E.',0,'MularzDiane E.',1408),(1409,'CurtissJonathan A.',0,'CurtissJonathan A.',1409),(1410,'DingJason J.',0,'DingJason J.',1410),(1412,'Editor)Aleksandar Milenkoski (Assistant',0,'MilenkoskiAleksandar',1389),(1413,'Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski',0,'Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski',1413),(1414,'JayaramK. R.',0,'JayaramK. R.',1414),(1415,'MaggioMartina',0,'MaggioMartina',1415),(1416,'SmirniEvgenia',0,'SmirniEvgenia',1416),(1417,'AminAyman',0,'AminAyman',1417),(1418,'AndrzejakArtur',0,'AndrzejakArtur',1418),(1419,'GrunskeLars',0,'GrunskeLars',1419),(1420,'MengshoelOle J.',0,'MengshoelOle J.',1420),(1421,'SundararajanPriya',0,'SundararajanPriya',1421),(1422,'ForschungsquartettDetektorFM -',0,'ForschungsquartettDetektorFM -',1422),(1423,'Uniserv',0,'Uniserv',1423),(1424,'EinBLICK',0,'EinBLICK',1424),(1425,'Rechenzentrum Universität Würzbugr',0,'Rechenzentrum Universität Würzbugr',1425),(1426,'Rechenzentrum Universitaet Wuerzbug',0,'Rechenzentrum Universitaet Wuerzbug',1426); -/*!40000 ALTER TABLE `Author` ENABLE KEYS */; -UNLOCK TABLES; - --- --- Table structure for table `Author_to_Team` --- - -DROP TABLE IF EXISTS `Author_to_Team`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `Author_to_Team` ( - `author_id` int(11) NOT NULL DEFAULT '0', - `team_id` int(11) NOT NULL DEFAULT '0', - `start` int(11) DEFAULT '0', - `stop` int(11) DEFAULT '0', - PRIMARY KEY (`author_id`,`team_id`), - KEY `team_id` (`team_id`), - CONSTRAINT `Author_to_Team_ibfk_1` FOREIGN KEY (`author_id`) REFERENCES `Author` (`master_id`) ON DELETE CASCADE ON UPDATE CASCADE, - CONSTRAINT `Author_to_Team_ibfk_2` FOREIGN KEY (`team_id`) REFERENCES `Team` (`id`) ON DELETE CASCADE ON UPDATE CASCADE -) ENGINE=InnoDB DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - --- --- Dumping data for table `Author_to_Team` --- - -LOCK TABLES `Author_to_Team` WRITE; -/*!40000 ALTER TABLE `Author_to_Team` DISABLE KEYS */; -INSERT INTO `Author_to_Team` VALUES (58,4,2013,0),(58,6,2011,2013),(72,6,0,0),(83,1,0,0),(83,6,0,0),(84,1,0,0),(84,6,0,0),(218,4,0,0),(218,6,0,0),(245,1,0,2015),(245,6,0,0),(279,1,0,2014),(279,6,0,2013),(283,1,0,2015),(283,6,0,0),(327,4,2013,0),(327,6,2011,2012),(383,4,2012,0),(383,6,0,2011),(478,6,0,0),(482,6,0,2015),(527,1,2013,0),(527,3,0,2012),(527,6,2013,0),(628,6,0,0),(654,1,0,0),(1115,1,2013,0),(1115,6,2013,0),(1121,1,0,0),(1121,6,0,0),(1137,1,0,0),(1137,6,0,0),(1143,1,0,2015),(1143,6,0,2015),(1292,1,2015,0),(1389,1,0,0),(1389,6,0,0); -/*!40000 ALTER TABLE `Author_to_Team` ENABLE KEYS */; -UNLOCK TABLES; - --- --- Table structure for table `Cron` --- - -DROP TABLE IF EXISTS `Cron`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `Cron` ( - `type` int(11) NOT NULL, - `last_run_time` timestamp NOT NULL DEFAULT CURRENT_TIMESTAMP, - PRIMARY KEY (`type`) -) ENGINE=InnoDB DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - --- --- Dumping data for table `Cron` --- - -LOCK TABLES `Cron` WRITE; -/*!40000 ALTER TABLE `Cron` DISABLE KEYS */; -INSERT INTO `Cron` VALUES (0,'2016-06-12 18:00:01'),(1,'2016-06-12 00:00:02'),(2,'2016-06-12 00:05:01'),(3,'2016-05-31 09:09:00'); -/*!40000 ALTER TABLE `Cron` ENABLE KEYS */; -UNLOCK TABLES; - --- --- Table structure for table `Entry` --- - -DROP TABLE IF EXISTS `Entry`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `Entry` ( - `id` int(8) NOT NULL AUTO_INCREMENT, - `entry_type` enum('paper','talk') NOT NULL, - `bibtex_key` varchar(250) DEFAULT NULL, - `bibtex_type` varchar(50) DEFAULT NULL, - `bib` text, - `html` text, - `html_bib` text, - `abstract` text, - `title` text, - `hidden` tinyint(3) unsigned DEFAULT '0', - `month` tinyint(3) unsigned DEFAULT '0', - `year` int(4) DEFAULT NULL, - `sort_month` smallint(5) unsigned DEFAULT '0', - `teams_str` text, - `people_str` text, - `tags_str` text, - `creation_time` timestamp NOT NULL DEFAULT '0000-00-00 00:00:00', - `modified_time` timestamp NOT NULL DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP, - `need_html_regen` int(11) DEFAULT '1', - PRIMARY KEY (`id`), - UNIQUE KEY `bibtex_key` (`bibtex_key`), - KEY `idx_bibtex_key` (`bibtex_key`) -) ENGINE=InnoDB AUTO_INCREMENT=1118 DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - --- --- Dumping data for table `Entry` --- - -LOCK TABLES `Entry` WRITE; -/*!40000 ALTER TABLE `Entry` DISABLE KEYS */; -INSERT INTO `Entry` VALUES (1,'paper','SpKoZhUy2013-mrt-TowardsModelExtraction','inproceedings','@inproceedings{SpKoZhUy2013-mrt-TowardsModelExtraction,\n author = {Simon Spinner and Samuel Kounev and Xiaoyun Zhu and Mustafa Uysal},\n title = {{Towards Online Performance Model Extraction in Virtualized Environments}},\n editor = {Nelly Bencomo and Robert France and Sebastian G\\\"{o}tz and Bernhard Rumpe},\n pages = {89--95},\n publisher = {CEUR-WS},\n titleaddon = {(Position Paper)},\n booktitle = {Proceedings of the 8th Workshop on Models @ Run.time (MRT 2013) co-located with ACM/IEEE 16th International Conference on Model Driven Engineering Languages and Systems (MODELS 2013)},\n location = {Miami, Florida, USA},\n url = {http://ceur-ws.org/Vol-1079/mrt13_submission_4.pdf},\n day = {29},\n month = {Sept},\n year = {2013},\n abstract = {Virtualization increases the complexity and dynamics of modern software architectures making it a major challenge to manage the end-to-end performance of applications. Architecture-level performance models can help here as they provide the modeling power and analysis fexibility to predict the performance behavior of applications under varying workloads and configurations. However, the construction of such models is a complex and time-consuming task. In this position paper, we discuss how the existing concept of virtual appliances can be extended to automate the extraction of architecture-level performance models during system operation.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1.pdf},\n}\n\n','\n\nSimon Spinner, Samuel Kounev, Xiaoyun Zhu, and Mustafa Uysal.\nTowards Online Performance Model Extraction in Virtualized\nEnvironments (position paper).\nIn Proceedings of the 8th Workshop on Models @ Run.time (MRT\n2013) co-located with ACM/IEEE 16th International Conference on Model Driven\nEngineering Languages and Systems (MODELS 2013), Nelly Bencomo, Robert\nFrance, Sebastian Götz, and Bernhard Rumpe, editors, Miami, Florida, USA,\nSept 29, 2013, pages 89-95. CEUR-WS.\nSept 2013.\n[ bib | .pdf | .pdf | Abstract  ] 
\n@inproceedings{SpKoZhUy2013-mrt-TowardsModelExtraction,\nauthor = {Simon Spinner and Samuel Kounev and Xiaoyun Zhu and Mustafa Uysal},\ntitle = {{Towards Online Performance Model Extraction in Virtualized Environments}},\neditor = {Nelly Bencomo and Robert France and Sebastian G\\\"{o}tz and Bernhard Rumpe},\npages = {89--95},\npublisher = {CEUR-WS},\ntitleaddon = {(Position Paper)},\nbooktitle = {Proceedings of the 8th Workshop on Models @ Run.time (MRT 2013) co-located with ACM/IEEE 16th International Conference on Model Driven Engineering Languages and Systems (MODELS 2013)},\nlocation = {Miami, Florida, USA},\nurl = {http://ceur-ws.org/Vol-1079/mrt13_submission_4.pdf},\nday = {29},\nmonth = {Sept},\nyear = {2013},\nabstract = {Virtualization increases the complexity and dynamics of modern software architectures making it a major challenge to manage the end-to-end performance of applications. Architecture-level performance models can help here as they provide the modeling power and analysis fexibility to predict the performance behavior of applications under varying workloads and configurations. However, the construction of such models is a complex and time-consuming task. In this position paper, we discuss how the existing concept of virtual appliances can be extended to automate the extraction of architecture-level performance models during system operation.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1.pdf}\n}\n
\n
\nVirtualization increases the complexity and dynamics of modern software architectures making it a major challenge to manage the end-to-end performance of applications. Architecture-level performance models can help here as they provide the modeling power and analysis fexibility to predict the performance behavior of applications under varying workloads and configurations. However, the construction of such models is a complex and time-consuming task. In this position paper, we discuss how the existing concept of virtual appliances can be extended to automate the extraction of architecture-level performance models during system operation.\n
\n','
\n@inproceedings{SpKoZhUy2013-mrt-TowardsModelExtraction,\n  author = {Simon Spinner and Samuel Kounev and Xiaoyun Zhu and Mustafa Uysal},\n  title = {{Towards Online Performance Model Extraction in Virtualized Environments}},\n  editor = {Nelly Bencomo and Robert France and Sebastian G\\\"{o}tz and Bernhard Rumpe},\n  pages = {89--95},\n  publisher = {CEUR-WS},\n  titleaddon = {(Position Paper)},\n  booktitle = {Proceedings of the 8th Workshop on Models @ Run.time (MRT 2013) co-located with ACM/IEEE 16th International Conference on Model Driven Engineering Languages and Systems (MODELS 2013)},\n  location = {Miami, Florida, USA},\n  url = {http://ceur-ws.org/Vol-1079/mrt13_submission_4.pdf},\n  day = {29},\n  month = {Sept},\n  year = {2013},\n  abstract = {Virtualization increases the complexity and dynamics of modern software architectures making it a major challenge to manage the end-to-end performance of applications. Architecture-level performance models can help here as they provide the modeling power and analysis fexibility to predict the performance behavior of applications under varying workloads and configurations. However, the construction of such models is a complex and time-consuming task. In this position paper, we discuss how the existing concept of virtual appliances can be extended to automate the extraction of architecture-level performance models during system operation.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1.pdf}\n}\n
\n\n','Virtualization increases the complexity and dynamics of modern software architectures making it a major challenge to manage the end-to-end performance of applications. Architecture-level performance models can help here as they provide the modeling power and analysis fexibility to predict the performance behavior of applications under varying workloads and configurations. However, the construction of such models is a complex and time-consuming task. In this position paper, we discuss how the existing concept of virtual appliances can be extended to automate the extraction of architecture-level performance models during system operation.','{Towards Online Performance Model Extraction in Virtualized Environments}',0,9,2013,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(61,'paper','bender2010','mastersthesis','@mastersthesis{bender2010,\n address = {Karlsruhe, Germany},\n author = {Konstantin Bender},\n month = {May},\n school = {Karlsruhe Institute of Technology, Karlsruhe, Germany},\n title = {{Automated Performance Model Extraction of Enterprise Data Fabrics}},\n year = {2010},\n}\n\n','\n\nKonstantin Bender.\nAutomated Performance Model Extraction of Enterprise Data Fabrics.\nMaster\'s thesis, Karlsruhe Institute of Technology, Karlsruhe,\nGermany, Karlsruhe, Germany, May 2010.\n[ bib  ] 
\n@mastersthesis{bender2010,\naddress = {Karlsruhe, Germany},\nauthor = {Konstantin Bender},\nmonth = {May},\nschool = {Karlsruhe Institute of Technology, Karlsruhe, Germany},\ntitle = {{Automated Performance Model Extraction of Enterprise Data Fabrics}},\nyear = {2010}\n}\n
\n
\n','
\n@mastersthesis{bender2010,\n  address = {Karlsruhe, Germany},\n  author = {Konstantin Bender},\n  month = {May},\n  school = {Karlsruhe Institute of Technology, Karlsruhe, Germany},\n  title = {{Automated Performance Model Extraction of Enterprise Data Fabrics}},\n  year = {2010}\n}\n
\n\n',NULL,'{Automated Performance Model Extraction of Enterprise Data Fabrics}',0,5,2010,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(65,'paper','groenda2008c','techreport','@techreport{groenda2008c,\n abstract = {Systematische Qualit\\\"{a}tssicherung gewinnt im Rahmen des globalenWettbewerbs auch in der Software-Entwicklungsbranche zunehmend an Bedeutung. Vor allem auf dem Weg zur Software-Industrialisierung bzw. zu einer ingenieurm\\\"{a}ss{}igen Software-Entwicklung ist eine durchg\\\"{a}ngige Qualit\\\"{a}tssicherung unabdingbar. Zertifizierungen bieten hierbei die M\\\"{o}glichkeit, die Einhaltung bestimmter Standards und Kriterien durch unabh\\\"{a}ngige Dritte \\\"{u}berpr\\\"{u}fen und bescheinigen zu lassen, um die Qualit\\\"{a}t eines Produktes oder Entwicklungsprozesses zu belegen. Zertifizierungen k\\\"{o}nnen sich sowohl auf Produkte und Prozesse als auch auf die Ausbildung und das Wissen von Einzelpersonen beziehen. Da Zertifikate durch unabh\\\"{a}ngige Pr\\\"{u}finstanzen ausgestellt werden, wird Zertifikaten und deren \\\"{u}berpr\\\"{u}fbaren Aussagen im Allgemeinen ein deutlich h\\\"{o}heres Vertrauen entgegengebracht als Qualit\\\"{a}tsversprechen von Software-Herstellern selbst. Unternehmen, die ihre Prozesse beispielsweise nach CMMI zertifizieren lassen, k\\\"{o}nnen damit ihre F\\\"{a}higkeiten unter Beweis stellen, Projekte erfolgreich und mit vorhersagbarer Qualit\\\"{a}t abschlie{ss}en zu k\\\"{o}nnen. Neben dem Nachweis entsprechender Zertifikate als Diversifikationsmerkmal gegen\\\"{u}ber Mitbewerbern k\\\"{o}nnen Zertifikate \\\"{u}ber die Einhaltung von Standards auch durch den Gesetzgeber vorgeschrieben werden. Ein Beispiel hierf\\\"{u}r sind Zertifikate aus Hochsicherheitsbereichen wie Atomkraftwerken. Das Seminar wurde wie eine wissenschaftliche Konferenz organisiert: Die Einreichungen wurden in einem zweistufigen Peer-Review-Verfahren begutachtet. In der ersten Stufe wurde eine Begutachtung der studentischen Arbeiten durch Kommilitonen durchgef\\\"{u}hrt, in der zweiten Stufe eine Begutachtung durch die Betreuer. In verschiedenen Sessions wurden die Artikel an zwei Konferenztagen pr\\\"{a}sentiert. Die besten Beitr\\\"{a}ge wurden durch best paper awards ausgezeichnet. Diese gingen an Fabian Brosig f\\\"{u}r seine Arbeit Cost Benefit Analysis Method (CBAM), an Jakob Blomer f\\\"{u}r die Arbeit Zertifizierung von Softwarebenchmarks und an Grischa Liebel f\\\"{u}r die Arbeit SWT - Das Standard Widget Toolkit, denen hiermit noch einmal herzlich zu dieser herausragenden Leistung gratuliert wird. Erg\\\"{a}nzend zu den Vortr\\\"{a}gen der Seminarteilnehmer wurde ein eingeladener Vortrag gehalten. Herr Dr. Dirk Feuerhelm von der 1&1 Internet AG gab dabei dankenswerterweise in seinem Vortrag mit dem Thema Softskills -- Ist das objektorientiert oder modellgetrieben? einen Einblick in die Aufgaben als Leiter der Software-Entwicklung},\n author = {Jakob Blomer and Fabian Brosig and Andreas Kreidler and Jens K{\"u}ttel and Achim Kuwertz and Grischa Liebel and Daniel Popovic and Michael St{\"u}bs and Alexander M. Turek and Christian Vogel and Thomas Weinstein and Thomas Wurth},\n editor = {Thomas Goldschmidt and Henning Groenda and Klaus Krogmann and Michael Kuperberg and Anne Martens and Christoph Rathfelder and Ralf Reussner and Johannes Stammel},\n institution = {Universit\\\"{a}t Karlsruhe, Fakult\\\"{a}t f\\\"{u}r Informatik},\n language = {ger},\n location = {Karlsruhe},\n number = {4/2008},\n title = {{S}oftware {Z}ertifizierung},\n year = {2008},\n}\n\n','\n\nJakob Blomer, Fabian Brosig, Andreas Kreidler, Jens K\"uttel, Achim Kuwertz,\nGrischa Liebel, Daniel Popovic, Michael St\"ubs, Alexander M. Turek,\nChristian Vogel, Thomas Weinstein, and Thomas Wurth.\nSoftware Zertifizierung.\nTechnical Report 4/2008, Universität Karlsruhe, Fakultät\nfür Informatik, 2008.\n[ bib | Abstract  ] 
\n@techreport{groenda2008c,\nabstract = {Systematische Qualit\\\"{a}tssicherung gewinnt im Rahmen des globalenWettbewerbs auch in der Software-Entwicklungsbranche zunehmend an Bedeutung. Vor allem auf dem Weg zur Software-Industrialisierung bzw. zu einer ingenieurm\\\"{a}ss{}igen Software-Entwicklung ist eine durchg\\\"{a}ngige Qualit\\\"{a}tssicherung unabdingbar. Zertifizierungen bieten hierbei die M\\\"{o}glichkeit, die Einhaltung bestimmter Standards und Kriterien durch unabh\\\"{a}ngige Dritte \\\"{u}berpr\\\"{u}fen und bescheinigen zu lassen, um die Qualit\\\"{a}t eines Produktes oder Entwicklungsprozesses zu belegen. Zertifizierungen k\\\"{o}nnen sich sowohl auf Produkte und Prozesse als auch auf die Ausbildung und das Wissen von Einzelpersonen beziehen. Da Zertifikate durch unabh\\\"{a}ngige Pr\\\"{u}finstanzen ausgestellt werden, wird Zertifikaten und deren \\\"{u}berpr\\\"{u}fbaren Aussagen im Allgemeinen ein deutlich h\\\"{o}heres Vertrauen entgegengebracht als Qualit\\\"{a}tsversprechen von Software-Herstellern selbst. Unternehmen, die ihre Prozesse beispielsweise nach CMMI zertifizieren lassen, k\\\"{o}nnen damit ihre F\\\"{a}higkeiten unter Beweis stellen, Projekte erfolgreich und mit vorhersagbarer Qualit\\\"{a}t abschlie{ss}en zu k\\\"{o}nnen. Neben dem Nachweis entsprechender Zertifikate als Diversifikationsmerkmal gegen\\\"{u}ber Mitbewerbern k\\\"{o}nnen Zertifikate \\\"{u}ber die Einhaltung von Standards auch durch den Gesetzgeber vorgeschrieben werden. Ein Beispiel hierf\\\"{u}r sind Zertifikate aus Hochsicherheitsbereichen wie Atomkraftwerken. Das Seminar wurde wie eine wissenschaftliche Konferenz organisiert: Die Einreichungen wurden in einem zweistufigen Peer-Review-Verfahren begutachtet. In der ersten Stufe wurde eine Begutachtung der studentischen Arbeiten durch Kommilitonen durchgef\\\"{u}hrt, in der zweiten Stufe eine Begutachtung durch die Betreuer. In verschiedenen Sessions wurden die Artikel an zwei Konferenztagen pr\\\"{a}sentiert. Die besten Beitr\\\"{a}ge wurden durch best paper awards ausgezeichnet. Diese gingen an Fabian Brosig f\\\"{u}r seine Arbeit Cost Benefit Analysis Method (CBAM), an Jakob Blomer f\\\"{u}r die Arbeit Zertifizierung von Softwarebenchmarks und an Grischa Liebel f\\\"{u}r die Arbeit SWT - Das Standard Widget Toolkit, denen hiermit noch einmal herzlich zu dieser herausragenden Leistung gratuliert wird. Erg\\\"{a}nzend zu den Vortr\\\"{a}gen der Seminarteilnehmer wurde ein eingeladener Vortrag gehalten. Herr Dr. Dirk Feuerhelm von der 1&1 Internet AG gab dabei dankenswerterweise in seinem Vortrag mit dem Thema Softskills -- Ist das objektorientiert oder modellgetrieben? einen Einblick in die Aufgaben als Leiter der Software-Entwicklung},\nauthor = {Jakob Blomer and Fabian Brosig and Andreas Kreidler and Jens K{\"u}ttel and Achim Kuwertz and Grischa Liebel and Daniel Popovic and Michael St{\"u}bs and Alexander M. Turek and Christian Vogel and Thomas Weinstein and Thomas Wurth},\neditor = {Thomas Goldschmidt and Henning Groenda and Klaus Krogmann and Michael Kuperberg and Anne Martens and Christoph Rathfelder and Ralf Reussner and Johannes Stammel},\ninstitution = {Universit\\\"{a}t Karlsruhe, Fakult\\\"{a}t f\\\"{u}r Informatik},\nlanguage = {ger},\nlocation = {Karlsruhe},\nnumber = {4/2008},\ntitle = {{S}oftware {Z}ertifizierung},\nyear = {2008}\n}\n
\n
\nSystematische Qualitätssicherung gewinnt im Rahmen des globalenWettbewerbs auch in der Software-Entwicklungsbranche zunehmend an Bedeutung. Vor allem auf dem Weg zur Software-Industrialisierung bzw. zu einer ingenieurmässigen Software-Entwicklung ist eine durchgängige Qualitätssicherung unabdingbar. Zertifizierungen bieten hierbei die Möglichkeit, die Einhaltung bestimmter Standards und Kriterien durch unabhängige Dritte überprüfen und bescheinigen zu lassen, um die Qualität eines Produktes oder Entwicklungsprozesses zu belegen. Zertifizierungen können sich sowohl auf Produkte und Prozesse als auch auf die Ausbildung und das Wissen von Einzelpersonen beziehen. Da Zertifikate durch unabhängige Prüfinstanzen ausgestellt werden, wird Zertifikaten und deren überprüfbaren Aussagen im Allgemeinen ein deutlich höheres Vertrauen entgegengebracht als Qualitätsversprechen von Software-Herstellern selbst. Unternehmen, die ihre Prozesse beispielsweise nach CMMI zertifizieren lassen, können damit ihre Fähigkeiten unter Beweis stellen, Projekte erfolgreich und mit vorhersagbarer Qualität abschliessen zu können. Neben dem Nachweis entsprechender Zertifikate als Diversifikationsmerkmal gegenüber Mitbewerbern können Zertifikate über die Einhaltung von Standards auch durch den Gesetzgeber vorgeschrieben werden. Ein Beispiel hierfür sind Zertifikate aus Hochsicherheitsbereichen wie Atomkraftwerken. Das Seminar wurde wie eine wissenschaftliche Konferenz organisiert: Die Einreichungen wurden in einem zweistufigen Peer-Review-Verfahren begutachtet. In der ersten Stufe wurde eine Begutachtung der studentischen Arbeiten durch Kommilitonen durchgeführt, in der zweiten Stufe eine Begutachtung durch die Betreuer. In verschiedenen Sessions wurden die Artikel an zwei Konferenztagen präsentiert. Die besten Beiträge wurden durch best paper awards ausgezeichnet. Diese gingen an Fabian Brosig für seine Arbeit Cost Benefit Analysis Method (CBAM), an Jakob Blomer für die Arbeit Zertifizierung von Softwarebenchmarks und an Grischa Liebel für die Arbeit SWT - Das Standard Widget Toolkit, denen hiermit noch einmal herzlich zu dieser herausragenden Leistung gratuliert wird. Ergänzend zu den Vorträgen der Seminarteilnehmer wurde ein eingeladener Vortrag gehalten. Herr Dr. Dirk Feuerhelm von der 1&1 Internet AG gab dabei dankenswerterweise in seinem Vortrag mit dem Thema Softskills - Ist das objektorientiert oder modellgetrieben? einen Einblick in die Aufgaben als Leiter der Software-Entwicklung\n
\n','
\n@techreport{groenda2008c,\n  abstract = {Systematische Qualit\\\"{a}tssicherung gewinnt im Rahmen des globalenWettbewerbs auch in der Software-Entwicklungsbranche zunehmend an Bedeutung. Vor allem auf dem Weg zur Software-Industrialisierung bzw. zu einer ingenieurm\\\"{a}ss{}igen Software-Entwicklung ist eine durchg\\\"{a}ngige Qualit\\\"{a}tssicherung unabdingbar. Zertifizierungen bieten hierbei die M\\\"{o}glichkeit, die Einhaltung bestimmter Standards und Kriterien durch unabh\\\"{a}ngige Dritte \\\"{u}berpr\\\"{u}fen und bescheinigen zu lassen, um die Qualit\\\"{a}t eines Produktes oder Entwicklungsprozesses zu belegen. Zertifizierungen k\\\"{o}nnen sich sowohl auf Produkte und Prozesse als auch auf die Ausbildung und das Wissen von Einzelpersonen beziehen. Da Zertifikate durch unabh\\\"{a}ngige Pr\\\"{u}finstanzen ausgestellt werden, wird Zertifikaten und deren \\\"{u}berpr\\\"{u}fbaren Aussagen im Allgemeinen ein deutlich h\\\"{o}heres Vertrauen entgegengebracht als Qualit\\\"{a}tsversprechen von Software-Herstellern selbst. Unternehmen, die ihre Prozesse beispielsweise nach CMMI zertifizieren lassen, k\\\"{o}nnen damit ihre F\\\"{a}higkeiten unter Beweis stellen, Projekte erfolgreich und mit vorhersagbarer Qualit\\\"{a}t abschlie{ss}en zu k\\\"{o}nnen. Neben dem Nachweis entsprechender Zertifikate als Diversifikationsmerkmal gegen\\\"{u}ber Mitbewerbern k\\\"{o}nnen Zertifikate \\\"{u}ber die Einhaltung von Standards auch durch den Gesetzgeber vorgeschrieben werden. Ein Beispiel hierf\\\"{u}r sind Zertifikate aus Hochsicherheitsbereichen wie Atomkraftwerken. Das Seminar wurde wie eine wissenschaftliche Konferenz organisiert: Die Einreichungen wurden in einem zweistufigen Peer-Review-Verfahren begutachtet. In der ersten Stufe wurde eine Begutachtung der studentischen Arbeiten durch Kommilitonen durchgef\\\"{u}hrt, in der zweiten Stufe eine Begutachtung durch die Betreuer. In verschiedenen Sessions wurden die Artikel an zwei Konferenztagen pr\\\"{a}sentiert. Die besten Beitr\\\"{a}ge wurden durch best paper awards ausgezeichnet. Diese gingen an Fabian Brosig f\\\"{u}r seine Arbeit Cost Benefit Analysis Method (CBAM), an Jakob Blomer f\\\"{u}r die Arbeit Zertifizierung von Softwarebenchmarks und an Grischa Liebel f\\\"{u}r die Arbeit SWT - Das Standard Widget Toolkit, denen hiermit noch einmal herzlich zu dieser herausragenden Leistung gratuliert wird. Erg\\\"{a}nzend zu den Vortr\\\"{a}gen der Seminarteilnehmer wurde ein eingeladener Vortrag gehalten. Herr Dr. Dirk Feuerhelm von der 1&1 Internet AG gab dabei dankenswerterweise in seinem Vortrag mit dem Thema Softskills -- Ist das objektorientiert oder modellgetrieben? einen Einblick in die Aufgaben als Leiter der Software-Entwicklung},\n  author = {Jakob Blomer and Fabian Brosig and Andreas Kreidler and Jens K{\"u}ttel and Achim Kuwertz and Grischa Liebel and Daniel Popovic and Michael St{\"u}bs and Alexander M. Turek and Christian Vogel and Thomas Weinstein and Thomas Wurth},\n  editor = {Thomas Goldschmidt and Henning Groenda and Klaus Krogmann and Michael Kuperberg and Anne Martens and Christoph Rathfelder and Ralf Reussner and Johannes Stammel},\n  institution = {Universit\\\"{a}t Karlsruhe, Fakult\\\"{a}t f\\\"{u}r Informatik},\n  language = {ger},\n  location = {Karlsruhe},\n  number = {4/2008},\n  title = {{S}oftware {Z}ertifizierung},\n  year = {2008}\n}\n
\n\n','Systematische Qualit\\\"{a}tssicherung gewinnt im Rahmen des globalenWettbewerbs auch in der Software-Entwicklungsbranche zunehmend an Bedeutung. Vor allem auf dem Weg zur Software-Industrialisierung bzw. zu einer ingenieurm\\\"{a}ss{}igen Software-Entwicklung ist eine durchg\\\"{a}ngige Qualit\\\"{a}tssicherung unabdingbar. Zertifizierungen bieten hierbei die M\\\"{o}glichkeit, die Einhaltung bestimmter Standards und Kriterien durch unabh\\\"{a}ngige Dritte \\\"{u}berpr\\\"{u}fen und bescheinigen zu lassen, um die Qualit\\\"{a}t eines Produktes oder Entwicklungsprozesses zu belegen. Zertifizierungen k\\\"{o}nnen sich sowohl auf Produkte und Prozesse als auch auf die Ausbildung und das Wissen von Einzelpersonen beziehen. Da Zertifikate durch unabh\\\"{a}ngige Pr\\\"{u}finstanzen ausgestellt werden, wird Zertifikaten und deren \\\"{u}berpr\\\"{u}fbaren Aussagen im Allgemeinen ein deutlich h\\\"{o}heres Vertrauen entgegengebracht als Qualit\\\"{a}tsversprechen von Software-Herstellern selbst. Unternehmen, die ihre Prozesse beispielsweise nach CMMI zertifizieren lassen, k\\\"{o}nnen damit ihre F\\\"{a}higkeiten unter Beweis stellen, Projekte erfolgreich und mit vorhersagbarer Qualit\\\"{a}t abschlie{ss}en zu k\\\"{o}nnen. Neben dem Nachweis entsprechender Zertifikate als Diversifikationsmerkmal gegen\\\"{u}ber Mitbewerbern k\\\"{o}nnen Zertifikate \\\"{u}ber die Einhaltung von Standards auch durch den Gesetzgeber vorgeschrieben werden. Ein Beispiel hierf\\\"{u}r sind Zertifikate aus Hochsicherheitsbereichen wie Atomkraftwerken. Das Seminar wurde wie eine wissenschaftliche Konferenz organisiert: Die Einreichungen wurden in einem zweistufigen Peer-Review-Verfahren begutachtet. In der ersten Stufe wurde eine Begutachtung der studentischen Arbeiten durch Kommilitonen durchgef\\\"{u}hrt, in der zweiten Stufe eine Begutachtung durch die Betreuer. In verschiedenen Sessions wurden die Artikel an zwei Konferenztagen pr\\\"{a}sentiert. Die besten Beitr\\\"{a}ge wurden durch best paper awards ausgezeichnet. Diese gingen an Fabian Brosig f\\\"{u}r seine Arbeit Cost Benefit Analysis Method (CBAM), an Jakob Blomer f\\\"{u}r die Arbeit Zertifizierung von Softwarebenchmarks und an Grischa Liebel f\\\"{u}r die Arbeit SWT - Das Standard Widget Toolkit, denen hiermit noch einmal herzlich zu dieser herausragenden Leistung gratuliert wird. Erg\\\"{a}nzend zu den Vortr\\\"{a}gen der Seminarteilnehmer wurde ein eingeladener Vortrag gehalten. Herr Dr. Dirk Feuerhelm von der 1&1 Internet AG gab dabei dankenswerterweise in seinem Vortrag mit dem Thema Softskills -- Ist das objektorientiert oder modellgetrieben? einen Einblick in die Aufgaben als Leiter der Software-Entwicklung','{S}oftware {Z}ertifizierung',0,0,2008,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(76,'paper','indust2008','techreport','@techreport{indust2008,\n abstract = {Die Industrialisierung der Software-Entwicklung ist ein zurzeit sehr stark diskutiertes Thema. Es geht dabei vor allem um die Efizienzsteigerung durch die Steigerung des Standardisierungsgrades, des Automatisierungsgrades sowie eine Erh\\\"{o}hung der Arbeitsteilung. Dies wirkt sich einerseits auf die den Software- Systemen zu Grunde liegenden Architekturen aber auch auf die Entwicklungsprozesse aus. So sind service-orientierte Architekturen ein Beispiel f\\\"{u}r eine gesteigerte Standardisierung innerhalb von Software-Systemen. Es ist zu ber\\\"{u}cksichtigen, dass sich die Software-Branche von den klassischen produzierenden Industriezweigen dadurch unterscheidet, dass Software ein immaterielles Produkt ist und so ohne hohe Produktionskosten beliebig oft vervielf\\\"{a}ltigt werden kann. Trotzdem lassen sich viele Erkenntnisse aus den klassischen Industriezweigen auf die Software-Technik \\\"{u}bertragen. Die Inhalte dieses Berichts stammen haupts\\\"{a}chlich aus dem Seminar \"Software- Industrialisierung, welches sich mit der Professionalisierung der Software- Entwicklung und des Software-Entwurfs besch\\\"{a}ftigte. W\\\"{a}hrend die klassische Software-Entwicklung wenig strukturiert ist und weder im Bezug auf Reproduzierbarkeit oder Qualit\\\"{a}tssicherung erh\\\"{o}hten Anforderungen gen\\\"{u}gt, befindet sich die Software-Entwicklung im Rahmen der Industrialisierung in einem Wandel. Dazu z\\\"{a}hlen arbeitsteiliges Arbeiten, die Einf\\\"{u}hrung von Entwicklungsprozessen mit vorhersagbaren Eigenschaften (Kosten, Zeitbedarf, ...) und in der Folge die Erstellung von Produkten mit garantierbaren Eigenschaften. Das Themenspektrum des Seminars umfasste dabei unter anderem: * Software-Architekturen * Komponentenbasierte Software-Entwicklung * Modellgetriebene Entwicklung * Ber\\\"{u}cksichtigung von Qualit\\\"{a}tseigenschaften in Entwicklungsprozessen Das Seminar wurde wie eine wissenschaftliche Konferenz organisiert: Die Einreichungen wurden in einem zweistufigen Peer-Review-Verfahren begutachtet. In der ersten Stufe wurde eine Begutachtung der studentischen Arbeiten durch Kommilitonen durchgef\\\"{u}hrt, in der zweiten Stufe eine Begutachtung durch die Betreuer. In verschiedenen Sessions wurden die Artikel an zwei Konferenztagen pr\\\"{a}sentiert. Der beste Beitrag wurde durch einen Best Paper Award ausgezeichnet. Dieser ging an Benjamin Klatt f\\\"{u}r seine Arbeit Software Extension Mechanisms, dem hiermit noch einmal herzlich zu dieser herausragenden Leistung gratuliert wird. Erg\\\"{a}nzend zu den Vortr\\\"{a}gen der Seminarteilnehmer wurde ein eingeladener Vortrag gehalten. Herr Florian Kaltner und Herr Tobias Pohl vom IBM-Entwicklungslabor gaben dabei dankenswerterweise in ihrem Vortrag Einblicke in die Entwicklung von Plugins f\\\"{u}r Eclipse sowie in die Build-Umgebung der Firmware f\\\"{u}r die zSeries Mainframe-Server.},\n address = {Karlsruhe},\n author = {Brosch, Franz and Goldschmidt, Thomas and Groenda, Henning and Kapova, Lucia and Krogmann, Klaus and Kuperberg, Michael and Martens, Anne and Rathfelder, Christoph and Reussner, Ralf and Stammel, Johannes},\n edition = {ISSN 1432-7864},\n institution = {Universit{\"a}t Karlsruhe, Fakult{\"a}t f{\"u}r Informatik, Institut f{\"u}r Programmstrukturen und Datenorganisation},\n timestamp = {2009.06.29},\n title = {Software-Industrialisierung},\n type = {Interner Bericht},\n url = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000009113},\n volume = {8},\n year = {2008},\n}\n\n','\n\nFranz Brosch, Thomas Goldschmidt, Henning Groenda, Lucia Kapova, Klaus\nKrogmann, Michael Kuperberg, Anne Martens, Christoph Rathfelder, Ralf\nReussner, and Johannes Stammel.\nSoftware-industrialisierung.\nInterner bericht, Universit\"at Karlsruhe, Fakult\"at f\"ur\nInformatik, Institut f\"ur Programmstrukturen und Datenorganisation,\nKarlsruhe, 2008.\n[ bib | http | Abstract  ] 
\n@techreport{indust2008,\nabstract = {Die Industrialisierung der Software-Entwicklung ist ein zurzeit sehr stark diskutiertes Thema. Es geht dabei vor allem um die Efizienzsteigerung durch die Steigerung des Standardisierungsgrades, des Automatisierungsgrades sowie eine Erh\\\"{o}hung der Arbeitsteilung. Dies wirkt sich einerseits auf die den Software- Systemen zu Grunde liegenden Architekturen aber auch auf die Entwicklungsprozesse aus. So sind service-orientierte Architekturen ein Beispiel f\\\"{u}r eine gesteigerte Standardisierung innerhalb von Software-Systemen. Es ist zu ber\\\"{u}cksichtigen, dass sich die Software-Branche von den klassischen produzierenden Industriezweigen dadurch unterscheidet, dass Software ein immaterielles Produkt ist und so ohne hohe Produktionskosten beliebig oft vervielf\\\"{a}ltigt werden kann. Trotzdem lassen sich viele Erkenntnisse aus den klassischen Industriezweigen auf die Software-Technik \\\"{u}bertragen. Die Inhalte dieses Berichts stammen haupts\\\"{a}chlich aus dem Seminar \"Software- Industrialisierung, welches sich mit der Professionalisierung der Software- Entwicklung und des Software-Entwurfs besch\\\"{a}ftigte. W\\\"{a}hrend die klassische Software-Entwicklung wenig strukturiert ist und weder im Bezug auf Reproduzierbarkeit oder Qualit\\\"{a}tssicherung erh\\\"{o}hten Anforderungen gen\\\"{u}gt, befindet sich die Software-Entwicklung im Rahmen der Industrialisierung in einem Wandel. Dazu z\\\"{a}hlen arbeitsteiliges Arbeiten, die Einf\\\"{u}hrung von Entwicklungsprozessen mit vorhersagbaren Eigenschaften (Kosten, Zeitbedarf, ...) und in der Folge die Erstellung von Produkten mit garantierbaren Eigenschaften. Das Themenspektrum des Seminars umfasste dabei unter anderem: * Software-Architekturen * Komponentenbasierte Software-Entwicklung * Modellgetriebene Entwicklung * Ber\\\"{u}cksichtigung von Qualit\\\"{a}tseigenschaften in Entwicklungsprozessen Das Seminar wurde wie eine wissenschaftliche Konferenz organisiert: Die Einreichungen wurden in einem zweistufigen Peer-Review-Verfahren begutachtet. In der ersten Stufe wurde eine Begutachtung der studentischen Arbeiten durch Kommilitonen durchgef\\\"{u}hrt, in der zweiten Stufe eine Begutachtung durch die Betreuer. In verschiedenen Sessions wurden die Artikel an zwei Konferenztagen pr\\\"{a}sentiert. Der beste Beitrag wurde durch einen Best Paper Award ausgezeichnet. Dieser ging an Benjamin Klatt f\\\"{u}r seine Arbeit Software Extension Mechanisms, dem hiermit noch einmal herzlich zu dieser herausragenden Leistung gratuliert wird. Erg\\\"{a}nzend zu den Vortr\\\"{a}gen der Seminarteilnehmer wurde ein eingeladener Vortrag gehalten. Herr Florian Kaltner und Herr Tobias Pohl vom IBM-Entwicklungslabor gaben dabei dankenswerterweise in ihrem Vortrag Einblicke in die Entwicklung von Plugins f\\\"{u}r Eclipse sowie in die Build-Umgebung der Firmware f\\\"{u}r die zSeries Mainframe-Server.},\naddress = {Karlsruhe},\nauthor = {Brosch, Franz and Goldschmidt, Thomas and Groenda, Henning and Kapova, Lucia and Krogmann, Klaus and Kuperberg, Michael and Martens, Anne and Rathfelder, Christoph and Reussner, Ralf and Stammel, Johannes},\nedition = {ISSN 1432-7864},\ninstitution = {Universit{\"a}t Karlsruhe, Fakult{\"a}t f{\"u}r Informatik, Institut f{\"u}r Programmstrukturen und Datenorganisation},\ntimestamp = {2009.06.29},\ntitle = {Software-Industrialisierung},\ntype = {Interner Bericht},\nurl = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000009113},\nvolume = {8},\nyear = {2008}\n}\n
\n
\nDie Industrialisierung der Software-Entwicklung ist ein zurzeit sehr stark diskutiertes Thema. Es geht dabei vor allem um die Efizienzsteigerung durch die Steigerung des Standardisierungsgrades, des Automatisierungsgrades sowie eine Erhöhung der Arbeitsteilung. Dies wirkt sich einerseits auf die den Software- Systemen zu Grunde liegenden Architekturen aber auch auf die Entwicklungsprozesse aus. So sind service-orientierte Architekturen ein Beispiel für eine gesteigerte Standardisierung innerhalb von Software-Systemen. Es ist zu berücksichtigen, dass sich die Software-Branche von den klassischen produzierenden Industriezweigen dadurch unterscheidet, dass Software ein immaterielles Produkt ist und so ohne hohe Produktionskosten beliebig oft vervielfältigt werden kann. Trotzdem lassen sich viele Erkenntnisse aus den klassischen Industriezweigen auf die Software-Technik übertragen. Die Inhalte dieses Berichts stammen hauptsächlich aus dem Seminar \"Software- Industrialisierung, welches sich mit der Professionalisierung der Software- Entwicklung und des Software-Entwurfs beschäftigte. Während die klassische Software-Entwicklung wenig strukturiert ist und weder im Bezug auf Reproduzierbarkeit oder Qualitätssicherung erhöhten Anforderungen genügt, befindet sich die Software-Entwicklung im Rahmen der Industrialisierung in einem Wandel. Dazu zählen arbeitsteiliges Arbeiten, die Einführung von Entwicklungsprozessen mit vorhersagbaren Eigenschaften (Kosten, Zeitbedarf, ...) und in der Folge die Erstellung von Produkten mit garantierbaren Eigenschaften. Das Themenspektrum des Seminars umfasste dabei unter anderem: * Software-Architekturen * Komponentenbasierte Software-Entwicklung * Modellgetriebene Entwicklung * Berücksichtigung von Qualitätseigenschaften in Entwicklungsprozessen Das Seminar wurde wie eine wissenschaftliche Konferenz organisiert: Die Einreichungen wurden in einem zweistufigen Peer-Review-Verfahren begutachtet. In der ersten Stufe wurde eine Begutachtung der studentischen Arbeiten durch Kommilitonen durchgeführt, in der zweiten Stufe eine Begutachtung durch die Betreuer. In verschiedenen Sessions wurden die Artikel an zwei Konferenztagen präsentiert. Der beste Beitrag wurde durch einen Best Paper Award ausgezeichnet. Dieser ging an Benjamin Klatt für seine Arbeit Software Extension Mechanisms, dem hiermit noch einmal herzlich zu dieser herausragenden Leistung gratuliert wird. Ergänzend zu den Vorträgen der Seminarteilnehmer wurde ein eingeladener Vortrag gehalten. Herr Florian Kaltner und Herr Tobias Pohl vom IBM-Entwicklungslabor gaben dabei dankenswerterweise in ihrem Vortrag Einblicke in die Entwicklung von Plugins für Eclipse sowie in die Build-Umgebung der Firmware für die zSeries Mainframe-Server.\n
\n','
\n@techreport{indust2008,\n  abstract = {Die Industrialisierung der Software-Entwicklung ist ein zurzeit sehr stark diskutiertes Thema. Es geht dabei vor allem um die Efizienzsteigerung durch die Steigerung des Standardisierungsgrades, des Automatisierungsgrades sowie eine Erh\\\"{o}hung der Arbeitsteilung. Dies wirkt sich einerseits auf die den Software- Systemen zu Grunde liegenden Architekturen aber auch auf die Entwicklungsprozesse aus. So sind service-orientierte Architekturen ein Beispiel f\\\"{u}r eine gesteigerte Standardisierung innerhalb von Software-Systemen. Es ist zu ber\\\"{u}cksichtigen, dass sich die Software-Branche von den klassischen produzierenden Industriezweigen dadurch unterscheidet, dass Software ein immaterielles Produkt ist und so ohne hohe Produktionskosten beliebig oft vervielf\\\"{a}ltigt werden kann. Trotzdem lassen sich viele Erkenntnisse aus den klassischen Industriezweigen auf die Software-Technik \\\"{u}bertragen. Die Inhalte dieses Berichts stammen haupts\\\"{a}chlich aus dem Seminar \"Software- Industrialisierung, welches sich mit der Professionalisierung der Software- Entwicklung und des Software-Entwurfs besch\\\"{a}ftigte. W\\\"{a}hrend die klassische Software-Entwicklung wenig strukturiert ist und weder im Bezug auf Reproduzierbarkeit oder Qualit\\\"{a}tssicherung erh\\\"{o}hten Anforderungen gen\\\"{u}gt, befindet sich die Software-Entwicklung im Rahmen der Industrialisierung in einem Wandel. Dazu z\\\"{a}hlen arbeitsteiliges Arbeiten, die Einf\\\"{u}hrung von Entwicklungsprozessen mit vorhersagbaren Eigenschaften (Kosten, Zeitbedarf, ...) und in der Folge die Erstellung von Produkten mit garantierbaren Eigenschaften. Das Themenspektrum des Seminars umfasste dabei unter anderem: * Software-Architekturen * Komponentenbasierte Software-Entwicklung * Modellgetriebene Entwicklung * Ber\\\"{u}cksichtigung von Qualit\\\"{a}tseigenschaften in Entwicklungsprozessen Das Seminar wurde wie eine wissenschaftliche Konferenz organisiert: Die Einreichungen wurden in einem zweistufigen Peer-Review-Verfahren begutachtet. In der ersten Stufe wurde eine Begutachtung der studentischen Arbeiten durch Kommilitonen durchgef\\\"{u}hrt, in der zweiten Stufe eine Begutachtung durch die Betreuer. In verschiedenen Sessions wurden die Artikel an zwei Konferenztagen pr\\\"{a}sentiert. Der beste Beitrag wurde durch einen Best Paper Award ausgezeichnet. Dieser ging an Benjamin Klatt f\\\"{u}r seine Arbeit Software Extension Mechanisms, dem hiermit noch einmal herzlich zu dieser herausragenden Leistung gratuliert wird. Erg\\\"{a}nzend zu den Vortr\\\"{a}gen der Seminarteilnehmer wurde ein eingeladener Vortrag gehalten. Herr Florian Kaltner und Herr Tobias Pohl vom IBM-Entwicklungslabor gaben dabei dankenswerterweise in ihrem Vortrag Einblicke in die Entwicklung von Plugins f\\\"{u}r Eclipse sowie in die Build-Umgebung der Firmware f\\\"{u}r die zSeries Mainframe-Server.},\n  address = {Karlsruhe},\n  author = {Brosch, Franz and Goldschmidt, Thomas and Groenda, Henning and Kapova, Lucia and Krogmann, Klaus and Kuperberg, Michael and Martens, Anne and Rathfelder, Christoph and Reussner, Ralf and Stammel, Johannes},\n  edition = {ISSN 1432-7864},\n  institution = {Universit{\"a}t Karlsruhe, Fakult{\"a}t f{\"u}r Informatik, Institut f{\"u}r Programmstrukturen und Datenorganisation},\n  timestamp = {2009.06.29},\n  title = {Software-Industrialisierung},\n  type = {Interner Bericht},\n  url = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000009113},\n  volume = {8},\n  year = {2008}\n}\n
\n\n','Die Industrialisierung der Software-Entwicklung ist ein zurzeit sehr stark diskutiertes Thema. Es geht dabei vor allem um die Efizienzsteigerung durch die Steigerung des Standardisierungsgrades, des Automatisierungsgrades sowie eine Erh\"{o}hung der Arbeitsteilung. Dies wirkt sich einerseits auf die den Software- Systemen zu Grunde liegenden Architekturen aber auch auf die Entwicklungsprozesse aus. So sind service-orientierte Architekturen ein Beispiel f\"{u}r eine gesteigerte Standardisierung innerhalb von Software-Systemen. Es ist zu ber\"{u}cksichtigen, dass sich die Software-Branche von den klassischen produzierenden Industriezweigen dadurch unterscheidet, dass Software ein immaterielles Produkt ist und so ohne hohe Produktionskosten beliebig oft vervielf\"{a}ltigt werden kann. Trotzdem lassen sich viele Erkenntnisse aus den klassischen Industriezweigen auf die Software-Technik \"{u}bertragen. Die Inhalte dieses Berichts stammen haupts\"{a}chlich aus dem Seminar \"Software- Industrialisierung, welches sich mit der Professionalisierung der Software- Entwicklung und des Software-Entwurfs besch\"{a}ftigte. W\"{a}hrend die klassische Software-Entwicklung wenig strukturiert ist und weder im Bezug auf Reproduzierbarkeit oder Qualit\"{a}tssicherung erh\"{o}hten Anforderungen gen\"{u}gt, befindet sich die Software-Entwicklung im Rahmen der Industrialisierung in einem Wandel. Dazu z\"{a}hlen arbeitsteiliges Arbeiten, die Einf\"{u}hrung von Entwicklungsprozessen mit vorhersagbaren Eigenschaften (Kosten, Zeitbedarf, ...) und in der Folge die Erstellung von Produkten mit garantierbaren Eigenschaften. Das Themenspektrum des Seminars umfasste dabei unter anderem: * Software-Architekturen * Komponentenbasierte Software-Entwicklung * Modellgetriebene Entwicklung * Ber\"{u}cksichtigung von Qualit\"{a}tseigenschaften in Entwicklungsprozessen Das Seminar wurde wie eine wissenschaftliche Konferenz organisiert: Die Einreichungen wurden in einem zweistufigen Peer-Review-Verfahren begutachtet. In der ersten Stufe wurde eine Begutachtung der studentischen Arbeiten durch Kommilitonen durchgef\"{u}hrt, in der zweiten Stufe eine Begutachtung durch die Betreuer. In verschiedenen Sessions wurden die Artikel an zwei Konferenztagen pr\"{a}sentiert. Der beste Beitrag wurde durch einen Best Paper Award ausgezeichnet. Dieser ging an Benjamin Klatt f\"{u}r seine Arbeit Software Extension Mechanisms, dem hiermit noch einmal herzlich zu dieser herausragenden Leistung gratuliert wird. Erg\"{a}nzend zu den Vortr\"{a}gen der Seminarteilnehmer wurde ein eingeladener Vortrag gehalten. Herr Florian Kaltner und Herr Tobias Pohl vom IBM-Entwicklungslabor gaben dabei dankenswerterweise in ihrem Vortrag Einblicke in die Entwicklung von Plugins f\"{u}r Eclipse sowie in die Build-Umgebung der Firmware f\"{u}r die zSeries Mainframe-Server.','Software-Industrialisierung',0,0,2008,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(81,'paper','Br2011-SEDoktoranden-Symposium','inproceedings','@inproceedings{Br2011-SEDoktoranden-Symposium,\n abstract = {{Today\'s enterprise systems based on increasingly complex software architectures often exhibit poor performance and resource efficiency thus having high operating costs. This is due to the inability to predict at run-time the effect of changes in the system environment and adapt the system accordingly. We propose a new performance modeling approach that allows the prediction of performance and system resource utilization online during system operation. We use architecture-level performance models that capture the performance-relevant information of the software architecture, deployment, execution environment and workload. The models will be automatically maintained during operation. To derive performance predictions, we propose a tailorable model solving approach to provide flexibility in view of prediction accuracy and analysis overhead.}},\n address = {Bonn, Germany},\n author = {Fabian Brosig},\n bibsource = {DBLP, http://dblp.uni-trier.de},\n booktitle = {Software Engineering (Workshops) - Doctoral Symposium, February 21--25, 2011},\n editor = {Ralf Reussner and Alexander Pretschner and Stefan J{\\\"a}hnichen},\n ee = {http://subs.emis.de/LNI/Proceedings/Proceedings184/article6310.html},\n month = {February},\n pages = {279--284},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/81.pdf},\n publisher = {GI},\n series = {Lecture Notes in Informatics (LNI)},\n title = {Online Performance Prediction with Architecture-Level Performance Models},\n volume = {184},\n year = {2011},\n}\n\n','\n\nFabian Brosig.\nOnline performance prediction with architecture-level performance\nmodels.\nIn Software Engineering (Workshops) - Doctoral Symposium,\nFebruary 21-25, 2011, Ralf Reussner, Alexander Pretschner, and Stefan\nJähnichen, editors, February 2011, volume 184 of Lecture Notes in\nInformatics (LNI), pages 279-284. GI, Bonn, Germany.\nFebruary 2011.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{Br2011-SEDoktoranden-Symposium,\nabstract = {{Today\'s enterprise systems based on increasingly complex software architectures often exhibit poor performance and resource efficiency thus having high operating costs. This is due to the inability to predict at run-time the effect of changes in the system environment and adapt the system accordingly. We propose a new performance modeling approach that allows the prediction of performance and system resource utilization online during system operation. We use architecture-level performance models that capture the performance-relevant information of the software architecture, deployment, execution environment and workload. The models will be automatically maintained during operation. To derive performance predictions, we propose a tailorable model solving approach to provide flexibility in view of prediction accuracy and analysis overhead.}},\naddress = {Bonn, Germany},\nauthor = {Fabian Brosig},\nbibsource = {DBLP, http://dblp.uni-trier.de},\nbooktitle = {Software Engineering (Workshops) - Doctoral Symposium, February 21--25, 2011},\neditor = {Ralf Reussner and Alexander Pretschner and Stefan J{\\\"a}hnichen},\nee = {http://subs.emis.de/LNI/Proceedings/Proceedings184/article6310.html},\nmonth = {February},\npages = {279--284},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/81.pdf},\npublisher = {GI},\nseries = {Lecture Notes in Informatics (LNI)},\ntitle = {Online Performance Prediction with Architecture-Level Performance Models},\nvolume = {184},\nyear = {2011}\n}\n
\n
\nToday\'s enterprise systems based on increasingly complex software architectures often exhibit poor performance and resource efficiency thus having high operating costs. This is due to the inability to predict at run-time the effect of changes in the system environment and adapt the system accordingly. We propose a new performance modeling approach that allows the prediction of performance and system resource utilization online during system operation. We use architecture-level performance models that capture the performance-relevant information of the software architecture, deployment, execution environment and workload. The models will be automatically maintained during operation. To derive performance predictions, we propose a tailorable model solving approach to provide flexibility in view of prediction accuracy and analysis overhead.\n
\n','
\n@inproceedings{Br2011-SEDoktoranden-Symposium,\n  abstract = {{Today\'s enterprise systems based on increasingly complex software architectures often exhibit poor performance and resource efficiency thus having high operating costs. This is due to the inability to predict at run-time the effect of changes in the system environment and adapt the system accordingly. We propose a new performance modeling approach that allows the prediction of performance and system resource utilization online during system operation. We use architecture-level performance models that capture the performance-relevant information of the software architecture, deployment, execution environment and workload. The models will be automatically maintained during operation. To derive performance predictions, we propose a tailorable model solving approach to provide flexibility in view of prediction accuracy and analysis overhead.}},\n  address = {Bonn, Germany},\n  author = {Fabian Brosig},\n  bibsource = {DBLP, http://dblp.uni-trier.de},\n  booktitle = {Software Engineering (Workshops) - Doctoral Symposium, February 21--25, 2011},\n  editor = {Ralf Reussner and Alexander Pretschner and Stefan J{\\\"a}hnichen},\n  ee = {http://subs.emis.de/LNI/Proceedings/Proceedings184/article6310.html},\n  month = {February},\n  pages = {279--284},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/81.pdf},\n  publisher = {GI},\n  series = {Lecture Notes in Informatics (LNI)},\n  title = {Online Performance Prediction with Architecture-Level Performance Models},\n  volume = {184},\n  year = {2011}\n}\n
\n\n','{Today\'s enterprise systems based on increasingly complex software architectures often exhibit poor performance and resource efficiency thus having high operating costs. This is due to the inability to predict at run-time the effect of changes in the system environment and adapt the system accordingly. We propose a new performance modeling approach that allows the prediction of performance and system resource utilization online during system operation. We use architecture-level performance models that capture the performance-relevant information of the software architecture, deployment, execution environment and workload. The models will be automatically maintained during operation. To derive performance predictions, we propose a tailorable model solving approach to provide flexibility in view of prediction accuracy and analysis overhead.}','Online Performance Prediction with Architecture-Level Performance Models',0,2,2011,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(82,'paper','brosig2009a','mastersthesis','@mastersthesis{brosig2009a,\n address = {Karlsruhe, Germany},\n author = {Fabian Brosig},\n month = {June},\n note = {FZI Prize \"Best Diploma Thesis\"},\n school = {Universit{\\\"{a}}t Karlsruhe (TH)},\n title = {{Automated Extraction of Palladio Component Models from Running Enterprise Java Applications}},\n year = {2009},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/82.pdf},\n}\n\n','\n\nFabian Brosig.\nAutomated Extraction of Palladio Component Models from Running\nEnterprise Java Applications.\nMaster\'s thesis, Universität Karlsruhe (TH), Karlsruhe,\nGermany, June 2009.\nFZI Prize \"Best Diploma Thesis\".\n[ bib | .pdf  ] 
\n@mastersthesis{brosig2009a,\naddress = {Karlsruhe, Germany},\nauthor = {Fabian Brosig},\nmonth = {June},\nnote = {FZI Prize \"Best Diploma Thesis\"},\nschool = {Universit{\\\"{a}}t Karlsruhe (TH)},\ntitle = {{Automated Extraction of Palladio Component Models from Running Enterprise Java Applications}},\nyear = {2009},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/82.pdf}\n}\n
\n
\n','
\n@mastersthesis{brosig2009a,\n  address = {Karlsruhe, Germany},\n  author = {Fabian Brosig},\n  month = {June},\n  note = {FZI Prize \"Best Diploma Thesis\"},\n  school = {Universit{\\\"{a}}t Karlsruhe (TH)},\n  title = {{Automated Extraction of Palladio Component Models from Running Enterprise Java Applications}},\n  year = {2009},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/82.pdf}\n}\n
\n\n',NULL,'{Automated Extraction of Palladio Component Models from Running Enterprise Java Applications}',0,6,2009,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(83,'paper','BrHuKo2012-CBSE-ParamAndContextDep','inproceedings','@inproceedings{BrHuKo2012-CBSE-ParamAndContextDep,\n abstract = {Modern enterprise applications have to satisfy increasingly stringent Quality-of-Service requirements. To ensure that a system meets its performance requirements, the ability to predict its performance under different configurations and workloads is essential. Architecture-level performance models describe performance-relevant aspects of software architectures and execution environments allowing to evaluate different usage profiles as well as system deployment and configuration options. However, building performance models manually requires a lot of time and effort. In this paper, we present a novel automated method for the extraction of architecture-level performance models of distributed component-based systems, based on monitoring data collected at run-time. The method is validated in a case study with the industry-standard SPECjEnterprise2010 Enterprise Java benchmark, a representative software system executed in a realistic environment. The obtained performance predictions match the measurements on the real system within an error margin of mostly 10-20 percent.},\n author = {Fabian Brosig and Nikolaus Huber and Samuel Kounev},\n booktitle = {Proceedings of the 15th ACM SIGSOFT International Symposium on Component Based Software Engineering (CBSE 2012), June 26--28, 2012, Bertinoro, Italy},\n month = {June},\n note = {Acceptance Rate (Full Paper): 28.5\\%.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/83.pdf},\n title = {{Modeling Parameter and Context Dependencies in Online Architecture-Level Performance Models}},\n url = {http://cbse-conferences.org/2012/},\n year = {2012},\n}\n\n','\n\nFabian Brosig, Nikolaus Huber, and Samuel Kounev.\nModeling Parameter and Context Dependencies in Online\nArchitecture-Level Performance Models.\nIn Proceedings of the 15th ACM SIGSOFT International Symposium\non Component Based Software Engineering (CBSE 2012), June 26-28, 2012,\nBertinoro, Italy, June 2012.\nAcceptance Rate (Full Paper): 28.5%.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{BrHuKo2012-CBSE-ParamAndContextDep,\nabstract = {Modern enterprise applications have to satisfy increasingly stringent Quality-of-Service requirements. To ensure that a system meets its performance requirements, the ability to predict its performance under different configurations and workloads is essential. Architecture-level performance models describe performance-relevant aspects of software architectures and execution environments allowing to evaluate different usage profiles as well as system deployment and configuration options. However, building performance models manually requires a lot of time and effort. In this paper, we present a novel automated method for the extraction of architecture-level performance models of distributed component-based systems, based on monitoring data collected at run-time. The method is validated in a case study with the industry-standard SPECjEnterprise2010 Enterprise Java benchmark, a representative software system executed in a realistic environment. The obtained performance predictions match the measurements on the real system within an error margin of mostly 10-20 percent.},\nauthor = {Fabian Brosig and Nikolaus Huber and Samuel Kounev},\nbooktitle = {Proceedings of the 15th ACM SIGSOFT International Symposium on Component Based Software Engineering (CBSE 2012), June 26--28, 2012, Bertinoro, Italy},\nmonth = {June},\nnote = {Acceptance Rate (Full Paper): 28.5\\%.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/83.pdf},\ntitle = {{Modeling Parameter and Context Dependencies in Online Architecture-Level Performance Models}},\nurl = {http://cbse-conferences.org/2012/},\nyear = {2012}\n}\n
\n
\nModern enterprise applications have to satisfy increasingly stringent Quality-of-Service requirements. To ensure that a system meets its performance requirements, the ability to predict its performance under different configurations and workloads is essential. Architecture-level performance models describe performance-relevant aspects of software architectures and execution environments allowing to evaluate different usage profiles as well as system deployment and configuration options. However, building performance models manually requires a lot of time and effort. In this paper, we present a novel automated method for the extraction of architecture-level performance models of distributed component-based systems, based on monitoring data collected at run-time. The method is validated in a case study with the industry-standard SPECjEnterprise2010 Enterprise Java benchmark, a representative software system executed in a realistic environment. The obtained performance predictions match the measurements on the real system within an error margin of mostly 10-20 percent.\n
\n','
\n@inproceedings{BrHuKo2012-CBSE-ParamAndContextDep,\n  abstract = {Modern enterprise applications have to satisfy increasingly stringent Quality-of-Service requirements. To ensure that a system meets its performance requirements, the ability to predict its performance under different configurations and workloads is essential. Architecture-level performance models describe performance-relevant aspects of software architectures and execution environments allowing to evaluate different usage profiles as well as system deployment and configuration options. However, building performance models manually requires a lot of time and effort. In this paper, we present a novel automated method for the extraction of architecture-level performance models of distributed component-based systems, based on monitoring data collected at run-time. The method is validated in a case study with the industry-standard SPECjEnterprise2010 Enterprise Java benchmark, a representative software system executed in a realistic environment. The obtained performance predictions match the measurements on the real system within an error margin of mostly 10-20 percent.},\n  author = {Fabian Brosig and Nikolaus Huber and Samuel Kounev},\n  booktitle = {Proceedings of the 15th ACM SIGSOFT International Symposium on Component Based Software Engineering (CBSE 2012), June 26--28, 2012, Bertinoro, Italy},\n  month = {June},\n  note = {Acceptance Rate (Full Paper): 28.5\\%.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/83.pdf},\n  title = {{Modeling Parameter and Context Dependencies in Online Architecture-Level Performance Models}},\n  url = {http://cbse-conferences.org/2012/},\n  year = {2012}\n}\n
\n\n','Modern enterprise applications have to satisfy increasingly stringent Quality-of-Service requirements. To ensure that a system meets its performance requirements, the ability to predict its performance under different configurations and workloads is essential. Architecture-level performance models describe performance-relevant aspects of software architectures and execution environments allowing to evaluate different usage profiles as well as system deployment and configuration options. However, building performance models manually requires a lot of time and effort. In this paper, we present a novel automated method for the extraction of architecture-level performance models of distributed component-based systems, based on monitoring data collected at run-time. The method is validated in a case study with the industry-standard SPECjEnterprise2010 Enterprise Java benchmark, a representative software system executed in a realistic environment. The obtained performance predictions match the measurements on the real system within an error margin of mostly 10-20 percent.','{Modeling Parameter and Context Dependencies in Online Architecture-Level Performance Models}',0,6,2012,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(84,'paper','BrHuKo2011-ASE-AutomExtraction','inproceedings','@inproceedings{BrHuKo2011-ASE-AutomExtraction,\n abstract = {Modern service-oriented enterprise systems have increasingly complex and dynamic loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operating costs. This is due to the inability to predict at run-time the effect of dynamic changes in the system environment and adapt the system configuration accordingly. Architecture-level performance models provide a powerful tool for performance prediction, however, current approaches to modeling the execution context of software components are not suitable for use at run-time. In this paper, we analyze the typical online performance prediction scenarios and propose a novel performance meta-model for expressing and resolving parameter and context dependencies, specifically designed for use in online scenarios. We motivate and validate our approach in the context of a realistic and representative online performance prediction scenario based on the SPECjEnterprise2010 standard benchmark.},\n address = {Oread, Lawrence, Kansas},\n author = {Fabian Brosig and Nikolaus Huber and Samuel Kounev},\n booktitle = {26th IEEE/ACM International Conference On Automated Software Engineering (ASE 2011)},\n month = {November},\n note = {Acceptance Rate (Full Paper): 14.7\\% (37/252)},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/84.pdf},\n title = {{A}utomated {E}xtraction of {A}rchitecture-{L}evel {P}erformance {M}odels of {D}istributed {C}omponent-{B}ased {S}ystems},\n year = {2011},\n}\n\n','\n\nFabian Brosig, Nikolaus Huber, and Samuel Kounev.\nAutomated Extraction of Architecture-Level Performance\nModels of Distributed Component-Based Systems.\nIn 26th IEEE/ACM International Conference On Automated Software\nEngineering (ASE 2011), November 2011. Oread, Lawrence, Kansas.\nAcceptance Rate (Full Paper): 14.7% (37/252).\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{BrHuKo2011-ASE-AutomExtraction,\nabstract = {Modern service-oriented enterprise systems have increasingly complex and dynamic loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operating costs. This is due to the inability to predict at run-time the effect of dynamic changes in the system environment and adapt the system configuration accordingly. Architecture-level performance models provide a powerful tool for performance prediction, however, current approaches to modeling the execution context of software components are not suitable for use at run-time. In this paper, we analyze the typical online performance prediction scenarios and propose a novel performance meta-model for expressing and resolving parameter and context dependencies, specifically designed for use in online scenarios. We motivate and validate our approach in the context of a realistic and representative online performance prediction scenario based on the SPECjEnterprise2010 standard benchmark.},\naddress = {Oread, Lawrence, Kansas},\nauthor = {Fabian Brosig and Nikolaus Huber and Samuel Kounev},\nbooktitle = {26th IEEE/ACM International Conference On Automated Software Engineering (ASE 2011)},\nmonth = {November},\nnote = {Acceptance Rate (Full Paper): 14.7\\% (37/252)},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/84.pdf},\ntitle = {{A}utomated {E}xtraction of {A}rchitecture-{L}evel {P}erformance {M}odels of {D}istributed {C}omponent-{B}ased {S}ystems},\nyear = {2011}\n}\n
\n
\nModern service-oriented enterprise systems have increasingly complex and dynamic loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operating costs. This is due to the inability to predict at run-time the effect of dynamic changes in the system environment and adapt the system configuration accordingly. Architecture-level performance models provide a powerful tool for performance prediction, however, current approaches to modeling the execution context of software components are not suitable for use at run-time. In this paper, we analyze the typical online performance prediction scenarios and propose a novel performance meta-model for expressing and resolving parameter and context dependencies, specifically designed for use in online scenarios. We motivate and validate our approach in the context of a realistic and representative online performance prediction scenario based on the SPECjEnterprise2010 standard benchmark.\n
\n','
\n@inproceedings{BrHuKo2011-ASE-AutomExtraction,\n  abstract = {Modern service-oriented enterprise systems have increasingly complex and dynamic loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operating costs. This is due to the inability to predict at run-time the effect of dynamic changes in the system environment and adapt the system configuration accordingly. Architecture-level performance models provide a powerful tool for performance prediction, however, current approaches to modeling the execution context of software components are not suitable for use at run-time. In this paper, we analyze the typical online performance prediction scenarios and propose a novel performance meta-model for expressing and resolving parameter and context dependencies, specifically designed for use in online scenarios. We motivate and validate our approach in the context of a realistic and representative online performance prediction scenario based on the SPECjEnterprise2010 standard benchmark.},\n  address = {Oread, Lawrence, Kansas},\n  author = {Fabian Brosig and Nikolaus Huber and Samuel Kounev},\n  booktitle = {26th IEEE/ACM International Conference On Automated Software Engineering (ASE 2011)},\n  month = {November},\n  note = {Acceptance Rate (Full Paper): 14.7\\% (37/252)},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/84.pdf},\n  title = {{A}utomated {E}xtraction of {A}rchitecture-{L}evel {P}erformance {M}odels of {D}istributed {C}omponent-{B}ased {S}ystems},\n  year = {2011}\n}\n
\n\n','Modern service-oriented enterprise systems have increasingly complex and dynamic loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operating costs. This is due to the inability to predict at run-time the effect of dynamic changes in the system environment and adapt the system configuration accordingly. Architecture-level performance models provide a powerful tool for performance prediction, however, current approaches to modeling the execution context of software components are not suitable for use at run-time. In this paper, we analyze the typical online performance prediction scenarios and propose a novel performance meta-model for expressing and resolving parameter and context dependencies, specifically designed for use in online scenarios. We motivate and validate our approach in the context of a realistic and representative online performance prediction scenario based on the SPECjEnterprise2010 standard benchmark.','{A}utomated {E}xtraction of {A}rchitecture-{L}evel {P}erformance {M}odels of {D}istributed {C}omponent-{B}ased {S}ystems',0,11,2011,11,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(85,'paper','BrKoKr2009-ROSSA-Extracting_PCM_JavaEE','inproceedings','@inproceedings{BrKoKr2009-ROSSA-Extracting_PCM_JavaEE,\n abstract = {Nowadays, software systems have to fulfill increasingly stringent requirements for performance and scalability. To ensure that a system meets its performance requirements during operation, the ability to predict its performance under different configurations and workloads is essential. Most performance analysis tools currently used in industry focus on monitoring the current system state. They provide low-level monitoring data without any performance prediction capabilities. For performance prediction, performance models are normally required. However, building predictive performance models manually requires a lot of time and effort. In this paper, we present a method for automated extraction of performance models of Java EE applications, based on monitoring data collected during operation. We extract instances of the Palladio Component Model (PCM) - a performance meta-model targeted at component-based systems. We evaluate the model extraction method in the context of a case study with a real-world enterprise application. Even though the extraction requires some manual intervention, the case study demonstrates that the existing gap between low-level monitoring data and high-level performance models can be closed.},\n author = {Fabian Brosig and Samuel Kounev and Klaus Krogmann},\n booktitle = {Proceedings of the 1st International Workshop on Run-time mOdels for Self-managing Systems and Applications (ROSSA 2009). In conjunction with Fourth International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2009), Pisa, Italy, October 19, 2009.},\n month = {October},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/85.pdf},\n publisher = {ACM, New York, NY, USA},\n title = {{Automated Extraction of Palladio Component Models from Running Enterprise Java Applications}},\n year = {2009},\n}\n\n','\n\nFabian Brosig, Samuel Kounev, and Klaus Krogmann.\nAutomated Extraction of Palladio Component Models from Running\nEnterprise Java Applications.\nIn Proceedings of the 1st International Workshop on Run-time\nmOdels for Self-managing Systems and Applications (ROSSA 2009). In\nconjunction with Fourth International Conference on Performance Evaluation\nMethodologies and Tools (VALUETOOLS 2009), Pisa, Italy, October 19, 2009.,\nOctober 2009. ACM, New York, NY, USA.\nOctober 2009.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{BrKoKr2009-ROSSA-Extracting_PCM_JavaEE,\nabstract = {Nowadays, software systems have to fulfill increasingly stringent requirements for performance and scalability. To ensure that a system meets its performance requirements during operation, the ability to predict its performance under different configurations and workloads is essential. Most performance analysis tools currently used in industry focus on monitoring the current system state. They provide low-level monitoring data without any performance prediction capabilities. For performance prediction, performance models are normally required. However, building predictive performance models manually requires a lot of time and effort. In this paper, we present a method for automated extraction of performance models of Java EE applications, based on monitoring data collected during operation. We extract instances of the Palladio Component Model (PCM) - a performance meta-model targeted at component-based systems. We evaluate the model extraction method in the context of a case study with a real-world enterprise application. Even though the extraction requires some manual intervention, the case study demonstrates that the existing gap between low-level monitoring data and high-level performance models can be closed.},\nauthor = {Fabian Brosig and Samuel Kounev and Klaus Krogmann},\nbooktitle = {Proceedings of the 1st International Workshop on Run-time mOdels for Self-managing Systems and Applications (ROSSA 2009). In conjunction with Fourth International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2009), Pisa, Italy, October 19, 2009.},\nmonth = {October},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/85.pdf},\npublisher = {ACM, New York, NY, USA},\ntitle = {{Automated Extraction of Palladio Component Models from Running Enterprise Java Applications}},\nyear = {2009}\n}\n
\n
\nNowadays, software systems have to fulfill increasingly stringent requirements for performance and scalability. To ensure that a system meets its performance requirements during operation, the ability to predict its performance under different configurations and workloads is essential. Most performance analysis tools currently used in industry focus on monitoring the current system state. They provide low-level monitoring data without any performance prediction capabilities. For performance prediction, performance models are normally required. However, building predictive performance models manually requires a lot of time and effort. In this paper, we present a method for automated extraction of performance models of Java EE applications, based on monitoring data collected during operation. We extract instances of the Palladio Component Model (PCM) - a performance meta-model targeted at component-based systems. We evaluate the model extraction method in the context of a case study with a real-world enterprise application. Even though the extraction requires some manual intervention, the case study demonstrates that the existing gap between low-level monitoring data and high-level performance models can be closed.\n
\n','
\n@inproceedings{BrKoKr2009-ROSSA-Extracting_PCM_JavaEE,\n  abstract = {Nowadays, software systems have to fulfill increasingly stringent requirements for performance and scalability. To ensure that a system meets its performance requirements during operation, the ability to predict its performance under different configurations and workloads is essential. Most performance analysis tools currently used in industry focus on monitoring the current system state. They provide low-level monitoring data without any performance prediction capabilities. For performance prediction, performance models are normally required. However, building predictive performance models manually requires a lot of time and effort. In this paper, we present a method for automated extraction of performance models of Java EE applications, based on monitoring data collected during operation. We extract instances of the Palladio Component Model (PCM) - a performance meta-model targeted at component-based systems. We evaluate the model extraction method in the context of a case study with a real-world enterprise application. Even though the extraction requires some manual intervention, the case study demonstrates that the existing gap between low-level monitoring data and high-level performance models can be closed.},\n  author = {Fabian Brosig and Samuel Kounev and Klaus Krogmann},\n  booktitle = {Proceedings of the 1st International Workshop on Run-time mOdels for Self-managing Systems and Applications (ROSSA 2009). In conjunction with Fourth International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2009), Pisa, Italy, October 19, 2009.},\n  month = {October},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/85.pdf},\n  publisher = {ACM, New York, NY, USA},\n  title = {{Automated Extraction of Palladio Component Models from Running Enterprise Java Applications}},\n  year = {2009}\n}\n
\n\n','Nowadays, software systems have to fulfill increasingly stringent requirements for performance and scalability. To ensure that a system meets its performance requirements during operation, the ability to predict its performance under different configurations and workloads is essential. Most performance analysis tools currently used in industry focus on monitoring the current system state. They provide low-level monitoring data without any performance prediction capabilities. For performance prediction, performance models are normally required. However, building predictive performance models manually requires a lot of time and effort. In this paper, we present a method for automated extraction of performance models of Java EE applications, based on monitoring data collected during operation. We extract instances of the Palladio Component Model (PCM) - a performance meta-model targeted at component-based systems. We evaluate the model extraction method in the context of a case study with a real-world enterprise application. Even though the extraction requires some manual intervention, the case study demonstrates that the existing gap between low-level monitoring data and high-level performance models can be closed.','{Automated Extraction of Palladio Component Models from Running Enterprise Java Applications}',0,10,2009,10,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(86,'paper','BrKoPa2009-OTN-WLDF2PCM','misc','@misc{BrKoPa2009-OTN-WLDF2PCM,\n abstract = {Throughout the system life cycle, the ability to predict a software system\'s performance under different configurations and workloads is highly valuable to ensure that the system meets its performance requirements. During the design phase, performance prediction helps to evaluate different design alternatives. At deployment time, it facilitates system sizing and capacity planning. During operation, predicting the effect of changes in the workload or in the system configuration is beneficial for run-time performance management. The alternative to performance prediction is to deploy the system in an environment reflecting the configuration of interest and conduct experiments measuring the system performance under the respective workloads. Such experiments, however, are normally very expensive and time-consuming and therefore often considered not to be economically viable. To enable performance prediction we need an abstraction of the real system that incorporates performance-relevant data, i.e., a performance model. Based on such a model, performance analysis can be carried out. Unfortunately, building predictive performance models manually requires a lot of time and effort. The model must be designed to reflect the abstract system structure and capture its performance-relevant aspects. In addition, model parameters like resource demands or system configuration parameters have to be determined. Given the costs of building performance models, techniques for automatic extraction of models based on observation of the system at run-time are highly desirable. During system development, such models can be exploited to evaluate the performance of system prototypes. During operation, an automatically extracted performance model can be applied for efficient and performance-aware resource management. For example, if one observes an increased user workload and assumes a steady workload growth rate, performance predictions help to determine when the system would reach its saturation point. This way, system operators can react to the changing workload before the system has failed to meet its performance objectives thus avoiding a violation of service level agreements (SLAs). Current performance analysis tools used in industry mostly focus on profiling and monitoring transaction response times and resource consumption. The tools often provide large amounts of low level data while important information needed for building performance models is missing, e.g., the resource demands of individual components. In this article, we present a method for automated extraction of performance models for Java EE applications during operation. We implemented the method in a tool prototype and evaluated its effectiveness in the context of a case study with an early prototype of the SPECjEnterprise2009 benchmark application which in the following we will refer to as SPECjEnterprise2009_pre. (SPECjEnterprise2009 is the successor benchmark of the SPECjAppServer2004 benchmark developed by the Standard Performance Evaluation Corp. [SPEC]; SPECjEnterprise is a trademark of SPEC. The SPECjEnterprise2009 results or findings in this publication have not been reviewed or accepted by SPEC, therefore no comparison nor performance inference can be made against any published SPEC result.) The target Java EE platform we consider is Oracle WebLogic Server (WLS). The extraction is based on monitoring data that is collected during operation using the WebLogic Diagnostics Framework (WLDF). As a performance model, we selected the Palladio Component Model (PCM). PCM is a sophisticated performance modeling framework with mature tool support. In contrast to low level mathematical models like, e.g., queueing networks, PCM is a high-level UML-like design-oriented model that captures the performance-relevant aspects of the system architecture. This makes PCM models easy to understand and use by software developers. We begin by providing some background on the technologies we use, focusing on the WLDF monitoring framework and the PCM models. We then describe the model extraction method in more detail. Finally, we present the case study we conducted and conclude with a summary.},\n author = {Fabian Brosig and Samuel Kounev and Charles Paclat},\n howpublished = {Oracle Technology Network (OTN) Article},\n month = {September},\n title = {{Using WebLogic Diagnostics Framework to Enable Performance Prediction for Java EE Applications}},\n url = {http://www.oracle.com/technetwork/articles/brosig-wldf-086367.html},\n year = {2009},\n}\n\n','\n\nFabian Brosig, Samuel Kounev, and Charles Paclat.\nUsing WebLogic Diagnostics Framework to Enable Performance\nPrediction for Java EE Applications.\nOracle Technology Network (OTN) Article, September 2009.\n[ bib | .html | Abstract  ] 
\n@misc{BrKoPa2009-OTN-WLDF2PCM,\nabstract = {Throughout the system life cycle, the ability to predict a software system\'s performance under different configurations and workloads is highly valuable to ensure that the system meets its performance requirements. During the design phase, performance prediction helps to evaluate different design alternatives. At deployment time, it facilitates system sizing and capacity planning. During operation, predicting the effect of changes in the workload or in the system configuration is beneficial for run-time performance management. The alternative to performance prediction is to deploy the system in an environment reflecting the configuration of interest and conduct experiments measuring the system performance under the respective workloads. Such experiments, however, are normally very expensive and time-consuming and therefore often considered not to be economically viable. To enable performance prediction we need an abstraction of the real system that incorporates performance-relevant data, i.e., a performance model. Based on such a model, performance analysis can be carried out. Unfortunately, building predictive performance models manually requires a lot of time and effort. The model must be designed to reflect the abstract system structure and capture its performance-relevant aspects. In addition, model parameters like resource demands or system configuration parameters have to be determined. Given the costs of building performance models, techniques for automatic extraction of models based on observation of the system at run-time are highly desirable. During system development, such models can be exploited to evaluate the performance of system prototypes. During operation, an automatically extracted performance model can be applied for efficient and performance-aware resource management. For example, if one observes an increased user workload and assumes a steady workload growth rate, performance predictions help to determine when the system would reach its saturation point. This way, system operators can react to the changing workload before the system has failed to meet its performance objectives thus avoiding a violation of service level agreements (SLAs). Current performance analysis tools used in industry mostly focus on profiling and monitoring transaction response times and resource consumption. The tools often provide large amounts of low level data while important information needed for building performance models is missing, e.g., the resource demands of individual components. In this article, we present a method for automated extraction of performance models for Java EE applications during operation. We implemented the method in a tool prototype and evaluated its effectiveness in the context of a case study with an early prototype of the SPECjEnterprise2009 benchmark application which in the following we will refer to as SPECjEnterprise2009_pre. (SPECjEnterprise2009 is the successor benchmark of the SPECjAppServer2004 benchmark developed by the Standard Performance Evaluation Corp. [SPEC]; SPECjEnterprise is a trademark of SPEC. The SPECjEnterprise2009 results or findings in this publication have not been reviewed or accepted by SPEC, therefore no comparison nor performance inference can be made against any published SPEC result.) The target Java EE platform we consider is Oracle WebLogic Server (WLS). The extraction is based on monitoring data that is collected during operation using the WebLogic Diagnostics Framework (WLDF). As a performance model, we selected the Palladio Component Model (PCM). PCM is a sophisticated performance modeling framework with mature tool support. In contrast to low level mathematical models like, e.g., queueing networks, PCM is a high-level UML-like design-oriented model that captures the performance-relevant aspects of the system architecture. This makes PCM models easy to understand and use by software developers. We begin by providing some background on the technologies we use, focusing on the WLDF monitoring framework and the PCM models. We then describe the model extraction method in more detail. Finally, we present the case study we conducted and conclude with a summary.},\nauthor = {Fabian Brosig and Samuel Kounev and Charles Paclat},\nhowpublished = {Oracle Technology Network (OTN) Article},\nmonth = {September},\ntitle = {{Using WebLogic Diagnostics Framework to Enable Performance Prediction for Java EE Applications}},\nurl = {http://www.oracle.com/technetwork/articles/brosig-wldf-086367.html},\nyear = {2009}\n}\n
\n
\nThroughout the system life cycle, the ability to predict a software system\'s performance under different configurations and workloads is highly valuable to ensure that the system meets its performance requirements. During the design phase, performance prediction helps to evaluate different design alternatives. At deployment time, it facilitates system sizing and capacity planning. During operation, predicting the effect of changes in the workload or in the system configuration is beneficial for run-time performance management. The alternative to performance prediction is to deploy the system in an environment reflecting the configuration of interest and conduct experiments measuring the system performance under the respective workloads. Such experiments, however, are normally very expensive and time-consuming and therefore often considered not to be economically viable. To enable performance prediction we need an abstraction of the real system that incorporates performance-relevant data, i.e., a performance model. Based on such a model, performance analysis can be carried out. Unfortunately, building predictive performance models manually requires a lot of time and effort. The model must be designed to reflect the abstract system structure and capture its performance-relevant aspects. In addition, model parameters like resource demands or system configuration parameters have to be determined. Given the costs of building performance models, techniques for automatic extraction of models based on observation of the system at run-time are highly desirable. During system development, such models can be exploited to evaluate the performance of system prototypes. During operation, an automatically extracted performance model can be applied for efficient and performance-aware resource management. For example, if one observes an increased user workload and assumes a steady workload growth rate, performance predictions help to determine when the system would reach its saturation point. This way, system operators can react to the changing workload before the system has failed to meet its performance objectives thus avoiding a violation of service level agreements (SLAs). Current performance analysis tools used in industry mostly focus on profiling and monitoring transaction response times and resource consumption. The tools often provide large amounts of low level data while important information needed for building performance models is missing, e.g., the resource demands of individual components. In this article, we present a method for automated extraction of performance models for Java EE applications during operation. We implemented the method in a tool prototype and evaluated its effectiveness in the context of a case study with an early prototype of the SPECjEnterprise2009 benchmark application which in the following we will refer to as SPECjEnterprise2009_pre. (SPECjEnterprise2009 is the successor benchmark of the SPECjAppServer2004 benchmark developed by the Standard Performance Evaluation Corp. [SPEC]; SPECjEnterprise is a trademark of SPEC. The SPECjEnterprise2009 results or findings in this publication have not been reviewed or accepted by SPEC, therefore no comparison nor performance inference can be made against any published SPEC result.) The target Java EE platform we consider is Oracle WebLogic Server (WLS). The extraction is based on monitoring data that is collected during operation using the WebLogic Diagnostics Framework (WLDF). As a performance model, we selected the Palladio Component Model (PCM). PCM is a sophisticated performance modeling framework with mature tool support. In contrast to low level mathematical models like, e.g., queueing networks, PCM is a high-level UML-like design-oriented model that captures the performance-relevant aspects of the system architecture. This makes PCM models easy to understand and use by software developers. We begin by providing some background on the technologies we use, focusing on the WLDF monitoring framework and the PCM models. We then describe the model extraction method in more detail. Finally, we present the case study we conducted and conclude with a summary.\n
\n','
\n@misc{BrKoPa2009-OTN-WLDF2PCM,\n  abstract = {Throughout the system life cycle, the ability to predict a software system\'s performance under different configurations and workloads is highly valuable to ensure that the system meets its performance requirements. During the design phase, performance prediction helps to evaluate different design alternatives. At deployment time, it facilitates system sizing and capacity planning. During operation, predicting the effect of changes in the workload or in the system configuration is beneficial for run-time performance management. The alternative to performance prediction is to deploy the system in an environment reflecting the configuration of interest and conduct experiments measuring the system performance under the respective workloads. Such experiments, however, are normally very expensive and time-consuming and therefore often considered not to be economically viable. To enable performance prediction we need an abstraction of the real system that incorporates performance-relevant data, i.e., a performance model. Based on such a model, performance analysis can be carried out. Unfortunately, building predictive performance models manually requires a lot of time and effort. The model must be designed to reflect the abstract system structure and capture its performance-relevant aspects. In addition, model parameters like resource demands or system configuration parameters have to be determined. Given the costs of building performance models, techniques for automatic extraction of models based on observation of the system at run-time are highly desirable. During system development, such models can be exploited to evaluate the performance of system prototypes. During operation, an automatically extracted performance model can be applied for efficient and performance-aware resource management. For example, if one observes an increased user workload and assumes a steady workload growth rate, performance predictions help to determine when the system would reach its saturation point. This way, system operators can react to the changing workload before the system has failed to meet its performance objectives thus avoiding a violation of service level agreements (SLAs). Current performance analysis tools used in industry mostly focus on profiling and monitoring transaction response times and resource consumption. The tools often provide large amounts of low level data while important information needed for building performance models is missing, e.g., the resource demands of individual components. In this article, we present a method for automated extraction of performance models for Java EE applications during operation. We implemented the method in a tool prototype and evaluated its effectiveness in the context of a case study with an early prototype of the SPECjEnterprise2009 benchmark application which in the following we will refer to as SPECjEnterprise2009_pre. (SPECjEnterprise2009 is the successor benchmark of the SPECjAppServer2004 benchmark developed by the Standard Performance Evaluation Corp. [SPEC]; SPECjEnterprise is a trademark of SPEC. The SPECjEnterprise2009 results or findings in this publication have not been reviewed or accepted by SPEC, therefore no comparison nor performance inference can be made against any published SPEC result.) The target Java EE platform we consider is Oracle WebLogic Server (WLS). The extraction is based on monitoring data that is collected during operation using the WebLogic Diagnostics Framework (WLDF). As a performance model, we selected the Palladio Component Model (PCM). PCM is a sophisticated performance modeling framework with mature tool support. In contrast to low level mathematical models like, e.g., queueing networks, PCM is a high-level UML-like design-oriented model that captures the performance-relevant aspects of the system architecture. This makes PCM models easy to understand and use by software developers. We begin by providing some background on the technologies we use, focusing on the WLDF monitoring framework and the PCM models. We then describe the model extraction method in more detail. Finally, we present the case study we conducted and conclude with a summary.},\n  author = {Fabian Brosig and Samuel Kounev and Charles Paclat},\n  howpublished = {Oracle Technology Network (OTN) Article},\n  month = {September},\n  title = {{Using WebLogic Diagnostics Framework to Enable Performance Prediction for Java EE Applications}},\n  url = {http://www.oracle.com/technetwork/articles/brosig-wldf-086367.html},\n  year = {2009}\n}\n
\n\n','Throughout the system life cycle, the ability to predict a software system\'s performance under different configurations and workloads is highly valuable to ensure that the system meets its performance requirements. During the design phase, performance prediction helps to evaluate different design alternatives. At deployment time, it facilitates system sizing and capacity planning. During operation, predicting the effect of changes in the workload or in the system configuration is beneficial for run-time performance management. The alternative to performance prediction is to deploy the system in an environment reflecting the configuration of interest and conduct experiments measuring the system performance under the respective workloads. Such experiments, however, are normally very expensive and time-consuming and therefore often considered not to be economically viable. To enable performance prediction we need an abstraction of the real system that incorporates performance-relevant data, i.e., a performance model. Based on such a model, performance analysis can be carried out. Unfortunately, building predictive performance models manually requires a lot of time and effort. The model must be designed to reflect the abstract system structure and capture its performance-relevant aspects. In addition, model parameters like resource demands or system configuration parameters have to be determined. Given the costs of building performance models, techniques for automatic extraction of models based on observation of the system at run-time are highly desirable. During system development, such models can be exploited to evaluate the performance of system prototypes. During operation, an automatically extracted performance model can be applied for efficient and performance-aware resource management. For example, if one observes an increased user workload and assumes a steady workload growth rate, performance predictions help to determine when the system would reach its saturation point. This way, system operators can react to the changing workload before the system has failed to meet its performance objectives thus avoiding a violation of service level agreements (SLAs). Current performance analysis tools used in industry mostly focus on profiling and monitoring transaction response times and resource consumption. The tools often provide large amounts of low level data while important information needed for building performance models is missing, e.g., the resource demands of individual components. In this article, we present a method for automated extraction of performance models for Java EE applications during operation. We implemented the method in a tool prototype and evaluated its effectiveness in the context of a case study with an early prototype of the SPECjEnterprise2009 benchmark application which in the following we will refer to as SPECjEnterprise2009_pre. (SPECjEnterprise2009 is the successor benchmark of the SPECjAppServer2004 benchmark developed by the Standard Performance Evaluation Corp. [SPEC]; SPECjEnterprise is a trademark of SPEC. The SPECjEnterprise2009 results or findings in this publication have not been reviewed or accepted by SPEC, therefore no comparison nor performance inference can be made against any published SPEC result.) The target Java EE platform we consider is Oracle WebLogic Server (WLS). The extraction is based on monitoring data that is collected during operation using the WebLogic Diagnostics Framework (WLDF). As a performance model, we selected the Palladio Component Model (PCM). PCM is a sophisticated performance modeling framework with mature tool support. In contrast to low level mathematical models like, e.g., queueing networks, PCM is a high-level UML-like design-oriented model that captures the performance-relevant aspects of the system architecture. This makes PCM models easy to understand and use by software developers. We begin by providing some background on the technologies we use, focusing on the WLDF monitoring framework and the PCM models. We then describe the model extraction method in more detail. Finally, we present the case study we conducted and conclude with a summary.','{Using WebLogic Diagnostics Framework to Enable Performance Prediction for Java EE Applications}',0,9,2009,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(101,'paper','comuzzi2009','inproceedings','@inproceedings{comuzzi2009,\n abstract = {Service-Oriented Architectures (SOA) represent an architectural shift for building business applications based on loosely-coupled services. In a multi-layered SOA environment the exact conditions under which services are to be delivered can be formally specified by Service Level Agreements (SLAs). However, typical SLAs are just specified at the customer-level and do not allow service providers to manage their IT stack accordingly as they have no insight on how customer-level SLAs translate to metrics or parameters at the various layers of the IT stack. In this paper we present a technical architecture for a multi-level SLA management framework. We discuss the fundamental components and in- terfaces in this architecture and explain the developed integrated framework. Furthermore, we show results from a qualitative evaluation of the framework in the context of an open reference case.},\n address = {Berlin, Heidelberg},\n author = {Comuzzi, Marco and Kotsokalis, Constantinos and Rathfelder, Christoph and Theilmann, Wolfgang and Winkler, Ulrich and Zacco, Gabriele},\n booktitle = {Service-Oriented Computing. ICSOC/ServiceWave 2009 Workshops},\n day = {23--27},\n doi = {10.1007/978-3-642-16132-2_18},\n editor = {Dan, Asit and Gittler, Fr{\\\'e}d{\\\'e}ric and Toumani, Farouk},\n isbn = {978-3-642-16131-5},\n keyword = {Computer Science},\n location = {Stockholm, Sweden},\n month = {November},\n pages = {187--196},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/101.pdf},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n title = {A Framework for Multi-level SLA Management},\n url = {http://dx.doi.org/10.1007/978-3-642-16132-2_18},\n volume = {6275},\n year = {2010},\n}\n\n','\n\nMarco Comuzzi, Constantinos Kotsokalis, Christoph Rathfelder, Wolfgang\nTheilmann, Ulrich Winkler, and Gabriele Zacco.\nA framework for multi-level sla management.\nIn Service-Oriented Computing. ICSOC/ServiceWave 2009\nWorkshops, Asit Dan, Frédéric Gittler, and Farouk Toumani, editors,\nStockholm, Sweden, November 23-27, 2010, volume 6275 of Lecture Notes\nin Computer Science, pages 187-196. Springer, Berlin, Heidelberg.\nNovember 2010.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{comuzzi2009,\nabstract = {Service-Oriented Architectures (SOA) represent an architectural shift for building business applications based on loosely-coupled services. In a multi-layered SOA environment the exact conditions under which services are to be delivered can be formally specified by Service Level Agreements (SLAs). However, typical SLAs are just specified at the customer-level and do not allow service providers to manage their IT stack accordingly as they have no insight on how customer-level SLAs translate to metrics or parameters at the various layers of the IT stack. In this paper we present a technical architecture for a multi-level SLA management framework. We discuss the fundamental components and in- terfaces in this architecture and explain the developed integrated framework. Furthermore, we show results from a qualitative evaluation of the framework in the context of an open reference case.},\naddress = {Berlin, Heidelberg},\nauthor = {Comuzzi, Marco and Kotsokalis, Constantinos and Rathfelder, Christoph and Theilmann, Wolfgang and Winkler, Ulrich and Zacco, Gabriele},\nbooktitle = {Service-Oriented Computing. ICSOC/ServiceWave 2009 Workshops},\nday = {23--27},\ndoi = {10.1007/978-3-642-16132-2_18},\neditor = {Dan, Asit and Gittler, Fr{\\\'e}d{\\\'e}ric and Toumani, Farouk},\nisbn = {978-3-642-16131-5},\nkeyword = {Computer Science},\nlocation = {Stockholm, Sweden},\nmonth = {November},\npages = {187--196},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/101.pdf},\npublisher = {Springer},\nseries = {Lecture Notes in Computer Science},\ntitle = {A Framework for Multi-level SLA Management},\nurl = {http://dx.doi.org/10.1007/978-3-642-16132-2_18},\nvolume = {6275},\nyear = {2010}\n}\n
\n
\nService-Oriented Architectures (SOA) represent an architectural shift for building business applications based on loosely-coupled services. In a multi-layered SOA environment the exact conditions under which services are to be delivered can be formally specified by Service Level Agreements (SLAs). However, typical SLAs are just specified at the customer-level and do not allow service providers to manage their IT stack accordingly as they have no insight on how customer-level SLAs translate to metrics or parameters at the various layers of the IT stack. In this paper we present a technical architecture for a multi-level SLA management framework. We discuss the fundamental components and in- terfaces in this architecture and explain the developed integrated framework. Furthermore, we show results from a qualitative evaluation of the framework in the context of an open reference case.\n
\n','
\n@inproceedings{comuzzi2009,\n  abstract = {Service-Oriented Architectures (SOA) represent an architectural shift for building business applications based on loosely-coupled services. In a multi-layered SOA environment the exact conditions under which services are to be delivered can be formally specified by Service Level Agreements (SLAs). However, typical SLAs are just specified at the customer-level and do not allow service providers to manage their IT stack accordingly as they have no insight on how customer-level SLAs translate to metrics or parameters at the various layers of the IT stack. In this paper we present a technical architecture for a multi-level SLA management framework. We discuss the fundamental components and in- terfaces in this architecture and explain the developed integrated framework. Furthermore, we show results from a qualitative evaluation of the framework in the context of an open reference case.},\n  address = {Berlin, Heidelberg},\n  author = {Comuzzi, Marco and Kotsokalis, Constantinos and Rathfelder, Christoph and Theilmann, Wolfgang and Winkler, Ulrich and Zacco, Gabriele},\n  booktitle = {Service-Oriented Computing. ICSOC/ServiceWave 2009 Workshops},\n  day = {23--27},\n  doi = {10.1007/978-3-642-16132-2_18},\n  editor = {Dan, Asit and Gittler, Fr{\\\'e}d{\\\'e}ric and Toumani, Farouk},\n  isbn = {978-3-642-16131-5},\n  keyword = {Computer Science},\n  location = {Stockholm, Sweden},\n  month = {November},\n  pages = {187--196},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/101.pdf},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  title = {A Framework for Multi-level SLA Management},\n  url = {http://dx.doi.org/10.1007/978-3-642-16132-2_18},\n  volume = {6275},\n  year = {2010}\n}\n
\n\n','Service-Oriented Architectures (SOA) represent an architectural shift for building business applications based on loosely-coupled services. In a multi-layered SOA environment the exact conditions under which services are to be delivered can be formally specified by Service Level Agreements (SLAs). However, typical SLAs are just specified at the customer-level and do not allow service providers to manage their IT stack accordingly as they have no insight on how customer-level SLAs translate to metrics or parameters at the various layers of the IT stack. In this paper we present a technical architecture for a multi-level SLA management framework. We discuss the fundamental components and in- terfaces in this architecture and explain the developed integrated framework. Furthermore, we show results from a qualitative evaluation of the framework in the context of an open reference case.','A Framework for Multi-level SLA Management',0,11,2010,11,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(103,'paper','Westermann2011b','inproceedings','@inproceedings{Westermann2011b,\n author = {Dennis Westermann and Rouven Krebs and Jens Happe},\n booktitle = {Proceedings of the Computer Performance Engineering - 8th European Performance Engineering Workshop (EPEW 2011)},\n day = {12--13},\n location = {Borrowdale, UK},\n month = {October},\n pages = {325-339},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/103.pdf},\n publisher = {Springer},\n title = {{E}fficient {E}xperiment {S}election in {A}utomated {S}oftware {P}erformance {E}valuations},\n year = {2011},\n}\n\n','\n\nDennis Westermann, Rouven Krebs, and Jens Happe.\nEfficient Experiment Selection in Automated Software\nPerformance Evaluations.\nIn Proceedings of the Computer Performance Engineering - 8th\nEuropean Performance Engineering Workshop (EPEW 2011), Borrowdale, UK,\nOctober 12-13, 2011, pages 325-339. Springer.\nOctober 2011.\n[ bib | .pdf  ] 
\n@inproceedings{Westermann2011b,\nauthor = {Dennis Westermann and Rouven Krebs and Jens Happe},\nbooktitle = {Proceedings of the Computer Performance Engineering - 8th European Performance Engineering Workshop (EPEW 2011)},\nday = {12--13},\nlocation = {Borrowdale, UK},\nmonth = {October},\npages = {325-339},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/103.pdf},\npublisher = {Springer},\ntitle = {{E}fficient {E}xperiment {S}election in {A}utomated {S}oftware {P}erformance {E}valuations},\nyear = {2011}\n}\n
\n
\n','
\n@inproceedings{Westermann2011b,\n  author = {Dennis Westermann and Rouven Krebs and Jens Happe},\n  booktitle = {Proceedings of the Computer Performance Engineering - 8th European Performance Engineering Workshop (EPEW 2011)},\n  day = {12--13},\n  location = {Borrowdale, UK},\n  month = {October},\n  pages = {325-339},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/103.pdf},\n  publisher = {Springer},\n  title = {{E}fficient {E}xperiment {S}election in {A}utomated {S}oftware {P}erformance {E}valuations},\n  year = {2011}\n}\n
\n\n',NULL,'{E}fficient {E}xperiment {S}election in {A}utomated {S}oftware {P}erformance {E}valuations',0,10,2011,10,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(125,'paper','Fa2011-KIT-SPAusingML','mastersthesis','@mastersthesis{Fa2011-KIT-SPAusingML,\n address = {Karlsruhe, Germany},\n author = {Michael Faber},\n month = {March},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Software Performance Analysis using Machine Learning Techniques}},\n year = {2011},\n}\n\n','\n\nMichael Faber.\nSoftware Performance Analysis using Machine Learning Techniques.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, March 2011.\n[ bib  ] 
\n@mastersthesis{Fa2011-KIT-SPAusingML,\naddress = {Karlsruhe, Germany},\nauthor = {Michael Faber},\nmonth = {March},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Software Performance Analysis using Machine Learning Techniques}},\nyear = {2011}\n}\n
\n
\n','
\n@mastersthesis{Fa2011-KIT-SPAusingML,\n  address = {Karlsruhe, Germany},\n  author = {Michael Faber},\n  month = {March},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Software Performance Analysis using Machine Learning Techniques}},\n  year = {2011}\n}\n
\n\n',NULL,'{Software Performance Analysis using Machine Learning Techniques}',0,3,2011,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(126,'paper','FaHa2012-ICPE','inproceedings','@inproceedings{FaHa2012-ICPE,\n address = {New York, NY, USA},\n author = {Michael Faber and Jens Happe},\n booktitle = {Proceedings of 3rd ACM/SPEC Internatioanl Conference on Performance Engineering (ICPE 2012)},\n day = {22--25},\n isbn = {978-1-4503-1202-8},\n location = {Boston, USA},\n month = {April},\n pages = {33--44},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/126.pdf},\n publisher = {ACM},\n title = {Systematic adoption of genetic programming for deriving software performance curves},\n url = {http://doi.acm.org/10.1145/2188286.2188295},\n year = {2012},\n}\n\n','\n\nMichael Faber and Jens Happe.\nSystematic adoption of genetic programming for deriving software\nperformance curves.\nIn Proceedings of 3rd ACM/SPEC Internatioanl Conference on\nPerformance Engineering (ICPE 2012), Boston, USA, April 22-25, 2012, pages\n33-44. ACM, New York, NY, USA.\nApril 2012.\n[ bib | http | .pdf  ] 
\n@inproceedings{FaHa2012-ICPE,\naddress = {New York, NY, USA},\nauthor = {Michael Faber and Jens Happe},\nbooktitle = {Proceedings of 3rd ACM/SPEC Internatioanl Conference on Performance Engineering (ICPE 2012)},\nday = {22--25},\nisbn = {978-1-4503-1202-8},\nlocation = {Boston, USA},\nmonth = {April},\npages = {33--44},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/126.pdf},\npublisher = {ACM},\ntitle = {Systematic adoption of genetic programming for deriving software performance curves},\nurl = {http://doi.acm.org/10.1145/2188286.2188295},\nyear = {2012}\n}\n
\n
\n','
\n@inproceedings{FaHa2012-ICPE,\n  address = {New York, NY, USA},\n  author = {Michael Faber and Jens Happe},\n  booktitle = {Proceedings of 3rd ACM/SPEC Internatioanl Conference on Performance Engineering (ICPE 2012)},\n  day = {22--25},\n  isbn = {978-1-4503-1202-8},\n  location = {Boston, USA},\n  month = {April},\n  pages = {33--44},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/126.pdf},\n  publisher = {ACM},\n  title = {Systematic adoption of genetic programming for deriving software performance curves},\n  url = {http://doi.acm.org/10.1145/2188286.2188295},\n  year = {2012}\n}\n
\n\n',NULL,'Systematic adoption of genetic programming for deriving software performance curves',0,4,2012,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(133,'paper','FuBrFa2012-VALUETOOLS-TruthfulResourceReservation','inproceedings','@inproceedings{FuBrFa2012-VALUETOOLS-TruthfulResourceReservation,\n abstract = {{Prudent capacity planning to meet their clients future computational needs is one of the major issues cloud computing providers face today. By offering resource reservations in advance, providers gain insight into the projected demand of their customers and can act accordingly. However, customers need to be given an incentive, e.g. discounts granted, to commit early to a provider and to honestly, i.e., truthfully reserve their predicted future resource requirements. Customers may reserve capacity deviating from their truly predicted demand, in order to exploit the mechanism for their own benefit, thereby causing futile costs for the provider. In this paper we prove, using a game theoretic approach, that truthful reservation is the best, i.e., dominant strategy for customers if they are capable to make precise forecasts of their demands and that deviations from truth-telling can be profitable for customers if their demand forecasts are uncertain.}},\n author = {Funke, Daniel and Brosig, Fabian and Faber, Michael},\n booktitle = {{Proceedings of the 6th International ICST Conference on Performance Evaluation Methodologies and Tools (ValueTools 2012), Carg{`e}se, France}},\n month = {October},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/133.pdf},\n title = {{Towards Truthful Resource Reservation in Cloud Computing}},\n year = {2012},\n}\n\n','\n\nDaniel Funke, Fabian Brosig, and Michael Faber.\nTowards Truthful Resource Reservation in Cloud Computing.\nIn Proceedings of the 6th International ICST Conference on\nPerformance Evaluation Methodologies and Tools (ValueTools 2012), Carg`ese,\nFrance, October 2012.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{FuBrFa2012-VALUETOOLS-TruthfulResourceReservation,\nabstract = {{Prudent capacity planning to meet their clients future computational needs is one of the major issues cloud computing providers face today. By offering resource reservations in advance, providers gain insight into the projected demand of their customers and can act accordingly. However, customers need to be given an incentive, e.g. discounts granted, to commit early to a provider and to honestly, i.e., truthfully reserve their predicted future resource requirements. Customers may reserve capacity deviating from their truly predicted demand, in order to exploit the mechanism for their own benefit, thereby causing futile costs for the provider. In this paper we prove, using a game theoretic approach, that truthful reservation is the best, i.e., dominant strategy for customers if they are capable to make precise forecasts of their demands and that deviations from truth-telling can be profitable for customers if their demand forecasts are uncertain.}},\nauthor = {Funke, Daniel and Brosig, Fabian and Faber, Michael},\nbooktitle = {{Proceedings of the 6th International ICST Conference on Performance Evaluation Methodologies and Tools (ValueTools 2012), Carg{`e}se, France}},\nmonth = {October},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/133.pdf},\ntitle = {{Towards Truthful Resource Reservation in Cloud Computing}},\nyear = {2012}\n}\n
\n
\nPrudent capacity planning to meet their clients future computational needs is one of the major issues cloud computing providers face today. By offering resource reservations in advance, providers gain insight into the projected demand of their customers and can act accordingly. However, customers need to be given an incentive, e.g. discounts granted, to commit early to a provider and to honestly, i.e., truthfully reserve their predicted future resource requirements. Customers may reserve capacity deviating from their truly predicted demand, in order to exploit the mechanism for their own benefit, thereby causing futile costs for the provider. In this paper we prove, using a game theoretic approach, that truthful reservation is the best, i.e., dominant strategy for customers if they are capable to make precise forecasts of their demands and that deviations from truth-telling can be profitable for customers if their demand forecasts are uncertain.\n
\n','
\n@inproceedings{FuBrFa2012-VALUETOOLS-TruthfulResourceReservation,\n  abstract = {{Prudent capacity planning to meet their clients future computational needs is one of the major issues cloud computing providers face today. By offering resource reservations in advance, providers gain insight into the projected demand of their customers and can act accordingly. However, customers need to be given an incentive, e.g. discounts granted, to commit early to a provider and to honestly, i.e., truthfully reserve their predicted future resource requirements. Customers may reserve capacity deviating from their truly predicted demand, in order to exploit the mechanism for their own benefit, thereby causing futile costs for the provider. In this paper we prove, using a game theoretic approach, that truthful reservation is the best, i.e., dominant strategy for customers if they are capable to make precise forecasts of their demands and that deviations from truth-telling can be profitable for customers if their demand forecasts are uncertain.}},\n  author = {Funke, Daniel and Brosig, Fabian and Faber, Michael},\n  booktitle = {{Proceedings of the 6th International ICST Conference on Performance Evaluation Methodologies and Tools (ValueTools 2012), Carg{`e}se, France}},\n  month = {October},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/133.pdf},\n  title = {{Towards Truthful Resource Reservation in Cloud Computing}},\n  year = {2012}\n}\n
\n\n','{Prudent capacity planning to meet their clients future computational needs is one of the major issues cloud computing providers face today. By offering resource reservations in advance, providers gain insight into the projected demand of their customers and can act accordingly. However, customers need to be given an incentive, e.g. discounts granted, to commit early to a provider and to honestly, i.e., truthfully reserve their predicted future resource requirements. Customers may reserve capacity deviating from their truly predicted demand, in order to exploit the mechanism for their own benefit, thereby causing futile costs for the provider. In this paper we prove, using a game theoretic approach, that truthful reservation is the best, i.e., dominant strategy for customers if they are capable to make precise forecasts of their demands and that deviations from truth-telling can be profitable for customers if their demand forecasts are uncertain.}','{Towards Truthful Resource Reservation in Cloud Computing}',0,10,2012,10,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(137,'paper','GiBrNoKoJu2012-ResBook-OnlinePrediction','incollection','@incollection{GiBrNoKoJu2012-ResBook-OnlinePrediction,\n abstract = {{Current computing systems are becoming increasingly complex in nature and exhibit large variations in workloads. These changing environments create challenges to the design of systems that can adapt themselves while maintaining desired Quality of Service (QoS), security, dependability, availability and other non-functional requirements. The next generation of resilient systems will be highly distributed, component-based and service-oriented. They will need to operate in unattended mode and possibly in hostile environments, will be composed of a large number of interchangeable components discoverable at run-time, and will have to run on a multitude of unknown and heterogeneous hardware and network platforms. These computer systems will adapt themselves to cope with changes in the operating conditions and to meet the service-level agreements with a minimum of resources. Changes in operating conditions include hardware and software failures, load variation and variations in user interaction with the system, including security attacks and overwhelming situations. This self adaptation of next resilient systems can be achieved by first online predicting how these situations would be by observation of the current environment. This chapter focuses on the use of online predicting methods, techniques and tools for resilient systems. Thus, we survey online QoS adaptive models in several environments as grid environments, service-oriented architectures and ambient intelligence using different approaches based on queueing networks, model checking, ontology engineering among others.}},\n address = {Berlin, Heidelberg},\n author = {Katja Gilly and Fabian Brosig and Ramon Nou and Samuel Kounev and Carlos Juiz},\n booktitle = {Resilience Assessment and Evaluation of Computing Systems},\n editor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\n isbn = {978-3-642-29031-2},\n note = {ISBN: 978-3-642-29031-2},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/137.pdf},\n publisher = {Springer-Verlag},\n series = {XVIII},\n title = {Online prediction: Four case studies},\n url = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\n year = {2012},\n}\n\n','\n\nKatja Gilly, Fabian Brosig, Ramon Nou, Samuel Kounev, and Carlos Juiz.\nOnline prediction: Four case studies.\nIn Resilience Assessment and Evaluation of Computing Systems,\nK. Wolter, A. Avritzer, M. Vieira, and A. van Moorsel, editors, XVIII.\nSpringer-Verlag, Berlin, Heidelberg, 2012.\nISBN: 978-3-642-29031-2.\n[ bib | http | .pdf | Abstract  ] 
\n@incollection{GiBrNoKoJu2012-ResBook-OnlinePrediction,\nabstract = {{Current computing systems are becoming increasingly complex in nature and exhibit large variations in workloads. These changing environments create challenges to the design of systems that can adapt themselves while maintaining desired Quality of Service (QoS), security, dependability, availability and other non-functional requirements. The next generation of resilient systems will be highly distributed, component-based and service-oriented. They will need to operate in unattended mode and possibly in hostile environments, will be composed of a large number of interchangeable components discoverable at run-time, and will have to run on a multitude of unknown and heterogeneous hardware and network platforms. These computer systems will adapt themselves to cope with changes in the operating conditions and to meet the service-level agreements with a minimum of resources. Changes in operating conditions include hardware and software failures, load variation and variations in user interaction with the system, including security attacks and overwhelming situations. This self adaptation of next resilient systems can be achieved by first online predicting how these situations would be by observation of the current environment. This chapter focuses on the use of online predicting methods, techniques and tools for resilient systems. Thus, we survey online QoS adaptive models in several environments as grid environments, service-oriented architectures and ambient intelligence using different approaches based on queueing networks, model checking, ontology engineering among others.}},\naddress = {Berlin, Heidelberg},\nauthor = {Katja Gilly and Fabian Brosig and Ramon Nou and Samuel Kounev and Carlos Juiz},\nbooktitle = {Resilience Assessment and Evaluation of Computing Systems},\neditor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\nisbn = {978-3-642-29031-2},\nnote = {ISBN: 978-3-642-29031-2},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/137.pdf},\npublisher = {Springer-Verlag},\nseries = {XVIII},\ntitle = {Online prediction: Four case studies},\nurl = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\nyear = {2012}\n}\n
\n
\nCurrent computing systems are becoming increasingly complex in nature and exhibit large variations in workloads. These changing environments create challenges to the design of systems that can adapt themselves while maintaining desired Quality of Service (QoS), security, dependability, availability and other non-functional requirements. The next generation of resilient systems will be highly distributed, component-based and service-oriented. They will need to operate in unattended mode and possibly in hostile environments, will be composed of a large number of interchangeable components discoverable at run-time, and will have to run on a multitude of unknown and heterogeneous hardware and network platforms. These computer systems will adapt themselves to cope with changes in the operating conditions and to meet the service-level agreements with a minimum of resources. Changes in operating conditions include hardware and software failures, load variation and variations in user interaction with the system, including security attacks and overwhelming situations. This self adaptation of next resilient systems can be achieved by first online predicting how these situations would be by observation of the current environment. This chapter focuses on the use of online predicting methods, techniques and tools for resilient systems. Thus, we survey online QoS adaptive models in several environments as grid environments, service-oriented architectures and ambient intelligence using different approaches based on queueing networks, model checking, ontology engineering among others.\n
\n','
\n@incollection{GiBrNoKoJu2012-ResBook-OnlinePrediction,\n  abstract = {{Current computing systems are becoming increasingly complex in nature and exhibit large variations in workloads. These changing environments create challenges to the design of systems that can adapt themselves while maintaining desired Quality of Service (QoS), security, dependability, availability and other non-functional requirements. The next generation of resilient systems will be highly distributed, component-based and service-oriented. They will need to operate in unattended mode and possibly in hostile environments, will be composed of a large number of interchangeable components discoverable at run-time, and will have to run on a multitude of unknown and heterogeneous hardware and network platforms. These computer systems will adapt themselves to cope with changes in the operating conditions and to meet the service-level agreements with a minimum of resources. Changes in operating conditions include hardware and software failures, load variation and variations in user interaction with the system, including security attacks and overwhelming situations. This self adaptation of next resilient systems can be achieved by first online predicting how these situations would be by observation of the current environment. This chapter focuses on the use of online predicting methods, techniques and tools for resilient systems. Thus, we survey online QoS adaptive models in several environments as grid environments, service-oriented architectures and ambient intelligence using different approaches based on queueing networks, model checking, ontology engineering among others.}},\n  address = {Berlin, Heidelberg},\n  author = {Katja Gilly and Fabian Brosig and Ramon Nou and Samuel Kounev and Carlos Juiz},\n  booktitle = {Resilience Assessment and Evaluation of Computing Systems},\n  editor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\n  isbn = {978-3-642-29031-2},\n  note = {ISBN: 978-3-642-29031-2},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/137.pdf},\n  publisher = {Springer-Verlag},\n  series = {XVIII},\n  title = {Online prediction: Four case studies},\n  url = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\n  year = {2012}\n}\n
\n\n','{Current computing systems are becoming increasingly complex in nature and exhibit large variations in workloads. These changing environments create challenges to the design of systems that can adapt themselves while maintaining desired Quality of Service (QoS), security, dependability, availability and other non-functional requirements. The next generation of resilient systems will be highly distributed, component-based and service-oriented. They will need to operate in unattended mode and possibly in hostile environments, will be composed of a large number of interchangeable components discoverable at run-time, and will have to run on a multitude of unknown and heterogeneous hardware and network platforms. These computer systems will adapt themselves to cope with changes in the operating conditions and to meet the service-level agreements with a minimum of resources. Changes in operating conditions include hardware and software failures, load variation and variations in user interaction with the system, including security attacks and overwhelming situations. This self adaptation of next resilient systems can be achieved by first online predicting how these situations would be by observation of the current environment. This chapter focuses on the use of online predicting methods, techniques and tools for resilient systems. Thus, we survey online QoS adaptive models in several environments as grid environments, service-oriented architectures and ambient intelligence using different approaches based on queueing networks, model checking, ontology engineering among others.}','Online prediction: Four case studies',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(163,'paper','groenda2009','article','@article{groenda2009,\n author = {Henning Groenda and Christoph Rathfelder and Ralph Mueller},\n journal = {Eclipse Magazine},\n month = {March},\n pages = {8--10},\n timestamp = {2009-04-02},\n title = {{Best of Eclipse DemoCamps - Ein Erfahrungsbericht vom dritten Karlsruher Eclipse DemoCamp}},\n volume = {3},\n year = {2009},\n}\n\n','\n\nHenning Groenda, Christoph Rathfelder, and Ralph Mueller.\nBest of Eclipse DemoCamps - Ein Erfahrungsbericht vom dritten\nKarlsruher Eclipse DemoCamp.\nEclipse Magazine, 3:8-10, March 2009.\n[ bib  ] 
\n@article{groenda2009,\nauthor = {Henning Groenda and Christoph Rathfelder and Ralph Mueller},\njournal = {Eclipse Magazine},\nmonth = {March},\npages = {8--10},\ntimestamp = {2009-04-02},\ntitle = {{Best of Eclipse DemoCamps - Ein Erfahrungsbericht vom dritten Karlsruher Eclipse DemoCamp}},\nvolume = {3},\nyear = {2009}\n}\n
\n
\n','
\n@article{groenda2009,\n  author = {Henning Groenda and Christoph Rathfelder and Ralph Mueller},\n  journal = {Eclipse Magazine},\n  month = {March},\n  pages = {8--10},\n  timestamp = {2009-04-02},\n  title = {{Best of Eclipse DemoCamps - Ein Erfahrungsbericht vom dritten Karlsruher Eclipse DemoCamp}},\n  volume = {3},\n  year = {2009}\n}\n
\n\n',NULL,'{Best of Eclipse DemoCamps - Ein Erfahrungsbericht vom dritten Karlsruher Eclipse DemoCamp}',0,3,2009,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(171,'paper','happe2009a','article','@article{happe2009a,\n abstract = {Performance prediction methods can help software architects to identify potential performance problems, such as bottlenecks, in their software systems during the design phase. In such early stages of the software life-cycle, only a little information is available about the system?s implementation and execution environment. However, these details are crucial for accurate performance predictions. Performance completions close the gap between available high-level models and required low-level details. Using model-driven technologies, transformations can include details of the implementation and execution environment into abstract performance models. However, existing approaches do not consider the relation of actual implementations and performance models used for prediction. Furthermore, they neglect the broad variety of possible implementations and middleware platforms, possible configurations, and possible usage scenarios. In this paper, we (i) establish a formal relation between generated performance models and generated code, (ii) introduce a design and application process for parametric performance completions, and (iii) develop a parametric performance completion for Message-oriented Middleware according to our method. Parametric performance completions are independent of a specific platform, reflect performance-relevant software configurations, and capture the influence of different usage scenarios. To evaluate the prediction accuracy of the completion for Message-oriented Middleware, we conducted a real-world case study with the SPECjms2007 Benchmark [http://www.spec.org/jms2007/]. The observed deviation of measurements and predictions was below 10% to 15%},\n author = {Jens Happe and Steffen Becker and Christoph Rathfelder and Holger Friedrich and Ralf H. Reussner},\n doi = {10.1016/j.peva.2009.07.006},\n journal = {Performance Evaluation (PE)},\n month = {August},\n number = {8},\n pages = {694--716},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/171.pdf},\n publisher = {Elsevier},\n title = {{P}arametric {P}erformance {C}ompletions for {M}odel-{D}riven {P}erformance {P}rediction},\n url = {http://dx.doi.org/10.1016/j.peva.2009.07.006},\n volume = {67},\n year = {2010},\n}\n\n','\n\nJens Happe, Steffen Becker, Christoph Rathfelder, Holger Friedrich, and Ralf H.\nReussner.\nParametric Performance Completions for Model-Driven\nPerformance Prediction.\nPerformance Evaluation (PE), 67(8):694-716, August 2010,\nElsevier.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@article{happe2009a,\nabstract = {Performance prediction methods can help software architects to identify potential performance problems, such as bottlenecks, in their software systems during the design phase. In such early stages of the software life-cycle, only a little information is available about the system?s implementation and execution environment. However, these details are crucial for accurate performance predictions. Performance completions close the gap between available high-level models and required low-level details. Using model-driven technologies, transformations can include details of the implementation and execution environment into abstract performance models. However, existing approaches do not consider the relation of actual implementations and performance models used for prediction. Furthermore, they neglect the broad variety of possible implementations and middleware platforms, possible configurations, and possible usage scenarios. In this paper, we (i) establish a formal relation between generated performance models and generated code, (ii) introduce a design and application process for parametric performance completions, and (iii) develop a parametric performance completion for Message-oriented Middleware according to our method. Parametric performance completions are independent of a specific platform, reflect performance-relevant software configurations, and capture the influence of different usage scenarios. To evaluate the prediction accuracy of the completion for Message-oriented Middleware, we conducted a real-world case study with the SPECjms2007 Benchmark [http://www.spec.org/jms2007/]. The observed deviation of measurements and predictions was below 10% to 15%},\nauthor = {Jens Happe and Steffen Becker and Christoph Rathfelder and Holger Friedrich and Ralf H. Reussner},\ndoi = {10.1016/j.peva.2009.07.006},\njournal = {Performance Evaluation (PE)},\nmonth = {August},\nnumber = {8},\npages = {694--716},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/171.pdf},\npublisher = {Elsevier},\ntitle = {{P}arametric {P}erformance {C}ompletions for {M}odel-{D}riven {P}erformance {P}rediction},\nurl = {http://dx.doi.org/10.1016/j.peva.2009.07.006},\nvolume = {67},\nyear = {2010}\n}\n
\n
\nPerformance prediction methods can help software architects to identify potential performance problems, such as bottlenecks, in their software systems during the design phase. In such early stages of the software life-cycle, only a little information is available about the system?s implementation and execution environment. However, these details are crucial for accurate performance predictions. Performance completions close the gap between available high-level models and required low-level details. Using model-driven technologies, transformations can include details of the implementation and execution environment into abstract performance models. However, existing approaches do not consider the relation of actual implementations and performance models used for prediction. Furthermore, they neglect the broad variety of possible implementations and middleware platforms, possible configurations, and possible usage scenarios. In this paper, we (i) establish a formal relation between generated performance models and generated code, (ii) introduce a design and application process for parametric performance completions, and (iii) develop a parametric performance completion for Message-oriented Middleware according to our method. Parametric performance completions are independent of a specific platform, reflect performance-relevant software configurations, and capture the influence of different usage scenarios. To evaluate the prediction accuracy of the completion for Message-oriented Middleware, we conducted a real-world case study with the SPECjms2007 Benchmark [http://www.spec.org/jms2007/]. The observed deviation of measurements and predictions was below 10% to 15%\n
\n','
\n@article{happe2009a,\n  abstract = {Performance prediction methods can help software architects to identify potential performance problems, such as bottlenecks, in their software systems during the design phase. In such early stages of the software life-cycle, only a little information is available about the system?s implementation and execution environment. However, these details are crucial for accurate performance predictions. Performance completions close the gap between available high-level models and required low-level details. Using model-driven technologies, transformations can include details of the implementation and execution environment into abstract performance models. However, existing approaches do not consider the relation of actual implementations and performance models used for prediction. Furthermore, they neglect the broad variety of possible implementations and middleware platforms, possible configurations, and possible usage scenarios. In this paper, we (i) establish a formal relation between generated performance models and generated code, (ii) introduce a design and application process for parametric performance completions, and (iii) develop a parametric performance completion for Message-oriented Middleware according to our method. Parametric performance completions are independent of a specific platform, reflect performance-relevant software configurations, and capture the influence of different usage scenarios. To evaluate the prediction accuracy of the completion for Message-oriented Middleware, we conducted a real-world case study with the SPECjms2007 Benchmark [http://www.spec.org/jms2007/]. The observed deviation of measurements and predictions was below 10% to 15%},\n  author = {Jens Happe and Steffen Becker and Christoph Rathfelder and Holger Friedrich and Ralf H. Reussner},\n  doi = {10.1016/j.peva.2009.07.006},\n  journal = {Performance Evaluation (PE)},\n  month = {August},\n  number = {8},\n  pages = {694--716},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/171.pdf},\n  publisher = {Elsevier},\n  title = {{P}arametric {P}erformance {C}ompletions for {M}odel-{D}riven {P}erformance {P}rediction},\n  url = {http://dx.doi.org/10.1016/j.peva.2009.07.006},\n  volume = {67},\n  year = {2010}\n}\n
\n\n','Performance prediction methods can help software architects to identify potential performance problems, such as bottlenecks, in their software systems during the design phase. In such early stages of the software life-cycle, only a little information is available about the system?s implementation and execution environment. However, these details are crucial for accurate performance predictions. Performance completions close the gap between available high-level models and required low-level details. Using model-driven technologies, transformations can include details of the implementation and execution environment into abstract performance models. However, existing approaches do not consider the relation of actual implementations and performance models used for prediction. Furthermore, they neglect the broad variety of possible implementations and middleware platforms, possible configurations, and possible usage scenarios. In this paper, we (i) establish a formal relation between generated performance models and generated code, (ii) introduce a design and application process for parametric performance completions, and (iii) develop a parametric performance completion for Message-oriented Middleware according to our method. Parametric performance completions are independent of a specific platform, reflect performance-relevant software configurations, and capture the influence of different usage scenarios. To evaluate the prediction accuracy of the completion for Message-oriented Middleware, we conducted a real-world case study with the SPECjms2007 Benchmark [http://www.spec.org/jms2007/]. The observed deviation of measurements and predictions was below 10% to 15%','{P}arametric {P}erformance {C}ompletions for {M}odel-{D}riven {P}erformance {P}rediction',0,8,2010,8,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(179,'paper','happe2010a','inproceedings','@inproceedings{happe2010a,\n abstract = {Software performance engineering (SPE) enables software architects to ensure high performance standards for their applications. However, applying SPE in practice is still challenging. Most enterprise applications include a large software basis, such as middleware and legacy systems. In many cases, the software basis is the determining factor of the system\'s overall timing behavior, throughput, and resource utilization. To capture these influences on the overall system\'s performance, established performance prediction methods (modelbased and analytical) rely on models that describe the performance-relevant aspects of the system under study. Creating such models requires detailed knowledge on the system\'s structure and behavior that, in most cases, is not available. In this paper, we abstract from the internal structure of the system under study. We focus our efforts on message-oriented middleware and analyze the dependency between the MOM\'s usage and its performance. We use statistical inference to conclude these dependencies from observations. For ActiveMQ 5.3, the resulting functions predict the performance with an relative mean square error 0.1.},\n author = {Jens Happe and Dennis Westermann and Kai Sachs and Lucia Kapova},\n booktitle = {{Research into Practice - Reality and Gaps (Proceedings of QoSA 2010)}},\n editor = {George Heineman and Jan Kofron and Frantisek Plasil},\n pages = {20--35},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/179.pdf},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science (LNCS)},\n title = {{Statistical Inference of Software Performance Models for Parametric Performance Completions}},\n volume = {6093},\n year = {2010},\n}\n\n','\n\nJens Happe, Dennis Westermann, Kai Sachs, and Lucia Kapova.\nStatistical Inference of Software Performance Models for Parametric\nPerformance Completions.\nIn Research into Practice - Reality and Gaps (Proceedings of\nQoSA 2010), George Heineman, Jan Kofron, and Frantisek Plasil, editors,\n2010, volume 6093 of Lecture Notes in Computer Science (LNCS), pages\n20-35. Springer.\n2010.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{happe2010a,\nabstract = {Software performance engineering (SPE) enables software architects to ensure high performance standards for their applications. However, applying SPE in practice is still challenging. Most enterprise applications include a large software basis, such as middleware and legacy systems. In many cases, the software basis is the determining factor of the system\'s overall timing behavior, throughput, and resource utilization. To capture these influences on the overall system\'s performance, established performance prediction methods (modelbased and analytical) rely on models that describe the performance-relevant aspects of the system under study. Creating such models requires detailed knowledge on the system\'s structure and behavior that, in most cases, is not available. In this paper, we abstract from the internal structure of the system under study. We focus our efforts on message-oriented middleware and analyze the dependency between the MOM\'s usage and its performance. We use statistical inference to conclude these dependencies from observations. For ActiveMQ 5.3, the resulting functions predict the performance with an relative mean square error 0.1.},\nauthor = {Jens Happe and Dennis Westermann and Kai Sachs and Lucia Kapova},\nbooktitle = {{Research into Practice - Reality and Gaps (Proceedings of QoSA 2010)}},\neditor = {George Heineman and Jan Kofron and Frantisek Plasil},\npages = {20--35},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/179.pdf},\npublisher = {Springer},\nseries = {Lecture Notes in Computer Science (LNCS)},\ntitle = {{Statistical Inference of Software Performance Models for Parametric Performance Completions}},\nvolume = {6093},\nyear = {2010}\n}\n
\n
\nSoftware performance engineering (SPE) enables software architects to ensure high performance standards for their applications. However, applying SPE in practice is still challenging. Most enterprise applications include a large software basis, such as middleware and legacy systems. In many cases, the software basis is the determining factor of the system\'s overall timing behavior, throughput, and resource utilization. To capture these influences on the overall system\'s performance, established performance prediction methods (modelbased and analytical) rely on models that describe the performance-relevant aspects of the system under study. Creating such models requires detailed knowledge on the system\'s structure and behavior that, in most cases, is not available. In this paper, we abstract from the internal structure of the system under study. We focus our efforts on message-oriented middleware and analyze the dependency between the MOM\'s usage and its performance. We use statistical inference to conclude these dependencies from observations. For ActiveMQ 5.3, the resulting functions predict the performance with an relative mean square error 0.1.\n
\n','
\n@inproceedings{happe2010a,\n  abstract = {Software performance engineering (SPE) enables software architects to ensure high performance standards for their applications. However, applying SPE in practice is still challenging. Most enterprise applications include a large software basis, such as middleware and legacy systems. In many cases, the software basis is the determining factor of the system\'s overall timing behavior, throughput, and resource utilization. To capture these influences on the overall system\'s performance, established performance prediction methods (modelbased and analytical) rely on models that describe the performance-relevant aspects of the system under study. Creating such models requires detailed knowledge on the system\'s structure and behavior that, in most cases, is not available. In this paper, we abstract from the internal structure of the system under study. We focus our efforts on message-oriented middleware and analyze the dependency between the MOM\'s usage and its performance. We use statistical inference to conclude these dependencies from observations. For ActiveMQ 5.3, the resulting functions predict the performance with an relative mean square error 0.1.},\n  author = {Jens Happe and Dennis Westermann and Kai Sachs and Lucia Kapova},\n  booktitle = {{Research into Practice - Reality and Gaps (Proceedings of QoSA 2010)}},\n  editor = {George Heineman and Jan Kofron and Frantisek Plasil},\n  pages = {20--35},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/179.pdf},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science (LNCS)},\n  title = {{Statistical Inference of Software Performance Models for Parametric Performance Completions}},\n  volume = {6093},\n  year = {2010}\n}\n
\n\n','Software performance engineering (SPE) enables software architects to ensure high performance standards for their applications. However, applying SPE in practice is still challenging. Most enterprise applications include a large software basis, such as middleware and legacy systems. In many cases, the software basis is the determining factor of the system\'s overall timing behavior, throughput, and resource utilization. To capture these influences on the overall system\'s performance, established performance prediction methods (modelbased and analytical) rely on models that describe the performance-relevant aspects of the system under study. Creating such models requires detailed knowledge on the system\'s structure and behavior that, in most cases, is not available. In this paper, we abstract from the internal structure of the system under study. We focus our efforts on message-oriented middleware and analyze the dependency between the MOM\'s usage and its performance. We use statistical inference to conclude these dependencies from observations. For ActiveMQ 5.3, the resulting functions predict the performance with an relative mean square error 0.1.','{Statistical Inference of Software Performance Models for Parametric Performance Completions}',0,0,2010,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(186,'paper','hauck2010b','techreport','@techreport{hauck2010b,\n author = {Michael Hauck and Matthias Huber and Markus Klems and Samuel Kounev and J{\\\"o}rn M{\\\"u}ller-Quade and Alexander Pretschner and Ralf Reussner and Stefan Tai},\n institution = {Karlsruhe Institue of Technology, Faculty of Informatics},\n number = {2010-19},\n title = {{Challenges and Opportunities of Cloud Computing -- Trade-off Decisions in Cloud Computing Architecture}},\n url = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000020328},\n year = {2010},\n}\n\n','\n\nMichael Hauck, Matthias Huber, Markus Klems, Samuel Kounev, Jörn\nMüller-Quade, Alexander Pretschner, Ralf Reussner, and Stefan Tai.\nChallenges and Opportunities of Cloud Computing - Trade-off\nDecisions in Cloud Computing Architecture.\nTechnical Report 2010-19, Karlsruhe Institue of Technology, Faculty\nof Informatics, 2010.\n[ bib | http  ] 
\n@techreport{hauck2010b,\nauthor = {Michael Hauck and Matthias Huber and Markus Klems and Samuel Kounev and J{\\\"o}rn M{\\\"u}ller-Quade and Alexander Pretschner and Ralf Reussner and Stefan Tai},\ninstitution = {Karlsruhe Institue of Technology, Faculty of Informatics},\nnumber = {2010-19},\ntitle = {{Challenges and Opportunities of Cloud Computing -- Trade-off Decisions in Cloud Computing Architecture}},\nurl = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000020328},\nyear = {2010}\n}\n
\n
\n','
\n@techreport{hauck2010b,\n  author = {Michael Hauck and Matthias Huber and Markus Klems and Samuel Kounev and J{\\\"o}rn M{\\\"u}ller-Quade and Alexander Pretschner and Ralf Reussner and Stefan Tai},\n  institution = {Karlsruhe Institue of Technology, Faculty of Informatics},\n  number = {2010-19},\n  title = {{Challenges and Opportunities of Cloud Computing -- Trade-off Decisions in Cloud Computing Architecture}},\n  url = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000020328},\n  year = {2010}\n}\n
\n\n',NULL,'{Challenges and Opportunities of Cloud Computing -- Trade-off Decisions in Cloud Computing Architecture}',0,0,2010,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(187,'paper','hauck2013a','article','@article{hauck2013a,\n abstract = {To predict the performance of an application, it is crucial to consider the performance of the underlying infrastructure. Thus, to yield accurate prediction results, performance-relevant properties and behaviour of the infrastructure have to be integrated into performance models. However, capturing these properties is a cumbersome and error-prone task, as it requires carefully engineered measurements and experiments. Existing approaches for creating infrastructure performance models require manual coding of these experiments, or ignore the detailed properties in the models. The contribution of this paper is the Ginpex approach, which introduces goal-oriented and model-based specification and generation of executable performance experiments for automatically detecting and quantifying performance-relevant infrastructure properties. Ginpex provides a metamodel for experiment specification and comes with predefined experiment templates that provide automated experiment execution on the target platform and also automate the evaluation of the experiment results. We evaluate Ginpex using three case studies, where experiments are executed to quantify various infrastructure properties.},\n author = {Michael Hauck and Michael Kuperberg and Nikolaus Huber and Ralf Reussner},\n doi = {10.1007/s10270-013-0335-7},\n issn = {1619-1366},\n journal = {Software & Systems Modeling},\n pages = {1-21},\n publisher = {Springer-Verlag},\n title = {Deriving performance-relevant infrastructure properties through model-based experiments with Ginpex},\n url = {http://dx.doi.org/10.1007/s10270-013-0335-7},\n year = {2013},\n}\n\n','\n\nMichael Hauck, Michael Kuperberg, Nikolaus Huber, and Ralf Reussner.\nDeriving performance-relevant infrastructure properties through\nmodel-based experiments with ginpex.\nSoftware & Systems Modeling, pages 1-21, 2013,\nSpringer-Verlag.\n[ bib | DOI | http | Abstract  ] 
\n@article{hauck2013a,\nabstract = {To predict the performance of an application, it is crucial to consider the performance of the underlying infrastructure. Thus, to yield accurate prediction results, performance-relevant properties and behaviour of the infrastructure have to be integrated into performance models. However, capturing these properties is a cumbersome and error-prone task, as it requires carefully engineered measurements and experiments. Existing approaches for creating infrastructure performance models require manual coding of these experiments, or ignore the detailed properties in the models. The contribution of this paper is the Ginpex approach, which introduces goal-oriented and model-based specification and generation of executable performance experiments for automatically detecting and quantifying performance-relevant infrastructure properties. Ginpex provides a metamodel for experiment specification and comes with predefined experiment templates that provide automated experiment execution on the target platform and also automate the evaluation of the experiment results. We evaluate Ginpex using three case studies, where experiments are executed to quantify various infrastructure properties.},\nauthor = {Michael Hauck and Michael Kuperberg and Nikolaus Huber and Ralf Reussner},\ndoi = {10.1007/s10270-013-0335-7},\nissn = {1619-1366},\njournal = {Software & Systems Modeling},\npages = {1-21},\npublisher = {Springer-Verlag},\ntitle = {Deriving performance-relevant infrastructure properties through model-based experiments with Ginpex},\nurl = {http://dx.doi.org/10.1007/s10270-013-0335-7},\nyear = {2013}\n}\n
\n
\nTo predict the performance of an application, it is crucial to consider the performance of the underlying infrastructure. Thus, to yield accurate prediction results, performance-relevant properties and behaviour of the infrastructure have to be integrated into performance models. However, capturing these properties is a cumbersome and error-prone task, as it requires carefully engineered measurements and experiments. Existing approaches for creating infrastructure performance models require manual coding of these experiments, or ignore the detailed properties in the models. The contribution of this paper is the Ginpex approach, which introduces goal-oriented and model-based specification and generation of executable performance experiments for automatically detecting and quantifying performance-relevant infrastructure properties. Ginpex provides a metamodel for experiment specification and comes with predefined experiment templates that provide automated experiment execution on the target platform and also automate the evaluation of the experiment results. We evaluate Ginpex using three case studies, where experiments are executed to quantify various infrastructure properties.\n
\n','
\n@article{hauck2013a,\n  abstract = {To predict the performance of an application, it is crucial to consider the performance of the underlying infrastructure. Thus, to yield accurate prediction results, performance-relevant properties and behaviour of the infrastructure have to be integrated into performance models. However, capturing these properties is a cumbersome and error-prone task, as it requires carefully engineered measurements and experiments. Existing approaches for creating infrastructure performance models require manual coding of these experiments, or ignore the detailed properties in the models. The contribution of this paper is the Ginpex approach, which introduces goal-oriented and model-based specification and generation of executable performance experiments for automatically detecting and quantifying performance-relevant infrastructure properties. Ginpex provides a metamodel for experiment specification and comes with predefined experiment templates that provide automated experiment execution on the target platform and also automate the evaluation of the experiment results. We evaluate Ginpex using three case studies, where experiments are executed to quantify various infrastructure properties.},\n  author = {Michael Hauck and Michael Kuperberg and Nikolaus Huber and Ralf Reussner},\n  doi = {10.1007/s10270-013-0335-7},\n  issn = {1619-1366},\n  journal = {Software & Systems Modeling},\n  pages = {1-21},\n  publisher = {Springer-Verlag},\n  title = {Deriving performance-relevant infrastructure properties through model-based experiments with Ginpex},\n  url = {http://dx.doi.org/10.1007/s10270-013-0335-7},\n  year = {2013}\n}\n
\n\n','To predict the performance of an application, it is crucial to consider the performance of the underlying infrastructure. Thus, to yield accurate prediction results, performance-relevant properties and behaviour of the infrastructure have to be integrated into performance models. However, capturing these properties is a cumbersome and error-prone task, as it requires carefully engineered measurements and experiments. Existing approaches for creating infrastructure performance models require manual coding of these experiments, or ignore the detailed properties in the models. The contribution of this paper is the Ginpex approach, which introduces goal-oriented and model-based specification and generation of executable performance experiments for automatically detecting and quantifying performance-relevant infrastructure properties. Ginpex provides a metamodel for experiment specification and comes with predefined experiment templates that provide automated experiment execution on the target platform and also automate the evaluation of the experiment results. We evaluate Ginpex using three case studies, where experiments are executed to quantify various infrastructure properties.','Deriving performance-relevant infrastructure properties through model-based experiments with Ginpex',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(188,'paper','hauck2011b','inproceedings','@inproceedings{hauck2011b,\n address = {New York, NY, USA},\n author = {Michael Hauck and Michael Kuperberg and Nikolaus Huber and Ralf Reussner},\n booktitle = {Proceedings of the 7th ACM SIGSOFT International Conference on the Quality of Software Architectures (QoSA 2011)},\n day = {20--24},\n doi = {http://doi.acm.org/10.1145/2000259.2000269},\n isbn = {978-1-4503-0724-6},\n month = {June},\n numpages = {10},\n pages = {53--62},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/188.pdf},\n publisher = {ACM},\n title = {{Ginpex: Deriving Performance-relevant Infrastructure Properties Through Goal-oriented Experiments}},\n year = {2011},\n}\n\n','\n\nMichael Hauck, Michael Kuperberg, Nikolaus Huber, and Ralf Reussner.\nGinpex: Deriving Performance-relevant Infrastructure Properties\nThrough Goal-oriented Experiments.\nIn Proceedings of the 7th ACM SIGSOFT International Conference\non the Quality of Software Architectures (QoSA 2011), June 20-24, 2011,\npages 53-62. ACM, New York, NY, USA.\nJune 2011.\n[ bib | DOI | .pdf  ] 
\n@inproceedings{hauck2011b,\naddress = {New York, NY, USA},\nauthor = {Michael Hauck and Michael Kuperberg and Nikolaus Huber and Ralf Reussner},\nbooktitle = {Proceedings of the 7th ACM SIGSOFT International Conference on the Quality of Software Architectures (QoSA 2011)},\nday = {20--24},\ndoi = {http://doi.acm.org/10.1145/2000259.2000269},\nisbn = {978-1-4503-0724-6},\nmonth = {June},\nnumpages = {10},\npages = {53--62},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/188.pdf},\npublisher = {ACM},\ntitle = {{Ginpex: Deriving Performance-relevant Infrastructure Properties Through Goal-oriented Experiments}},\nyear = {2011}\n}\n
\n
\n','
\n@inproceedings{hauck2011b,\n  address = {New York, NY, USA},\n  author = {Michael Hauck and Michael Kuperberg and Nikolaus Huber and Ralf Reussner},\n  booktitle = {Proceedings of the 7th ACM SIGSOFT International Conference on the Quality of Software Architectures (QoSA 2011)},\n  day = {20--24},\n  doi = {http://doi.acm.org/10.1145/2000259.2000269},\n  isbn = {978-1-4503-0724-6},\n  month = {June},\n  numpages = {10},\n  pages = {53--62},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/188.pdf},\n  publisher = {ACM},\n  title = {{Ginpex: Deriving Performance-relevant Infrastructure Properties Through Goal-oriented Experiments}},\n  year = {2011}\n}\n
\n\n',NULL,'{Ginpex: Deriving Performance-relevant Infrastructure Properties Through Goal-oriented Experiments}',0,6,2011,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(201,'paper','Herbst2012a','mastersthesis','@mastersthesis{Herbst2012a,\n abstract = {{Virtualization technologies enable dynamic allocation of computing resources to execution environments at run-time. To exploit optimisation potential that comes with these degrees of freedom, forecasts of the arriving work\'s intensity are valuable information, to continuously ensure a defined quality of service (QoS) definition and at the same time to improve the efficiency of the resource utilisation. Time series analysis offers a broad spectrum of methods for calculation of forecasts based on periodically monitored values. Related work in the field of proactive resource provisioning mostly concentrate on single methods of the time series analysis and their individual optimisation potential. This way, usable forecast results are achieved only in certain situations. In this thesis, established methods of the time series analysis are surveyed and grouped concerning their strengths and weaknesses. A dynamic approach is presented that selects based on a decision tree and direct feedback cycles, capturing the forecast accuracy, the suitable method for a given situation. The user needs to provide only his general forecast objectives. An implementation of the introduced theoretical approach is presented that continuously provides forecasts of the arriving work\'s intensity in configurable intervals and with controllable computational overhead during run-time. Based on real-world intensity traces, a number of different experiments and a case study is conducted. The results show, that by use of the implementation the relative error of the forecast points in relation to the arriving observations is reduced by 63% in average compared to the results of a statically selected, sophisticated method. In a case study, between 52% and 70% of the violations of a given service level agreement are prevented by applying proactive resource provisioning based on the forecast results of the introduced implementation.}},\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n author = {Nikolas Roman Herbst},\n keywords = {Cloud, Resource Elasticity, Workload, Forecasting, Time Series},\n note = {Forschungszentrum Informatik (FZI) Prize \"Best Diploma Thesis\"},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/201.pdf},\n school = {{Karlsruhe Institute of Technology (KIT)}},\n title = {{Workload Classification and Forecasting}},\n type = {{Diploma Thesis}},\n year = {2012},\n}\n\n','\n\nNikolas Roman Herbst.\nWorkload Classification and Forecasting.\nDiploma Thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, 2012.\nForschungszentrum Informatik (FZI) Prize \"Best Diploma\nThesis\".\n[ bib | .pdf | Abstract  ] 
\n@mastersthesis{Herbst2012a,\nabstract = {{Virtualization technologies enable dynamic allocation of computing resources to execution environments at run-time. To exploit optimisation potential that comes with these degrees of freedom, forecasts of the arriving work\'s intensity are valuable information, to continuously ensure a defined quality of service (QoS) definition and at the same time to improve the efficiency of the resource utilisation. Time series analysis offers a broad spectrum of methods for calculation of forecasts based on periodically monitored values. Related work in the field of proactive resource provisioning mostly concentrate on single methods of the time series analysis and their individual optimisation potential. This way, usable forecast results are achieved only in certain situations. In this thesis, established methods of the time series analysis are surveyed and grouped concerning their strengths and weaknesses. A dynamic approach is presented that selects based on a decision tree and direct feedback cycles, capturing the forecast accuracy, the suitable method for a given situation. The user needs to provide only his general forecast objectives. An implementation of the introduced theoretical approach is presented that continuously provides forecasts of the arriving work\'s intensity in configurable intervals and with controllable computational overhead during run-time. Based on real-world intensity traces, a number of different experiments and a case study is conducted. The results show, that by use of the implementation the relative error of the forecast points in relation to the arriving observations is reduced by 63% in average compared to the results of a statically selected, sophisticated method. In a case study, between 52% and 70% of the violations of a given service level agreement are prevented by applying proactive resource provisioning based on the forecast results of the introduced implementation.}},\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nauthor = {Nikolas Roman Herbst},\nkeywords = {Cloud, Resource Elasticity, Workload, Forecasting, Time Series},\nnote = {Forschungszentrum Informatik (FZI) Prize \"Best Diploma Thesis\"},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/201.pdf},\nschool = {{Karlsruhe Institute of Technology (KIT)}},\ntitle = {{Workload Classification and Forecasting}},\ntype = {{Diploma Thesis}},\nyear = {2012}\n}\n
\n
\nVirtualization technologies enable dynamic allocation of computing resources to execution environments at run-time. To exploit optimisation potential that comes with these degrees of freedom, forecasts of the arriving work\'s intensity are valuable information, to continuously ensure a defined quality of service (QoS) definition and at the same time to improve the efficiency of the resource utilisation. Time series analysis offers a broad spectrum of methods for calculation of forecasts based on periodically monitored values. Related work in the field of proactive resource provisioning mostly concentrate on single methods of the time series analysis and their individual optimisation potential. This way, usable forecast results are achieved only in certain situations. In this thesis, established methods of the time series analysis are surveyed and grouped concerning their strengths and weaknesses. A dynamic approach is presented that selects based on a decision tree and direct feedback cycles, capturing the forecast accuracy, the suitable method for a given situation. The user needs to provide only his general forecast objectives. An implementation of the introduced theoretical approach is presented that continuously provides forecasts of the arriving work\'s intensity in configurable intervals and with controllable computational overhead during run-time. Based on real-world intensity traces, a number of different experiments and a case study is conducted. The results show, that by use of the implementation the relative error of the forecast points in relation to the arriving observations is reduced by 63% in average compared to the results of a statically selected, sophisticated method. In a case study, between 52% and 70% of the violations of a given service level agreement are prevented by applying proactive resource provisioning based on the forecast results of the introduced implementation.\n
\n','
\n@mastersthesis{Herbst2012a,\n  abstract = {{Virtualization technologies enable dynamic allocation of computing resources to execution environments at run-time. To exploit optimisation potential that comes with these degrees of freedom, forecasts of the arriving work\'s intensity are valuable information, to continuously ensure a defined quality of service (QoS) definition and at the same time to improve the efficiency of the resource utilisation. Time series analysis offers a broad spectrum of methods for calculation of forecasts based on periodically monitored values. Related work in the field of proactive resource provisioning mostly concentrate on single methods of the time series analysis and their individual optimisation potential. This way, usable forecast results are achieved only in certain situations. In this thesis, established methods of the time series analysis are surveyed and grouped concerning their strengths and weaknesses. A dynamic approach is presented that selects based on a decision tree and direct feedback cycles, capturing the forecast accuracy, the suitable method for a given situation. The user needs to provide only his general forecast objectives. An implementation of the introduced theoretical approach is presented that continuously provides forecasts of the arriving work\'s intensity in configurable intervals and with controllable computational overhead during run-time. Based on real-world intensity traces, a number of different experiments and a case study is conducted. The results show, that by use of the implementation the relative error of the forecast points in relation to the arriving observations is reduced by 63% in average compared to the results of a statically selected, sophisticated method. In a case study, between 52% and 70% of the violations of a given service level agreement are prevented by applying proactive resource provisioning based on the forecast results of the introduced implementation.}},\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  author = {Nikolas Roman Herbst},\n  keywords = {Cloud, Resource Elasticity, Workload, Forecasting, Time Series},\n  note = {Forschungszentrum Informatik (FZI) Prize \"Best Diploma Thesis\"},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/201.pdf},\n  school = {{Karlsruhe Institute of Technology (KIT)}},\n  title = {{Workload Classification and Forecasting}},\n  type = {{Diploma Thesis}},\n  year = {2012}\n}\n
\n\n','{Virtualization technologies enable dynamic allocation of computing resources to execution environments at run-time. To exploit optimisation potential that comes with these degrees of freedom, forecasts of the arriving work\'s intensity are valuable information, to continuously ensure a defined quality of service (QoS) definition and at the same time to improve the efficiency of the resource utilisation. Time series analysis offers a broad spectrum of methods for calculation of forecasts based on periodically monitored values. Related work in the field of proactive resource provisioning mostly concentrate on single methods of the time series analysis and their individual optimisation potential. This way, usable forecast results are achieved only in certain situations. In this thesis, established methods of the time series analysis are surveyed and grouped concerning their strengths and weaknesses. A dynamic approach is presented that selects based on a decision tree and direct feedback cycles, capturing the forecast accuracy, the suitable method for a given situation. The user needs to provide only his general forecast objectives. An implementation of the introduced theoretical approach is presented that continuously provides forecasts of the arriving work\'s intensity in configurable intervals and with controllable computational overhead during run-time. Based on real-world intensity traces, a number of different experiments and a case study is conducted. The results show, that by use of the implementation the relative error of the forecast points in relation to the arriving observations is reduced by 63% in average compared to the results of a statically selected, sophisticated method. In a case study, between 52% and 70% of the violations of a given service level agreement are prevented by applying proactive resource provisioning based on the forecast results of the introduced implementation.}','{Workload Classification and Forecasting}',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(202,'paper','Herbst2011a','mastersthesis','@mastersthesis{Herbst2011a,\n abstract = {{Elasticity is the ability of a software system to dynamically adapt the amount of the resources it provides to clients as their workloads increase or decrease. In the context of cloud computing, automated resizing of a virtual machine\'s resources can be considered as a key step towards optimisation of a system\'s cost and energy efficiency. Existing work on cloud computing is limited to the technical view of implementing elastic systems, and definitions of scalability have not been extended to cover elasticity. This study thesis presents a detailed discussion of elasticity, proposes metrics as well as measurement techniques, and outlines next steps for enabling comparisons between cloud computing offerings on the basis of elasticity. I discuss results of our work on measuring elasticity of thread pools provided by the Java virtual machine, as well as an experiment setup for elastic CPU time slice resizing in a virtualized environment. An experiment setup is presented as future work for dynamically adding and removing z/VM Linux virtual machine instances to a performance relevant group of virtualized servers.}},\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n author = {Nikolas Roman Herbst},\n keywords = {Cloud, Resource Elasticity},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/202.pdf},\n school = {{Karlsruhe Institute of Technology (KIT)}},\n title = {{Quantifying the Impact of Configuration Space for Elasticity Benchmarking}},\n type = {{Study Thesis}},\n year = {2011},\n}\n\n','\n\nNikolas Roman Herbst.\nQuantifying the Impact of Configuration Space for Elasticity\nBenchmarking.\nStudy Thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, 2011.\n[ bib | .pdf | Abstract  ] 
\n@mastersthesis{Herbst2011a,\nabstract = {{Elasticity is the ability of a software system to dynamically adapt the amount of the resources it provides to clients as their workloads increase or decrease. In the context of cloud computing, automated resizing of a virtual machine\'s resources can be considered as a key step towards optimisation of a system\'s cost and energy efficiency. Existing work on cloud computing is limited to the technical view of implementing elastic systems, and definitions of scalability have not been extended to cover elasticity. This study thesis presents a detailed discussion of elasticity, proposes metrics as well as measurement techniques, and outlines next steps for enabling comparisons between cloud computing offerings on the basis of elasticity. I discuss results of our work on measuring elasticity of thread pools provided by the Java virtual machine, as well as an experiment setup for elastic CPU time slice resizing in a virtualized environment. An experiment setup is presented as future work for dynamically adding and removing z/VM Linux virtual machine instances to a performance relevant group of virtualized servers.}},\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nauthor = {Nikolas Roman Herbst},\nkeywords = {Cloud, Resource Elasticity},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/202.pdf},\nschool = {{Karlsruhe Institute of Technology (KIT)}},\ntitle = {{Quantifying the Impact of Configuration Space for Elasticity Benchmarking}},\ntype = {{Study Thesis}},\nyear = {2011}\n}\n
\n
\nElasticity is the ability of a software system to dynamically adapt the amount of the resources it provides to clients as their workloads increase or decrease. In the context of cloud computing, automated resizing of a virtual machine\'s resources can be considered as a key step towards optimisation of a system\'s cost and energy efficiency. Existing work on cloud computing is limited to the technical view of implementing elastic systems, and definitions of scalability have not been extended to cover elasticity. This study thesis presents a detailed discussion of elasticity, proposes metrics as well as measurement techniques, and outlines next steps for enabling comparisons between cloud computing offerings on the basis of elasticity. I discuss results of our work on measuring elasticity of thread pools provided by the Java virtual machine, as well as an experiment setup for elastic CPU time slice resizing in a virtualized environment. An experiment setup is presented as future work for dynamically adding and removing z/VM Linux virtual machine instances to a performance relevant group of virtualized servers.\n
\n','
\n@mastersthesis{Herbst2011a,\n  abstract = {{Elasticity is the ability of a software system to dynamically adapt the amount of the resources it provides to clients as their workloads increase or decrease. In the context of cloud computing, automated resizing of a virtual machine\'s resources can be considered as a key step towards optimisation of a system\'s cost and energy efficiency. Existing work on cloud computing is limited to the technical view of implementing elastic systems, and definitions of scalability have not been extended to cover elasticity. This study thesis presents a detailed discussion of elasticity, proposes metrics as well as measurement techniques, and outlines next steps for enabling comparisons between cloud computing offerings on the basis of elasticity. I discuss results of our work on measuring elasticity of thread pools provided by the Java virtual machine, as well as an experiment setup for elastic CPU time slice resizing in a virtualized environment. An experiment setup is presented as future work for dynamically adding and removing z/VM Linux virtual machine instances to a performance relevant group of virtualized servers.}},\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  author = {Nikolas Roman Herbst},\n  keywords = {Cloud, Resource Elasticity},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/202.pdf},\n  school = {{Karlsruhe Institute of Technology (KIT)}},\n  title = {{Quantifying the Impact of Configuration Space for Elasticity Benchmarking}},\n  type = {{Study Thesis}},\n  year = {2011}\n}\n
\n\n','{Elasticity is the ability of a software system to dynamically adapt the amount of the resources it provides to clients as their workloads increase or decrease. In the context of cloud computing, automated resizing of a virtual machine\'s resources can be considered as a key step towards optimisation of a system\'s cost and energy efficiency. Existing work on cloud computing is limited to the technical view of implementing elastic systems, and definitions of scalability have not been extended to cover elasticity. This study thesis presents a detailed discussion of elasticity, proposes metrics as well as measurement techniques, and outlines next steps for enabling comparisons between cloud computing offerings on the basis of elasticity. I discuss results of our work on measuring elasticity of thread pools provided by the Java virtual machine, as well as an experiment setup for elastic CPU time slice resizing in a virtualized environment. An experiment setup is presented as future work for dynamically adding and removing z/VM Linux virtual machine instances to a performance relevant group of virtualized servers.}','{Quantifying the Impact of Configuration Space for Elasticity Benchmarking}',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(203,'paper','HeHuKoAm2013-ICPE-WorkloadClassificationAndForecasting','inproceedings','@inproceedings{HeHuKoAm2013-ICPE-WorkloadClassificationAndForecasting,\n abstract = {{As modern enterprise software systems become increasingly dynamic, workload forecasting techniques are gaining in importance as a foundation for online capacity planning and resource management. Time series analysis covers a broad spectrum of methods to calculate workload forecasts based on history monitoring data. Related work in the field of workload forecasting mostly concentrates on evaluating specific methods and their individual optimisation potential or on predicting Quality-of-Service (QoS) metrics directly. As a basis, we present a survey on established forecasting methods of the time series analysis concerning their benefits and drawbacks and group them according to their computational overheads. In this paper, we propose a novel self-adaptive approach that selects suitable forecasting methods for a given context based on a decision tree and direct feedback cycles together with a corresponding implementation. The user needs to provide only his general forecasting objectives. In several experiments and case studies based on real world workload traces, we show that our implementation of the approach provides continuous and reliable forecast results at run-time. The results of this extensive evaluation show that the relative error of the individual forecast points is significantly reduced compared to statically applied forecasting methods, e.g. in an exemplary scenario on average by 37%. In a case study, between 55% and 75% of the violations of a given service level agreement can be prevented by applying proactive resource provisioning based on the forecast results of our implementation.}},\n acmid = {2479899},\n address = {New York, NY, USA},\n author = {Nikolas Roman Herbst and Nikolaus Huber and Samuel Kounev and Erich Amrehn},\n booktitle = {Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013)},\n day = {21--24},\n doi = {10.1145/2479871.2479899},\n isbn = {978-1-4503-1636-1},\n keywords = {arrival rate, proactive resource provisioning, time series analysis, workload forecasting},\n location = {Prague, Czech Republic},\n month = {April},\n numpages = {12},\n pages = {187--198},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/203.pdf},\n publisher = {ACM},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/203},\n title = {{Self-Adaptive Workload Classification and Forecasting for Proactive Resource Provisioning}},\n url = {http://doi.acm.org/10.1145/2479871.2479899},\n year = {2013},\n}\n\n','\n\nNikolas Roman Herbst, Nikolaus Huber, Samuel Kounev, and Erich Amrehn.\nSelf-Adaptive Workload Classification and Forecasting for Proactive\nResource Provisioning.\nIn Proceedings of the 4th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2013), Prague, Czech Republic, April 21-24,\n2013, pages 187-198. ACM, New York, NY, USA.\nApril 2013.\n[ bib | DOI | slides | http | .pdf | Abstract  ] 
\n@inproceedings{HeHuKoAm2013-ICPE-WorkloadClassificationAndForecasting,\nabstract = {{As modern enterprise software systems become increasingly dynamic, workload forecasting techniques are gaining in importance as a foundation for online capacity planning and resource management. Time series analysis covers a broad spectrum of methods to calculate workload forecasts based on history monitoring data. Related work in the field of workload forecasting mostly concentrates on evaluating specific methods and their individual optimisation potential or on predicting Quality-of-Service (QoS) metrics directly. As a basis, we present a survey on established forecasting methods of the time series analysis concerning their benefits and drawbacks and group them according to their computational overheads. In this paper, we propose a novel self-adaptive approach that selects suitable forecasting methods for a given context based on a decision tree and direct feedback cycles together with a corresponding implementation. The user needs to provide only his general forecasting objectives. In several experiments and case studies based on real world workload traces, we show that our implementation of the approach provides continuous and reliable forecast results at run-time. The results of this extensive evaluation show that the relative error of the individual forecast points is significantly reduced compared to statically applied forecasting methods, e.g. in an exemplary scenario on average by 37%. In a case study, between 55% and 75% of the violations of a given service level agreement can be prevented by applying proactive resource provisioning based on the forecast results of our implementation.}},\nacmid = {2479899},\naddress = {New York, NY, USA},\nauthor = {Nikolas Roman Herbst and Nikolaus Huber and Samuel Kounev and Erich Amrehn},\nbooktitle = {Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013)},\nday = {21--24},\ndoi = {10.1145/2479871.2479899},\nisbn = {978-1-4503-1636-1},\nkeywords = {arrival rate, proactive resource provisioning, time series analysis, workload forecasting},\nlocation = {Prague, Czech Republic},\nmonth = {April},\nnumpages = {12},\npages = {187--198},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/203.pdf},\npublisher = {ACM},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/203},\ntitle = {{Self-Adaptive Workload Classification and Forecasting for Proactive Resource Provisioning}},\nurl = {http://doi.acm.org/10.1145/2479871.2479899},\nyear = {2013}\n}\n
\n
\nAs modern enterprise software systems become increasingly dynamic, workload forecasting techniques are gaining in importance as a foundation for online capacity planning and resource management. Time series analysis covers a broad spectrum of methods to calculate workload forecasts based on history monitoring data. Related work in the field of workload forecasting mostly concentrates on evaluating specific methods and their individual optimisation potential or on predicting Quality-of-Service (QoS) metrics directly. As a basis, we present a survey on established forecasting methods of the time series analysis concerning their benefits and drawbacks and group them according to their computational overheads. In this paper, we propose a novel self-adaptive approach that selects suitable forecasting methods for a given context based on a decision tree and direct feedback cycles together with a corresponding implementation. The user needs to provide only his general forecasting objectives. In several experiments and case studies based on real world workload traces, we show that our implementation of the approach provides continuous and reliable forecast results at run-time. The results of this extensive evaluation show that the relative error of the individual forecast points is significantly reduced compared to statically applied forecasting methods, e.g. in an exemplary scenario on average by 37%. In a case study, between 55% and 75% of the violations of a given service level agreement can be prevented by applying proactive resource provisioning based on the forecast results of our implementation.\n
\n','
\n@inproceedings{HeHuKoAm2013-ICPE-WorkloadClassificationAndForecasting,\n  abstract = {{As modern enterprise software systems become increasingly dynamic, workload forecasting techniques are gaining in importance as a foundation for online capacity planning and resource management. Time series analysis covers a broad spectrum of methods to calculate workload forecasts based on history monitoring data. Related work in the field of workload forecasting mostly concentrates on evaluating specific methods and their individual optimisation potential or on predicting Quality-of-Service (QoS) metrics directly. As a basis, we present a survey on established forecasting methods of the time series analysis concerning their benefits and drawbacks and group them according to their computational overheads. In this paper, we propose a novel self-adaptive approach that selects suitable forecasting methods for a given context based on a decision tree and direct feedback cycles together with a corresponding implementation. The user needs to provide only his general forecasting objectives. In several experiments and case studies based on real world workload traces, we show that our implementation of the approach provides continuous and reliable forecast results at run-time. The results of this extensive evaluation show that the relative error of the individual forecast points is significantly reduced compared to statically applied forecasting methods, e.g. in an exemplary scenario on average by 37%. In a case study, between 55% and 75% of the violations of a given service level agreement can be prevented by applying proactive resource provisioning based on the forecast results of our implementation.}},\n  acmid = {2479899},\n  address = {New York, NY, USA},\n  author = {Nikolas Roman Herbst and Nikolaus Huber and Samuel Kounev and Erich Amrehn},\n  booktitle = {Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013)},\n  day = {21--24},\n  doi = {10.1145/2479871.2479899},\n  isbn = {978-1-4503-1636-1},\n  keywords = {arrival rate, proactive resource provisioning, time series analysis, workload forecasting},\n  location = {Prague, Czech Republic},\n  month = {April},\n  numpages = {12},\n  pages = {187--198},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/203.pdf},\n  publisher = {ACM},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/203},\n  title = {{Self-Adaptive Workload Classification and Forecasting for Proactive Resource Provisioning}},\n  url = {http://doi.acm.org/10.1145/2479871.2479899},\n  year = {2013}\n}\n
\n\n','{As modern enterprise software systems become increasingly dynamic, workload forecasting techniques are gaining in importance as a foundation for online capacity planning and resource management. Time series analysis covers a broad spectrum of methods to calculate workload forecasts based on history monitoring data. Related work in the field of workload forecasting mostly concentrates on evaluating specific methods and their individual optimisation potential or on predicting Quality-of-Service (QoS) metrics directly. As a basis, we present a survey on established forecasting methods of the time series analysis concerning their benefits and drawbacks and group them according to their computational overheads. In this paper, we propose a novel self-adaptive approach that selects suitable forecasting methods for a given context based on a decision tree and direct feedback cycles together with a corresponding implementation. The user needs to provide only his general forecasting objectives. In several experiments and case studies based on real world workload traces, we show that our implementation of the approach provides continuous and reliable forecast results at run-time. The results of this extensive evaluation show that the relative error of the individual forecast points is significantly reduced compared to statically applied forecasting methods, e.g. in an exemplary scenario on average by 37%. In a case study, between 55% and 75% of the violations of a given service level agreement can be prevented by applying proactive resource provisioning based on the forecast results of our implementation.}','{Self-Adaptive Workload Classification and Forecasting for Proactive Resource Provisioning}',0,4,2013,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(208,'paper','HuKoAm2013-CCPE-WorkloadClassificationAndForecasting','article','@article{HuKoAm2013-CCPE-WorkloadClassificationAndForecasting,\n author = {Nikolas Roman Herbst and Nikolaus Huber and Samuel Kounev and Erich Amrehn},\n title = {{Self-Adaptive Workload Classification and Forecasting for Proactive Resource Provisioning}},\n journal = {Concurrency and Computation - Practice and Experience, John Wiley and Sons, Ltd.},\n year = {2014},\n month = {March},\n issn = {1532-0634},\n volume = {26},\n number = {12},\n pages = {2053--2078},\n url = {http://dx.doi.org/10.1002/cpe.3224},\n doi = {10.1002/cpe.3224},\n keywords = {workload forecasting, arrival rate, time series analysis, proactive resource provisioning, assurance of service level objectives},\n abstract = {As modern enterprise software systems become increasingly dynamic, workload forecasting techniques are gaining in importance as a foundation for online capacity planning and resource management. Time series analysis covers a broad spectrum of methods to calculate workload forecasts based on history monitoring data. Related work in the field of workload forecasting mostly concentrates on evaluating specific methods and their individual optimisation potential or on predicting Quality-of-Service (QoS) metrics directly. As a basis, we present a survey on established forecasting methods of the time series analysis concerning their benefits and drawbacks and group them according to their computational overheads. In this paper, we propose a novel self-adaptive approach that selects suitable forecasting methods for a given context based on a decision tree and direct feedback cycles together with a corresponding implementation. The user needs to provide only his general forecasting objectives. In several experiments and case studies based on real world workload traces, we show that our implementation of the approach provides continuous and reliable forecast results at run-time. The results of this extensive evaluation show that the relative error of the individual forecast points is significantly reduced compared to statically applied forecasting methods, e.g. in an exemplary scenario on average by 37%. In a case study, between 55% and 75% of the violations of a given service level agreement can be prevented by applying proactive resource provisioning based on the forecast results of our implementation.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/208.pdf},\n}\n\n','\n\nNikolas Roman Herbst, Nikolaus Huber, Samuel Kounev, and Erich Amrehn.\nSelf-Adaptive Workload Classification and Forecasting for Proactive\nResource Provisioning.\nConcurrency and Computation - Practice and Experience, John\nWiley and Sons, Ltd., 26(12):2053-2078, March 2014.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@article{HuKoAm2013-CCPE-WorkloadClassificationAndForecasting,\nauthor = {Nikolas Roman Herbst and Nikolaus Huber and Samuel Kounev and Erich Amrehn},\ntitle = {{Self-Adaptive Workload Classification and Forecasting for Proactive Resource Provisioning}},\njournal = {Concurrency and Computation - Practice and Experience, John Wiley and Sons, Ltd.},\nyear = {2014},\nmonth = {March},\nissn = {1532-0634},\nvolume = {26},\nnumber = {12},\npages = {2053--2078},\nurl = {http://dx.doi.org/10.1002/cpe.3224},\ndoi = {10.1002/cpe.3224},\nkeywords = {workload forecasting, arrival rate, time series analysis, proactive resource provisioning, assurance of service level objectives},\nabstract = {As modern enterprise software systems become increasingly dynamic, workload forecasting techniques are gaining in importance as a foundation for online capacity planning and resource management. Time series analysis covers a broad spectrum of methods to calculate workload forecasts based on history monitoring data. Related work in the field of workload forecasting mostly concentrates on evaluating specific methods and their individual optimisation potential or on predicting Quality-of-Service (QoS) metrics directly. As a basis, we present a survey on established forecasting methods of the time series analysis concerning their benefits and drawbacks and group them according to their computational overheads. In this paper, we propose a novel self-adaptive approach that selects suitable forecasting methods for a given context based on a decision tree and direct feedback cycles together with a corresponding implementation. The user needs to provide only his general forecasting objectives. In several experiments and case studies based on real world workload traces, we show that our implementation of the approach provides continuous and reliable forecast results at run-time. The results of this extensive evaluation show that the relative error of the individual forecast points is significantly reduced compared to statically applied forecasting methods, e.g. in an exemplary scenario on average by 37%. In a case study, between 55% and 75% of the violations of a given service level agreement can be prevented by applying proactive resource provisioning based on the forecast results of our implementation.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/208.pdf}\n}\n
\n
\nAs modern enterprise software systems become increasingly dynamic, workload forecasting techniques are gaining in importance as a foundation for online capacity planning and resource management. Time series analysis covers a broad spectrum of methods to calculate workload forecasts based on history monitoring data. Related work in the field of workload forecasting mostly concentrates on evaluating specific methods and their individual optimisation potential or on predicting Quality-of-Service (QoS) metrics directly. As a basis, we present a survey on established forecasting methods of the time series analysis concerning their benefits and drawbacks and group them according to their computational overheads. In this paper, we propose a novel self-adaptive approach that selects suitable forecasting methods for a given context based on a decision tree and direct feedback cycles together with a corresponding implementation. The user needs to provide only his general forecasting objectives. In several experiments and case studies based on real world workload traces, we show that our implementation of the approach provides continuous and reliable forecast results at run-time. The results of this extensive evaluation show that the relative error of the individual forecast points is significantly reduced compared to statically applied forecasting methods, e.g. in an exemplary scenario on average by 37%. In a case study, between 55% and 75% of the violations of a given service level agreement can be prevented by applying proactive resource provisioning based on the forecast results of our implementation.\n
\n','
\n@article{HuKoAm2013-CCPE-WorkloadClassificationAndForecasting,\n  author = {Nikolas Roman Herbst and Nikolaus Huber and Samuel Kounev and Erich Amrehn},\n  title = {{Self-Adaptive Workload Classification and Forecasting for Proactive Resource Provisioning}},\n  journal = {Concurrency and Computation - Practice and Experience, John Wiley and Sons, Ltd.},\n  year = {2014},\n  month = {March},\n  issn = {1532-0634},\n  volume = {26},\n  number = {12},\n  pages = {2053--2078},\n  url = {http://dx.doi.org/10.1002/cpe.3224},\n  doi = {10.1002/cpe.3224},\n  keywords = {workload forecasting, arrival rate, time series analysis, proactive resource provisioning, assurance of service level objectives},\n  abstract = {As modern enterprise software systems become increasingly dynamic, workload forecasting techniques are gaining in importance as a foundation for online capacity planning and resource management. Time series analysis covers a broad spectrum of methods to calculate workload forecasts based on history monitoring data. Related work in the field of workload forecasting mostly concentrates on evaluating specific methods and their individual optimisation potential or on predicting Quality-of-Service (QoS) metrics directly. As a basis, we present a survey on established forecasting methods of the time series analysis concerning their benefits and drawbacks and group them according to their computational overheads. In this paper, we propose a novel self-adaptive approach that selects suitable forecasting methods for a given context based on a decision tree and direct feedback cycles together with a corresponding implementation. The user needs to provide only his general forecasting objectives. In several experiments and case studies based on real world workload traces, we show that our implementation of the approach provides continuous and reliable forecast results at run-time. The results of this extensive evaluation show that the relative error of the individual forecast points is significantly reduced compared to statically applied forecasting methods, e.g. in an exemplary scenario on average by 37%. In a case study, between 55% and 75% of the violations of a given service level agreement can be prevented by applying proactive resource provisioning based on the forecast results of our implementation.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/208.pdf}\n}\n
\n\n','As modern enterprise software systems become increasingly dynamic, workload forecasting techniques are gaining in importance as a foundation for online capacity planning and resource management. Time series analysis covers a broad spectrum of methods to calculate workload forecasts based on history monitoring data. Related work in the field of workload forecasting mostly concentrates on evaluating specific methods and their individual optimisation potential or on predicting Quality-of-Service (QoS) metrics directly. As a basis, we present a survey on established forecasting methods of the time series analysis concerning their benefits and drawbacks and group them according to their computational overheads. In this paper, we propose a novel self-adaptive approach that selects suitable forecasting methods for a given context based on a decision tree and direct feedback cycles together with a corresponding implementation. The user needs to provide only his general forecasting objectives. In several experiments and case studies based on real world workload traces, we show that our implementation of the approach provides continuous and reliable forecast results at run-time. The results of this extensive evaluation show that the relative error of the individual forecast points is significantly reduced compared to statically applied forecasting methods, e.g. in an exemplary scenario on average by 37%. In a case study, between 55% and 75% of the violations of a given service level agreement can be prevented by applying proactive resource provisioning based on the forecast results of our implementation.','{Self-Adaptive Workload Classification and Forecasting for Proactive Resource Provisioning}',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(209,'paper','HeKoRe2013-ICAC-Elasticity','inproceedings','@inproceedings{HeKoRe2013-ICAC-Elasticity,\n abstract = {{Originating from the field of physics and economics, the term elasticity is nowadays heavily used in the context of cloud computing. In this context, elasticity is commonly understood as the ability of a system to automatically provision and de-provision computing resources on demand as workloads change. However, elasticity still lacks a precise definition as well as representative metrics coupled with a benchmarking methodology to enable comparability of systems. Existing definitions of elasticity are largely inconsistent and unspecific leading to confusion in the use of the term and its differentiation from related terms such as scalability and efficiency; the proposed measurement methodologies do not provide means to quantify elasticity without mixing it with efficiency or scalability aspects. In this short paper, we propose a precise definition of elasticity and analyze its core properties and requirements explicitly distinguishing from related terms such as scalability, efficiency, and agility. Furthermore, we present a set of appropriate elasticity metrics and sketch a new elasticity tailored benchmarking methodology addressing the special requirements on workload design and calibration.}},\n author = {Nikolas Roman Herbst and Samuel Kounev and Ralf Reussner},\n booktitle = {Proceedings of the 10th International Conference on Autonomic Computing (ICAC 2013)},\n day = {24--28},\n location = {San Jose, CA},\n month = {June},\n note = {Acceptance Rate (Short Paper): 36.9\\%},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/209.pdf},\n publisher = {USENIX},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/209},\n title = {{Elasticity in Cloud Computing: What it is, and What it is Not}},\n titleaddon = {{(Short Paper)}},\n url = {https://www.usenix.org/conference/icac13/elasticity-cloud-computing-what-it-and-what-it-not},\n year = {2013},\n}\n\n','\n\nNikolas Roman Herbst, Samuel Kounev, and Ralf Reussner.\nElasticity in Cloud Computing: What it is, and What it is Not\n(Short Paper).\nIn Proceedings of the 10th International Conference on Autonomic\nComputing (ICAC 2013), San Jose, CA, June 24-28, 2013. USENIX.\nJune 2013, Acceptance Rate (Short Paper): 36.9%.\n[ bib | slides | http | .pdf | Abstract  ] 
\n@inproceedings{HeKoRe2013-ICAC-Elasticity,\nabstract = {{Originating from the field of physics and economics, the term elasticity is nowadays heavily used in the context of cloud computing. In this context, elasticity is commonly understood as the ability of a system to automatically provision and de-provision computing resources on demand as workloads change. However, elasticity still lacks a precise definition as well as representative metrics coupled with a benchmarking methodology to enable comparability of systems. Existing definitions of elasticity are largely inconsistent and unspecific leading to confusion in the use of the term and its differentiation from related terms such as scalability and efficiency; the proposed measurement methodologies do not provide means to quantify elasticity without mixing it with efficiency or scalability aspects. In this short paper, we propose a precise definition of elasticity and analyze its core properties and requirements explicitly distinguishing from related terms such as scalability, efficiency, and agility. Furthermore, we present a set of appropriate elasticity metrics and sketch a new elasticity tailored benchmarking methodology addressing the special requirements on workload design and calibration.}},\nauthor = {Nikolas Roman Herbst and Samuel Kounev and Ralf Reussner},\nbooktitle = {Proceedings of the 10th International Conference on Autonomic Computing (ICAC 2013)},\nday = {24--28},\nlocation = {San Jose, CA},\nmonth = {June},\nnote = {Acceptance Rate (Short Paper): 36.9\\%},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/209.pdf},\npublisher = {USENIX},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/209},\ntitle = {{Elasticity in Cloud Computing: What it is, and What it is Not}},\ntitleaddon = {{(Short Paper)}},\nurl = {https://www.usenix.org/conference/icac13/elasticity-cloud-computing-what-it-and-what-it-not},\nyear = {2013}\n}\n
\n
\nOriginating from the field of physics and economics, the term elasticity is nowadays heavily used in the context of cloud computing. In this context, elasticity is commonly understood as the ability of a system to automatically provision and de-provision computing resources on demand as workloads change. However, elasticity still lacks a precise definition as well as representative metrics coupled with a benchmarking methodology to enable comparability of systems. Existing definitions of elasticity are largely inconsistent and unspecific leading to confusion in the use of the term and its differentiation from related terms such as scalability and efficiency; the proposed measurement methodologies do not provide means to quantify elasticity without mixing it with efficiency or scalability aspects. In this short paper, we propose a precise definition of elasticity and analyze its core properties and requirements explicitly distinguishing from related terms such as scalability, efficiency, and agility. Furthermore, we present a set of appropriate elasticity metrics and sketch a new elasticity tailored benchmarking methodology addressing the special requirements on workload design and calibration.\n
\n','
\n@inproceedings{HeKoRe2013-ICAC-Elasticity,\n  abstract = {{Originating from the field of physics and economics, the term elasticity is nowadays heavily used in the context of cloud computing. In this context, elasticity is commonly understood as the ability of a system to automatically provision and de-provision computing resources on demand as workloads change. However, elasticity still lacks a precise definition as well as representative metrics coupled with a benchmarking methodology to enable comparability of systems. Existing definitions of elasticity are largely inconsistent and unspecific leading to confusion in the use of the term and its differentiation from related terms such as scalability and efficiency; the proposed measurement methodologies do not provide means to quantify elasticity without mixing it with efficiency or scalability aspects. In this short paper, we propose a precise definition of elasticity and analyze its core properties and requirements explicitly distinguishing from related terms such as scalability, efficiency, and agility. Furthermore, we present a set of appropriate elasticity metrics and sketch a new elasticity tailored benchmarking methodology addressing the special requirements on workload design and calibration.}},\n  author = {Nikolas Roman Herbst and Samuel Kounev and Ralf Reussner},\n  booktitle = {Proceedings of the 10th International Conference on Autonomic Computing (ICAC 2013)},\n  day = {24--28},\n  location = {San Jose, CA},\n  month = {June},\n  note = {Acceptance Rate (Short Paper): 36.9\\%},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/209.pdf},\n  publisher = {USENIX},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/209},\n  title = {{Elasticity in Cloud Computing: What it is, and What it is Not}},\n  titleaddon = {{(Short Paper)}},\n  url = {https://www.usenix.org/conference/icac13/elasticity-cloud-computing-what-it-and-what-it-not},\n  year = {2013}\n}\n
\n\n','{Originating from the field of physics and economics, the term elasticity is nowadays heavily used in the context of cloud computing. In this context, elasticity is commonly understood as the ability of a system to automatically provision and de-provision computing resources on demand as workloads change. However, elasticity still lacks a precise definition as well as representative metrics coupled with a benchmarking methodology to enable comparability of systems. Existing definitions of elasticity are largely inconsistent and unspecific leading to confusion in the use of the term and its differentiation from related terms such as scalability and efficiency; the proposed measurement methodologies do not provide means to quantify elasticity without mixing it with efficiency or scalability aspects. In this short paper, we propose a precise definition of elasticity and analyze its core properties and requirements explicitly distinguishing from related terms such as scalability, efficiency, and agility. Furthermore, we present a set of appropriate elasticity metrics and sketch a new elasticity tailored benchmarking methodology addressing the special requirements on workload design and calibration.}','{Elasticity in Cloud Computing: What it is, and What it is Not}',0,6,2013,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(210,'paper','KiHeKo2014-LT-DLIM','inproceedings','@inproceedings{KiHeKo2014-LT-DLIM,\n abstract = {{Today\'s software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. Based on this observation, we identify the need for means allowing flexible definition of load profiles and address this by introducing two meta-models at different abstraction levels. At the lower abstraction level, the Descartes Load Intensity Meta-Model (DLIM) offers a structured and accessible way of describing the load intensity over time by editing and combining mathematical functions. The High-Level Descartes Load Intensity Meta-Model (HLDLIM) allows the description of load variations using few defined parameters that characterize the seasonal patterns, trends, bursts and noise parts. We demonstrate that both meta-models are capable of capturing real-world load profiles with acceptable accuracy through comparison with a real life trace.}},\n author = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Samuel Kounev},\n booktitle = {Proceedings of the 3rd International Workshop on Large-Scale Testing (LT 2014), co-located with the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n day = {22},\n location = {Dublin, Ireland},\n month = {March},\n publisher = {ACM},\n title = {{Modeling Variations in Load Intensity over Time}},\n slides = {http://lt2014.eecs.yorku.ca/talks/Joakim_LTslides.pdf},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/210.pdf},\n isbn = {978-1-4503-2762-6},\n pages = {1--4},\n numpages = {4},\n url = {http://doi.acm.org/10.1145/2577036.2577037},\n doi = {10.1145/2577036.2577037},\n acmid = {2577037},\n address = {New York, NY, USA},\n keywords = {benchmarking, modeling, workload},\n year = {2014},\n}\n\n','\n\nJóakim von Kistowski, Nikolas Roman Herbst, and Samuel Kounev.\nModeling Variations in Load Intensity over Time.\nIn Proceedings of the 3rd International Workshop on Large-Scale\nTesting (LT 2014), co-located with the 5th ACM/SPEC International Conference\non Performance Engineering (ICPE 2014), Dublin, Ireland, March 22, 2014,\npages 1-4. ACM, New York, NY, USA.\nMarch 2014.\n[ bib | DOI | slides | http | .pdf | Abstract  ] 
\n@inproceedings{KiHeKo2014-LT-DLIM,\nabstract = {{Today\'s software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. Based on this observation, we identify the need for means allowing flexible definition of load profiles and address this by introducing two meta-models at different abstraction levels. At the lower abstraction level, the Descartes Load Intensity Meta-Model (DLIM) offers a structured and accessible way of describing the load intensity over time by editing and combining mathematical functions. The High-Level Descartes Load Intensity Meta-Model (HLDLIM) allows the description of load variations using few defined parameters that characterize the seasonal patterns, trends, bursts and noise parts. We demonstrate that both meta-models are capable of capturing real-world load profiles with acceptable accuracy through comparison with a real life trace.}},\nauthor = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Samuel Kounev},\nbooktitle = {Proceedings of the 3rd International Workshop on Large-Scale Testing (LT 2014), co-located with the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\nday = {22},\nlocation = {Dublin, Ireland},\nmonth = {March},\npublisher = {ACM},\ntitle = {{Modeling Variations in Load Intensity over Time}},\nslides = {http://lt2014.eecs.yorku.ca/talks/Joakim_LTslides.pdf},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/210.pdf},\nisbn = {978-1-4503-2762-6},\npages = {1--4},\nnumpages = {4},\nurl = {http://doi.acm.org/10.1145/2577036.2577037},\ndoi = {10.1145/2577036.2577037},\nacmid = {2577037},\naddress = {New York, NY, USA},\nkeywords = {benchmarking, modeling, workload},\nyear = {2014}\n}\n
\n
\nToday\'s software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. Based on this observation, we identify the need for means allowing flexible definition of load profiles and address this by introducing two meta-models at different abstraction levels. At the lower abstraction level, the Descartes Load Intensity Meta-Model (DLIM) offers a structured and accessible way of describing the load intensity over time by editing and combining mathematical functions. The High-Level Descartes Load Intensity Meta-Model (HLDLIM) allows the description of load variations using few defined parameters that characterize the seasonal patterns, trends, bursts and noise parts. We demonstrate that both meta-models are capable of capturing real-world load profiles with acceptable accuracy through comparison with a real life trace.\n
\n','
\n@inproceedings{KiHeKo2014-LT-DLIM,\n  abstract = {{Today\'s software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. Based on this observation, we identify the need for means allowing flexible definition of load profiles and address this by introducing two meta-models at different abstraction levels. At the lower abstraction level, the Descartes Load Intensity Meta-Model (DLIM) offers a structured and accessible way of describing the load intensity over time by editing and combining mathematical functions. The High-Level Descartes Load Intensity Meta-Model (HLDLIM) allows the description of load variations using few defined parameters that characterize the seasonal patterns, trends, bursts and noise parts. We demonstrate that both meta-models are capable of capturing real-world load profiles with acceptable accuracy through comparison with a real life trace.}},\n  author = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Samuel Kounev},\n  booktitle = {Proceedings of the 3rd International Workshop on Large-Scale Testing (LT 2014), co-located with the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n  day = {22},\n  location = {Dublin, Ireland},\n  month = {March},\n  publisher = {ACM},\n  title = {{Modeling Variations in Load Intensity over Time}},\n  slides = {http://lt2014.eecs.yorku.ca/talks/Joakim_LTslides.pdf},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/210.pdf},\n  isbn = {978-1-4503-2762-6},\n  pages = {1--4},\n  numpages = {4},\n  url = {http://doi.acm.org/10.1145/2577036.2577037},\n  doi = {10.1145/2577036.2577037},\n  acmid = {2577037},\n  address = {New York, NY, USA},\n  keywords = {benchmarking, modeling, workload},\n  year = {2014}\n}\n
\n\n','{Today\'s software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. Based on this observation, we identify the need for means allowing flexible definition of load profiles and address this by introducing two meta-models at different abstraction levels. At the lower abstraction level, the Descartes Load Intensity Meta-Model (DLIM) offers a structured and accessible way of describing the load intensity over time by editing and combining mathematical functions. The High-Level Descartes Load Intensity Meta-Model (HLDLIM) allows the description of load variations using few defined parameters that characterize the seasonal patterns, trends, bursts and noise parts. We demonstrate that both meta-models are capable of capturing real-world load profiles with acceptable accuracy through comparison with a real life trace.}','{Modeling Variations in Load Intensity over Time}',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(211,'paper','KiHeKo2014-ICPEDemo-LIMBO','inproceedings','@inproceedings{KiHeKo2014-ICPEDemo-LIMBO,\n abstract = {{Modern software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. In this paper, we present LIMBO - an Eclipse-based tool for modeling variable load intensity profiles based on the Descartes Load Intensity Model as an underlying modeling formalism.}},\n author = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Samuel Kounev},\n titleaddon = {{(Demo Paper)}},\n booktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n day = {22--26},\n location = {Dublin, Ireland},\n month = {March},\n publisher = {ACM},\n title = {{LIMBO: A Tool For Modeling Variable Load Intensities}},\n series = {ICPE \'14},\n year = {2014},\n isbn = {978-1-4503-2733-6},\n pages = {225--226},\n numpages = {2},\n url = {http://doi.acm.org/10.1145/2568088.2576092},\n doi = {10.1145/2568088.2576092},\n acmid = {2576092},\n publisher = {ACM},\n address = {New York, NY, USA},\n keywords = {load intensity variation, load profile, meta-modeling, model extraction, open workloads, transformation},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/211},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/211.pdf},\n year = {2014},\n}\n\n','\n\nJóakim von Kistowski, Nikolas Roman Herbst, and Samuel Kounev.\nLIMBO: A Tool For Modeling Variable Load Intensities (Demo\nPaper).\nIn Proceedings of the 5th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2014), Dublin, Ireland, March 22-26, 2014,\nICPE \'14, pages 225-226. ACM, New York, NY, USA.\nMarch 2014.\n[ bib | DOI | slides | http | .pdf | Abstract  ] 
\n@inproceedings{KiHeKo2014-ICPEDemo-LIMBO,\nabstract = {{Modern software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. In this paper, we present LIMBO - an Eclipse-based tool for modeling variable load intensity profiles based on the Descartes Load Intensity Model as an underlying modeling formalism.}},\nauthor = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Samuel Kounev},\ntitleaddon = {{(Demo Paper)}},\nbooktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\nday = {22--26},\nlocation = {Dublin, Ireland},\nmonth = {March},\npublisher = {ACM},\ntitle = {{LIMBO: A Tool For Modeling Variable Load Intensities}},\nseries = {ICPE \'14},\nyear = {2014},\nisbn = {978-1-4503-2733-6},\npages = {225--226},\nnumpages = {2},\nurl = {http://doi.acm.org/10.1145/2568088.2576092},\ndoi = {10.1145/2568088.2576092},\nacmid = {2576092},\npublisher = {ACM},\naddress = {New York, NY, USA},\nkeywords = {load intensity variation, load profile, meta-modeling, model extraction, open workloads, transformation},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/211},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/211.pdf},\nyear = {2014}\n}\n
\n
\nModern software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. In this paper, we present LIMBO - an Eclipse-based tool for modeling variable load intensity profiles based on the Descartes Load Intensity Model as an underlying modeling formalism.\n
\n','
\n@inproceedings{KiHeKo2014-ICPEDemo-LIMBO,\n  abstract = {{Modern software systems are expected to deliver reliable performance under highly variable load 	intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. In this paper, we present LIMBO - an Eclipse-based tool for modeling variable load intensity profiles based on the Descartes Load Intensity Model as an underlying modeling formalism.}},\n  author = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Samuel Kounev},\n  titleaddon = {{(Demo Paper)}},\n  booktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n  day = {22--26},\n  location = {Dublin, Ireland},\n  month = {March},\n  publisher = {ACM},\n  title = {{LIMBO: A Tool For Modeling Variable Load Intensities}},\n  series = {ICPE \'14},\n  year = {2014},\n  isbn = {978-1-4503-2733-6},\n  pages = {225--226},\n  numpages = {2},\n  url = {http://doi.acm.org/10.1145/2568088.2576092},\n  doi = {10.1145/2568088.2576092},\n  acmid = {2576092},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  keywords = {load intensity variation, load profile, meta-modeling, model extraction, open workloads, transformation},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/211},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/211.pdf},\n  year = {2014}\n}\n
\n\n','{Modern software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. In this paper, we present LIMBO - an Eclipse-based tool for modeling variable load intensity profiles based on the Descartes Load Intensity Model as an underlying modeling formalism.}','{LIMBO: A Tool For Modeling Variable Load Intensities}',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(212,'paper','WeHeGrKo2014-HotTopicsWS-ElaBench','inproceedings','@inproceedings{WeHeGrKo2014-HotTopicsWS-ElaBench,\n abstract = {{Auto-scaling features offered by today\'s cloud infrastructures provide increased flexibility especially for customers that experience high variations in the load intensity over time. However, auto-scaling features introduce new system quality attributes when considering their accuracy, timing, and boundaries. Therefore, distinguishing between different offerings has become a complex task, as it is not yet supported by reliable metrics and measurement approaches. In this paper, we discuss shortcomings of existing approaches for measuring and evaluating elastic behavior and propose a novel benchmark methodology specifically designed for evaluating the elasticity aspects of modern cloud platforms. The benchmark is based on open workloads with realistic load variation profiles that are calibrated to induce identical resource demand variations independent of the underlying hardware performance. Furthermore, we propose new metrics that capture the accuracy of resource allocations and de-allocations, as well as the timing aspects of an auto-scaling mechanism explicitly.}},\n author = {Andreas Weber and Nikolas Roman Herbst and Henning Groenda and Samuel Kounev},\n booktitle = {Proceedings of the 2nd International Workshop on Hot Topics in Cloud Service Scalability (HotTopiCS 2014), co-located with the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n day = {22},\n location = {Dublin, Ireland},\n month = {March},\n publisher = {ACM},\n keywords = {Demand, Elasticity, Load Profile, Resource, Supply},\n title = {{Towards a Resource Elasticity Benchmark for Cloud Environments}},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/212},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/212.pdf},\n series = {HotTopiCS \'14},\n year = {2014},\n isbn = {978-1-4503-3059-6},\n location = {Dublin, Ireland},\n pages = {5:1--5:8},\n articleno = {5},\n numpages = {8},\n url = {http://doi.acm.org/10.1145/2649563.2649571},\n doi = {10.1145/2649563.2649571},\n acmid = {2649571},\n publisher = {ACM},\n address = {New York, NY, USA},\n keywords = {Demand, Elasticity, Load Profile, Resource, Supply},\n}\n\n','\n\nAndreas Weber, Nikolas Roman Herbst, Henning Groenda, and Samuel Kounev.\nTowards a Resource Elasticity Benchmark for Cloud Environments.\nIn Proceedings of the 2nd International Workshop on Hot Topics\nin Cloud Service Scalability (HotTopiCS 2014), co-located with the 5th\nACM/SPEC International Conference on Performance Engineering (ICPE 2014),\nDublin, Ireland, March 22, 2014, HotTopiCS \'14, pages 5:1-5:8. ACM, New\nYork, NY, USA.\nMarch 2014.\n[ bib | DOI | slides | http | .pdf | Abstract  ] 
\n@inproceedings{WeHeGrKo2014-HotTopicsWS-ElaBench,\nabstract = {{Auto-scaling features offered by today\'s cloud infrastructures provide increased flexibility especially for customers that experience high variations in the load intensity over time. However, auto-scaling features introduce new system quality attributes when considering their accuracy, timing, and boundaries. Therefore, distinguishing between different offerings has become a complex task, as it is not yet supported by reliable metrics and measurement approaches. In this paper, we discuss shortcomings of existing approaches for measuring and evaluating elastic behavior and propose a novel benchmark methodology specifically designed for evaluating the elasticity aspects of modern cloud platforms. The benchmark is based on open workloads with realistic load variation profiles that are calibrated to induce identical resource demand variations independent of the underlying hardware performance. Furthermore, we propose new metrics that capture the accuracy of resource allocations and de-allocations, as well as the timing aspects of an auto-scaling mechanism explicitly.}},\nauthor = {Andreas Weber and Nikolas Roman Herbst and Henning Groenda and Samuel Kounev},\nbooktitle = {Proceedings of the 2nd International Workshop on Hot Topics in Cloud Service Scalability (HotTopiCS 2014), co-located with the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\nday = {22},\nlocation = {Dublin, Ireland},\nmonth = {March},\npublisher = {ACM},\nkeywords = {Demand, Elasticity, Load Profile, Resource, Supply},\ntitle = {{Towards a Resource Elasticity Benchmark for Cloud Environments}},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/212},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/212.pdf},\nseries = {HotTopiCS \'14},\nyear = {2014},\nisbn = {978-1-4503-3059-6},\nlocation = {Dublin, Ireland},\npages = {5:1--5:8},\narticleno = {5},\nnumpages = {8},\nurl = {http://doi.acm.org/10.1145/2649563.2649571},\ndoi = {10.1145/2649563.2649571},\nacmid = {2649571},\npublisher = {ACM},\naddress = {New York, NY, USA},\nkeywords = {Demand, Elasticity, Load Profile, Resource, Supply}\n}\n
\n
\nAuto-scaling features offered by today\'s cloud infrastructures provide increased flexibility especially for customers that experience high variations in the load intensity over time. However, auto-scaling features introduce new system quality attributes when considering their accuracy, timing, and boundaries. Therefore, distinguishing between different offerings has become a complex task, as it is not yet supported by reliable metrics and measurement approaches. In this paper, we discuss shortcomings of existing approaches for measuring and evaluating elastic behavior and propose a novel benchmark methodology specifically designed for evaluating the elasticity aspects of modern cloud platforms. The benchmark is based on open workloads with realistic load variation profiles that are calibrated to induce identical resource demand variations independent of the underlying hardware performance. Furthermore, we propose new metrics that capture the accuracy of resource allocations and de-allocations, as well as the timing aspects of an auto-scaling mechanism explicitly.\n
\n','
\n@inproceedings{WeHeGrKo2014-HotTopicsWS-ElaBench,\n  abstract = {{Auto-scaling features offered by today\'s cloud infrastructures provide increased flexibility especially for customers that experience high variations in the load intensity over time. However, auto-scaling features introduce new system quality attributes when considering their accuracy, timing, and boundaries. Therefore, distinguishing between different offerings has become a complex task, as it is not yet supported by reliable metrics and measurement approaches. In this paper, we discuss shortcomings of existing approaches for measuring and evaluating elastic behavior and propose a novel benchmark methodology specifically designed for evaluating the elasticity aspects of modern cloud platforms. The benchmark is based on open workloads with realistic load variation profiles that are calibrated to induce identical resource demand variations independent of the underlying hardware performance. Furthermore, we propose new metrics that capture the accuracy of resource allocations and de-allocations, as well as the timing aspects of an auto-scaling mechanism explicitly.}},\n  author = {Andreas Weber and Nikolas Roman Herbst and Henning Groenda and Samuel Kounev},\n  booktitle = {Proceedings of the 2nd International Workshop on Hot Topics in Cloud Service Scalability (HotTopiCS 2014), co-located with the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n  day = {22},\n  location = {Dublin, Ireland},\n  month = {March},\n  publisher = {ACM},\n  keywords = {Demand, Elasticity, Load Profile, Resource, Supply},\n  title = {{Towards a Resource Elasticity Benchmark for Cloud Environments}},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/212},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/212.pdf},\n  series = {HotTopiCS \'14},\n  year = {2014},\n  isbn = {978-1-4503-3059-6},\n  location = {Dublin, Ireland},\n  pages = {5:1--5:8},\n  articleno = {5},\n  numpages = {8},\n  url = {http://doi.acm.org/10.1145/2649563.2649571},\n  doi = {10.1145/2649563.2649571},\n  acmid = {2649571},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  keywords = {Demand, Elasticity, Load Profile, Resource, Supply}\n}\n
\n\n','{Auto-scaling features offered by today\'s cloud infrastructures provide increased flexibility especially for customers that experience high variations in the load intensity over time. However, auto-scaling features introduce new system quality attributes when considering their accuracy, timing, and boundaries. Therefore, distinguishing between different offerings has become a complex task, as it is not yet supported by reliable metrics and measurement approaches. In this paper, we discuss shortcomings of existing approaches for measuring and evaluating elastic behavior and propose a novel benchmark methodology specifically designed for evaluating the elasticity aspects of modern cloud platforms. The benchmark is based on open workloads with realistic load variation profiles that are calibrated to induce identical resource demand variations independent of the underlying hardware performance. Furthermore, we propose new metrics that capture the accuracy of resource allocations and de-allocations, as well as the timing aspects of an auto-scaling mechanism explicitly.}','{Towards a Resource Elasticity Benchmark for Cloud Environments}',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(219,'paper','Hu2009-UKA-PerfMod','mastersthesis','@mastersthesis{Hu2009-UKA-PerfMod,\n address = {Karlsruhe, Germany},\n author = {Nikolaus Huber},\n month = {April},\n note = {GFFT Prize},\n school = {Universit{\\\"{a}}t Karlsruhe (TH)},\n title = {{Performance Modeling of Storage Virtualization}},\n year = {2009},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/219.pdf},\n}\n\n','\n\nNikolaus Huber.\nPerformance Modeling of Storage Virtualization.\nMaster\'s thesis, Universität Karlsruhe (TH), Karlsruhe,\nGermany, April 2009.\nGFFT Prize.\n[ bib | .pdf  ] 
\n@mastersthesis{Hu2009-UKA-PerfMod,\naddress = {Karlsruhe, Germany},\nauthor = {Nikolaus Huber},\nmonth = {April},\nnote = {GFFT Prize},\nschool = {Universit{\\\"{a}}t Karlsruhe (TH)},\ntitle = {{Performance Modeling of Storage Virtualization}},\nyear = {2009},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/219.pdf}\n}\n
\n
\n','
\n@mastersthesis{Hu2009-UKA-PerfMod,\n  address = {Karlsruhe, Germany},\n  author = {Nikolaus Huber},\n  month = {April},\n  note = {GFFT Prize},\n  school = {Universit{\\\"{a}}t Karlsruhe (TH)},\n  title = {{Performance Modeling of Storage Virtualization}},\n  year = {2009},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/219.pdf}\n}\n
\n\n',NULL,'{Performance Modeling of Storage Virtualization}',0,4,2009,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(220,'paper','HuBeRaScRe2010-ICSE-PerfMod','inproceedings','@inproceedings{HuBeRaScRe2010-ICSE-PerfMod,\n abstract = {In software engineering, performance and the integration of performance analysis methodologies gain increasing importance, especially for complex systems. Well-developed methods and tools can predict non-functional performance properties like response time or resource utilization in early design stages, thus promising time and cost savings. However, as performance modeling and performance prediction is still a young research area, the methods are not yet well-established and in wide-spread industrial use. This work is a case study of the applicability of the Palladio Component Model as a performance prediction method in an industrial environment. We model and analyze different design alternatives for storage virtualization on an IBM (Trademark of IBM in USA and/or other countries) system. The model calibration, validation and evaluation is based on data measured on a System z9 (Trademark of IBM in USA and/or other countries) as a proof of concept. The results show that performance predictions can identify performance bottlenecks and evaluate design alternatives in early stages of system development. The experiences gained were that performance modeling helps to understand and analyze a system. Hence, this case study substantiates that performance modeling is applicable in industry and a valuable method for evaluating design decisions.},\n address = {New York, NY, USA},\n author = {Nikolaus Huber and Steffen Becker and Christoph Rathfelder and Jochen Schweflinghaus and Ralf Reussner},\n booktitle = {ACM/IEEE 32nd International Conference on Software Engineering (ICSE 2010), Software Engineering in Practice Track},\n day = {2--8},\n doi = {10.1145/1810295.1810297},\n isbn = {978-1-60558-719-6},\n location = {Cape Town, South Africa},\n month = {May},\n note = {Acceptance Rate (Full Paper): 23\\% (16/71)},\n pages = {1--10},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/220.pdf},\n publisher = {ACM},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/220},\n title = {{Performance Modeling in Industry: A Case Study on Storage Virtualization}},\n year = {2010},\n}\n\n','\n\nNikolaus Huber, Steffen Becker, Christoph Rathfelder, Jochen Schweflinghaus,\nand Ralf Reussner.\nPerformance Modeling in Industry: A Case Study on Storage\nVirtualization.\nIn ACM/IEEE 32nd International Conference on Software\nEngineering (ICSE 2010), Software Engineering in Practice Track, Cape Town,\nSouth Africa, May 2-8, 2010, pages 1-10. ACM, New York, NY, USA.\nMay 2010, Acceptance Rate (Full Paper): 23% (16/71).\n[ bib | DOI | slides | .pdf | Abstract  ] 
\n@inproceedings{HuBeRaScRe2010-ICSE-PerfMod,\nabstract = {In software engineering, performance and the integration of performance analysis methodologies gain increasing importance, especially for complex systems. Well-developed methods and tools can predict non-functional performance properties like response time or resource utilization in early design stages, thus promising time and cost savings. However, as performance modeling and performance prediction is still a young research area, the methods are not yet well-established and in wide-spread industrial use. This work is a case study of the applicability of the Palladio Component Model as a performance prediction method in an industrial environment. We model and analyze different design alternatives for storage virtualization on an IBM (Trademark of IBM in USA and/or other countries) system. The model calibration, validation and evaluation is based on data measured on a System z9 (Trademark of IBM in USA and/or other countries) as a proof of concept. The results show that performance predictions can identify performance bottlenecks and evaluate design alternatives in early stages of system development. The experiences gained were that performance modeling helps to understand and analyze a system. Hence, this case study substantiates that performance modeling is applicable in industry and a valuable method for evaluating design decisions.},\naddress = {New York, NY, USA},\nauthor = {Nikolaus Huber and Steffen Becker and Christoph Rathfelder and Jochen Schweflinghaus and Ralf Reussner},\nbooktitle = {ACM/IEEE 32nd International Conference on Software Engineering (ICSE 2010), Software Engineering in Practice Track},\nday = {2--8},\ndoi = {10.1145/1810295.1810297},\nisbn = {978-1-60558-719-6},\nlocation = {Cape Town, South Africa},\nmonth = {May},\nnote = {Acceptance Rate (Full Paper): 23\\% (16/71)},\npages = {1--10},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/220.pdf},\npublisher = {ACM},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/220},\ntitle = {{Performance Modeling in Industry: A Case Study on Storage Virtualization}},\nyear = {2010}\n}\n
\n
\nIn software engineering, performance and the integration of performance analysis methodologies gain increasing importance, especially for complex systems. Well-developed methods and tools can predict non-functional performance properties like response time or resource utilization in early design stages, thus promising time and cost savings. However, as performance modeling and performance prediction is still a young research area, the methods are not yet well-established and in wide-spread industrial use. This work is a case study of the applicability of the Palladio Component Model as a performance prediction method in an industrial environment. We model and analyze different design alternatives for storage virtualization on an IBM (Trademark of IBM in USA and/or other countries) system. The model calibration, validation and evaluation is based on data measured on a System z9 (Trademark of IBM in USA and/or other countries) as a proof of concept. The results show that performance predictions can identify performance bottlenecks and evaluate design alternatives in early stages of system development. The experiences gained were that performance modeling helps to understand and analyze a system. Hence, this case study substantiates that performance modeling is applicable in industry and a valuable method for evaluating design decisions.\n
\n','
\n@inproceedings{HuBeRaScRe2010-ICSE-PerfMod,\n  abstract = {In software engineering, performance and the integration of performance analysis methodologies gain increasing importance, especially for complex systems. Well-developed methods and tools can predict non-functional performance properties like response time or resource utilization in early design stages, thus promising time and cost savings. However, as performance modeling and performance prediction is still a young research area, the methods are not yet well-established and in wide-spread industrial use. This work is a case study of the applicability of the Palladio Component Model as a performance prediction method in an industrial environment. We model and analyze different design alternatives for storage virtualization on an IBM (Trademark of IBM in USA and/or other countries) system. The model calibration, validation and evaluation is based on data measured on a System z9 (Trademark of IBM in USA and/or other countries) as a proof of concept. The results show that performance predictions can identify performance bottlenecks and evaluate design alternatives in early stages of system development. The experiences gained were that performance modeling helps to understand and analyze a system. Hence, this case study substantiates that performance modeling is applicable in industry and a valuable method for evaluating design decisions.},\n  address = {New York, NY, USA},\n  author = {Nikolaus Huber and Steffen Becker and Christoph Rathfelder and Jochen Schweflinghaus and Ralf Reussner},\n  booktitle = {ACM/IEEE 32nd International Conference on Software Engineering (ICSE 2010), Software Engineering in Practice Track},\n  day = {2--8},\n  doi = {10.1145/1810295.1810297},\n  isbn = {978-1-60558-719-6},\n  location = {Cape Town, South Africa},\n  month = {May},\n  note = {Acceptance Rate (Full Paper): 23\\% (16/71)},\n  pages = {1--10},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/220.pdf},\n  publisher = {ACM},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/220},\n  title = {{Performance Modeling in Industry: A Case Study on Storage Virtualization}},\n  year = {2010}\n}\n
\n\n','In software engineering, performance and the integration of performance analysis methodologies gain increasing importance, especially for complex systems. Well-developed methods and tools can predict non-functional performance properties like response time or resource utilization in early design stages, thus promising time and cost savings. However, as performance modeling and performance prediction is still a young research area, the methods are not yet well-established and in wide-spread industrial use. This work is a case study of the applicability of the Palladio Component Model as a performance prediction method in an industrial environment. We model and analyze different design alternatives for storage virtualization on an IBM (Trademark of IBM in USA and/or other countries) system. The model calibration, validation and evaluation is based on data measured on a System z9 (Trademark of IBM in USA and/or other countries) as a proof of concept. The results show that performance predictions can identify performance bottlenecks and evaluate design alternatives in early stages of system development. The experiences gained were that performance modeling helps to understand and analyze a system. Hence, this case study substantiates that performance modeling is applicable in industry and a valuable method for evaluating design decisions.','{Performance Modeling in Industry: A Case Study on Storage Virtualization}',0,5,2010,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(221,'paper','HuBrDiJoKo2012-ResBook-CloudCaseStudies','incollection','@incollection{HuBrDiJoKo2012-ResBook-CloudCaseStudies,\n address = {Berlin, Heidelberg},\n author = {Nikolaus Huber and Fabian Brosig and N. Dingle and K. Joshi and Samuel Kounev},\n booktitle = {{Resilience Assessment and Evaluation of Computing Systems}},\n editor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\n isbn = {978-3-642-29031-2},\n note = {ISBN: 978-3-642-29031-2},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/221.pdf},\n publisher = {Springer-Verlag},\n series = {XVIII},\n title = {{Providing Dependability and Performance in the Cloud: Case Studies}},\n url = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\n year = {2012},\n}\n\n','\n\nNikolaus Huber, Fabian Brosig, N. Dingle, K. Joshi, and Samuel Kounev.\nProviding Dependability and Performance in the Cloud: Case Studies.\nIn Resilience Assessment and Evaluation of Computing Systems,\nK. Wolter, A. Avritzer, M. Vieira, and A. van Moorsel, editors, XVIII.\nSpringer-Verlag, Berlin, Heidelberg, 2012.\nISBN: 978-3-642-29031-2.\n[ bib | http | .pdf  ] 
\n@incollection{HuBrDiJoKo2012-ResBook-CloudCaseStudies,\naddress = {Berlin, Heidelberg},\nauthor = {Nikolaus Huber and Fabian Brosig and N. Dingle and K. Joshi and Samuel Kounev},\nbooktitle = {{Resilience Assessment and Evaluation of Computing Systems}},\neditor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\nisbn = {978-3-642-29031-2},\nnote = {ISBN: 978-3-642-29031-2},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/221.pdf},\npublisher = {Springer-Verlag},\nseries = {XVIII},\ntitle = {{Providing Dependability and Performance in the Cloud: Case Studies}},\nurl = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\nyear = {2012}\n}\n
\n
\n','
\n@incollection{HuBrDiJoKo2012-ResBook-CloudCaseStudies,\n  address = {Berlin, Heidelberg},\n  author = {Nikolaus Huber and Fabian Brosig and N. Dingle and K. Joshi and Samuel Kounev},\n  booktitle = {{Resilience Assessment and Evaluation of Computing Systems}},\n  editor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\n  isbn = {978-3-642-29031-2},\n  note = {ISBN: 978-3-642-29031-2},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/221.pdf},\n  publisher = {Springer-Verlag},\n  series = {XVIII},\n  title = {{Providing Dependability and Performance in the Cloud: Case Studies}},\n  url = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\n  year = {2012}\n}\n
\n\n',NULL,'{Providing Dependability and Performance in the Cloud: Case Studies}',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(222,'paper','HuBrKo2012-QoSA-ModelingVirtResLandscapes','inproceedings','@inproceedings{HuBrKo2012-QoSA-ModelingVirtResLandscapes,\n abstract = {Modern data centers are subject to an increasing demand for flexibility. Increased flexibility and dynamics, however, also result in a higher system complexity. This complexity carries on to run-time resource management for Quality-of-Service (QoS) enforcement, rendering design-time approaches for QoS assurance inadequate. In this paper, we present a set of novel meta-models that can be used to describe the resource landscape, the architecture and resource layers of dynamic virtualized data center infrastructures, as well as their run-time adaptation and resource management aspects. With these meta-models we introduce new modeling concepts to improve model-based run-time QoS assurance. We evaluate our meta-models by modeling a representative virtualized service infrastructure and using these model instances for run-time resource allocation. The results demonstrate the benefits of the new meta-models and show how they can be used to improve model-based system adaptation and run-time resource management in dynamic virtualized data centers.},\n address = {New York, NY, USA},\n author = {Nikolaus Huber and Fabian Brosig and Samuel Kounev},\n booktitle = {Proceedings of the 8th ACM SIGSOFT International Conference on the Quality of Software Architectures (QoSA 2012)},\n day = {25--28},\n doi = {10.1145/2304696.2304711},\n isbn = {978-1-4503-1346-9},\n location = {Bertinoro, Italy},\n month = {June},\n note = {Acceptance Rate (Full Paper): 25.6\\%},\n pages = {81--90},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/222.pdf},\n publisher = {ACM},\n title = {{Modeling Dynamic Virtualized Resource Landscapes}},\n url = {http://qosa.ipd.kit.edu/qosa_2012/},\n year = {2012},\n}\n\n','\n\nNikolaus Huber, Fabian Brosig, and Samuel Kounev.\nModeling Dynamic Virtualized Resource Landscapes.\nIn Proceedings of the 8th ACM SIGSOFT International Conference\non the Quality of Software Architectures (QoSA 2012), Bertinoro, Italy, June\n25-28, 2012, pages 81-90. ACM, New York, NY, USA.\nJune 2012, Acceptance Rate (Full Paper): 25.6%.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{HuBrKo2012-QoSA-ModelingVirtResLandscapes,\nabstract = {Modern data centers are subject to an increasing demand for flexibility. Increased flexibility and dynamics, however, also result in a higher system complexity. This complexity carries on to run-time resource management for Quality-of-Service (QoS) enforcement, rendering design-time approaches for QoS assurance inadequate. In this paper, we present a set of novel meta-models that can be used to describe the resource landscape, the architecture and resource layers of dynamic virtualized data center infrastructures, as well as their run-time adaptation and resource management aspects. With these meta-models we introduce new modeling concepts to improve model-based run-time QoS assurance. We evaluate our meta-models by modeling a representative virtualized service infrastructure and using these model instances for run-time resource allocation. The results demonstrate the benefits of the new meta-models and show how they can be used to improve model-based system adaptation and run-time resource management in dynamic virtualized data centers.},\naddress = {New York, NY, USA},\nauthor = {Nikolaus Huber and Fabian Brosig and Samuel Kounev},\nbooktitle = {Proceedings of the 8th ACM SIGSOFT International Conference on the Quality of Software Architectures (QoSA 2012)},\nday = {25--28},\ndoi = {10.1145/2304696.2304711},\nisbn = {978-1-4503-1346-9},\nlocation = {Bertinoro, Italy},\nmonth = {June},\nnote = {Acceptance Rate (Full Paper): 25.6\\%},\npages = {81--90},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/222.pdf},\npublisher = {ACM},\ntitle = {{Modeling Dynamic Virtualized Resource Landscapes}},\nurl = {http://qosa.ipd.kit.edu/qosa_2012/},\nyear = {2012}\n}\n
\n
\nModern data centers are subject to an increasing demand for flexibility. Increased flexibility and dynamics, however, also result in a higher system complexity. This complexity carries on to run-time resource management for Quality-of-Service (QoS) enforcement, rendering design-time approaches for QoS assurance inadequate. In this paper, we present a set of novel meta-models that can be used to describe the resource landscape, the architecture and resource layers of dynamic virtualized data center infrastructures, as well as their run-time adaptation and resource management aspects. With these meta-models we introduce new modeling concepts to improve model-based run-time QoS assurance. We evaluate our meta-models by modeling a representative virtualized service infrastructure and using these model instances for run-time resource allocation. The results demonstrate the benefits of the new meta-models and show how they can be used to improve model-based system adaptation and run-time resource management in dynamic virtualized data centers.\n
\n','
\n@inproceedings{HuBrKo2012-QoSA-ModelingVirtResLandscapes,\n  abstract = {Modern data centers are subject to an increasing demand for flexibility. Increased flexibility and dynamics, however, also result in a higher system complexity. This complexity carries on to run-time resource management for Quality-of-Service (QoS) enforcement, rendering design-time approaches for QoS assurance inadequate. In this paper, we present a set of novel meta-models that can be used to describe the resource landscape, the architecture and resource layers of dynamic virtualized data center infrastructures, as well as their run-time adaptation and resource management aspects. With these meta-models we introduce new modeling concepts to improve model-based run-time QoS assurance. We evaluate our meta-models by modeling a representative virtualized service infrastructure and using these model instances for run-time resource allocation. The results demonstrate the benefits of the new meta-models and show how they can be used to improve model-based system adaptation and run-time resource management in dynamic virtualized data centers.},\n  address = {New York, NY, USA},\n  author = {Nikolaus Huber and Fabian Brosig and Samuel Kounev},\n  booktitle = {Proceedings of the 8th ACM SIGSOFT International Conference on the Quality of Software Architectures (QoSA 2012)},\n  day = {25--28},\n  doi = {10.1145/2304696.2304711},\n  isbn = {978-1-4503-1346-9},\n  location = {Bertinoro, Italy},\n  month = {June},\n  note = {Acceptance Rate (Full Paper): 25.6\\%},\n  pages = {81--90},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/222.pdf},\n  publisher = {ACM},\n  title = {{Modeling Dynamic Virtualized Resource Landscapes}},\n  url = {http://qosa.ipd.kit.edu/qosa_2012/},\n  year = {2012}\n}\n
\n\n','Modern data centers are subject to an increasing demand for flexibility. Increased flexibility and dynamics, however, also result in a higher system complexity. This complexity carries on to run-time resource management for Quality-of-Service (QoS) enforcement, rendering design-time approaches for QoS assurance inadequate. In this paper, we present a set of novel meta-models that can be used to describe the resource landscape, the architecture and resource layers of dynamic virtualized data center infrastructures, as well as their run-time adaptation and resource management aspects. With these meta-models we introduce new modeling concepts to improve model-based run-time QoS assurance. We evaluate our meta-models by modeling a representative virtualized service infrastructure and using these model instances for run-time resource allocation. The results demonstrate the benefits of the new meta-models and show how they can be used to improve model-based system adaptation and run-time resource management in dynamic virtualized data centers.','{Modeling Dynamic Virtualized Resource Landscapes}',0,6,2012,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(223,'paper','HuBrKo2011-SEAMS-ResAlloc','inproceedings','@inproceedings{HuBrKo2011-SEAMS-ResAlloc,\n abstract = {The adoption of virtualization and Cloud Computing technologies promises a number of benefits such as increased flexibility, better energy efficiency and lower operating costs for IT systems. However, highly variable workloads make it challenging to provide quality-of-service guarantees while at the same time ensuring efficient resource utilization. To avoid violations of service-level agreements (SLAs) or inefficient resource usage, resource allocations have to be adapted continuously during operation to reflect changes in application workloads. In this paper, we present a novel approach to self-adaptive resource allocation in virtualized environments based on online architecture-level performance models. We present a detailed case study of a representative enterprise application, the new SPECjEnterprise2010 benchmark, deployed in a virtualized cluster environment. The case study serves as a proof-of-concept demonstrating the effectiveness and practical applicability of our approach.},\n address = {New York, NY, USA},\n author = {Nikolaus Huber and Fabian Brosig and Samuel Kounev},\n booktitle = {6th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2011)},\n day = {23--24},\n doi = {10.1145/1988008.1988021},\n isbn = {978-1-4503-0575-4},\n location = {Waikiki, Honolulu, HI, USA},\n month = {May},\n note = {Acceptance Rate (Full Paper): 27\\% (21/76)},\n pages = {90--99},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/223.pdf},\n publisher = {ACM},\n title = {{Model-based Self-Adaptive Resource Allocation in Virtualized Environments}},\n url = {http://dl.acm.org/authorize?425581},\n year = {2011},\n}\n\n','\n\nNikolaus Huber, Fabian Brosig, and Samuel Kounev.\nModel-based Self-Adaptive Resource Allocation in Virtualized\nEnvironments.\nIn 6th International Symposium on Software Engineering for\nAdaptive and Self-Managing Systems (SEAMS 2011), Waikiki, Honolulu, HI, USA,\nMay 23-24, 2011, pages 90-99. ACM, New York, NY, USA.\nMay 2011, Acceptance Rate (Full Paper): 27% (21/76).\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{HuBrKo2011-SEAMS-ResAlloc,\nabstract = {The adoption of virtualization and Cloud Computing technologies promises a number of benefits such as increased flexibility, better energy efficiency and lower operating costs for IT systems. However, highly variable workloads make it challenging to provide quality-of-service guarantees while at the same time ensuring efficient resource utilization. To avoid violations of service-level agreements (SLAs) or inefficient resource usage, resource allocations have to be adapted continuously during operation to reflect changes in application workloads. In this paper, we present a novel approach to self-adaptive resource allocation in virtualized environments based on online architecture-level performance models. We present a detailed case study of a representative enterprise application, the new SPECjEnterprise2010 benchmark, deployed in a virtualized cluster environment. The case study serves as a proof-of-concept demonstrating the effectiveness and practical applicability of our approach.},\naddress = {New York, NY, USA},\nauthor = {Nikolaus Huber and Fabian Brosig and Samuel Kounev},\nbooktitle = {6th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2011)},\nday = {23--24},\ndoi = {10.1145/1988008.1988021},\nisbn = {978-1-4503-0575-4},\nlocation = {Waikiki, Honolulu, HI, USA},\nmonth = {May},\nnote = {Acceptance Rate (Full Paper): 27\\% (21/76)},\npages = {90--99},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/223.pdf},\npublisher = {ACM},\ntitle = {{Model-based Self-Adaptive Resource Allocation in Virtualized Environments}},\nurl = {http://dl.acm.org/authorize?425581},\nyear = {2011}\n}\n
\n
\nThe adoption of virtualization and Cloud Computing technologies promises a number of benefits such as increased flexibility, better energy efficiency and lower operating costs for IT systems. However, highly variable workloads make it challenging to provide quality-of-service guarantees while at the same time ensuring efficient resource utilization. To avoid violations of service-level agreements (SLAs) or inefficient resource usage, resource allocations have to be adapted continuously during operation to reflect changes in application workloads. In this paper, we present a novel approach to self-adaptive resource allocation in virtualized environments based on online architecture-level performance models. We present a detailed case study of a representative enterprise application, the new SPECjEnterprise2010 benchmark, deployed in a virtualized cluster environment. The case study serves as a proof-of-concept demonstrating the effectiveness and practical applicability of our approach.\n
\n','
\n@inproceedings{HuBrKo2011-SEAMS-ResAlloc,\n  abstract = {The adoption of virtualization and Cloud Computing technologies promises a number of benefits such as increased flexibility, better energy efficiency and lower operating costs for IT systems. However, highly variable workloads make it challenging to provide quality-of-service guarantees while at the same time ensuring efficient resource utilization. To avoid violations of service-level agreements (SLAs) or inefficient resource usage, resource allocations have to be adapted continuously during operation to reflect changes in application workloads. In this paper, we present a novel approach to self-adaptive resource allocation in virtualized environments based on online architecture-level performance models. We present a detailed case study of a representative enterprise application, the new SPECjEnterprise2010 benchmark, deployed in a virtualized cluster environment. The case study serves as a proof-of-concept demonstrating the effectiveness and practical applicability of our approach.},\n  address = {New York, NY, USA},\n  author = {Nikolaus Huber and Fabian Brosig and Samuel Kounev},\n  booktitle = {6th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2011)},\n  day = {23--24},\n  doi = {10.1145/1988008.1988021},\n  isbn = {978-1-4503-0575-4},\n  location = {Waikiki, Honolulu, HI, USA},\n  month = {May},\n  note = {Acceptance Rate (Full Paper): 27\\% (21/76)},\n  pages = {90--99},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/223.pdf},\n  publisher = {ACM},\n  title = {{Model-based Self-Adaptive Resource Allocation in Virtualized Environments}},\n  url = {http://dl.acm.org/authorize?425581},\n  year = {2011}\n}\n
\n\n','The adoption of virtualization and Cloud Computing technologies promises a number of benefits such as increased flexibility, better energy efficiency and lower operating costs for IT systems. However, highly variable workloads make it challenging to provide quality-of-service guarantees while at the same time ensuring efficient resource utilization. To avoid violations of service-level agreements (SLAs) or inefficient resource usage, resource allocations have to be adapted continuously during operation to reflect changes in application workloads. In this paper, we present a novel approach to self-adaptive resource allocation in virtualized environments based on online architecture-level performance models. We present a detailed case study of a representative enterprise application, the new SPECjEnterprise2010 benchmark, deployed in a virtualized cluster environment. The case study serves as a proof-of-concept demonstrating the effectiveness and practical applicability of our approach.','{Model-based Self-Adaptive Resource Allocation in Virtualized Environments}',0,5,2011,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(224,'paper','HuHoKoBrKo2012-ICEBE-STA','inproceedings','@inproceedings{HuHoKoBrKo2012-ICEBE-STA,\n abstract = {Modern virtualized system environments usually host diverse applications of different parties and aim at utilizing resources efficiently while ensuring that quality-of-service requirements are continuously satisfied. In such scenarios, complex adaptations to changes in the system environment are still largely performed manually by humans. Over the past decade, autonomic self-adaptation techniques aiming to minimize human intervention have become increasingly popular. However, given that adaptation processes are usually highly system specific, it is a challenge to abstract from system details enabling the reuse of adaptation strategies. In this paper, we propose a novel modeling language (meta-model) providing means to describe system adaptation processes at the system architecture level in a generic, human-understandable and reusable way. We apply our approach to three different realistic contexts (dynamic resource allocation, software architecture optimization, and run-time adaptation planning) showing how the gap between complex manual adaptations and their autonomous execution can be closed by using a holistic model-based approach.},\n address = {Los Alamitos, CA, USA},\n author = {Nikolaus Huber and Andr\\\'{e} van Hoorn and Anne Koziolek and Fabian Brosig and Samuel Kounev},\n booktitle = {Proceedings of the 9th IEEE International Conference on e-Business Engineering (ICEBE 2012)},\n day = {9--11},\n doi = {http://doi.ieeecomputersociety.org/10.1109/ICEBE.2012.21},\n isbn = {978-1-4673-2601-8},\n location = {Hangzhou, China},\n month = {September},\n note = {Acceptance Rate (Full Paper): 19.7\\% (26/132)},\n pages = {70--77},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/224.pdf},\n publisher = {IEEE Computer Society},\n title = {{S/T/A: Meta-Modeling Run-Time Adaptation in Component-Based System Architectures}},\n url = {http://conferences.computer.org/icebe/2012/index.htm},\n year = {2012},\n}\n\n','\n\nNikolaus Huber, André van Hoorn, Anne Koziolek, Fabian Brosig, and Samuel\nKounev.\nS/T/A: Meta-Modeling Run-Time Adaptation in Component-Based System\nArchitectures.\nIn Proceedings of the 9th IEEE International Conference on\ne-Business Engineering (ICEBE 2012), Hangzhou, China, September 9-11, 2012,\npages 70-77. IEEE Computer Society, Los Alamitos, CA, USA.\nSeptember 2012, Acceptance Rate (Full Paper): 19.7% (26/132).\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{HuHoKoBrKo2012-ICEBE-STA,\nabstract = {Modern virtualized system environments usually host diverse applications of different parties and aim at utilizing resources efficiently while ensuring that quality-of-service requirements are continuously satisfied. In such scenarios, complex adaptations to changes in the system environment are still largely performed manually by humans. Over the past decade, autonomic self-adaptation techniques aiming to minimize human intervention have become increasingly popular. However, given that adaptation processes are usually highly system specific, it is a challenge to abstract from system details enabling the reuse of adaptation strategies. In this paper, we propose a novel modeling language (meta-model) providing means to describe system adaptation processes at the system architecture level in a generic, human-understandable and reusable way. We apply our approach to three different realistic contexts (dynamic resource allocation, software architecture optimization, and run-time adaptation planning) showing how the gap between complex manual adaptations and their autonomous execution can be closed by using a holistic model-based approach.},\naddress = {Los Alamitos, CA, USA},\nauthor = {Nikolaus Huber and Andr\\\'{e} van Hoorn and Anne Koziolek and Fabian Brosig and Samuel Kounev},\nbooktitle = {Proceedings of the 9th IEEE International Conference on e-Business Engineering (ICEBE 2012)},\nday = {9--11},\ndoi = {http://doi.ieeecomputersociety.org/10.1109/ICEBE.2012.21},\nisbn = {978-1-4673-2601-8},\nlocation = {Hangzhou, China},\nmonth = {September},\nnote = {Acceptance Rate (Full Paper): 19.7\\% (26/132)},\npages = {70--77},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/224.pdf},\npublisher = {IEEE Computer Society},\ntitle = {{S/T/A: Meta-Modeling Run-Time Adaptation in Component-Based System Architectures}},\nurl = {http://conferences.computer.org/icebe/2012/index.htm},\nyear = {2012}\n}\n
\n
\nModern virtualized system environments usually host diverse applications of different parties and aim at utilizing resources efficiently while ensuring that quality-of-service requirements are continuously satisfied. In such scenarios, complex adaptations to changes in the system environment are still largely performed manually by humans. Over the past decade, autonomic self-adaptation techniques aiming to minimize human intervention have become increasingly popular. However, given that adaptation processes are usually highly system specific, it is a challenge to abstract from system details enabling the reuse of adaptation strategies. In this paper, we propose a novel modeling language (meta-model) providing means to describe system adaptation processes at the system architecture level in a generic, human-understandable and reusable way. We apply our approach to three different realistic contexts (dynamic resource allocation, software architecture optimization, and run-time adaptation planning) showing how the gap between complex manual adaptations and their autonomous execution can be closed by using a holistic model-based approach.\n
\n','
\n@inproceedings{HuHoKoBrKo2012-ICEBE-STA,\n  abstract = {Modern virtualized system environments usually host diverse applications of different parties and aim at utilizing resources efficiently while ensuring that quality-of-service requirements are continuously satisfied. In such scenarios, complex adaptations to changes in the system environment are still largely performed manually by humans. Over the past decade, autonomic self-adaptation techniques aiming to minimize human intervention have become increasingly popular. However, given that adaptation processes are usually highly system specific, it is a challenge to abstract from system details enabling the reuse of adaptation strategies. In this paper, we propose a novel modeling language (meta-model) providing means to describe system adaptation processes at the system architecture level in a generic, human-understandable and reusable way. We apply our approach to three different realistic contexts (dynamic resource allocation, software architecture optimization, and run-time adaptation planning) showing how the gap between complex manual adaptations and their autonomous execution can be closed by using a holistic model-based approach.},\n  address = {Los Alamitos, CA, USA},\n  author = {Nikolaus Huber and Andr\\\'{e} van Hoorn and Anne Koziolek and Fabian Brosig and Samuel Kounev},\n  booktitle = {Proceedings of the 9th IEEE International Conference on e-Business Engineering (ICEBE 2012)},\n  day = {9--11},\n  doi = {http://doi.ieeecomputersociety.org/10.1109/ICEBE.2012.21},\n  isbn = {978-1-4673-2601-8},\n  location = {Hangzhou, China},\n  month = {September},\n  note = {Acceptance Rate (Full Paper): 19.7\\% (26/132)},\n  pages = {70--77},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/224.pdf},\n  publisher = {IEEE Computer Society},\n  title = {{S/T/A: Meta-Modeling Run-Time Adaptation in Component-Based System Architectures}},\n  url = {http://conferences.computer.org/icebe/2012/index.htm},\n  year = {2012}\n}\n
\n\n','Modern virtualized system environments usually host diverse applications of different parties and aim at utilizing resources efficiently while ensuring that quality-of-service requirements are continuously satisfied. In such scenarios, complex adaptations to changes in the system environment are still largely performed manually by humans. Over the past decade, autonomic self-adaptation techniques aiming to minimize human intervention have become increasingly popular. However, given that adaptation processes are usually highly system specific, it is a challenge to abstract from system details enabling the reuse of adaptation strategies. In this paper, we propose a novel modeling language (meta-model) providing means to describe system adaptation processes at the system architecture level in a generic, human-understandable and reusable way. We apply our approach to three different realistic contexts (dynamic resource allocation, software architecture optimization, and run-time adaptation planning) showing how the gap between complex manual adaptations and their autonomous execution can be closed by using a holistic model-based approach.','{S/T/A: Meta-Modeling Run-Time Adaptation in Component-Based System Architectures}',0,9,2012,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(225,'paper','HuQuBrHaKo2012-CCaSS-ExpVirtPerfOverhead','incollection','@incollection{HuQuBrHaKo2012-CCaSS-ExpVirtPerfOverhead,\n address = {New York},\n author = {Huber, Nikolaus and von Quast, Marcel and Brosig, Fabian and Hauck, Michael and Kounev, Samuel},\n booktitle = {Cloud Computing and Services Science},\n doi = {10.1007/978-1-4614-2326-3_19},\n editor = {Ivanov, Ivan and van Sinderen, Marten and Shishkov, Boris},\n isbn = {978-1-4614-2325-6},\n language = {English},\n pages = {353--370},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/225.pdf},\n publisher = {Springer},\n series = {Service Science: Research and Innovations in the Service Economy},\n title = {{A Method for Experimental Analysis and Modeling of Virtualization Performance Overhead}},\n url = {http://dx.doi.org/10.1007/978-1-4614-2326-3_19},\n year = {2012},\n}\n\n','\n\nNikolaus Huber, Marcel von Quast, Fabian Brosig, Michael Hauck, and Samuel\nKounev.\nA Method for Experimental Analysis and Modeling of Virtualization\nPerformance Overhead.\nIn Cloud Computing and Services Science, Ivan Ivanov, Marten\nvan Sinderen, and Boris Shishkov, editors, Service Science: Research and\nInnovations in the Service Economy, pages 353-370. Springer, New York, 2012.\n[ bib | DOI | http | .pdf  ] 
\n@incollection{HuQuBrHaKo2012-CCaSS-ExpVirtPerfOverhead,\naddress = {New York},\nauthor = {Huber, Nikolaus and von Quast, Marcel and Brosig, Fabian and Hauck, Michael and Kounev, Samuel},\nbooktitle = {Cloud Computing and Services Science},\ndoi = {10.1007/978-1-4614-2326-3_19},\neditor = {Ivanov, Ivan and van Sinderen, Marten and Shishkov, Boris},\nisbn = {978-1-4614-2325-6},\nlanguage = {English},\npages = {353--370},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/225.pdf},\npublisher = {Springer},\nseries = {Service Science: Research and Innovations in the Service Economy},\ntitle = {{A Method for Experimental Analysis and Modeling of Virtualization Performance Overhead}},\nurl = {http://dx.doi.org/10.1007/978-1-4614-2326-3_19},\nyear = {2012}\n}\n
\n
\n','
\n@incollection{HuQuBrHaKo2012-CCaSS-ExpVirtPerfOverhead,\n  address = {New York},\n  author = {Huber, Nikolaus and von Quast, Marcel and Brosig, Fabian and Hauck, Michael and Kounev, Samuel},\n  booktitle = {Cloud Computing and Services Science},\n  doi = {10.1007/978-1-4614-2326-3_19},\n  editor = {Ivanov, Ivan and van Sinderen, Marten and Shishkov, Boris},\n  isbn = {978-1-4614-2325-6},\n  language = {English},\n  pages = {353--370},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/225.pdf},\n  publisher = {Springer},\n  series = {Service Science: Research and Innovations in the Service Economy},\n  title = {{A Method for Experimental Analysis and Modeling of Virtualization Performance Overhead}},\n  url = {http://dx.doi.org/10.1007/978-1-4614-2326-3_19},\n  year = {2012}\n}\n
\n\n',NULL,'{A Method for Experimental Analysis and Modeling of Virtualization Performance Overhead}',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(226,'paper','HuQuBrKo2010-DOA-AnalysisVirt','inproceedings','@inproceedings{HuQuBrKo2010-DOA-AnalysisVirt,\n abstract = {Nowadays, virtualization solutions are gaining increasing importance. By enabling the sharing of physical resources, thus making resource usage more efficient, they promise energy and cost savings. Additionally, virtualization is the key enabling technology for Cloud Computing and server consolidation. However, the effects of sharing resources on system performance are not yet well-understood. This makes performance prediction and performance management of services deployed in such dynamic systems very challenging. Because of the large variety of virtualization solutions, a generic approach to predict the performance influences of virtualization platforms is highly desirable. In this paper, we present a hierarchical model capturing the major performance-relevant factors of virtualization platforms. We then propose a general methodology to quantify the influence of the identified factors based on an empirical approach using benchmarks. Finally, we present a case study of Citrix XenServer 5.5, a state-of-the-art virtualization platform.},\n address = {Crete, Greece},\n author = {Nikolaus Huber and Marcel von Quast and Fabian Brosig and Samuel Kounev},\n booktitle = {The 12th International Symposium on Distributed Objects, Middleware, and Applications (DOA 2010)},\n day = {26},\n location = {Crete, Greece},\n month = {October},\n note = {Acceptance Rate (Full Paper): 33\\%},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/226.pdf},\n publisher = {Springer Verlag},\n title = {{Analysis of the Performance-Influencing Factors of Virtualization Platforms}},\n year = {2010},\n}\n\n','\n\nNikolaus Huber, Marcel von Quast, Fabian Brosig, and Samuel Kounev.\nAnalysis of the Performance-Influencing Factors of Virtualization\nPlatforms.\nIn The 12th International Symposium on Distributed Objects,\nMiddleware, and Applications (DOA 2010), Crete, Greece, October 26, 2010.\nSpringer Verlag, Crete, Greece.\nOctober 2010, Acceptance Rate (Full Paper): 33%.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{HuQuBrKo2010-DOA-AnalysisVirt,\nabstract = {Nowadays, virtualization solutions are gaining increasing importance. By enabling the sharing of physical resources, thus making resource usage more efficient, they promise energy and cost savings. Additionally, virtualization is the key enabling technology for Cloud Computing and server consolidation. However, the effects of sharing resources on system performance are not yet well-understood. This makes performance prediction and performance management of services deployed in such dynamic systems very challenging. Because of the large variety of virtualization solutions, a generic approach to predict the performance influences of virtualization platforms is highly desirable. In this paper, we present a hierarchical model capturing the major performance-relevant factors of virtualization platforms. We then propose a general methodology to quantify the influence of the identified factors based on an empirical approach using benchmarks. Finally, we present a case study of Citrix XenServer 5.5, a state-of-the-art virtualization platform.},\naddress = {Crete, Greece},\nauthor = {Nikolaus Huber and Marcel von Quast and Fabian Brosig and Samuel Kounev},\nbooktitle = {The 12th International Symposium on Distributed Objects, Middleware, and Applications (DOA 2010)},\nday = {26},\nlocation = {Crete, Greece},\nmonth = {October},\nnote = {Acceptance Rate (Full Paper): 33\\%},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/226.pdf},\npublisher = {Springer Verlag},\ntitle = {{Analysis of the Performance-Influencing Factors of Virtualization Platforms}},\nyear = {2010}\n}\n
\n
\nNowadays, virtualization solutions are gaining increasing importance. By enabling the sharing of physical resources, thus making resource usage more efficient, they promise energy and cost savings. Additionally, virtualization is the key enabling technology for Cloud Computing and server consolidation. However, the effects of sharing resources on system performance are not yet well-understood. This makes performance prediction and performance management of services deployed in such dynamic systems very challenging. Because of the large variety of virtualization solutions, a generic approach to predict the performance influences of virtualization platforms is highly desirable. In this paper, we present a hierarchical model capturing the major performance-relevant factors of virtualization platforms. We then propose a general methodology to quantify the influence of the identified factors based on an empirical approach using benchmarks. Finally, we present a case study of Citrix XenServer 5.5, a state-of-the-art virtualization platform.\n
\n','
\n@inproceedings{HuQuBrKo2010-DOA-AnalysisVirt,\n  abstract = {Nowadays, virtualization solutions are gaining increasing importance. By enabling the sharing of physical resources, thus making resource usage more efficient, they promise energy and cost savings. Additionally, virtualization is the key enabling technology for Cloud Computing and server consolidation. However, the effects of sharing resources on system performance are not yet well-understood. This makes performance prediction and performance management of services deployed in such dynamic systems very challenging. Because of the large variety of virtualization solutions, a generic approach to predict the performance influences of virtualization platforms is highly desirable. In this paper, we present a hierarchical model capturing the major performance-relevant factors of virtualization platforms. We then propose a general methodology to quantify the influence of the identified factors based on an empirical approach using benchmarks. Finally, we present a case study of Citrix XenServer 5.5, a state-of-the-art virtualization platform.},\n  address = {Crete, Greece},\n  author = {Nikolaus Huber and Marcel von Quast and Fabian Brosig and Samuel Kounev},\n  booktitle = {The 12th International Symposium on Distributed Objects, Middleware, and Applications (DOA 2010)},\n  day = {26},\n  location = {Crete, Greece},\n  month = {October},\n  note = {Acceptance Rate (Full Paper): 33\\%},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/226.pdf},\n  publisher = {Springer Verlag},\n  title = {{Analysis of the Performance-Influencing Factors of Virtualization Platforms}},\n  year = {2010}\n}\n
\n\n','Nowadays, virtualization solutions are gaining increasing importance. By enabling the sharing of physical resources, thus making resource usage more efficient, they promise energy and cost savings. Additionally, virtualization is the key enabling technology for Cloud Computing and server consolidation. However, the effects of sharing resources on system performance are not yet well-understood. This makes performance prediction and performance management of services deployed in such dynamic systems very challenging. Because of the large variety of virtualization solutions, a generic approach to predict the performance influences of virtualization platforms is highly desirable. In this paper, we present a hierarchical model capturing the major performance-relevant factors of virtualization platforms. We then propose a general methodology to quantify the influence of the identified factors based on an empirical approach using benchmarks. Finally, we present a case study of Citrix XenServer 5.5, a state-of-the-art virtualization platform.','{Analysis of the Performance-Influencing Factors of Virtualization Platforms}',0,10,2010,10,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(227,'paper','HuQuHaKo2011-CLOSER-ModelVirtOverhead','inproceedings','@inproceedings{HuQuHaKo2011-CLOSER-ModelVirtOverhead,\n abstract = {Due to trends like Cloud Computing and Green IT, virtualization technologies are gaining increasing importance. They promise energy and cost savings by sharing physical resources, thus making resource usage more efficient. However, resource sharing and other factors have direct effects on system performance, which are not yet well-understood. Hence, performance prediction and performance management of services deployed in virtualized environments like public and private Clouds is a challenging task. Because of the large variety of virtualization solutions, a generic approach to predict the performance overhead of services running on virtualization platforms is highly desirable. In this paper, we present experimental results on two popular state-of-the-art virtualization platforms, Citrix XenServer 5.5 and VMware ESX 4.0, as representatives of the two major hypervisor architectures. Based on these results, we propose a basic, generic performance prediction model for the two different types of hypervisor architectures. The target is to predict the performance overhead for executing services on virtualized platforms.},\n author = {Nikolaus Huber and Marcel von Quast and Michael Hauck and Samuel Kounev},\n booktitle = {Proceedings of the 1st International Conference on Cloud Computing and Services Science (CLOSER 2011)},\n day = {7--9},\n http = {http://closer.scitevents.org/},\n isbn = {978-989-8425-52-2},\n location = {Noordwijkerhout, The Netherlands},\n month = {May},\n note = {Acceptance Rate: 18/164 = 10.9\\%, Best Paper Award},\n pages = {563 -- 573},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/227.pdf},\n publisher = {SciTePress},\n title = {{E}valuating and {M}odeling {V}irtualization {P}erformance {O}verhead for {C}loud {E}nvironments},\n year = {2011},\n}\n\n','\n\nNikolaus Huber, Marcel von Quast, Michael Hauck, and Samuel Kounev.\nEvaluating and Modeling Virtualization Performance Overhead\nfor Cloud Environments.\nIn Proceedings of the 1st International Conference on Cloud\nComputing and Services Science (CLOSER 2011), Noordwijkerhout, The\nNetherlands, May 7-9, 2011, pages 563 - 573. SciTePress.\nMay 2011, Acceptance Rate: 18/164 = 10.9%, Best Paper Award.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{HuQuHaKo2011-CLOSER-ModelVirtOverhead,\nabstract = {Due to trends like Cloud Computing and Green IT, virtualization technologies are gaining increasing importance. They promise energy and cost savings by sharing physical resources, thus making resource usage more efficient. However, resource sharing and other factors have direct effects on system performance, which are not yet well-understood. Hence, performance prediction and performance management of services deployed in virtualized environments like public and private Clouds is a challenging task. Because of the large variety of virtualization solutions, a generic approach to predict the performance overhead of services running on virtualization platforms is highly desirable. In this paper, we present experimental results on two popular state-of-the-art virtualization platforms, Citrix XenServer 5.5 and VMware ESX 4.0, as representatives of the two major hypervisor architectures. Based on these results, we propose a basic, generic performance prediction model for the two different types of hypervisor architectures. The target is to predict the performance overhead for executing services on virtualized platforms.},\nauthor = {Nikolaus Huber and Marcel von Quast and Michael Hauck and Samuel Kounev},\nbooktitle = {Proceedings of the 1st International Conference on Cloud Computing and Services Science (CLOSER 2011)},\nday = {7--9},\nhttp = {http://closer.scitevents.org/},\nisbn = {978-989-8425-52-2},\nlocation = {Noordwijkerhout, The Netherlands},\nmonth = {May},\nnote = {Acceptance Rate: 18/164 = 10.9\\%, Best Paper Award},\npages = {563 -- 573},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/227.pdf},\npublisher = {SciTePress},\ntitle = {{E}valuating and {M}odeling {V}irtualization {P}erformance {O}verhead for {C}loud {E}nvironments},\nyear = {2011}\n}\n
\n
\nDue to trends like Cloud Computing and Green IT, virtualization technologies are gaining increasing importance. They promise energy and cost savings by sharing physical resources, thus making resource usage more efficient. However, resource sharing and other factors have direct effects on system performance, which are not yet well-understood. Hence, performance prediction and performance management of services deployed in virtualized environments like public and private Clouds is a challenging task. Because of the large variety of virtualization solutions, a generic approach to predict the performance overhead of services running on virtualization platforms is highly desirable. In this paper, we present experimental results on two popular state-of-the-art virtualization platforms, Citrix XenServer 5.5 and VMware ESX 4.0, as representatives of the two major hypervisor architectures. Based on these results, we propose a basic, generic performance prediction model for the two different types of hypervisor architectures. The target is to predict the performance overhead for executing services on virtualized platforms.\n
\n','
\n@inproceedings{HuQuHaKo2011-CLOSER-ModelVirtOverhead,\n  abstract = {Due to trends like Cloud Computing and Green IT, virtualization technologies are gaining increasing importance. They promise energy and cost savings by sharing physical resources, thus making resource usage more efficient. However, resource sharing and other factors have direct effects on system performance, which are not yet well-understood. Hence, performance prediction and performance management of services deployed in virtualized environments like public and private Clouds is a challenging task. Because of the large variety of virtualization solutions, a generic approach to predict the performance overhead of services running on virtualization platforms is highly desirable. In this paper, we present experimental results on two popular state-of-the-art virtualization platforms, Citrix XenServer 5.5 and VMware ESX 4.0, as representatives of the two major hypervisor architectures. Based on these results, we propose a basic, generic performance prediction model for the two different types of hypervisor architectures. The target is to predict the performance overhead for executing services on virtualized platforms.},\n  author = {Nikolaus Huber and Marcel von Quast and Michael Hauck and Samuel Kounev},\n  booktitle = {Proceedings of the 1st International Conference on Cloud Computing and Services Science (CLOSER 2011)},\n  day = {7--9},\n  http = {http://closer.scitevents.org/},\n  isbn = {978-989-8425-52-2},\n  location = {Noordwijkerhout, The Netherlands},\n  month = {May},\n  note = {Acceptance Rate: 18/164 = 10.9\\%, Best Paper Award},\n  pages = {563 -- 573},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/227.pdf},\n  publisher = {SciTePress},\n  title = {{E}valuating and {M}odeling {V}irtualization {P}erformance {O}verhead for {C}loud {E}nvironments},\n  year = {2011}\n}\n
\n\n','Due to trends like Cloud Computing and Green IT, virtualization technologies are gaining increasing importance. They promise energy and cost savings by sharing physical resources, thus making resource usage more efficient. However, resource sharing and other factors have direct effects on system performance, which are not yet well-understood. Hence, performance prediction and performance management of services deployed in virtualized environments like public and private Clouds is a challenging task. Because of the large variety of virtualization solutions, a generic approach to predict the performance overhead of services running on virtualization platforms is highly desirable. In this paper, we present experimental results on two popular state-of-the-art virtualization platforms, Citrix XenServer 5.5 and VMware ESX 4.0, as representatives of the two major hypervisor architectures. Based on these results, we propose a basic, generic performance prediction model for the two different types of hypervisor architectures. The target is to predict the performance overhead for executing services on virtualized platforms.','{E}valuating and {M}odeling {V}irtualization {P}erformance {O}verhead for {C}loud {E}nvironments',0,5,2011,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(231,'paper','JuKoBu2003-CMG-PetStoreWS','inproceedings','@inproceedings{JuKoBu2003-CMG-PetStoreWS,\n abstract = {Web Services are increasingly used to enable loosely coupled integration among heterogeneous systems but are perceived as a source of severe performance degradation. This paper looks at the impact on system performance when introducing Web Service interfaces to an originally tightly coupled application. Using two implementation variants of Sun\'s Java Pet Store application, one based strictly on the J2EE platform and the other implementing some interfaces as Web Services, performance is compared in terms of the achieved overall throughput, response times and latency.},\n author = {Kai S. Juse and Samuel Kounev and Alejandro Buchmann},\n booktitle = {Proceedings of the 29th International Conference of the Computer Measurement Group on Resource Management and Performance Evaluation of Enterprise Computing Systems (CMG 2003), Dallas, Texas, USA, December 7-12, 2003},\n month = {December},\n organization = {Computer Measurement Group (CMG)},\n pages = {113--123},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/231.pdf},\n title = {{PetStore-WS: Measuring the Performance Implications of Web Services}},\n url = {http://www.cmg.org/proceedings/2003/3187.pdf},\n year = {2003},\n}\n\n','\n\nKai S. Juse, Samuel Kounev, and Alejandro Buchmann.\nPetStore-WS: Measuring the Performance Implications of Web\nServices.\nIn Proceedings of the 29th International Conference of the\nComputer Measurement Group on Resource Management and Performance Evaluation\nof Enterprise Computing Systems (CMG 2003), Dallas, Texas, USA, December\n7-12, 2003, December 2003, pages 113-123. Computer Measurement Group (CMG).\n[ bib | .pdf | .pdf | Abstract  ] 
\n@inproceedings{JuKoBu2003-CMG-PetStoreWS,\nabstract = {Web Services are increasingly used to enable loosely coupled integration among heterogeneous systems but are perceived as a source of severe performance degradation. This paper looks at the impact on system performance when introducing Web Service interfaces to an originally tightly coupled application. Using two implementation variants of Sun\'s Java Pet Store application, one based strictly on the J2EE platform and the other implementing some interfaces as Web Services, performance is compared in terms of the achieved overall throughput, response times and latency.},\nauthor = {Kai S. Juse and Samuel Kounev and Alejandro Buchmann},\nbooktitle = {Proceedings of the 29th International Conference of the Computer Measurement Group on Resource Management and Performance Evaluation of Enterprise Computing Systems (CMG 2003), Dallas, Texas, USA, December 7-12, 2003},\nmonth = {December},\norganization = {Computer Measurement Group (CMG)},\npages = {113--123},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/231.pdf},\ntitle = {{PetStore-WS: Measuring the Performance Implications of Web Services}},\nurl = {http://www.cmg.org/proceedings/2003/3187.pdf},\nyear = {2003}\n}\n
\n
\nWeb Services are increasingly used to enable loosely coupled integration among heterogeneous systems but are perceived as a source of severe performance degradation. This paper looks at the impact on system performance when introducing Web Service interfaces to an originally tightly coupled application. Using two implementation variants of Sun\'s Java Pet Store application, one based strictly on the J2EE platform and the other implementing some interfaces as Web Services, performance is compared in terms of the achieved overall throughput, response times and latency.\n
\n','
\n@inproceedings{JuKoBu2003-CMG-PetStoreWS,\n  abstract = {Web Services are increasingly used to enable loosely coupled integration among heterogeneous systems but are perceived as a source of severe performance degradation. This paper looks at the impact on system performance when introducing Web Service interfaces to an originally tightly coupled application. Using two implementation variants of Sun\'s Java Pet Store application, one based strictly on the J2EE platform and the other implementing some interfaces as Web Services, performance is compared in terms of the achieved overall throughput, response times and latency.},\n  author = {Kai S. Juse and Samuel Kounev and Alejandro Buchmann},\n  booktitle = {Proceedings of the 29th International Conference of the Computer Measurement Group on Resource Management and Performance Evaluation of Enterprise Computing Systems (CMG 2003), Dallas, Texas, USA, December 7-12, 2003},\n  month = {December},\n  organization = {Computer Measurement Group (CMG)},\n  pages = {113--123},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/231.pdf},\n  title = {{PetStore-WS: Measuring the Performance Implications of Web Services}},\n  url = {http://www.cmg.org/proceedings/2003/3187.pdf},\n  year = {2003}\n}\n
\n\n','Web Services are increasingly used to enable loosely coupled integration among heterogeneous systems but are perceived as a source of severe performance degradation. This paper looks at the impact on system performance when introducing Web Service interfaces to an originally tightly coupled application. Using two implementation variants of Sun\'s Java Pet Store application, one based strictly on the J2EE platform and the other implementing some interfaces as Web Services, performance is compared in terms of the achieved overall throughput, response times and latency.','{PetStore-WS: Measuring the Performance Implications of Web Services}',0,12,2003,12,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(243,'paper','KaBeCaDiKuMoSt2012-EUROSYS','inproceedings','@inproceedings{KaBeCaDiKuMoSt2012-EUROSYS,\n acmid = {2168866},\n address = {New York, NY, USA},\n author = {Kapitza, R\\\"{u}diger and Behl, Johannes and Cachin, Christian and Distler, Tobias and Kuhnle, Simon and Mohammadi, Seyed Vahid and Schr\\\"{o}der-Preikschat, Wolfgang and Stengel, Klaus},\n booktitle = {Proceedings of the 7th ACM european conference on Computer Systems},\n doi = {10.1145/2168836.2168866},\n isbn = {978-1-4503-1223-3},\n keywords = {byzantine failures, resource efficiency},\n location = {Bern, Switzerland},\n numpages = {14},\n pages = {295--308},\n publisher = {ACM},\n series = {EuroSys \'12},\n title = {CheapBFT: resource-efficient byzantine fault tolerance},\n url = {http://doi.acm.org/10.1145/2168836.2168866},\n year = {2012},\n}\n\n','\n\nRüdiger Kapitza, Johannes Behl, Christian Cachin, Tobias Distler, Simon\nKuhnle, Seyed Vahid Mohammadi, Wolfgang Schröder-Preikschat, and Klaus\nStengel.\nCheapbft: resource-efficient byzantine fault tolerance.\nIn Proceedings of the 7th ACM european conference on Computer\nSystems, Bern, Switzerland, 2012, EuroSys \'12, pages 295-308. ACM, New\nYork, NY, USA.\n2012.\n[ bib | DOI | http  ] 
\n@inproceedings{KaBeCaDiKuMoSt2012-EUROSYS,\nacmid = {2168866},\naddress = {New York, NY, USA},\nauthor = {Kapitza, R\\\"{u}diger and Behl, Johannes and Cachin, Christian and Distler, Tobias and Kuhnle, Simon and Mohammadi, Seyed Vahid and Schr\\\"{o}der-Preikschat, Wolfgang and Stengel, Klaus},\nbooktitle = {Proceedings of the 7th ACM european conference on Computer Systems},\ndoi = {10.1145/2168836.2168866},\nisbn = {978-1-4503-1223-3},\nkeywords = {byzantine failures, resource efficiency},\nlocation = {Bern, Switzerland},\nnumpages = {14},\npages = {295--308},\npublisher = {ACM},\nseries = {EuroSys \'12},\ntitle = {CheapBFT: resource-efficient byzantine fault tolerance},\nurl = {http://doi.acm.org/10.1145/2168836.2168866},\nyear = {2012}\n}\n
\n
\n','
\n@inproceedings{KaBeCaDiKuMoSt2012-EUROSYS,\n  acmid = {2168866},\n  address = {New York, NY, USA},\n  author = {Kapitza, R\\\"{u}diger and Behl, Johannes and Cachin, Christian and Distler, Tobias and Kuhnle, Simon and Mohammadi, Seyed Vahid and Schr\\\"{o}der-Preikschat, Wolfgang and Stengel, Klaus},\n  booktitle = {Proceedings of the 7th ACM european conference on Computer Systems},\n  doi = {10.1145/2168836.2168866},\n  isbn = {978-1-4503-1223-3},\n  keywords = {byzantine failures, resource efficiency},\n  location = {Bern, Switzerland},\n  numpages = {14},\n  pages = {295--308},\n  publisher = {ACM},\n  series = {EuroSys \'12},\n  title = {CheapBFT: resource-efficient byzantine fault tolerance},\n  url = {http://doi.acm.org/10.1145/2168836.2168866},\n  year = {2012}\n}\n
\n\n',NULL,'CheapBFT: resource-efficient byzantine fault tolerance',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(261,'paper','klatt2011a','inproceedings','@inproceedings{klatt2011a,\n abstract = {With the introduction of services, software systems have become more flexible as new services can easily be composed from existing ones. Service composition frameworks offer corresponding functionality and hide the complexity of the underlying technologies from their users. However, possibilities for anticipating quality properties of com- posed services before their actual operation are limited so far. While existing approaches for model-based software quality prediction can be used by service composers for determining realizable Quality of Service (QoS) levels, integration of such techniques into composition frameworks is still missing. As a result, high effort and expert knowledge is required to build the system models required for prediction. In this paper, we present a novel service composition process that includes QoS prediction for composed services as an integral part. Furthermore, we describe how composition frameworks can be extended to support this process. With our approach, systematic consideration of service quality during the composition process is naturally achieved, without the need for de- tailed knowledge about the underlying prediction models. To evaluate our work and validate its applicability in different domains, we have integrated QoS prediction support according to our process in two com- position frameworks -- a large-scale SLA management framework and a service mashup platform.},\n author = {Benjamin Klatt and Franz Brosch and Zoya Durdik and Christoph Rathfelder},\n booktitle = {5th Workshop on Non-Functional Properties and SLA Management in Service-Oriented Computing (NFPSLAM-SOC 2011)},\n day = {5--8},\n location = {Paphos, Cyprus},\n month = {December},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/261.pdf},\n title = {{Quality Prediction in Service Composition Frameworks}},\n year = {2011},\n}\n\n','\n\nBenjamin Klatt, Franz Brosch, Zoya Durdik, and Christoph Rathfelder.\nQuality Prediction in Service Composition Frameworks.\nIn 5th Workshop on Non-Functional Properties and SLA Management\nin Service-Oriented Computing (NFPSLAM-SOC 2011), Paphos, Cyprus, December\n5-8, 2011.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{klatt2011a,\nabstract = {With the introduction of services, software systems have become more flexible as new services can easily be composed from existing ones. Service composition frameworks offer corresponding functionality and hide the complexity of the underlying technologies from their users. However, possibilities for anticipating quality properties of com- posed services before their actual operation are limited so far. While existing approaches for model-based software quality prediction can be used by service composers for determining realizable Quality of Service (QoS) levels, integration of such techniques into composition frameworks is still missing. As a result, high effort and expert knowledge is required to build the system models required for prediction. In this paper, we present a novel service composition process that includes QoS prediction for composed services as an integral part. Furthermore, we describe how composition frameworks can be extended to support this process. With our approach, systematic consideration of service quality during the composition process is naturally achieved, without the need for de- tailed knowledge about the underlying prediction models. To evaluate our work and validate its applicability in different domains, we have integrated QoS prediction support according to our process in two com- position frameworks -- a large-scale SLA management framework and a service mashup platform.},\nauthor = {Benjamin Klatt and Franz Brosch and Zoya Durdik and Christoph Rathfelder},\nbooktitle = {5th Workshop on Non-Functional Properties and SLA Management in Service-Oriented Computing (NFPSLAM-SOC 2011)},\nday = {5--8},\nlocation = {Paphos, Cyprus},\nmonth = {December},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/261.pdf},\ntitle = {{Quality Prediction in Service Composition Frameworks}},\nyear = {2011}\n}\n
\n
\nWith the introduction of services, software systems have become more flexible as new services can easily be composed from existing ones. Service composition frameworks offer corresponding functionality and hide the complexity of the underlying technologies from their users. However, possibilities for anticipating quality properties of com- posed services before their actual operation are limited so far. While existing approaches for model-based software quality prediction can be used by service composers for determining realizable Quality of Service (QoS) levels, integration of such techniques into composition frameworks is still missing. As a result, high effort and expert knowledge is required to build the system models required for prediction. In this paper, we present a novel service composition process that includes QoS prediction for composed services as an integral part. Furthermore, we describe how composition frameworks can be extended to support this process. With our approach, systematic consideration of service quality during the composition process is naturally achieved, without the need for de- tailed knowledge about the underlying prediction models. To evaluate our work and validate its applicability in different domains, we have integrated QoS prediction support according to our process in two com- position frameworks - a large-scale SLA management framework and a service mashup platform.\n
\n','
\n@inproceedings{klatt2011a,\n  abstract = {With the introduction of services, software systems have become more flexible as new services can easily be composed from existing ones. Service composition frameworks offer corresponding functionality and hide the complexity of the underlying technologies from their users. However, possibilities for anticipating quality properties of com- posed services before their actual operation are limited so far. While existing approaches for model-based software quality prediction can be used by service composers for determining realizable Quality of Service (QoS) levels, integration of such techniques into composition frameworks is still missing. As a result, high effort and expert knowledge is required to build the system models required for prediction. In this paper, we present a novel service composition process that includes QoS prediction for composed services as an integral part. Furthermore, we describe how composition frameworks can be extended to support this process. With our approach, systematic consideration of service quality during the composition process is naturally achieved, without the need for de- tailed knowledge about the underlying prediction models. To evaluate our work and validate its applicability in different domains, we have integrated QoS prediction support according to our process in two com- position frameworks -- a large-scale SLA management framework and a service mashup platform.},\n  author = {Benjamin Klatt and Franz Brosch and Zoya Durdik and Christoph Rathfelder},\n  booktitle = {5th Workshop on Non-Functional Properties and SLA Management in Service-Oriented Computing (NFPSLAM-SOC 2011)},\n  day = {5--8},\n  location = {Paphos, Cyprus},\n  month = {December},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/261.pdf},\n  title = {{Quality Prediction in Service Composition Frameworks}},\n  year = {2011}\n}\n
\n\n','With the introduction of services, software systems have become more flexible as new services can easily be composed from existing ones. Service composition frameworks offer corresponding functionality and hide the complexity of the underlying technologies from their users. However, possibilities for anticipating quality properties of com- posed services before their actual operation are limited so far. While existing approaches for model-based software quality prediction can be used by service composers for determining realizable Quality of Service (QoS) levels, integration of such techniques into composition frameworks is still missing. As a result, high effort and expert knowledge is required to build the system models required for prediction. In this paper, we present a novel service composition process that includes QoS prediction for composed services as an integral part. Furthermore, we describe how composition frameworks can be extended to support this process. With our approach, systematic consideration of service quality during the composition process is naturally achieved, without the need for de- tailed knowledge about the underlying prediction models. To evaluate our work and validate its applicability in different domains, we have integrated QoS prediction support according to our process in two com- position frameworks -- a large-scale SLA management framework and a service mashup platform.','{Quality Prediction in Service Composition Frameworks}',0,12,2011,12,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(273,'paper','KlRaKo2011-QoSA-PCMEvents','inproceedings','@inproceedings{KlRaKo2011-QoSA-PCMEvents,\n abstract = {Today, software engineering is challenged to handle more and more large-scale distributed systems with guaranteed quality-of-service. Component-based architectures have been established to build such systems in a more structured and manageable way. Modern architectures often utilize event-based communication which enables loosely-coupled interactions between components and leads to improved system scalability. However, the loose coupling of components makes it challenging to model such architectures in order to predict their quality properties, e.g., performance and reliability, at system design time. In this paper, we present an extension of the Palladio Component Model (PCM) and the Palladio software quality prediction framework, enabling the modeling of event-based communication in component-based architectures. The contributions include: i) a meta-model extension supporting events as first class entities, ii) a model-to-model transformation from the extended to the original PCM, iii) an integration of the transformation into the Palladio tool chain allowing to use existing model solution techniques, and iv) a detailed evaluation of the reduction of the modeling effort enabled by the transformation in the context of a real-world case study.},\n address = {New York, NY, USA},\n author = {Klatt, Benjamin and Rathfelder, Christoph and Kounev, Samuel},\n booktitle = {Proceedings of the joint ACM SIGSOFT conference -- QoSA and ACM SIGSOFT symposium -- ISARCS on Quality of software architectures -- QoSA and architecting critical systems -- ISARCS (QoSA-ISARCS 2011)},\n day = {20--24},\n doi = {http://doi.acm.org/10.1145/2000259.2000268},\n isbn = {978-1-4503-0724-6},\n keywords = {component-based architectures, event-based communication, performance prediction},\n location = {Boulder, Colorado, USA},\n month = {June},\n numpages = {10},\n organization = {SIGSOFT},\n pages = {43--52},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/273.pdf},\n publisher = {ACM},\n title = {Integration of event-based communication in the palladio software quality prediction framework},\n url = {http://doi.acm.org/10.1145/2000259.2000268},\n year = {2011},\n}\n\n','\n\nBenjamin Klatt, Christoph Rathfelder, and Samuel Kounev.\nIntegration of event-based communication in the palladio software\nquality prediction framework.\nIn Proceedings of the joint ACM SIGSOFT conference - QoSA and\nACM SIGSOFT symposium - ISARCS on Quality of software architectures - QoSA\nand architecting critical systems - ISARCS (QoSA-ISARCS 2011), Boulder,\nColorado, USA, June 20-24, 2011, pages 43-52. SIGSOFT, ACM, New York, NY,\nUSA.\nJune 2011.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{KlRaKo2011-QoSA-PCMEvents,\nabstract = {Today, software engineering is challenged to handle more and more large-scale distributed systems with guaranteed quality-of-service. Component-based architectures have been established to build such systems in a more structured and manageable way. Modern architectures often utilize event-based communication which enables loosely-coupled interactions between components and leads to improved system scalability. However, the loose coupling of components makes it challenging to model such architectures in order to predict their quality properties, e.g., performance and reliability, at system design time. In this paper, we present an extension of the Palladio Component Model (PCM) and the Palladio software quality prediction framework, enabling the modeling of event-based communication in component-based architectures. The contributions include: i) a meta-model extension supporting events as first class entities, ii) a model-to-model transformation from the extended to the original PCM, iii) an integration of the transformation into the Palladio tool chain allowing to use existing model solution techniques, and iv) a detailed evaluation of the reduction of the modeling effort enabled by the transformation in the context of a real-world case study.},\naddress = {New York, NY, USA},\nauthor = {Klatt, Benjamin and Rathfelder, Christoph and Kounev, Samuel},\nbooktitle = {Proceedings of the joint ACM SIGSOFT conference -- QoSA and ACM SIGSOFT symposium -- ISARCS on Quality of software architectures -- QoSA and architecting critical systems -- ISARCS (QoSA-ISARCS 2011)},\nday = {20--24},\ndoi = {http://doi.acm.org/10.1145/2000259.2000268},\nisbn = {978-1-4503-0724-6},\nkeywords = {component-based architectures, event-based communication, performance prediction},\nlocation = {Boulder, Colorado, USA},\nmonth = {June},\nnumpages = {10},\norganization = {SIGSOFT},\npages = {43--52},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/273.pdf},\npublisher = {ACM},\ntitle = {Integration of event-based communication in the palladio software quality prediction framework},\nurl = {http://doi.acm.org/10.1145/2000259.2000268},\nyear = {2011}\n}\n
\n
\nToday, software engineering is challenged to handle more and more large-scale distributed systems with guaranteed quality-of-service. Component-based architectures have been established to build such systems in a more structured and manageable way. Modern architectures often utilize event-based communication which enables loosely-coupled interactions between components and leads to improved system scalability. However, the loose coupling of components makes it challenging to model such architectures in order to predict their quality properties, e.g., performance and reliability, at system design time. In this paper, we present an extension of the Palladio Component Model (PCM) and the Palladio software quality prediction framework, enabling the modeling of event-based communication in component-based architectures. The contributions include: i) a meta-model extension supporting events as first class entities, ii) a model-to-model transformation from the extended to the original PCM, iii) an integration of the transformation into the Palladio tool chain allowing to use existing model solution techniques, and iv) a detailed evaluation of the reduction of the modeling effort enabled by the transformation in the context of a real-world case study.\n
\n','
\n@inproceedings{KlRaKo2011-QoSA-PCMEvents,\n  abstract = {Today, software engineering is challenged to handle more and more large-scale distributed systems with guaranteed quality-of-service. Component-based architectures have been established to build such systems in a more structured and manageable way. Modern architectures often utilize event-based communication which enables loosely-coupled interactions between components and leads to improved system scalability. However, the loose coupling of components makes it challenging to model such architectures in order to predict their quality properties, e.g., performance and reliability, at system design time. In this paper, we present an extension of the Palladio Component Model (PCM) and the Palladio software quality prediction framework, enabling the modeling of event-based communication in component-based architectures. The contributions include: i) a meta-model extension supporting events as first class entities, ii) a model-to-model transformation from the extended to the original PCM, iii) an integration of the transformation into the Palladio tool chain allowing to use existing model solution techniques, and iv) a detailed evaluation of the reduction of the modeling effort enabled by the transformation in the context of a real-world case study.},\n  address = {New York, NY, USA},\n  author = {Klatt, Benjamin and Rathfelder, Christoph and Kounev, Samuel},\n  booktitle = {Proceedings of the joint ACM SIGSOFT conference -- QoSA and ACM SIGSOFT symposium -- ISARCS on Quality of software architectures -- QoSA and architecting critical systems -- ISARCS (QoSA-ISARCS 2011)},\n  day = {20--24},\n  doi = {http://doi.acm.org/10.1145/2000259.2000268},\n  isbn = {978-1-4503-0724-6},\n  keywords = {component-based architectures, event-based communication, performance prediction},\n  location = {Boulder, Colorado, USA},\n  month = {June},\n  numpages = {10},\n  organization = {SIGSOFT},\n  pages = {43--52},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/273.pdf},\n  publisher = {ACM},\n  title = {Integration of event-based communication in the palladio software quality prediction framework},\n  url = {http://doi.acm.org/10.1145/2000259.2000268},\n  year = {2011}\n}\n
\n\n','Today, software engineering is challenged to handle more and more large-scale distributed systems with guaranteed quality-of-service. Component-based architectures have been established to build such systems in a more structured and manageable way. Modern architectures often utilize event-based communication which enables loosely-coupled interactions between components and leads to improved system scalability. However, the loose coupling of components makes it challenging to model such architectures in order to predict their quality properties, e.g., performance and reliability, at system design time. In this paper, we present an extension of the Palladio Component Model (PCM) and the Palladio software quality prediction framework, enabling the modeling of event-based communication in component-based architectures. The contributions include: i) a meta-model extension supporting events as first class entities, ii) a model-to-model transformation from the extended to the original PCM, iii) an integration of the transformation into the Palladio tool chain allowing to use existing model solution techniques, and iv) a detailed evaluation of the reduction of the modeling effort enabled by the transformation in the context of a real-world case study.','Integration of event-based communication in the palladio software quality prediction framework',0,6,2011,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(278,'paper','Ko2011-BMSD-PerfEngOfBis','inproceedings','@inproceedings{Ko2011-BMSD-PerfEngOfBis,\n author = {Samuel Kounev},\n booktitle = {International Symposium on Business Modeling and Software Design (BMSD 2011), Sofia, Bulgaria, July 27--28, 2011},\n isbn = {978-989-8425-68-3},\n month = {July},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/278.pdf},\n title = {{Performance Engineering of Business Information Systems - Filling the Gap between High-level Business Services and Low-level Performance Models}},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nPerformance Engineering of Business Information Systems - Filling\nthe Gap between High-level Business Services and Low-level Performance\nModels.\nIn International Symposium on Business Modeling and Software\nDesign (BMSD 2011), Sofia, Bulgaria, July 27-28, 2011, July 2011.\n[ bib | .pdf  ] 
\n@inproceedings{Ko2011-BMSD-PerfEngOfBis,\nauthor = {Samuel Kounev},\nbooktitle = {International Symposium on Business Modeling and Software Design (BMSD 2011), Sofia, Bulgaria, July 27--28, 2011},\nisbn = {978-989-8425-68-3},\nmonth = {July},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/278.pdf},\ntitle = {{Performance Engineering of Business Information Systems - Filling the Gap between High-level Business Services and Low-level Performance Models}},\nyear = {2011}\n}\n
\n
\n','
\n@inproceedings{Ko2011-BMSD-PerfEngOfBis,\n  author = {Samuel Kounev},\n  booktitle = {International Symposium on Business Modeling and Software Design (BMSD 2011), Sofia, Bulgaria, July 27--28, 2011},\n  isbn = {978-989-8425-68-3},\n  month = {July},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/278.pdf},\n  title = {{Performance Engineering of Business Information Systems - Filling the Gap between High-level Business Services and Low-level Performance Models}},\n  year = {2011}\n}\n
\n\n',NULL,'{Performance Engineering of Business Information Systems - Filling the Gap between High-level Business Services and Low-level Performance Models}',0,7,2011,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(279,'paper','Ko2011-EPEW-ResearchChallenges','inproceedings','@inproceedings{Ko2011-EPEW-ResearchChallenges,\n author = {Samuel Kounev},\n booktitle = {Proceedings of the 8th European Performance Engineering Workshop (EPEW\'11), Borrowdale, The English Lake District, October 12--13},\n note = {(Extended Abstract of Keynote Talk)},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/279.pdf},\n title = {{Engineering of Self-Aware IT Systems and Services: State-of-the-Art and Research Challenges}},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nEngineering of Self-Aware IT Systems and Services: State-of-the-Art\nand Research Challenges.\nIn Proceedings of the 8th European Performance Engineering\nWorkshop (EPEW\'11), Borrowdale, The English Lake District, October 12-13,\n2011.\n(Extended Abstract of Keynote Talk).\n[ bib | .pdf  ] 
\n@inproceedings{Ko2011-EPEW-ResearchChallenges,\nauthor = {Samuel Kounev},\nbooktitle = {Proceedings of the 8th European Performance Engineering Workshop (EPEW\'11), Borrowdale, The English Lake District, October 12--13},\nnote = {(Extended Abstract of Keynote Talk)},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/279.pdf},\ntitle = {{Engineering of Self-Aware IT Systems and Services: State-of-the-Art and Research Challenges}},\nyear = {2011}\n}\n
\n
\n','
\n@inproceedings{Ko2011-EPEW-ResearchChallenges,\n  author = {Samuel Kounev},\n  booktitle = {Proceedings of the 8th European Performance Engineering Workshop (EPEW\'11), Borrowdale, The English Lake District, October 12--13},\n  note = {(Extended Abstract of Keynote Talk)},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/279.pdf},\n  title = {{Engineering of Self-Aware IT Systems and Services: State-of-the-Art and Research Challenges}},\n  year = {2011}\n}\n
\n\n',NULL,'{Engineering of Self-Aware IT Systems and Services: State-of-the-Art and Research Challenges}',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(280,'paper','Ko2011-SE-DescartesResearch','inproceedings','@inproceedings{Ko2011-SE-DescartesResearch,\n address = {Karlsruhe, Germany},\n author = {Samuel Kounev},\n booktitle = {{GI Softwaretechnik-Trends, 31(4), November 2011, ISSN 0720-8928}},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/280.pdf},\n title = {{Self-Aware Software and Systems Engineering: A Vision and Research Roadmap}},\n url = {http://pi.informatik.uni-siegen.de/stt/31_4/index.html},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nSelf-Aware Software and Systems Engineering: A Vision and Research\nRoadmap.\nIn GI Softwaretechnik-Trends, 31(4), November 2011, ISSN\n0720-8928, 2011. Karlsruhe, Germany.\n[ bib | .html | .pdf  ] 
\n@inproceedings{Ko2011-SE-DescartesResearch,\naddress = {Karlsruhe, Germany},\nauthor = {Samuel Kounev},\nbooktitle = {{GI Softwaretechnik-Trends, 31(4), November 2011, ISSN 0720-8928}},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/280.pdf},\ntitle = {{Self-Aware Software and Systems Engineering: A Vision and Research Roadmap}},\nurl = {http://pi.informatik.uni-siegen.de/stt/31_4/index.html},\nyear = {2011}\n}\n
\n
\n','
\n@inproceedings{Ko2011-SE-DescartesResearch,\n  address = {Karlsruhe, Germany},\n  author = {Samuel Kounev},\n  booktitle = {{GI Softwaretechnik-Trends, 31(4), November 2011, ISSN 0720-8928}},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/280.pdf},\n  title = {{Self-Aware Software and Systems Engineering: A Vision and Research Roadmap}},\n  url = {http://pi.informatik.uni-siegen.de/stt/31_4/index.html},\n  year = {2011}\n}\n
\n\n',NULL,'{Self-Aware Software and Systems Engineering: A Vision and Research Roadmap}',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(281,'paper','Ko2010-KIT-Roadmap','incollection','@incollection{Ko2010-KIT-Roadmap,\n address = {Karlsruhe, Germany},\n author = {Samuel Kounev},\n booktitle = {{Emerging Research Directions in Computer Science. Contributions from the Young Informatics Faculty in Karlsruhe}},\n isbn = {978-3-86644-508-6},\n month = {July},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/281.pdf},\n publisher = {KIT Scientific Publishing},\n title = {{Engineering of Next Generation Self-Aware Software Systems: A Research Roadmap}},\n url = {http://uvka.ubka.uni-karlsruhe.de/shop/isbn/978-3-86644-508-6},\n year = {2010},\n}\n\n','\n\nSamuel Kounev.\nEngineering of Next Generation Self-Aware Software Systems: A\nResearch Roadmap.\nIn Emerging Research Directions in Computer Science.\nContributions from the Young Informatics Faculty in Karlsruhe. KIT\nScientific Publishing, Karlsruhe, Germany, July 2010.\n[ bib | http | .pdf  ] 
\n@incollection{Ko2010-KIT-Roadmap,\naddress = {Karlsruhe, Germany},\nauthor = {Samuel Kounev},\nbooktitle = {{Emerging Research Directions in Computer Science. Contributions from the Young Informatics Faculty in Karlsruhe}},\nisbn = {978-3-86644-508-6},\nmonth = {July},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/281.pdf},\npublisher = {KIT Scientific Publishing},\ntitle = {{Engineering of Next Generation Self-Aware Software Systems: A Research Roadmap}},\nurl = {http://uvka.ubka.uni-karlsruhe.de/shop/isbn/978-3-86644-508-6},\nyear = {2010}\n}\n
\n
\n','
\n@incollection{Ko2010-KIT-Roadmap,\n  address = {Karlsruhe, Germany},\n  author = {Samuel Kounev},\n  booktitle = {{Emerging Research Directions in Computer Science. Contributions from the Young Informatics Faculty in Karlsruhe}},\n  isbn = {978-3-86644-508-6},\n  month = {July},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/281.pdf},\n  publisher = {KIT Scientific Publishing},\n  title = {{Engineering of Next Generation Self-Aware Software Systems: A Research Roadmap}},\n  url = {http://uvka.ubka.uni-karlsruhe.de/shop/isbn/978-3-86644-508-6},\n  year = {2010}\n}\n
\n\n',NULL,'{Engineering of Next Generation Self-Aware Software Systems: A Research Roadmap}',0,7,2010,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(282,'paper','Ko2008-WILEY-SoftwarePerfEval','incollection','@incollection{Ko2008-WILEY-SoftwarePerfEval,\n abstract = {Modern software systems are expected to satisfy increasingly stringent requirements for performance and scalability. To avoid the pitfalls of inadequate quality of service, it is important to evaluate the expected performance and scalability characteristics of systems during all phases of their life cycle. At every stage, performance evaluation is carried out with a specific set of goals and constraints. In this article, we present an overview of the major methods and techniques for software performance evaluation. We start by considering the different types of workload models that are typically used in performance evaluation studies. We then discuss performance measurement techniques including platform benchmarking, application profiling and system load testing. Following this, we survey the most common methods and techniques for performance modeling of software systems. We consider the major types of performance models used in practice and discuss their advantages and disadvantages. Finally, we briefly discuss operational analysis as an alternative to queueing theoretic methods.},\n author = {Samuel Kounev},\n title = {{Software Performance Evaluation}},\n isbn = {0471383937},\n isbn-13 = {978-0471383932},\n month = {January},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/282.pdf},\n publisher = {Wiley-Interscience, John Wiley & Sons Inc.},\n booktitle = {{Wiley Encyclopedia of Computer Science and Engineering, edited by Benjamin W. Wah}},\n url = {http://www.amazon.com/Wiley-Encyclopedia-Computer-Science-Engineering/dp/0471383937},\n year = {2009},\n}\n\n','\n\nSamuel Kounev.\nSoftware Performance Evaluation.\nIn Wiley Encyclopedia of Computer Science and Engineering,\nedited by Benjamin W. Wah. Wiley-Interscience, John Wiley & Sons Inc.,\nJanuary 2009.\n[ bib | http | .pdf | Abstract  ] 
\n@incollection{Ko2008-WILEY-SoftwarePerfEval,\nabstract = {Modern software systems are expected to satisfy increasingly stringent requirements for performance and scalability. To avoid the pitfalls of inadequate quality of service, it is important to evaluate the expected performance and scalability characteristics of systems during all phases of their life cycle. At every stage, performance evaluation is carried out with a specific set of goals and constraints. In this article, we present an overview of the major methods and techniques for software performance evaluation. We start by considering the different types of workload models that are typically used in performance evaluation studies. We then discuss performance measurement techniques including platform benchmarking, application profiling and system load testing. Following this, we survey the most common methods and techniques for performance modeling of software systems. We consider the major types of performance models used in practice and discuss their advantages and disadvantages. Finally, we briefly discuss operational analysis as an alternative to queueing theoretic methods.},\nauthor = {Samuel Kounev},\ntitle = {{Software Performance Evaluation}},\nisbn = {0471383937},\nisbn-13 = {978-0471383932},\nmonth = {January},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/282.pdf},\npublisher = {Wiley-Interscience, John Wiley & Sons Inc.},\nbooktitle = {{Wiley Encyclopedia of Computer Science and Engineering, edited by Benjamin W. Wah}},\nurl = {http://www.amazon.com/Wiley-Encyclopedia-Computer-Science-Engineering/dp/0471383937},\nyear = {2009}\n}\n
\n
\nModern software systems are expected to satisfy increasingly stringent requirements for performance and scalability. To avoid the pitfalls of inadequate quality of service, it is important to evaluate the expected performance and scalability characteristics of systems during all phases of their life cycle. At every stage, performance evaluation is carried out with a specific set of goals and constraints. In this article, we present an overview of the major methods and techniques for software performance evaluation. We start by considering the different types of workload models that are typically used in performance evaluation studies. We then discuss performance measurement techniques including platform benchmarking, application profiling and system load testing. Following this, we survey the most common methods and techniques for performance modeling of software systems. We consider the major types of performance models used in practice and discuss their advantages and disadvantages. Finally, we briefly discuss operational analysis as an alternative to queueing theoretic methods.\n
\n','
\n@incollection{Ko2008-WILEY-SoftwarePerfEval,\n  abstract = {Modern software systems are expected to satisfy increasingly stringent requirements for performance and scalability. To avoid the pitfalls of inadequate quality of service, it is important to evaluate the expected performance and scalability characteristics of systems during all phases of their life cycle. At every stage, performance evaluation is carried out with a specific set of goals and constraints. In this article, we present an overview of the major methods and techniques for software performance evaluation. We start by considering the different types of workload models that are typically used in performance evaluation studies. We then discuss performance measurement techniques including platform benchmarking, application profiling and system load testing. Following this, we survey the most common methods and techniques for performance modeling of software systems. We consider the major types of performance models used in practice and discuss their advantages and disadvantages. Finally, we briefly discuss operational analysis as an alternative to queueing theoretic methods.},\n  author = {Samuel Kounev},\n  title = {{Software Performance Evaluation}},\n  isbn = {0471383937},\n  isbn-13 = {978-0471383932},\n  month = {January},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/282.pdf},\n  publisher = {Wiley-Interscience, John Wiley & Sons Inc.},\n  booktitle = {{Wiley Encyclopedia of Computer Science and Engineering, edited by Benjamin W. Wah}},\n  url = {http://www.amazon.com/Wiley-Encyclopedia-Computer-Science-Engineering/dp/0471383937},\n  year = {2009}\n}\n
\n\n','Modern software systems are expected to satisfy increasingly stringent requirements for performance and scalability. To avoid the pitfalls of inadequate quality of service, it is important to evaluate the expected performance and scalability characteristics of systems during all phases of their life cycle. At every stage, performance evaluation is carried out with a specific set of goals and constraints. In this article, we present an overview of the major methods and techniques for software performance evaluation. We start by considering the different types of workload models that are typically used in performance evaluation studies. We then discuss performance measurement techniques including platform benchmarking, application profiling and system load testing. Following this, we survey the most common methods and techniques for performance modeling of software systems. We consider the major types of performance models used in practice and discuss their advantages and disadvantages. Finally, we briefly discuss operational analysis as an alternative to queueing theoretic methods.','{Software Performance Evaluation}',0,1,2009,1,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(283,'paper','kounev2008a','misc','@misc{kounev2008a,\n author = {Samuel Kounev},\n howpublished = {{Online, \\url{http://descartes.ipd.kit.edu/projects/QPME}}},\n title = {{QPME (Queueing Petri net Modeling Environment) Homepage}},\n url = {http://descartes.ipd.kit.edu/projects/QPME},\n year = {2008},\n}\n\n','\n\nSamuel Kounev.\nQPME (Queueing Petri net Modeling Environment) Homepage.\nOnline, http://descartes.ipd.kit.edu/projects/QPME, 2008.\n[ bib | http  ] 
\n@misc{kounev2008a,\nauthor = {Samuel Kounev},\nhowpublished = {{Online, \\url{http://descartes.ipd.kit.edu/projects/QPME}}},\ntitle = {{QPME (Queueing Petri net Modeling Environment) Homepage}},\nurl = {http://descartes.ipd.kit.edu/projects/QPME},\nyear = {2008}\n}\n
\n
\n','
\n@misc{kounev2008a,\n  author = {Samuel Kounev},\n  howpublished = {{Online, \\url{http://descartes.ipd.kit.edu/projects/QPME}}},\n  title = {{QPME (Queueing Petri net Modeling Environment) Homepage}},\n  url = {http://descartes.ipd.kit.edu/projects/QPME},\n  year = {2008}\n}\n
\n\n',NULL,'{QPME (Queueing Petri net Modeling Environment) Homepage}',0,0,2008,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(284,'paper','Ko2006-IEEE_TSE-QPN_ModelingMethod','article','@article{Ko2006-IEEE_TSE-QPN_ModelingMethod,\n title = {{Performance Modeling and Evaluation of Distributed Component-Based Systems using Queueing Petri Nets}},\n journal = {IEEE Transactions on Software Engineering},\n year = {2006},\n month = {July},\n volume = {32},\n number = {7},\n pages = {486--502},\n abstract = {Performance models are used increasingly throughout the phases of the software engineering lifecycle of distributed component-based systems. However, as systems grow in size and complexity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. In this paper, we present a novel case study of a realistic distributed component-based system, showing how Queueing Petri Net models can be exploited as a powerful performance prediction tool in the software engineering process. A detailed system model is built in a step-by-step fashion, validated, and then used to evaluate the system performance and scalability. Along with the case study, a practical performance modeling methodology is presented which helps to construct models that accurately reflect the system performance and scalability characteristics. Taking advantage of the modeling power and expressiveness of Queueing Petri Nets, our approach makes it possible to model the system at a higher degree of accuracy, providing a number of important benefits.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/284.pdf},\n doi = {10.1109/TSE.2006.69},\n author = {Kounev, Samuel},\n}\n\n','\n\nSamuel Kounev.\nPerformance Modeling and Evaluation of Distributed Component-Based\nSystems using Queueing Petri Nets.\nIEEE Transactions on Software Engineering, 32(7):486-502, July\n2006.\n[ bib | DOI | .pdf | Abstract  ] 
\n@article{Ko2006-IEEE_TSE-QPN_ModelingMethod,\ntitle = {{Performance Modeling and Evaluation of Distributed Component-Based Systems using Queueing Petri Nets}},\njournal = {IEEE Transactions on Software Engineering},\nyear = {2006},\nmonth = {July},\nvolume = {32},\nnumber = {7},\npages = {486--502},\nabstract = {Performance models are used increasingly throughout the phases of the software engineering lifecycle of distributed component-based systems. However, as systems grow in size and complexity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. In this paper, we present a novel case study of a realistic distributed component-based system, showing how Queueing Petri Net models can be exploited as a powerful performance prediction tool in the software engineering process. A detailed system model is built in a step-by-step fashion, validated, and then used to evaluate the system performance and scalability. Along with the case study, a practical performance modeling methodology is presented which helps to construct models that accurately reflect the system performance and scalability characteristics. Taking advantage of the modeling power and expressiveness of Queueing Petri Nets, our approach makes it possible to model the system at a higher degree of accuracy, providing a number of important benefits.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/284.pdf},\ndoi = {10.1109/TSE.2006.69},\nauthor = {Kounev, Samuel}\n}\n
\n
\nPerformance models are used increasingly throughout the phases of the software engineering lifecycle of distributed component-based systems. However, as systems grow in size and complexity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. In this paper, we present a novel case study of a realistic distributed component-based system, showing how Queueing Petri Net models can be exploited as a powerful performance prediction tool in the software engineering process. A detailed system model is built in a step-by-step fashion, validated, and then used to evaluate the system performance and scalability. Along with the case study, a practical performance modeling methodology is presented which helps to construct models that accurately reflect the system performance and scalability characteristics. Taking advantage of the modeling power and expressiveness of Queueing Petri Nets, our approach makes it possible to model the system at a higher degree of accuracy, providing a number of important benefits.\n
\n','
\n@article{Ko2006-IEEE_TSE-QPN_ModelingMethod,\n  title = {{Performance Modeling and Evaluation of Distributed Component-Based Systems using Queueing Petri Nets}},\n  journal = {IEEE Transactions on Software Engineering},\n  year = {2006},\n  month = {July},\n  volume = {32},\n  number = {7},\n  pages = {486--502},\n  abstract = {Performance models are used increasingly throughout the phases of the software engineering lifecycle of distributed component-based systems. However, as systems grow in size and complexity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. In this paper, we present a novel case study of a realistic distributed component-based system, showing how Queueing Petri Net models can be exploited as a powerful performance prediction tool in the software engineering process. A detailed system model is built in a step-by-step fashion, validated, and then used to evaluate the system performance and scalability. Along with the case study, a practical performance modeling methodology is presented which helps to construct models that accurately reflect the system performance and scalability characteristics. Taking advantage of the modeling power and expressiveness of Queueing Petri Nets, our approach makes it possible to model the system at a higher degree of accuracy, providing a number of important benefits.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/284.pdf},\n  doi = {10.1109/TSE.2006.69},\n  author = {Kounev, Samuel}\n}\n
\n\n','Performance models are used increasingly throughout the phases of the software engineering lifecycle of distributed component-based systems. However, as systems grow in size and complexity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. In this paper, we present a novel case study of a realistic distributed component-based system, showing how Queueing Petri Net models can be exploited as a powerful performance prediction tool in the software engineering process. A detailed system model is built in a step-by-step fashion, validated, and then used to evaluate the system performance and scalability. Along with the case study, a practical performance modeling methodology is presented which helps to construct models that accurately reflect the system performance and scalability characteristics. Taking advantage of the modeling power and expressiveness of Queueing Petri Nets, our approach makes it possible to model the system at a higher degree of accuracy, providing a number of important benefits.','{Performance Modeling and Evaluation of Distributed Component-Based Systems using Queueing Petri Nets}',0,7,2006,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(285,'paper','Ko2006-SPEC_BW-J2EEPerfScal','inproceedings','@inproceedings{Ko2006-SPEC_BW-J2EEPerfScal,\n title = {{J2EE Performance and Scalability - From Measuring to Predicting}},\n year = {2006},\n month = {January},\n abstract = {J2EE applications are becoming increasingly ubiquitous and with their increasing adoption, performance and scalability issues are gaining in importance. For a J2EE application to perform well and be scalable, both the platform on which it is built and the application design must be efficient and scalable. Industry-standard benchmarks such as the SPECjAppServer set of benchmarks help to evaluate the performance and scalability of alternative platforms for J2EE applications, however, they cannot be used to evaluate the performance and scalability of concrete applications built on the selected platforms. In this paper, we present a systematic approach for evaluating and predicting the performance and scalability of J2EE applications based on modeling and simulation. The approach helps to identify and eliminate bottlenecks in the application design and ensure that systems are designed and sized to meet their quality of service requirements. We introduce our approach by showing how it can be applied to the SPECjAppServer2004 benchmark which is used as a representative J2EE application. A detailed model of a SPECjAppServer2004 deployment is built in a step-by-step fashion and then used to predict the behavior of the system under load. The approach is validated by comparing model predictions against measurements on the real system.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/285.pdf},\n booktitle = {Proceedings of the 2006 SPEC Benchmark Workshop, Austin, Texas, USA},\n author = {Kounev, Samuel},\n}\n\n','\n\nSamuel Kounev.\nJ2EE Performance and Scalability - From Measuring to Predicting.\nIn Proceedings of the 2006 SPEC Benchmark Workshop, Austin,\nTexas, USA, January 2006.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{Ko2006-SPEC_BW-J2EEPerfScal,\ntitle = {{J2EE Performance and Scalability - From Measuring to Predicting}},\nyear = {2006},\nmonth = {January},\nabstract = {J2EE applications are becoming increasingly ubiquitous and with their increasing adoption, performance and scalability issues are gaining in importance. For a J2EE application to perform well and be scalable, both the platform on which it is built and the application design must be efficient and scalable. Industry-standard benchmarks such as the SPECjAppServer set of benchmarks help to evaluate the performance and scalability of alternative platforms for J2EE applications, however, they cannot be used to evaluate the performance and scalability of concrete applications built on the selected platforms. In this paper, we present a systematic approach for evaluating and predicting the performance and scalability of J2EE applications based on modeling and simulation. The approach helps to identify and eliminate bottlenecks in the application design and ensure that systems are designed and sized to meet their quality of service requirements. We introduce our approach by showing how it can be applied to the SPECjAppServer2004 benchmark which is used as a representative J2EE application. A detailed model of a SPECjAppServer2004 deployment is built in a step-by-step fashion and then used to predict the behavior of the system under load. The approach is validated by comparing model predictions against measurements on the real system.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/285.pdf},\nbooktitle = {Proceedings of the 2006 SPEC Benchmark Workshop, Austin, Texas, USA},\nauthor = {Kounev, Samuel}\n}\n
\n
\nJ2EE applications are becoming increasingly ubiquitous and with their increasing adoption, performance and scalability issues are gaining in importance. For a J2EE application to perform well and be scalable, both the platform on which it is built and the application design must be efficient and scalable. Industry-standard benchmarks such as the SPECjAppServer set of benchmarks help to evaluate the performance and scalability of alternative platforms for J2EE applications, however, they cannot be used to evaluate the performance and scalability of concrete applications built on the selected platforms. In this paper, we present a systematic approach for evaluating and predicting the performance and scalability of J2EE applications based on modeling and simulation. The approach helps to identify and eliminate bottlenecks in the application design and ensure that systems are designed and sized to meet their quality of service requirements. We introduce our approach by showing how it can be applied to the SPECjAppServer2004 benchmark which is used as a representative J2EE application. A detailed model of a SPECjAppServer2004 deployment is built in a step-by-step fashion and then used to predict the behavior of the system under load. The approach is validated by comparing model predictions against measurements on the real system.\n
\n','
\n@inproceedings{Ko2006-SPEC_BW-J2EEPerfScal,\n  title = {{J2EE Performance and Scalability - From Measuring to Predicting}},\n  year = {2006},\n  month = {January},\n  abstract = {J2EE applications are becoming increasingly ubiquitous and with their increasing adoption, performance and scalability issues are gaining in importance. For a J2EE application to perform well and be scalable, both the platform on which it is built and the application design must be efficient and scalable. Industry-standard benchmarks such as the SPECjAppServer set of benchmarks help to evaluate the performance and scalability of alternative platforms for J2EE applications, however, they cannot be used to evaluate the performance and scalability of concrete applications built on the selected platforms. In this paper, we present a systematic approach for evaluating and predicting the performance and scalability of J2EE applications based on modeling and simulation. The approach helps to identify and eliminate bottlenecks in the application design and ensure that systems are designed and sized to meet their quality of service requirements. We introduce our approach by showing how it can be applied to the SPECjAppServer2004 benchmark which is used as a representative J2EE application. A detailed model of a SPECjAppServer2004 deployment is built in a step-by-step fashion and then used to predict the behavior of the system under load. The approach is validated by comparing model predictions against measurements on the real system.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/285.pdf},\n  booktitle = {Proceedings of the 2006 SPEC Benchmark Workshop, Austin, Texas, USA},\n  author = {Kounev, Samuel}\n}\n
\n\n','J2EE applications are becoming increasingly ubiquitous and with their increasing adoption, performance and scalability issues are gaining in importance. For a J2EE application to perform well and be scalable, both the platform on which it is built and the application design must be efficient and scalable. Industry-standard benchmarks such as the SPECjAppServer set of benchmarks help to evaluate the performance and scalability of alternative platforms for J2EE applications, however, they cannot be used to evaluate the performance and scalability of concrete applications built on the selected platforms. In this paper, we present a systematic approach for evaluating and predicting the performance and scalability of J2EE applications based on modeling and simulation. The approach helps to identify and eliminate bottlenecks in the application design and ensure that systems are designed and sized to meet their quality of service requirements. We introduce our approach by showing how it can be applied to the SPECjAppServer2004 benchmark which is used as a representative J2EE application. A detailed model of a SPECjAppServer2004 deployment is built in a step-by-step fashion and then used to predict the behavior of the system under load. The approach is validated by comparing model predictions against measurements on the real system.','{J2EE Performance and Scalability - From Measuring to Predicting}',0,1,2006,1,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(286,'paper','KoBu2006-WileyInterscience-QN_CaseStudy_J2EE','incollection','@incollection{KoBu2006-WileyInterscience-QN_CaseStudy_J2EE,\n author = {Samuel Kounev},\n title = {{Case Studies of Queueing Networks --- J2EE Applications}},\n edition = {2nd},\n isbn = {0471565253},\n month = {April},\n pages = {733--745},\n publisher = {Wiley-Interscience, John Wiley & Sons Inc.},\n booktitle = {{Queueing Networks and Markov Chains, edited by Gunter Bolch, Stefan Greiner, Hermann de Meer and Kishor Shridharbhai Trivedi}},\n url = {http://www.amazon.com/exec/obidos/tg/detail/-/0471565253/qid=1116860412/sr=1-3/ref=sr_1_3/103-1432544-4046230?v=glance&s=books},\n year = {2006},\n}\n\n','\n\nSamuel Kounev.\nCase Studies of Queueing Networks - J2EE Applications.\nIn Queueing Networks and Markov Chains, edited by Gunter Bolch,\nStefan Greiner, Hermann de Meer and Kishor Shridharbhai Trivedi, pages\n733-745. Wiley-Interscience, John Wiley & Sons Inc., 2nd edition, April\n2006.\n[ bib | http  ] 
\n@incollection{KoBu2006-WileyInterscience-QN_CaseStudy_J2EE,\nauthor = {Samuel Kounev},\ntitle = {{Case Studies of Queueing Networks --- J2EE Applications}},\nedition = {2nd},\nisbn = {0471565253},\nmonth = {April},\npages = {733--745},\npublisher = {Wiley-Interscience, John Wiley & Sons Inc.},\nbooktitle = {{Queueing Networks and Markov Chains, edited by Gunter Bolch, Stefan Greiner, Hermann de Meer and Kishor Shridharbhai Trivedi}},\nurl = {http://www.amazon.com/exec/obidos/tg/detail/-/0471565253/qid=1116860412/sr=1-3/ref=sr_1_3/103-1432544-4046230?v=glance&s=books},\nyear = {2006}\n}\n
\n
\n','
\n@incollection{KoBu2006-WileyInterscience-QN_CaseStudy_J2EE,\n  author = {Samuel Kounev},\n  title = {{Case Studies of Queueing Networks --- J2EE Applications}},\n  edition = {2nd},\n  isbn = {0471565253},\n  month = {April},\n  pages = {733--745},\n  publisher = {Wiley-Interscience, John Wiley & Sons Inc.},\n  booktitle = {{Queueing Networks and Markov Chains, edited by Gunter Bolch, Stefan Greiner, Hermann de Meer and Kishor Shridharbhai Trivedi}},\n  url = {http://www.amazon.com/exec/obidos/tg/detail/-/0471565253/qid=1116860412/sr=1-3/ref=sr_1_3/103-1432544-4046230?v=glance&s=books},\n  year = {2006}\n}\n
\n\n',NULL,'{Case Studies of Queueing Networks --- J2EE Applications}',0,4,2006,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(287,'paper','Ko2005-DEV2DEV-SPECjAppServer2004','misc','@misc{Ko2005-DEV2DEV-SPECjAppServer2004,\n abstract = {This article presents SPECjAppServer2004---the new industry-standard benchmark for measuring the performance and scalability of J2EE hardware and software platforms. SPECjAppServer2004 is a completely new benchmark and not comparable to the SPEC J2EE benchmarks released in late 2002. This article discusses the business domains and workload modeled by the benchmark, as well as the benchmark design and architecture. The author also explains the meaning of the benchmark metrics, discusses the different purposes the benchmark can be used, and provides some links to additional information.},\n author = {Samuel Kounev},\n howpublished = {DEV2DEV Article, O\'Reilly Publishing Group},\n month = {September},\n title = {{SPECjAppServer2004 - The New Way to Evaluate J2EE Performance}},\n url = {http://www.oracle.com/technology/pub/articles/dev2arch/2005/03/specjappserver2004.html},\n year = {2005},\n}\n\n','\n\nSamuel Kounev.\nSPECjAppServer2004 - The New Way to Evaluate J2EE Performance.\nDEV2DEV Article, O\'Reilly Publishing Group, September 2005.\n[ bib | .html | Abstract  ] 
\n@misc{Ko2005-DEV2DEV-SPECjAppServer2004,\nabstract = {This article presents SPECjAppServer2004---the new industry-standard benchmark for measuring the performance and scalability of J2EE hardware and software platforms. SPECjAppServer2004 is a completely new benchmark and not comparable to the SPEC J2EE benchmarks released in late 2002. This article discusses the business domains and workload modeled by the benchmark, as well as the benchmark design and architecture. The author also explains the meaning of the benchmark metrics, discusses the different purposes the benchmark can be used, and provides some links to additional information.},\nauthor = {Samuel Kounev},\nhowpublished = {DEV2DEV Article, O\'Reilly Publishing Group},\nmonth = {September},\ntitle = {{SPECjAppServer2004 - The New Way to Evaluate J2EE Performance}},\nurl = {http://www.oracle.com/technology/pub/articles/dev2arch/2005/03/specjappserver2004.html},\nyear = {2005}\n}\n
\n
\nThis article presents SPECjAppServer2004-the new industry-standard benchmark for measuring the performance and scalability of J2EE hardware and software platforms. SPECjAppServer2004 is a completely new benchmark and not comparable to the SPEC J2EE benchmarks released in late 2002. This article discusses the business domains and workload modeled by the benchmark, as well as the benchmark design and architecture. The author also explains the meaning of the benchmark metrics, discusses the different purposes the benchmark can be used, and provides some links to additional information.\n
\n','
\n@misc{Ko2005-DEV2DEV-SPECjAppServer2004,\n  abstract = {This article presents SPECjAppServer2004---the new industry-standard benchmark for measuring the performance and scalability of J2EE hardware and software platforms. SPECjAppServer2004 is a completely new benchmark and not comparable to the SPEC J2EE benchmarks released in late 2002. This article discusses the business domains and workload modeled by the benchmark, as well as the benchmark design and architecture. The author also explains the meaning of the benchmark metrics, discusses the different purposes the benchmark can be used, and provides some links to additional information.},\n  author = {Samuel Kounev},\n  howpublished = {DEV2DEV Article, O\'Reilly Publishing Group},\n  month = {September},\n  title = {{SPECjAppServer2004 - The New Way to Evaluate J2EE Performance}},\n  url = {http://www.oracle.com/technology/pub/articles/dev2arch/2005/03/specjappserver2004.html},\n  year = {2005}\n}\n
\n\n','This article presents SPECjAppServer2004---the new industry-standard benchmark for measuring the performance and scalability of J2EE hardware and software platforms. SPECjAppServer2004 is a completely new benchmark and not comparable to the SPEC J2EE benchmarks released in late 2002. This article discusses the business domains and workload modeled by the benchmark, as well as the benchmark design and architecture. The author also explains the meaning of the benchmark metrics, discusses the different purposes the benchmark can be used, and provides some links to additional information.','{SPECjAppServer2004 - The New Way to Evaluate J2EE Performance}',0,9,2005,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(288,'paper','Ko2005-TUD-PhD_Thesis','book','@book{Ko2005-TUD-PhD_Thesis,\n title = {Performance Engineering of Distributed Component-Based Systems - Benchmarking, Modeling and Performance Prediction},\n year = {2005},\n month = {December},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/288.pdf},\n publisher = {Shaker Verlag, Ph.D. Thesis, Technische Universit{\\\"a}t Darmstadt, Germany},\n isbn = {3832247130},\n author = {Kounev, Samuel},\n note = {Distinguished Dissertation Award},\n}\n\n','\n\nSamuel Kounev.\nPerformance Engineering of Distributed Component-Based Systems -\nBenchmarking, Modeling and Performance Prediction.\nShaker Verlag, Ph.D. Thesis, Technische Universität Darmstadt,\nGermany, December 2005.\nDistinguished Dissertation Award.\n[ bib | .pdf  ] 
\n@book{Ko2005-TUD-PhD_Thesis,\ntitle = {Performance Engineering of Distributed Component-Based Systems - Benchmarking, Modeling and Performance Prediction},\nyear = {2005},\nmonth = {December},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/288.pdf},\npublisher = {Shaker Verlag, Ph.D. Thesis, Technische Universit{\\\"a}t Darmstadt, Germany},\nisbn = {3832247130},\nauthor = {Kounev, Samuel},\nnote = {Distinguished Dissertation Award}\n}\n
\n
\n','
\n@book{Ko2005-TUD-PhD_Thesis,\n  title = {Performance Engineering of Distributed Component-Based Systems - Benchmarking, Modeling and Performance Prediction},\n  year = {2005},\n  month = {December},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/288.pdf},\n  publisher = {Shaker Verlag, Ph.D. Thesis, Technische Universit{\\\"a}t Darmstadt, Germany},\n  isbn = {3832247130},\n  author = {Kounev, Samuel},\n  note = {Distinguished Dissertation Award}\n}\n
\n\n',NULL,'Performance Engineering of Distributed Component-Based Systems - Benchmarking, Modeling and Performance Prediction',0,12,2005,12,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(289,'paper','Ko2003-SPEC-SPECjAppServer','techreport','@techreport{Ko2003-SPEC-SPECjAppServer,\n author = {Samuel Kounev},\n institution = {SPEC OSG Java Subcommittee},\n month = {September},\n number = {TUD03-1},\n title = {{Messaging Architecture and Asynchronous Interactions in SPECjAppServer}},\n year = {2003},\n}\n\n','\n\nSamuel Kounev.\nMessaging Architecture and Asynchronous Interactions in\nSPECjAppServer.\nTechnical Report TUD03-1, SPEC OSG Java Subcommittee, September 2003.\n[ bib  ] 
\n@techreport{Ko2003-SPEC-SPECjAppServer,\nauthor = {Samuel Kounev},\ninstitution = {SPEC OSG Java Subcommittee},\nmonth = {September},\nnumber = {TUD03-1},\ntitle = {{Messaging Architecture and Asynchronous Interactions in SPECjAppServer}},\nyear = {2003}\n}\n
\n
\n','
\n@techreport{Ko2003-SPEC-SPECjAppServer,\n  author = {Samuel Kounev},\n  institution = {SPEC OSG Java Subcommittee},\n  month = {September},\n  number = {TUD03-1},\n  title = {{Messaging Architecture and Asynchronous Interactions in SPECjAppServer}},\n  year = {2003}\n}\n
\n\n',NULL,'{Messaging Architecture and Asynchronous Interactions in SPECjAppServer}',0,9,2003,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(290,'paper','Ko2001-SUN-ECperf','techreport','@techreport{Ko2001-SUN-ECperf,\n author = {Samuel Kounev},\n institution = {ECperf Expert Group at Sun Microsystems Inc.},\n month = {September},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/290.pdf},\n title = {{Eliminating ECperf Persistence Bottlenecks when using RDBMS with Pessimistic Concurrency Control}},\n year = {2001},\n}\n\n','\n\nSamuel Kounev.\nEliminating ECperf Persistence Bottlenecks when using RDBMS with\nPessimistic Concurrency Control.\nTechnical report, ECperf Expert Group at Sun Microsystems Inc.,\nSeptember 2001.\n[ bib | .pdf  ] 
\n@techreport{Ko2001-SUN-ECperf,\nauthor = {Samuel Kounev},\ninstitution = {ECperf Expert Group at Sun Microsystems Inc.},\nmonth = {September},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/290.pdf},\ntitle = {{Eliminating ECperf Persistence Bottlenecks when using RDBMS with Pessimistic Concurrency Control}},\nyear = {2001}\n}\n
\n
\n','
\n@techreport{Ko2001-SUN-ECperf,\n  author = {Samuel Kounev},\n  institution = {ECperf Expert Group at Sun Microsystems Inc.},\n  month = {September},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/290.pdf},\n  title = {{Eliminating ECperf Persistence Bottlenecks when using RDBMS with Pessimistic Concurrency Control}},\n  year = {2001}\n}\n
\n\n',NULL,'{Eliminating ECperf Persistence Bottlenecks when using RDBMS with Pessimistic Concurrency Control}',0,9,2001,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(291,'paper','Ko2001-TUD-CapPlanMethod','techreport','@techreport{Ko2001-TUD-CapPlanMethod,\n author = {Samuel Kounev},\n institution = {Technische Universit{\\\"{a}}t Darmstadt, Germany},\n month = {February},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/291.pdf},\n title = {{A Capacity Planning Methodology for Distributed E-Commerce Applications}},\n year = {2001},\n}\n\n','\n\nSamuel Kounev.\nA Capacity Planning Methodology for Distributed E-Commerce\nApplications.\nTechnical report, Technische Universität Darmstadt, Germany,\nFebruary 2001.\n[ bib | .pdf  ] 
\n@techreport{Ko2001-TUD-CapPlanMethod,\nauthor = {Samuel Kounev},\ninstitution = {Technische Universit{\\\"{a}}t Darmstadt, Germany},\nmonth = {February},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/291.pdf},\ntitle = {{A Capacity Planning Methodology for Distributed E-Commerce Applications}},\nyear = {2001}\n}\n
\n
\n','
\n@techreport{Ko2001-TUD-CapPlanMethod,\n  author = {Samuel Kounev},\n  institution = {Technische Universit{\\\"{a}}t Darmstadt, Germany},\n  month = {February},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/291.pdf},\n  title = {{A Capacity Planning Methodology for Distributed E-Commerce Applications}},\n  year = {2001}\n}\n
\n\n',NULL,'{A Capacity Planning Methodology for Distributed E-Commerce Applications}',0,2,2001,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(292,'paper','Ko2001-TUD-PerfPred','techreport','@techreport{Ko2001-TUD-PerfPred,\n author = {Samuel Kounev},\n institution = {Technische Universit{\\\"{a}}t Darmstadt, Germany},\n month = {January},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/292.pdf},\n title = {{Performance Prediction, Sizing and Capacity Planning for Distributed E-Commerce Applications}},\n year = {2001},\n}\n\n','\n\nSamuel Kounev.\nPerformance Prediction, Sizing and Capacity Planning for Distributed\nE-Commerce Applications.\nTechnical report, Technische Universität Darmstadt, Germany,\nJanuary 2001.\n[ bib | .pdf  ] 
\n@techreport{Ko2001-TUD-PerfPred,\nauthor = {Samuel Kounev},\ninstitution = {Technische Universit{\\\"{a}}t Darmstadt, Germany},\nmonth = {January},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/292.pdf},\ntitle = {{Performance Prediction, Sizing and Capacity Planning for Distributed E-Commerce Applications}},\nyear = {2001}\n}\n
\n
\n','
\n@techreport{Ko2001-TUD-PerfPred,\n  author = {Samuel Kounev},\n  institution = {Technische Universit{\\\"{a}}t Darmstadt, Germany},\n  month = {January},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/292.pdf},\n  title = {{Performance Prediction, Sizing and Capacity Planning for Distributed E-Commerce Applications}},\n  year = {2001}\n}\n
\n\n',NULL,'{Performance Prediction, Sizing and Capacity Planning for Distributed E-Commerce Applications}',0,1,2001,1,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(293,'paper','Ko1999-UNI_SOFIA-MSc_Thesis','mastersthesis','@mastersthesis{Ko1999-UNI_SOFIA-MSc_Thesis,\n address = {Sofia, Bulgaria},\n author = {Samuel Kounev},\n month = {August},\n school = {University of Sofia},\n title = {{Design and Development of an Electronic Commerce Environment}},\n year = {1999},\n}\n\n','\n\nSamuel Kounev.\nDesign and Development of an Electronic Commerce Environment.\nMaster\'s thesis, University of Sofia, Sofia, Bulgaria, August 1999.\n[ bib  ] 
\n@mastersthesis{Ko1999-UNI_SOFIA-MSc_Thesis,\naddress = {Sofia, Bulgaria},\nauthor = {Samuel Kounev},\nmonth = {August},\nschool = {University of Sofia},\ntitle = {{Design and Development of an Electronic Commerce Environment}},\nyear = {1999}\n}\n
\n
\n','
\n@mastersthesis{Ko1999-UNI_SOFIA-MSc_Thesis,\n  address = {Sofia, Bulgaria},\n  author = {Samuel Kounev},\n  month = {August},\n  school = {University of Sofia},\n  title = {{Design and Development of an Electronic Commerce Environment}},\n  year = {1999}\n}\n
\n\n',NULL,'{Design and Development of an Electronic Commerce Environment}',0,8,1999,8,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(294,'paper','KoBeBrHuOk2011-SIMUTools-DataFabrics','inproceedings','@inproceedings{KoBeBrHuOk2011-SIMUTools-DataFabrics,\n title = {Automated Simulation-Based Capacity Planning for Enterprise Data Fabrics},\n year = {2011},\n month = {March},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/294.pdf},\n booktitle = {4th International ICST Conference on Simulation Tools and Techniques (SIMUtools 2011), March 21--25, 2011, Barcelona, Spain},\n author = {Kounev, Samuel and Bender, Konstantin and Brosig, Fabian and Huber, Nikolaus and Okamoto, Russell},\n note = {Acceptance Rate (Full Paper): 29.8\\% (23/77), ICST Best Paper Award},\n}\n\n','\n\nSamuel Kounev, Konstantin Bender, Fabian Brosig, Nikolaus Huber, and Russell\nOkamoto.\nAutomated simulation-based capacity planning for enterprise data\nfabrics.\nIn 4th International ICST Conference on Simulation Tools and\nTechniques (SIMUtools 2011), March 21-25, 2011, Barcelona, Spain, March\n2011.\nAcceptance Rate (Full Paper): 29.8% (23/77), ICST Best Paper\nAward.\n[ bib | .pdf  ] 
\n@inproceedings{KoBeBrHuOk2011-SIMUTools-DataFabrics,\ntitle = {Automated Simulation-Based Capacity Planning for Enterprise Data Fabrics},\nyear = {2011},\nmonth = {March},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/294.pdf},\nbooktitle = {4th International ICST Conference on Simulation Tools and Techniques (SIMUtools 2011), March 21--25, 2011, Barcelona, Spain},\nauthor = {Kounev, Samuel and Bender, Konstantin and Brosig, Fabian and Huber, Nikolaus and Okamoto, Russell},\nnote = {Acceptance Rate (Full Paper): 29.8\\% (23/77), ICST Best Paper Award}\n}\n
\n
\n','
\n@inproceedings{KoBeBrHuOk2011-SIMUTools-DataFabrics,\n  title = {Automated Simulation-Based Capacity Planning for Enterprise Data Fabrics},\n  year = {2011},\n  month = {March},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/294.pdf},\n  booktitle = {4th International ICST Conference on Simulation Tools and Techniques (SIMUtools 2011), March 21--25, 2011, Barcelona, Spain},\n  author = {Kounev, Samuel and Bender, Konstantin and Brosig, Fabian and Huber, Nikolaus and Okamoto, Russell},\n  note = {Acceptance Rate (Full Paper): 29.8\\% (23/77), ICST Best Paper Award}\n}\n
\n\n',NULL,'Automated Simulation-Based Capacity Planning for Enterprise Data Fabrics',0,3,2011,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(295,'paper','KoBrHu2014-TechReport-DML','techreport','@techreport{KoBrHu2014-TechReport-DML,\n abstract = {{This technical report introduces the Descartes Modeling Language (DML), a new architecture-level modeling language for modeling Quality-of-Service (QoS) and resource management related aspects of modern dynamic IT systems, infrastructures and services. DML is designed to serve as a basis for self-aware resource management during operation ensuring that system QoS requirements are continuously satisfied while infrastructure resources are utilized as efficiently as possible.}},\n author = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\n institution = {{Department of Computer Science, University of Wuerzburg}},\n title = {{The Descartes Modeling Language}},\n url = {http://www.descartes-research.net/dml/},\n http = {http://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/10488},\n pdf = {http://opus.bibliothek.uni-wuerzburg.de/files/10488/DML-TechReport-1.0.pdf},\n year = {2014},\n numpages = {91},\n month = {October},\n}\n\n','\n\nSamuel Kounev, Fabian Brosig, and Nikolaus Huber.\nThe Descartes Modeling Language.\nTechnical report, Department of Computer Science, University of\nWuerzburg, October 2014.\n[ bib | http | http | .pdf | Abstract  ] 
\n@techreport{KoBrHu2014-TechReport-DML,\nabstract = {{This technical report introduces the Descartes Modeling Language (DML), a new architecture-level modeling language for modeling Quality-of-Service (QoS) and resource management related aspects of modern dynamic IT systems, infrastructures and services. DML is designed to serve as a basis for self-aware resource management during operation ensuring that system QoS requirements are continuously satisfied while infrastructure resources are utilized as efficiently as possible.}},\nauthor = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\ninstitution = {{Department of Computer Science, University of Wuerzburg}},\ntitle = {{The Descartes Modeling Language}},\nurl = {http://www.descartes-research.net/dml/},\nhttp = {http://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/10488},\npdf = {http://opus.bibliothek.uni-wuerzburg.de/files/10488/DML-TechReport-1.0.pdf},\nyear = {2014},\nnumpages = {91},\nmonth = {October}\n}\n
\n
\nThis technical report introduces the Descartes Modeling Language (DML), a new architecture-level modeling language for modeling Quality-of-Service (QoS) and resource management related aspects of modern dynamic IT systems, infrastructures and services. DML is designed to serve as a basis for self-aware resource management during operation ensuring that system QoS requirements are continuously satisfied while infrastructure resources are utilized as efficiently as possible.\n
\n','
\n@techreport{KoBrHu2014-TechReport-DML,\n  abstract = {{This technical report introduces the Descartes Modeling Language (DML), a new architecture-level modeling language for modeling Quality-of-Service (QoS) and resource management related aspects of modern dynamic IT systems, infrastructures and services. DML is designed to serve as a basis for self-aware resource management during operation ensuring that system QoS requirements are continuously satisfied while infrastructure resources are utilized as efficiently as possible.}},\n  author = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\n  institution = {{Department of Computer Science, University of Wuerzburg}},\n  title = {{The Descartes Modeling Language}},\n  url = {http://www.descartes-research.net/dml/},\n  http = {http://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/10488},\n  pdf = {http://opus.bibliothek.uni-wuerzburg.de/files/10488/DML-TechReport-1.0.pdf},\n  year = {2014},\n  numpages = {91},\n  month = {October}\n}\n
\n\n','{This technical report introduces the Descartes Modeling Language (DML), a new architecture-level modeling language for modeling Quality-of-Service (QoS) and resource management related aspects of modern dynamic IT systems, infrastructures and services. DML is designed to serve as a basis for self-aware resource management during operation ensuring that system QoS requirements are continuously satisfied while infrastructure resources are utilized as efficiently as possible.}','{The Descartes Modeling Language}',0,10,2014,10,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(296,'paper','KoBrHu2011-ICAC-QoSManagement','inproceedings','@inproceedings{KoBrHu2011-ICAC-QoSManagement,\n abstract = {We present an overview of our work-in-progress and long-term research agenda aiming to develop a novel methodology for engineering of self-aware software systems. The latter will have built-in architecture-level QoS models enhanced to capture dynamic aspects of the system environment and maintained automatically during operation. The models will be exploited at run-time to adapt the system to changes in the environment ensuring that resources are utilized efficiently and QoS requirements are satisfied.},\n author = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\n booktitle = {8th International Conference on Autonomic Computing (ICAC 2011)},\n day = {14--18},\n location = {Karlsruhe, Germany},\n month = {June},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/296.pdf},\n title = {{Self-Aware QoS Management in Virtualized Infrastructures}},\n titleaddon = {{(Poster Paper)}},\n year = {2011},\n}\n\n','\n\nSamuel Kounev, Fabian Brosig, and Nikolaus Huber.\nSelf-Aware QoS Management in Virtualized Infrastructures (Poster\nPaper).\nIn 8th International Conference on Autonomic Computing (ICAC\n2011), Karlsruhe, Germany, June 14-18, 2011.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{KoBrHu2011-ICAC-QoSManagement,\nabstract = {We present an overview of our work-in-progress and long-term research agenda aiming to develop a novel methodology for engineering of self-aware software systems. The latter will have built-in architecture-level QoS models enhanced to capture dynamic aspects of the system environment and maintained automatically during operation. The models will be exploited at run-time to adapt the system to changes in the environment ensuring that resources are utilized efficiently and QoS requirements are satisfied.},\nauthor = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\nbooktitle = {8th International Conference on Autonomic Computing (ICAC 2011)},\nday = {14--18},\nlocation = {Karlsruhe, Germany},\nmonth = {June},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/296.pdf},\ntitle = {{Self-Aware QoS Management in Virtualized Infrastructures}},\ntitleaddon = {{(Poster Paper)}},\nyear = {2011}\n}\n
\n
\nWe present an overview of our work-in-progress and long-term research agenda aiming to develop a novel methodology for engineering of self-aware software systems. The latter will have built-in architecture-level QoS models enhanced to capture dynamic aspects of the system environment and maintained automatically during operation. The models will be exploited at run-time to adapt the system to changes in the environment ensuring that resources are utilized efficiently and QoS requirements are satisfied.\n
\n','
\n@inproceedings{KoBrHu2011-ICAC-QoSManagement,\n  abstract = {We present an overview of our work-in-progress and long-term research agenda aiming to develop a novel methodology for engineering of self-aware software systems. The latter will have built-in architecture-level QoS models enhanced to capture dynamic aspects of the system environment and maintained automatically during operation. The models will be exploited at run-time to adapt the system to changes in the environment ensuring that resources are utilized efficiently and QoS requirements are satisfied.},\n  author = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\n  booktitle = {8th International Conference on Autonomic Computing (ICAC 2011)},\n  day = {14--18},\n  location = {Karlsruhe, Germany},\n  month = {June},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/296.pdf},\n  title = {{Self-Aware QoS Management in Virtualized Infrastructures}},\n  titleaddon = {{(Poster Paper)}},\n  year = {2011}\n}\n
\n\n','We present an overview of our work-in-progress and long-term research agenda aiming to develop a novel methodology for engineering of self-aware software systems. The latter will have built-in architecture-level QoS models enhanced to capture dynamic aspects of the system environment and maintained automatically during operation. The models will be exploited at run-time to adapt the system to changes in the environment ensuring that resources are utilized efficiently and QoS requirements are satisfied.','{Self-Aware QoS Management in Virtualized Infrastructures}',0,6,2011,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(297,'paper','KoBrHuRe2010-SCC-Towards','inproceedings','@inproceedings{KoBrHuRe2010-SCC-Towards,\n abstract = {Modern service-oriented systems have increasingly complex loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operating costs. This is due to the inability to predict at run-time the effect of dynamic changes in the system environment (e.g., varying service workloads) and adapt the system configuration accordingly. In this paper, we describe a long-term vision and approach for designing systems with built-in self-aware performance and resource management capabilities. We advocate the use of architecture-level performance models extracted dynamically from the evolving system configuration and maintained automatically during operation. The models will be exploited at run-time to adapt the system to changes in the environment ensuring that resources are utilized efficiently and performance requirements are continuously satisfied.},\n author = {Samuel Kounev and Fabian Brosig and Nikolaus Huber and Ralf Reussner},\n booktitle = {Proceedings of the 7th IEEE International Conference on Services Computing (SCC 2010), July 5-10, Miami, Florida, USA},\n day = {5--10},\n location = {Miami, Florida, USA},\n month = {July},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/297.pdf},\n publisher = {IEEE Computer Society},\n title = {{Towards self-aware performance and resource management in modern service-oriented systems}},\n year = {2010},\n}\n\n','\n\nSamuel Kounev, Fabian Brosig, Nikolaus Huber, and Ralf Reussner.\nTowards self-aware performance and resource management in modern\nservice-oriented systems.\nIn Proceedings of the 7th IEEE International Conference on\nServices Computing (SCC 2010), July 5-10, Miami, Florida, USA, Miami,\nFlorida, USA, July 5-10, 2010. IEEE Computer Society.\nJuly 2010.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{KoBrHuRe2010-SCC-Towards,\nabstract = {Modern service-oriented systems have increasingly complex loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operating costs. This is due to the inability to predict at run-time the effect of dynamic changes in the system environment (e.g., varying service workloads) and adapt the system configuration accordingly. In this paper, we describe a long-term vision and approach for designing systems with built-in self-aware performance and resource management capabilities. We advocate the use of architecture-level performance models extracted dynamically from the evolving system configuration and maintained automatically during operation. The models will be exploited at run-time to adapt the system to changes in the environment ensuring that resources are utilized efficiently and performance requirements are continuously satisfied.},\nauthor = {Samuel Kounev and Fabian Brosig and Nikolaus Huber and Ralf Reussner},\nbooktitle = {Proceedings of the 7th IEEE International Conference on Services Computing (SCC 2010), July 5-10, Miami, Florida, USA},\nday = {5--10},\nlocation = {Miami, Florida, USA},\nmonth = {July},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/297.pdf},\npublisher = {IEEE Computer Society},\ntitle = {{Towards self-aware performance and resource management in modern service-oriented systems}},\nyear = {2010}\n}\n
\n
\nModern service-oriented systems have increasingly complex loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operating costs. This is due to the inability to predict at run-time the effect of dynamic changes in the system environment (e.g., varying service workloads) and adapt the system configuration accordingly. In this paper, we describe a long-term vision and approach for designing systems with built-in self-aware performance and resource management capabilities. We advocate the use of architecture-level performance models extracted dynamically from the evolving system configuration and maintained automatically during operation. The models will be exploited at run-time to adapt the system to changes in the environment ensuring that resources are utilized efficiently and performance requirements are continuously satisfied.\n
\n','
\n@inproceedings{KoBrHuRe2010-SCC-Towards,\n  abstract = {Modern service-oriented systems have increasingly complex loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operating costs. This is due to the inability to predict at run-time the effect of dynamic changes in the system environment (e.g., varying service workloads) and adapt the system configuration accordingly. In this paper, we describe a long-term vision and approach for designing systems with built-in self-aware performance and resource management capabilities. We advocate the use of architecture-level performance models extracted dynamically from the evolving system configuration and maintained automatically during operation. The models will be exploited at run-time to adapt the system to changes in the environment ensuring that resources are utilized efficiently and performance requirements are continuously satisfied.},\n  author = {Samuel Kounev and Fabian Brosig and Nikolaus Huber and Ralf Reussner},\n  booktitle = {Proceedings of the 7th IEEE International Conference on Services Computing (SCC 2010), July 5-10, Miami, Florida, USA},\n  day = {5--10},\n  location = {Miami, Florida, USA},\n  month = {July},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/297.pdf},\n  publisher = {IEEE Computer Society},\n  title = {{Towards self-aware performance and resource management in modern service-oriented systems}},\n  year = {2010}\n}\n
\n\n','Modern service-oriented systems have increasingly complex loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operating costs. This is due to the inability to predict at run-time the effect of dynamic changes in the system environment (e.g., varying service workloads) and adapt the system configuration accordingly. In this paper, we describe a long-term vision and approach for designing systems with built-in self-aware performance and resource management capabilities. We advocate the use of architecture-level performance models extracted dynamically from the evolving system configuration and maintained automatically during operation. The models will be exploited at run-time to adapt the system to changes in the environment ensuring that resources are utilized efficiently and performance requirements are continuously satisfied.','{Towards self-aware performance and resource management in modern service-oriented systems}',0,7,2010,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(298,'paper','KoBu2007-ARS-OnTheUseOfQPNs','incollection','@inbook{KoBu2007-ARS-OnTheUseOfQPNs,\n title = {Petri Net, Theory and Application},\n year = {2007},\n month = {2},\n abstract = {Predictive performance models are used increasingly throughout the phases of the software engineering lifecycle of distributed systems. However, as systems grow in size and complexity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. The challenge stems from the limited model expressiveness on the one hand and the limited scalability of model analysis techniques on the other. This chapter presents a novel methodology for modeling and performance analysis of distributed systems. The methodology is based on queueing Petri nets (QPNs) which provide greater modeling power and expressiveness than conventional modeling paradigms such as queueing networks and generalized stochastic Petri nets. Using QPNs, one can integrate both hardware and software aspects of system behavior into the same model. In addition to hardware contention and scheduling strategies, QPNs make it easy to model software contention, simultaneous resource possession, synchronization, blocking and asynchronous processing. These aspects have significant impact on the performance of modern distributed systems. To avoid the problem of state space explosion, our methodology uses discrete event simulation for model analysis. We propose an efficient and reliable method for simulation of QPNs. As a validation of our approach, we present a case study of a real-world distributed system, showing how our methodology is applied in a step-by-step fashion to evaluate the system performance and scalability. The system studied is a deployment of the industry-standard SPECjAppServer2004 benchmark. A detailed model of the system and its workload is built and used to predict the system performance for several deployment configurations and workload scenarios of interest. Taking advantage of the expressive power of QPNs, our approach makes it possible to model systems at a higher degree of accuracy providing a number of important benefits.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/298.pdf},\n editor = {Vedran Kordic},\n publisher = {Advanced Robotic Systems International, I-Tech Education and Publishing},\n address = {Vienna, Austria},\n chapter = {On the Use of Queueing Petri Nets for Modeling and Performance Analysis of Distributed Systems},\n isbn = {978-3-902613-12-7},\n author = {Kounev, Samuel and Buchmann, Alejandro},\n}\n\n','\n\nSamuel Kounev and Alejandro Buchmann.\nPetri Net, Theory and Application, chapter On the Use of\nQueueing Petri Nets for Modeling and Performance Analysis of Distributed\nSystems, Vedran Kordic, editor.\nAdvanced Robotic Systems International, I-Tech Education and\nPublishing, Vienna, Austria, 2 2007.\n[ bib | .pdf | Abstract  ] 
\n@inbook{KoBu2007-ARS-OnTheUseOfQPNs,\ntitle = {Petri Net, Theory and Application},\nyear = {2007},\nmonth = {2},\nabstract = {Predictive performance models are used increasingly throughout the phases of the software engineering lifecycle of distributed systems. However, as systems grow in size and complexity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. The challenge stems from the limited model expressiveness on the one hand and the limited scalability of model analysis techniques on the other. This chapter presents a novel methodology for modeling and performance analysis of distributed systems. The methodology is based on queueing Petri nets (QPNs) which provide greater modeling power and expressiveness than conventional modeling paradigms such as queueing networks and generalized stochastic Petri nets. Using QPNs, one can integrate both hardware and software aspects of system behavior into the same model. In addition to hardware contention and scheduling strategies, QPNs make it easy to model software contention, simultaneous resource possession, synchronization, blocking and asynchronous processing. These aspects have significant impact on the performance of modern distributed systems. To avoid the problem of state space explosion, our methodology uses discrete event simulation for model analysis. We propose an efficient and reliable method for simulation of QPNs. As a validation of our approach, we present a case study of a real-world distributed system, showing how our methodology is applied in a step-by-step fashion to evaluate the system performance and scalability. The system studied is a deployment of the industry-standard SPECjAppServer2004 benchmark. A detailed model of the system and its workload is built and used to predict the system performance for several deployment configurations and workload scenarios of interest. Taking advantage of the expressive power of QPNs, our approach makes it possible to model systems at a higher degree of accuracy providing a number of important benefits.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/298.pdf},\neditor = {Vedran Kordic},\npublisher = {Advanced Robotic Systems International, I-Tech Education and Publishing},\naddress = {Vienna, Austria},\nchapter = {On the Use of Queueing Petri Nets for Modeling and Performance Analysis of Distributed Systems},\nisbn = {978-3-902613-12-7},\nauthor = {Kounev, Samuel and Buchmann, Alejandro}\n}\n
\n
\nPredictive performance models are used increasingly throughout the phases of the software engineering lifecycle of distributed systems. However, as systems grow in size and complexity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. The challenge stems from the limited model expressiveness on the one hand and the limited scalability of model analysis techniques on the other. This chapter presents a novel methodology for modeling and performance analysis of distributed systems. The methodology is based on queueing Petri nets (QPNs) which provide greater modeling power and expressiveness than conventional modeling paradigms such as queueing networks and generalized stochastic Petri nets. Using QPNs, one can integrate both hardware and software aspects of system behavior into the same model. In addition to hardware contention and scheduling strategies, QPNs make it easy to model software contention, simultaneous resource possession, synchronization, blocking and asynchronous processing. These aspects have significant impact on the performance of modern distributed systems. To avoid the problem of state space explosion, our methodology uses discrete event simulation for model analysis. We propose an efficient and reliable method for simulation of QPNs. As a validation of our approach, we present a case study of a real-world distributed system, showing how our methodology is applied in a step-by-step fashion to evaluate the system performance and scalability. The system studied is a deployment of the industry-standard SPECjAppServer2004 benchmark. A detailed model of the system and its workload is built and used to predict the system performance for several deployment configurations and workload scenarios of interest. Taking advantage of the expressive power of QPNs, our approach makes it possible to model systems at a higher degree of accuracy providing a number of important benefits.\n
\n','
\n@inbook{KoBu2007-ARS-OnTheUseOfQPNs,\n  title = {Petri Net, Theory and Application},\n  year = {2007},\n  month = {2},\n  abstract = {Predictive performance models are used increasingly throughout the phases of the software engineering lifecycle of distributed systems. However, as systems grow in size and complexity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. The challenge stems from the limited model expressiveness on the one hand and the limited scalability of model analysis techniques on the other. This chapter presents a novel methodology for modeling and performance analysis of distributed systems. The methodology is based on queueing Petri nets (QPNs) which provide greater modeling power and expressiveness than conventional modeling paradigms such as queueing networks and generalized stochastic Petri nets. Using QPNs, one can integrate both hardware and software aspects of system behavior into the same model. In addition to hardware contention and scheduling strategies, QPNs make it easy to model software contention, simultaneous resource possession, synchronization, blocking and asynchronous processing. These aspects have significant impact on the performance of modern distributed systems. To avoid the problem of state space explosion, our methodology uses discrete event simulation for model analysis. We propose an efficient and reliable method for simulation of QPNs. As a validation of our approach, we present a case study of a real-world distributed system, showing how our methodology is applied in a step-by-step fashion to evaluate the system performance and scalability. The system studied is a deployment of the industry-standard SPECjAppServer2004 benchmark. A detailed model of the system and its workload is built and used to predict the system performance for several deployment configurations and workload scenarios of interest. Taking advantage of the expressive power of QPNs, our approach makes it possible to model systems at a higher degree of accuracy providing a number of important benefits.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/298.pdf},\n  editor = {Vedran Kordic},\n  publisher = {Advanced Robotic Systems International, I-Tech Education and Publishing},\n  address = {Vienna, Austria},\n  chapter = {On the Use of Queueing Petri Nets for Modeling and Performance Analysis of Distributed Systems},\n  isbn = {978-3-902613-12-7},\n  author = {Kounev, Samuel and Buchmann, Alejandro}\n}\n
\n\n','Predictive performance models are used increasingly throughout the phases of the software engineering lifecycle of distributed systems. However, as systems grow in size and complexity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. The challenge stems from the limited model expressiveness on the one hand and the limited scalability of model analysis techniques on the other. This chapter presents a novel methodology for modeling and performance analysis of distributed systems. The methodology is based on queueing Petri nets (QPNs) which provide greater modeling power and expressiveness than conventional modeling paradigms such as queueing networks and generalized stochastic Petri nets. Using QPNs, one can integrate both hardware and software aspects of system behavior into the same model. In addition to hardware contention and scheduling strategies, QPNs make it easy to model software contention, simultaneous resource possession, synchronization, blocking and asynchronous processing. These aspects have significant impact on the performance of modern distributed systems. To avoid the problem of state space explosion, our methodology uses discrete event simulation for model analysis. We propose an efficient and reliable method for simulation of QPNs. As a validation of our approach, we present a case study of a real-world distributed system, showing how our methodology is applied in a step-by-step fashion to evaluate the system performance and scalability. The system studied is a deployment of the industry-standard SPECjAppServer2004 benchmark. A detailed model of the system and its workload is built and used to predict the system performance for several deployment configurations and workload scenarios of interest. Taking advantage of the expressive power of QPNs, our approach makes it possible to model systems at a higher degree of accuracy providing a number of important benefits.','{{On the Use of Queueing Petri Nets for Modeling and Performance Analysis of Distributed Systems}}',0,2,2007,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(299,'paper','KoBu2006-PERFEVAL-SimQPN','article','@article{KoBu2006-PERFEVAL-SimQPN,\n title = {{SimQPN - a tool and methodology for analyzing queueing Petri net models by means of simulation}},\n journal = {Performance Evaluation},\n year = {2006},\n month = {5},\n volume = {63},\n number = {4-5},\n pages = {364--394},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/299.pdf},\n publisher = {Elsevier Science Publishers B. V.},\n address = {Amsterdam, The Netherlands},\n issn = {0166-5316},\n doi = {10.1016/j.peva.2005.03.004},\n author = {Kounev, Samuel and Buchmann, Alejandro},\n}\n\n','\n\nSamuel Kounev and Alejandro Buchmann.\nSimQPN - a tool and methodology for analyzing queueing Petri net\nmodels by means of simulation.\nPerformance Evaluation, 63(4-5):364-394, 5 2006, Elsevier\nScience Publishers B. V., Amsterdam, The Netherlands.\n[ bib | DOI | .pdf  ] 
\n@article{KoBu2006-PERFEVAL-SimQPN,\ntitle = {{SimQPN - a tool and methodology for analyzing queueing Petri net models by means of simulation}},\njournal = {Performance Evaluation},\nyear = {2006},\nmonth = {5},\nvolume = {63},\nnumber = {4-5},\npages = {364--394},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/299.pdf},\npublisher = {Elsevier Science Publishers B. V.},\naddress = {Amsterdam, The Netherlands},\nissn = {0166-5316},\ndoi = {10.1016/j.peva.2005.03.004},\nauthor = {Kounev, Samuel and Buchmann, Alejandro}\n}\n
\n
\n','
\n@article{KoBu2006-PERFEVAL-SimQPN,\n  title = {{SimQPN - a tool and methodology for analyzing queueing Petri net models by means of simulation}},\n  journal = {Performance Evaluation},\n  year = {2006},\n  month = {5},\n  volume = {63},\n  number = {4-5},\n  pages = {364--394},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/299.pdf},\n  publisher = {Elsevier Science Publishers B. V.},\n  address = {Amsterdam, The Netherlands},\n  issn = {0166-5316},\n  doi = {10.1016/j.peva.2005.03.004},\n  author = {Kounev, Samuel and Buchmann, Alejandro}\n}\n
\n\n',NULL,'{SimQPN - a tool and methodology for analyzing queueing Petri net models by means of simulation}',0,5,2006,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(300,'paper','KoBu2003-CMG-PerfModeling_J2EEApps','inproceedings','@inproceedings{KoBu2003-CMG-PerfModeling_J2EEApps,\n abstract = {Modern J2EE applications are typically based on highly distributed architectures comprising multiple components deployed in a clustered environment. This makes it difficult for deployers to estimate the capacity of the deployment environment needed to guarantee that Service Level Agreements are met. This paper looks at the different approaches to this problem and discusses the difficulties that arise when one tries to apply them to large, real-world systems. The authors study a realistic J2EE application (the SPECjAppServer2002 benchmark) and show how analytical models can be exploited for capacity planning.},\n author = {Samuel Kounev and Alejandro Buchmann},\n booktitle = {Proceedings of the 29th International Conference of the Computer Measurement Group on Resource Management and Performance Evaluation of Enterprise Computing Systems (CMG 2003), Dallas, Texas, USA, December 7-12, 2003},\n month = {December},\n note = {Best-Paper-Award},\n organization = {Computer Measurement Group (CMG)},\n pages = {273--283},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/300.pdf},\n title = {{Performance Modeling and Evaluation of Large-Scale J2EE Applications}},\n url = {http://www.cmg.org/proceedings/2003/3173.pdf},\n year = {2003},\n}\n\n','\n\nSamuel Kounev and Alejandro Buchmann.\nPerformance Modeling and Evaluation of Large-Scale J2EE\nApplications.\nIn Proceedings of the 29th International Conference of the\nComputer Measurement Group on Resource Management and Performance Evaluation\nof Enterprise Computing Systems (CMG 2003), Dallas, Texas, USA, December\n7-12, 2003, December 2003, pages 273-283. Computer Measurement Group (CMG).\nBest-Paper-Award.\n[ bib | .pdf | .pdf | Abstract  ] 
\n@inproceedings{KoBu2003-CMG-PerfModeling_J2EEApps,\nabstract = {Modern J2EE applications are typically based on highly distributed architectures comprising multiple components deployed in a clustered environment. This makes it difficult for deployers to estimate the capacity of the deployment environment needed to guarantee that Service Level Agreements are met. This paper looks at the different approaches to this problem and discusses the difficulties that arise when one tries to apply them to large, real-world systems. The authors study a realistic J2EE application (the SPECjAppServer2002 benchmark) and show how analytical models can be exploited for capacity planning.},\nauthor = {Samuel Kounev and Alejandro Buchmann},\nbooktitle = {Proceedings of the 29th International Conference of the Computer Measurement Group on Resource Management and Performance Evaluation of Enterprise Computing Systems (CMG 2003), Dallas, Texas, USA, December 7-12, 2003},\nmonth = {December},\nnote = {Best-Paper-Award},\norganization = {Computer Measurement Group (CMG)},\npages = {273--283},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/300.pdf},\ntitle = {{Performance Modeling and Evaluation of Large-Scale J2EE Applications}},\nurl = {http://www.cmg.org/proceedings/2003/3173.pdf},\nyear = {2003}\n}\n
\n
\nModern J2EE applications are typically based on highly distributed architectures comprising multiple components deployed in a clustered environment. This makes it difficult for deployers to estimate the capacity of the deployment environment needed to guarantee that Service Level Agreements are met. This paper looks at the different approaches to this problem and discusses the difficulties that arise when one tries to apply them to large, real-world systems. The authors study a realistic J2EE application (the SPECjAppServer2002 benchmark) and show how analytical models can be exploited for capacity planning.\n
\n','
\n@inproceedings{KoBu2003-CMG-PerfModeling_J2EEApps,\n  abstract = {Modern J2EE applications are typically based on highly distributed architectures comprising multiple components deployed in a clustered environment. This makes it difficult for deployers to estimate the capacity of the deployment environment needed to guarantee that Service Level Agreements are met. This paper looks at the different approaches to this problem and discusses the difficulties that arise when one tries to apply them to large, real-world systems. The authors study a realistic J2EE application (the SPECjAppServer2002 benchmark) and show how analytical models can be exploited for capacity planning.},\n  author = {Samuel Kounev and Alejandro Buchmann},\n  booktitle = {Proceedings of the 29th International Conference of the Computer Measurement Group on Resource Management and Performance Evaluation of Enterprise Computing Systems (CMG 2003), Dallas, Texas, USA, December 7-12, 2003},\n  month = {December},\n  note = {Best-Paper-Award},\n  organization = {Computer Measurement Group (CMG)},\n  pages = {273--283},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/300.pdf},\n  title = {{Performance Modeling and Evaluation of Large-Scale J2EE Applications}},\n  url = {http://www.cmg.org/proceedings/2003/3173.pdf},\n  year = {2003}\n}\n
\n\n','Modern J2EE applications are typically based on highly distributed architectures comprising multiple components deployed in a clustered environment. This makes it difficult for deployers to estimate the capacity of the deployment environment needed to guarantee that Service Level Agreements are met. This paper looks at the different approaches to this problem and discusses the difficulties that arise when one tries to apply them to large, real-world systems. The authors study a realistic J2EE application (the SPECjAppServer2002 benchmark) and show how analytical models can be exploited for capacity planning.','{Performance Modeling and Evaluation of Large-Scale J2EE Applications}',0,12,2003,12,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(301,'paper','KoBu2003-ISPASS-ModelingUsingQPNs','inproceedings','@inproceedings{KoBu2003-ISPASS-ModelingUsingQPNs,\n title = {Performance Modeling of Distributed E-Business Applications using Queueing Petri Nets},\n year = {2003},\n month = {March},\n pages = {143--155},\n abstract = {In this paper we show how Queuing Petri Net (QPN) models can be exploited for performance analysis of distributed e-business systems. We study a real-world application, and demonstrate the benefits, in terms of modelling power and expressiveness, that QPN models provide over conventional modelling paradigms such as Queuing Networks and Petri Nets. As shown, QPNs facilitate the integration of both hardware and software aspects of system behavior in the same model. In addition to hardware contention and scheduling strategies, using QPNs one can easily model simultaneous resource possession, synchronization, blocking and contention for software resources. By validating the models presented through measurements, we show that they are not just powerful as a specification mechanism, but are also very powerful as a performance analysis and prediction tool. However, currently available tools and techniques for QPN analysis are limited. Improved solution methods, which enable larger models to be analyzed, need to be developed. By demonstrating the power of QPNs as a modelling paradigm in realistic scenarios, we hope to motivate further research in this area.},\n note = {Best-Paper-Award},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/301.pdf},\n publisher = {IEEE Computer Society},\n address = {Washington, DC, USA},\n booktitle = {Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS 2003), Austin, Texas, USA, March 6-8, 2003},\n isbn = {0-7803-7756-7},\n doi = {10.1109/ISPASS.2003.1190241},\n author = {Kounev, Samuel and Buchmann, Alejandro},\n}\n\n','\n\nSamuel Kounev and Alejandro Buchmann.\nPerformance modeling of distributed e-business applications using\nqueueing petri nets.\nIn Proceedings of the 2003 IEEE International Symposium on\nPerformance Analysis of Systems and Software (ISPASS 2003), Austin, Texas,\nUSA, March 6-8, 2003, March 2003, pages 143-155. IEEE Computer Society,\nWashington, DC, USA.\nMarch 2003, Best-Paper-Award.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{KoBu2003-ISPASS-ModelingUsingQPNs,\ntitle = {Performance Modeling of Distributed E-Business Applications using Queueing Petri Nets},\nyear = {2003},\nmonth = {March},\npages = {143--155},\nabstract = {In this paper we show how Queuing Petri Net (QPN) models can be exploited for performance analysis of distributed e-business systems. We study a real-world application, and demonstrate the benefits, in terms of modelling power and expressiveness, that QPN models provide over conventional modelling paradigms such as Queuing Networks and Petri Nets. As shown, QPNs facilitate the integration of both hardware and software aspects of system behavior in the same model. In addition to hardware contention and scheduling strategies, using QPNs one can easily model simultaneous resource possession, synchronization, blocking and contention for software resources. By validating the models presented through measurements, we show that they are not just powerful as a specification mechanism, but are also very powerful as a performance analysis and prediction tool. However, currently available tools and techniques for QPN analysis are limited. Improved solution methods, which enable larger models to be analyzed, need to be developed. By demonstrating the power of QPNs as a modelling paradigm in realistic scenarios, we hope to motivate further research in this area.},\nnote = {Best-Paper-Award},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/301.pdf},\npublisher = {IEEE Computer Society},\naddress = {Washington, DC, USA},\nbooktitle = {Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS 2003), Austin, Texas, USA, March 6-8, 2003},\nisbn = {0-7803-7756-7},\ndoi = {10.1109/ISPASS.2003.1190241},\nauthor = {Kounev, Samuel and Buchmann, Alejandro}\n}\n
\n
\nIn this paper we show how Queuing Petri Net (QPN) models can be exploited for performance analysis of distributed e-business systems. We study a real-world application, and demonstrate the benefits, in terms of modelling power and expressiveness, that QPN models provide over conventional modelling paradigms such as Queuing Networks and Petri Nets. As shown, QPNs facilitate the integration of both hardware and software aspects of system behavior in the same model. In addition to hardware contention and scheduling strategies, using QPNs one can easily model simultaneous resource possession, synchronization, blocking and contention for software resources. By validating the models presented through measurements, we show that they are not just powerful as a specification mechanism, but are also very powerful as a performance analysis and prediction tool. However, currently available tools and techniques for QPN analysis are limited. Improved solution methods, which enable larger models to be analyzed, need to be developed. By demonstrating the power of QPNs as a modelling paradigm in realistic scenarios, we hope to motivate further research in this area.\n
\n','
\n@inproceedings{KoBu2003-ISPASS-ModelingUsingQPNs,\n  title = {Performance Modeling of Distributed E-Business Applications using Queueing Petri Nets},\n  year = {2003},\n  month = {March},\n  pages = {143--155},\n  abstract = {In this paper we show how Queuing Petri Net (QPN) models can be exploited for performance analysis of distributed e-business systems. We study a real-world application, and demonstrate the benefits, in terms of modelling power and expressiveness, that QPN models provide over conventional modelling paradigms such as Queuing Networks and Petri Nets. As shown, QPNs facilitate the integration of both hardware and software aspects of system behavior in the same model. In addition to hardware contention and scheduling strategies, using QPNs one can easily model simultaneous resource possession, synchronization, blocking and contention for software resources. By validating the models presented through measurements, we show that they are not just powerful as a specification mechanism, but are also very powerful as a performance analysis and prediction tool. However, currently available tools and techniques for QPN analysis are limited. Improved solution methods, which enable larger models to be analyzed, need to be developed. By demonstrating the power of QPNs as a modelling paradigm in realistic scenarios, we hope to motivate further research in this area.},\n  note = {Best-Paper-Award},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/301.pdf},\n  publisher = {IEEE Computer Society},\n  address = {Washington, DC, USA},\n  booktitle = {Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS 2003), Austin, Texas, USA, March 6-8, 2003},\n  isbn = {0-7803-7756-7},\n  doi = {10.1109/ISPASS.2003.1190241},\n  author = {Kounev, Samuel and Buchmann, Alejandro}\n}\n
\n\n','In this paper we show how Queuing Petri Net (QPN) models can be exploited for performance analysis of distributed e-business systems. We study a real-world application, and demonstrate the benefits, in terms of modelling power and expressiveness, that QPN models provide over conventional modelling paradigms such as Queuing Networks and Petri Nets. As shown, QPNs facilitate the integration of both hardware and software aspects of system behavior in the same model. In addition to hardware contention and scheduling strategies, using QPNs one can easily model simultaneous resource possession, synchronization, blocking and contention for software resources. By validating the models presented through measurements, we show that they are not just powerful as a specification mechanism, but are also very powerful as a performance analysis and prediction tool. However, currently available tools and techniques for QPN analysis are limited. Improved solution methods, which enable larger models to be analyzed, need to be developed. By demonstrating the power of QPNs as a modelling paradigm in realistic scenarios, we hope to motivate further research in this area.','Performance Modeling of Distributed E-Business Applications using Queueing Petri Nets',0,3,2003,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(302,'paper','KoBu2002-SSGRR-PerfIssuesEB','inproceedings','@inproceedings{KoBu2002-SSGRR-PerfIssuesEB,\n abstract = {Performance and scalability issues in e-business systems are gaining in importance as we move from hype and prototypes to real operational systems. Typical for this development is also the emergence of standard benchmarks of which TPC-W for transactional B2C systems and ECperf for performance and scalability measurement of application servers are two of the better known examples. In this paper we present an experience report with the ECperf benchmark defined by Sun and discuss performance issues that we observed in our implementation of the benchmark. Some of these issues are related to the specification of the benchmark, for which we made suggestions how to correct them and others are related to database connectivity, locking patterns, and the need for asynchronous processing.},\n author = {Samuel Kounev and Alejandro Buchmann},\n booktitle = {Proceedings of the International Conference on Advances in Infrastructure for e-Business, e-Education, e-Science, and e-Medicine on the Internet (SSGRR 2002w), L\'Aquila, Italy, January 21-27, 2002},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/302.pdf},\n title = {{Performance Issues in E-Business Systems}},\n year = {2002},\n month = {January},\n}\n\n','\n\nSamuel Kounev and Alejandro Buchmann.\nPerformance Issues in E-Business Systems.\nIn Proceedings of the International Conference on Advances in\nInfrastructure for e-Business, e-Education, e-Science, and e-Medicine on the\nInternet (SSGRR 2002w), L\'Aquila, Italy, January 21-27, 2002, January 2002.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{KoBu2002-SSGRR-PerfIssuesEB,\nabstract = {Performance and scalability issues in e-business systems are gaining in importance as we move from hype and prototypes to real operational systems. Typical for this development is also the emergence of standard benchmarks of which TPC-W for transactional B2C systems and ECperf for performance and scalability measurement of application servers are two of the better known examples. In this paper we present an experience report with the ECperf benchmark defined by Sun and discuss performance issues that we observed in our implementation of the benchmark. Some of these issues are related to the specification of the benchmark, for which we made suggestions how to correct them and others are related to database connectivity, locking patterns, and the need for asynchronous processing.},\nauthor = {Samuel Kounev and Alejandro Buchmann},\nbooktitle = {Proceedings of the International Conference on Advances in Infrastructure for e-Business, e-Education, e-Science, and e-Medicine on the Internet (SSGRR 2002w), L\'Aquila, Italy, January 21-27, 2002},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/302.pdf},\ntitle = {{Performance Issues in E-Business Systems}},\nyear = {2002},\nmonth = {January}\n}\n
\n
\nPerformance and scalability issues in e-business systems are gaining in importance as we move from hype and prototypes to real operational systems. Typical for this development is also the emergence of standard benchmarks of which TPC-W for transactional B2C systems and ECperf for performance and scalability measurement of application servers are two of the better known examples. In this paper we present an experience report with the ECperf benchmark defined by Sun and discuss performance issues that we observed in our implementation of the benchmark. Some of these issues are related to the specification of the benchmark, for which we made suggestions how to correct them and others are related to database connectivity, locking patterns, and the need for asynchronous processing.\n
\n','
\n@inproceedings{KoBu2002-SSGRR-PerfIssuesEB,\n  abstract = {Performance and scalability issues in e-business systems are gaining in importance as we move from hype and prototypes to real operational systems. Typical for this development is also the emergence of standard benchmarks of which TPC-W for transactional B2C systems and ECperf for performance and scalability measurement of application servers are two of the better known examples. In this paper we present an experience report with the ECperf benchmark defined by Sun and discuss performance issues that we observed in our implementation of the benchmark. Some of these issues are related to the specification of the benchmark, for which we made suggestions how to correct them and others are related to database connectivity, locking patterns, and the need for asynchronous processing.},\n  author = {Samuel Kounev and Alejandro Buchmann},\n  booktitle = {Proceedings of the International Conference on Advances in Infrastructure for e-Business, e-Education, e-Science, and e-Medicine on the Internet (SSGRR 2002w), L\'Aquila, Italy, January 21-27, 2002},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/302.pdf},\n  title = {{Performance Issues in E-Business Systems}},\n  year = {2002},\n  month = {January}\n}\n
\n\n','Performance and scalability issues in e-business systems are gaining in importance as we move from hype and prototypes to real operational systems. Typical for this development is also the emergence of standard benchmarks of which TPC-W for transactional B2C systems and ECperf for performance and scalability measurement of application servers are two of the better known examples. In this paper we present an experience report with the ECperf benchmark defined by Sun and discuss performance issues that we observed in our implementation of the benchmark. Some of these issues are related to the specification of the benchmark, for which we made suggestions how to correct them and others are related to database connectivity, locking patterns, and the need for asynchronous processing.','{Performance Issues in E-Business Systems}',0,1,2002,1,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(303,'paper','KoBu2002-VLDB-ImprovingDataAccessJ2EE','inproceedings','@inproceedings{KoBu2002-VLDB-ImprovingDataAccessJ2EE,\n abstract = {The J2EE platform provides a variety of options for making business data persistent using DBMS technology. However, the integration with existing backend database systems has proven to be of crucial importance for the scalability and performance of J2EE applications, because modern e-business systems are extremely data-intensive. As a result, the data access layer, and the link between the application server and the database server in particular, are very susceptible to turning into a system bottleneck. In this paper we use the ECperf benchmark as an example of a realistic application in order to illustrate the problems mentioned above and discuss how they could be approached and eliminated. In particular, we show how asynchronous, message-based processing could be exploited to reduce the load on the DBMS and improve system performance, scalability and reliability. Furthermore, we discuss the major issues related to the correct use of entity beans (the components provided by J2EE for modelling persistent data) and present a number of methods to optimize their performance utilizing caching mechanisms. We have evaluated the proposed techniques through measurements and have documented the performance gains that they provide.},\n author = {Samuel Kounev and Alejandro Buchmann},\n booktitle = {Proceedings of the 28th International Conference on Very Large Data Bases (VLDB 2002), Hong Kong, China, August 20--23, 2002},\n note = {Acceptance Rate (Full Paper): 14\\% Best-Paper-Award Nomination},\n pages = {574--585},\n pdf = {http://www.vldb.org/conf/2002/S16P03.pdf},\n publisher = {VLDB Endowment, Morgan Kaufmann},\n title = {{Improving Data Access of J2EE Applications by Exploiting Asynchronous Messaging and Caching Services}},\n url = {http://www.vldb.org/conf/2002/S16P03.pdf},\n year = {2002},\n}\n\n','\n\nSamuel Kounev and Alejandro Buchmann.\nImproving Data Access of J2EE Applications by Exploiting\nAsynchronous Messaging and Caching Services.\nIn Proceedings of the 28th International Conference on Very\nLarge Data Bases (VLDB 2002), Hong Kong, China, August 20-23, 2002, 2002,\npages 574-585. VLDB Endowment, Morgan Kaufmann.\n2002, Acceptance Rate (Full Paper): 14% Best-Paper-Award\nNomination.\n[ bib | .pdf | .pdf | Abstract  ] 
\n@inproceedings{KoBu2002-VLDB-ImprovingDataAccessJ2EE,\nabstract = {The J2EE platform provides a variety of options for making business data persistent using DBMS technology. However, the integration with existing backend database systems has proven to be of crucial importance for the scalability and performance of J2EE applications, because modern e-business systems are extremely data-intensive. As a result, the data access layer, and the link between the application server and the database server in particular, are very susceptible to turning into a system bottleneck. In this paper we use the ECperf benchmark as an example of a realistic application in order to illustrate the problems mentioned above and discuss how they could be approached and eliminated. In particular, we show how asynchronous, message-based processing could be exploited to reduce the load on the DBMS and improve system performance, scalability and reliability. Furthermore, we discuss the major issues related to the correct use of entity beans (the components provided by J2EE for modelling persistent data) and present a number of methods to optimize their performance utilizing caching mechanisms. We have evaluated the proposed techniques through measurements and have documented the performance gains that they provide.},\nauthor = {Samuel Kounev and Alejandro Buchmann},\nbooktitle = {Proceedings of the 28th International Conference on Very Large Data Bases (VLDB 2002), Hong Kong, China, August 20--23, 2002},\nnote = {Acceptance Rate (Full Paper): 14\\% Best-Paper-Award Nomination},\npages = {574--585},\npdf = {http://www.vldb.org/conf/2002/S16P03.pdf},\npublisher = {VLDB Endowment, Morgan Kaufmann},\ntitle = {{Improving Data Access of J2EE Applications by Exploiting Asynchronous Messaging and Caching Services}},\nurl = {http://www.vldb.org/conf/2002/S16P03.pdf},\nyear = {2002}\n}\n
\n
\nThe J2EE platform provides a variety of options for making business data persistent using DBMS technology. However, the integration with existing backend database systems has proven to be of crucial importance for the scalability and performance of J2EE applications, because modern e-business systems are extremely data-intensive. As a result, the data access layer, and the link between the application server and the database server in particular, are very susceptible to turning into a system bottleneck. In this paper we use the ECperf benchmark as an example of a realistic application in order to illustrate the problems mentioned above and discuss how they could be approached and eliminated. In particular, we show how asynchronous, message-based processing could be exploited to reduce the load on the DBMS and improve system performance, scalability and reliability. Furthermore, we discuss the major issues related to the correct use of entity beans (the components provided by J2EE for modelling persistent data) and present a number of methods to optimize their performance utilizing caching mechanisms. We have evaluated the proposed techniques through measurements and have documented the performance gains that they provide.\n
\n','
\n@inproceedings{KoBu2002-VLDB-ImprovingDataAccessJ2EE,\n  abstract = {The J2EE platform provides a variety of options for making business data persistent using DBMS technology. However, the integration with existing backend database systems has proven to be of crucial importance for the scalability and performance of J2EE applications, because modern e-business systems are extremely data-intensive. As a result, the data access layer, and the link between the application server and the database server in particular, are very susceptible to turning into a system bottleneck. In this paper we use the ECperf benchmark as an example of a realistic application in order to illustrate the problems mentioned above and discuss how they could be approached and eliminated. In particular, we show how asynchronous, message-based processing could be exploited to reduce the load on the DBMS and improve system performance, scalability and reliability. Furthermore, we discuss the major issues related to the correct use of entity beans (the components provided by J2EE for modelling persistent data) and present a number of methods to optimize their performance utilizing caching mechanisms. We have evaluated the proposed techniques through measurements and have documented the performance gains that they provide.},\n  author = {Samuel Kounev and Alejandro Buchmann},\n  booktitle = {Proceedings of the 28th International Conference on Very Large Data Bases (VLDB 2002), Hong Kong, China, August 20--23, 2002},\n  note = {Acceptance Rate (Full Paper): 14\\% Best-Paper-Award Nomination},\n  pages = {574--585},\n  pdf = {http://www.vldb.org/conf/2002/S16P03.pdf},\n  publisher = {VLDB Endowment, Morgan Kaufmann},\n  title = {{Improving Data Access of J2EE Applications by Exploiting Asynchronous Messaging and Caching Services}},\n  url = {http://www.vldb.org/conf/2002/S16P03.pdf},\n  year = {2002}\n}\n
\n\n','The J2EE platform provides a variety of options for making business data persistent using DBMS technology. However, the integration with existing backend database systems has proven to be of crucial importance for the scalability and performance of J2EE applications, because modern e-business systems are extremely data-intensive. As a result, the data access layer, and the link between the application server and the database server in particular, are very susceptible to turning into a system bottleneck. In this paper we use the ECperf benchmark as an example of a realistic application in order to illustrate the problems mentioned above and discuss how they could be approached and eliminated. In particular, we show how asynchronous, message-based processing could be exploited to reduce the load on the DBMS and improve system performance, scalability and reliability. Furthermore, we discuss the major issues related to the correct use of entity beans (the components provided by J2EE for modelling persistent data) and present a number of methods to optimize their performance utilizing caching mechanisms. We have evaluated the proposed techniques through measurements and have documented the performance gains that they provide.','{Improving Data Access of J2EE Applications by Exploiting Asynchronous Messaging and Caching Services}',0,0,2002,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(304,'paper','KoDu2009-SIGMETRICS_PER-QPME','article','@article{KoDu2009-SIGMETRICS_PER-QPME,\n title = {{QPME - A Performance Modeling Tool Based on Queueing Petri Nets}},\n journal = {ACM SIGMETRICS Performance Evaluation Review (PER), Special Issue on Tools for Computer Performance Modeling and Reliability Analysis},\n year = {2009},\n month = {3},\n volume = {36},\n pages = {46--51},\n abstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present QPME (Queueing Petri net Modeling Environment) - a tool that supports the modeling and analysis of systems using queueing Petri nets. QPME provides an Eclipse-based editor for designing queueing Petri net models and a powerful simulation engine for analyzing the models. After presenting the tool, we discuss the ongoing work on the QPME project and the planned future enhancements of the tool.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/304.pdf},\n publisher = {ACM},\n author = {Kounev, Samuel and Dutz, Christofer},\n}\n\n','\n\nSamuel Kounev and Christofer Dutz.\nQPME - A Performance Modeling Tool Based on Queueing Petri Nets.\nACM SIGMETRICS Performance Evaluation Review (PER), Special\nIssue on Tools for Computer Performance Modeling and Reliability Analysis,\n36:46-51, 3 2009, ACM.\n[ bib | .pdf | Abstract  ] 
\n@article{KoDu2009-SIGMETRICS_PER-QPME,\ntitle = {{QPME - A Performance Modeling Tool Based on Queueing Petri Nets}},\njournal = {ACM SIGMETRICS Performance Evaluation Review (PER), Special Issue on Tools for Computer Performance Modeling and Reliability Analysis},\nyear = {2009},\nmonth = {3},\nvolume = {36},\npages = {46--51},\nabstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present QPME (Queueing Petri net Modeling Environment) - a tool that supports the modeling and analysis of systems using queueing Petri nets. QPME provides an Eclipse-based editor for designing queueing Petri net models and a powerful simulation engine for analyzing the models. After presenting the tool, we discuss the ongoing work on the QPME project and the planned future enhancements of the tool.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/304.pdf},\npublisher = {ACM},\nauthor = {Kounev, Samuel and Dutz, Christofer}\n}\n
\n
\nQueueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present QPME (Queueing Petri net Modeling Environment) - a tool that supports the modeling and analysis of systems using queueing Petri nets. QPME provides an Eclipse-based editor for designing queueing Petri net models and a powerful simulation engine for analyzing the models. After presenting the tool, we discuss the ongoing work on the QPME project and the planned future enhancements of the tool.\n
\n','
\n@article{KoDu2009-SIGMETRICS_PER-QPME,\n  title = {{QPME - A Performance Modeling Tool Based on Queueing Petri Nets}},\n  journal = {ACM SIGMETRICS Performance Evaluation Review (PER), Special Issue on Tools for Computer Performance Modeling and Reliability Analysis},\n  year = {2009},\n  month = {3},\n  volume = {36},\n  pages = {46--51},\n  abstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present QPME (Queueing Petri net Modeling Environment) - a tool that supports the modeling and analysis of systems using queueing Petri nets. QPME provides an Eclipse-based editor for designing queueing Petri net models and a powerful simulation engine for analyzing the models. After presenting the tool, we discuss the ongoing work on the QPME project and the planned future enhancements of the tool.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/304.pdf},\n  publisher = {ACM},\n  author = {Kounev, Samuel and Dutz, Christofer}\n}\n
\n\n','Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present QPME (Queueing Petri net Modeling Environment) - a tool that supports the modeling and analysis of systems using queueing Petri nets. QPME provides an Eclipse-based editor for designing queueing Petri net models and a powerful simulation engine for analyzing the models. After presenting the tool, we discuss the ongoing work on the QPME project and the planned future enhancements of the tool.','{QPME - A Performance Modeling Tool Based on Queueing Petri Nets}',0,3,2009,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(305,'paper','Ko2007-TUD-QPME_UsersGuide','manual','@manual{Ko2007-TUD-QPME_UsersGuide,\n abstract = {This document describes the software package QPME (Queueing Petri net Modeling Environment), a performance modeling and analysis tool based on the Queueing Petri Net (QPN) modeling formalism. QPN models are more sophisticated than conventional queueing networks and stochastic Petri nets and have greater expressive power. This provides a number of important benefits since it makes it possible to model systems at a higher degree of accuracy. QPME is made of two components: QPE (QPN Editor) and SimQPN (Simulator for QPNs). QPE provides a user-friendly graphical tool for modeling using QPNs based on the Eclipse/GEF framework. SimQPN provides an efficient discrete-event simulation engine for QPNs that makes it possible to analyze models of realistically-sized systems. QPME runs on a wide range of platforms including Windows, Linux and Solaris. QPME is developed and maintained by Samuel Kounev and Christofer Dutz.},\n address = {Darmstadt, Germany},\n author = {Samuel Kounev and Christofer Dutz},\n month = {January},\n organization = {Technische Universit{\\\"{a}}t Darmstadt},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/305.pdf},\n title = {{QPME 1.0 User\'s Guide}},\n year = {2007},\n}\n\n','\n\nSamuel Kounev and Christofer Dutz.\nQPME 1.0 User\'s Guide.\nTechnische Universität Darmstadt, Darmstadt, Germany, January\n2007.\n[ bib | .pdf | Abstract  ] 
\n@manual{Ko2007-TUD-QPME_UsersGuide,\nabstract = {This document describes the software package QPME (Queueing Petri net Modeling Environment), a performance modeling and analysis tool based on the Queueing Petri Net (QPN) modeling formalism. QPN models are more sophisticated than conventional queueing networks and stochastic Petri nets and have greater expressive power. This provides a number of important benefits since it makes it possible to model systems at a higher degree of accuracy. QPME is made of two components: QPE (QPN Editor) and SimQPN (Simulator for QPNs). QPE provides a user-friendly graphical tool for modeling using QPNs based on the Eclipse/GEF framework. SimQPN provides an efficient discrete-event simulation engine for QPNs that makes it possible to analyze models of realistically-sized systems. QPME runs on a wide range of platforms including Windows, Linux and Solaris. QPME is developed and maintained by Samuel Kounev and Christofer Dutz.},\naddress = {Darmstadt, Germany},\nauthor = {Samuel Kounev and Christofer Dutz},\nmonth = {January},\norganization = {Technische Universit{\\\"{a}}t Darmstadt},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/305.pdf},\ntitle = {{QPME 1.0 User\'s Guide}},\nyear = {2007}\n}\n
\n
\nThis document describes the software package QPME (Queueing Petri net Modeling Environment), a performance modeling and analysis tool based on the Queueing Petri Net (QPN) modeling formalism. QPN models are more sophisticated than conventional queueing networks and stochastic Petri nets and have greater expressive power. This provides a number of important benefits since it makes it possible to model systems at a higher degree of accuracy. QPME is made of two components: QPE (QPN Editor) and SimQPN (Simulator for QPNs). QPE provides a user-friendly graphical tool for modeling using QPNs based on the Eclipse/GEF framework. SimQPN provides an efficient discrete-event simulation engine for QPNs that makes it possible to analyze models of realistically-sized systems. QPME runs on a wide range of platforms including Windows, Linux and Solaris. QPME is developed and maintained by Samuel Kounev and Christofer Dutz.\n
\n','
\n@manual{Ko2007-TUD-QPME_UsersGuide,\n  abstract = {This document describes the software package QPME (Queueing Petri net Modeling Environment), a performance modeling and analysis tool based on the Queueing Petri Net (QPN) modeling formalism. QPN models are more sophisticated than conventional queueing networks and stochastic Petri nets and have greater expressive power. This provides a number of important benefits since it makes it possible to model systems at a higher degree of accuracy. QPME is made of two components: QPE (QPN Editor) and SimQPN (Simulator for QPNs). QPE provides a user-friendly graphical tool for modeling using QPNs based on the Eclipse/GEF framework. SimQPN provides an efficient discrete-event simulation engine for QPNs that makes it possible to analyze models of realistically-sized systems. QPME runs on a wide range of platforms including Windows, Linux and Solaris. QPME is developed and maintained by Samuel Kounev and Christofer Dutz.},\n  address = {Darmstadt, Germany},\n  author = {Samuel Kounev and Christofer Dutz},\n  month = {January},\n  organization = {Technische Universit{\\\"{a}}t Darmstadt},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/305.pdf},\n  title = {{QPME 1.0 User\'s Guide}},\n  year = {2007}\n}\n
\n\n','This document describes the software package QPME (Queueing Petri net Modeling Environment), a performance modeling and analysis tool based on the Queueing Petri Net (QPN) modeling formalism. QPN models are more sophisticated than conventional queueing networks and stochastic Petri nets and have greater expressive power. This provides a number of important benefits since it makes it possible to model systems at a higher degree of accuracy. QPME is made of two components: QPE (QPN Editor) and SimQPN (Simulator for QPNs). QPE provides a user-friendly graphical tool for modeling using QPNs based on the Eclipse/GEF framework. SimQPN provides an efficient discrete-event simulation engine for QPNs that makes it possible to analyze models of realistically-sized systems. QPME runs on a wide range of platforms including Windows, Linux and Solaris. QPME is developed and maintained by Samuel Kounev and Christofer Dutz.','{QPME 1.0 User\'s Guide}',0,1,2007,1,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(306,'paper','KoDuBu2006-QEST-QPME','inproceedings','@inproceedings{KoDuBu2006-QEST-QPME,\n title = {{QPME - Queueing Petri Net Modeling Environment}},\n year = {2006},\n month = {9},\n pages = {115--116},\n abstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. However, currently available tools for modeling and analysis using queueing Petri nets are very limited in terms of the scalability of the analysis algorithms they provide. Moreover, tools are available only on highly specialized platforms unaccessible to most potential users. In this paper, we present QPME - a Queueing Petri Net Modeling Environment that supports the modeling and analysis of systems using queueing Petri nets. QPME runs on a wide range of platforms and provides a powerful simulation engine that can be used to analyze models of realistically-sized systems.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/306.pdf},\n publisher = {IEEE Computer Society},\n address = {Washington, DC, USA},\n booktitle = {Proceedings of the 3rd International Conference on Quantitative Evaluation of SysTems (QEST 2006), Riverside, California, USA, September 11-14, 2006},\n isbn = {0-7695-2665-9},\n doi = {10.1109/QEST.2006.44},\n author = {Kounev, Samuel and Dutz, Christofer and Buchmann, Alejandro},\n}\n\n','\n\nSamuel Kounev, Christofer Dutz, and Alejandro Buchmann.\nQPME - Queueing Petri Net Modeling Environment.\nIn Proceedings of the 3rd International Conference on\nQuantitative Evaluation of SysTems (QEST 2006), Riverside, California, USA,\nSeptember 11-14, 2006, 9 2006, pages 115-116. IEEE Computer Society,\nWashington, DC, USA.\n9 2006.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{KoDuBu2006-QEST-QPME,\ntitle = {{QPME - Queueing Petri Net Modeling Environment}},\nyear = {2006},\nmonth = {9},\npages = {115--116},\nabstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. However, currently available tools for modeling and analysis using queueing Petri nets are very limited in terms of the scalability of the analysis algorithms they provide. Moreover, tools are available only on highly specialized platforms unaccessible to most potential users. In this paper, we present QPME - a Queueing Petri Net Modeling Environment that supports the modeling and analysis of systems using queueing Petri nets. QPME runs on a wide range of platforms and provides a powerful simulation engine that can be used to analyze models of realistically-sized systems.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/306.pdf},\npublisher = {IEEE Computer Society},\naddress = {Washington, DC, USA},\nbooktitle = {Proceedings of the 3rd International Conference on Quantitative Evaluation of SysTems (QEST 2006), Riverside, California, USA, September 11-14, 2006},\nisbn = {0-7695-2665-9},\ndoi = {10.1109/QEST.2006.44},\nauthor = {Kounev, Samuel and Dutz, Christofer and Buchmann, Alejandro}\n}\n
\n
\nQueueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. However, currently available tools for modeling and analysis using queueing Petri nets are very limited in terms of the scalability of the analysis algorithms they provide. Moreover, tools are available only on highly specialized platforms unaccessible to most potential users. In this paper, we present QPME - a Queueing Petri Net Modeling Environment that supports the modeling and analysis of systems using queueing Petri nets. QPME runs on a wide range of platforms and provides a powerful simulation engine that can be used to analyze models of realistically-sized systems.\n
\n','
\n@inproceedings{KoDuBu2006-QEST-QPME,\n  title = {{QPME - Queueing Petri Net Modeling Environment}},\n  year = {2006},\n  month = {9},\n  pages = {115--116},\n  abstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. However, currently available tools for modeling and analysis using queueing Petri nets are very limited in terms of the scalability of the analysis algorithms they provide. Moreover, tools are available only on highly specialized platforms unaccessible to most potential users. In this paper, we present QPME - a Queueing Petri Net Modeling Environment that supports the modeling and analysis of systems using queueing Petri nets. QPME runs on a wide range of platforms and provides a powerful simulation engine that can be used to analyze models of realistically-sized systems.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/306.pdf},\n  publisher = {IEEE Computer Society},\n  address = {Washington, DC, USA},\n  booktitle = {Proceedings of the 3rd International Conference on Quantitative Evaluation of SysTems (QEST 2006), Riverside, California, USA, September 11-14, 2006},\n  isbn = {0-7695-2665-9},\n  doi = {10.1109/QEST.2006.44},\n  author = {Kounev, Samuel and Dutz, Christofer and Buchmann, Alejandro}\n}\n
\n\n','Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. However, currently available tools for modeling and analysis using queueing Petri nets are very limited in terms of the scalability of the analysis algorithms they provide. Moreover, tools are available only on highly specialized platforms unaccessible to most potential users. In this paper, we present QPME - a Queueing Petri Net Modeling Environment that supports the modeling and analysis of systems using queueing Petri nets. QPME runs on a wide range of platforms and provides a powerful simulation engine that can be used to analyze models of realistically-sized systems.','{QPME - Queueing Petri Net Modeling Environment}',0,9,2006,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(307,'paper','KoHuSpBr2012-business-inf-sys','incollection','@incollection{KoHuSpBr2012-business-inf-sys,\n abstract = {{With the increasing adoption of virtualization and the transition towards Cloud Computing platforms, modern business information systems are becoming increasingly complex and dynamic. This raises the challenge of guaranteeing system performance and scalability while at the same time ensuring efficient resource usage. In this paper, we present a historical perspective on the evolution of model-based performance engineering techniques for business information systems focusing on the major developments over the past several decades that have shaped the field. We survey the state-of-the-art on performance modeling and management approaches discussing the ongoing efforts in the community to increasingly bridge the gap between high-level business services and low level performance models. Finally, we wrap up with an outlook on the emergence of self-aware systems engineering as a new research area at the intersection of several computer science disciplines.}},\n address = {Berlin, Heidelberg},\n author = {Samuel Kounev and Nikolaus Huber and Simon Spinner and Fabian Brosig},\n booktitle = {Business Modeling and Software Design},\n editor = {Shishkov, Boris},\n isbn = {978-3-642-29788-5},\n pages = {19--37},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/307.pdf},\n publisher = {Springer-Verlag},\n series = {Lecture Notes in Business Information Processing (LNBIP)},\n title = {Model-based Techniques for Performance Engineering of Business Information Systems},\n url = {http://dx.doi.org/10.1007/978-3-642-29788-5_2},\n volume = {0109},\n year = {2012},\n}\n\n','\n\nSamuel Kounev, Nikolaus Huber, Simon Spinner, and Fabian Brosig.\nModel-based techniques for performance engineering of business\ninformation systems.\nIn Business Modeling and Software Design, Boris Shishkov,\neditor, volume 0109 of Lecture Notes in Business Information Processing\n(LNBIP), pages 19-37. Springer-Verlag, Berlin, Heidelberg, 2012.\n[ bib | http | .pdf | Abstract  ] 
\n@incollection{KoHuSpBr2012-business-inf-sys,\nabstract = {{With the increasing adoption of virtualization and the transition towards Cloud Computing platforms, modern business information systems are becoming increasingly complex and dynamic. This raises the challenge of guaranteeing system performance and scalability while at the same time ensuring efficient resource usage. In this paper, we present a historical perspective on the evolution of model-based performance engineering techniques for business information systems focusing on the major developments over the past several decades that have shaped the field. We survey the state-of-the-art on performance modeling and management approaches discussing the ongoing efforts in the community to increasingly bridge the gap between high-level business services and low level performance models. Finally, we wrap up with an outlook on the emergence of self-aware systems engineering as a new research area at the intersection of several computer science disciplines.}},\naddress = {Berlin, Heidelberg},\nauthor = {Samuel Kounev and Nikolaus Huber and Simon Spinner and Fabian Brosig},\nbooktitle = {Business Modeling and Software Design},\neditor = {Shishkov, Boris},\nisbn = {978-3-642-29788-5},\npages = {19--37},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/307.pdf},\npublisher = {Springer-Verlag},\nseries = {Lecture Notes in Business Information Processing (LNBIP)},\ntitle = {Model-based Techniques for Performance Engineering of Business Information Systems},\nurl = {http://dx.doi.org/10.1007/978-3-642-29788-5_2},\nvolume = {0109},\nyear = {2012}\n}\n
\n
\nWith the increasing adoption of virtualization and the transition towards Cloud Computing platforms, modern business information systems are becoming increasingly complex and dynamic. This raises the challenge of guaranteeing system performance and scalability while at the same time ensuring efficient resource usage. In this paper, we present a historical perspective on the evolution of model-based performance engineering techniques for business information systems focusing on the major developments over the past several decades that have shaped the field. We survey the state-of-the-art on performance modeling and management approaches discussing the ongoing efforts in the community to increasingly bridge the gap between high-level business services and low level performance models. Finally, we wrap up with an outlook on the emergence of self-aware systems engineering as a new research area at the intersection of several computer science disciplines.\n
\n','
\n@incollection{KoHuSpBr2012-business-inf-sys,\n  abstract = {{With the increasing adoption of virtualization and the transition towards Cloud Computing platforms, modern business information systems are becoming increasingly complex and dynamic. This raises the challenge of guaranteeing system performance and scalability while at the same time ensuring efficient resource usage. In this paper, we present a historical perspective on the evolution of model-based performance engineering techniques for business information systems focusing on the major developments over the past several decades that have shaped the field. We survey the state-of-the-art on performance modeling and management approaches discussing the ongoing efforts in the community to increasingly bridge the gap between high-level business services and low level performance models. Finally, we wrap up with an outlook on the emergence of self-aware systems engineering as a new research area at the intersection of several computer science disciplines.}},\n  address = {Berlin, Heidelberg},\n  author = {Samuel Kounev and Nikolaus Huber and Simon Spinner and Fabian Brosig},\n  booktitle = {Business Modeling and Software Design},\n  editor = {Shishkov, Boris},\n  isbn = {978-3-642-29788-5},\n  pages = {19--37},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/307.pdf},\n  publisher = {Springer-Verlag},\n  series = {Lecture Notes in Business Information Processing (LNBIP)},\n  title = {Model-based Techniques for Performance Engineering of Business Information Systems},\n  url = {http://dx.doi.org/10.1007/978-3-642-29788-5_2},\n  volume = {0109},\n  year = {2012}\n}\n
\n\n','{With the increasing adoption of virtualization and the transition towards Cloud Computing platforms, modern business information systems are becoming increasingly complex and dynamic. This raises the challenge of guaranteeing system performance and scalability while at the same time ensuring efficient resource usage. In this paper, we present a historical perspective on the evolution of model-based performance engineering techniques for business information systems focusing on the major developments over the past several decades that have shaped the field. We survey the state-of-the-art on performance modeling and management approaches discussing the ongoing efforts in the community to increasingly bridge the gap between high-level business services and low level performance models. Finally, we wrap up with an outlook on the emergence of self-aware systems engineering as a new research area at the intersection of several computer science disciplines.}','Model-based Techniques for Performance Engineering of Business Information Systems',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(308,'paper','KoNi1999-TOOLS_EE-Analysis_Phase','inproceedings','@inproceedings{KoNi1999-TOOLS_EE-Analysis_Phase,\n author = {Samuel Kounev and Kiril Nikolov},\n booktitle = {Proceedings of the Tools Eastern Europe \'99 Conference on Technology of Object Oriented Languages and Systems, Sofia-Blagoevgrad, Bulgaria, June 1-4, 1999},\n title = {{The Analysis Phase in the Development of E-Commerce Software Systems}},\n year = {1999},\n month = {June},\n}\n\n','\n\nSamuel Kounev and Kiril Nikolov.\nThe Analysis Phase in the Development of E-Commerce Software\nSystems.\nIn Proceedings of the Tools Eastern Europe \'99 Conference on\nTechnology of Object Oriented Languages and Systems, Sofia-Blagoevgrad,\nBulgaria, June 1-4, 1999, June 1999.\n[ bib  ] 
\n@inproceedings{KoNi1999-TOOLS_EE-Analysis_Phase,\nauthor = {Samuel Kounev and Kiril Nikolov},\nbooktitle = {Proceedings of the Tools Eastern Europe \'99 Conference on Technology of Object Oriented Languages and Systems, Sofia-Blagoevgrad, Bulgaria, June 1-4, 1999},\ntitle = {{The Analysis Phase in the Development of E-Commerce Software Systems}},\nyear = {1999},\nmonth = {June}\n}\n
\n
\n','
\n@inproceedings{KoNi1999-TOOLS_EE-Analysis_Phase,\n  author = {Samuel Kounev and Kiril Nikolov},\n  booktitle = {Proceedings of the Tools Eastern Europe \'99 Conference on Technology of Object Oriented Languages and Systems, Sofia-Blagoevgrad, Bulgaria, June 1-4, 1999},\n  title = {{The Analysis Phase in the Development of E-Commerce Software Systems}},\n  year = {1999},\n  month = {June}\n}\n
\n\n',NULL,'{The Analysis Phase in the Development of E-Commerce Software Systems}',0,6,1999,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(309,'paper','KoNoTo2007-UPC-GridAutoQoS','techreport','@techreport{KoNoTo2007-UPC-GridAutoQoS,\n title = {{Using QPN models for QoS Control in Grid Middleware}},\n year = {2007},\n month = {April},\n number = {UPC-DAC-RR-CAP-2007-4},\n institution = {Computer Architecture Department, Technical University of Catalonia (UPC), Spain},\n author = {Kounev, Samuel and Nou, Ramon and Torres, Jordi},\n}\n\n','\n\nSamuel Kounev, Ramon Nou, and Jordi Torres.\nUsing QPN models for QoS Control in Grid Middleware.\nTechnical Report UPC-DAC-RR-CAP-2007-4, Computer Architecture\nDepartment, Technical University of Catalonia (UPC), Spain, April 2007.\n[ bib  ] 
\n@techreport{KoNoTo2007-UPC-GridAutoQoS,\ntitle = {{Using QPN models for QoS Control in Grid Middleware}},\nyear = {2007},\nmonth = {April},\nnumber = {UPC-DAC-RR-CAP-2007-4},\ninstitution = {Computer Architecture Department, Technical University of Catalonia (UPC), Spain},\nauthor = {Kounev, Samuel and Nou, Ramon and Torres, Jordi}\n}\n
\n
\n','
\n@techreport{KoNoTo2007-UPC-GridAutoQoS,\n  title = {{Using QPN models for QoS Control in Grid Middleware}},\n  year = {2007},\n  month = {April},\n  number = {UPC-DAC-RR-CAP-2007-4},\n  institution = {Computer Architecture Department, Technical University of Catalonia (UPC), Spain},\n  author = {Kounev, Samuel and Nou, Ramon and Torres, Jordi}\n}\n
\n\n',NULL,'{Using QPN models for QoS Control in Grid Middleware}',0,4,2007,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(310,'paper','KoNoTo2007-VALUETOOLS-GridAuton_QoS_Control','inproceedings','@inproceedings{KoNoTo2007-VALUETOOLS-GridAuton_QoS_Control,\n title = {{Autonomic QoS-Aware Resource Management in Grid Computing using Online Performance Models}},\n year = {2007},\n pages = {1--10},\n abstract = {As Grid Computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. The inherent complexity, heterogeneity and dynamics of Grid computing environments pose some challenges in managing their capacity to ensure that QoS requirements are continuously met. In this paper, an approach to autonomic QoS-aware resource management in Grid computing based on online performance models is proposed. The paper presents a novel methodology for designing autonomic QoS-aware resource managers that have the capability to predict the performance of the Grid components they manage and allocate resources in such a way that service level agreements are honored. The goal is to make the Grid middleware self-configurable and adaptable to changes in the system environment and workload. The approach is subjected to an extensive experimental evaluation in the context of a real-world Grid environment and its effectiveness, practicality and performance are demonstrated.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/310.pdf},\n publisher = {ICST},\n address = {Brussels, Belgium},\n booktitle = {Proceedings of the Second International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2007), Nantes, France, October 23-25, 2007},\n isbn = {978-963-9799-00-4},\n doi = {10.1145/1345263.1345325},\n author = {Kounev, Samuel and Nou, Ramon and Torres, Jordi},\n}\n\n','\n\nSamuel Kounev, Ramon Nou, and Jordi Torres.\nAutonomic QoS-Aware Resource Management in Grid Computing using\nOnline Performance Models.\nIn Proceedings of the Second International Conference on\nPerformance Evaluation Methodologies and Tools (VALUETOOLS 2007), Nantes,\nFrance, October 23-25, 2007, 2007, pages 1-10. ICST, Brussels, Belgium.\n2007.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{KoNoTo2007-VALUETOOLS-GridAuton_QoS_Control,\ntitle = {{Autonomic QoS-Aware Resource Management in Grid Computing using Online Performance Models}},\nyear = {2007},\npages = {1--10},\nabstract = {As Grid Computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. The inherent complexity, heterogeneity and dynamics of Grid computing environments pose some challenges in managing their capacity to ensure that QoS requirements are continuously met. In this paper, an approach to autonomic QoS-aware resource management in Grid computing based on online performance models is proposed. The paper presents a novel methodology for designing autonomic QoS-aware resource managers that have the capability to predict the performance of the Grid components they manage and allocate resources in such a way that service level agreements are honored. The goal is to make the Grid middleware self-configurable and adaptable to changes in the system environment and workload. The approach is subjected to an extensive experimental evaluation in the context of a real-world Grid environment and its effectiveness, practicality and performance are demonstrated.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/310.pdf},\npublisher = {ICST},\naddress = {Brussels, Belgium},\nbooktitle = {Proceedings of the Second International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2007), Nantes, France, October 23-25, 2007},\nisbn = {978-963-9799-00-4},\ndoi = {10.1145/1345263.1345325},\nauthor = {Kounev, Samuel and Nou, Ramon and Torres, Jordi}\n}\n
\n
\nAs Grid Computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. The inherent complexity, heterogeneity and dynamics of Grid computing environments pose some challenges in managing their capacity to ensure that QoS requirements are continuously met. In this paper, an approach to autonomic QoS-aware resource management in Grid computing based on online performance models is proposed. The paper presents a novel methodology for designing autonomic QoS-aware resource managers that have the capability to predict the performance of the Grid components they manage and allocate resources in such a way that service level agreements are honored. The goal is to make the Grid middleware self-configurable and adaptable to changes in the system environment and workload. The approach is subjected to an extensive experimental evaluation in the context of a real-world Grid environment and its effectiveness, practicality and performance are demonstrated.\n
\n','
\n@inproceedings{KoNoTo2007-VALUETOOLS-GridAuton_QoS_Control,\n  title = {{Autonomic QoS-Aware Resource Management in Grid Computing using Online Performance Models}},\n  year = {2007},\n  pages = {1--10},\n  abstract = {As Grid Computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. The inherent complexity, heterogeneity and dynamics of Grid computing environments pose some challenges in managing their capacity to ensure that QoS requirements are continuously met. In this paper, an approach to autonomic QoS-aware resource management in Grid computing based on online performance models is proposed. The paper presents a novel methodology for designing autonomic QoS-aware resource managers that have the capability to predict the performance of the Grid components they manage and allocate resources in such a way that service level agreements are honored. The goal is to make the Grid middleware self-configurable and adaptable to changes in the system environment and workload. The approach is subjected to an extensive experimental evaluation in the context of a real-world Grid environment and its effectiveness, practicality and performance are demonstrated.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/310.pdf},\n  publisher = {ICST},\n  address = {Brussels, Belgium},\n  booktitle = {Proceedings of the Second International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2007), Nantes, France, October 23-25, 2007},\n  isbn = {978-963-9799-00-4},\n  doi = {10.1145/1345263.1345325},\n  author = {Kounev, Samuel and Nou, Ramon and Torres, Jordi}\n}\n
\n\n','As Grid Computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. The inherent complexity, heterogeneity and dynamics of Grid computing environments pose some challenges in managing their capacity to ensure that QoS requirements are continuously met. In this paper, an approach to autonomic QoS-aware resource management in Grid computing based on online performance models is proposed. The paper presents a novel methodology for designing autonomic QoS-aware resource managers that have the capability to predict the performance of the Grid components they manage and allocate resources in such a way that service level agreements are honored. The goal is to make the Grid middleware self-configurable and adaptable to changes in the system environment and workload. The approach is subjected to an extensive experimental evaluation in the context of a real-world Grid environment and its effectiveness, practicality and performance are demonstrated.','{Autonomic QoS-Aware Resource Management in Grid Computing using Online Performance Models}',0,0,2007,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(311,'paper','KoRaKl2012-FESCA-Keynote','article','@article{KoRaKl2012-FESCA-Keynote,\n abstract = {Event-based communication is used in different domains including telecommunications, transportation, and business information systems to build scalable distributed systems. Such systems typically have stringent requirements for performance and scalability as they provide business and mission critical services. While the use of event-based communication enables loosely-coupled interactions between components and leads to improved system scalability, it makes it much harder for developers to estimate the system\'s behavior and performance under load due to the decoupling of components and control flow. We present an overview on our approach enabling the modeling and performance prediction of event-based system at the architecture level. Applying a model-to-model transformation, our approach integrates platform-specific performance influences of the underlying middleware while enabling the use of different existing analytical and simulation-based prediction techniques. The results of two real world case studies demonstrate the effectiveness, practicability and accuracy of the proposed modeling and prediction approach.},\n address = {Amsterdam, The Netherlands},\n author = {Samuel Kounev and Christoph Rathfelder and Benjamin Klatt},\n day = {9},\n issn = {1571-0661},\n journal = {{Electronic Notes in Theoretical Computer Science (ENTCS)}},\n month = {May},\n pages = {3--9},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/311.pdf},\n publisher = {Elsevier Science Publishers B. V.},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/311},\n title = {{Modeling of Event-based Communication in Component-based Architectures: State-of-the-Art and Future Directions}},\n url = {http://www.sciencedirect.com/science/article/pii/S1571066113000248},\n volume = {295},\n year = {2013},\n}\n\n','\n\nSamuel Kounev, Christoph Rathfelder, and Benjamin Klatt.\nModeling of Event-based Communication in Component-based\nArchitectures: State-of-the-Art and Future Directions.\nElectronic Notes in Theoretical Computer Science (ENTCS),\n295:3-9, May 2013, Elsevier Science Publishers B. V., Amsterdam, The\nNetherlands.\n[ bib | slides | http | .pdf | Abstract  ] 
\n@article{KoRaKl2012-FESCA-Keynote,\nabstract = {Event-based communication is used in different domains including telecommunications, transportation, and business information systems to build scalable distributed systems. Such systems typically have stringent requirements for performance and scalability as they provide business and mission critical services. While the use of event-based communication enables loosely-coupled interactions between components and leads to improved system scalability, it makes it much harder for developers to estimate the system\'s behavior and performance under load due to the decoupling of components and control flow. We present an overview on our approach enabling the modeling and performance prediction of event-based system at the architecture level. Applying a model-to-model transformation, our approach integrates platform-specific performance influences of the underlying middleware while enabling the use of different existing analytical and simulation-based prediction techniques. The results of two real world case studies demonstrate the effectiveness, practicability and accuracy of the proposed modeling and prediction approach.},\naddress = {Amsterdam, The Netherlands},\nauthor = {Samuel Kounev and Christoph Rathfelder and Benjamin Klatt},\nday = {9},\nissn = {1571-0661},\njournal = {{Electronic Notes in Theoretical Computer Science (ENTCS)}},\nmonth = {May},\npages = {3--9},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/311.pdf},\npublisher = {Elsevier Science Publishers B. V.},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/311},\ntitle = {{Modeling of Event-based Communication in Component-based Architectures: State-of-the-Art and Future Directions}},\nurl = {http://www.sciencedirect.com/science/article/pii/S1571066113000248},\nvolume = {295},\nyear = {2013}\n}\n
\n
\nEvent-based communication is used in different domains including telecommunications, transportation, and business information systems to build scalable distributed systems. Such systems typically have stringent requirements for performance and scalability as they provide business and mission critical services. While the use of event-based communication enables loosely-coupled interactions between components and leads to improved system scalability, it makes it much harder for developers to estimate the system\'s behavior and performance under load due to the decoupling of components and control flow. We present an overview on our approach enabling the modeling and performance prediction of event-based system at the architecture level. Applying a model-to-model transformation, our approach integrates platform-specific performance influences of the underlying middleware while enabling the use of different existing analytical and simulation-based prediction techniques. The results of two real world case studies demonstrate the effectiveness, practicability and accuracy of the proposed modeling and prediction approach.\n
\n','
\n@article{KoRaKl2012-FESCA-Keynote,\n  abstract = {Event-based communication is used in different domains including telecommunications, transportation, and business information systems to build scalable distributed systems. Such systems typically have stringent requirements for performance and scalability as they provide business and mission critical services. While the use of event-based communication enables loosely-coupled interactions between components and leads to improved system scalability, it makes it much harder for developers to estimate the system\'s behavior and performance under load due to the decoupling of components and control flow. We present an overview on our approach enabling the modeling and performance prediction of event-based system at the architecture level. Applying a model-to-model transformation, our approach integrates platform-specific performance influences of the underlying middleware while enabling the use of different existing analytical and simulation-based prediction techniques. The results of two real world case studies demonstrate the effectiveness, practicability and accuracy of the proposed modeling and prediction approach.},\n  address = {Amsterdam, The Netherlands},\n  author = {Samuel Kounev and Christoph Rathfelder and Benjamin Klatt},\n  day = {9},\n  issn = {1571-0661},\n  journal = {{Electronic Notes in Theoretical Computer Science (ENTCS)}},\n  month = {May},\n  pages = {3--9},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/311.pdf},\n  publisher = {Elsevier Science Publishers B. V.},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/311},\n  title = {{Modeling of Event-based Communication in Component-based Architectures: State-of-the-Art and Future Directions}},\n  url = {http://www.sciencedirect.com/science/article/pii/S1571066113000248},\n  volume = {295},\n  year = {2013}\n}\n
\n\n','Event-based communication is used in different domains including telecommunications, transportation, and business information systems to build scalable distributed systems. Such systems typically have stringent requirements for performance and scalability as they provide business and mission critical services. While the use of event-based communication enables loosely-coupled interactions between components and leads to improved system scalability, it makes it much harder for developers to estimate the system\'s behavior and performance under load due to the decoupling of components and control flow. We present an overview on our approach enabling the modeling and performance prediction of event-based system at the architecture level. Applying a model-to-model transformation, our approach integrates platform-specific performance influences of the underlying middleware while enabling the use of different existing analytical and simulation-based prediction techniques. The results of two real world case studies demonstrate the effectiveness, practicability and accuracy of the proposed modeling and prediction approach.','{Modeling of Event-based Communication in Component-based Architectures: State-of-the-Art and Future Directions}',0,5,2013,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(312,'paper','KoReBrBrJoBaStGi2012-ResBook-CloudChallenges','incollection','@incollection{KoReBrBrJoBaStGi2012-ResBook-CloudChallenges,\n abstract = {{Cloud Computing is a novel paradigm for providing data center resources as on demand services in a pay-as-you-go manner. It promises significant cost savings by making it possible to consolidate workloads and share infrastructure resources among multiple applications resulting in higher cost- and energy-efficiency. However, these benefits come at the cost of increased system complexity and dynamicity posing new challenges in providing service dependability and resilience for applications running in a Cloud environment. At the same time, the virtualization of physical resources, inherent in Cloud Computing, provides new opportunities for novel dependability and quality-of-service management techniques that can potentially improve system resilience. In this chapter, we first discuss in detail the challenges and opportunities introduced by the Cloud Computing paradigm. We then provide a review of the state-of-the-art on dependability and resilience management in Cloud environments, and conclude with an overview of emerging research directions.}},\n address = {Berlin, Heidelberg},\n author = {Samuel Kounev and Philipp Reinecke and Fabian Brosig and Jeremy T. Bradley and Kaustubh Joshi and Vlastimil Babka and Anton Stefanek and Stephen Gilmore},\n booktitle = {Resilience Assessment and Evaluation of Computing Systems},\n editor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\n isbn = {978-3-642-29031-2},\n note = {ISBN: 978-3-642-29031-2},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/312.pdf},\n publisher = {Springer-Verlag},\n series = {XVIII},\n title = {Providing Dependability and Resilience in the Cloud: Challenges and Opportunities},\n url = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\n year = {2012},\n}\n\n','\n\nSamuel Kounev, Philipp Reinecke, Fabian Brosig, Jeremy T. Bradley, Kaustubh\nJoshi, Vlastimil Babka, Anton Stefanek, and Stephen Gilmore.\nProviding dependability and resilience in the cloud: Challenges and\nopportunities.\nIn Resilience Assessment and Evaluation of Computing Systems,\nK. Wolter, A. Avritzer, M. Vieira, and A. van Moorsel, editors, XVIII.\nSpringer-Verlag, Berlin, Heidelberg, 2012.\nISBN: 978-3-642-29031-2.\n[ bib | http | .pdf | Abstract  ] 
\n@incollection{KoReBrBrJoBaStGi2012-ResBook-CloudChallenges,\nabstract = {{Cloud Computing is a novel paradigm for providing data center resources as on demand services in a pay-as-you-go manner. It promises significant cost savings by making it possible to consolidate workloads and share infrastructure resources among multiple applications resulting in higher cost- and energy-efficiency. However, these benefits come at the cost of increased system complexity and dynamicity posing new challenges in providing service dependability and resilience for applications running in a Cloud environment. At the same time, the virtualization of physical resources, inherent in Cloud Computing, provides new opportunities for novel dependability and quality-of-service management techniques that can potentially improve system resilience. In this chapter, we first discuss in detail the challenges and opportunities introduced by the Cloud Computing paradigm. We then provide a review of the state-of-the-art on dependability and resilience management in Cloud environments, and conclude with an overview of emerging research directions.}},\naddress = {Berlin, Heidelberg},\nauthor = {Samuel Kounev and Philipp Reinecke and Fabian Brosig and Jeremy T. Bradley and Kaustubh Joshi and Vlastimil Babka and Anton Stefanek and Stephen Gilmore},\nbooktitle = {Resilience Assessment and Evaluation of Computing Systems},\neditor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\nisbn = {978-3-642-29031-2},\nnote = {ISBN: 978-3-642-29031-2},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/312.pdf},\npublisher = {Springer-Verlag},\nseries = {XVIII},\ntitle = {Providing Dependability and Resilience in the Cloud: Challenges and Opportunities},\nurl = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\nyear = {2012}\n}\n
\n
\nCloud Computing is a novel paradigm for providing data center resources as on demand services in a pay-as-you-go manner. It promises significant cost savings by making it possible to consolidate workloads and share infrastructure resources among multiple applications resulting in higher cost- and energy-efficiency. However, these benefits come at the cost of increased system complexity and dynamicity posing new challenges in providing service dependability and resilience for applications running in a Cloud environment. At the same time, the virtualization of physical resources, inherent in Cloud Computing, provides new opportunities for novel dependability and quality-of-service management techniques that can potentially improve system resilience. In this chapter, we first discuss in detail the challenges and opportunities introduced by the Cloud Computing paradigm. We then provide a review of the state-of-the-art on dependability and resilience management in Cloud environments, and conclude with an overview of emerging research directions.\n
\n','
\n@incollection{KoReBrBrJoBaStGi2012-ResBook-CloudChallenges,\n  abstract = {{Cloud Computing is a novel paradigm for providing data center resources as on demand services in a pay-as-you-go manner. It promises significant cost savings by making it possible to consolidate workloads and share infrastructure resources among multiple applications resulting in higher cost- and energy-efficiency. However, these benefits come at the cost of increased system complexity and dynamicity posing new challenges in providing service dependability and resilience for applications running in a Cloud environment. At the same time, the virtualization of physical resources, inherent in Cloud Computing, provides new opportunities for novel dependability and quality-of-service management techniques that can potentially improve system resilience. In this chapter, we first discuss in detail the challenges and opportunities introduced by the Cloud Computing paradigm. We then provide a review of the state-of-the-art on dependability and resilience management in Cloud environments, and conclude with an overview of emerging research directions.}},\n  address = {Berlin, Heidelberg},\n  author = {Samuel Kounev and Philipp Reinecke and Fabian Brosig and Jeremy T. Bradley and Kaustubh Joshi and Vlastimil Babka and Anton Stefanek and Stephen Gilmore},\n  booktitle = {Resilience Assessment and Evaluation of Computing Systems},\n  editor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\n  isbn = {978-3-642-29031-2},\n  note = {ISBN: 978-3-642-29031-2},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/312.pdf},\n  publisher = {Springer-Verlag},\n  series = {XVIII},\n  title = {Providing Dependability and Resilience in the Cloud: Challenges and Opportunities},\n  url = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\n  year = {2012}\n}\n
\n\n','{Cloud Computing is a novel paradigm for providing data center resources as on demand services in a pay-as-you-go manner. It promises significant cost savings by making it possible to consolidate workloads and share infrastructure resources among multiple applications resulting in higher cost- and energy-efficiency. However, these benefits come at the cost of increased system complexity and dynamicity posing new challenges in providing service dependability and resilience for applications running in a Cloud environment. At the same time, the virtualization of physical resources, inherent in Cloud Computing, provides new opportunities for novel dependability and quality-of-service management techniques that can potentially improve system resilience. In this chapter, we first discuss in detail the challenges and opportunities introduced by the Cloud Computing paradigm. We then provide a review of the state-of-the-art on dependability and resilience management in Cloud environments, and conclude with an overview of emerging research directions.}','Providing Dependability and Resilience in the Cloud: Challenges and Opportunities',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(313,'paper','Ko2013-HotTopiCS-Relate','inproceedings','@inproceedings{Ko2013-HotTopiCS-Relate,\n author = {Samuel Kounev and Stamatia Rizou and Steffen Zschaler and Spiros Alexakis and Tomas Bures and Jean-Marc J{\\\'e}z{\\\'e}quel and Dimitrios Kourtesis and Stelios Pantelopoulos},\n booktitle = {International Workshop on Hot Topics in Cloud Services (HotTopiCS 2013)},\n day = {20--21},\n location = {Prague, Czech Republic},\n month = {April},\n title = {{RELATE: A Research Training Network on Engineering and Provisioning of Service-Based Cloud Applications}},\n year = {2013},\n}\n\n','\n\nSamuel Kounev, Stamatia Rizou, Steffen Zschaler, Spiros Alexakis, Tomas Bures,\nJean-Marc Jézéquel, Dimitrios Kourtesis, and Stelios Pantelopoulos.\nRELATE: A Research Training Network on Engineering and Provisioning\nof Service-Based Cloud Applications.\nIn International Workshop on Hot Topics in Cloud Services\n(HotTopiCS 2013), Prague, Czech Republic, April 20-21, 2013.\n[ bib  ] 
\n@inproceedings{Ko2013-HotTopiCS-Relate,\nauthor = {Samuel Kounev and Stamatia Rizou and Steffen Zschaler and Spiros Alexakis and Tomas Bures and Jean-Marc J{\\\'e}z{\\\'e}quel and Dimitrios Kourtesis and Stelios Pantelopoulos},\nbooktitle = {International Workshop on Hot Topics in Cloud Services (HotTopiCS 2013)},\nday = {20--21},\nlocation = {Prague, Czech Republic},\nmonth = {April},\ntitle = {{RELATE: A Research Training Network on Engineering and Provisioning of Service-Based Cloud Applications}},\nyear = {2013}\n}\n
\n
\n','
\n@inproceedings{Ko2013-HotTopiCS-Relate,\n  author = {Samuel Kounev and Stamatia Rizou and Steffen Zschaler and Spiros Alexakis and Tomas Bures and Jean-Marc J{\\\'e}z{\\\'e}quel and Dimitrios Kourtesis and Stelios Pantelopoulos},\n  booktitle = {International Workshop on Hot Topics in Cloud Services (HotTopiCS 2013)},\n  day = {20--21},\n  location = {Prague, Czech Republic},\n  month = {April},\n  title = {{RELATE: A Research Training Network on Engineering and Provisioning of Service-Based Cloud Applications}},\n  year = {2013}\n}\n
\n\n',NULL,'{RELATE: A Research Training Network on Engineering and Provisioning of Service-Based Cloud Applications}',0,4,2013,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(315,'paper','kounev2008b','misc','@misc{kounev2008b,\n author = {Samuel Kounev and Kai Sachs},\n howpublished = {DEV2DEV Article, O\'Reilly Publishing Group},\n month = {March},\n title = {{SPECjms2007: A Novel Benchmark and Performance Analysis Framework for Message-Oriented Middleware}},\n url = {http://www.oracle.com/technology/pub/articles/dev2arch/2008/03/specjms2007.html},\n year = {2008},\n}\n\n','\n\nSamuel Kounev and Kai Sachs.\nSPECjms2007: A Novel Benchmark and Performance Analysis Framework\nfor Message-Oriented Middleware.\nDEV2DEV Article, O\'Reilly Publishing Group, March 2008.\n[ bib | .html  ] 
\n@misc{kounev2008b,\nauthor = {Samuel Kounev and Kai Sachs},\nhowpublished = {DEV2DEV Article, O\'Reilly Publishing Group},\nmonth = {March},\ntitle = {{SPECjms2007: A Novel Benchmark and Performance Analysis Framework for Message-Oriented Middleware}},\nurl = {http://www.oracle.com/technology/pub/articles/dev2arch/2008/03/specjms2007.html},\nyear = {2008}\n}\n
\n
\n','
\n@misc{kounev2008b,\n  author = {Samuel Kounev and Kai Sachs},\n  howpublished = {DEV2DEV Article, O\'Reilly Publishing Group},\n  month = {March},\n  title = {{SPECjms2007: A Novel Benchmark and Performance Analysis Framework for Message-Oriented Middleware}},\n  url = {http://www.oracle.com/technology/pub/articles/dev2arch/2008/03/specjms2007.html},\n  year = {2008}\n}\n
\n\n',NULL,'{SPECjms2007: A Novel Benchmark and Performance Analysis Framework for Message-Oriented Middleware}',0,3,2008,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(316,'paper','KoSaBaBu2008-ISORC-ModelingDEBS','inproceedings','@inproceedings{KoSaBaBu2008-ISORC-ModelingDEBS,\n abstract = {Distributed event-based systems (DEBS) are gaining increasing attention in new application areas such as transport information monitoring, event-driven supply-chain management and ubiquitous sensor-rich environments. However, as DEBS increasingly enter the enterprise and commercial domains, performance and quality of service issues are becoming a major concern. While numerous approaches to performance modeling and evaluation of conventional request/reply-based distributed systems are available in the literature, no general approach exists for DEBS. This paper is the first to provide a comprehensive methodology for workload characterization and performance modeling of DEBS. A workload model of a generic DEBS is developed and operational analysis techniques are used to characterize the system traffic and derive an approximation for the mean event delivery latency. Following this, a modeling technique is presented that can be used for accurate performance prediction. The paper is concluded with a case study of a real life system demonstrating the effectiveness and practicality of the proposed approach.},\n address = {Washington, DC, USA},\n author = {Samuel Kounev and Kai Sachs and Jean Bacon and Alejandro Buchmann},\n booktitle = {Proceedings of the 11th IEEE International Symposium on Object Oriented Real-Time Distributed Computing (ISORC 2008), Orlando, Florida, USA, May 5-7, 2008},\n doi = {10.1109/ISORC.2008.51},\n isbn = {978-0-7695-3132-8},\n note = {Acceptance Rate (Full Paper): 30\\%, Best-Paper-Award-Nomination},\n pages = {13--22},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/316.pdf},\n publisher = {IEEE Computer Society},\n title = {{A Methodology for Performance Modeling of Distributed Event-Based Systems}},\n year = {2008},\n}\n\n','\n\nSamuel Kounev, Kai Sachs, Jean Bacon, and Alejandro Buchmann.\nA Methodology for Performance Modeling of Distributed Event-Based\nSystems.\nIn Proceedings of the 11th IEEE International Symposium on\nObject Oriented Real-Time Distributed Computing (ISORC 2008), Orlando,\nFlorida, USA, May 5-7, 2008, 2008, pages 13-22. IEEE Computer Society,\nWashington, DC, USA.\n2008, Acceptance Rate (Full Paper): 30%,\nBest-Paper-Award-Nomination.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{KoSaBaBu2008-ISORC-ModelingDEBS,\nabstract = {Distributed event-based systems (DEBS) are gaining increasing attention in new application areas such as transport information monitoring, event-driven supply-chain management and ubiquitous sensor-rich environments. However, as DEBS increasingly enter the enterprise and commercial domains, performance and quality of service issues are becoming a major concern. While numerous approaches to performance modeling and evaluation of conventional request/reply-based distributed systems are available in the literature, no general approach exists for DEBS. This paper is the first to provide a comprehensive methodology for workload characterization and performance modeling of DEBS. A workload model of a generic DEBS is developed and operational analysis techniques are used to characterize the system traffic and derive an approximation for the mean event delivery latency. Following this, a modeling technique is presented that can be used for accurate performance prediction. The paper is concluded with a case study of a real life system demonstrating the effectiveness and practicality of the proposed approach.},\naddress = {Washington, DC, USA},\nauthor = {Samuel Kounev and Kai Sachs and Jean Bacon and Alejandro Buchmann},\nbooktitle = {Proceedings of the 11th IEEE International Symposium on Object Oriented Real-Time Distributed Computing (ISORC 2008), Orlando, Florida, USA, May 5-7, 2008},\ndoi = {10.1109/ISORC.2008.51},\nisbn = {978-0-7695-3132-8},\nnote = {Acceptance Rate (Full Paper): 30\\%, Best-Paper-Award-Nomination},\npages = {13--22},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/316.pdf},\npublisher = {IEEE Computer Society},\ntitle = {{A Methodology for Performance Modeling of Distributed Event-Based Systems}},\nyear = {2008}\n}\n
\n
\nDistributed event-based systems (DEBS) are gaining increasing attention in new application areas such as transport information monitoring, event-driven supply-chain management and ubiquitous sensor-rich environments. However, as DEBS increasingly enter the enterprise and commercial domains, performance and quality of service issues are becoming a major concern. While numerous approaches to performance modeling and evaluation of conventional request/reply-based distributed systems are available in the literature, no general approach exists for DEBS. This paper is the first to provide a comprehensive methodology for workload characterization and performance modeling of DEBS. A workload model of a generic DEBS is developed and operational analysis techniques are used to characterize the system traffic and derive an approximation for the mean event delivery latency. Following this, a modeling technique is presented that can be used for accurate performance prediction. The paper is concluded with a case study of a real life system demonstrating the effectiveness and practicality of the proposed approach.\n
\n','
\n@inproceedings{KoSaBaBu2008-ISORC-ModelingDEBS,\n  abstract = {Distributed event-based systems (DEBS) are gaining increasing attention in new application areas such as transport information monitoring, event-driven supply-chain management and ubiquitous sensor-rich environments. However, as DEBS increasingly enter the enterprise and commercial domains, performance and quality of service issues are becoming a major concern. While numerous approaches to performance modeling and evaluation of conventional request/reply-based distributed systems are available in the literature, no general approach exists for DEBS. This paper is the first to provide a comprehensive methodology for workload characterization and performance modeling of DEBS. A workload model of a generic DEBS is developed and operational analysis techniques are used to characterize the system traffic and derive an approximation for the mean event delivery latency. Following this, a modeling technique is presented that can be used for accurate performance prediction. The paper is concluded with a case study of a real life system demonstrating the effectiveness and practicality of the proposed approach.},\n  address = {Washington, DC, USA},\n  author = {Samuel Kounev and Kai Sachs and Jean Bacon and Alejandro Buchmann},\n  booktitle = {Proceedings of the 11th IEEE International Symposium on Object Oriented Real-Time Distributed Computing (ISORC 2008), Orlando, Florida, USA, May 5-7, 2008},\n  doi = {10.1109/ISORC.2008.51},\n  isbn = {978-0-7695-3132-8},\n  note = {Acceptance Rate (Full Paper): 30\\%, Best-Paper-Award-Nomination},\n  pages = {13--22},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/316.pdf},\n  publisher = {IEEE Computer Society},\n  title = {{A Methodology for Performance Modeling of Distributed Event-Based Systems}},\n  year = {2008}\n}\n
\n\n','Distributed event-based systems (DEBS) are gaining increasing attention in new application areas such as transport information monitoring, event-driven supply-chain management and ubiquitous sensor-rich environments. However, as DEBS increasingly enter the enterprise and commercial domains, performance and quality of service issues are becoming a major concern. While numerous approaches to performance modeling and evaluation of conventional request/reply-based distributed systems are available in the literature, no general approach exists for DEBS. This paper is the first to provide a comprehensive methodology for workload characterization and performance modeling of DEBS. A workload model of a generic DEBS is developed and operational analysis techniques are used to characterize the system traffic and derive an approximation for the mean event delivery latency. Following this, a modeling technique is presented that can be used for accurate performance prediction. The paper is concluded with a case study of a real life system demonstrating the effectiveness and practicality of the proposed approach.','{A Methodology for Performance Modeling of Distributed Event-Based Systems}',0,0,2008,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(317,'paper','KoSp2011-QPME20-UserGuide','manual','@manual{KoSp2011-QPME20-UserGuide,\n title = {QPME 2.0 User\'s Guide},\n year = {2011},\n month = {5},\n pdf = {http://descartes.ipd.kit.edu/fileadmin/user_upload/descartes/QPME/QPME-UsersGuide.pdf},\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n organization = {Karlsruhe Institute of Technology},\n author = {Kounev, Samuel and Spinner, Simon and J\\\"{u}rgen Walter},\n}\n\n','\n\nSamuel Kounev, Simon Spinner, and Jürgen Walter.\nQPME 2.0 User\'s Guide.\nKarlsruhe Institute of Technology, Am Fasanengarten 5, 76131\nKarlsruhe, Germany, 5 2011.\n[ bib | .pdf  ] 
\n@manual{KoSp2011-QPME20-UserGuide,\ntitle = {QPME 2.0 User\'s Guide},\nyear = {2011},\nmonth = {5},\npdf = {http://descartes.ipd.kit.edu/fileadmin/user_upload/descartes/QPME/QPME-UsersGuide.pdf},\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\norganization = {Karlsruhe Institute of Technology},\nauthor = {Kounev, Samuel and Spinner, Simon and J\\\"{u}rgen Walter}\n}\n
\n
\n','
\n@manual{KoSp2011-QPME20-UserGuide,\n  title = {QPME 2.0 User\'s Guide},\n  year = {2011},\n  month = {5},\n  pdf = {http://descartes.ipd.kit.edu/fileadmin/user_upload/descartes/QPME/QPME-UsersGuide.pdf},\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  organization = {Karlsruhe Institute of Technology},\n  author = {Kounev, Samuel and Spinner, Simon and J\\\"{u}rgen Walter}\n}\n
\n\n',NULL,'QPME 2.0 User\'s Guide',0,5,2011,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(318,'paper','KoSpMe2010-Festschrift-QPME2','incollection','@incollection{KoSpMe2010-Festschrift-QPME2,\n title = {{QPME 2.0 - A Tool for Stochastic Modeling and Analysis Using Queueing Petri Nets}},\n year = {2010},\n volume = {6462},\n pages = {293--311},\n editor = {Sachs, Kai and Petrov, Ilia and Guerrero, Pablo},\n publisher = {Springer-Verlag},\n address = {Berlin, Heidelberg},\n series = {Lecture Notes in Computer Science},\n booktitle = {From Active Data Management to Event-Based Systems and More},\n isbn = {978-3-642-17225-0},\n doi = {10.1007/978-3-642-17226-7_18},\n author = {Kounev, Samuel and Spinner, Simon and Meier, Philipp},\n}\n\n','\n\nSamuel Kounev, Simon Spinner, and Philipp Meier.\nQPME 2.0 - A Tool for Stochastic Modeling and Analysis Using\nQueueing Petri Nets.\nIn From Active Data Management to Event-Based Systems and More,\nKai Sachs, Ilia Petrov, and Pablo Guerrero, editors, volume 6462 of \nLecture Notes in Computer Science, pages 293-311. Springer-Verlag, Berlin,\nHeidelberg, 2010.\n[ bib | DOI  ] 
\n@incollection{KoSpMe2010-Festschrift-QPME2,\ntitle = {{QPME 2.0 - A Tool for Stochastic Modeling and Analysis Using Queueing Petri Nets}},\nyear = {2010},\nvolume = {6462},\npages = {293--311},\neditor = {Sachs, Kai and Petrov, Ilia and Guerrero, Pablo},\npublisher = {Springer-Verlag},\naddress = {Berlin, Heidelberg},\nseries = {Lecture Notes in Computer Science},\nbooktitle = {From Active Data Management to Event-Based Systems and More},\nisbn = {978-3-642-17225-0},\ndoi = {10.1007/978-3-642-17226-7_18},\nauthor = {Kounev, Samuel and Spinner, Simon and Meier, Philipp}\n}\n
\n
\n','
\n@incollection{KoSpMe2010-Festschrift-QPME2,\n  title = {{QPME 2.0 - A Tool for Stochastic Modeling and Analysis Using Queueing Petri Nets}},\n  year = {2010},\n  volume = {6462},\n  pages = {293--311},\n  editor = {Sachs, Kai and Petrov, Ilia and Guerrero, Pablo},\n  publisher = {Springer-Verlag},\n  address = {Berlin, Heidelberg},\n  series = {Lecture Notes in Computer Science},\n  booktitle = {From Active Data Management to Event-Based Systems and More},\n  isbn = {978-3-642-17225-0},\n  doi = {10.1007/978-3-642-17226-7_18},\n  author = {Kounev, Samuel and Spinner, Simon and Meier, Philipp}\n}\n
\n\n',NULL,'{QPME 2.0 - A Tool for Stochastic Modeling and Analysis Using Queueing Petri Nets}',0,0,2010,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(319,'paper','KoSpMe2012-icpe-QPME_Tutorial','inproceedings','@inproceedings{KoSpMe2012-icpe-QPME_Tutorial,\n title = {Introduction to Queueing Petri Nets: Modeling Formalism, Tool Support and Case Studies (Tutorial Paper)},\n year = {2012},\n month = {4},\n pages = {9--18},\n abstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and evaluating their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. This tutorial presents an introduction to queueing Petri nets first introducing the modeling formalism itself and then summarizing the results of several modeling case studies which demonstrate how queueing Petri nets can be used for performance modeling and analysis. As part of the tutorial, we present QPME (Queueing Petri net Modeling Environment), an open-source tool for stochastic modeling and analysis of systems using queueing Petri nets. Finally, we briefly present a model-to-model transformation automatically generating a queueing Petri net model from a higher-level software architecture model annotated with performance relevant information.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/319.pdf},\n publisher = {ACM},\n address = {New York, NY, USA},\n booktitle = {Proceedings of the 3rd ACM/SPEC International Conference on Performance Engineering (ICPE 2012), Boston, USA, 22-25 April 2012},\n isbn = {978-1-4503-1202-8},\n doi = {10.1145/2188286.2188290},\n author = {Kounev, Samuel and Spinner, Simon and Meier, Philipp},\n}\n\n','\n\nSamuel Kounev, Simon Spinner, and Philipp Meier.\nIntroduction to queueing petri nets: Modeling formalism, tool support\nand case studies (tutorial paper).\nIn Proceedings of the 3rd ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2012), Boston, USA, 22-25 April 2012, 4 2012,\npages 9-18. ACM, New York, NY, USA.\n4 2012.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{KoSpMe2012-icpe-QPME_Tutorial,\ntitle = {Introduction to Queueing Petri Nets: Modeling Formalism, Tool Support and Case Studies (Tutorial Paper)},\nyear = {2012},\nmonth = {4},\npages = {9--18},\nabstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and evaluating their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. This tutorial presents an introduction to queueing Petri nets first introducing the modeling formalism itself and then summarizing the results of several modeling case studies which demonstrate how queueing Petri nets can be used for performance modeling and analysis. As part of the tutorial, we present QPME (Queueing Petri net Modeling Environment), an open-source tool for stochastic modeling and analysis of systems using queueing Petri nets. Finally, we briefly present a model-to-model transformation automatically generating a queueing Petri net model from a higher-level software architecture model annotated with performance relevant information.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/319.pdf},\npublisher = {ACM},\naddress = {New York, NY, USA},\nbooktitle = {Proceedings of the 3rd ACM/SPEC International Conference on Performance Engineering (ICPE 2012), Boston, USA, 22-25 April 2012},\nisbn = {978-1-4503-1202-8},\ndoi = {10.1145/2188286.2188290},\nauthor = {Kounev, Samuel and Spinner, Simon and Meier, Philipp}\n}\n
\n
\nQueueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and evaluating their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. This tutorial presents an introduction to queueing Petri nets first introducing the modeling formalism itself and then summarizing the results of several modeling case studies which demonstrate how queueing Petri nets can be used for performance modeling and analysis. As part of the tutorial, we present QPME (Queueing Petri net Modeling Environment), an open-source tool for stochastic modeling and analysis of systems using queueing Petri nets. Finally, we briefly present a model-to-model transformation automatically generating a queueing Petri net model from a higher-level software architecture model annotated with performance relevant information.\n
\n','
\n@inproceedings{KoSpMe2012-icpe-QPME_Tutorial,\n  title = {Introduction to Queueing Petri Nets: Modeling Formalism, Tool Support and Case Studies (Tutorial Paper)},\n  year = {2012},\n  month = {4},\n  pages = {9--18},\n  abstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and evaluating their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. This tutorial presents an introduction to queueing Petri nets first introducing the modeling formalism itself and then summarizing the results of several modeling case studies which demonstrate how queueing Petri nets can be used for performance modeling and analysis. As part of the tutorial, we present QPME (Queueing Petri net Modeling Environment), an open-source tool for stochastic modeling and analysis of systems using queueing Petri nets. Finally, we briefly present a model-to-model transformation automatically generating a queueing Petri net model from a higher-level software architecture model annotated with performance relevant information.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/319.pdf},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  booktitle = {Proceedings of the 3rd ACM/SPEC International Conference on Performance Engineering (ICPE 2012), Boston, USA, 22-25 April 2012},\n  isbn = {978-1-4503-1202-8},\n  doi = {10.1145/2188286.2188290},\n  author = {Kounev, Samuel and Spinner, Simon and Meier, Philipp}\n}\n
\n\n',NULL,'{Introduction to Queueing Petri Nets: Modeling Formalism, Tool Support and Case Studies}',0,4,2012,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(320,'paper','KoWeBu2004-CMG_JCRM-JBoss','article','@article{KoWeBu2004-CMG_JCRM-JBoss,\n author = {Samuel Kounev and B{\\\"o}rn Weis and Alejandro Buchmann},\n journal = {Journal of Computer Resource Management},\n month = {September},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/320.pdf},\n publisher = {Computer Measurement Group (CMG)},\n title = {{Performance Tuning and Optimization of J2EE Applications on the JBoss Platform}},\n volume = {113},\n year = {2004},\n}\n\n','\n\nSamuel Kounev, Börn Weis, and Alejandro Buchmann.\nPerformance Tuning and Optimization of J2EE Applications on the\nJBoss Platform.\nJournal of Computer Resource Management, 113, September 2004,\nComputer Measurement Group (CMG).\n[ bib | .pdf  ] 
\n@article{KoWeBu2004-CMG_JCRM-JBoss,\nauthor = {Samuel Kounev and B{\\\"o}rn Weis and Alejandro Buchmann},\njournal = {Journal of Computer Resource Management},\nmonth = {September},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/320.pdf},\npublisher = {Computer Measurement Group (CMG)},\ntitle = {{Performance Tuning and Optimization of J2EE Applications on the JBoss Platform}},\nvolume = {113},\nyear = {2004}\n}\n
\n
\n','
\n@article{KoWeBu2004-CMG_JCRM-JBoss,\n  author = {Samuel Kounev and B{\\\"o}rn Weis and Alejandro Buchmann},\n  journal = {Journal of Computer Resource Management},\n  month = {September},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/320.pdf},\n  publisher = {Computer Measurement Group (CMG)},\n  title = {{Performance Tuning and Optimization of J2EE Applications on the JBoss Platform}},\n  volume = {113},\n  year = {2004}\n}\n
\n\n',NULL,'{Performance Tuning and Optimization of J2EE Applications on the JBoss Platform}',0,9,2004,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(329,'paper','KoNoRe2011-MODELS-Invited','inproceedings','@inproceedings{KoNoRe2011-MODELS-Invited,\n abstract = {Quantitative prediction of non-functional properties, such as performance, reliability, and costs, of software architectures supports systematic software engineering. Even though there usually is a rough idea on bounds for quality of service, the exact required values may be unclear and subject to trade-offs. Designing architectures that exhibit such good trade-off between multiple quality attributes is hard. Even with a given functional design, many degrees of freedom in the software architecture (e.g. component deployment or server configuration) span a large design space. Automated approaches search the design space with multi-objective metaheuristics such as evolutionary algorithms. However, as quality prediction for a single architecture is computationally expensive, these approaches are time consuming. In this work, we enhance an automated improvement approach to take into account bounds for quality of service in order to focus the search on interesting regions of the objective space, while still allowing trade-offs after the search. We compare two different constraint handling techniques to consider the bounds. To validate our approach, we applied both techniques to an architecture model of a component-based business information system. We compared both techniques to an unbounded search in 4 scenarios. Every scenario was examined with 10 optimization runs, each investigating around 1600 architectural candidates. The results indicate that the integration of quality of service bounds during the optimization process can improve the quality of the solutions found, however, the effect depends on the scenario, i.e. the problem and the quality requirements. The best results were achieved for costs requirements: The approach was able to decrease the time needed to find good solutions in the interesting regions of the objective space by 25\\% on average.},\n author = {Anne Koziolek and Qais Noorshams and Ralf Reussner},\n booktitle = {{Models in Software Engineering, Workshops and Symposia at MODELS 2010, Oslo, Norway, October 3-8, 2010, Reports and Revised Selected Papers}},\n doi = {10.1007/978-3-642-21210-9_37},\n editor = {J. Dingel and A. Solberg},\n pages = {384--399},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/329.pdf},\n publisher = {Springer-Verlag Berlin Heidelberg},\n series = {Lecture Notes in Computer Science},\n title = {Focussing Multi-objective Software Architecture Optimization Using Quality of Service Bounds},\n url = {http://dx.doi.org/10.1007/978-3-642-21210-9},\n volume = {6627},\n year = {2011},\n}\n\n','\n\nAnne Koziolek, Qais Noorshams, and Ralf Reussner.\nFocussing multi-objective software architecture optimization using\nquality of service bounds.\nIn Models in Software Engineering, Workshops and Symposia at\nMODELS 2010, Oslo, Norway, October 3-8, 2010, Reports and Revised Selected\nPapers, J. Dingel and A. Solberg, editors, 2011, volume 6627 of \nLecture Notes in Computer Science, pages 384-399. Springer-Verlag Berlin\nHeidelberg.\n2011.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{KoNoRe2011-MODELS-Invited,\nabstract = {Quantitative prediction of non-functional properties, such as performance, reliability, and costs, of software architectures supports systematic software engineering. Even though there usually is a rough idea on bounds for quality of service, the exact required values may be unclear and subject to trade-offs. Designing architectures that exhibit such good trade-off between multiple quality attributes is hard. Even with a given functional design, many degrees of freedom in the software architecture (e.g. component deployment or server configuration) span a large design space. Automated approaches search the design space with multi-objective metaheuristics such as evolutionary algorithms. However, as quality prediction for a single architecture is computationally expensive, these approaches are time consuming. In this work, we enhance an automated improvement approach to take into account bounds for quality of service in order to focus the search on interesting regions of the objective space, while still allowing trade-offs after the search. We compare two different constraint handling techniques to consider the bounds. To validate our approach, we applied both techniques to an architecture model of a component-based business information system. We compared both techniques to an unbounded search in 4 scenarios. Every scenario was examined with 10 optimization runs, each investigating around 1600 architectural candidates. The results indicate that the integration of quality of service bounds during the optimization process can improve the quality of the solutions found, however, the effect depends on the scenario, i.e. the problem and the quality requirements. The best results were achieved for costs requirements: The approach was able to decrease the time needed to find good solutions in the interesting regions of the objective space by 25\\% on average.},\nauthor = {Anne Koziolek and Qais Noorshams and Ralf Reussner},\nbooktitle = {{Models in Software Engineering, Workshops and Symposia at MODELS 2010, Oslo, Norway, October 3-8, 2010, Reports and Revised Selected Papers}},\ndoi = {10.1007/978-3-642-21210-9_37},\neditor = {J. Dingel and A. Solberg},\npages = {384--399},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/329.pdf},\npublisher = {Springer-Verlag Berlin Heidelberg},\nseries = {Lecture Notes in Computer Science},\ntitle = {Focussing Multi-objective Software Architecture Optimization Using Quality of Service Bounds},\nurl = {http://dx.doi.org/10.1007/978-3-642-21210-9},\nvolume = {6627},\nyear = {2011}\n}\n
\n
\nQuantitative prediction of non-functional properties, such as performance, reliability, and costs, of software architectures supports systematic software engineering. Even though there usually is a rough idea on bounds for quality of service, the exact required values may be unclear and subject to trade-offs. Designing architectures that exhibit such good trade-off between multiple quality attributes is hard. Even with a given functional design, many degrees of freedom in the software architecture (e.g. component deployment or server configuration) span a large design space. Automated approaches search the design space with multi-objective metaheuristics such as evolutionary algorithms. However, as quality prediction for a single architecture is computationally expensive, these approaches are time consuming. In this work, we enhance an automated improvement approach to take into account bounds for quality of service in order to focus the search on interesting regions of the objective space, while still allowing trade-offs after the search. We compare two different constraint handling techniques to consider the bounds. To validate our approach, we applied both techniques to an architecture model of a component-based business information system. We compared both techniques to an unbounded search in 4 scenarios. Every scenario was examined with 10 optimization runs, each investigating around 1600 architectural candidates. The results indicate that the integration of quality of service bounds during the optimization process can improve the quality of the solutions found, however, the effect depends on the scenario, i.e. the problem and the quality requirements. The best results were achieved for costs requirements: The approach was able to decrease the time needed to find good solutions in the interesting regions of the objective space by 25% on average.\n
\n','
\n@inproceedings{KoNoRe2011-MODELS-Invited,\n  abstract = {Quantitative prediction of non-functional properties, such as performance, reliability, and costs, of software architectures supports systematic software engineering. Even though there usually is a rough idea on bounds for quality of service, the exact required values may be unclear and subject to trade-offs. Designing architectures that exhibit such good trade-off between multiple quality attributes is hard. Even with a given functional design, many degrees of freedom in the software architecture (e.g. component deployment or server configuration) span a large design space. Automated approaches search the design space with multi-objective metaheuristics such as evolutionary algorithms. However, as quality prediction for a single architecture is computationally expensive, these approaches are time consuming. In this work, we enhance an automated improvement approach to take into account bounds for quality of service in order to focus the search on interesting regions of the objective space, while still allowing trade-offs after the search. We compare two different constraint handling techniques to consider the bounds. To validate our approach, we applied both techniques to an architecture model of a component-based business information system. We compared both techniques to an unbounded search in 4 scenarios. Every scenario was examined with 10 optimization runs, each investigating around 1600 architectural candidates. The results indicate that the integration of quality of service bounds during the optimization process can improve the quality of the solutions found, however, the effect depends on the scenario, i.e. the problem and the quality requirements. The best results were achieved for costs requirements: The approach was able to decrease the time needed to find good solutions in the interesting regions of the objective space by 25\\% on average.},\n  author = {Anne Koziolek and Qais Noorshams and Ralf Reussner},\n  booktitle = {{Models in Software Engineering, Workshops and Symposia at MODELS 2010, Oslo, Norway, October 3-8, 2010, Reports and Revised Selected Papers}},\n  doi = {10.1007/978-3-642-21210-9_37},\n  editor = {J. Dingel and A. Solberg},\n  pages = {384--399},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/329.pdf},\n  publisher = {Springer-Verlag Berlin Heidelberg},\n  series = {Lecture Notes in Computer Science},\n  title = {Focussing Multi-objective Software Architecture Optimization Using Quality of Service Bounds},\n  url = {http://dx.doi.org/10.1007/978-3-642-21210-9},\n  volume = {6627},\n  year = {2011}\n}\n
\n\n','Quantitative prediction of non-functional properties, such as performance, reliability, and costs, of software architectures supports systematic software engineering. Even though there usually is a rough idea on bounds for quality of service, the exact required values may be unclear and subject to trade-offs. Designing architectures that exhibit such good trade-off between multiple quality attributes is hard. Even with a given functional design, many degrees of freedom in the software architecture (e.g. component deployment or server configuration) span a large design space. Automated approaches search the design space with multi-objective metaheuristics such as evolutionary algorithms. However, as quality prediction for a single architecture is computationally expensive, these approaches are time consuming. In this work, we enhance an automated improvement approach to take into account bounds for quality of service in order to focus the search on interesting regions of the objective space, while still allowing trade-offs after the search. We compare two different constraint handling techniques to consider the bounds. To validate our approach, we applied both techniques to an architecture model of a component-based business information system. We compared both techniques to an unbounded search in 4 scenarios. Every scenario was examined with 10 optimization runs, each investigating around 1600 architectural candidates. The results indicate that the integration of quality of service bounds during the optimization process can improve the quality of the solutions found, however, the effect depends on the scenario, i.e. the problem and the quality requirements. The best results were achieved for costs requirements: The approach was able to decrease the time needed to find good solutions in the interesting regions of the objective space by 25\\% on average.','Focussing Multi-objective Software Architecture Optimization Using Quality of Service Bounds',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(367,'paper','Kr2010-uspatent-adaptive-elearning','misc','@misc{Kr2010-uspatent-adaptive-elearning,\n author = {Krebs, Rouven},\n howpublished = {Patent US8108327},\n month = {March},\n title = {METHOD AND SYSTEM FOR FOR AN ADAPTIVE LEARNING STRATEGY},\n year = {2010},\n}\n\n','\n\nRouven Krebs.\nMethod and system for for an adaptive learning strategy.\nPatent US8108327, March 2010.\n[ bib  ] 
\n@misc{Kr2010-uspatent-adaptive-elearning,\nauthor = {Krebs, Rouven},\nhowpublished = {Patent US8108327},\nmonth = {March},\ntitle = {METHOD AND SYSTEM FOR FOR AN ADAPTIVE LEARNING STRATEGY},\nyear = {2010}\n}\n
\n
\n','
\n@misc{Kr2010-uspatent-adaptive-elearning,\n  author = {Krebs, Rouven},\n  howpublished = {Patent US8108327},\n  month = {March},\n  title = {METHOD AND SYSTEM FOR FOR AN ADAPTIVE LEARNING STRATEGY},\n  year = {2010}\n}\n
\n\n',NULL,'METHOD AND SYSTEM FOR FOR AN ADAPTIVE LEARNING STRATEGY',0,3,2010,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(368,'paper','Krebs2010a','mastersthesis','@mastersthesis{Krebs2010a,\n address = {Moltkestr. 30, 76133 Karlsruhe, Germany},\n author = {Rouven Krebs},\n month = {October},\n school = {University of Applied Sciences Karlsruhe},\n title = {Combination of measurement and model based approaches for performance prediction in service oriented systems},\n year = {2010},\n}\n\n','\n\nRouven Krebs.\nCombination of measurement and model based approaches for performance\nprediction in service oriented systems.\nMaster\'s thesis, University of Applied Sciences Karlsruhe, Moltkestr.\n30, 76133 Karlsruhe, Germany, October 2010.\n[ bib  ] 
\n@mastersthesis{Krebs2010a,\naddress = {Moltkestr. 30, 76133 Karlsruhe, Germany},\nauthor = {Rouven Krebs},\nmonth = {October},\nschool = {University of Applied Sciences Karlsruhe},\ntitle = {Combination of measurement and model based approaches for performance prediction in service oriented systems},\nyear = {2010}\n}\n
\n
\n','
\n@mastersthesis{Krebs2010a,\n  address = {Moltkestr. 30, 76133 Karlsruhe, Germany},\n  author = {Rouven Krebs},\n  month = {October},\n  school = {University of Applied Sciences Karlsruhe},\n  title = {Combination of measurement and model based approaches for performance prediction in service oriented systems},\n  year = {2010}\n}\n
\n\n',NULL,'Combination of measurement and model based approaches for performance prediction in service oriented systems',0,10,2010,10,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(369,'paper','Kr2010-uspatent-offline-content','misc','@misc{Kr2010-uspatent-offline-content,\n author = {Krebs, Rouven and Hochwarth, Christian},\n howpublished = {Patent US8644755},\n month = {April},\n title = {METHOD AND SYSTEM FOR MANAGING LEARNING MATERIALS PRESENTED OFFLINE},\n year = {2010},\n}\n\n','\n\nRouven Krebs and Christian Hochwarth.\nMethod and system for managing learning materials presented offline.\nPatent US8644755, April 2010.\n[ bib  ] 
\n@misc{Kr2010-uspatent-offline-content,\nauthor = {Krebs, Rouven and Hochwarth, Christian},\nhowpublished = {Patent US8644755},\nmonth = {April},\ntitle = {METHOD AND SYSTEM FOR MANAGING LEARNING MATERIALS PRESENTED OFFLINE},\nyear = {2010}\n}\n
\n
\n','
\n@misc{Kr2010-uspatent-offline-content,\n  author = {Krebs, Rouven and Hochwarth, Christian},\n  howpublished = {Patent US8644755},\n  month = {April},\n  title = {METHOD AND SYSTEM FOR MANAGING LEARNING MATERIALS PRESENTED OFFLINE},\n  year = {2010}\n}\n
\n\n',NULL,'METHOD AND SYSTEM FOR MANAGING LEARNING MATERIALS PRESENTED OFFLINE',0,4,2010,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(370,'paper','KrMoKo2012-QoSA-QuantifyingPerfIsoMetrics','inproceedings','@inproceedings{KrMoKo2012-QoSA-QuantifyingPerfIsoMetrics,\n address = {New York, USA},\n author = {Krebs, Rouven and Momm, Christof and Kounev, Samuel},\n booktitle = {Proceedings of the 8th ACM SIGSOFT International Conference on the Quality of Software Architectures (QoSA 2012)},\n day = {25--28},\n editor = {Buhnova, Barbora and Vallecillo, Antonio},\n location = {Bertinoro, Italy},\n month = {June},\n note = {Acceptance Rate (Full Paper): 25.6\\%},\n pages = {91--100},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/370.pdf},\n publisher = {ACM Press},\n title = {{M}etrics and {T}echniques for {Q}uantifying {P}erformance {I}solation in {C}loud {E}nvironments},\n url = {http://qosa.ipd.kit.edu/qosa_2012/},\n year = {2012},\n}\n\n','\n\nRouven Krebs, Christof Momm, and Samuel Kounev.\nMetrics and Techniques for Quantifying Performance\nIsolation in Cloud Environments.\nIn Proceedings of the 8th ACM SIGSOFT International Conference\non the Quality of Software Architectures (QoSA 2012), Barbora Buhnova and\nAntonio Vallecillo, editors, Bertinoro, Italy, June 25-28, 2012, pages\n91-100. ACM Press, New York, USA.\nJune 2012, Acceptance Rate (Full Paper): 25.6%.\n[ bib | http | .pdf  ] 
\n@inproceedings{KrMoKo2012-QoSA-QuantifyingPerfIsoMetrics,\naddress = {New York, USA},\nauthor = {Krebs, Rouven and Momm, Christof and Kounev, Samuel},\nbooktitle = {Proceedings of the 8th ACM SIGSOFT International Conference on the Quality of Software Architectures (QoSA 2012)},\nday = {25--28},\neditor = {Buhnova, Barbora and Vallecillo, Antonio},\nlocation = {Bertinoro, Italy},\nmonth = {June},\nnote = {Acceptance Rate (Full Paper): 25.6\\%},\npages = {91--100},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/370.pdf},\npublisher = {ACM Press},\ntitle = {{M}etrics and {T}echniques for {Q}uantifying {P}erformance {I}solation in {C}loud {E}nvironments},\nurl = {http://qosa.ipd.kit.edu/qosa_2012/},\nyear = {2012}\n}\n
\n
\n','
\n@inproceedings{KrMoKo2012-QoSA-QuantifyingPerfIsoMetrics,\n  address = {New York, USA},\n  author = {Krebs, Rouven and Momm, Christof and Kounev, Samuel},\n  booktitle = {Proceedings of the 8th ACM SIGSOFT International Conference on the Quality of Software Architectures (QoSA 2012)},\n  day = {25--28},\n  editor = {Buhnova, Barbora and Vallecillo, Antonio},\n  location = {Bertinoro, Italy},\n  month = {June},\n  note = {Acceptance Rate (Full Paper): 25.6\\%},\n  pages = {91--100},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/370.pdf},\n  publisher = {ACM Press},\n  title = {{M}etrics and {T}echniques for {Q}uantifying {P}erformance {I}solation in {C}loud {E}nvironments},\n  url = {http://qosa.ipd.kit.edu/qosa_2012/},\n  year = {2012}\n}\n
\n\n',NULL,'{M}etrics and {T}echniques for {Q}uantifying {P}erformance {I}solation in {C}loud {E}nvironments',0,6,2012,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(371,'paper','KrMoKo2012-closer-multitenant-saas','inproceedings','@inproceedings{KrMoKo2012-closer-multitenant-saas,\n author = {Krebs, Rouven and Momm, Christof and Kounev, Samuel},\n booktitle = {{Proceedings of the 2nd International Conference on Cloud Computing and Services Science (CLOSER 2012)}},\n day = {18--21},\n location = {Setubal, Portugal},\n month = {April},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/371.pdf},\n publisher = {SciTePress},\n title = {{Architectural Concerns in Multi-Tenant SaaS Applications}},\n titleaddon = {{(Short Paper)}},\n year = {2012},\n}\n\n','\n\nRouven Krebs, Christof Momm, and Samuel Kounev.\nArchitectural Concerns in Multi-Tenant SaaS Applications (Short\nPaper).\nIn Proceedings of the 2nd International Conference on Cloud\nComputing and Services Science (CLOSER 2012), Setubal, Portugal, April\n18-21, 2012. SciTePress.\nApril 2012.\n[ bib | .pdf  ] 
\n@inproceedings{KrMoKo2012-closer-multitenant-saas,\nauthor = {Krebs, Rouven and Momm, Christof and Kounev, Samuel},\nbooktitle = {{Proceedings of the 2nd International Conference on Cloud Computing and Services Science (CLOSER 2012)}},\nday = {18--21},\nlocation = {Setubal, Portugal},\nmonth = {April},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/371.pdf},\npublisher = {SciTePress},\ntitle = {{Architectural Concerns in Multi-Tenant SaaS Applications}},\ntitleaddon = {{(Short Paper)}},\nyear = {2012}\n}\n
\n
\n','
\n@inproceedings{KrMoKo2012-closer-multitenant-saas,\n  author = {Krebs, Rouven and Momm, Christof and Kounev, Samuel},\n  booktitle = {{Proceedings of the 2nd International Conference on Cloud Computing and Services Science (CLOSER 2012)}},\n  day = {18--21},\n  location = {Setubal, Portugal},\n  month = {April},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/371.pdf},\n  publisher = {SciTePress},\n  title = {{Architectural Concerns in Multi-Tenant SaaS Applications}},\n  titleaddon = {{(Short Paper)}},\n  year = {2012}\n}\n
\n\n',NULL,'{Architectural Concerns in Multi-Tenant SaaS Applications}',0,4,2012,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(372,'paper','KrWeKo2013-icwe-MTBenchmark','inproceedings','@inproceedings{KrWeKo2013-icwe-MTBenchmark,\n author = {Krebs, Rouven and Wert, Alexander and Kounev, Samuel},\n booktitle = {{Proceedings of the 13th International Conference on Web Engineering (ICWE 2013)}},\n day = {8--12},\n location = {Aalborg, Denmark},\n month = {July},\n organization = {Aalborg University, Denmark},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/372.pdf},\n publisher = {Springer-Verlag},\n title = {{Multi-Tenancy Performance Benchmark for Web Application Platforms}},\n titleaddon = {Industrial Track},\n year = {2013},\n}\n\n','\n\nRouven Krebs, Alexander Wert, and Samuel Kounev.\nMulti-Tenancy Performance Benchmark for Web Application Platforms\nindustrial track.\nIn Proceedings of the 13th International Conference on Web\nEngineering (ICWE 2013), Aalborg, Denmark, July 8-12, 2013. Aalborg\nUniversity, Denmark, Springer-Verlag.\nJuly 2013.\n[ bib | .pdf  ] 
\n@inproceedings{KrWeKo2013-icwe-MTBenchmark,\nauthor = {Krebs, Rouven and Wert, Alexander and Kounev, Samuel},\nbooktitle = {{Proceedings of the 13th International Conference on Web Engineering (ICWE 2013)}},\nday = {8--12},\nlocation = {Aalborg, Denmark},\nmonth = {July},\norganization = {Aalborg University, Denmark},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/372.pdf},\npublisher = {Springer-Verlag},\ntitle = {{Multi-Tenancy Performance Benchmark for Web Application Platforms}},\ntitleaddon = {Industrial Track},\nyear = {2013}\n}\n
\n
\n','
\n@inproceedings{KrWeKo2013-icwe-MTBenchmark,\n  author = {Krebs, Rouven and Wert, Alexander and Kounev, Samuel},\n  booktitle = {{Proceedings of the 13th International Conference on Web Engineering (ICWE 2013)}},\n  day = {8--12},\n  location = {Aalborg, Denmark},\n  month = {July},\n  organization = {Aalborg University, Denmark},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/372.pdf},\n  publisher = {Springer-Verlag},\n  title = {{Multi-Tenancy Performance Benchmark for Web Application Platforms}},\n  titleaddon = {Industrial Track},\n  year = {2013}\n}\n
\n\n',NULL,'{Multi-Tenancy Performance Benchmark for Web Application Platforms}',0,7,2013,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(390,'paper','KuHeKiRe2011-ResourceElasticity','techreport','@techreport{KuHeKiRe2011-ResourceElasticity,\n abstract = {{Elasticity is the ability of a software system to dynamically scale the amount of the resources it provides to clients as their workloads increase or decrease. Elasticity is praised as a key advantage of cloud computing, where computing resources are dynamically added and released. However, there exists no concise or formal definition of elasticity, and thus no approaches to quantify it have been developed so far. Existing work on cloud computing is limited to the technical view of implementing elastic systems, and definitions or scalability have not been extended to cover elasticity. In this report, we present a detailed discussion of elasticity, propose techniques for quantifying and measuring it, and outline next steps to be taken for enabling comparisons between cloud computing offerings on the basis of elasticity. We also present preliminary work on measuring elasticity of resource pools provided by the Java Virtual Machine.}},\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n author = {Michael Kuperberg and Nikolas Roman Herbst and J\\\'{o}akim Gunnarsson von Kistowski and Ralf Reussner},\n institution = {Karlsruhe Institute of Technology (KIT)},\n issn = {2190-4782},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/390.pdf},\n series = {Karlsruhe Reports in Informatics},\n title = {{Defining and Quantifying Elasticity of Resources in Cloud Computing and Scalable Platforms}},\n url = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000023476},\n volume = {16},\n year = {2011},\n}\n\n','\n\nMichael Kuperberg, Nikolas Roman Herbst, Jóakim Gunnarsson von Kistowski,\nand Ralf Reussner.\nDefining and Quantifying Elasticity of Resources in Cloud Computing\nand Scalable Platforms.\nTechnical report, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, 2011.\n[ bib | http | .pdf | Abstract  ] 
\n@techreport{KuHeKiRe2011-ResourceElasticity,\nabstract = {{Elasticity is the ability of a software system to dynamically scale the amount of the resources it provides to clients as their workloads increase or decrease. Elasticity is praised as a key advantage of cloud computing, where computing resources are dynamically added and released. However, there exists no concise or formal definition of elasticity, and thus no approaches to quantify it have been developed so far. Existing work on cloud computing is limited to the technical view of implementing elastic systems, and definitions or scalability have not been extended to cover elasticity. In this report, we present a detailed discussion of elasticity, propose techniques for quantifying and measuring it, and outline next steps to be taken for enabling comparisons between cloud computing offerings on the basis of elasticity. We also present preliminary work on measuring elasticity of resource pools provided by the Java Virtual Machine.}},\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nauthor = {Michael Kuperberg and Nikolas Roman Herbst and J\\\'{o}akim Gunnarsson von Kistowski and Ralf Reussner},\ninstitution = {Karlsruhe Institute of Technology (KIT)},\nissn = {2190-4782},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/390.pdf},\nseries = {Karlsruhe Reports in Informatics},\ntitle = {{Defining and Quantifying Elasticity of Resources in Cloud Computing and Scalable Platforms}},\nurl = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000023476},\nvolume = {16},\nyear = {2011}\n}\n
\n
\nElasticity is the ability of a software system to dynamically scale the amount of the resources it provides to clients as their workloads increase or decrease. Elasticity is praised as a key advantage of cloud computing, where computing resources are dynamically added and released. However, there exists no concise or formal definition of elasticity, and thus no approaches to quantify it have been developed so far. Existing work on cloud computing is limited to the technical view of implementing elastic systems, and definitions or scalability have not been extended to cover elasticity. In this report, we present a detailed discussion of elasticity, propose techniques for quantifying and measuring it, and outline next steps to be taken for enabling comparisons between cloud computing offerings on the basis of elasticity. We also present preliminary work on measuring elasticity of resource pools provided by the Java Virtual Machine.\n
\n','
\n@techreport{KuHeKiRe2011-ResourceElasticity,\n  abstract = {{Elasticity is the ability of a software system to dynamically scale the amount of the resources it provides to clients as their workloads increase or decrease. Elasticity is praised as a key advantage of cloud computing, where computing resources are dynamically added and released. However, there exists no concise or formal definition of elasticity, and thus no approaches to quantify it have been developed so far. Existing work on cloud computing is limited to the technical view of implementing elastic systems, and definitions or scalability have not been extended to cover elasticity. In this report, we present a detailed discussion of elasticity, propose techniques for quantifying and measuring it, and outline next steps to be taken for enabling comparisons between cloud computing offerings on the basis of elasticity. We also present preliminary work on measuring elasticity of resource pools provided by the Java Virtual Machine.}},\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  author = {Michael Kuperberg and Nikolas Roman Herbst and J\\\'{o}akim Gunnarsson von Kistowski and Ralf Reussner},\n  institution = {Karlsruhe Institute of Technology (KIT)},\n  issn = {2190-4782},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/390.pdf},\n  series = {Karlsruhe Reports in Informatics},\n  title = {{Defining and Quantifying Elasticity of Resources in Cloud Computing and Scalable Platforms}},\n  url = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000023476},\n  volume = {16},\n  year = {2011}\n}\n
\n\n','{Elasticity is the ability of a software system to dynamically scale the amount of the resources it provides to clients as their workloads increase or decrease. Elasticity is praised as a key advantage of cloud computing, where computing resources are dynamically added and released. However, there exists no concise or formal definition of elasticity, and thus no approaches to quantify it have been developed so far. Existing work on cloud computing is limited to the technical view of implementing elastic systems, and definitions or scalability have not been extended to cover elasticity. In this report, we present a detailed discussion of elasticity, propose techniques for quantifying and measuring it, and outline next steps to be taken for enabling comparisons between cloud computing offerings on the basis of elasticity. We also present preliminary work on measuring elasticity of resource pools provided by the Java Virtual Machine.}','{Defining and Quantifying Elasticity of Resources in Cloud Computing and Scalable Platforms}',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(405,'paper','LoKr2013-Closer-Isolation','inproceedings','@inproceedings{LoKr2013-Closer-Isolation,\n author = {Loesch, Manuel and Krebs, Rouven},\n booktitle = {{Proceedings of the 3rd International Conference on Cloud Computing and Service Science (CLOSER 2013)}},\n day = {8--10},\n location = {Aachen, Germany},\n month = {May},\n organization = {RWTH Aachen, Germany},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/405.pdf},\n publisher = {SciTePress},\n title = {{Conceptual Approach for Performance Isolation in Multi-Tenant Systems}},\n titleaddon = {Short Paper},\n year = {2013},\n}\n\n','\n\nManuel Loesch and Rouven Krebs.\nConceptual Approach for Performance Isolation in Multi-Tenant\nSystems short paper.\nIn Proceedings of the 3rd International Conference on Cloud\nComputing and Service Science (CLOSER 2013), Aachen, Germany, May 8-10,\n2013. RWTH Aachen, Germany, SciTePress.\nMay 2013.\n[ bib | .pdf  ] 
\n@inproceedings{LoKr2013-Closer-Isolation,\nauthor = {Loesch, Manuel and Krebs, Rouven},\nbooktitle = {{Proceedings of the 3rd International Conference on Cloud Computing and Service Science (CLOSER 2013)}},\nday = {8--10},\nlocation = {Aachen, Germany},\nmonth = {May},\norganization = {RWTH Aachen, Germany},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/405.pdf},\npublisher = {SciTePress},\ntitle = {{Conceptual Approach for Performance Isolation in Multi-Tenant Systems}},\ntitleaddon = {Short Paper},\nyear = {2013}\n}\n
\n
\n','
\n@inproceedings{LoKr2013-Closer-Isolation,\n  author = {Loesch, Manuel and Krebs, Rouven},\n  booktitle = {{Proceedings of the 3rd International Conference on Cloud Computing and Service Science (CLOSER 2013)}},\n  day = {8--10},\n  location = {Aachen, Germany},\n  month = {May},\n  organization = {RWTH Aachen, Germany},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/405.pdf},\n  publisher = {SciTePress},\n  title = {{Conceptual Approach for Performance Isolation in Multi-Tenant Systems}},\n  titleaddon = {Short Paper},\n  year = {2013}\n}\n
\n\n',NULL,'{Conceptual Approach for Performance Isolation in Multi-Tenant Systems}',0,5,2013,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(406,'paper','MuScPaKoRi2009-EuroPar-StoAnalPubSub','inproceedings','@inproceedings{MuScPaKoRi2009-EuroPar-StoAnalPubSub,\n abstract = {With the gradual adoption of publish/subscribe systems in mission critical areas, it is essential that systems are subjected to rigorous performance analysis before they are put into production. However, existing approaches to performance modeling and analysis of publish/subscribe systems suffer from many limitations that seriously constrain their practical applicability. In this paper, we present a generalized method for stochastic analysis of publish/subscribe systems employing identity-based hierarchical routing. The method is based on an analytical model that addresses the major limitations underlying existing work in this area. In particular, it supports arbitrary broker overlay topologies and allows to set workload parameters, e.g., publication rates and subscription lifetimes, individually for each broker. The analysis is illustrated by a running example that helps to gain better understanding of the derived mathematical relationships.},\n author = {Gero M{\\\"u}hl and Arnd Schr{\\\"o}ter and Helge Parzyjegla and Samuel Kounev and Jan Richling},\n booktitle = {Proceedings of the 15th International European Conference on Parallel and Distributed Computing (Euro-Par 2009), Delft, The Netherlands, August 25-28, 2009.},\n note = {Acceptance Rate (Full Paper): 33%},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/406.pdf},\n publisher = {Springer Verlag},\n title = {{Stochastic Analysis of Hierarchical Publish/Subscribe Systems}},\n url = {http://europar2009.ewi.tudelft.nl/},\n year = {2009},\n}\n\n','\n\nGero Mühl, Arnd Schröter, Helge Parzyjegla, Samuel Kounev, and Jan\nRichling.\nStochastic Analysis of Hierarchical Publish/Subscribe Systems.\nIn Proceedings of the 15th International European Conference on\nParallel and Distributed Computing (Euro-Par 2009), Delft, The Netherlands,\nAugust 25-28, 2009., 2009. Springer Verlag.\n2009, Acceptance Rate (Full Paper): 33%.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{MuScPaKoRi2009-EuroPar-StoAnalPubSub,\nabstract = {With the gradual adoption of publish/subscribe systems in mission critical areas, it is essential that systems are subjected to rigorous performance analysis before they are put into production. However, existing approaches to performance modeling and analysis of publish/subscribe systems suffer from many limitations that seriously constrain their practical applicability. In this paper, we present a generalized method for stochastic analysis of publish/subscribe systems employing identity-based hierarchical routing. The method is based on an analytical model that addresses the major limitations underlying existing work in this area. In particular, it supports arbitrary broker overlay topologies and allows to set workload parameters, e.g., publication rates and subscription lifetimes, individually for each broker. The analysis is illustrated by a running example that helps to gain better understanding of the derived mathematical relationships.},\nauthor = {Gero M{\\\"u}hl and Arnd Schr{\\\"o}ter and Helge Parzyjegla and Samuel Kounev and Jan Richling},\nbooktitle = {Proceedings of the 15th International European Conference on Parallel and Distributed Computing (Euro-Par 2009), Delft, The Netherlands, August 25-28, 2009.},\nnote = {Acceptance Rate (Full Paper): 33%},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/406.pdf},\npublisher = {Springer Verlag},\ntitle = {{Stochastic Analysis of Hierarchical Publish/Subscribe Systems}},\nurl = {http://europar2009.ewi.tudelft.nl/},\nyear = {2009}\n}\n
\n
\nWith the gradual adoption of publish/subscribe systems in mission critical areas, it is essential that systems are subjected to rigorous performance analysis before they are put into production. However, existing approaches to performance modeling and analysis of publish/subscribe systems suffer from many limitations that seriously constrain their practical applicability. In this paper, we present a generalized method for stochastic analysis of publish/subscribe systems employing identity-based hierarchical routing. The method is based on an analytical model that addresses the major limitations underlying existing work in this area. In particular, it supports arbitrary broker overlay topologies and allows to set workload parameters, e.g., publication rates and subscription lifetimes, individually for each broker. The analysis is illustrated by a running example that helps to gain better understanding of the derived mathematical relationships.\n
\n','
\n@inproceedings{MuScPaKoRi2009-EuroPar-StoAnalPubSub,\n  abstract = {With the gradual adoption of publish/subscribe systems in mission critical areas, it is essential that systems are subjected to rigorous performance analysis before they are put into production. However, existing approaches to performance modeling and analysis of publish/subscribe systems suffer from many limitations that seriously constrain their practical applicability. In this paper, we present a generalized method for stochastic analysis of publish/subscribe systems employing identity-based hierarchical routing. The method is based on an analytical model that addresses the major limitations underlying existing work in this area. In particular, it supports arbitrary broker overlay topologies and allows to set workload parameters, e.g., publication rates and subscription lifetimes, individually for each broker. The analysis is illustrated by a running example that helps to gain better understanding of the derived mathematical relationships.},\n  author = {Gero M{\\\"u}hl and Arnd Schr{\\\"o}ter and Helge Parzyjegla and Samuel Kounev and Jan Richling},\n  booktitle = {Proceedings of the 15th International European Conference on Parallel and Distributed Computing (Euro-Par 2009), Delft, The Netherlands, August 25-28, 2009.},\n  note = {Acceptance Rate (Full Paper): 33%},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/406.pdf},\n  publisher = {Springer Verlag},\n  title = {{Stochastic Analysis of Hierarchical Publish/Subscribe Systems}},\n  url = {http://europar2009.ewi.tudelft.nl/},\n  year = {2009}\n}\n
\n\n','With the gradual adoption of publish/subscribe systems in mission critical areas, it is essential that systems are subjected to rigorous performance analysis before they are put into production. However, existing approaches to performance modeling and analysis of publish/subscribe systems suffer from many limitations that seriously constrain their practical applicability. In this paper, we present a generalized method for stochastic analysis of publish/subscribe systems employing identity-based hierarchical routing. The method is based on an analytical model that addresses the major limitations underlying existing work in this area. In particular, it supports arbitrary broker overlay topologies and allows to set workload parameters, e.g., publication rates and subscription lifetimes, individually for each broker. The analysis is illustrated by a running example that helps to gain better understanding of the derived mathematical relationships.','{Stochastic Analysis of Hierarchical Publish/Subscribe Systems}',0,0,2009,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(417,'paper','MaMaStTuNoReRe2014-ICPE-JMSModel','inproceedings','@inproceedings{MaMaStTuNoReRe2014-ICPE-JMSModel,\n author = {Martinec, Tom\\\'{a}c{s} and Marek, Luk\\\'{a}\\c{s} and Steinhauser, Anton\\\'{i}n and T{u}ma, Petr and Noorshams, Qais and Rentschler, Andreas and Reussner, Ralf},\n title = {Constructing Performance Model of JMS Middleware Platform},\n booktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering},\n series = {ICPE \'14},\n year = {2014},\n month = {March},\n isbn = {978-1-4503-2733-6},\n location = {Dublin, Ireland},\n pages = {123--134},\n numpages = {12},\n url = {http://doi.acm.org/10.1145/2568088.2568096},\n doi = {10.1145/2568088.2568096},\n acmid = {2568096},\n publisher = {ACM},\n address = {New York, NY, USA},\n keywords = {JMS, measurement, modeling, performance analysis, software performance},\n}\n\n','\n\nTomács Martinec, Lukás Marek, Antonín Steinhauser, Petr\nTuma, Qais Noorshams, Andreas Rentschler, and Ralf Reussner.\nConstructing performance model of jms middleware platform.\nIn Proceedings of the 5th ACM/SPEC International Conference on\nPerformance Engineering, Dublin, Ireland, March 2014, ICPE \'14, pages\n123-134. ACM, New York, NY, USA.\nMarch 2014.\n[ bib | DOI | http  ] 
\n@inproceedings{MaMaStTuNoReRe2014-ICPE-JMSModel,\nauthor = {Martinec, Tom\\\'{a}c{s} and Marek, Luk\\\'{a}\\c{s} and Steinhauser, Anton\\\'{i}n and T{u}ma, Petr and Noorshams, Qais and Rentschler, Andreas and Reussner, Ralf},\ntitle = {Constructing Performance Model of JMS Middleware Platform},\nbooktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering},\nseries = {ICPE \'14},\nyear = {2014},\nmonth = {March},\nisbn = {978-1-4503-2733-6},\nlocation = {Dublin, Ireland},\npages = {123--134},\nnumpages = {12},\nurl = {http://doi.acm.org/10.1145/2568088.2568096},\ndoi = {10.1145/2568088.2568096},\nacmid = {2568096},\npublisher = {ACM},\naddress = {New York, NY, USA},\nkeywords = {JMS, measurement, modeling, performance analysis, software performance}\n}\n
\n
\n','
\n@inproceedings{MaMaStTuNoReRe2014-ICPE-JMSModel,\n  author = {Martinec, Tom\\\'{a}c{s} and Marek, Luk\\\'{a}\\c{s} and Steinhauser, Anton\\\'{i}n and T{u}ma, Petr and Noorshams, Qais and Rentschler, Andreas and Reussner, Ralf},\n  title = {Constructing Performance Model of JMS Middleware Platform},\n  booktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering},\n  series = {ICPE \'14},\n  year = {2014},\n  month = {March},\n  isbn = {978-1-4503-2733-6},\n  location = {Dublin, Ireland},\n  pages = {123--134},\n  numpages = {12},\n  url = {http://doi.acm.org/10.1145/2568088.2568096},\n  doi = {10.1145/2568088.2568096},\n  acmid = {2568096},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  keywords = {JMS, measurement, modeling, performance analysis, software performance}\n}\n
\n\n',NULL,'Constructing Performance Model of JMS Middleware Platform',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(420,'paper','Meier2010Tra','mastersthesis','@mastersthesis{Meier2010Tra,\n address = {{Karlsruhe, Germany}},\n author = {Philipp Meier},\n note = {FZI Prize \"Best Diploma Thesis\"},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Automated Transformation of Palladio Component Models to Queueing Petri Nets}},\n year = {2010},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/420.pdf},\n}\n\n','\n\nPhilipp Meier.\nAutomated Transformation of Palladio Component Models to Queueing\nPetri Nets.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, 2010.\nFZI Prize \"Best Diploma Thesis\".\n[ bib | .pdf  ] 
\n@mastersthesis{Meier2010Tra,\naddress = {{Karlsruhe, Germany}},\nauthor = {Philipp Meier},\nnote = {FZI Prize \"Best Diploma Thesis\"},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Automated Transformation of Palladio Component Models to Queueing Petri Nets}},\nyear = {2010},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/420.pdf}\n}\n
\n
\n','
\n@mastersthesis{Meier2010Tra,\n  address = {{Karlsruhe, Germany}},\n  author = {Philipp Meier},\n  note = {FZI Prize \"Best Diploma Thesis\"},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Automated Transformation of Palladio Component Models to Queueing Petri Nets}},\n  year = {2010},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/420.pdf}\n}\n
\n\n',NULL,'{Automated Transformation of Palladio Component Models to Queueing Petri Nets}',0,0,2010,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(421,'paper','MeKoKo2011-MASCOTS-PCMtoQPN','inproceedings','@inproceedings{MeKoKo2011-MASCOTS-PCMtoQPN,\n title = {Automated Transformation of Component-based Software Architecture Models to Queueing Petri Nets},\n year = {2011},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/421.pdf},\n booktitle = {19th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2011), Singapore, July 25--27},\n author = {Meier, Philipp and Kounev, Samuel and Koziolek, Heiko},\n}\n\n','\n\nPhilipp Meier, Samuel Kounev, and Heiko Koziolek.\nAutomated transformation of component-based software architecture\nmodels to queueing petri nets.\nIn 19th IEEE/ACM International Symposium on Modeling, Analysis\nand Simulation of Computer and Telecommunication Systems (MASCOTS 2011),\nSingapore, July 25-27, 2011.\n[ bib | .pdf  ] 
\n@inproceedings{MeKoKo2011-MASCOTS-PCMtoQPN,\ntitle = {Automated Transformation of Component-based Software Architecture Models to Queueing Petri Nets},\nyear = {2011},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/421.pdf},\nbooktitle = {19th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2011), Singapore, July 25--27},\nauthor = {Meier, Philipp and Kounev, Samuel and Koziolek, Heiko}\n}\n
\n
\n','
\n@inproceedings{MeKoKo2011-MASCOTS-PCMtoQPN,\n  title = {Automated Transformation of Component-based Software Architecture Models to Queueing Petri Nets},\n  year = {2011},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/421.pdf},\n  booktitle = {19th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2011), Singapore, July 25--27},\n  author = {Meier, Philipp and Kounev, Samuel and Koziolek, Heiko}\n}\n
\n\n',NULL,'Automated Transformation of Component-based Software Architecture Models to Queueing Petri Nets',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(432,'paper','MiIoKoSaRyDiCiRo2013-TechReport-CloudUsagePatterns','techreport','@techreport{MiIoKoSaRyDiCiRo2013-TechReport-CloudUsagePatterns,\n abstract = {{Cloud computing is becoming an increasingly lucrative branch of the existing information and communication technologies (ICT). Enabling a debate about cloud usage scenarios can help with attracting new customers, sharing best-practices, and designing new cloud services. In contrast to previous approaches, which have attempted mainly to formalize the common service delivery models (i.e., Infrastructure-as-a-Service, Platform-as-a-Service, and Software-as-a-Service), in this work, we propose a formalism for describing common cloud usage scenarios referred to as cloud usage patterns. Our formalism takes a structuralist approach allowing decomposition of a cloud usage scenario into elements corresponding to the common cloud service delivery models. Furthermore, our formalism considers several cloud usage patterns that have recently emerged, such as hybrid services and value chains in which mediators are involved, also referred to as value chains with mediators. We propose a simple yet expressive textual and visual language for our formalism, and we show how it can be used in practice for describing a variety of real-world cloud usage scenarios. The scenarios for which we demonstrate our formalism include resource provisioning of global providers of infrastructure and/or platform resources, online social networking services, user-data processing services, online customer and ticketing services, online asset management and banking applications, CRM (Customer Relationship Management) applications, and online social gaming applications.}},\n address = {{7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}},\n author = {Aleksandar Milenkoski and Alexandru Iosup and Samuel Kounev and Kai Sachs and Piotr Rygielski and Jason Ding and Walfredo Cirne and Florian Rosenberg},\n institution = {SPEC Research Group - Cloud Working Group, Standard Performance Evaluation Corporation (SPEC)},\n month = {May},\n url = {http://research.spec.org/fileadmin/user_upload/documents/rg_cloud/endorsed_publications/SPEC-RG-2013-001_CloudUsagePatterns.pdf},\n title = {{Cloud Usage Patterns: A Formalism for Description of Cloud Usage Scenarios}},\n type = {{Technical Report SPEC-RG-2013-001 v.1.0.1}},\n year = {2013},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/432.pdf},\n}\n\n','\n\nAleksandar Milenkoski, Alexandru Iosup, Samuel Kounev, Kai Sachs, Piotr\nRygielski, Jason Ding, Walfredo Cirne, and Florian Rosenberg.\nCloud Usage Patterns: A Formalism for Description of Cloud Usage\nScenarios.\nTechnical Report SPEC-RG-2013-001 v.1.0.1, SPEC Research Group -\nCloud Working Group, Standard Performance Evaluation Corporation (SPEC),\n7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA, May\n2013.\n[ bib | .pdf | .pdf | Abstract  ] 
\n@techreport{MiIoKoSaRyDiCiRo2013-TechReport-CloudUsagePatterns,\nabstract = {{Cloud computing is becoming an increasingly lucrative branch of the existing information and communication technologies (ICT). Enabling a debate about cloud usage scenarios can help with attracting new customers, sharing best-practices, and designing new cloud services. In contrast to previous approaches, which have attempted mainly to formalize the common service delivery models (i.e., Infrastructure-as-a-Service, Platform-as-a-Service, and Software-as-a-Service), in this work, we propose a formalism for describing common cloud usage scenarios referred to as cloud usage patterns. Our formalism takes a structuralist approach allowing decomposition of a cloud usage scenario into elements corresponding to the common cloud service delivery models. Furthermore, our formalism considers several cloud usage patterns that have recently emerged, such as hybrid services and value chains in which mediators are involved, also referred to as value chains with mediators. We propose a simple yet expressive textual and visual language for our formalism, and we show how it can be used in practice for describing a variety of real-world cloud usage scenarios. The scenarios for which we demonstrate our formalism include resource provisioning of global providers of infrastructure and/or platform resources, online social networking services, user-data processing services, online customer and ticketing services, online asset management and banking applications, CRM (Customer Relationship Management) applications, and online social gaming applications.}},\naddress = {{7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}},\nauthor = {Aleksandar Milenkoski and Alexandru Iosup and Samuel Kounev and Kai Sachs and Piotr Rygielski and Jason Ding and Walfredo Cirne and Florian Rosenberg},\ninstitution = {SPEC Research Group - Cloud Working Group, Standard Performance Evaluation Corporation (SPEC)},\nmonth = {May},\nurl = {http://research.spec.org/fileadmin/user_upload/documents/rg_cloud/endorsed_publications/SPEC-RG-2013-001_CloudUsagePatterns.pdf},\ntitle = {{Cloud Usage Patterns: A Formalism for Description of Cloud Usage Scenarios}},\ntype = {{Technical Report SPEC-RG-2013-001 v.1.0.1}},\nyear = {2013},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/432.pdf}\n}\n
\n
\nCloud computing is becoming an increasingly lucrative branch of the existing information and communication technologies (ICT). Enabling a debate about cloud usage scenarios can help with attracting new customers, sharing best-practices, and designing new cloud services. In contrast to previous approaches, which have attempted mainly to formalize the common service delivery models (i.e., Infrastructure-as-a-Service, Platform-as-a-Service, and Software-as-a-Service), in this work, we propose a formalism for describing common cloud usage scenarios referred to as cloud usage patterns. Our formalism takes a structuralist approach allowing decomposition of a cloud usage scenario into elements corresponding to the common cloud service delivery models. Furthermore, our formalism considers several cloud usage patterns that have recently emerged, such as hybrid services and value chains in which mediators are involved, also referred to as value chains with mediators. We propose a simple yet expressive textual and visual language for our formalism, and we show how it can be used in practice for describing a variety of real-world cloud usage scenarios. The scenarios for which we demonstrate our formalism include resource provisioning of global providers of infrastructure and/or platform resources, online social networking services, user-data processing services, online customer and ticketing services, online asset management and banking applications, CRM (Customer Relationship Management) applications, and online social gaming applications.\n
\n','
\n@techreport{MiIoKoSaRyDiCiRo2013-TechReport-CloudUsagePatterns,\n  abstract = {{Cloud computing is becoming an increasingly lucrative branch of the existing information and communication technologies (ICT). Enabling a debate about cloud usage scenarios can help with attracting new customers, sharing best-practices, and designing new cloud services. In contrast to previous approaches, which have attempted mainly to formalize the common service delivery models (i.e., Infrastructure-as-a-Service, Platform-as-a-Service, and Software-as-a-Service), in this work, we propose a formalism for describing common cloud usage scenarios referred to as cloud usage patterns. Our formalism takes a structuralist approach allowing decomposition of a cloud usage scenario into elements corresponding to the common cloud service delivery models. Furthermore, our formalism considers several cloud usage patterns that have recently emerged, such as hybrid services and value chains in which mediators are involved, also referred to as value chains with mediators. We propose a simple yet expressive textual and visual language for our formalism, and we show how it can be used in practice for describing a variety of real-world cloud usage scenarios. The scenarios for which we demonstrate our formalism include resource provisioning of global providers of infrastructure and/or platform resources, online social networking services, user-data processing services, online customer and ticketing services, online asset management and banking applications, CRM (Customer Relationship Management) applications, and online social gaming applications.}},\n  address = {{7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}},\n  author = {Aleksandar Milenkoski and Alexandru Iosup and Samuel Kounev and Kai Sachs and Piotr Rygielski and Jason Ding and Walfredo Cirne and Florian Rosenberg},\n  institution = {SPEC Research Group - Cloud Working Group, Standard Performance Evaluation Corporation (SPEC)},\n  month = {May},\n  url = {http://research.spec.org/fileadmin/user_upload/documents/rg_cloud/endorsed_publications/SPEC-RG-2013-001_CloudUsagePatterns.pdf},\n  title = {{Cloud Usage Patterns: A Formalism for Description of Cloud Usage Scenarios}},\n  type = {{Technical Report SPEC-RG-2013-001 v.1.0.1}},\n  year = {2013},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/432.pdf}\n}\n
\n\n','{Cloud computing is becoming an increasingly lucrative branch of the existing information and communication technologies (ICT). Enabling a debate about cloud usage scenarios can help with attracting new customers, sharing best-practices, and designing new cloud services. In contrast to previous approaches, which have attempted mainly to formalize the common service delivery models (i.e., Infrastructure-as-a-Service, Platform-as-a-Service, and Software-as-a-Service), in this work, we propose a formalism for describing common cloud usage scenarios referred to as cloud usage patterns. Our formalism takes a structuralist approach allowing decomposition of a cloud usage scenario into elements corresponding to the common cloud service delivery models. Furthermore, our formalism considers several cloud usage patterns that have recently emerged, such as hybrid services and value chains in which mediators are involved, also referred to as value chains with mediators. We propose a simple yet expressive textual and visual language for our formalism, and we show how it can be used in practice for describing a variety of real-world cloud usage scenarios. The scenarios for which we demonstrate our formalism include resource provisioning of global providers of infrastructure and/or platform resources, online social networking services, user-data processing services, online customer and ticketing services, online asset management and banking applications, CRM (Customer Relationship Management) applications, and online social gaming applications.}','{Cloud Usage Patterns: A Formalism for Description of Cloud Usage Scenarios}',0,5,2013,5,NULL,NULL,'Cloud','0000-00-00 00:00:00','2016-06-01 09:40:58',0),(433,'paper','MiKoAvAnVi2013-TechReport-OnBenchmarkingIDSes','techreport','@techreport{MiKoAvAnVi2013-TechReport-OnBenchmarkingIDSes,\n abstract = {{Modern intrusion detection systems (IDSes) for virtualized environments are deployed in the virtualization layer with components inside the virtual machine monitor (VMM) and the trusted host virtual machine (VM). Such IDSes can monitor at the same time the network and host activities of all guest VMs running on top of a VMM being isolated from malicious users of these VMs. We refer to IDSes for virtualized environments as VMM-based IDSes. In this work, we analyze state-of-the-art intrusion detection techniques applied in virtualized environments and architectures of VMM-based IDSes. Further, we identify challenges that apply specifically to benchmarking VMM-based IDSes focussing on workloads and metrics. For example, we discuss the challenge of defining representative baseline benign workload profiles as well as the challenge of defining malicious workloads containing attacks targeted at the VMM. We also discuss the impact of on-demand resource provisioning features of virtualized environments (e.g., CPU and memory hotplugging, memory ballooning) on IDS benchmarking measures such as capacity and attack detection accuracy. Finally, we outline future research directions in the area of benchmarking VMM-based IDSes and of intrusion detection in virtualized environments in general.}},\n address = {{7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}},\n author = {Aleksandar Milenkoski and Samuel Kounev and Alberto Avritzer and Nuno Antunes and Marco Vieira},\n institution = {SPEC Research Group - IDS Benchmarking Working Group, Standard Performance Evaluation Corporation (SPEC)},\n month = {June},\n pdf = {http://research.spec.org/fileadmin/user_upload/documents/wg_ids/endorsed_publications/SPEC-RG-2013-002-BenchmarkingVMMBIDSes.pdf},\n title = {{On Benchmarking Intrusion Detection Systems in Virtualized Environments}},\n type = {{Technical Report SPEC-RG-2013-002 v.1.0}},\n year = {2013},\n}\n\n','\n\nAleksandar Milenkoski, Samuel Kounev, Alberto Avritzer, Nuno Antunes, and Marco\nVieira.\nOn Benchmarking Intrusion Detection Systems in Virtualized\nEnvironments.\nTechnical Report SPEC-RG-2013-002 v.1.0, SPEC Research Group - IDS\nBenchmarking Working Group, Standard Performance Evaluation Corporation\n(SPEC), 7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA,\nJune 2013.\n[ bib | .pdf | Abstract  ] 
\n@techreport{MiKoAvAnVi2013-TechReport-OnBenchmarkingIDSes,\nabstract = {{Modern intrusion detection systems (IDSes) for virtualized environments are deployed in the virtualization layer with components inside the virtual machine monitor (VMM) and the trusted host virtual machine (VM). Such IDSes can monitor at the same time the network and host activities of all guest VMs running on top of a VMM being isolated from malicious users of these VMs. We refer to IDSes for virtualized environments as VMM-based IDSes. In this work, we analyze state-of-the-art intrusion detection techniques applied in virtualized environments and architectures of VMM-based IDSes. Further, we identify challenges that apply specifically to benchmarking VMM-based IDSes focussing on workloads and metrics. For example, we discuss the challenge of defining representative baseline benign workload profiles as well as the challenge of defining malicious workloads containing attacks targeted at the VMM. We also discuss the impact of on-demand resource provisioning features of virtualized environments (e.g., CPU and memory hotplugging, memory ballooning) on IDS benchmarking measures such as capacity and attack detection accuracy. Finally, we outline future research directions in the area of benchmarking VMM-based IDSes and of intrusion detection in virtualized environments in general.}},\naddress = {{7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}},\nauthor = {Aleksandar Milenkoski and Samuel Kounev and Alberto Avritzer and Nuno Antunes and Marco Vieira},\ninstitution = {SPEC Research Group - IDS Benchmarking Working Group, Standard Performance Evaluation Corporation (SPEC)},\nmonth = {June},\npdf = {http://research.spec.org/fileadmin/user_upload/documents/wg_ids/endorsed_publications/SPEC-RG-2013-002-BenchmarkingVMMBIDSes.pdf},\ntitle = {{On Benchmarking Intrusion Detection Systems in Virtualized Environments}},\ntype = {{Technical Report SPEC-RG-2013-002 v.1.0}},\nyear = {2013}\n}\n
\n
\nModern intrusion detection systems (IDSes) for virtualized environments are deployed in the virtualization layer with components inside the virtual machine monitor (VMM) and the trusted host virtual machine (VM). Such IDSes can monitor at the same time the network and host activities of all guest VMs running on top of a VMM being isolated from malicious users of these VMs. We refer to IDSes for virtualized environments as VMM-based IDSes. In this work, we analyze state-of-the-art intrusion detection techniques applied in virtualized environments and architectures of VMM-based IDSes. Further, we identify challenges that apply specifically to benchmarking VMM-based IDSes focussing on workloads and metrics. For example, we discuss the challenge of defining representative baseline benign workload profiles as well as the challenge of defining malicious workloads containing attacks targeted at the VMM. We also discuss the impact of on-demand resource provisioning features of virtualized environments (e.g., CPU and memory hotplugging, memory ballooning) on IDS benchmarking measures such as capacity and attack detection accuracy. Finally, we outline future research directions in the area of benchmarking VMM-based IDSes and of intrusion detection in virtualized environments in general.\n
\n','
\n@techreport{MiKoAvAnVi2013-TechReport-OnBenchmarkingIDSes,\n  abstract = {{Modern intrusion detection systems (IDSes) for virtualized environments are deployed in the virtualization layer with components inside the virtual machine monitor (VMM) and the trusted host virtual machine (VM). Such IDSes can monitor at the same time the network and host activities of all guest VMs running on top of a VMM being isolated from malicious users of these VMs. We refer to IDSes for virtualized environments as VMM-based IDSes. In this work, we analyze state-of-the-art intrusion detection techniques applied in virtualized environments and architectures of VMM-based IDSes. Further, we identify challenges that apply specifically to benchmarking VMM-based IDSes focussing on workloads and metrics. For example, we discuss the challenge of defining representative baseline benign workload profiles as well as the challenge of defining malicious workloads containing attacks targeted at the VMM. We also discuss the impact of on-demand resource provisioning features of virtualized environments (e.g., CPU and memory hotplugging, memory ballooning) on IDS benchmarking measures such as capacity and attack detection accuracy. Finally, we outline future research directions in the area of benchmarking VMM-based IDSes and of intrusion detection in virtualized environments in general.}},\n  address = {{7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}},\n  author = {Aleksandar Milenkoski and Samuel Kounev and Alberto Avritzer and Nuno Antunes and Marco Vieira},\n  institution = {SPEC Research Group - IDS Benchmarking Working Group, Standard Performance Evaluation Corporation (SPEC)},\n  month = {June},\n  pdf = {http://research.spec.org/fileadmin/user_upload/documents/wg_ids/endorsed_publications/SPEC-RG-2013-002-BenchmarkingVMMBIDSes.pdf},\n  title = {{On Benchmarking Intrusion Detection Systems in Virtualized Environments}},\n  type = {{Technical Report SPEC-RG-2013-002 v.1.0}},\n  year = {2013}\n}\n
\n\n','{Modern intrusion detection systems (IDSes) for virtualized environments are deployed in the virtualization layer with components inside the virtual machine monitor (VMM) and the trusted host virtual machine (VM). Such IDSes can monitor at the same time the network and host activities of all guest VMs running on top of a VMM being isolated from malicious users of these VMs. We refer to IDSes for virtualized environments as VMM-based IDSes. In this work, we analyze state-of-the-art intrusion detection techniques applied in virtualized environments and architectures of VMM-based IDSes. Further, we identify challenges that apply specifically to benchmarking VMM-based IDSes focussing on workloads and metrics. For example, we discuss the challenge of defining representative baseline benign workload profiles as well as the challenge of defining malicious workloads containing attacks targeted at the VMM. We also discuss the impact of on-demand resource provisioning features of virtualized environments (e.g., CPU and memory hotplugging, memory ballooning) on IDS benchmarking measures such as capacity and attack detection accuracy. Finally, we outline future research directions in the area of benchmarking VMM-based IDSes and of intrusion detection in virtualized environments in general.}','{On Benchmarking Intrusion Detection Systems in Virtualized Environments}',0,6,2013,6,NULL,NULL,'Intrusion detection; Virtual machine introspection','0000-00-00 00:00:00','2016-06-01 09:40:58',0),(434,'paper','MiKo2011-ICITST-TowardsBenchmarking','inproceedings','@inproceedings{MiKo2011-ICITST-TowardsBenchmarking,\n abstract = {{Many recent research works propose novel architectures of intrusion detection systems specifically designed to operate in virtualized environments. However, little attention has been given to the evaluation and benchmarking of such architectures with respect to their performance and dependability. In this paper, we present a research roadmap towards developing a framework for benchmarking intrusion detection systems for cloud environments in a scientifically rigorous and a representative manner.}},\n address = {New York, USA},\n author = {Aleksandar Milenkoski and Samuel Kounev},\n booktitle = {Proceedings of the 7th International Conference for Internet Technology and Secured Transactions (ICITST 2012)},\n location = {London, United Kingdom},\n month = {December},\n pages = {562--563},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/434.pdf},\n publisher = {IEEE},\n title = {{Towards Benchmarking Intrusion Detection Systems for Virtualized Cloud Environments}},\n titleaddon = {{(Work-in-Progress Paper)}},\n url = {http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6470873},\n year = {2012},\n}\n\n','\n\nAleksandar Milenkoski and Samuel Kounev.\nTowards Benchmarking Intrusion Detection Systems for Virtualized\nCloud Environments (Work-in-Progress Paper).\nIn Proceedings of the 7th International Conference for Internet\nTechnology and Secured Transactions (ICITST 2012), London, United Kingdom,\nDecember 2012, pages 562-563. IEEE, New York, USA.\nDecember 2012.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{MiKo2011-ICITST-TowardsBenchmarking,\nabstract = {{Many recent research works propose novel architectures of intrusion detection systems specifically designed to operate in virtualized environments. However, little attention has been given to the evaluation and benchmarking of such architectures with respect to their performance and dependability. In this paper, we present a research roadmap towards developing a framework for benchmarking intrusion detection systems for cloud environments in a scientifically rigorous and a representative manner.}},\naddress = {New York, USA},\nauthor = {Aleksandar Milenkoski and Samuel Kounev},\nbooktitle = {Proceedings of the 7th International Conference for Internet Technology and Secured Transactions (ICITST 2012)},\nlocation = {London, United Kingdom},\nmonth = {December},\npages = {562--563},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/434.pdf},\npublisher = {IEEE},\ntitle = {{Towards Benchmarking Intrusion Detection Systems for Virtualized Cloud Environments}},\ntitleaddon = {{(Work-in-Progress Paper)}},\nurl = {http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6470873},\nyear = {2012}\n}\n
\n
\nMany recent research works propose novel architectures of intrusion detection systems specifically designed to operate in virtualized environments. However, little attention has been given to the evaluation and benchmarking of such architectures with respect to their performance and dependability. In this paper, we present a research roadmap towards developing a framework for benchmarking intrusion detection systems for cloud environments in a scientifically rigorous and a representative manner.\n
\n','
\n@inproceedings{MiKo2011-ICITST-TowardsBenchmarking,\n  abstract = {{Many recent research works propose novel architectures of intrusion detection systems specifically designed to operate in virtualized environments. However, little attention has been given to the evaluation and benchmarking of such architectures with respect to their performance and dependability. In this paper, we present a research roadmap towards developing a framework for benchmarking intrusion detection systems for cloud environments in a scientifically rigorous and a representative manner.}},\n  address = {New York, USA},\n  author = {Aleksandar Milenkoski and Samuel Kounev},\n  booktitle = {Proceedings of the 7th International Conference for Internet Technology and Secured Transactions (ICITST 2012)},\n  location = {London, United Kingdom},\n  month = {December},\n  pages = {562--563},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/434.pdf},\n  publisher = {IEEE},\n  title = {{Towards Benchmarking Intrusion Detection Systems for Virtualized Cloud Environments}},\n  titleaddon = {{(Work-in-Progress Paper)}},\n  url = {http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6470873},\n  year = {2012}\n}\n
\n\n','{Many recent research works propose novel architectures of intrusion detection systems specifically designed to operate in virtualized environments. However, little attention has been given to the evaluation and benchmarking of such architectures with respect to their performance and dependability. In this paper, we present a research roadmap towards developing a framework for benchmarking intrusion detection systems for cloud environments in a scientifically rigorous and a representative manner.}','{Towards Benchmarking Intrusion Detection Systems for Virtualized Cloud Environments}',0,12,2012,12,NULL,NULL,'Intrusion detection; Virtual machine introspection','0000-00-00 00:00:00','2016-06-01 09:40:58',0),(435,'paper','MiPaAnViKo2013-ACSAC-HInjector','inproceedings','@inproceedings{MiPaAnViKo2013-ACSAC-HInjector,\n address = {Maryland, USA},\n author = {Aleksandar Milenkoski and Bryan D. Payne and Nuno Antunes and Marco Vieira and Samuel Kounev},\n booktitle = {The 2013 Annual Computer Security Applications Conference (ACSAC 2013)},\n publisher = {{Applied Computer Security Associates (ACSA)}},\n location = {New Orleans, Louisiana, USA},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/435.pdf},\n title = {{HInjector: Injecting Hypercall Attacks for Evaluating VMI-based Intrusion Detection Systems}},\n titleaddon = {{(Poster Paper)}},\n year = {2013},\n month = {March},\n}\n\n','\n\nAleksandar Milenkoski, Bryan D. Payne, Nuno Antunes, Marco Vieira, and Samuel\nKounev.\nHInjector: Injecting Hypercall Attacks for Evaluating VMI-based\nIntrusion Detection Systems (Poster Paper).\nIn The 2013 Annual Computer Security Applications Conference\n(ACSAC 2013), New Orleans, Louisiana, USA, March 2013. Applied Computer\nSecurity Associates (ACSA), Maryland, USA.\nMarch 2013.\n[ bib | .pdf  ] 
\n@inproceedings{MiPaAnViKo2013-ACSAC-HInjector,\naddress = {Maryland, USA},\nauthor = {Aleksandar Milenkoski and Bryan D. Payne and Nuno Antunes and Marco Vieira and Samuel Kounev},\nbooktitle = {The 2013 Annual Computer Security Applications Conference (ACSAC 2013)},\npublisher = {{Applied Computer Security Associates (ACSA)}},\nlocation = {New Orleans, Louisiana, USA},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/435.pdf},\ntitle = {{HInjector: Injecting Hypercall Attacks for Evaluating VMI-based Intrusion Detection Systems}},\ntitleaddon = {{(Poster Paper)}},\nyear = {2013},\nmonth = {March}\n}\n
\n
\n','
\n@inproceedings{MiPaAnViKo2013-ACSAC-HInjector,\n  address = {Maryland, USA},\n  author = {Aleksandar Milenkoski and Bryan D. Payne and Nuno Antunes and Marco Vieira and Samuel Kounev},\n  booktitle = {The 2013 Annual Computer Security Applications Conference (ACSAC 2013)},\n  publisher = {{Applied Computer Security Associates (ACSA)}},\n  location = {New Orleans, Louisiana, USA},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/435.pdf},\n  title = {{HInjector: Injecting Hypercall Attacks for Evaluating VMI-based Intrusion Detection Systems}},\n  titleaddon = {{(Poster Paper)}},\n  year = {2013},\n  month = {March}\n}\n
\n\n',NULL,'{HInjector: Injecting Hypercall Attacks for Evaluating VMI-based Intrusion Detection Systems}',0,3,2013,3,NULL,NULL,'Intrusion detection; Virtual machine introspection','0000-00-00 00:00:00','2016-06-01 09:40:58',0),(436,'paper','MoBaVe2012-EUROSYS','inproceedings','@inproceedings{MoBaVe2012-EUROSYS,\n author = {Mohammadi, Seyed Vahid and Bauer, Markus and Verdejo, Adrian Juan},\n booktitle = {Proceedings of the 6th EuroSys Doctoral Workshop (EuroDW 2012)},\n location = {Bern, Switzerland},\n title = {Dynamic Cloud Reconfiguration to Meet QoS Requirements},\n year = {2012},\n}\n\n','\n\nSeyed Vahid Mohammadi, Markus Bauer, and Adrian Juan Verdejo.\nDynamic cloud reconfiguration to meet qos requirements.\nIn Proceedings of the 6th EuroSys Doctoral Workshop (EuroDW\n2012), Bern, Switzerland, 2012.\n[ bib  ] 
\n@inproceedings{MoBaVe2012-EUROSYS,\nauthor = {Mohammadi, Seyed Vahid and Bauer, Markus and Verdejo, Adrian Juan},\nbooktitle = {Proceedings of the 6th EuroSys Doctoral Workshop (EuroDW 2012)},\nlocation = {Bern, Switzerland},\ntitle = {Dynamic Cloud Reconfiguration to Meet QoS Requirements},\nyear = {2012}\n}\n
\n
\n','
\n@inproceedings{MoBaVe2012-EUROSYS,\n  author = {Mohammadi, Seyed Vahid and Bauer, Markus and Verdejo, Adrian Juan},\n  booktitle = {Proceedings of the 6th EuroSys Doctoral Workshop (EuroDW 2012)},\n  location = {Bern, Switzerland},\n  title = {Dynamic Cloud Reconfiguration to Meet QoS Requirements},\n  year = {2012}\n}\n
\n\n',NULL,'Dynamic Cloud Reconfiguration to Meet QoS Requirements',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(440,'paper','MoKr2011-esosym-qualitative-discussion','inproceedings','@inproceedings{MoKr2011-esosym-qualitative-discussion,\n address = {Bonn-Buschdorf, Germany},\n author = {Momm, Christof and Krebs, Rouven},\n booktitle = {Proceedings of the Software Engineering 2011 -- Workshopband (ESoSyM-2011)},\n day = {21},\n editor = {Reussner, Ralf and Pretschner, Alexander amd J{\\\"a}hnichen, Stefan},\n isbn = {978-3-88579-278-9},\n location = {Karlsruhe, Germany},\n month = {February},\n organization = {Fachgruppe OOSE der Gesellschaft f{\\\"u}r Informatik und ihrer Arbeitskreise},\n pages = {139--150},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/440.pdf},\n publisher = {Bonner K\\\"ollen Verlag},\n title = {{A} {Q}ualitative {D}iscussion of {D}ifferent {A}pproaches for {I}mplementing {M}ulti-{T}enant {S}aa{S} {O}fferings},\n titleaddon = {{(Short Paper)}},\n year = {2011},\n}\n\n','\n\nChristof Momm and Rouven Krebs.\nA Qualitative Discussion of Different Approaches for\nImplementing Multi-Tenant SaaS Offerings (Short Paper).\nIn Proceedings of the Software Engineering 2011 - Workshopband\n(ESoSyM-2011), Ralf Reussner and Stefan Pretschner, Alexander\namd Jähnichen, editors, Karlsruhe, Germany, February 21, 2011, pages\n139-150. Fachgruppe OOSE der Gesellschaft für Informatik und ihrer\nArbeitskreise, Bonner Köllen Verlag, Bonn-Buschdorf, Germany.\nFebruary 2011.\n[ bib | .pdf  ] 
\n@inproceedings{MoKr2011-esosym-qualitative-discussion,\naddress = {Bonn-Buschdorf, Germany},\nauthor = {Momm, Christof and Krebs, Rouven},\nbooktitle = {Proceedings of the Software Engineering 2011 -- Workshopband (ESoSyM-2011)},\nday = {21},\neditor = {Reussner, Ralf and Pretschner, Alexander amd J{\\\"a}hnichen, Stefan},\nisbn = {978-3-88579-278-9},\nlocation = {Karlsruhe, Germany},\nmonth = {February},\norganization = {Fachgruppe OOSE der Gesellschaft f{\\\"u}r Informatik und ihrer Arbeitskreise},\npages = {139--150},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/440.pdf},\npublisher = {Bonner K\\\"ollen Verlag},\ntitle = {{A} {Q}ualitative {D}iscussion of {D}ifferent {A}pproaches for {I}mplementing {M}ulti-{T}enant {S}aa{S} {O}fferings},\ntitleaddon = {{(Short Paper)}},\nyear = {2011}\n}\n
\n
\n','
\n@inproceedings{MoKr2011-esosym-qualitative-discussion,\n  address = {Bonn-Buschdorf, Germany},\n  author = {Momm, Christof and Krebs, Rouven},\n  booktitle = {Proceedings of the Software Engineering 2011 -- Workshopband (ESoSyM-2011)},\n  day = {21},\n  editor = {Reussner, Ralf and Pretschner, Alexander amd J{\\\"a}hnichen, Stefan},\n  isbn = {978-3-88579-278-9},\n  location = {Karlsruhe, Germany},\n  month = {February},\n  organization = {Fachgruppe OOSE der Gesellschaft f{\\\"u}r Informatik und ihrer Arbeitskreise},\n  pages = {139--150},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/440.pdf},\n  publisher = {Bonner K\\\"ollen Verlag},\n  title = {{A} {Q}ualitative {D}iscussion of {D}ifferent {A}pproaches for {I}mplementing {M}ulti-{T}enant {S}aa{S} {O}fferings},\n  titleaddon = {{(Short Paper)}},\n  year = {2011}\n}\n
\n\n',NULL,'{A} {Q}ualitative {D}iscussion of {D}ifferent {A}pproaches for {I}mplementing {M}ulti-{T}enant {S}aa{S} {O}fferings',0,2,2011,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(442,'paper','momm2007a','inproceedings','@inproceedings{momm2007a,\n abstract = {The management of web service composition, where the employed atomic web services as well as the compositions themselves are offered on basis of Service Level Agreements (SLA), implies new requirements for the management infrastructure. In this paper we introduce the conceptual design and implementation for a standard-based and flexible manageability infrastructure offering comprehensive management information for an SLAdriven management of web service compositions. Our solution thereby is based on well-understood methodologies and standards from the area of application and web service management, in particular the WBEM standards.},\n address = {Stuttgart, Germany},\n author = {Momm, Christof and Mayerl, Christian and Rathfelder, Christoph and Abeck, Sebastian},\n booktitle = {Proceedings of the 14th Annual Workshop of HP Software University Association},\n day = {8--11},\n editor = {Hegering, H. -G. and Reiser, H. and Schiffers, M. and Nebe, Th.},\n location = {Leibniz Computing Center and Munich Network Management Team, Germany},\n month = {July},\n pages = {103--114},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/442.pdf},\n publisher = {Infonomies Consulting},\n title = {{A} {M}anageability {I}nfrastructure for the {M}onitoring of {W}eb {S}ervice},\n year = {2007},\n}\n\n','\n\nChristof Momm, Christian Mayerl, Christoph Rathfelder, and Sebastian Abeck.\nA Manageability Infrastructure for the Monitoring of Web\nService.\nIn Proceedings of the 14th Annual Workshop of HP Software\nUniversity Association, H. G. Hegering, H. Reiser, M. Schiffers, and Th.\nNebe, editors, Leibniz Computing Center and Munich Network Management Team,\nGermany, July 8-11, 2007, pages 103-114. Infonomies Consulting, Stuttgart,\nGermany.\nJuly 2007.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{momm2007a,\nabstract = {The management of web service composition, where the employed atomic web services as well as the compositions themselves are offered on basis of Service Level Agreements (SLA), implies new requirements for the management infrastructure. In this paper we introduce the conceptual design and implementation for a standard-based and flexible manageability infrastructure offering comprehensive management information for an SLAdriven management of web service compositions. Our solution thereby is based on well-understood methodologies and standards from the area of application and web service management, in particular the WBEM standards.},\naddress = {Stuttgart, Germany},\nauthor = {Momm, Christof and Mayerl, Christian and Rathfelder, Christoph and Abeck, Sebastian},\nbooktitle = {Proceedings of the 14th Annual Workshop of HP Software University Association},\nday = {8--11},\neditor = {Hegering, H. -G. and Reiser, H. and Schiffers, M. and Nebe, Th.},\nlocation = {Leibniz Computing Center and Munich Network Management Team, Germany},\nmonth = {July},\npages = {103--114},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/442.pdf},\npublisher = {Infonomies Consulting},\ntitle = {{A} {M}anageability {I}nfrastructure for the {M}onitoring of {W}eb {S}ervice},\nyear = {2007}\n}\n
\n
\nThe management of web service composition, where the employed atomic web services as well as the compositions themselves are offered on basis of Service Level Agreements (SLA), implies new requirements for the management infrastructure. In this paper we introduce the conceptual design and implementation for a standard-based and flexible manageability infrastructure offering comprehensive management information for an SLAdriven management of web service compositions. Our solution thereby is based on well-understood methodologies and standards from the area of application and web service management, in particular the WBEM standards.\n
\n','
\n@inproceedings{momm2007a,\n  abstract = {The management of web service composition, where the employed atomic web services as well as the compositions themselves are offered on basis of Service Level Agreements (SLA), implies new requirements for the management infrastructure. In this paper we introduce the conceptual design and implementation for a standard-based and flexible manageability infrastructure offering comprehensive management information for an SLAdriven management of web service compositions. Our solution thereby is based on well-understood methodologies and standards from the area of application and web service management, in particular the WBEM standards.},\n  address = {Stuttgart, Germany},\n  author = {Momm, Christof and Mayerl, Christian and Rathfelder, Christoph and Abeck, Sebastian},\n  booktitle = {Proceedings of the 14th Annual Workshop of HP Software University Association},\n  day = {8--11},\n  editor = {Hegering, H. -G. and Reiser, H. and Schiffers, M. and Nebe, Th.},\n  location = {Leibniz Computing Center and Munich Network Management Team, Germany},\n  month = {July},\n  pages = {103--114},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/442.pdf},\n  publisher = {Infonomies Consulting},\n  title = {{A} {M}anageability {I}nfrastructure for the {M}onitoring of {W}eb {S}ervice},\n  year = {2007}\n}\n
\n\n','The management of web service composition, where the employed atomic web services as well as the compositions themselves are offered on basis of Service Level Agreements (SLA), implies new requirements for the management infrastructure. In this paper we introduce the conceptual design and implementation for a standard-based and flexible manageability infrastructure offering comprehensive management information for an SLAdriven management of web service compositions. Our solution thereby is based on well-understood methodologies and standards from the area of application and web service management, in particular the WBEM standards.','{A} {M}anageability {I}nfrastructure for the {M}onitoring of {W}eb {S}ervice',0,7,2007,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(443,'paper','momm2008b','inproceedings','@inproceedings{momm2008b,\n abstract = {Web service compositions (WSC), as part of a service-oriented architecture (SOA), have to be managed to ensure compliance with guaranteed service levels. In this context, a high degree of automation is desired, which can be achieved by applying autonomic computing concepts. This paper particularly focuses the autonomic management of semi-dynamic compositions. Here, for each included service several variants are available that differ with regard to the service level they offer. Given this scenario, we first show how to instrument WSC in order to allow a controlling of the service level through switching the employed service variant. Second, we show how the desired self-manageability can be designed and implemented by means of a WSC manageability infrastructure. The presented approach is based on widely accepted methodologies and standards from the area of application and web service management, in particular the WBEM standards.},\n address = {Berlin, Germany},\n author = {Christof Momm and Christoph Rathfelder},\n booktitle = {MDD, SOA und IT-Management (MSI 2008)},\n day = {24},\n editor = {Ulrike Steffens and Jan Stefan Addicks and Niels Streekmann},\n location = {Oldenburg, Germany},\n month = {September},\n pages = {25--40},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/443.pdf},\n publisher = {GITO-Verlag},\n title = {{M}odel-based {M}anagement of {W}eb {S}ervice {C}ompositions in {S}ervice-{O}riented {A}rchitectures},\n year = {2008},\n}\n\n','\n\nChristof Momm and Christoph Rathfelder.\nModel-based Management of Web Service Compositions in\nService-Oriented Architectures.\nIn MDD, SOA und IT-Management (MSI 2008), Ulrike Steffens,\nJan Stefan Addicks, and Niels Streekmann, editors, Oldenburg, Germany,\nSeptember 24, 2008, pages 25-40. GITO-Verlag, Berlin, Germany.\nSeptember 2008.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{momm2008b,\nabstract = {Web service compositions (WSC), as part of a service-oriented architecture (SOA), have to be managed to ensure compliance with guaranteed service levels. In this context, a high degree of automation is desired, which can be achieved by applying autonomic computing concepts. This paper particularly focuses the autonomic management of semi-dynamic compositions. Here, for each included service several variants are available that differ with regard to the service level they offer. Given this scenario, we first show how to instrument WSC in order to allow a controlling of the service level through switching the employed service variant. Second, we show how the desired self-manageability can be designed and implemented by means of a WSC manageability infrastructure. The presented approach is based on widely accepted methodologies and standards from the area of application and web service management, in particular the WBEM standards.},\naddress = {Berlin, Germany},\nauthor = {Christof Momm and Christoph Rathfelder},\nbooktitle = {MDD, SOA und IT-Management (MSI 2008)},\nday = {24},\neditor = {Ulrike Steffens and Jan Stefan Addicks and Niels Streekmann},\nlocation = {Oldenburg, Germany},\nmonth = {September},\npages = {25--40},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/443.pdf},\npublisher = {GITO-Verlag},\ntitle = {{M}odel-based {M}anagement of {W}eb {S}ervice {C}ompositions in {S}ervice-{O}riented {A}rchitectures},\nyear = {2008}\n}\n
\n
\nWeb service compositions (WSC), as part of a service-oriented architecture (SOA), have to be managed to ensure compliance with guaranteed service levels. In this context, a high degree of automation is desired, which can be achieved by applying autonomic computing concepts. This paper particularly focuses the autonomic management of semi-dynamic compositions. Here, for each included service several variants are available that differ with regard to the service level they offer. Given this scenario, we first show how to instrument WSC in order to allow a controlling of the service level through switching the employed service variant. Second, we show how the desired self-manageability can be designed and implemented by means of a WSC manageability infrastructure. The presented approach is based on widely accepted methodologies and standards from the area of application and web service management, in particular the WBEM standards.\n
\n','
\n@inproceedings{momm2008b,\n  abstract = {Web service compositions (WSC), as part of a service-oriented architecture (SOA), have to be managed to ensure compliance with guaranteed service levels. In this context, a high degree of automation is desired, which can be achieved by applying autonomic computing concepts. This paper particularly focuses the autonomic management of semi-dynamic compositions. Here, for each included service several variants are available that differ with regard to the service level they offer. Given this scenario, we first show how to instrument WSC in order to allow a controlling of the service level through switching the employed service variant. Second, we show how the desired self-manageability can be designed and implemented by means of a WSC manageability infrastructure. The presented approach is based on widely accepted methodologies and standards from the area of application and web service management, in particular the WBEM standards.},\n  address = {Berlin, Germany},\n  author = {Christof Momm and Christoph Rathfelder},\n  booktitle = {MDD, SOA und IT-Management (MSI 2008)},\n  day = {24},\n  editor = {Ulrike Steffens and Jan Stefan Addicks and Niels Streekmann},\n  location = {Oldenburg, Germany},\n  month = {September},\n  pages = {25--40},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/443.pdf},\n  publisher = {GITO-Verlag},\n  title = {{M}odel-based {M}anagement of {W}eb {S}ervice {C}ompositions in {S}ervice-{O}riented {A}rchitectures},\n  year = {2008}\n}\n
\n\n','Web service compositions (WSC), as part of a service-oriented architecture (SOA), have to be managed to ensure compliance with guaranteed service levels. In this context, a high degree of automation is desired, which can be achieved by applying autonomic computing concepts. This paper particularly focuses the autonomic management of semi-dynamic compositions. Here, for each included service several variants are available that differ with regard to the service level they offer. Given this scenario, we first show how to instrument WSC in order to allow a controlling of the service level through switching the employed service variant. Second, we show how the desired self-manageability can be designed and implemented by means of a WSC manageability infrastructure. The presented approach is based on widely accepted methodologies and standards from the area of application and web service management, in particular the WBEM standards.','{M}odel-based {M}anagement of {W}eb {S}ervice {C}ompositions in {S}ervice-{O}riented {A}rchitectures',0,9,2008,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(444,'paper','momm2006a','techreport','@techreport{momm2006a,\n abstract = {The management of process-oriented service composition within a dynamic environment, where the employed core services are offered on service marketplaces and dynamically included into the composition on basis of Service Level Agreements (SLA), demands for a service management application that takes into account the specifics of processoriented compositions and supports their automated provisioning. As a first step towards such an application, in this paper we introduce the conceptual design for an architecture and implementation of an interoperable and flexible manageability infrastructure offering comprehensive monitoring and control functionality for the management of service compositions. To achieve this, our approach is based on well-understood methodologies and standards from the area of application and web service management.},\n author = {Momm, Christof and Rathfelder, Christoph and Abeck, Sebastian},\n institution = {Cooperation {&} Management},\n location = {Karlsruhe, Germany},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/444.pdf},\n title = {{T}owards a {M}anageability {I}nfrastructure for a {M}anagement of {P}rocess-{B}ased {S}ervice {C}ompositions},\n type = {C{&}M Research Report},\n year = {2006},\n}\n\n','\n\nChristof Momm, Christoph Rathfelder, and Sebastian Abeck.\nTowards a Manageability Infrastructure for a Management of\nProcess-Based Service Compositions.\nC&m research report, Cooperation & Management, 2006.\n[ bib | .pdf | Abstract  ] 
\n@techreport{momm2006a,\nabstract = {The management of process-oriented service composition within a dynamic environment, where the employed core services are offered on service marketplaces and dynamically included into the composition on basis of Service Level Agreements (SLA), demands for a service management application that takes into account the specifics of processoriented compositions and supports their automated provisioning. As a first step towards such an application, in this paper we introduce the conceptual design for an architecture and implementation of an interoperable and flexible manageability infrastructure offering comprehensive monitoring and control functionality for the management of service compositions. To achieve this, our approach is based on well-understood methodologies and standards from the area of application and web service management.},\nauthor = {Momm, Christof and Rathfelder, Christoph and Abeck, Sebastian},\ninstitution = {Cooperation {&} Management},\nlocation = {Karlsruhe, Germany},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/444.pdf},\ntitle = {{T}owards a {M}anageability {I}nfrastructure for a {M}anagement of {P}rocess-{B}ased {S}ervice {C}ompositions},\ntype = {C{&}M Research Report},\nyear = {2006}\n}\n
\n
\nThe management of process-oriented service composition within a dynamic environment, where the employed core services are offered on service marketplaces and dynamically included into the composition on basis of Service Level Agreements (SLA), demands for a service management application that takes into account the specifics of processoriented compositions and supports their automated provisioning. As a first step towards such an application, in this paper we introduce the conceptual design for an architecture and implementation of an interoperable and flexible manageability infrastructure offering comprehensive monitoring and control functionality for the management of service compositions. To achieve this, our approach is based on well-understood methodologies and standards from the area of application and web service management.\n
\n','
\n@techreport{momm2006a,\n  abstract = {The management of process-oriented service composition within a dynamic environment, where the employed core services are offered on service marketplaces and dynamically included into the composition on basis of Service Level Agreements (SLA), demands for a service management application that takes into account the specifics of processoriented compositions and supports their automated provisioning. As a first step towards such an application, in this paper we introduce the conceptual design for an architecture and implementation of an interoperable and flexible manageability infrastructure offering comprehensive monitoring and control functionality for the management of service compositions. To achieve this, our approach is based on well-understood methodologies and standards from the area of application and web service management.},\n  author = {Momm, Christof and Rathfelder, Christoph and Abeck, Sebastian},\n  institution = {Cooperation {&} Management},\n  location = {Karlsruhe, Germany},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/444.pdf},\n  title = {{T}owards a {M}anageability {I}nfrastructure for a {M}anagement of {P}rocess-{B}ased {S}ervice {C}ompositions},\n  type = {C{&}M Research Report},\n  year = {2006}\n}\n
\n\n','The management of process-oriented service composition within a dynamic environment, where the employed core services are offered on service marketplaces and dynamically included into the composition on basis of Service Level Agreements (SLA), demands for a service management application that takes into account the specifics of processoriented compositions and supports their automated provisioning. As a first step towards such an application, in this paper we introduce the conceptual design for an architecture and implementation of an interoperable and flexible manageability infrastructure offering comprehensive monitoring and control functionality for the management of service compositions. To achieve this, our approach is based on well-understood methodologies and standards from the area of application and web service management.','{T}owards a {M}anageability {I}nfrastructure for a {M}anagement of {P}rocess-{B}ased {S}ervice {C}ompositions',0,0,2006,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(445,'paper','momm2008a','inproceedings','@inproceedings{momm2008a,\n abstract = {Web service compositions (WSC), as part of a service- oriented architecture (SOA), have to be managed to ensure compliance with guaranteed service levels. In this context, a high degree of automation is desired, which can be achieved by applying autonomic computing concepts. This paper particularly focuses the autonomic management of semi-dynamic compositions. Here, for each included service several variants are available that differ with regard to the service level they offer. Given this scenario, we first show how to instrument WSC in order to allow a controlling of the service level through switching the employed service variant. Second, we show how the desired self-manageability can be designed and implemented by means of a WSC manageability infrastructure. The presented approach is based on widely accepted methodologies and standards from the area of application and web service management, in particular the WBEM standards.},\n author = {Momm, Christof and Rathfelder, Christoph and Hallerbach, Ignacio P{\\\'\'e}rez and Abeck, Sebastian},\n booktitle = {Proceedings of the Network Operations and Management Symposium (NOMS 2008)},\n day = {7--11},\n doi = {10.1109/NOMS.2008.4575227},\n issn = {1542-1201},\n location = {Salvador, Bahia, Brazil},\n month = {April},\n pages = {839--842},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/445.pdf},\n publisher = {IEEE},\n title = {{M}anageability {D}esign for an {A}utonomic {M}anagement of {S}emi-{D}ynamic {W}eb {S}ervice {C}ompositions},\n year = {2008},\n}\n\n','\n\nChristof Momm, Christoph Rathfelder, Ignacio P
”erez Hallerbach, and\nSebastian Abeck.\nManageability Design for an Autonomic Management of\nSemi-Dynamic Web Service Compositions.\nIn Proceedings of the Network Operations and Management\nSymposium (NOMS 2008), Salvador, Bahia, Brazil, April 7-11, 2008, pages\n839-842. IEEE.\nApril 2008.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{momm2008a,\nabstract = {Web service compositions (WSC), as part of a service- oriented architecture (SOA), have to be managed to ensure compliance with guaranteed service levels. In this context, a high degree of automation is desired, which can be achieved by applying autonomic computing concepts. This paper particularly focuses the autonomic management of semi-dynamic compositions. Here, for each included service several variants are available that differ with regard to the service level they offer. Given this scenario, we first show how to instrument WSC in order to allow a controlling of the service level through switching the employed service variant. Second, we show how the desired self-manageability can be designed and implemented by means of a WSC manageability infrastructure. The presented approach is based on widely accepted methodologies and standards from the area of application and web service management, in particular the WBEM standards.},\nauthor = {Momm, Christof and Rathfelder, Christoph and Hallerbach, Ignacio P{\\\\\'\'e}rez and Abeck, Sebastian},\nbooktitle = {Proceedings of the Network Operations and Management Symposium (NOMS 2008)},\nday = {7--11},\ndoi = {10.1109/NOMS.2008.4575227},\nissn = {1542-1201},\nlocation = {Salvador, Bahia, Brazil},\nmonth = {April},\npages = {839--842},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/445.pdf},\npublisher = {IEEE},\ntitle = {{M}anageability {D}esign for an {A}utonomic {M}anagement of {S}emi-{D}ynamic {W}eb {S}ervice {C}ompositions},\nyear = {2008}\n}\n
\n
\nWeb service compositions (WSC), as part of a service- oriented architecture (SOA), have to be managed to ensure compliance with guaranteed service levels. In this context, a high degree of automation is desired, which can be achieved by applying autonomic computing concepts. This paper particularly focuses the autonomic management of semi-dynamic compositions. Here, for each included service several variants are available that differ with regard to the service level they offer. Given this scenario, we first show how to instrument WSC in order to allow a controlling of the service level through switching the employed service variant. Second, we show how the desired self-manageability can be designed and implemented by means of a WSC manageability infrastructure. The presented approach is based on widely accepted methodologies and standards from the area of application and web service management, in particular the WBEM standards.\n
\n','
\n@inproceedings{momm2008a,\n  abstract = {Web service compositions (WSC), as part of a service- oriented architecture (SOA), have to be managed to ensure compliance with guaranteed service levels. In this context, a high degree of automation is desired, which can be achieved by applying autonomic computing concepts. This paper particularly focuses the autonomic management of semi-dynamic compositions. Here, for each included service several variants are available that differ with regard to the service level they offer. Given this scenario, we first show how to instrument WSC in order to allow a controlling of the service level through switching the employed service variant. Second, we show how the desired self-manageability can be designed and implemented by means of a WSC manageability infrastructure. The presented approach is based on widely accepted methodologies and standards from the area of application and web service management, in particular the WBEM standards.},\n  author = {Momm, Christof and Rathfelder, Christoph and Hallerbach, Ignacio P{\\\\\'\'e}rez and Abeck, Sebastian},\n  booktitle = {Proceedings of the Network Operations and Management Symposium (NOMS 2008)},\n  day = {7--11},\n  doi = {10.1109/NOMS.2008.4575227},\n  issn = {1542-1201},\n  location = {Salvador, Bahia, Brazil},\n  month = {April},\n  pages = {839--842},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/445.pdf},\n  publisher = {IEEE},\n  title = {{M}anageability {D}esign for an {A}utonomic {M}anagement of {S}emi-{D}ynamic {W}eb {S}ervice {C}ompositions},\n  year = {2008}\n}\n
\n\n','Web service compositions (WSC), as part of a service- oriented architecture (SOA), have to be managed to ensure compliance with guaranteed service levels. In this context, a high degree of automation is desired, which can be achieved by applying autonomic computing concepts. This paper particularly focuses the autonomic management of semi-dynamic compositions. Here, for each included service several variants are available that differ with regard to the service level they offer. Given this scenario, we first show how to instrument WSC in order to allow a controlling of the service level through switching the employed service variant. Second, we show how the desired self-manageability can be designed and implemented by means of a WSC manageability infrastructure. The presented approach is based on widely accepted methodologies and standards from the area of application and web service management, in particular the WBEM standards.','{M}anageability {D}esign for an {A}utonomic {M}anagement of {S}emi-{D}ynamic {W}eb {S}ervice {C}ompositions',0,4,2008,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(447,'paper','NeKoMi1999-JCI-VideoConf','article','@article{NeKoMi1999-JCI-VideoConf,\n author = {Plamen Nenov and Samuel Kounev and Dimiter Mihailov},\n issn = {1201-851},\n journal = {Journal of Computing and Information},\n title = {{Distributed Video-Conferencing System Organized for Work on the Internet with the use of Multimedia Server}},\n year = {1999},\n}\n\n','\n\nPlamen Nenov, Samuel Kounev, and Dimiter Mihailov.\nDistributed Video-Conferencing System Organized for Work on the\nInternet with the use of Multimedia Server.\nJournal of Computing and Information, 1999.\n[ bib  ] 
\n@article{NeKoMi1999-JCI-VideoConf,\nauthor = {Plamen Nenov and Samuel Kounev and Dimiter Mihailov},\nissn = {1201-851},\njournal = {Journal of Computing and Information},\ntitle = {{Distributed Video-Conferencing System Organized for Work on the Internet with the use of Multimedia Server}},\nyear = {1999}\n}\n
\n
\n','
\n@article{NeKoMi1999-JCI-VideoConf,\n  author = {Plamen Nenov and Samuel Kounev and Dimiter Mihailov},\n  issn = {1201-851},\n  journal = {Journal of Computing and Information},\n  title = {{Distributed Video-Conferencing System Organized for Work on the Internet with the use of Multimedia Server}},\n  year = {1999}\n}\n
\n\n',NULL,'{Distributed Video-Conferencing System Organized for Work on the Internet with the use of Multimedia Server}',0,0,1999,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(449,'paper','NoBuKoRe2015-ICPE-InvitedDemo','inproceedings','@inproceedings{NoBuKoRe2015-ICPE-InvitedDemo,\n author = {Qais Noorshams and Axel Busch and Samuel Kounev and Ralf Reussner},\n title = {{The Storage Performance Analyzer: Measuring, Monitoring, and Modeling of I/O Performance in Virtualized Environments}},\n booktitle = {Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering},\n series = {ICPE \'15},\n location = {Austin, Texas, USA},\n year = {2015},\n month = {February},\n titleaddon = {{(Demo Paper)}},\n url = {http://dx.doi.org/10.1145/2668930.2693845},\n doi = {10.1145/2668930.2693845},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/449.pdf},\n}\n\n','\n\nQais Noorshams, Axel Busch, Samuel Kounev, and Ralf Reussner.\nThe Storage Performance Analyzer: Measuring, Monitoring, and\nModeling of I/O Performance in Virtualized Environments (Demo Paper).\nIn Proceedings of the 6th ACM/SPEC International Conference on\nPerformance Engineering, Austin, Texas, USA, February 2015, ICPE \'15.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{NoBuKoRe2015-ICPE-InvitedDemo,\nauthor = {Qais Noorshams and Axel Busch and Samuel Kounev and Ralf Reussner},\ntitle = {{The Storage Performance Analyzer: Measuring, Monitoring, and Modeling of I/O Performance in Virtualized Environments}},\nbooktitle = {Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering},\nseries = {ICPE \'15},\nlocation = {Austin, Texas, USA},\nyear = {2015},\nmonth = {February},\ntitleaddon = {{(Demo Paper)}},\nurl = {http://dx.doi.org/10.1145/2668930.2693845},\ndoi = {10.1145/2668930.2693845},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/449.pdf}\n}\n
\n
\n','
\n@inproceedings{NoBuKoRe2015-ICPE-InvitedDemo,\n  author = {Qais Noorshams and Axel Busch and Samuel Kounev and Ralf Reussner},\n  title = {{The Storage Performance Analyzer: Measuring, Monitoring, and Modeling of I/O Performance in Virtualized Environments}},\n  booktitle = {Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering},\n  series = {ICPE \'15},\n  location = {Austin, Texas, USA},\n  year = {2015},\n  month = {February},\n  titleaddon = {{(Demo Paper)}},\n  url = {http://dx.doi.org/10.1145/2668930.2693845},\n  doi = {10.1145/2668930.2693845},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/449.pdf}\n}\n
\n\n',NULL,'{The Storage Performance Analyzer: Measuring, Monitoring, and Modeling of I/O Performance in Virtualized Environments}',0,2,2015,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(450,'paper','NoReReKoRe2014-CBSE-ArchitectureModelsWithStatisticalModels','inproceedings','@inproceedings{NoReReKoRe2014-CBSE-ArchitectureModelsWithStatisticalModels,\n author = {Noorshams, Qais and Reeb, Roland and Rentschler, Andreas and Kounev, Samuel and Reussner, Ralf},\n title = {Enriching Software Architecture Models with Statistical Models for Performance Prediction in Modern Storage Environments},\n booktitle = {Proceedings of the 17th International ACM Sigsoft Symposium on Component-based Software Engineering},\n series = {CBSE \'14},\n year = {2014},\n month = {June},\n isbn = {978-1-4503-2577-6},\n location = {Marcq-en-Bareul, France},\n pages = {45--54},\n numpages = {10},\n url = {http://doi.acm.org/10.1145/2602458.2602475},\n doi = {10.1145/2602458.2602475},\n acmid = {2602475},\n publisher = {ACM},\n address = {New York, NY, USA},\n keywords = {i/o, performance, prediction, software architecture, statistical model, storage},\n note = {Acceptance Rate (Full Paper): 14/62 = 23\\%.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/450.pdf},\n}\n\n','\n\nQais Noorshams, Roland Reeb, Andreas Rentschler, Samuel Kounev, and Ralf\nReussner.\nEnriching software architecture models with statistical models for\nperformance prediction in modern storage environments.\nIn Proceedings of the 17th International ACM Sigsoft Symposium\non Component-based Software Engineering, Marcq-en-Bareul, France, June 2014,\nCBSE \'14, pages 45-54. ACM, New York, NY, USA.\nJune 2014, Acceptance Rate (Full Paper): 14/62 = 23%.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{NoReReKoRe2014-CBSE-ArchitectureModelsWithStatisticalModels,\nauthor = {Noorshams, Qais and Reeb, Roland and Rentschler, Andreas and Kounev, Samuel and Reussner, Ralf},\ntitle = {Enriching Software Architecture Models with Statistical Models for Performance Prediction in Modern Storage Environments},\nbooktitle = {Proceedings of the 17th International ACM Sigsoft Symposium on Component-based Software Engineering},\nseries = {CBSE \'14},\nyear = {2014},\nmonth = {June},\nisbn = {978-1-4503-2577-6},\nlocation = {Marcq-en-Bareul, France},\npages = {45--54},\nnumpages = {10},\nurl = {http://doi.acm.org/10.1145/2602458.2602475},\ndoi = {10.1145/2602458.2602475},\nacmid = {2602475},\npublisher = {ACM},\naddress = {New York, NY, USA},\nkeywords = {i/o, performance, prediction, software architecture, statistical model, storage},\nnote = {Acceptance Rate (Full Paper): 14/62 = 23\\%.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/450.pdf}\n}\n
\n
\n','
\n@inproceedings{NoReReKoRe2014-CBSE-ArchitectureModelsWithStatisticalModels,\n  author = {Noorshams, Qais and Reeb, Roland and Rentschler, Andreas and Kounev, Samuel and Reussner, Ralf},\n  title = {Enriching Software Architecture Models with Statistical Models for Performance Prediction in Modern Storage Environments},\n  booktitle = {Proceedings of the 17th International ACM Sigsoft Symposium on Component-based Software Engineering},\n  series = {CBSE \'14},\n  year = {2014},\n  month = {June},\n  isbn = {978-1-4503-2577-6},\n  location = {Marcq-en-Bareul, France},\n  pages = {45--54},\n  numpages = {10},\n  url = {http://doi.acm.org/10.1145/2602458.2602475},\n  doi = {10.1145/2602458.2602475},\n  acmid = {2602475},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  keywords = {i/o, performance, prediction, software architecture, statistical model, storage},\n  note = {Acceptance Rate (Full Paper): 14/62 = 23\\%.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/450.pdf}\n}\n
\n\n',NULL,'Enriching Software Architecture Models with Statistical Models for Performance Prediction in Modern Storage Environments',0,6,2014,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(451,'paper','NoBuReBrKoTuRe2014-DCPerf-IORegressionModels','inproceedings','@inproceedings{NoBuReBrKoTuRe2014-DCPerf-IORegressionModels,\n author = {Qais Noorshams and Axel Busch and Andreas Rentschler and Dominik Bruhn and Samuel Kounev and Petr T{u}ma and Ralf Reussner},\n booktitle = {34th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2014 Workshops). 4th International Workshop on Data Center Performance, DCPerf \'14},\n location = {Madrid, Spain},\n title = {{Automated Modeling of I/O Performance and Interference Effects in Virtualized Storage Systems}},\n year = {2014},\n month = {July},\n pages = {88-93},\n doi = {10.1109/ICDCSW.2014.26},\n url = {http://dx.doi.org/10.1109/ICDCSW.2014.26},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/451.pdf},\n}\n\n','\n\nQais Noorshams, Axel Busch, Andreas Rentschler, Dominik Bruhn, Samuel Kounev,\nPetr Tuma, and Ralf Reussner.\nAutomated Modeling of I/O Performance and Interference Effects in\nVirtualized Storage Systems.\nIn 34th IEEE International Conference on Distributed Computing\nSystems Workshops (ICDCS 2014 Workshops). 4th International Workshop on Data\nCenter Performance, DCPerf \'14, Madrid, Spain, July 2014, pages 88-93.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{NoBuReBrKoTuRe2014-DCPerf-IORegressionModels,\nauthor = {Qais Noorshams and Axel Busch and Andreas Rentschler and Dominik Bruhn and Samuel Kounev and Petr T{u}ma and Ralf Reussner},\nbooktitle = {34th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2014 Workshops). 4th International Workshop on Data Center Performance, DCPerf \'14},\nlocation = {Madrid, Spain},\ntitle = {{Automated Modeling of I/O Performance and Interference Effects in Virtualized Storage Systems}},\nyear = {2014},\nmonth = {July},\npages = {88-93},\ndoi = {10.1109/ICDCSW.2014.26},\nurl = {http://dx.doi.org/10.1109/ICDCSW.2014.26},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/451.pdf}\n}\n
\n
\n','
\n@inproceedings{NoBuReBrKoTuRe2014-DCPerf-IORegressionModels,\n  author = {Qais Noorshams and Axel Busch and Andreas Rentschler and Dominik Bruhn and Samuel Kounev and Petr T{u}ma and Ralf Reussner},\n  booktitle = {34th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2014 Workshops). 4th International Workshop on Data Center Performance, DCPerf \'14},\n  location = {Madrid, Spain},\n  title = {{Automated Modeling of I/O Performance and Interference Effects in Virtualized Storage Systems}},\n  year = {2014},\n  month = {July},\n  pages = {88-93},\n  doi = {10.1109/ICDCSW.2014.26},\n  url = {http://dx.doi.org/10.1109/ICDCSW.2014.26},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/451.pdf}\n}\n
\n\n',NULL,'{Automated Modeling of I/O Performance and Interference Effects in Virtualized Storage Systems}',0,7,2014,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(452,'paper','NoRoKoTuRe2013-MASCOTS-IOQNs','inproceedings','@inproceedings{NoRoKoTuRe2013-MASCOTS-IOQNs,\n author = {Qais Noorshams and Kiana Rostami and Samuel Kounev and Petr T{u}ma and Ralf Reussner},\n booktitle = {Proceedings of the 21st IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2013)},\n series = {MASCOTS\'13},\n date = {August 14--16},\n location = {San Francisco, USA},\n note = {Acceptance Rate (Full Paper): 44/163 = 27\\%},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/452.pdf},\n title = {{I/O Performance Modeling of Virtualized Storage Systems}},\n pages = {121-130},\n doi = {10.1109/MASCOTS.2013.20},\n url = {http://dx.doi.org/10.1109/MASCOTS.2013.20},\n year = {2013},\n}\n\n','\n\nQais Noorshams, Kiana Rostami, Samuel Kounev, Petr Tuma, and Ralf Reussner.\nI/O Performance Modeling of Virtualized Storage Systems.\nIn Proceedings of the 21st IEEE International Symposium on\nModeling, Analysis and Simulation of Computer and Telecommunication Systems\n(MASCOTS 2013), San Francisco, USA, 2013, MASCOTS\'13, pages 121-130.\nAcceptance Rate (Full Paper): 44/163 = 27%.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{NoRoKoTuRe2013-MASCOTS-IOQNs,\nauthor = {Qais Noorshams and Kiana Rostami and Samuel Kounev and Petr T{u}ma and Ralf Reussner},\nbooktitle = {Proceedings of the 21st IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2013)},\nseries = {MASCOTS\'13},\ndate = {August 14--16},\nlocation = {San Francisco, USA},\nnote = {Acceptance Rate (Full Paper): 44/163 = 27\\%},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/452.pdf},\ntitle = {{I/O Performance Modeling of Virtualized Storage Systems}},\npages = {121-130},\ndoi = {10.1109/MASCOTS.2013.20},\nurl = {http://dx.doi.org/10.1109/MASCOTS.2013.20},\nyear = {2013}\n}\n
\n
\n','
\n@inproceedings{NoRoKoTuRe2013-MASCOTS-IOQNs,\n  author = {Qais Noorshams and Kiana Rostami and Samuel Kounev and Petr T{u}ma and Ralf Reussner},\n  booktitle = {Proceedings of the 21st IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2013)},\n  series = {MASCOTS\'13},\n  date = {August 14--16},\n  location = {San Francisco, USA},\n  note = {Acceptance Rate (Full Paper): 44/163 = 27\\%},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/452.pdf},\n  title = {{I/O Performance Modeling of Virtualized Storage Systems}},\n  pages = {121-130},\n  doi = {10.1109/MASCOTS.2013.20},\n  url = {http://dx.doi.org/10.1109/MASCOTS.2013.20},\n  year = {2013}\n}\n
\n\n',NULL,'{I/O Performance Modeling of Virtualized Storage Systems}',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(453,'paper','NoBrKoRe2013-ICPE-IORegressionModels','inproceedings','@inproceedings{NoBrKoRe2013-ICPE-IORegressionModels,\n acmid = {2479910},\n address = {New York, NY, USA},\n author = {Noorshams, Qais and Bruhn, Dominik and Kounev, Samuel and Reussner, Ralf},\n booktitle = {Proceedings of the ACM/SPEC International Conference on Performance Engineering (ICPE 2013)},\n doi = {10.1145/2479871.2479910},\n isbn = {978-1-4503-1636-1},\n keywords = {i/o, performance, prediction, storage, virtualization},\n location = {Prague, Czech Republic},\n numpages = {12},\n pages = {283--294},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/453.pdf},\n publisher = {ACM},\n series = {ICPE\'13},\n title = {{Predictive Performance Modeling of Virtualized Storage Systems using Optimized Statistical Regression Techniques}},\n url = {http://doi.acm.org/10.1145/2479871.2479910},\n year = {2013},\n}\n\n','\n\nQais Noorshams, Dominik Bruhn, Samuel Kounev, and Ralf Reussner.\nPredictive Performance Modeling of Virtualized Storage Systems using\nOptimized Statistical Regression Techniques.\nIn Proceedings of the ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2013), Prague, Czech Republic, 2013, ICPE\'13,\npages 283-294. ACM, New York, NY, USA.\n2013.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{NoBrKoRe2013-ICPE-IORegressionModels,\nacmid = {2479910},\naddress = {New York, NY, USA},\nauthor = {Noorshams, Qais and Bruhn, Dominik and Kounev, Samuel and Reussner, Ralf},\nbooktitle = {Proceedings of the ACM/SPEC International Conference on Performance Engineering (ICPE 2013)},\ndoi = {10.1145/2479871.2479910},\nisbn = {978-1-4503-1636-1},\nkeywords = {i/o, performance, prediction, storage, virtualization},\nlocation = {Prague, Czech Republic},\nnumpages = {12},\npages = {283--294},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/453.pdf},\npublisher = {ACM},\nseries = {ICPE\'13},\ntitle = {{Predictive Performance Modeling of Virtualized Storage Systems using Optimized Statistical Regression Techniques}},\nurl = {http://doi.acm.org/10.1145/2479871.2479910},\nyear = {2013}\n}\n
\n
\n','
\n@inproceedings{NoBrKoRe2013-ICPE-IORegressionModels,\n  acmid = {2479910},\n  address = {New York, NY, USA},\n  author = {Noorshams, Qais and Bruhn, Dominik and Kounev, Samuel and Reussner, Ralf},\n  booktitle = {Proceedings of the ACM/SPEC International Conference on Performance Engineering (ICPE 2013)},\n  doi = {10.1145/2479871.2479910},\n  isbn = {978-1-4503-1636-1},\n  keywords = {i/o, performance, prediction, storage, virtualization},\n  location = {Prague, Czech Republic},\n  numpages = {12},\n  pages = {283--294},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/453.pdf},\n  publisher = {ACM},\n  series = {ICPE\'13},\n  title = {{Predictive Performance Modeling of Virtualized Storage Systems using Optimized Statistical Regression Techniques}},\n  url = {http://doi.acm.org/10.1145/2479871.2479910},\n  year = {2013}\n}\n
\n\n',NULL,'{Predictive Performance Modeling of Virtualized Storage Systems using Optimized Statistical Regression Techniques}',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(454,'paper','NoReKoRe2013-ICPE-WIP','inproceedings','@inproceedings{NoReKoRe2013-ICPE-WIP,\n acmid = {2479921},\n address = {New York, NY, USA},\n author = {Noorshams, Qais and Rentschler, Andreas and Kounev, Samuel and Reussner, Ralf},\n booktitle = {Proceedings of the ACM/SPEC International Conference on Performance Engineering},\n doi = {10.1145/2479871.2479921},\n isbn = {978-1-4503-1636-1},\n keywords = {i/o, performance, storage, virtualization},\n location = {Prague, Czech Republic},\n numpages = {4},\n pages = {339--342},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/454.pdf},\n publisher = {ACM},\n series = {ICPE \'13},\n title = {{A Generic Approach for Architecture-level Performance Modeling and Prediction of Virtualized Storage Systems}},\n url = {http://doi.acm.org/10.1145/2479871.2479921},\n year = {2013},\n}\n\n','\n\nQais Noorshams, Andreas Rentschler, Samuel Kounev, and Ralf Reussner.\nA Generic Approach for Architecture-level Performance Modeling and\nPrediction of Virtualized Storage Systems.\nIn Proceedings of the ACM/SPEC International Conference on\nPerformance Engineering, Prague, Czech Republic, 2013, ICPE \'13, pages\n339-342. ACM, New York, NY, USA.\n2013.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{NoReKoRe2013-ICPE-WIP,\nacmid = {2479921},\naddress = {New York, NY, USA},\nauthor = {Noorshams, Qais and Rentschler, Andreas and Kounev, Samuel and Reussner, Ralf},\nbooktitle = {Proceedings of the ACM/SPEC International Conference on Performance Engineering},\ndoi = {10.1145/2479871.2479921},\nisbn = {978-1-4503-1636-1},\nkeywords = {i/o, performance, storage, virtualization},\nlocation = {Prague, Czech Republic},\nnumpages = {4},\npages = {339--342},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/454.pdf},\npublisher = {ACM},\nseries = {ICPE \'13},\ntitle = {{A Generic Approach for Architecture-level Performance Modeling and Prediction of Virtualized Storage Systems}},\nurl = {http://doi.acm.org/10.1145/2479871.2479921},\nyear = {2013}\n}\n
\n
\n','
\n@inproceedings{NoReKoRe2013-ICPE-WIP,\n  acmid = {2479921},\n  address = {New York, NY, USA},\n  author = {Noorshams, Qais and Rentschler, Andreas and Kounev, Samuel and Reussner, Ralf},\n  booktitle = {Proceedings of the ACM/SPEC International Conference on Performance Engineering},\n  doi = {10.1145/2479871.2479921},\n  isbn = {978-1-4503-1636-1},\n  keywords = {i/o, performance, storage, virtualization},\n  location = {Prague, Czech Republic},\n  numpages = {4},\n  pages = {339--342},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/454.pdf},\n  publisher = {ACM},\n  series = {ICPE \'13},\n  title = {{A Generic Approach for Architecture-level Performance Modeling and Prediction of Virtualized Storage Systems}},\n  url = {http://doi.acm.org/10.1145/2479871.2479921},\n  year = {2013}\n}\n
\n\n',NULL,'{A Generic Approach for Architecture-level Performance Modeling and Prediction of Virtualized Storage Systems}',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(455,'paper','NoKoRe2012-EPEW-Experiments','incollection','@incollection{NoKoRe2012-EPEW-Experiments,\n author = {Noorshams, Qais and Kounev, Samuel and Reussner, Ralf},\n booktitle = {Computer Performance Engineering. 9th European Performance Engineering Workshop (EPEW 2012), Munich, Germany, July 30, 2012, and 28th UK Performance Engineering Workshop (UKPEW 2012), Edinburgh, UK, July 2, 2012, Revised Selected Papers},\n doi = {10.1007/978-3-642-36781-6_5},\n editor = {Tribastone, Mirco and Gilmore, Stephen},\n isbn = {978-3-642-36780-9},\n keywords = {I/O; Storage; Performance; Virtualization},\n pages = {63-79},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/455.pdf},\n publisher = {Springer Berlin Heidelberg},\n series = {Lecture Notes in Computer Science (LNCS)},\n title = {{Experimental Evaluation of the Performance-Influencing Factors of Virtualized Storage Systems}},\n url = {http://dx.doi.org/10.1007/978-3-642-36781-6_5},\n volume = {7587},\n year = {2013},\n month = {July},\n}\n\n','\n\nQais Noorshams, Samuel Kounev, and Ralf Reussner.\nExperimental Evaluation of the Performance-Influencing Factors of\nVirtualized Storage Systems.\nIn Computer Performance Engineering. 9th European Performance\nEngineering Workshop (EPEW 2012), Munich, Germany, July 30, 2012, and 28th UK\nPerformance Engineering Workshop (UKPEW 2012), Edinburgh, UK, July 2, 2012,\nRevised Selected Papers, Mirco Tribastone and Stephen Gilmore, editors,\nvolume 7587 of Lecture Notes in Computer Science (LNCS), pages 63-79.\nSpringer Berlin Heidelberg, July 2013.\n[ bib | DOI | http | .pdf  ] 
\n@incollection{NoKoRe2012-EPEW-Experiments,\nauthor = {Noorshams, Qais and Kounev, Samuel and Reussner, Ralf},\nbooktitle = {Computer Performance Engineering. 9th European Performance Engineering Workshop (EPEW 2012), Munich, Germany, July 30, 2012, and 28th UK Performance Engineering Workshop (UKPEW 2012), Edinburgh, UK, July 2, 2012, Revised Selected Papers},\ndoi = {10.1007/978-3-642-36781-6_5},\neditor = {Tribastone, Mirco and Gilmore, Stephen},\nisbn = {978-3-642-36780-9},\nkeywords = {I/O; Storage; Performance; Virtualization},\npages = {63-79},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/455.pdf},\npublisher = {Springer Berlin Heidelberg},\nseries = {Lecture Notes in Computer Science (LNCS)},\ntitle = {{Experimental Evaluation of the Performance-Influencing Factors of Virtualized Storage Systems}},\nurl = {http://dx.doi.org/10.1007/978-3-642-36781-6_5},\nvolume = {7587},\nyear = {2013},\nmonth = {July}\n}\n
\n
\n','
\n@incollection{NoKoRe2012-EPEW-Experiments,\n  author = {Noorshams, Qais and Kounev, Samuel and Reussner, Ralf},\n  booktitle = {Computer Performance Engineering. 9th European Performance Engineering Workshop (EPEW 2012), Munich, Germany, July 30, 2012, and 28th UK Performance Engineering Workshop (UKPEW 2012), Edinburgh, UK, July 2, 2012, Revised Selected Papers},\n  doi = {10.1007/978-3-642-36781-6_5},\n  editor = {Tribastone, Mirco and Gilmore, Stephen},\n  isbn = {978-3-642-36780-9},\n  keywords = {I/O; Storage; Performance; Virtualization},\n  pages = {63-79},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/455.pdf},\n  publisher = {Springer Berlin Heidelberg},\n  series = {Lecture Notes in Computer Science (LNCS)},\n  title = {{Experimental Evaluation of the Performance-Influencing Factors of Virtualized Storage Systems}},\n  url = {http://dx.doi.org/10.1007/978-3-642-36781-6_5},\n  volume = {7587},\n  year = {2013},\n  month = {July}\n}\n
\n\n',NULL,'{Experimental Evaluation of the Performance-Influencing Factors of Virtualized Storage Systems}',0,7,2013,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(456,'paper','No2010-Masterthesis-Optimization','mastersthesis','@mastersthesis{No2010-Masterthesis-Optimization,\n address = {Karlsruhe, Germany},\n author = {Qais Noorshams},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/456.pdf},\n school = {Karlsruhe Institute of Technology},\n title = {Focusing the Optimization of Software Architecture Models Using Non-Functional Requirements},\n year = {2010},\n}\n\n','\n\nQais Noorshams.\nFocusing the optimization of software architecture models using\nnon-functional requirements.\nMaster\'s thesis, Karlsruhe Institute of Technology, Karlsruhe,\nGermany, 2010.\n[ bib | .pdf  ] 
\n@mastersthesis{No2010-Masterthesis-Optimization,\naddress = {Karlsruhe, Germany},\nauthor = {Qais Noorshams},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/456.pdf},\nschool = {Karlsruhe Institute of Technology},\ntitle = {Focusing the Optimization of Software Architecture Models Using Non-Functional Requirements},\nyear = {2010}\n}\n
\n
\n','
\n@mastersthesis{No2010-Masterthesis-Optimization,\n  address = {Karlsruhe, Germany},\n  author = {Qais Noorshams},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/456.pdf},\n  school = {Karlsruhe Institute of Technology},\n  title = {Focusing the Optimization of Software Architecture Models Using Non-Functional Requirements},\n  year = {2010}\n}\n
\n\n',NULL,'Focusing the Optimization of Software Architecture Models Using Non-Functional Requirements',0,0,2010,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(457,'paper','NoMaRe2010-QUASOSS-Optimization','inproceedings','@inproceedings{NoMaRe2010-QUASOSS-Optimization,\n author = {Qais Noorshams and Anne Martens and Ralf Reussner},\n booktitle = {Proceedings of the 2nd International Workshop on the Quality of Service-Oriented Software Systems (QUASOSS \'10), Oslo, Norway, October 4, 2010},\n doi = {10.1145/1858263.1858265},\n isbn = {978-1-4503-0239-5},\n pages = {1:1--1:6},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/457.pdf},\n publisher = {ACM, New York, NY, USA},\n title = {Using Quality of Service Bounds for Effective Multi-objective Software Architecture Optimization},\n url = {http://sdq.ipd.kit.edu/conferences_and_events/quasoss2010/},\n year = {2010},\n}\n\n','\n\nQais Noorshams, Anne Martens, and Ralf Reussner.\nUsing quality of service bounds for effective multi-objective\nsoftware architecture optimization.\nIn Proceedings of the 2nd International Workshop on the Quality\nof Service-Oriented Software Systems (QUASOSS \'10), Oslo, Norway, October 4,\n2010, 2010, pages 1:1-1:6. ACM, New York, NY, USA.\n2010.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{NoMaRe2010-QUASOSS-Optimization,\nauthor = {Qais Noorshams and Anne Martens and Ralf Reussner},\nbooktitle = {Proceedings of the 2nd International Workshop on the Quality of Service-Oriented Software Systems (QUASOSS \'10), Oslo, Norway, October 4, 2010},\ndoi = {10.1145/1858263.1858265},\nisbn = {978-1-4503-0239-5},\npages = {1:1--1:6},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/457.pdf},\npublisher = {ACM, New York, NY, USA},\ntitle = {Using Quality of Service Bounds for Effective Multi-objective Software Architecture Optimization},\nurl = {http://sdq.ipd.kit.edu/conferences_and_events/quasoss2010/},\nyear = {2010}\n}\n
\n
\n','
\n@inproceedings{NoMaRe2010-QUASOSS-Optimization,\n  author = {Qais Noorshams and Anne Martens and Ralf Reussner},\n  booktitle = {Proceedings of the 2nd International Workshop on the Quality of Service-Oriented Software Systems (QUASOSS \'10), Oslo, Norway, October 4, 2010},\n  doi = {10.1145/1858263.1858265},\n  isbn = {978-1-4503-0239-5},\n  pages = {1:1--1:6},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/457.pdf},\n  publisher = {ACM, New York, NY, USA},\n  title = {Using Quality of Service Bounds for Effective Multi-objective Software Architecture Optimization},\n  url = {http://sdq.ipd.kit.edu/conferences_and_events/quasoss2010/},\n  year = {2010}\n}\n
\n\n',NULL,'Using Quality of Service Bounds for Effective Multi-objective Software Architecture Optimization',0,0,2010,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(458,'paper','NoKo2007-UPC-GlobusOnlinePerfModels','techreport','@techreport{NoKo2007-UPC-GlobusOnlinePerfModels,\n title = {{Preliminary Analysis of Globus Toolkit 4 to Create Prediction Models}},\n year = {2007},\n month = {7},\n number = {UPC-DAC-RR-2007-37},\n institution = {Computer Architecture Department, Technical University of Catalonia (UPC), Spain},\n author = {Nou, Ramon and Kounev, Samuel},\n}\n\n','\n\nRamon Nou and Samuel Kounev.\nPreliminary Analysis of Globus Toolkit 4 to Create Prediction\nModels.\nTechnical Report UPC-DAC-RR-2007-37, Computer Architecture\nDepartment, Technical University of Catalonia (UPC), Spain, 7 2007.\n[ bib  ] 
\n@techreport{NoKo2007-UPC-GlobusOnlinePerfModels,\ntitle = {{Preliminary Analysis of Globus Toolkit 4 to Create Prediction Models}},\nyear = {2007},\nmonth = {7},\nnumber = {UPC-DAC-RR-2007-37},\ninstitution = {Computer Architecture Department, Technical University of Catalonia (UPC), Spain},\nauthor = {Nou, Ramon and Kounev, Samuel}\n}\n
\n
\n','
\n@techreport{NoKo2007-UPC-GlobusOnlinePerfModels,\n  title = {{Preliminary Analysis of Globus Toolkit 4 to Create Prediction Models}},\n  year = {2007},\n  month = {7},\n  number = {UPC-DAC-RR-2007-37},\n  institution = {Computer Architecture Department, Technical University of Catalonia (UPC), Spain},\n  author = {Nou, Ramon and Kounev, Samuel}\n}\n
\n\n',NULL,'{Preliminary Analysis of Globus Toolkit 4 to Create Prediction Models}',0,7,2007,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(459,'paper','NoKoJuTo2008-JSS-GridAutoQoS','article','@article{NoKoJuTo2008-JSS-GridAutoQoS,\n title = {{Autonomic QoS control in enterprise Grid environments using online simulation}},\n journal = {Journal of Systems and Software},\n year = {2009},\n month = {March},\n volume = {82},\n number = {3},\n pages = {486--502},\n abstract = {As Grid Computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. The inherent complexity, heterogeneity and dynamics of Grid computing environments pose some challenges in managing their capacity to ensure that QoS requirements are continuously met. In this paper, a comprehensive framework for autonomic QoS control in enterprise Grid environments using online simulation is proposed. The paper presents a novel methodology for designing autonomic QoS-aware resource managers that have the capability to predict the performance of the Grid components they manage and allocate resources in such a way that service level agreements are honored. Support for advanced features such as autonomic workload characterization on-the-fly, dynamic deployment of Grid servers on demand, as well as dynamic system reconfiguration after a server failure is provided. The goal is to make the Grid middleware self-configurable and adaptable to changes in the system environment and workload. The approach is subjected to an extensive experimental evaluation in the context of a real-world Grid environment and its effectiveness, practicality and performance are demonstrated.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/459.pdf},\n publisher = {Elsevier Science Publishers B. V.},\n address = {Amsterdam, The Netherlands},\n doi = {10.1016/j.jss.2008.07.048},\n author = {Nou, Ramon and Kounev, Samuel and Julia, Ferran and Torres, Jordi},\n}\n\n','\n\nRamon Nou, Samuel Kounev, Ferran Julia, and Jordi Torres.\nAutonomic QoS control in enterprise Grid environments using online\nsimulation.\nJournal of Systems and Software, 82(3):486-502, March 2009,\nElsevier Science Publishers B. V., Amsterdam, The Netherlands.\n[ bib | DOI | .pdf | Abstract  ] 
\n@article{NoKoJuTo2008-JSS-GridAutoQoS,\ntitle = {{Autonomic QoS control in enterprise Grid environments using online simulation}},\njournal = {Journal of Systems and Software},\nyear = {2009},\nmonth = {March},\nvolume = {82},\nnumber = {3},\npages = {486--502},\nabstract = {As Grid Computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. The inherent complexity, heterogeneity and dynamics of Grid computing environments pose some challenges in managing their capacity to ensure that QoS requirements are continuously met. In this paper, a comprehensive framework for autonomic QoS control in enterprise Grid environments using online simulation is proposed. The paper presents a novel methodology for designing autonomic QoS-aware resource managers that have the capability to predict the performance of the Grid components they manage and allocate resources in such a way that service level agreements are honored. Support for advanced features such as autonomic workload characterization on-the-fly, dynamic deployment of Grid servers on demand, as well as dynamic system reconfiguration after a server failure is provided. The goal is to make the Grid middleware self-configurable and adaptable to changes in the system environment and workload. The approach is subjected to an extensive experimental evaluation in the context of a real-world Grid environment and its effectiveness, practicality and performance are demonstrated.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/459.pdf},\npublisher = {Elsevier Science Publishers B. V.},\naddress = {Amsterdam, The Netherlands},\ndoi = {10.1016/j.jss.2008.07.048},\nauthor = {Nou, Ramon and Kounev, Samuel and Julia, Ferran and Torres, Jordi}\n}\n
\n
\nAs Grid Computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. The inherent complexity, heterogeneity and dynamics of Grid computing environments pose some challenges in managing their capacity to ensure that QoS requirements are continuously met. In this paper, a comprehensive framework for autonomic QoS control in enterprise Grid environments using online simulation is proposed. The paper presents a novel methodology for designing autonomic QoS-aware resource managers that have the capability to predict the performance of the Grid components they manage and allocate resources in such a way that service level agreements are honored. Support for advanced features such as autonomic workload characterization on-the-fly, dynamic deployment of Grid servers on demand, as well as dynamic system reconfiguration after a server failure is provided. The goal is to make the Grid middleware self-configurable and adaptable to changes in the system environment and workload. The approach is subjected to an extensive experimental evaluation in the context of a real-world Grid environment and its effectiveness, practicality and performance are demonstrated.\n
\n','
\n@article{NoKoJuTo2008-JSS-GridAutoQoS,\n  title = {{Autonomic QoS control in enterprise Grid environments using online simulation}},\n  journal = {Journal of Systems and Software},\n  year = {2009},\n  month = {March},\n  volume = {82},\n  number = {3},\n  pages = {486--502},\n  abstract = {As Grid Computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. The inherent complexity, heterogeneity and dynamics of Grid computing environments pose some challenges in managing their capacity to ensure that QoS requirements are continuously met. In this paper, a comprehensive framework for autonomic QoS control in enterprise Grid environments using online simulation is proposed. The paper presents a novel methodology for designing autonomic QoS-aware resource managers that have the capability to predict the performance of the Grid components they manage and allocate resources in such a way that service level agreements are honored. Support for advanced features such as autonomic workload characterization on-the-fly, dynamic deployment of Grid servers on demand, as well as dynamic system reconfiguration after a server failure is provided. The goal is to make the Grid middleware self-configurable and adaptable to changes in the system environment and workload. The approach is subjected to an extensive experimental evaluation in the context of a real-world Grid environment and its effectiveness, practicality and performance are demonstrated.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/459.pdf},\n  publisher = {Elsevier Science Publishers B. V.},\n  address = {Amsterdam, The Netherlands},\n  doi = {10.1016/j.jss.2008.07.048},\n  author = {Nou, Ramon and Kounev, Samuel and Julia, Ferran and Torres, Jordi}\n}\n
\n\n','As Grid Computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. The inherent complexity, heterogeneity and dynamics of Grid computing environments pose some challenges in managing their capacity to ensure that QoS requirements are continuously met. In this paper, a comprehensive framework for autonomic QoS control in enterprise Grid environments using online simulation is proposed. The paper presents a novel methodology for designing autonomic QoS-aware resource managers that have the capability to predict the performance of the Grid components they manage and allocate resources in such a way that service level agreements are honored. Support for advanced features such as autonomic workload characterization on-the-fly, dynamic deployment of Grid servers on demand, as well as dynamic system reconfiguration after a server failure is provided. The goal is to make the Grid middleware self-configurable and adaptable to changes in the system environment and workload. The approach is subjected to an extensive experimental evaluation in the context of a real-world Grid environment and its effectiveness, practicality and performance are demonstrated.','{Autonomic QoS control in enterprise Grid environments using online simulation}',0,3,2009,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(460,'paper','NoKoTo2007-EPEW-GridOnlinePerfModels','inproceedings','@inproceedings{NoKoTo2007-EPEW-GridOnlinePerfModels,\n title = {{Building Online Performance Models of Grid Middleware with Fine-Grained Load-Balancing: A Globus Toolkit Case Study}},\n year = {2007},\n month = {9},\n number = {4748},\n pages = {125--140},\n abstract = {As Grid computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. To guarantee that QoS requirements are continuously satisfied, the Grid middleware must be capable of predicting the application performance on the fly when deciding how to distribute the workload among the available resources. One way to achieve this is by using online performance models that get generated and analyzed on the fly. In this paper, we present a novel case study with the Globus Toolkit in which we show how performance models can be generated dynamically and used to provide online performance prediction capabilities. We have augmented the Grid middleware with an online performance prediction component that can be called at any time during operation to predict the Grid performance for a given resource allocation and load-balancing strategy. We evaluate the quality of our performance prediction mechanism and present some experimental results that demonstrate its effectiveness and practicality. The framework we propose can be used to design intelligent QoS-aware resource allocation and admission control mechanisms.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/460.pdf},\n editor = {Katinka Wolter},\n publisher = {Springer},\n address = {Heidelberg, Germany},\n series = {Lecture Notes in Computer Science},\n booktitle = {Formal Methods and Stochastic Models for Performance Evaluation, Proceedings of the 4th European Performance Engineering Workshop (EPEW 2007), Berlin, Germany, September 27-28, 2007},\n isbn = {978-3-540-75210-3},\n doi = {10.1007/978-3-540-75211-0_10},\n author = {Nou, Ramon and Kounev, Samuel and Torres, Jordi},\n}\n\n','\n\nRamon Nou, Samuel Kounev, and Jordi Torres.\nBuilding Online Performance Models of Grid Middleware with\nFine-Grained Load-Balancing: A Globus Toolkit Case Study.\nIn Formal Methods and Stochastic Models for Performance\nEvaluation, Proceedings of the 4th European Performance Engineering Workshop\n(EPEW 2007), Berlin, Germany, September 27-28, 2007, Katinka Wolter, editor,\n9 2007, number 4748 in Lecture Notes in Computer Science, pages 125-140.\nSpringer, Heidelberg, Germany.\n9 2007.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{NoKoTo2007-EPEW-GridOnlinePerfModels,\ntitle = {{Building Online Performance Models of Grid Middleware with Fine-Grained Load-Balancing: A Globus Toolkit Case Study}},\nyear = {2007},\nmonth = {9},\nnumber = {4748},\npages = {125--140},\nabstract = {As Grid computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. To guarantee that QoS requirements are continuously satisfied, the Grid middleware must be capable of predicting the application performance on the fly when deciding how to distribute the workload among the available resources. One way to achieve this is by using online performance models that get generated and analyzed on the fly. In this paper, we present a novel case study with the Globus Toolkit in which we show how performance models can be generated dynamically and used to provide online performance prediction capabilities. We have augmented the Grid middleware with an online performance prediction component that can be called at any time during operation to predict the Grid performance for a given resource allocation and load-balancing strategy. We evaluate the quality of our performance prediction mechanism and present some experimental results that demonstrate its effectiveness and practicality. The framework we propose can be used to design intelligent QoS-aware resource allocation and admission control mechanisms.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/460.pdf},\neditor = {Katinka Wolter},\npublisher = {Springer},\naddress = {Heidelberg, Germany},\nseries = {Lecture Notes in Computer Science},\nbooktitle = {Formal Methods and Stochastic Models for Performance Evaluation, Proceedings of the 4th European Performance Engineering Workshop (EPEW 2007), Berlin, Germany, September 27-28, 2007},\nisbn = {978-3-540-75210-3},\ndoi = {10.1007/978-3-540-75211-0_10},\nauthor = {Nou, Ramon and Kounev, Samuel and Torres, Jordi}\n}\n
\n
\nAs Grid computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. To guarantee that QoS requirements are continuously satisfied, the Grid middleware must be capable of predicting the application performance on the fly when deciding how to distribute the workload among the available resources. One way to achieve this is by using online performance models that get generated and analyzed on the fly. In this paper, we present a novel case study with the Globus Toolkit in which we show how performance models can be generated dynamically and used to provide online performance prediction capabilities. We have augmented the Grid middleware with an online performance prediction component that can be called at any time during operation to predict the Grid performance for a given resource allocation and load-balancing strategy. We evaluate the quality of our performance prediction mechanism and present some experimental results that demonstrate its effectiveness and practicality. The framework we propose can be used to design intelligent QoS-aware resource allocation and admission control mechanisms.\n
\n','
\n@inproceedings{NoKoTo2007-EPEW-GridOnlinePerfModels,\n  title = {{Building Online Performance Models of Grid Middleware with Fine-Grained Load-Balancing: A Globus Toolkit Case Study}},\n  year = {2007},\n  month = {9},\n  number = {4748},\n  pages = {125--140},\n  abstract = {As Grid computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. To guarantee that QoS requirements are continuously satisfied, the Grid middleware must be capable of predicting the application performance on the fly when deciding how to distribute the workload among the available resources. One way to achieve this is by using online performance models that get generated and analyzed on the fly. In this paper, we present a novel case study with the Globus Toolkit in which we show how performance models can be generated dynamically and used to provide online performance prediction capabilities. We have augmented the Grid middleware with an online performance prediction component that can be called at any time during operation to predict the Grid performance for a given resource allocation and load-balancing strategy. We evaluate the quality of our performance prediction mechanism and present some experimental results that demonstrate its effectiveness and practicality. The framework we propose can be used to design intelligent QoS-aware resource allocation and admission control mechanisms.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/460.pdf},\n  editor = {Katinka Wolter},\n  publisher = {Springer},\n  address = {Heidelberg, Germany},\n  series = {Lecture Notes in Computer Science},\n  booktitle = {Formal Methods and Stochastic Models for Performance Evaluation, Proceedings of the 4th European Performance Engineering Workshop (EPEW 2007), Berlin, Germany, September 27-28, 2007},\n  isbn = {978-3-540-75210-3},\n  doi = {10.1007/978-3-540-75211-0_10},\n  author = {Nou, Ramon and Kounev, Samuel and Torres, Jordi}\n}\n
\n\n','As Grid computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. To guarantee that QoS requirements are continuously satisfied, the Grid middleware must be capable of predicting the application performance on the fly when deciding how to distribute the workload among the available resources. One way to achieve this is by using online performance models that get generated and analyzed on the fly. In this paper, we present a novel case study with the Globus Toolkit in which we show how performance models can be generated dynamically and used to provide online performance prediction capabilities. We have augmented the Grid middleware with an online performance prediction component that can be called at any time during operation to predict the Grid performance for a given resource allocation and load-balancing strategy. We evaluate the quality of our performance prediction mechanism and present some experimental results that demonstrate its effectiveness and practicality. The framework we propose can be used to design intelligent QoS-aware resource allocation and admission control mechanisms.','{Building Online Performance Models of Grid Middleware with Fine-Grained Load-Balancing: A Globus Toolkit Case Study}',0,9,2007,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(481,'paper','PiEyKoSh2007-DEBS-PubSubAPI','inproceedings','@inproceedings{PiEyKoSh2007-DEBS-PubSubAPI,\n abstract = {Over the last decade a wide range of publish/subscribe (pub/sub) systems have come out of the research community. However, there is little consensus on a common pub/sub API, which would facilitate innovation, encourage application building, and simplify the evaluation of existing prototypes. Industry pub/sub standards tend to be overly complex, technology-centric, and hard to extend, thus limiting their applicability in research systems. In this paper we propose a common API for pub/sub that is tailored towards research requirements. The API supports three levels of compliance (with optional extensions): the lowest level specifies abstract operations without prescribing an implementation or data model; medium compliance describes interactions using a light-weight XML-RPC mechanism; finally, the highest level of compliance enforces an XML-RPC data model, enabling systems to understand each other\'s event and subscription semantics. We show that, by following this flexible approach with emphasis on extensibility, our API can be supported by many prototype systems with little effort.},\n author = {Peter Pietzuch and David Eyers and Samuel Kounev and Brian Shand},\n booktitle = {Proceedings of the 2007 Inaugural International Conference on Distributed Event-Based Systems (DEBS 2007), Toronto, Canada, June 20-22, 2007},\n doi = {10.1145/1266894.1266924},\n editor = {Hans-Arno Jacobsen and Gero M{\\\"u}hl and Michael A. Jaeger},\n isbn = {978-1-59593-665-3},\n month = {June},\n pages = {152--157},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/481.pdf},\n publisher = {ACM, New York, NY, USA},\n series = {ACM International Conference Proceeding Series},\n title = {{Towards a Common API for Publish/Subscribe}},\n url = {http://debs.msrg.utoronto.ca/},\n volume = {233},\n year = {2007},\n}\n\n','\n\nPeter Pietzuch, David Eyers, Samuel Kounev, and Brian Shand.\nTowards a Common API for Publish/Subscribe.\nIn Proceedings of the 2007 Inaugural International Conference on\nDistributed Event-Based Systems (DEBS 2007), Toronto, Canada, June 20-22,\n2007, Hans-Arno Jacobsen, Gero Mühl, and Michael A. Jaeger, editors,\nJune 2007, volume 233 of ACM International Conference Proceeding\nSeries, pages 152-157. ACM, New York, NY, USA.\nJune 2007.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{PiEyKoSh2007-DEBS-PubSubAPI,\nabstract = {Over the last decade a wide range of publish/subscribe (pub/sub) systems have come out of the research community. However, there is little consensus on a common pub/sub API, which would facilitate innovation, encourage application building, and simplify the evaluation of existing prototypes. Industry pub/sub standards tend to be overly complex, technology-centric, and hard to extend, thus limiting their applicability in research systems. In this paper we propose a common API for pub/sub that is tailored towards research requirements. The API supports three levels of compliance (with optional extensions): the lowest level specifies abstract operations without prescribing an implementation or data model; medium compliance describes interactions using a light-weight XML-RPC mechanism; finally, the highest level of compliance enforces an XML-RPC data model, enabling systems to understand each other\'s event and subscription semantics. We show that, by following this flexible approach with emphasis on extensibility, our API can be supported by many prototype systems with little effort.},\nauthor = {Peter Pietzuch and David Eyers and Samuel Kounev and Brian Shand},\nbooktitle = {Proceedings of the 2007 Inaugural International Conference on Distributed Event-Based Systems (DEBS 2007), Toronto, Canada, June 20-22, 2007},\ndoi = {10.1145/1266894.1266924},\neditor = {Hans-Arno Jacobsen and Gero M{\\\"u}hl and Michael A. Jaeger},\nisbn = {978-1-59593-665-3},\nmonth = {June},\npages = {152--157},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/481.pdf},\npublisher = {ACM, New York, NY, USA},\nseries = {ACM International Conference Proceeding Series},\ntitle = {{Towards a Common API for Publish/Subscribe}},\nurl = {http://debs.msrg.utoronto.ca/},\nvolume = {233},\nyear = {2007}\n}\n
\n
\nOver the last decade a wide range of publish/subscribe (pub/sub) systems have come out of the research community. However, there is little consensus on a common pub/sub API, which would facilitate innovation, encourage application building, and simplify the evaluation of existing prototypes. Industry pub/sub standards tend to be overly complex, technology-centric, and hard to extend, thus limiting their applicability in research systems. In this paper we propose a common API for pub/sub that is tailored towards research requirements. The API supports three levels of compliance (with optional extensions): the lowest level specifies abstract operations without prescribing an implementation or data model; medium compliance describes interactions using a light-weight XML-RPC mechanism; finally, the highest level of compliance enforces an XML-RPC data model, enabling systems to understand each other\'s event and subscription semantics. We show that, by following this flexible approach with emphasis on extensibility, our API can be supported by many prototype systems with little effort.\n
\n','
\n@inproceedings{PiEyKoSh2007-DEBS-PubSubAPI,\n  abstract = {Over the last decade a wide range of publish/subscribe (pub/sub) systems have come out of the research community. However, there is little consensus on a common pub/sub API, which would facilitate innovation, encourage application building, and simplify the evaluation of existing prototypes. Industry pub/sub standards tend to be overly complex, technology-centric, and hard to extend, thus limiting their applicability in research systems. In this paper we propose a common API for pub/sub that is tailored towards research requirements. The API supports three levels of compliance (with optional extensions): the lowest level specifies abstract operations without prescribing an implementation or data model; medium compliance describes interactions using a light-weight XML-RPC mechanism; finally, the highest level of compliance enforces an XML-RPC data model, enabling systems to understand each other\'s event and subscription semantics. We show that, by following this flexible approach with emphasis on extensibility, our API can be supported by many prototype systems with little effort.},\n  author = {Peter Pietzuch and David Eyers and Samuel Kounev and Brian Shand},\n  booktitle = {Proceedings of the 2007 Inaugural International Conference on Distributed Event-Based Systems (DEBS 2007), Toronto, Canada, June 20-22, 2007},\n  doi = {10.1145/1266894.1266924},\n  editor = {Hans-Arno Jacobsen and Gero M{\\\"u}hl and Michael A. Jaeger},\n  isbn = {978-1-59593-665-3},\n  month = {June},\n  pages = {152--157},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/481.pdf},\n  publisher = {ACM, New York, NY, USA},\n  series = {ACM International Conference Proceeding Series},\n  title = {{Towards a Common API for Publish/Subscribe}},\n  url = {http://debs.msrg.utoronto.ca/},\n  volume = {233},\n  year = {2007}\n}\n
\n\n','Over the last decade a wide range of publish/subscribe (pub/sub) systems have come out of the research community. However, there is little consensus on a common pub/sub API, which would facilitate innovation, encourage application building, and simplify the evaluation of existing prototypes. Industry pub/sub standards tend to be overly complex, technology-centric, and hard to extend, thus limiting their applicability in research systems. In this paper we propose a common API for pub/sub that is tailored towards research requirements. The API supports three levels of compliance (with optional extensions): the lowest level specifies abstract operations without prescribing an implementation or data model; medium compliance describes interactions using a light-weight XML-RPC mechanism; finally, the highest level of compliance enforces an XML-RPC data model, enabling systems to understand each other\'s event and subscription semantics. We show that, by following this flexible approach with emphasis on extensibility, our API can be supported by many prototype systems with little effort.','{Towards a Common API for Publish/Subscribe}',0,6,2007,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(487,'paper','rathfelder2013b','book','@book{rathfelder2013b,\n address = {Karlsruhe, Germany},\n author = {Christoph Rathfelder},\n pdf = {http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/2499675},\n publisher = {KIT Scientific Publishing},\n series = {The Karlsruhe Series on Software Design and Quality},\n title = {Modelling Event-Based Interactions in Component-Based Architectures for Quantitative System Evaluation},\n url = {http://www.ksp.kit.edu/shop/isbn2shopid.php?isbn=978-3-86644-969-5},\n volume = {10},\n year = {2013},\n}\n\n','\n\nChristoph Rathfelder.\nModelling Event-Based Interactions in Component-Based\nArchitectures for Quantitative System Evaluation, volume 10 of The\nKarlsruhe Series on Software Design and Quality.\nKIT Scientific Publishing, Karlsruhe, Germany, 2013.\n[ bib | http | http  ] 
\n@book{rathfelder2013b,\naddress = {Karlsruhe, Germany},\nauthor = {Christoph Rathfelder},\npdf = {http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/2499675},\npublisher = {KIT Scientific Publishing},\nseries = {The Karlsruhe Series on Software Design and Quality},\ntitle = {Modelling Event-Based Interactions in Component-Based Architectures for Quantitative System Evaluation},\nurl = {http://www.ksp.kit.edu/shop/isbn2shopid.php?isbn=978-3-86644-969-5},\nvolume = {10},\nyear = {2013}\n}\n
\n
\n','
\n@book{rathfelder2013b,\n  address = {Karlsruhe, Germany},\n  author = {Christoph Rathfelder},\n  pdf = {http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/2499675},\n  publisher = {KIT Scientific Publishing},\n  series = {The Karlsruhe Series on Software Design and Quality},\n  title = {Modelling Event-Based Interactions in Component-Based Architectures for Quantitative System Evaluation},\n  url = {http://www.ksp.kit.edu/shop/isbn2shopid.php?isbn=978-3-86644-969-5},\n  volume = {10},\n  year = {2013}\n}\n
\n\n',NULL,'Modelling Event-Based Interactions in Component-Based Architectures for Quantitative System Evaluation',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(488,'paper','rathfelder2007a','book','@book{rathfelder2007a,\n address = {Saarbr\\\"{u}cken, Germany},\n author = {Rathfelder, Christoph},\n month = {April},\n publisher = {VDM Verlag Dr. M\\\"{u}ller},\n title = {{M}anagement in serviceorientierten {A}rchitekturen: {E}ine {M}anagementinfrastruktur f\\\"{u}r die \\\"{U}berwachung komponierter {W}ebservices},\n year = {2007},\n}\n\n','\n\nChristoph Rathfelder.\nManagement in serviceorientierten Architekturen: Eine\nManagementinfrastruktur für die Überwachung komponierter\nWebservices.\nVDM Verlag Dr. Müller, Saarbrücken, Germany, April 2007.\n[ bib  ] 
\n@book{rathfelder2007a,\naddress = {Saarbr\\\"{u}cken, Germany},\nauthor = {Rathfelder, Christoph},\nmonth = {April},\npublisher = {VDM Verlag Dr. M\\\"{u}ller},\ntitle = {{M}anagement in serviceorientierten {A}rchitekturen: {E}ine {M}anagementinfrastruktur f\\\"{u}r die \\\"{U}berwachung komponierter {W}ebservices},\nyear = {2007}\n}\n
\n
\n','
\n@book{rathfelder2007a,\n  address = {Saarbr\\\"{u}cken, Germany},\n  author = {Rathfelder, Christoph},\n  month = {April},\n  publisher = {VDM Verlag Dr. M\\\"{u}ller},\n  title = {{M}anagement in serviceorientierten {A}rchitekturen: {E}ine {M}anagementinfrastruktur f\\\"{u}r die \\\"{U}berwachung komponierter {W}ebservices},\n  year = {2007}\n}\n
\n\n',NULL,'{M}anagement in serviceorientierten {A}rchitekturen: {E}ine {M}anagementinfrastruktur f\\\"{u}r die \\\"{U}berwachung komponierter {W}ebservices',0,4,2007,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 10:15:30',0),(489,'paper','rathfelder2007b','mastersthesis','@mastersthesis{rathfelder2007b,\n address = {Karlsruhe},\n author = {Rathfelder, Christoph},\n school = {Universit{\"a}t Karlsruhe (TH)},\n title = {{{E}ine {M}anagementinfrastruktur f{\\\"u}r die {\\\"U}berwachung komponierter {W}ebservices}},\n year = {2007},\n}\n\n','\n\nChristoph Rathfelder.\nEine Managementinfrastruktur für die Überwachung\nkomponierter Webservices.\nMaster\'s thesis, Universit\"at Karlsruhe (TH), Karlsruhe, 2007.\n[ bib  ] 
\n@mastersthesis{rathfelder2007b,\naddress = {Karlsruhe},\nauthor = {Rathfelder, Christoph},\nschool = {Universit{\"a}t Karlsruhe (TH)},\ntitle = {{{E}ine {M}anagementinfrastruktur f{\\\"u}r die {\\\"U}berwachung komponierter {W}ebservices}},\nyear = {2007}\n}\n
\n
\n','
\n@mastersthesis{rathfelder2007b,\n  address = {Karlsruhe},\n  author = {Rathfelder, Christoph},\n  school = {Universit{\"a}t Karlsruhe (TH)},\n  title = {{{E}ine {M}anagementinfrastruktur f{\\\"u}r die {\\\"U}berwachung komponierter {W}ebservices}},\n  year = {2007}\n}\n
\n\n',NULL,'{{E}ine {M}anagementinfrastruktur f{\\\"u}r die {\\\"U}berwachung komponierter {W}ebservices}',0,0,2007,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(490,'paper','rathfelder2012a','inproceedings','@inproceedings{rathfelder2012a,\n author = {Christoph Rathfelder and Stefan Becker and Klaus Krogmann and Ralf Reussner},\n booktitle = {Proceedings of the Joint 10th Working IEEE/IFIP Conference on Software Architecture (WICSA) & 6th European Conference on Software Architecture (ECSA)},\n doi = {10.1109/WICSA-ECSA.212.11},\n location = {Helsinki, Finland},\n month = {August},\n note = {Acceptance Rate (Full Paper): 19.8\\%},\n pages = {31--40},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/490.pdf},\n title = {Workload-aware System Monitoring Using Performance Predictions Applied to a Large-scale E-Mail System},\n url = {http://www.wicsa.net/},\n year = {2012},\n}\n\n','\n\nChristoph Rathfelder, Stefan Becker, Klaus Krogmann, and Ralf Reussner.\nWorkload-aware system monitoring using performance predictions\napplied to a large-scale e-mail system.\nIn Proceedings of the Joint 10th Working IEEE/IFIP Conference on\nSoftware Architecture (WICSA) & 6th European Conference on Software\nArchitecture (ECSA), Helsinki, Finland, August 2012, pages 31-40.\nAcceptance Rate (Full Paper): 19.8%.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{rathfelder2012a,\nauthor = {Christoph Rathfelder and Stefan Becker and Klaus Krogmann and Ralf Reussner},\nbooktitle = {Proceedings of the Joint 10th Working IEEE/IFIP Conference on Software Architecture (WICSA) & 6th European Conference on Software Architecture (ECSA)},\ndoi = {10.1109/WICSA-ECSA.212.11},\nlocation = {Helsinki, Finland},\nmonth = {August},\nnote = {Acceptance Rate (Full Paper): 19.8\\%},\npages = {31--40},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/490.pdf},\ntitle = {Workload-aware System Monitoring Using Performance Predictions Applied to a Large-scale E-Mail System},\nurl = {http://www.wicsa.net/},\nyear = {2012}\n}\n
\n
\n','
\n@inproceedings{rathfelder2012a,\n  author = {Christoph Rathfelder and Stefan Becker and Klaus Krogmann and Ralf Reussner},\n  booktitle = {Proceedings of the Joint 10th Working IEEE/IFIP Conference on Software Architecture (WICSA) & 6th European Conference on Software Architecture (ECSA)},\n  doi = {10.1109/WICSA-ECSA.212.11},\n  location = {Helsinki, Finland},\n  month = {August},\n  note = {Acceptance Rate (Full Paper): 19.8\\%},\n  pages = {31--40},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/490.pdf},\n  title = {Workload-aware System Monitoring Using Performance Predictions Applied to a Large-scale E-Mail System},\n  url = {http://www.wicsa.net/},\n  year = {2012}\n}\n
\n\n',NULL,'Workload-aware System Monitoring Using Performance Predictions Applied to a Large-scale E-Mail System',0,8,2012,8,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(491,'paper','rathfelder2010a','inproceedings','@inproceedings{rathfelder2010a,\n abstract = {The event-driven communication paradigm is used increasingly often to build loosely-coupled distributed systems in many industry domains including telecommunications, transportation, and supply chain management. However, the loose coupling of components in such systems makes it hard for developers to estimate their behaviour and performance under load. Most general purpose performance meta-models for component-based systems provide limited support for modelling event-driven communication. In this paper, we present a case study of a real-life road traffic monitoring system that shows how event-driven communication can be modelled for performance prediction and capacity planning. Our approach is based on the Palladio Component Model (PCM) which we have extended to support event-driven communication. We evaluate the accuracy of our modelling approach in a number of different workload and configuration scenarios. The results demonstrate the practicality and effectiveness of the proposed approach.},\n address = {Berlin, Heidelberg},\n author = {Christoph Rathfelder and David Evans and Samuel Kounev},\n booktitle = {Proceedings of the 7th European Performance Engineering Workshop (EPEW 2010)},\n day = {23--24},\n editor = {Alessandro Aldini and Marco Bernardo and Luciano Bononi and Vittorio Cortellessa},\n location = {Bertinoro, Italy},\n month = {September},\n pages = {219--235},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/491.pdf},\n publisher = {Springer-Verlag},\n series = {Lecture Notes in Computer Science (LNCS)},\n title = {{P}redictive {M}odelling of {P}eer-to-{P}eer {E}vent-driven {C}ommunication in {C}omponent-based {S}ystems},\n volume = {6342},\n year = {2010},\n}\n\n','\n\nChristoph Rathfelder, David Evans, and Samuel Kounev.\nPredictive Modelling of Peer-to-Peer Event-driven\nCommunication in Component-based Systems.\nIn Proceedings of the 7th European Performance Engineering\nWorkshop (EPEW 2010), Alessandro Aldini, Marco Bernardo, Luciano Bononi, and\nVittorio Cortellessa, editors, Bertinoro, Italy, September 23-24, 2010,\nvolume 6342 of Lecture Notes in Computer Science (LNCS), pages\n219-235. Springer-Verlag, Berlin, Heidelberg.\nSeptember 2010.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{rathfelder2010a,\nabstract = {The event-driven communication paradigm is used increasingly often to build loosely-coupled distributed systems in many industry domains including telecommunications, transportation, and supply chain management. However, the loose coupling of components in such systems makes it hard for developers to estimate their behaviour and performance under load. Most general purpose performance meta-models for component-based systems provide limited support for modelling event-driven communication. In this paper, we present a case study of a real-life road traffic monitoring system that shows how event-driven communication can be modelled for performance prediction and capacity planning. Our approach is based on the Palladio Component Model (PCM) which we have extended to support event-driven communication. We evaluate the accuracy of our modelling approach in a number of different workload and configuration scenarios. The results demonstrate the practicality and effectiveness of the proposed approach.},\naddress = {Berlin, Heidelberg},\nauthor = {Christoph Rathfelder and David Evans and Samuel Kounev},\nbooktitle = {Proceedings of the 7th European Performance Engineering Workshop (EPEW 2010)},\nday = {23--24},\neditor = {Alessandro Aldini and Marco Bernardo and Luciano Bononi and Vittorio Cortellessa},\nlocation = {Bertinoro, Italy},\nmonth = {September},\npages = {219--235},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/491.pdf},\npublisher = {Springer-Verlag},\nseries = {Lecture Notes in Computer Science (LNCS)},\ntitle = {{P}redictive {M}odelling of {P}eer-to-{P}eer {E}vent-driven {C}ommunication in {C}omponent-based {S}ystems},\nvolume = {6342},\nyear = {2010}\n}\n
\n
\nThe event-driven communication paradigm is used increasingly often to build loosely-coupled distributed systems in many industry domains including telecommunications, transportation, and supply chain management. However, the loose coupling of components in such systems makes it hard for developers to estimate their behaviour and performance under load. Most general purpose performance meta-models for component-based systems provide limited support for modelling event-driven communication. In this paper, we present a case study of a real-life road traffic monitoring system that shows how event-driven communication can be modelled for performance prediction and capacity planning. Our approach is based on the Palladio Component Model (PCM) which we have extended to support event-driven communication. We evaluate the accuracy of our modelling approach in a number of different workload and configuration scenarios. The results demonstrate the practicality and effectiveness of the proposed approach.\n
\n','
\n@inproceedings{rathfelder2010a,\n  abstract = {The event-driven communication paradigm is used increasingly often to build loosely-coupled distributed systems in many industry domains including telecommunications, transportation, and supply chain management. However, the loose coupling of components in such systems makes it hard for developers to estimate their behaviour and performance under load. Most general purpose performance meta-models for component-based systems provide limited support for modelling event-driven communication. In this paper, we present a case study of a real-life road traffic monitoring system that shows how event-driven communication can be modelled for performance prediction and capacity planning. Our approach is based on the Palladio Component Model (PCM) which we have extended to support event-driven communication. We evaluate the accuracy of our modelling approach in a number of different workload and configuration scenarios. The results demonstrate the practicality and effectiveness of the proposed approach.},\n  address = {Berlin, Heidelberg},\n  author = {Christoph Rathfelder and David Evans and Samuel Kounev},\n  booktitle = {Proceedings of the 7th European Performance Engineering Workshop (EPEW 2010)},\n  day = {23--24},\n  editor = {Alessandro Aldini and Marco Bernardo and Luciano Bononi and Vittorio Cortellessa},\n  location = {Bertinoro, Italy},\n  month = {September},\n  pages = {219--235},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/491.pdf},\n  publisher = {Springer-Verlag},\n  series = {Lecture Notes in Computer Science (LNCS)},\n  title = {{P}redictive {M}odelling of {P}eer-to-{P}eer {E}vent-driven {C}ommunication in {C}omponent-based {S}ystems},\n  volume = {6342},\n  year = {2010}\n}\n
\n\n','The event-driven communication paradigm is used increasingly often to build loosely-coupled distributed systems in many industry domains including telecommunications, transportation, and supply chain management. However, the loose coupling of components in such systems makes it hard for developers to estimate their behaviour and performance under load. Most general purpose performance meta-models for component-based systems provide limited support for modelling event-driven communication. In this paper, we present a case study of a real-life road traffic monitoring system that shows how event-driven communication can be modelled for performance prediction and capacity planning. Our approach is based on the Palladio Component Model (PCM) which we have extended to support event-driven communication. We evaluate the accuracy of our modelling approach in a number of different workload and configuration scenarios. The results demonstrate the practicality and effectiveness of the proposed approach.','{P}redictive {M}odelling of {P}eer-to-{P}eer {E}vent-driven {C}ommunication in {C}omponent-based {S}ystems',0,9,2010,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(492,'paper','rathfelder2009c','inproceedings','@inproceedings{rathfelder2009c,\n abstract = {Today, the architectures of software systems are not stable for their whole lifetime but often adapted driven by business needs. Preserving their quality characteristics beyond each of these changes requires deep knowledge of the requirements and the systems themselves. Proper documentation reduces the risk that knowledge is lost and hence is a base for the system\'s maintenance in the long-run. However, the influence of architectural documentation on the maintainability of software systems is neglected in current quality assessment methods. They are limited to documentation for anticipated change scenarios and do not provide a general assessment approach. In this paper, we propose a maturity model for architecture documentation. It is shaped relative to growing quality preservation maturity and independent of specific technologies or products. It supports the weighting of necessary effort against reducing long-term risks in the maintenance phase. This allows to take product maintainability requirements into account for selecting an appropriate documentation maturity level.},\n address = {Berlin, Germany},\n author = {Rathfelder, Christoph and Groenda, Henning},\n booktitle = {Proceedings of the 3rd Workshop MDD, SOA und IT-Management (MSI 2009)},\n day = {6--7},\n location = {Oldenburg, Germany},\n month = {October},\n pages = {65--80},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/492.pdf},\n publisher = {GiTO-Verlag},\n title = {{T}he {A}rchitecture {D}ocumentation {M}aturity {M}odel {ADM2}},\n year = {2009},\n}\n\n','\n\nChristoph Rathfelder and Henning Groenda.\nThe Architecture Documentation Maturity Model ADM2.\nIn Proceedings of the 3rd Workshop MDD, SOA und IT-Management\n(MSI 2009), Oldenburg, Germany, October 6-7, 2009, pages 65-80.\nGiTO-Verlag, Berlin, Germany.\nOctober 2009.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{rathfelder2009c,\nabstract = {Today, the architectures of software systems are not stable for their whole lifetime but often adapted driven by business needs. Preserving their quality characteristics beyond each of these changes requires deep knowledge of the requirements and the systems themselves. Proper documentation reduces the risk that knowledge is lost and hence is a base for the system\'s maintenance in the long-run. However, the influence of architectural documentation on the maintainability of software systems is neglected in current quality assessment methods. They are limited to documentation for anticipated change scenarios and do not provide a general assessment approach. In this paper, we propose a maturity model for architecture documentation. It is shaped relative to growing quality preservation maturity and independent of specific technologies or products. It supports the weighting of necessary effort against reducing long-term risks in the maintenance phase. This allows to take product maintainability requirements into account for selecting an appropriate documentation maturity level.},\naddress = {Berlin, Germany},\nauthor = {Rathfelder, Christoph and Groenda, Henning},\nbooktitle = {Proceedings of the 3rd Workshop MDD, SOA und IT-Management (MSI 2009)},\nday = {6--7},\nlocation = {Oldenburg, Germany},\nmonth = {October},\npages = {65--80},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/492.pdf},\npublisher = {GiTO-Verlag},\ntitle = {{T}he {A}rchitecture {D}ocumentation {M}aturity {M}odel {ADM2}},\nyear = {2009}\n}\n
\n
\nToday, the architectures of software systems are not stable for their whole lifetime but often adapted driven by business needs. Preserving their quality characteristics beyond each of these changes requires deep knowledge of the requirements and the systems themselves. Proper documentation reduces the risk that knowledge is lost and hence is a base for the system\'s maintenance in the long-run. However, the influence of architectural documentation on the maintainability of software systems is neglected in current quality assessment methods. They are limited to documentation for anticipated change scenarios and do not provide a general assessment approach. In this paper, we propose a maturity model for architecture documentation. It is shaped relative to growing quality preservation maturity and independent of specific technologies or products. It supports the weighting of necessary effort against reducing long-term risks in the maintenance phase. This allows to take product maintainability requirements into account for selecting an appropriate documentation maturity level.\n
\n','
\n@inproceedings{rathfelder2009c,\n  abstract = {Today, the architectures of software systems are not stable for their whole lifetime but often adapted driven by business needs. Preserving their quality characteristics beyond each of these changes requires deep knowledge of the requirements and the systems themselves. Proper documentation reduces the risk that knowledge is lost and hence is a base for the system\'s maintenance in the long-run. However, the influence of architectural documentation on the maintainability of software systems is neglected in current quality assessment methods. They are limited to documentation for anticipated change scenarios and do not provide a general assessment approach. In this paper, we propose a maturity model for architecture documentation. It is shaped relative to growing quality preservation maturity and independent of specific technologies or products. It supports the weighting of necessary effort against reducing long-term risks in the maintenance phase. This allows to take product maintainability requirements into account for selecting an appropriate documentation maturity level.},\n  address = {Berlin, Germany},\n  author = {Rathfelder, Christoph and Groenda, Henning},\n  booktitle = {Proceedings of the 3rd Workshop MDD, SOA und IT-Management (MSI 2009)},\n  day = {6--7},\n  location = {Oldenburg, Germany},\n  month = {October},\n  pages = {65--80},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/492.pdf},\n  publisher = {GiTO-Verlag},\n  title = {{T}he {A}rchitecture {D}ocumentation {M}aturity {M}odel {ADM2}},\n  year = {2009}\n}\n
\n\n','Today, the architectures of software systems are not stable for their whole lifetime but often adapted driven by business needs. Preserving their quality characteristics beyond each of these changes requires deep knowledge of the requirements and the systems themselves. Proper documentation reduces the risk that knowledge is lost and hence is a base for the system\'s maintenance in the long-run. However, the influence of architectural documentation on the maintainability of software systems is neglected in current quality assessment methods. They are limited to documentation for anticipated change scenarios and do not provide a general assessment approach. In this paper, we propose a maturity model for architecture documentation. It is shaped relative to growing quality preservation maturity and independent of specific technologies or products. It supports the weighting of necessary effort against reducing long-term risks in the maintenance phase. This allows to take product maintainability requirements into account for selecting an appropriate documentation maturity level.','{T}he {A}rchitecture {D}ocumentation {M}aturity {M}odel {ADM2}',0,10,2009,10,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(493,'paper','rathfelder2008a','inproceedings','@inproceedings{rathfelder2008a,\n abstract = {The implementation of an enterprise-wide Service Oriented Architecture (SOA) is a complex task. In most cases, evolutional approaches are used to handle this complexity. Maturity models are a possibility to plan and control such an evolution as they allow evaluating the current maturity and identifying current shortcomings. In order to support an SOA implementation, maturity models should also support in the selection of the most adequate maturity level and the deduction of a roadmap to this level. Existing SOA maturity models provide only weak assistance with the selection of an adequate maturity level. Most of them are developed by vendors of SOA products and often used to promote their products. In this paper, we introduce our independent SOA Maturity Model (iSOAMM), which is independent of the used technologies and products. In addition to the impacts on IT systems, it reflects the implications on organizational structures and governance. Furthermore, the iSOAMM lists the challenges, benefits and risks associated with each maturity level. This enables enterprises to select the most adequate maturity level for them, which is not necessarily the highest one.},\n address = {Berlin, Heidelberg},\n author = {Rathfelder, Christoph and Groenda, Henning},\n booktitle = {Proceedings of the 8th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS 2008)},\n day = {4--6},\n location = {Olso, Norway},\n month = {June},\n pages = {1--15},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/493.pdf},\n publisher = {Springer-Verlag},\n series = {Lecture Notes in Computer Science (LNCS)},\n title = {i{SOAMM}: {A}n independent {SOA} {M}aturity {M}odel},\n url = {http://www.springerlink.com/content/p38u564015713h55/?p=2777c4e8e3d6487e8f1e11de52f10f91&pi=1},\n volume = {5053/2008},\n year = {2008},\n}\n\n','\n\nChristoph Rathfelder and Henning Groenda.\niSOAMM: An independent SOA Maturity Model.\nIn Proceedings of the 8th IFIP International Conference on\nDistributed Applications and Interoperable Systems (DAIS 2008), Olso,\nNorway, June 4-6, 2008, volume 5053/2008 of Lecture Notes in Computer\nScience (LNCS), pages 1-15. Springer-Verlag, Berlin, Heidelberg.\nJune 2008.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{rathfelder2008a,\nabstract = {The implementation of an enterprise-wide Service Oriented Architecture (SOA) is a complex task. In most cases, evolutional approaches are used to handle this complexity. Maturity models are a possibility to plan and control such an evolution as they allow evaluating the current maturity and identifying current shortcomings. In order to support an SOA implementation, maturity models should also support in the selection of the most adequate maturity level and the deduction of a roadmap to this level. Existing SOA maturity models provide only weak assistance with the selection of an adequate maturity level. Most of them are developed by vendors of SOA products and often used to promote their products. In this paper, we introduce our independent SOA Maturity Model (iSOAMM), which is independent of the used technologies and products. In addition to the impacts on IT systems, it reflects the implications on organizational structures and governance. Furthermore, the iSOAMM lists the challenges, benefits and risks associated with each maturity level. This enables enterprises to select the most adequate maturity level for them, which is not necessarily the highest one.},\naddress = {Berlin, Heidelberg},\nauthor = {Rathfelder, Christoph and Groenda, Henning},\nbooktitle = {Proceedings of the 8th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS 2008)},\nday = {4--6},\nlocation = {Olso, Norway},\nmonth = {June},\npages = {1--15},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/493.pdf},\npublisher = {Springer-Verlag},\nseries = {Lecture Notes in Computer Science (LNCS)},\ntitle = {i{SOAMM}: {A}n independent {SOA} {M}aturity {M}odel},\nurl = {http://www.springerlink.com/content/p38u564015713h55/?p=2777c4e8e3d6487e8f1e11de52f10f91&pi=1},\nvolume = {5053/2008},\nyear = {2008}\n}\n
\n
\nThe implementation of an enterprise-wide Service Oriented Architecture (SOA) is a complex task. In most cases, evolutional approaches are used to handle this complexity. Maturity models are a possibility to plan and control such an evolution as they allow evaluating the current maturity and identifying current shortcomings. In order to support an SOA implementation, maturity models should also support in the selection of the most adequate maturity level and the deduction of a roadmap to this level. Existing SOA maturity models provide only weak assistance with the selection of an adequate maturity level. Most of them are developed by vendors of SOA products and often used to promote their products. In this paper, we introduce our independent SOA Maturity Model (iSOAMM), which is independent of the used technologies and products. In addition to the impacts on IT systems, it reflects the implications on organizational structures and governance. Furthermore, the iSOAMM lists the challenges, benefits and risks associated with each maturity level. This enables enterprises to select the most adequate maturity level for them, which is not necessarily the highest one.\n
\n','
\n@inproceedings{rathfelder2008a,\n  abstract = {The implementation of an enterprise-wide Service Oriented Architecture (SOA) is a complex task. In most cases, evolutional approaches are used to handle this complexity. Maturity models are a possibility to plan and control such an evolution as they allow evaluating the current maturity and identifying current shortcomings. In order to support an SOA implementation, maturity models should also support in the selection of the most adequate maturity level and the deduction of a roadmap to this level. Existing SOA maturity models provide only weak assistance with the selection of an adequate maturity level. Most of them are developed by vendors of SOA products and often used to promote their products. In this paper, we introduce our independent SOA Maturity Model (iSOAMM), which is independent of the used technologies and products. In addition to the impacts on IT systems, it reflects the implications on organizational structures and governance. Furthermore, the iSOAMM lists the challenges, benefits and risks associated with each maturity level. This enables enterprises to select the most adequate maturity level for them, which is not necessarily the highest one.},\n  address = {Berlin, Heidelberg},\n  author = {Rathfelder, Christoph and Groenda, Henning},\n  booktitle = {Proceedings of the 8th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS 2008)},\n  day = {4--6},\n  location = {Olso, Norway},\n  month = {June},\n  pages = {1--15},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/493.pdf},\n  publisher = {Springer-Verlag},\n  series = {Lecture Notes in Computer Science (LNCS)},\n  title = {i{SOAMM}: {A}n independent {SOA} {M}aturity {M}odel},\n  url = {http://www.springerlink.com/content/p38u564015713h55/?p=2777c4e8e3d6487e8f1e11de52f10f91&pi=1},\n  volume = {5053/2008},\n  year = {2008}\n}\n
\n\n','The implementation of an enterprise-wide Service Oriented Architecture (SOA) is a complex task. In most cases, evolutional approaches are used to handle this complexity. Maturity models are a possibility to plan and control such an evolution as they allow evaluating the current maturity and identifying current shortcomings. In order to support an SOA implementation, maturity models should also support in the selection of the most adequate maturity level and the deduction of a roadmap to this level. Existing SOA maturity models provide only weak assistance with the selection of an adequate maturity level. Most of them are developed by vendors of SOA products and often used to promote their products. In this paper, we introduce our independent SOA Maturity Model (iSOAMM), which is independent of the used technologies and products. In addition to the impacts on IT systems, it reflects the implications on organizational structures and governance. Furthermore, the iSOAMM lists the challenges, benefits and risks associated with each maturity level. This enables enterprises to select the most adequate maturity level for them, which is not necessarily the highest one.','i{SOAMM}: {A}n independent {SOA} {M}aturity {M}odel',0,6,2008,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(494,'paper','rathfelder2008c','article','@article{rathfelder2008c,\n address = {Bonn, Germany},\n author = {Christoph Rathfelder and Henning Groenda},\n journal = {Softwaretechnik-Trends},\n month = {November},\n number = {4},\n pages = {3--7},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/494.pdf},\n publisher = {GI (Gesellschaft fuer Informatik)},\n timestamp = {2009.01.19},\n title = {{T}owards an {A}rchitecture {M}aintainability {M}aturity {M}odel ({AM}3)},\n volume = {28},\n year = {2008},\n}\n\n','\n\nChristoph Rathfelder and Henning Groenda.\nTowards an Architecture Maintainability Maturity Model\n(AM3).\nSoftwaretechnik-Trends, 28(4):3-7, November 2008, GI\n(Gesellschaft fuer Informatik), Bonn, Germany.\n[ bib | .pdf  ] 
\n@article{rathfelder2008c,\naddress = {Bonn, Germany},\nauthor = {Christoph Rathfelder and Henning Groenda},\njournal = {Softwaretechnik-Trends},\nmonth = {November},\nnumber = {4},\npages = {3--7},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/494.pdf},\npublisher = {GI (Gesellschaft fuer Informatik)},\ntimestamp = {2009.01.19},\ntitle = {{T}owards an {A}rchitecture {M}aintainability {M}aturity {M}odel ({AM}3)},\nvolume = {28},\nyear = {2008}\n}\n
\n
\n','
\n@article{rathfelder2008c,\n  address = {Bonn, Germany},\n  author = {Christoph Rathfelder and Henning Groenda},\n  journal = {Softwaretechnik-Trends},\n  month = {November},\n  number = {4},\n  pages = {3--7},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/494.pdf},\n  publisher = {GI (Gesellschaft fuer Informatik)},\n  timestamp = {2009.01.19},\n  title = {{T}owards an {A}rchitecture {M}aintainability {M}aturity {M}odel ({AM}3)},\n  volume = {28},\n  year = {2008}\n}\n
\n\n',NULL,'{T}owards an {A}rchitecture {M}aintainability {M}aturity {M}odel ({AM}3)',0,11,2008,11,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(495,'paper','rathfelder2007c','inproceedings','@inproceedings{rathfelder2007c,\n abstract = {Service-Orientierte Architekturen (SOAs) versprechen eine bessere Unterst\\\"{u}tzung von Gesch\\\"{a}ftsprozessen. Es gibt jedoch unterschiedliche Interpretationen dar\\\"{u}ber, was eine Service-Orientierte Architektur (SOA) ist. Da die Verbesserung der Gesch\\\"{a}ftsprozessunterst\\\"{u}tzung eines der h\\\"{a}ufigsten Argumente f\\\"{u}r SOAs ist, bietet es sich an, die verschiedenen SOA-Varianten nach der damit erm\\\"{o}glichten Prozessunterst\\\"{u}tzung zu kategorisieren. Bisherige Ans\\\"{a}tze zur Kategorisierung sind in vielen F\\\"{a}llen auf bestimmte Technologien oder Standards beschr\\\"{a}nkt und gehen nur am Rand auf die gegebene Prozessunterst\\\"{u}tzung ein. In diesem Artikel wird eine solche gesch\\\"{a}ftsprozessorientierte Kategorisierung von SOAs pr\\\"{a}sentiert.},\n author = {Rathfelder, Christoph and Groenda, Henning},\n booktitle = {2. Workshop Bewertungsaspekte serviceorientierter Architekturen},\n day = {13},\n location = {Karlsruhe, Germany},\n month = {November},\n pages = {11--22},\n pdf = {http://www.fzi.de/images/files/pub/SOA_Kategorisierung.pdf},\n publisher = {SHAKER Verlag},\n title = {{G}esch\\\"{a}ftsprozessorientierte {K}ategorisierung von {SOA}},\n year = {2007},\n}\n\n','\n\nChristoph Rathfelder and Henning Groenda.\nGeschäftsprozessorientierte Kategorisierung von SOA.\nIn 2. Workshop Bewertungsaspekte serviceorientierter\nArchitekturen, Karlsruhe, Germany, November 13, 2007, pages 11-22. SHAKER\nVerlag.\nNovember 2007.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{rathfelder2007c,\nabstract = {Service-Orientierte Architekturen (SOAs) versprechen eine bessere Unterst\\\"{u}tzung von Gesch\\\"{a}ftsprozessen. Es gibt jedoch unterschiedliche Interpretationen dar\\\"{u}ber, was eine Service-Orientierte Architektur (SOA) ist. Da die Verbesserung der Gesch\\\"{a}ftsprozessunterst\\\"{u}tzung eines der h\\\"{a}ufigsten Argumente f\\\"{u}r SOAs ist, bietet es sich an, die verschiedenen SOA-Varianten nach der damit erm\\\"{o}glichten Prozessunterst\\\"{u}tzung zu kategorisieren. Bisherige Ans\\\"{a}tze zur Kategorisierung sind in vielen F\\\"{a}llen auf bestimmte Technologien oder Standards beschr\\\"{a}nkt und gehen nur am Rand auf die gegebene Prozessunterst\\\"{u}tzung ein. In diesem Artikel wird eine solche gesch\\\"{a}ftsprozessorientierte Kategorisierung von SOAs pr\\\"{a}sentiert.},\nauthor = {Rathfelder, Christoph and Groenda, Henning},\nbooktitle = {2. Workshop Bewertungsaspekte serviceorientierter Architekturen},\nday = {13},\nlocation = {Karlsruhe, Germany},\nmonth = {November},\npages = {11--22},\npdf = {http://www.fzi.de/images/files/pub/SOA_Kategorisierung.pdf},\npublisher = {SHAKER Verlag},\ntitle = {{G}esch\\\"{a}ftsprozessorientierte {K}ategorisierung von {SOA}},\nyear = {2007}\n}\n
\n
\nService-Orientierte Architekturen (SOAs) versprechen eine bessere Unterstützung von Geschäftsprozessen. Es gibt jedoch unterschiedliche Interpretationen darüber, was eine Service-Orientierte Architektur (SOA) ist. Da die Verbesserung der Geschäftsprozessunterstützung eines der häufigsten Argumente für SOAs ist, bietet es sich an, die verschiedenen SOA-Varianten nach der damit ermöglichten Prozessunterstützung zu kategorisieren. Bisherige Ansätze zur Kategorisierung sind in vielen Fällen auf bestimmte Technologien oder Standards beschränkt und gehen nur am Rand auf die gegebene Prozessunterstützung ein. In diesem Artikel wird eine solche geschäftsprozessorientierte Kategorisierung von SOAs präsentiert.\n
\n','
\n@inproceedings{rathfelder2007c,\n  abstract = {Service-Orientierte Architekturen (SOAs) versprechen eine bessere Unterst\\\"{u}tzung von Gesch\\\"{a}ftsprozessen. Es gibt jedoch unterschiedliche Interpretationen dar\\\"{u}ber, was eine Service-Orientierte Architektur (SOA) ist. Da die Verbesserung der Gesch\\\"{a}ftsprozessunterst\\\"{u}tzung eines der h\\\"{a}ufigsten Argumente f\\\"{u}r SOAs ist, bietet es sich an, die verschiedenen SOA-Varianten nach der damit erm\\\"{o}glichten Prozessunterst\\\"{u}tzung zu kategorisieren. Bisherige Ans\\\"{a}tze zur Kategorisierung sind in vielen F\\\"{a}llen auf bestimmte Technologien oder Standards beschr\\\"{a}nkt und gehen nur am Rand auf die gegebene Prozessunterst\\\"{u}tzung ein. In diesem Artikel wird eine solche gesch\\\"{a}ftsprozessorientierte Kategorisierung von SOAs pr\\\"{a}sentiert.},\n  author = {Rathfelder, Christoph and Groenda, Henning},\n  booktitle = {2. Workshop Bewertungsaspekte serviceorientierter Architekturen},\n  day = {13},\n  location = {Karlsruhe, Germany},\n  month = {November},\n  pages = {11--22},\n  pdf = {http://www.fzi.de/images/files/pub/SOA_Kategorisierung.pdf},\n  publisher = {SHAKER Verlag},\n  title = {{G}esch\\\"{a}ftsprozessorientierte {K}ategorisierung von {SOA}},\n  year = {2007}\n}\n
\n\n','Service-Orientierte Architekturen (SOAs) versprechen eine bessere Unterst\\\"{u}tzung von Gesch\\\"{a}ftsprozessen. Es gibt jedoch unterschiedliche Interpretationen dar\\\"{u}ber, was eine Service-Orientierte Architektur (SOA) ist. Da die Verbesserung der Gesch\\\"{a}ftsprozessunterst\\\"{u}tzung eines der h\\\"{a}ufigsten Argumente f\\\"{u}r SOAs ist, bietet es sich an, die verschiedenen SOA-Varianten nach der damit erm\\\"{o}glichten Prozessunterst\\\"{u}tzung zu kategorisieren. Bisherige Ans\\\"{a}tze zur Kategorisierung sind in vielen F\\\"{a}llen auf bestimmte Technologien oder Standards beschr\\\"{a}nkt und gehen nur am Rand auf die gegebene Prozessunterst\\\"{u}tzung ein. In diesem Artikel wird eine solche gesch\\\"{a}ftsprozessorientierte Kategorisierung von SOAs pr\\\"{a}sentiert.','{G}esch\\\"{a}ftsprozessorientierte {K}ategorisierung von {SOA}',0,11,2007,11,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 10:14:37',0),(496,'paper','rathfelder2008b','incollection','@incollection{rathfelder2008b,\n author = {Christoph Rathfelder and Henning Groenda and Ralf Reussner},\n booktitle = {Industrialisierung des Software-Managements: Fachtagung des GI-Fachausschusses Management der Anwendungsentwicklung und -Wartung im Fachbereich Wirtschaftsinformatik (WI-MAW)},\n day = {12--14},\n editor = {Georg Herzwurm and Martin Mikusz},\n isbn = {978-3-88579-233-8, 3-88579-383-0},\n location = {Stuttgart, Germany},\n month = {November},\n pages = {169--180},\n series = {Lecture Notes in Informatics (LNI)},\n title = {{S}oftware {I}ndustrialization and {A}rchitecture {C}ertification},\n volume = {139},\n year = {2008},\n}\n\n','\n\nChristoph Rathfelder, Henning Groenda, and Ralf Reussner.\nSoftware Industrialization and Architecture Certification.\nIn Industrialisierung des Software-Managements: Fachtagung des\nGI-Fachausschusses Management der Anwendungsentwicklung und -Wartung im\nFachbereich Wirtschaftsinformatik (WI-MAW), Georg Herzwurm and Martin\nMikusz, editors, volume 139 of Lecture Notes in Informatics (LNI),\npages 169-180. November 2008.\n[ bib  ] 
\n@incollection{rathfelder2008b,\nauthor = {Christoph Rathfelder and Henning Groenda and Ralf Reussner},\nbooktitle = {Industrialisierung des Software-Managements: Fachtagung des GI-Fachausschusses Management der Anwendungsentwicklung und -Wartung im Fachbereich Wirtschaftsinformatik (WI-MAW)},\nday = {12--14},\neditor = {Georg Herzwurm and Martin Mikusz},\nisbn = {978-3-88579-233-8, 3-88579-383-0},\nlocation = {Stuttgart, Germany},\nmonth = {November},\npages = {169--180},\nseries = {Lecture Notes in Informatics (LNI)},\ntitle = {{S}oftware {I}ndustrialization and {A}rchitecture {C}ertification},\nvolume = {139},\nyear = {2008}\n}\n
\n
\n','
\n@incollection{rathfelder2008b,\n  author = {Christoph Rathfelder and Henning Groenda and Ralf Reussner},\n  booktitle = {Industrialisierung des Software-Managements: Fachtagung des GI-Fachausschusses Management der Anwendungsentwicklung und -Wartung im Fachbereich Wirtschaftsinformatik (WI-MAW)},\n  day = {12--14},\n  editor = {Georg Herzwurm and Martin Mikusz},\n  isbn = {978-3-88579-233-8, 3-88579-383-0},\n  location = {Stuttgart, Germany},\n  month = {November},\n  pages = {169--180},\n  series = {Lecture Notes in Informatics (LNI)},\n  title = {{S}oftware {I}ndustrialization and {A}rchitecture {C}ertification},\n  volume = {139},\n  year = {2008}\n}\n
\n\n',NULL,'{S}oftware {I}ndustrialization and {A}rchitecture {C}ertification',0,11,2008,11,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(497,'paper','rathfelder2011a','inproceedings','@inproceedings{rathfelder2011a,\n abstract = {Today, software engineering is challenged to handle more and more large-scale distributed systems with a guaranteed level of service quality. Component-based architectures have been established to build more structured and manageable software systems. However, due to time and cost constraints, it is not feasible to use a trial and error approach to ensure that an architecture meets the quality of service (QoS) requirements. In this tool demo, we present the Palladio Workbench that permits the modeling of component-based software architectures and the prediction of its quality characteristics (e.g., response time and utilization). Additional to a general tool overview, we will give some insights about a new feature to analyze the impact of event-driven communication that was added in the latest release of the Palladio Component Model (PCM)},\n address = {Washington, DC, USA},\n author = {Rathfelder, Christoph and Klatt, Benjamin},\n booktitle = {Proceedings of the 2011 Ninth Working IEEE/IFIP Conference on Software Architecture (WICSA 2011)},\n day = {20--24},\n doi = {http://dx.doi.org/10.1109/WICSA.2011.55},\n isbn = {978-0-7695-4351-2},\n location = {Boulder, Colorado, USA},\n month = {June},\n pages = {347--350},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/497.pdf},\n publisher = {IEEE Computer Society},\n title = {Palladio Workbench: A Quality-Prediction Tool for Component-Based Architectures},\n url = {http://dx.doi.org/10.1109/WICSA.2011.55},\n year = {2011},\n}\n\n','\n\nChristoph Rathfelder and Benjamin Klatt.\nPalladio workbench: A quality-prediction tool for component-based\narchitectures.\nIn Proceedings of the 2011 Ninth Working IEEE/IFIP Conference on\nSoftware Architecture (WICSA 2011), Boulder, Colorado, USA, June 20-24,\n2011, pages 347-350. IEEE Computer Society, Washington, DC, USA.\nJune 2011.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{rathfelder2011a,\nabstract = {Today, software engineering is challenged to handle more and more large-scale distributed systems with a guaranteed level of service quality. Component-based architectures have been established to build more structured and manageable software systems. However, due to time and cost constraints, it is not feasible to use a trial and error approach to ensure that an architecture meets the quality of service (QoS) requirements. In this tool demo, we present the Palladio Workbench that permits the modeling of component-based software architectures and the prediction of its quality characteristics (e.g., response time and utilization). Additional to a general tool overview, we will give some insights about a new feature to analyze the impact of event-driven communication that was added in the latest release of the Palladio Component Model (PCM)},\naddress = {Washington, DC, USA},\nauthor = {Rathfelder, Christoph and Klatt, Benjamin},\nbooktitle = {Proceedings of the 2011 Ninth Working IEEE/IFIP Conference on Software Architecture (WICSA 2011)},\nday = {20--24},\ndoi = {http://dx.doi.org/10.1109/WICSA.2011.55},\nisbn = {978-0-7695-4351-2},\nlocation = {Boulder, Colorado, USA},\nmonth = {June},\npages = {347--350},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/497.pdf},\npublisher = {IEEE Computer Society},\ntitle = {Palladio Workbench: A Quality-Prediction Tool for Component-Based Architectures},\nurl = {http://dx.doi.org/10.1109/WICSA.2011.55},\nyear = {2011}\n}\n
\n
\nToday, software engineering is challenged to handle more and more large-scale distributed systems with a guaranteed level of service quality. Component-based architectures have been established to build more structured and manageable software systems. However, due to time and cost constraints, it is not feasible to use a trial and error approach to ensure that an architecture meets the quality of service (QoS) requirements. In this tool demo, we present the Palladio Workbench that permits the modeling of component-based software architectures and the prediction of its quality characteristics (e.g., response time and utilization). Additional to a general tool overview, we will give some insights about a new feature to analyze the impact of event-driven communication that was added in the latest release of the Palladio Component Model (PCM)\n
\n','
\n@inproceedings{rathfelder2011a,\n  abstract = {Today, software engineering is challenged to handle more and more large-scale distributed systems with a guaranteed level of service quality. Component-based architectures have been established to build more structured and manageable software systems. However, due to time and cost constraints, it is not feasible to use a trial and error approach to ensure that an architecture meets the quality of service (QoS) requirements. In this tool demo, we present the Palladio Workbench that permits the modeling of component-based software architectures and the prediction of its quality characteristics (e.g., response time and utilization). Additional to a general tool overview, we will give some insights about a new feature to analyze the impact of event-driven communication that was added in the latest release of the Palladio Component Model (PCM)},\n  address = {Washington, DC, USA},\n  author = {Rathfelder, Christoph and Klatt, Benjamin},\n  booktitle = {Proceedings of the 2011 Ninth Working IEEE/IFIP Conference on Software Architecture (WICSA 2011)},\n  day = {20--24},\n  doi = {http://dx.doi.org/10.1109/WICSA.2011.55},\n  isbn = {978-0-7695-4351-2},\n  location = {Boulder, Colorado, USA},\n  month = {June},\n  pages = {347--350},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/497.pdf},\n  publisher = {IEEE Computer Society},\n  title = {Palladio Workbench: A Quality-Prediction Tool for Component-Based Architectures},\n  url = {http://dx.doi.org/10.1109/WICSA.2011.55},\n  year = {2011}\n}\n
\n\n','Today, software engineering is challenged to handle more and more large-scale distributed systems with a guaranteed level of service quality. Component-based architectures have been established to build more structured and manageable software systems. However, due to time and cost constraints, it is not feasible to use a trial and error approach to ensure that an architecture meets the quality of service (QoS) requirements. In this tool demo, we present the Palladio Workbench that permits the modeling of component-based software architectures and the prediction of its quality characteristics (e.g., response time and utilization). Additional to a general tool overview, we will give some insights about a new feature to analyze the impact of event-driven communication that was added in the latest release of the Palladio Component Model (PCM)','Palladio Workbench: A Quality-Prediction Tool for Component-Based Architectures',0,6,2011,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(498,'paper','rathfelder2010c','book','@book{rathfelder2010c,\n abstract = {With the introduction of services, systems become more flexible as new services can easily be composed out of existing services. Services are increasingly used in mission-critical systems and applications and therefore considering Quality of Service (QoS) properties is an essential part of the service selection. Quality prediction techniques support the service provider in determining possible QoS levels that can be guaranteed to a customer or in deriving the operation costs induced by a certain QoS level. In this chapter, we present an overview on our work on modeling service-oriented systems for performance prediction using the Palladio Component Model. The prediction builds upon a model of a service-based system, and evaluates this model in order to determine the expected service quality. The presented techniques allow for early quality prediction, without the need for the system being already deployed and operating. We present the integration of our prediction approach into an SLA management framework. The emerging trend to combine event-based communication and Service-Oriented Architecture (SOA) into Event-based SOA (ESOA) induces new challenges to our approach, which are topic of a special subsection.},\n address = {Hershey, PA, USA},\n author = {Christoph Rathfelder and Benjamin Klatt and Franz Brosch and Samuel Kounev},\n booktitle = {{Handbook of Research on Service-Oriented Systems and Non-Functional Properties: Future Directions}},\n doi = {10.4018/978-1-61350-432-1},\n editor = {Stephan Reiff-Marganiec and Marcel Tilly},\n isbn = {9781613504321},\n month = {December},\n pages = {258--279},\n publisher = {IGI Global},\n title = {{P}erformance {M}odeling for {Q}uality of {S}ervice {P}rediction in {S}ervice-{O}riented {S}ystems},\n url = {http://www.igi-global.com/chapter/handbook-research-service-oriented-systems/60889},\n year = {2011},\n}\n\n','\n\nChristoph Rathfelder, Benjamin Klatt, Franz Brosch, and Samuel Kounev.\nPerformance Modeling for Quality of Service Prediction\nin Service-Oriented Systems.\nIGI Global, Hershey, PA, USA, December 2011.\n[ bib | DOI | http | Abstract  ] 
\n@book{rathfelder2010c,\nabstract = {With the introduction of services, systems become more flexible as new services can easily be composed out of existing services. Services are increasingly used in mission-critical systems and applications and therefore considering Quality of Service (QoS) properties is an essential part of the service selection. Quality prediction techniques support the service provider in determining possible QoS levels that can be guaranteed to a customer or in deriving the operation costs induced by a certain QoS level. In this chapter, we present an overview on our work on modeling service-oriented systems for performance prediction using the Palladio Component Model. The prediction builds upon a model of a service-based system, and evaluates this model in order to determine the expected service quality. The presented techniques allow for early quality prediction, without the need for the system being already deployed and operating. We present the integration of our prediction approach into an SLA management framework. The emerging trend to combine event-based communication and Service-Oriented Architecture (SOA) into Event-based SOA (ESOA) induces new challenges to our approach, which are topic of a special subsection.},\naddress = {Hershey, PA, USA},\nauthor = {Christoph Rathfelder and Benjamin Klatt and Franz Brosch and Samuel Kounev},\nbooktitle = {{Handbook of Research on Service-Oriented Systems and Non-Functional Properties: Future Directions}},\ndoi = {10.4018/978-1-61350-432-1},\neditor = {Stephan Reiff-Marganiec and Marcel Tilly},\nisbn = {9781613504321},\nmonth = {December},\npages = {258--279},\npublisher = {IGI Global},\ntitle = {{P}erformance {M}odeling for {Q}uality of {S}ervice {P}rediction in {S}ervice-{O}riented {S}ystems},\nurl = {http://www.igi-global.com/chapter/handbook-research-service-oriented-systems/60889},\nyear = {2011}\n}\n
\n
\nWith the introduction of services, systems become more flexible as new services can easily be composed out of existing services. Services are increasingly used in mission-critical systems and applications and therefore considering Quality of Service (QoS) properties is an essential part of the service selection. Quality prediction techniques support the service provider in determining possible QoS levels that can be guaranteed to a customer or in deriving the operation costs induced by a certain QoS level. In this chapter, we present an overview on our work on modeling service-oriented systems for performance prediction using the Palladio Component Model. The prediction builds upon a model of a service-based system, and evaluates this model in order to determine the expected service quality. The presented techniques allow for early quality prediction, without the need for the system being already deployed and operating. We present the integration of our prediction approach into an SLA management framework. The emerging trend to combine event-based communication and Service-Oriented Architecture (SOA) into Event-based SOA (ESOA) induces new challenges to our approach, which are topic of a special subsection.\n
\n','
\n@book{rathfelder2010c,\n  abstract = {With the introduction of services, systems become more flexible as new services can easily be composed out of existing services. Services are increasingly used in mission-critical systems and applications and therefore considering Quality of Service (QoS) properties is an essential part of the service selection. Quality prediction techniques support the service provider in determining possible QoS levels that can be guaranteed to a customer or in deriving the operation costs induced by a certain QoS level. In this chapter, we present an overview on our work on modeling service-oriented systems for performance prediction using the Palladio Component Model. The prediction builds upon a model of a service-based system, and evaluates this model in order to determine the expected service quality. The presented techniques allow for early quality prediction, without the need for the system being already deployed and operating. We present the integration of our prediction approach into an SLA management framework. The emerging trend to combine event-based communication and Service-Oriented Architecture (SOA) into Event-based SOA (ESOA) induces new challenges to our approach, which are topic of a special subsection.},\n  address = {Hershey, PA, USA},\n  author = {Christoph Rathfelder and Benjamin Klatt and Franz Brosch and Samuel Kounev},\n  booktitle = {{Handbook of Research on Service-Oriented Systems and Non-Functional Properties: Future Directions}},\n  doi = {10.4018/978-1-61350-432-1},\n  editor = {Stephan Reiff-Marganiec and Marcel Tilly},\n  isbn = {9781613504321},\n  month = {December},\n  pages = {258--279},\n  publisher = {IGI Global},\n  title = {{P}erformance {M}odeling for {Q}uality of {S}ervice {P}rediction in {S}ervice-{O}riented {S}ystems},\n  url = {http://www.igi-global.com/chapter/handbook-research-service-oriented-systems/60889},\n  year = {2011}\n}\n
\n\n','With the introduction of services, systems become more flexible as new services can easily be composed out of existing services. Services are increasingly used in mission-critical systems and applications and therefore considering Quality of Service (QoS) properties is an essential part of the service selection. Quality prediction techniques support the service provider in determining possible QoS levels that can be guaranteed to a customer or in deriving the operation costs induced by a certain QoS level. In this chapter, we present an overview on our work on modeling service-oriented systems for performance prediction using the Palladio Component Model. The prediction builds upon a model of a service-based system, and evaluates this model in order to determine the expected service quality. The presented techniques allow for early quality prediction, without the need for the system being already deployed and operating. We present the integration of our prediction approach into an SLA management framework. The emerging trend to combine event-based communication and Service-Oriented Architecture (SOA) into Event-based SOA (ESOA) induces new challenges to our approach, which are topic of a special subsection.','{P}erformance {M}odeling for {Q}uality of {S}ervice {P}rediction in {S}ervice-{O}riented {S}ystems',0,12,2011,12,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(499,'paper','rathfelder2011b','incollection','@incollection{rathfelder2011b,\n address = {New York},\n author = {Rathfelder, Christoph and Klatt, Benjamin and Falcone, Giovanni},\n booktitle = {{Service Level Agreements for Cloud Computing}},\n editor = {Wieder, Philipp and Butler, Joe M. and Theilmann, Wolfgang and Yahyapour, Ramin},\n isbn = {978-1-4614-1614-2},\n pages = {27--40},\n publisher = {Springer},\n title = {The Open Reference Case A Reference Use Case for the SLA@SOI Framework},\n url = {http://dx.doi.org/10.1007/978-1-4614-1614-2_3},\n year = {2011},\n}\n\n','\n\nChristoph Rathfelder, Benjamin Klatt, and Giovanni Falcone.\nThe open reference case a reference use case for the sla@soi\nframework.\nIn Service Level Agreements for Cloud Computing, Philipp\nWieder, Joe M. Butler, Wolfgang Theilmann, and Ramin Yahyapour, editors,\npages 27-40. Springer, New York, 2011.\n[ bib | http  ] 
\n@incollection{rathfelder2011b,\naddress = {New York},\nauthor = {Rathfelder, Christoph and Klatt, Benjamin and Falcone, Giovanni},\nbooktitle = {{Service Level Agreements for Cloud Computing}},\neditor = {Wieder, Philipp and Butler, Joe M. and Theilmann, Wolfgang and Yahyapour, Ramin},\nisbn = {978-1-4614-1614-2},\npages = {27--40},\npublisher = {Springer},\ntitle = {The Open Reference Case A Reference Use Case for the SLA@SOI Framework},\nurl = {http://dx.doi.org/10.1007/978-1-4614-1614-2_3},\nyear = {2011}\n}\n
\n
\n','
\n@incollection{rathfelder2011b,\n  address = {New York},\n  author = {Rathfelder, Christoph and Klatt, Benjamin and Falcone, Giovanni},\n  booktitle = {{Service Level Agreements for Cloud Computing}},\n  editor = {Wieder, Philipp and Butler, Joe M. and Theilmann, Wolfgang and Yahyapour, Ramin},\n  isbn = {978-1-4614-1614-2},\n  pages = {27--40},\n  publisher = {Springer},\n  title = {The Open Reference Case A Reference Use Case for the SLA@SOI Framework},\n  url = {http://dx.doi.org/10.1007/978-1-4614-1614-2_3},\n  year = {2011}\n}\n
\n\n',NULL,'The Open Reference Case A Reference Use Case for the SLA@SOI Framework',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(500,'paper','rathfelder2010b','inproceedings','@inproceedings{rathfelder2010b,\n abstract = {The event-based communication paradigm is becoming increasingly ubiquitous as an enabling technology for building loosely-coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to predict their performance under load. Most general purpose performance meta-models for component-based systems provide limited support for modelling event-based communication and neglect middleware-specific influence factors. In this poster, we present an extension of our approach to modelling event-based communication in the context of the Palladio Component Model (PCM), allowing to take into account middleware-specific influence factors. The latter are captured in a separate model automatically woven into the PCM instance by means of a model-to-model transformation. As a second contribution, we present a short case study of a real-life road traffic monitoring system showing how event-based communication can be modelled for performance prediction and capacity planning.},\n address = {New York, NY, USA},\n author = {Rathfelder, Christoph and Klatt, Benjamin and Kounev, Samuel and Evans, David},\n booktitle = {Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems (DEBS 2010)},\n day = {12--15},\n doi = {http://doi.acm.org/10.1145/1827418.1827437},\n isbn = {978-1-60558-927-5},\n location = {Cambridge, United Kingdom},\n month = {July},\n pages = {97--98},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/500.pdf},\n publisher = {ACM},\n title = {{Towards Middleware-Aware Integration of Event-based Communication into the Palladio Component Model}},\n titleaddon = {{(Poster Paper)}},\n url = {http://doi.acm.org/10.1145/1827418.1827437},\n year = {2010},\n}\n\n','\n\nChristoph Rathfelder, Benjamin Klatt, Samuel Kounev, and David Evans.\nTowards Middleware-Aware Integration of Event-based Communication\ninto the Palladio Component Model (Poster Paper).\nIn Proceedings of the Fourth ACM International Conference on\nDistributed Event-Based Systems (DEBS 2010), Cambridge, United Kingdom, July\n12-15, 2010, pages 97-98. ACM, New York, NY, USA.\nJuly 2010.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{rathfelder2010b,\nabstract = {The event-based communication paradigm is becoming increasingly ubiquitous as an enabling technology for building loosely-coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to predict their performance under load. Most general purpose performance meta-models for component-based systems provide limited support for modelling event-based communication and neglect middleware-specific influence factors. In this poster, we present an extension of our approach to modelling event-based communication in the context of the Palladio Component Model (PCM), allowing to take into account middleware-specific influence factors. The latter are captured in a separate model automatically woven into the PCM instance by means of a model-to-model transformation. As a second contribution, we present a short case study of a real-life road traffic monitoring system showing how event-based communication can be modelled for performance prediction and capacity planning.},\naddress = {New York, NY, USA},\nauthor = {Rathfelder, Christoph and Klatt, Benjamin and Kounev, Samuel and Evans, David},\nbooktitle = {Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems (DEBS 2010)},\nday = {12--15},\ndoi = {http://doi.acm.org/10.1145/1827418.1827437},\nisbn = {978-1-60558-927-5},\nlocation = {Cambridge, United Kingdom},\nmonth = {July},\npages = {97--98},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/500.pdf},\npublisher = {ACM},\ntitle = {{Towards Middleware-Aware Integration of Event-based Communication into the Palladio Component Model}},\ntitleaddon = {{(Poster Paper)}},\nurl = {http://doi.acm.org/10.1145/1827418.1827437},\nyear = {2010}\n}\n
\n
\nThe event-based communication paradigm is becoming increasingly ubiquitous as an enabling technology for building loosely-coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to predict their performance under load. Most general purpose performance meta-models for component-based systems provide limited support for modelling event-based communication and neglect middleware-specific influence factors. In this poster, we present an extension of our approach to modelling event-based communication in the context of the Palladio Component Model (PCM), allowing to take into account middleware-specific influence factors. The latter are captured in a separate model automatically woven into the PCM instance by means of a model-to-model transformation. As a second contribution, we present a short case study of a real-life road traffic monitoring system showing how event-based communication can be modelled for performance prediction and capacity planning.\n
\n','
\n@inproceedings{rathfelder2010b,\n  abstract = {The event-based communication paradigm is becoming increasingly ubiquitous as an enabling technology for building loosely-coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to predict their performance under load. Most general purpose performance meta-models for component-based systems provide limited support for modelling event-based communication and neglect middleware-specific influence factors. In this poster, we present an extension of our approach to modelling event-based communication in the context of the Palladio Component Model (PCM), allowing to take into account middleware-specific influence factors. The latter are captured in a separate model automatically woven into the PCM instance by means of a model-to-model transformation. As a second contribution, we present a short case study of a real-life road traffic monitoring system showing how event-based communication can be modelled for performance prediction and capacity planning.},\n  address = {New York, NY, USA},\n  author = {Rathfelder, Christoph and Klatt, Benjamin and Kounev, Samuel and Evans, David},\n  booktitle = {Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems (DEBS 2010)},\n  day = {12--15},\n  doi = {http://doi.acm.org/10.1145/1827418.1827437},\n  isbn = {978-1-60558-927-5},\n  location = {Cambridge, United Kingdom},\n  month = {July},\n  pages = {97--98},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/500.pdf},\n  publisher = {ACM},\n  title = {{Towards Middleware-Aware Integration of Event-based Communication into the Palladio Component Model}},\n  titleaddon = {{(Poster Paper)}},\n  url = {http://doi.acm.org/10.1145/1827418.1827437},\n  year = {2010}\n}\n
\n\n','The event-based communication paradigm is becoming increasingly ubiquitous as an enabling technology for building loosely-coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to predict their performance under load. Most general purpose performance meta-models for component-based systems provide limited support for modelling event-based communication and neglect middleware-specific influence factors. In this poster, we present an extension of our approach to modelling event-based communication in the context of the Palladio Component Model (PCM), allowing to take into account middleware-specific influence factors. The latter are captured in a separate model automatically woven into the PCM instance by means of a model-to-model transformation. As a second contribution, we present a short case study of a real-life road traffic monitoring system showing how event-based communication can be modelled for performance prediction and capacity planning.','{Towards Middleware-Aware Integration of Event-based Communication into the Palladio Component Model}',0,7,2010,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(501,'paper','rathfelder2013a','article','@article{rathfelder2013a,\n author = {Christoph Rathfelder and Benjamin Klatt and Kai Sachs and Samuel Kounev},\n doi = {10.1007/s10270-013-0316-x},\n issn = {1619-1366},\n journal = {Journal of Software and Systems Modeling (SoSyM)},\n month = {March},\n pages = {1--27},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/501.pdf},\n publisher = {Springer Verlag},\n title = {Modeling Event-based Communication in Component-based Software Architectures for Performance Predictions},\n url = {http://dx.doi.org/10.1007/s10270-013-0316-x},\n year = {2013},\n}\n\n','\n\nChristoph Rathfelder, Benjamin Klatt, Kai Sachs, and Samuel Kounev.\nModeling event-based communication in component-based software\narchitectures for performance predictions.\nJournal of Software and Systems Modeling (SoSyM), pages 1-27,\nMarch 2013, Springer Verlag.\n[ bib | DOI | http | .pdf  ] 
\n@article{rathfelder2013a,\nauthor = {Christoph Rathfelder and Benjamin Klatt and Kai Sachs and Samuel Kounev},\ndoi = {10.1007/s10270-013-0316-x},\nissn = {1619-1366},\njournal = {Journal of Software and Systems Modeling (SoSyM)},\nmonth = {March},\npages = {1--27},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/501.pdf},\npublisher = {Springer Verlag},\ntitle = {Modeling Event-based Communication in Component-based Software Architectures for Performance Predictions},\nurl = {http://dx.doi.org/10.1007/s10270-013-0316-x},\nyear = {2013}\n}\n
\n
\n','
\n@article{rathfelder2013a,\n  author = {Christoph Rathfelder and Benjamin Klatt and Kai Sachs and Samuel Kounev},\n  doi = {10.1007/s10270-013-0316-x},\n  issn = {1619-1366},\n  journal = {Journal of Software and Systems Modeling (SoSyM)},\n  month = {March},\n  pages = {1--27},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/501.pdf},\n  publisher = {Springer Verlag},\n  title = {Modeling Event-based Communication in Component-based Software Architectures for Performance Predictions},\n  url = {http://dx.doi.org/10.1007/s10270-013-0316-x},\n  year = {2013}\n}\n
\n\n',NULL,'Modeling Event-based Communication in Component-based Software Architectures for Performance Predictions',0,3,2013,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(502,'paper','rathfelder2009','inproceedings','@inproceedings{rathfelder2009,\n abstract = {The event-driven communication paradigm provides a number of advantages for building loosely coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to estimate their behavior and performance under load. Most existing performance prediction techniques for systems using event-driven communication require specialized knowledge to build the necessary prediction models. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication and supports different performance prediction techniques.},\n address = {New York, NY, USA},\n author = {Rathfelder, Christoph and Kounev, Samuel},\n booktitle = {Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (DEBS 2009)},\n day = {6--9},\n doi = {http://doi.acm.org/10.1145/1619258.1619300},\n isbn = {978-1-60558-665-6},\n location = {Nashville, Tennessee},\n month = {July},\n pages = {33:1--33:2},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/502.pdf},\n publisher = {ACM},\n title = {{Model-Based Performance Prediction for Event-Driven Systems}},\n titleaddon = {{(Extended Abstract)}},\n url = {http://doi.acm.org/10.1145/1619258.1619300},\n year = {2009},\n}\n\n','\n\nChristoph Rathfelder and Samuel Kounev.\nModel-Based Performance Prediction for Event-Driven Systems\n(Extended Abstract).\nIn Proceedings of the Third ACM International Conference on\nDistributed Event-Based Systems (DEBS 2009), Nashville, Tennessee, July\n6-9, 2009, pages 33:1-33:2. ACM, New York, NY, USA.\nJuly 2009.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{rathfelder2009,\nabstract = {The event-driven communication paradigm provides a number of advantages for building loosely coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to estimate their behavior and performance under load. Most existing performance prediction techniques for systems using event-driven communication require specialized knowledge to build the necessary prediction models. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication and supports different performance prediction techniques.},\naddress = {New York, NY, USA},\nauthor = {Rathfelder, Christoph and Kounev, Samuel},\nbooktitle = {Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (DEBS 2009)},\nday = {6--9},\ndoi = {http://doi.acm.org/10.1145/1619258.1619300},\nisbn = {978-1-60558-665-6},\nlocation = {Nashville, Tennessee},\nmonth = {July},\npages = {33:1--33:2},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/502.pdf},\npublisher = {ACM},\ntitle = {{Model-Based Performance Prediction for Event-Driven Systems}},\ntitleaddon = {{(Extended Abstract)}},\nurl = {http://doi.acm.org/10.1145/1619258.1619300},\nyear = {2009}\n}\n
\n
\nThe event-driven communication paradigm provides a number of advantages for building loosely coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to estimate their behavior and performance under load. Most existing performance prediction techniques for systems using event-driven communication require specialized knowledge to build the necessary prediction models. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication and supports different performance prediction techniques.\n
\n','
\n@inproceedings{rathfelder2009,\n  abstract = {The event-driven communication paradigm provides a number of advantages for building loosely coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to estimate their behavior and performance under load. Most existing performance prediction techniques for systems using event-driven communication require specialized knowledge to build the necessary prediction models. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication and supports different performance prediction techniques.},\n  address = {New York, NY, USA},\n  author = {Rathfelder, Christoph and Kounev, Samuel},\n  booktitle = {Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (DEBS 2009)},\n  day = {6--9},\n  doi = {http://doi.acm.org/10.1145/1619258.1619300},\n  isbn = {978-1-60558-665-6},\n  location = {Nashville, Tennessee},\n  month = {July},\n  pages = {33:1--33:2},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/502.pdf},\n  publisher = {ACM},\n  title = {{Model-Based Performance Prediction for Event-Driven Systems}},\n  titleaddon = {{(Extended Abstract)}},\n  url = {http://doi.acm.org/10.1145/1619258.1619300},\n  year = {2009}\n}\n
\n\n','The event-driven communication paradigm provides a number of advantages for building loosely coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to estimate their behavior and performance under load. Most existing performance prediction techniques for systems using event-driven communication require specialized knowledge to build the necessary prediction models. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication and supports different performance prediction techniques.','{Model-Based Performance Prediction for Event-Driven Systems}',0,7,2009,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(503,'paper','rathfelder2009b','inproceedings','@inproceedings{rathfelder2009b,\n abstract = {The use of event-based communication within a Service-Oriented Architecture promises several benefits including more loosely-coupled services and better scalability. However, the loose coupling of services makes it difficult for system developers to estimate the behavior and performance of systems composed of multiple services. Most existing performance prediction techniques for systems using event-based communication require specialized knowledge to build the necessary prediction models. Furthermore, general purpose design-oriented performance models for component-based systems provide limited support for modeling event-based communication. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication. We show how this extension can be exploited to model event-driven service-oriented systems with the aim to evaluate their performance and scalability.},\n address = {New York, USA},\n author = {Christoph Rathfelder and Samuel Kounev},\n booktitle = {Proceedings of the 1st International Workshop on the Quality of Service-Oriented Software Systems (QUASOSS 2009)},\n day = {24--28},\n doi = {10.1145/1596473.159648207-ModelingDEBS-CameraReady},\n location = {Amsterdam, The Netherlands},\n month = {August},\n pages = {33--38},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/503.pdf},\n publisher = {ACM},\n title = {{M}odeling {E}vent-{D}riven {S}ervice-{O}riented {S}ystems using the {P}alladio {C}omponent {M}odel},\n year = {2009},\n}\n\n','\n\nChristoph Rathfelder and Samuel Kounev.\nModeling Event-Driven Service-Oriented Systems using the\nPalladio Component Model.\nIn Proceedings of the 1st International Workshop on the Quality\nof Service-Oriented Software Systems (QUASOSS 2009), Amsterdam, The\nNetherlands, August 24-28, 2009, pages 33-38. ACM, New York, USA.\nAugust 2009.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{rathfelder2009b,\nabstract = {The use of event-based communication within a Service-Oriented Architecture promises several benefits including more loosely-coupled services and better scalability. However, the loose coupling of services makes it difficult for system developers to estimate the behavior and performance of systems composed of multiple services. Most existing performance prediction techniques for systems using event-based communication require specialized knowledge to build the necessary prediction models. Furthermore, general purpose design-oriented performance models for component-based systems provide limited support for modeling event-based communication. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication. We show how this extension can be exploited to model event-driven service-oriented systems with the aim to evaluate their performance and scalability.},\naddress = {New York, USA},\nauthor = {Christoph Rathfelder and Samuel Kounev},\nbooktitle = {Proceedings of the 1st International Workshop on the Quality of Service-Oriented Software Systems (QUASOSS 2009)},\nday = {24--28},\ndoi = {10.1145/1596473.159648207-ModelingDEBS-CameraReady},\nlocation = {Amsterdam, The Netherlands},\nmonth = {August},\npages = {33--38},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/503.pdf},\npublisher = {ACM},\ntitle = {{M}odeling {E}vent-{D}riven {S}ervice-{O}riented {S}ystems using the {P}alladio {C}omponent {M}odel},\nyear = {2009}\n}\n
\n
\nThe use of event-based communication within a Service-Oriented Architecture promises several benefits including more loosely-coupled services and better scalability. However, the loose coupling of services makes it difficult for system developers to estimate the behavior and performance of systems composed of multiple services. Most existing performance prediction techniques for systems using event-based communication require specialized knowledge to build the necessary prediction models. Furthermore, general purpose design-oriented performance models for component-based systems provide limited support for modeling event-based communication. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication. We show how this extension can be exploited to model event-driven service-oriented systems with the aim to evaluate their performance and scalability.\n
\n','
\n@inproceedings{rathfelder2009b,\n  abstract = {The use of event-based communication within a Service-Oriented Architecture promises several benefits including more loosely-coupled services and better scalability. However, the loose coupling of services makes it difficult for system developers to estimate the behavior and performance of systems composed of multiple services. Most existing performance prediction techniques for systems using event-based communication require specialized knowledge to build the necessary prediction models. Furthermore, general purpose design-oriented performance models for component-based systems provide limited support for modeling event-based communication. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication. We show how this extension can be exploited to model event-driven service-oriented systems with the aim to evaluate their performance and scalability.},\n  address = {New York, USA},\n  author = {Christoph Rathfelder and Samuel Kounev},\n  booktitle = {Proceedings of the 1st International Workshop on the Quality of Service-Oriented Software Systems (QUASOSS 2009)},\n  day = {24--28},\n  doi = {10.1145/1596473.159648207-ModelingDEBS-CameraReady},\n  location = {Amsterdam, The Netherlands},\n  month = {August},\n  pages = {33--38},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/503.pdf},\n  publisher = {ACM},\n  title = {{M}odeling {E}vent-{D}riven {S}ervice-{O}riented {S}ystems using the {P}alladio {C}omponent {M}odel},\n  year = {2009}\n}\n
\n\n','The use of event-based communication within a Service-Oriented Architecture promises several benefits including more loosely-coupled services and better scalability. However, the loose coupling of services makes it difficult for system developers to estimate the behavior and performance of systems composed of multiple services. Most existing performance prediction techniques for systems using event-based communication require specialized knowledge to build the necessary prediction models. Furthermore, general purpose design-oriented performance models for component-based systems provide limited support for modeling event-based communication. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication. We show how this extension can be exploited to model event-driven service-oriented systems with the aim to evaluate their performance and scalability.','{M}odeling {E}vent-{D}riven {S}ervice-{O}riented {S}ystems using the {P}alladio {C}omponent {M}odel',0,8,2009,8,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(504,'paper','RaKoEv2011-ASE-CapacityPlanning','inproceedings','@inproceedings{RaKoEv2011-ASE-CapacityPlanning,\n abstract = {Event-based communication is used in different domains including telecommunications, transportation, and business information systems to build scalable distributed systems. The loose coupling of components in such systems makes it easy to vary the deployment. At the same time, the complexity to estimate the behavior and performance of the whole system is increased, which complicates capacity planning. In this paper, we present an automated performance prediction method supporting capacity planning for event-based systems. The performance prediction is based on an extended version of the Palladio Component Model -- a performance meta-model for component-based systems. We apply this method on a real-world case study of a traffic monitoring system. In addition to the application of our performance prediction techniques for capacity planning, we evaluate the prediction results against measurements in the context of the case study. The results demonstrate the practicality and effectiveness of the proposed approach.},\n author = {Christoph Rathfelder and Samuel Kounev and David Evans},\n booktitle = {26th IEEE/ACM International Conference On Automated Software Engineering (ASE 2011)},\n day = {6--12},\n location = {Oread, Lawrence, Kansas},\n month = {November},\n note = {Acceptance Rate (Full Paper): 14.7\\% (37/252)},\n pages = {352--361},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/504.pdf},\n publisher = {IEEE},\n title = {{C}apacity {P}lanning for {E}vent-based {S}ystems using {A}utomated {P}erformance {P}redictions},\n year = {2011},\n}\n\n','\n\nChristoph Rathfelder, Samuel Kounev, and David Evans.\nCapacity Planning for Event-based Systems using Automated\nPerformance Predictions.\nIn 26th IEEE/ACM International Conference On Automated Software\nEngineering (ASE 2011), Oread, Lawrence, Kansas, November 6-12, 2011, pages\n352-361. IEEE.\nNovember 2011, Acceptance Rate (Full Paper): 14.7% (37/252).\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{RaKoEv2011-ASE-CapacityPlanning,\nabstract = {Event-based communication is used in different domains including telecommunications, transportation, and business information systems to build scalable distributed systems. The loose coupling of components in such systems makes it easy to vary the deployment. At the same time, the complexity to estimate the behavior and performance of the whole system is increased, which complicates capacity planning. In this paper, we present an automated performance prediction method supporting capacity planning for event-based systems. The performance prediction is based on an extended version of the Palladio Component Model -- a performance meta-model for component-based systems. We apply this method on a real-world case study of a traffic monitoring system. In addition to the application of our performance prediction techniques for capacity planning, we evaluate the prediction results against measurements in the context of the case study. The results demonstrate the practicality and effectiveness of the proposed approach.},\nauthor = {Christoph Rathfelder and Samuel Kounev and David Evans},\nbooktitle = {26th IEEE/ACM International Conference On Automated Software Engineering (ASE 2011)},\nday = {6--12},\nlocation = {Oread, Lawrence, Kansas},\nmonth = {November},\nnote = {Acceptance Rate (Full Paper): 14.7\\% (37/252)},\npages = {352--361},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/504.pdf},\npublisher = {IEEE},\ntitle = {{C}apacity {P}lanning for {E}vent-based {S}ystems using {A}utomated {P}erformance {P}redictions},\nyear = {2011}\n}\n
\n
\nEvent-based communication is used in different domains including telecommunications, transportation, and business information systems to build scalable distributed systems. The loose coupling of components in such systems makes it easy to vary the deployment. At the same time, the complexity to estimate the behavior and performance of the whole system is increased, which complicates capacity planning. In this paper, we present an automated performance prediction method supporting capacity planning for event-based systems. The performance prediction is based on an extended version of the Palladio Component Model - a performance meta-model for component-based systems. We apply this method on a real-world case study of a traffic monitoring system. In addition to the application of our performance prediction techniques for capacity planning, we evaluate the prediction results against measurements in the context of the case study. The results demonstrate the practicality and effectiveness of the proposed approach.\n
\n','
\n@inproceedings{RaKoEv2011-ASE-CapacityPlanning,\n  abstract = {Event-based communication is used in different domains including telecommunications, transportation, and business information systems to build scalable distributed systems. The loose coupling of components in such systems makes it easy to vary the deployment. At the same time, the complexity to estimate the behavior and performance of the whole system is increased, which complicates capacity planning. In this paper, we present an automated performance prediction method supporting capacity planning for event-based systems. The performance prediction is based on an extended version of the Palladio Component Model -- a performance meta-model for component-based systems. We apply this method on a real-world case study of a traffic monitoring system. In addition to the application of our performance prediction techniques for capacity planning, we evaluate the prediction results against measurements in the context of the case study. The results demonstrate the practicality and effectiveness of the proposed approach.},\n  author = {Christoph Rathfelder and Samuel Kounev and David Evans},\n  booktitle = {26th IEEE/ACM International Conference On Automated Software Engineering (ASE 2011)},\n  day = {6--12},\n  location = {Oread, Lawrence, Kansas},\n  month = {November},\n  note = {Acceptance Rate (Full Paper): 14.7\\% (37/252)},\n  pages = {352--361},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/504.pdf},\n  publisher = {IEEE},\n  title = {{C}apacity {P}lanning for {E}vent-based {S}ystems using {A}utomated {P}erformance {P}redictions},\n  year = {2011}\n}\n
\n\n','Event-based communication is used in different domains including telecommunications, transportation, and business information systems to build scalable distributed systems. The loose coupling of components in such systems makes it easy to vary the deployment. At the same time, the complexity to estimate the behavior and performance of the whole system is increased, which complicates capacity planning. In this paper, we present an automated performance prediction method supporting capacity planning for event-based systems. The performance prediction is based on an extended version of the Palladio Component Model -- a performance meta-model for component-based systems. We apply this method on a real-world case study of a traffic monitoring system. In addition to the application of our performance prediction techniques for capacity planning, we evaluate the prediction results against measurements in the context of the case study. The results demonstrate the practicality and effectiveness of the proposed approach.','{C}apacity {P}lanning for {E}vent-based {S}ystems using {A}utomated {P}erformance {P}redictions',0,11,2011,11,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(508,'paper','ReNoHaRe2013-ICMT-VisualAnalystics','inproceedings','@inproceedings{ReNoHaRe2013-ICMT-VisualAnalystics,\n author = {Andreas Rentschler and Qais Noorshams and Lucia Happe and Ralf Reussner},\n title = {{Interactive Visual Analytics for Efficient Maintenance of Model Transformations}},\n booktitle = {Proceedings of the 6th International Conference on Model Transformation (ICMT \'13), Budapest, Hungary},\n _booktitle = {Theory and Practice of Model Transformations - 6th International Conference, ICMT 2013, Budapest, Hungary, June 18-19, 2013. Proceedings},\n editor = {Keith Duddy and Gerti Kappel},\n month = {June},\n note = {Acceptance Rate: 20.7\\%},\n publisher = {Springer-Verlag Berlin Heidelberg},\n _address = {Berlin--Heidelberg--New York},\n series = {Lecture Notes in Computer Science},\n year = {2013},\n volume = {7909},\n pages = {141--157},\n url = {http://dx.doi.org/10.1007/978-3-642-38883-5_14},\n doi = {10.1007/978-3-642-38883-5_14},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/508.pdf},\n}\n\n','\n\nAndreas Rentschler, Qais Noorshams, Lucia Happe, and Ralf Reussner.\nInteractive Visual Analytics for Efficient Maintenance of Model\nTransformations.\nIn Proceedings of the 6th International Conference on Model\nTransformation (ICMT \'13), Budapest, Hungary, Keith Duddy and Gerti Kappel,\neditors, June 2013, volume 7909 of Lecture Notes in Computer Science,\npages 141-157. Springer-Verlag Berlin Heidelberg.\nJune 2013, Acceptance Rate: 20.7%.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{ReNoHaRe2013-ICMT-VisualAnalystics,\nauthor = {Andreas Rentschler and Qais Noorshams and Lucia Happe and Ralf Reussner},\ntitle = {{Interactive Visual Analytics for Efficient Maintenance of Model Transformations}},\nbooktitle = {Proceedings of the 6th International Conference on Model Transformation (ICMT \'13), Budapest, Hungary},\n_booktitle = {Theory and Practice of Model Transformations - 6th International Conference, ICMT 2013, Budapest, Hungary, June 18-19, 2013. Proceedings},\neditor = {Keith Duddy and Gerti Kappel},\nmonth = {June},\nnote = {Acceptance Rate: 20.7\\%},\npublisher = {Springer-Verlag Berlin Heidelberg},\n_address = {Berlin--Heidelberg--New York},\nseries = {Lecture Notes in Computer Science},\nyear = {2013},\nvolume = {7909},\npages = {141--157},\nurl = {http://dx.doi.org/10.1007/978-3-642-38883-5_14},\ndoi = {10.1007/978-3-642-38883-5_14},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/508.pdf}\n}\n
\n
\n','
\n@inproceedings{ReNoHaRe2013-ICMT-VisualAnalystics,\n  author = {Andreas Rentschler and Qais Noorshams and Lucia Happe and Ralf Reussner},\n  title = {{Interactive Visual Analytics for Efficient Maintenance of Model Transformations}},\n  booktitle = {Proceedings of the 6th International Conference on Model Transformation (ICMT \'13), Budapest, Hungary},\n  _booktitle = {Theory and Practice of Model Transformations - 6th International Conference, ICMT 2013, Budapest, Hungary, June 18-19, 2013. Proceedings},\n  editor = {Keith Duddy and Gerti Kappel},\n  month = {June},\n  note = {Acceptance Rate: 20.7\\%},\n  publisher = {Springer-Verlag Berlin Heidelberg},\n  _address = {Berlin--Heidelberg--New York},\n  series = {Lecture Notes in Computer Science},\n  year = {2013},\n  volume = {7909},\n  pages = {141--157},\n  url = {http://dx.doi.org/10.1007/978-3-642-38883-5_14},\n  doi = {10.1007/978-3-642-38883-5_14},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/508.pdf}\n}\n
\n\n',NULL,'{Interactive Visual Analytics for Efficient Maintenance of Model Transformations}',0,6,2013,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(510,'paper','ReWeNoHaRe2014-AOSD-Modularity','inproceedings','@inproceedings{ReWeNoHaRe2014-AOSD-Modularity,\n author = {Andreas Rentschler and Dominik Werle and Qais Noorshams and Lucia Happe and Ralf Reussner},\n title = {{Designing Information Hiding Modularity for Model Transformation Languages}},\n booktitle = {Proceedings of the 13th International Conference on Modularity (AOSD \'14), Lugano, Switzerland, April 22 - 26, 2014},\n month = {April},\n publisher = {ACM},\n address = {New York, NY, USA},\n year = {2014},\n note = {Acceptance Rate: 35.0\\%},\n isbn = {978-1-450-32772-5},\n acmid = {2577094},\n pages = {217--228},\n numpages = {12},\n url = {http://doi.acm.org/10.1145/2577080.2577094},\n doi = {10.1145/2577080.2577094},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/510.pdf},\n}\n\n','\n\nAndreas Rentschler, Dominik Werle, Qais Noorshams, Lucia Happe, and Ralf\nReussner.\nDesigning Information Hiding Modularity for Model Transformation\nLanguages.\nIn Proceedings of the 13th International Conference on\nModularity (AOSD \'14), Lugano, Switzerland, April 22 - 26, 2014, April 2014,\npages 217-228. ACM, New York, NY, USA.\nApril 2014, Acceptance Rate: 35.0%.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{ReWeNoHaRe2014-AOSD-Modularity,\nauthor = {Andreas Rentschler and Dominik Werle and Qais Noorshams and Lucia Happe and Ralf Reussner},\ntitle = {{Designing Information Hiding Modularity for Model Transformation Languages}},\nbooktitle = {Proceedings of the 13th International Conference on Modularity (AOSD \'14), Lugano, Switzerland, April 22 - 26, 2014},\nmonth = {April},\npublisher = {ACM},\naddress = {New York, NY, USA},\nyear = {2014},\nnote = {Acceptance Rate: 35.0\\%},\nisbn = {978-1-450-32772-5},\nacmid = {2577094},\npages = {217--228},\nnumpages = {12},\nurl = {http://doi.acm.org/10.1145/2577080.2577094},\ndoi = {10.1145/2577080.2577094},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/510.pdf}\n}\n
\n
\n','
\n@inproceedings{ReWeNoHaRe2014-AOSD-Modularity,\n  author = {Andreas Rentschler and Dominik Werle and Qais Noorshams and Lucia Happe and Ralf Reussner},\n  title = {{Designing Information Hiding Modularity for Model Transformation Languages}},\n  booktitle = {Proceedings of the 13th International Conference on Modularity (AOSD \'14), Lugano, Switzerland, April 22 - 26, 2014},\n  month = {April},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  year = {2014},\n  note = {Acceptance Rate: 35.0\\%},\n  isbn = {978-1-450-32772-5},\n  acmid = {2577094},\n  pages = {217--228},\n  numpages = {12},\n  url = {http://doi.acm.org/10.1145/2577080.2577094},\n  doi = {10.1145/2577080.2577094},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/510.pdf}\n}\n
\n\n',NULL,'{Designing Information Hiding Modularity for Model Transformation Languages}',0,4,2014,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(559,'paper','RyKo2013','article','@article{RyKo2013,\n author = {Piotr Rygielski and Samuel Kounev},\n doi = {http://dx.doi.org/10.1515/pik-2012-0136},\n journal = {PIK --- Praxis der Informationsverarbeitung und Kommunikation},\n month = {February},\n number = {1},\n pages = {55--64},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/559.pdf},\n publisher = {de Gruyter},\n title = {{Network Virtualization for QoS-Aware Resource Management in Cloud Data Centers: A Survey}},\n url = {http://www.degruyter.com/view/j/piko-2013-36-issue-1/pik-2012-0136/pik-2012-0136.xml?format=INT},\n volume = {36},\n year = {2013},\n abstract = {The increasing popularity of Cloud Computing is leading to the emergence of large virtualized data centers hosting increasingly complex and dynamic IT systems and services. Over the past decade, the efficient sharing of computational resources through virtualization has been subject to intensive research, while network management in cloud data centers has received less attention. A variety of network-intensive applications require QoS (Quality-of-Service) provisioning, performance isolation and support for flexible and efficient migration of virtual machines. In this paper, we survey existing network virtualization approaches and evaluate the extent to which they can be used as a basis for realizing the mentioned requirements in a cloud data center. More specifically, we identify generic network virtualization techniques, characterize them according to their features related to QoS management and performance isolation, and show how they can be composed together and used as building blocks for complex network virtualization solutions. We then present an overview of selected representative cloud platforms and show how they leverage the generic techniques as a basis for network resource management. Finally, we outline open issues and research challenges in the area of performance modeling and proactive resource management of virtualized data center infrastructures.},\n}\n\n','\n\nPiotr Rygielski and Samuel Kounev.\nNetwork Virtualization for QoS-Aware Resource Management in Cloud\nData Centers: A Survey.\nPIK - Praxis der Informationsverarbeitung und Kommunikation,\n36(1):55-64, February 2013, de Gruyter.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@article{RyKo2013,\nauthor = {Piotr Rygielski and Samuel Kounev},\ndoi = {http://dx.doi.org/10.1515/pik-2012-0136},\njournal = {PIK --- Praxis der Informationsverarbeitung und Kommunikation},\nmonth = {February},\nnumber = {1},\npages = {55--64},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/559.pdf},\npublisher = {de Gruyter},\ntitle = {{Network Virtualization for QoS-Aware Resource Management in Cloud Data Centers: A Survey}},\nurl = {http://www.degruyter.com/view/j/piko-2013-36-issue-1/pik-2012-0136/pik-2012-0136.xml?format=INT},\nvolume = {36},\nyear = {2013},\nabstract = {The increasing popularity of Cloud Computing is leading to the emergence of large virtualized data centers hosting increasingly complex and dynamic IT systems and services. Over the past decade, the efficient sharing of computational resources through virtualization has been subject to intensive research, while network management in cloud data centers has received less attention. A variety of network-intensive applications require QoS (Quality-of-Service) provisioning, performance isolation and support for flexible and efficient migration of virtual machines. In this paper, we survey existing network virtualization approaches and evaluate the extent to which they can be used as a basis for realizing the mentioned requirements in a cloud data center. More specifically, we identify generic network virtualization techniques, characterize them according to their features related to QoS management and performance isolation, and show how they can be composed together and used as building blocks for complex network virtualization solutions. We then present an overview of selected representative cloud platforms and show how they leverage the generic techniques as a basis for network resource management. Finally, we outline open issues and research challenges in the area of performance modeling and proactive resource management of virtualized data center infrastructures.}\n}\n
\n
\nThe increasing popularity of Cloud Computing is leading to the emergence of large virtualized data centers hosting increasingly complex and dynamic IT systems and services. Over the past decade, the efficient sharing of computational resources through virtualization has been subject to intensive research, while network management in cloud data centers has received less attention. A variety of network-intensive applications require QoS (Quality-of-Service) provisioning, performance isolation and support for flexible and efficient migration of virtual machines. In this paper, we survey existing network virtualization approaches and evaluate the extent to which they can be used as a basis for realizing the mentioned requirements in a cloud data center. More specifically, we identify generic network virtualization techniques, characterize them according to their features related to QoS management and performance isolation, and show how they can be composed together and used as building blocks for complex network virtualization solutions. We then present an overview of selected representative cloud platforms and show how they leverage the generic techniques as a basis for network resource management. Finally, we outline open issues and research challenges in the area of performance modeling and proactive resource management of virtualized data center infrastructures.\n
\n','
\n@article{RyKo2013,\n  author = {Piotr Rygielski and Samuel Kounev},\n  doi = {http://dx.doi.org/10.1515/pik-2012-0136},\n  journal = {PIK --- Praxis der Informationsverarbeitung und Kommunikation},\n  month = {February},\n  number = {1},\n  pages = {55--64},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/559.pdf},\n  publisher = {de Gruyter},\n  title = {{Network Virtualization for QoS-Aware Resource Management in Cloud Data Centers: A Survey}},\n  url = {http://www.degruyter.com/view/j/piko-2013-36-issue-1/pik-2012-0136/pik-2012-0136.xml?format=INT},\n  volume = {36},\n  year = {2013},\n  abstract = {The increasing popularity of Cloud Computing is leading to the emergence of large virtualized data centers hosting increasingly complex and dynamic IT systems and services. Over the past decade, the efficient sharing of computational resources through virtualization has been subject to intensive research, while network management in cloud data centers has received less attention. A variety of network-intensive applications require QoS (Quality-of-Service) provisioning, performance isolation and support for flexible and efficient migration of virtual machines. In this paper, we survey existing network virtualization approaches and evaluate the extent to which they can be used as a basis for realizing the mentioned requirements in a cloud data center. More specifically, we identify generic network virtualization techniques, characterize them according to their features related to QoS management and performance isolation, and show how they can be composed together and used as building blocks for complex network virtualization solutions. We then present an overview of selected representative cloud platforms and show how they leverage the generic techniques as a basis for network resource management. Finally, we outline open issues and research challenges in the area of performance modeling and proactive resource management of virtualized data center infrastructures.}\n}\n
\n\n','The increasing popularity of Cloud Computing is leading to the emergence of large virtualized data centers hosting increasingly complex and dynamic IT systems and services. Over the past decade, the efficient sharing of computational resources through virtualization has been subject to intensive research, while network management in cloud data centers has received less attention. A variety of network-intensive applications require QoS (Quality-of-Service) provisioning, performance isolation and support for flexible and efficient migration of virtual machines. In this paper, we survey existing network virtualization approaches and evaluate the extent to which they can be used as a basis for realizing the mentioned requirements in a cloud data center. More specifically, we identify generic network virtualization techniques, characterize them according to their features related to QoS management and performance isolation, and show how they can be composed together and used as building blocks for complex network virtualization solutions. We then present an overview of selected representative cloud platforms and show how they leverage the generic techniques as a basis for network resource management. Finally, we outline open issues and research challenges in the area of performance modeling and proactive resource management of virtualized data center infrastructures.','{Network Virtualization for QoS-Aware Resource Management in Cloud Data Centers: A Survey}',0,2,2013,2,NULL,NULL,'Networking; QoS in Networks; Virtualization; Cloud; Survey','0000-00-00 00:00:00','2016-06-01 09:40:59',0),(560,'paper','RyZsKo2013-DNI-meta-model','inproceedings','@inproceedings{RyZsKo2013-DNI-meta-model,\n address = {New York, NY, USA},\n author = {Piotr Rygielski and Steffen Zschaler and Samuel Kounev},\n booktitle = {Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013)},\n day = {21--24},\n location = {Prague, Czech Republic},\n month = {April},\n pages = {327--330},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/560.pdf},\n publisher = {ACM},\n title = {{A Meta-Model for Performance Modeling of Dynamic Virtualized Network Infrastructures}},\n titleaddon = {{(work-in-progress paper)}},\n url = {http://icpe2013.ipd.kit.edu/},\n year = {2013},\n abstract = {In this work-in-progress paper, we present a new meta-model designed for the performance modeling of dynamic data center network infrastructures. Our approach models characteristic aspects of Cloud data centers which were not crucial in classical data centers. We present our meta-model and demonstrate its use for performance modeling and analysis through an example, including a transformation into OMNeT++ for performance simulation.},\n}\n\n','\n\nPiotr Rygielski, Steffen Zschaler, and Samuel Kounev.\nA Meta-Model for Performance Modeling of Dynamic Virtualized Network\nInfrastructures (work-in-progress paper).\nIn Proceedings of the 4th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2013), Prague, Czech Republic, April 21-24,\n2013, pages 327-330. ACM, New York, NY, USA.\nApril 2013.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{RyZsKo2013-DNI-meta-model,\naddress = {New York, NY, USA},\nauthor = {Piotr Rygielski and Steffen Zschaler and Samuel Kounev},\nbooktitle = {Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013)},\nday = {21--24},\nlocation = {Prague, Czech Republic},\nmonth = {April},\npages = {327--330},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/560.pdf},\npublisher = {ACM},\ntitle = {{A Meta-Model for Performance Modeling of Dynamic Virtualized Network Infrastructures}},\ntitleaddon = {{(work-in-progress paper)}},\nurl = {http://icpe2013.ipd.kit.edu/},\nyear = {2013},\nabstract = {In this work-in-progress paper, we present a new meta-model designed for the performance modeling of dynamic data center network infrastructures. Our approach models characteristic aspects of Cloud data centers which were not crucial in classical data centers. We present our meta-model and demonstrate its use for performance modeling and analysis through an example, including a transformation into OMNeT++ for performance simulation.}\n}\n
\n
\nIn this work-in-progress paper, we present a new meta-model designed for the performance modeling of dynamic data center network infrastructures. Our approach models characteristic aspects of Cloud data centers which were not crucial in classical data centers. We present our meta-model and demonstrate its use for performance modeling and analysis through an example, including a transformation into OMNeT++ for performance simulation.\n
\n','
\n@inproceedings{RyZsKo2013-DNI-meta-model,\n  address = {New York, NY, USA},\n  author = {Piotr Rygielski and Steffen Zschaler and Samuel Kounev},\n  booktitle = {Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013)},\n  day = {21--24},\n  location = {Prague, Czech Republic},\n  month = {April},\n  pages = {327--330},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/560.pdf},\n  publisher = {ACM},\n  title = {{A Meta-Model for Performance Modeling of Dynamic Virtualized Network Infrastructures}},\n  titleaddon = {{(work-in-progress paper)}},\n  url = {http://icpe2013.ipd.kit.edu/},\n  year = {2013},\n  abstract = {In this work-in-progress paper, we present a new meta-model designed for the performance modeling of dynamic data center network infrastructures. Our approach models characteristic aspects of Cloud data centers which were not crucial in classical data centers. We present our meta-model and demonstrate its use for performance modeling and analysis through an example, including a transformation into OMNeT++ for performance simulation.}\n}\n
\n\n','In this work-in-progress paper, we present a new meta-model designed for the performance modeling of dynamic data center network infrastructures. Our approach models characteristic aspects of Cloud data centers which were not crucial in classical data centers. We present our meta-model and demonstrate its use for performance modeling and analysis through an example, including a transformation into OMNeT++ for performance simulation.','{A Meta-Model for Performance Modeling of Dynamic Virtualized Network Infrastructures}',0,4,2013,4,NULL,NULL,'Networking; Simulation; Modeling; Performance; Prediction','0000-00-00 00:00:00','2016-06-01 09:40:59',0),(563,'paper','KaiSachs-Thesis-2010','phdthesis','@phdthesis{KaiSachs-Thesis-2010,\n title = {Performance Modeling and Benchmarking of Event-Based Systems},\n year = {2010},\n address = {Karolinenplatz 5, 64289 Darmstadt, Germany},\n school = {TU Darmstadt},\n author = {Sachs, Kai},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/563.pdf},\n}\n\n','\n\nKai Sachs.\nPerformance Modeling and Benchmarking of Event-Based Systems.\nPhD thesis, TU Darmstadt, Karolinenplatz 5, 64289 Darmstadt, Germany,\n2010.\n[ bib | .pdf  ] 
\n@phdthesis{KaiSachs-Thesis-2010,\ntitle = {Performance Modeling and Benchmarking of Event-Based Systems},\nyear = {2010},\naddress = {Karolinenplatz 5, 64289 Darmstadt, Germany},\nschool = {TU Darmstadt},\nauthor = {Sachs, Kai},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/563.pdf}\n}\n
\n
\n','
\n@phdthesis{KaiSachs-Thesis-2010,\n  title = {Performance Modeling and Benchmarking of Event-Based Systems},\n  year = {2010},\n  address = {Karolinenplatz 5, 64289 Darmstadt, Germany},\n  school = {TU Darmstadt},\n  author = {Sachs, Kai},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/563.pdf}\n}\n
\n\n',NULL,'Performance Modeling and Benchmarking of Event-Based Systems',0,0,2010,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(564,'paper','SaApKoBu2010-BenchmarX-PubSub','inproceedings','@inproceedings{SaApKoBu2010-BenchmarX-PubSub,\n author = {Kai Sachs and Stefan Appel and Samuel Kounev and Alejandro Buchmann},\n booktitle = {Proc. of 2nd International Workshop on Benchmarking of Database Management Systems and Data-Oriented Web Technologies (BenchmarX\'10).},\n editor = {Martin Necasky and Eric Pardede},\n month = {April},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/564.pdf},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science (LNCS)},\n title = {{Benchmarking Publish/Subscribe-based Messaging Systems}},\n volume = {6193},\n year = {2010},\n}\n\n','\n\nKai Sachs, Stefan Appel, Samuel Kounev, and Alejandro Buchmann.\nBenchmarking Publish/Subscribe-based Messaging Systems.\nIn Proc. of 2nd International Workshop on Benchmarking of\nDatabase Management Systems and Data-Oriented Web Technologies\n(BenchmarX\'10)., Martin Necasky and Eric Pardede, editors, April 2010,\nvolume 6193 of Lecture Notes in Computer Science (LNCS). Springer.\nApril 2010.\n[ bib | .pdf  ] 
\n@inproceedings{SaApKoBu2010-BenchmarX-PubSub,\nauthor = {Kai Sachs and Stefan Appel and Samuel Kounev and Alejandro Buchmann},\nbooktitle = {Proc. of 2nd International Workshop on Benchmarking of Database Management Systems and Data-Oriented Web Technologies (BenchmarX\'10).},\neditor = {Martin Necasky and Eric Pardede},\nmonth = {April},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/564.pdf},\npublisher = {Springer},\nseries = {Lecture Notes in Computer Science (LNCS)},\ntitle = {{Benchmarking Publish/Subscribe-based Messaging Systems}},\nvolume = {6193},\nyear = {2010}\n}\n
\n
\n','
\n@inproceedings{SaApKoBu2010-BenchmarX-PubSub,\n  author = {Kai Sachs and Stefan Appel and Samuel Kounev and Alejandro Buchmann},\n  booktitle = {Proc. of 2nd International Workshop on Benchmarking of Database Management Systems and Data-Oriented Web Technologies (BenchmarX\'10).},\n  editor = {Martin Necasky and Eric Pardede},\n  month = {April},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/564.pdf},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science (LNCS)},\n  title = {{Benchmarking Publish/Subscribe-based Messaging Systems}},\n  volume = {6193},\n  year = {2010}\n}\n
\n\n',NULL,'{Benchmarking Publish/Subscribe-based Messaging Systems}',0,4,2010,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(565,'paper','sachs2008a','misc','@misc{sachs2008a,\n author = {Samuel Kounev and Kai Sachs},\n howpublished = {iX Magazin, Heft 02/2008, Heise Zeitschriften Verlag},\n title = {{Kaffeekunde - SPECjms misst Message-oriented Middleware}},\n url = {http://www.heise.de/kiosk/archiv/ix/2008/2/121},\n year = {2008},\n}\n\n','\n\nSamuel Kounev and Kai Sachs.\nKaffeekunde - SPECjms misst Message-oriented Middleware.\niX Magazin, Heft 02/2008, Heise Zeitschriften Verlag, 2008.\n[ bib | http  ] 
\n@misc{sachs2008a,\nauthor = {Samuel Kounev and Kai Sachs},\nhowpublished = {iX Magazin, Heft 02/2008, Heise Zeitschriften Verlag},\ntitle = {{Kaffeekunde - SPECjms misst Message-oriented Middleware}},\nurl = {http://www.heise.de/kiosk/archiv/ix/2008/2/121},\nyear = {2008}\n}\n
\n
\n','
\n@misc{sachs2008a,\n  author = {Samuel Kounev and Kai Sachs},\n  howpublished = {iX Magazin, Heft 02/2008, Heise Zeitschriften Verlag},\n  title = {{Kaffeekunde - SPECjms misst Message-oriented Middleware}},\n  url = {http://www.heise.de/kiosk/archiv/ix/2008/2/121},\n  year = {2008}\n}\n
\n\n',NULL,'{Kaffeekunde - SPECjms misst Message-oriented Middleware}',0,0,2008,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(566,'paper','SaKo2006-MessageTypesInSPECjms','techreport','@techreport{SaKo2006-MessageTypesInSPECjms,\n author = {Kai Sachs and Samuel Kounev},\n institution = {SPEC OSG Java Subcommittee},\n month = {February},\n number = {DVS06-3},\n title = {{Message Types and Interfaces Between Components in SPECjms}},\n year = {2006},\n}\n\n','\n\nKai Sachs and Samuel Kounev.\nMessage Types and Interfaces Between Components in SPECjms.\nTechnical Report DVS06-3, SPEC OSG Java Subcommittee, February 2006.\n[ bib  ] 
\n@techreport{SaKo2006-MessageTypesInSPECjms,\nauthor = {Kai Sachs and Samuel Kounev},\ninstitution = {SPEC OSG Java Subcommittee},\nmonth = {February},\nnumber = {DVS06-3},\ntitle = {{Message Types and Interfaces Between Components in SPECjms}},\nyear = {2006}\n}\n
\n
\n','
\n@techreport{SaKo2006-MessageTypesInSPECjms,\n  author = {Kai Sachs and Samuel Kounev},\n  institution = {SPEC OSG Java Subcommittee},\n  month = {February},\n  number = {DVS06-3},\n  title = {{Message Types and Interfaces Between Components in SPECjms}},\n  year = {2006}\n}\n
\n\n',NULL,'{Message Types and Interfaces Between Components in SPECjms}',0,2,2006,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(567,'paper','SaKo2006-WorkloadScenarioSPECjms','techreport','@techreport{SaKo2006-WorkloadScenarioSPECjms,\n abstract = {Message-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern informationdriven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scalability of MOM. With all major vendors adopting JMS (Java Message Service) as a standard interface to MOM servers, there is at last a means for creating a standardized workload for evaluating products in this space. This paper describes a novel application in the supply chain management domain that has been specifically designed as a representative workload scenario for evaluating the performance and scalability of MOM products. This scenario is used as a basis in SPEC?s new SPECjms benchmark which will be the world?s first industry-standard benchmark for MOM.},\n author = {Kai Sachs and Samuel Kounev},\n institution = {SPEC OSG Java Subcommittee},\n month = {January},\n number = {DVS06-2},\n title = {{Workload Scenario for SPECjms - Supermarket Supply Chain}},\n year = {2006},\n}\n\n','\n\nKai Sachs and Samuel Kounev.\nWorkload Scenario for SPECjms - Supermarket Supply Chain.\nTechnical Report DVS06-2, SPEC OSG Java Subcommittee, January 2006.\n[ bib | Abstract  ] 
\n@techreport{SaKo2006-WorkloadScenarioSPECjms,\nabstract = {Message-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern informationdriven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scalability of MOM. With all major vendors adopting JMS (Java Message Service) as a standard interface to MOM servers, there is at last a means for creating a standardized workload for evaluating products in this space. This paper describes a novel application in the supply chain management domain that has been specifically designed as a representative workload scenario for evaluating the performance and scalability of MOM products. This scenario is used as a basis in SPEC?s new SPECjms benchmark which will be the world?s first industry-standard benchmark for MOM.},\nauthor = {Kai Sachs and Samuel Kounev},\ninstitution = {SPEC OSG Java Subcommittee},\nmonth = {January},\nnumber = {DVS06-2},\ntitle = {{Workload Scenario for SPECjms - Supermarket Supply Chain}},\nyear = {2006}\n}\n
\n
\nMessage-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern informationdriven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scalability of MOM. With all major vendors adopting JMS (Java Message Service) as a standard interface to MOM servers, there is at last a means for creating a standardized workload for evaluating products in this space. This paper describes a novel application in the supply chain management domain that has been specifically designed as a representative workload scenario for evaluating the performance and scalability of MOM products. This scenario is used as a basis in SPEC?s new SPECjms benchmark which will be the world?s first industry-standard benchmark for MOM.\n
\n','
\n@techreport{SaKo2006-WorkloadScenarioSPECjms,\n  abstract = {Message-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern informationdriven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scalability of MOM. With all major vendors adopting JMS (Java Message Service) as a standard interface to MOM servers, there is at last a means for creating a standardized workload for evaluating products in this space. This paper describes a novel application in the supply chain management domain that has been specifically designed as a representative workload scenario for evaluating the performance and scalability of MOM products. This scenario is used as a basis in SPEC?s new SPECjms benchmark which will be the world?s first industry-standard benchmark for MOM.},\n  author = {Kai Sachs and Samuel Kounev},\n  institution = {SPEC OSG Java Subcommittee},\n  month = {January},\n  number = {DVS06-2},\n  title = {{Workload Scenario for SPECjms - Supermarket Supply Chain}},\n  year = {2006}\n}\n
\n\n','Message-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern informationdriven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scalability of MOM. With all major vendors adopting JMS (Java Message Service) as a standard interface to MOM servers, there is at last a means for creating a standardized workload for evaluating products in this space. This paper describes a novel application in the supply chain management domain that has been specifically designed as a representative workload scenario for evaluating the performance and scalability of MOM products. This scenario is used as a basis in SPEC?s new SPECjms benchmark which will be the world?s first industry-standard benchmark for MOM.','{Workload Scenario for SPECjms - Supermarket Supply Chain}',0,1,2006,1,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(568,'paper','SaKoApBu2009-DEBS-MOM_Benchmarking','inproceedings','@inproceedings{SaKoApBu2009-DEBS-MOM_Benchmarking,\n abstract = {In this poster, we provide an overview of our past and current research in the area of Message-Oriented Middleware (MOM) performance benchmarks. Our main research motivation is a) to gain a better understanding of the performance of MOM, b) to show how to use benchmarks for the evaluation of performance aspects and c)to establish performance modeling techniques. For a better understanding, we first introduce the Java Message Service (JMS) standard. Afterwards, we provide an overview of our work on MOM benchmark development, i.e., we present the SPECjms2007 benchmark and the new jms2009-PS, a test harness designed specifically for JMS-based pub/sub. We outline a new case study with jms2009-PS and present first results of our work-in-progress.},\n author = {Sachs, Kai and Kounev, Samuel and Appel, Stefan and Buchmann, Alejandro},\n booktitle = {Proceedings of the 3rd ACM International Conference on Distributed Event-Based Systems (DEBS-2009), Nashville, TN, {USA}, July 6-9, 2009},\n month = {July},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/568.pdf},\n publisher = {ACM, New York, NY, USA},\n title = {{Benchmarking of Message-Oriented Middleware}},\n titleaddon = {{(Poster Paper)}},\n url = {http://www.debs.org/2009},\n year = {2009},\n}\n\n','\n\nKai Sachs, Samuel Kounev, Stefan Appel, and Alejandro Buchmann.\nBenchmarking of Message-Oriented Middleware (Poster Paper).\nIn Proceedings of the 3rd ACM International Conference on\nDistributed Event-Based Systems (DEBS-2009), Nashville, TN, USA, July 6-9,\n2009, July 2009. ACM, New York, NY, USA.\nJuly 2009.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{SaKoApBu2009-DEBS-MOM_Benchmarking,\nabstract = {In this poster, we provide an overview of our past and current research in the area of Message-Oriented Middleware (MOM) performance benchmarks. Our main research motivation is a) to gain a better understanding of the performance of MOM, b) to show how to use benchmarks for the evaluation of performance aspects and c)to establish performance modeling techniques. For a better understanding, we first introduce the Java Message Service (JMS) standard. Afterwards, we provide an overview of our work on MOM benchmark development, i.e., we present the SPECjms2007 benchmark and the new jms2009-PS, a test harness designed specifically for JMS-based pub/sub. We outline a new case study with jms2009-PS and present first results of our work-in-progress.},\nauthor = {Sachs, Kai and Kounev, Samuel and Appel, Stefan and Buchmann, Alejandro},\nbooktitle = {Proceedings of the 3rd ACM International Conference on Distributed Event-Based Systems (DEBS-2009), Nashville, TN, {USA}, July 6-9, 2009},\nmonth = {July},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/568.pdf},\npublisher = {ACM, New York, NY, USA},\ntitle = {{Benchmarking of Message-Oriented Middleware}},\ntitleaddon = {{(Poster Paper)}},\nurl = {http://www.debs.org/2009},\nyear = {2009}\n}\n
\n
\nIn this poster, we provide an overview of our past and current research in the area of Message-Oriented Middleware (MOM) performance benchmarks. Our main research motivation is a) to gain a better understanding of the performance of MOM, b) to show how to use benchmarks for the evaluation of performance aspects and c)to establish performance modeling techniques. For a better understanding, we first introduce the Java Message Service (JMS) standard. Afterwards, we provide an overview of our work on MOM benchmark development, i.e., we present the SPECjms2007 benchmark and the new jms2009-PS, a test harness designed specifically for JMS-based pub/sub. We outline a new case study with jms2009-PS and present first results of our work-in-progress.\n
\n','
\n@inproceedings{SaKoApBu2009-DEBS-MOM_Benchmarking,\n  abstract = {In this poster, we provide an overview of our past and current research in the area of Message-Oriented Middleware (MOM) performance benchmarks. Our main research motivation is a) to gain a better understanding of the performance of MOM, b) to show how to use benchmarks for the evaluation of performance aspects and c)to establish performance modeling techniques. For a better understanding, we first introduce the Java Message Service (JMS) standard. Afterwards, we provide an overview of our work on MOM benchmark development, i.e., we present the SPECjms2007 benchmark and the new jms2009-PS, a test harness designed specifically for JMS-based pub/sub. We outline a new case study with jms2009-PS and present first results of our work-in-progress.},\n  author = {Sachs, Kai and Kounev, Samuel and Appel, Stefan and Buchmann, Alejandro},\n  booktitle = {Proceedings of the 3rd ACM International Conference on Distributed Event-Based Systems (DEBS-2009), Nashville, TN, {USA}, July 6-9, 2009},\n  month = {July},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/568.pdf},\n  publisher = {ACM, New York, NY, USA},\n  title = {{Benchmarking of Message-Oriented Middleware}},\n  titleaddon = {{(Poster Paper)}},\n  url = {http://www.debs.org/2009},\n  year = {2009}\n}\n
\n\n','In this poster, we provide an overview of our past and current research in the area of Message-Oriented Middleware (MOM) performance benchmarks. Our main research motivation is a) to gain a better understanding of the performance of MOM, b) to show how to use benchmarks for the evaluation of performance aspects and c)to establish performance modeling techniques. For a better understanding, we first introduce the Java Message Service (JMS) standard. Afterwards, we provide an overview of our work on MOM benchmark development, i.e., we present the SPECjms2007 benchmark and the new jms2009-PS, a test harness designed specifically for JMS-based pub/sub. We outline a new case study with jms2009-PS and present first results of our work-in-progress.','{Benchmarking of Message-Oriented Middleware}',0,7,2009,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(569,'paper','SaKoApBu2009-SIGMETRICS-jms2009_PS','inproceedings','@inproceedings{SaKoApBu2009-SIGMETRICS-jms2009_PS,\n abstract = {Publish/subscribe is becoming increasingly popular as communication paradigm for loosely-coupled message exchange. It is used as a building block in major new software architectures and technology domains such as Enterprise Service Bus, Enterprise Application Integration, Service-Oriented Architecture and Event-Driven Architecture. The growing adoption of these technologies leads to a strong need for benchmarks and performance evaluation tools in this area. In this demonstration, we present jms2009-PS, a benchmark for publish/subscribe middleware based on the Java Message Service standard interface.},\n author = {Sachs, Kai and Kounev, Samuel and Appel, Stefan and Buchmann, Alejandro},\n booktitle = {SIGMETRICS/Performance 2009 International Conference, Seattle, WA, USA, June 15--19, 2009},\n month = {June},\n titleaddon = {{(Demo Paper)}},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/569.pdf},\n title = {{A Performance Test Harness For Publish/Subscribe Middleware}},\n url = {http://www.sigmetrics.org/conferences/sigmetrics/2009/program_sigmetrics-demo.shtml},\n year = {2009},\n}\n\n','\n\nKai Sachs, Samuel Kounev, Stefan Appel, and Alejandro Buchmann.\nA Performance Test Harness For Publish/Subscribe Middleware (Demo\nPaper).\nIn SIGMETRICS/Performance 2009 International Conference,\nSeattle, WA, USA, June 15-19, 2009, June 2009.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{SaKoApBu2009-SIGMETRICS-jms2009_PS,\nabstract = {Publish/subscribe is becoming increasingly popular as communication paradigm for loosely-coupled message exchange. It is used as a building block in major new software architectures and technology domains such as Enterprise Service Bus, Enterprise Application Integration, Service-Oriented Architecture and Event-Driven Architecture. The growing adoption of these technologies leads to a strong need for benchmarks and performance evaluation tools in this area. In this demonstration, we present jms2009-PS, a benchmark for publish/subscribe middleware based on the Java Message Service standard interface.},\nauthor = {Sachs, Kai and Kounev, Samuel and Appel, Stefan and Buchmann, Alejandro},\nbooktitle = {SIGMETRICS/Performance 2009 International Conference, Seattle, WA, USA, June 15--19, 2009},\nmonth = {June},\ntitleaddon = {{(Demo Paper)}},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/569.pdf},\ntitle = {{A Performance Test Harness For Publish/Subscribe Middleware}},\nurl = {http://www.sigmetrics.org/conferences/sigmetrics/2009/program_sigmetrics-demo.shtml},\nyear = {2009}\n}\n
\n
\nPublish/subscribe is becoming increasingly popular as communication paradigm for loosely-coupled message exchange. It is used as a building block in major new software architectures and technology domains such as Enterprise Service Bus, Enterprise Application Integration, Service-Oriented Architecture and Event-Driven Architecture. The growing adoption of these technologies leads to a strong need for benchmarks and performance evaluation tools in this area. In this demonstration, we present jms2009-PS, a benchmark for publish/subscribe middleware based on the Java Message Service standard interface.\n
\n','
\n@inproceedings{SaKoApBu2009-SIGMETRICS-jms2009_PS,\n  abstract = {Publish/subscribe is becoming increasingly popular as communication paradigm for loosely-coupled message exchange. It is used as a building block in major new software architectures and technology domains such as Enterprise Service Bus, Enterprise Application Integration, Service-Oriented Architecture and Event-Driven Architecture. The growing adoption of these technologies leads to a strong need for benchmarks and performance evaluation tools in this area. In this demonstration, we present jms2009-PS, a benchmark for publish/subscribe middleware based on the Java Message Service standard interface.},\n  author = {Sachs, Kai and Kounev, Samuel and Appel, Stefan and Buchmann, Alejandro},\n  booktitle = {SIGMETRICS/Performance 2009 International Conference, Seattle, WA, USA, June 15--19, 2009},\n  month = {June},\n  titleaddon = {{(Demo Paper)}},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/569.pdf},\n  title = {{A Performance Test Harness For Publish/Subscribe Middleware}},\n  url = {http://www.sigmetrics.org/conferences/sigmetrics/2009/program_sigmetrics-demo.shtml},\n  year = {2009}\n}\n
\n\n','Publish/subscribe is becoming increasingly popular as communication paradigm for loosely-coupled message exchange. It is used as a building block in major new software architectures and technology domains such as Enterprise Service Bus, Enterprise Application Integration, Service-Oriented Architecture and Event-Driven Architecture. The growing adoption of these technologies leads to a strong need for benchmarks and performance evaluation tools in this area. In this demonstration, we present jms2009-PS, a benchmark for publish/subscribe middleware based on the Java Message Service standard interface.','{A Performance Test Harness For Publish/Subscribe Middleware}',0,6,2009,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(570,'paper','SaKoBaBu2007-EPEW-WorkloadChar_SPECjms2007','inproceedings','@inproceedings{SaKoBaBu2007-EPEW-WorkloadChar_SPECjms2007,\n abstract = {Message-oriented middleware (MOM) is at the core of a vast number of financial services and telco applications, and is gaining increasing traction in other industries, such as manufacturing, transportation, health-care and supply chain management. There is a strong interest in the end user and analyst communities for a standardized benchmark suite for evaluating the performance and scalability of MOM. In this paper, we present a workload characterization of the SPECjms2007 benchmark which is the world\'s first industry-standard benchmark specialized for MOM. In addition to providing standard workload and metrics for MOM performance, the benchmark provides a flexible performance analysis framework that allows users to customize the workload according to their requirements. The workload characterization presented in this paper serves two purposes i) to help users understand the internal components of the SPECjms2007 workload and the way they are scaled, ii) to show how the workload can be customized to exercise and evaluate selected aspects of MOM performance.We discuss how the various features supported by the benchmark can be exploited for in-depth performance analysis of MOM infrastructures.},\n address = {Heidelberg, Germany},\n author = {Kai Sachs and Samuel Kounev and Jean Bacon and Alejandro Buchmann},\n booktitle = {Formal Methods and Stochastic Models for Performance Evaluation, Proceedings of the 4th European Performance Engineering Workshop (EPEW 2007), Berlin, Germany, September 27--28, 2007},\n doi = {10.1007/978-3-540-75211-0_17},\n editor = {Katinka Wolter},\n isbn = {978-3-540-75210-3},\n month = {September},\n pages = {228--244},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/570.pdf},\n publisher = {Springer Verlag},\n series = {Lecture Notes in Computer Science (LNCS)},\n title = {{Workload Characterization of the SPECjms2007 Benchmark}},\n url = {http://www.springer.com/computer/programming/book/978-3-540-75210-3},\n volume = {4748},\n year = {2007},\n}\n\n','\n\nKai Sachs, Samuel Kounev, Jean Bacon, and Alejandro Buchmann.\nWorkload Characterization of the SPECjms2007 Benchmark.\nIn Formal Methods and Stochastic Models for Performance\nEvaluation, Proceedings of the 4th European Performance Engineering Workshop\n(EPEW 2007), Berlin, Germany, September 27-28, 2007, Katinka Wolter,\neditor, September 2007, volume 4748 of Lecture Notes in Computer Science\n(LNCS), pages 228-244. Springer Verlag, Heidelberg, Germany.\nSeptember 2007.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{SaKoBaBu2007-EPEW-WorkloadChar_SPECjms2007,\nabstract = {Message-oriented middleware (MOM) is at the core of a vast number of financial services and telco applications, and is gaining increasing traction in other industries, such as manufacturing, transportation, health-care and supply chain management. There is a strong interest in the end user and analyst communities for a standardized benchmark suite for evaluating the performance and scalability of MOM. In this paper, we present a workload characterization of the SPECjms2007 benchmark which is the world\'s first industry-standard benchmark specialized for MOM. In addition to providing standard workload and metrics for MOM performance, the benchmark provides a flexible performance analysis framework that allows users to customize the workload according to their requirements. The workload characterization presented in this paper serves two purposes i) to help users understand the internal components of the SPECjms2007 workload and the way they are scaled, ii) to show how the workload can be customized to exercise and evaluate selected aspects of MOM performance.We discuss how the various features supported by the benchmark can be exploited for in-depth performance analysis of MOM infrastructures.},\naddress = {Heidelberg, Germany},\nauthor = {Kai Sachs and Samuel Kounev and Jean Bacon and Alejandro Buchmann},\nbooktitle = {Formal Methods and Stochastic Models for Performance Evaluation, Proceedings of the 4th European Performance Engineering Workshop (EPEW 2007), Berlin, Germany, September 27--28, 2007},\ndoi = {10.1007/978-3-540-75211-0_17},\neditor = {Katinka Wolter},\nisbn = {978-3-540-75210-3},\nmonth = {September},\npages = {228--244},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/570.pdf},\npublisher = {Springer Verlag},\nseries = {Lecture Notes in Computer Science (LNCS)},\ntitle = {{Workload Characterization of the SPECjms2007 Benchmark}},\nurl = {http://www.springer.com/computer/programming/book/978-3-540-75210-3},\nvolume = {4748},\nyear = {2007}\n}\n
\n
\nMessage-oriented middleware (MOM) is at the core of a vast number of financial services and telco applications, and is gaining increasing traction in other industries, such as manufacturing, transportation, health-care and supply chain management. There is a strong interest in the end user and analyst communities for a standardized benchmark suite for evaluating the performance and scalability of MOM. In this paper, we present a workload characterization of the SPECjms2007 benchmark which is the world\'s first industry-standard benchmark specialized for MOM. In addition to providing standard workload and metrics for MOM performance, the benchmark provides a flexible performance analysis framework that allows users to customize the workload according to their requirements. The workload characterization presented in this paper serves two purposes i) to help users understand the internal components of the SPECjms2007 workload and the way they are scaled, ii) to show how the workload can be customized to exercise and evaluate selected aspects of MOM performance.We discuss how the various features supported by the benchmark can be exploited for in-depth performance analysis of MOM infrastructures.\n
\n','
\n@inproceedings{SaKoBaBu2007-EPEW-WorkloadChar_SPECjms2007,\n  abstract = {Message-oriented middleware (MOM) is at the core of a vast number of financial services and telco applications, and is gaining increasing traction in other industries, such as manufacturing, transportation, health-care and supply chain management. There is a strong interest in the end user and analyst communities for a standardized benchmark suite for evaluating the performance and scalability of MOM. In this paper, we present a workload characterization of the SPECjms2007 benchmark which is the world\'s first industry-standard benchmark specialized for MOM. In addition to providing standard workload and metrics for MOM performance, the benchmark provides a flexible performance analysis framework that allows users to customize the workload according to their requirements. The workload characterization presented in this paper serves two purposes i) to help users understand the internal components of the SPECjms2007 workload and the way they are scaled, ii) to show how the workload can be customized to exercise and evaluate selected aspects of MOM performance.We discuss how the various features supported by the benchmark can be exploited for in-depth performance analysis of MOM infrastructures.},\n  address = {Heidelberg, Germany},\n  author = {Kai Sachs and Samuel Kounev and Jean Bacon and Alejandro Buchmann},\n  booktitle = {Formal Methods and Stochastic Models for Performance Evaluation, Proceedings of the 4th European Performance Engineering Workshop (EPEW 2007), Berlin, Germany, September 27--28, 2007},\n  doi = {10.1007/978-3-540-75211-0_17},\n  editor = {Katinka Wolter},\n  isbn = {978-3-540-75210-3},\n  month = {September},\n  pages = {228--244},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/570.pdf},\n  publisher = {Springer Verlag},\n  series = {Lecture Notes in Computer Science (LNCS)},\n  title = {{Workload Characterization of the SPECjms2007 Benchmark}},\n  url = {http://www.springer.com/computer/programming/book/978-3-540-75210-3},\n  volume = {4748},\n  year = {2007}\n}\n
\n\n','Message-oriented middleware (MOM) is at the core of a vast number of financial services and telco applications, and is gaining increasing traction in other industries, such as manufacturing, transportation, health-care and supply chain management. There is a strong interest in the end user and analyst communities for a standardized benchmark suite for evaluating the performance and scalability of MOM. In this paper, we present a workload characterization of the SPECjms2007 benchmark which is the world\'s first industry-standard benchmark specialized for MOM. In addition to providing standard workload and metrics for MOM performance, the benchmark provides a flexible performance analysis framework that allows users to customize the workload according to their requirements. The workload characterization presented in this paper serves two purposes i) to help users understand the internal components of the SPECjms2007 workload and the way they are scaled, ii) to show how the workload can be customized to exercise and evaluate selected aspects of MOM performance.We discuss how the various features supported by the benchmark can be exploited for in-depth performance analysis of MOM infrastructures.','{Workload Characterization of the SPECjms2007 Benchmark}',0,9,2007,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(571,'paper','SaKoBaBu2008-PERFEVAL-SPECjms2007','article','@article{SaKoBaBu2008-PERFEVAL-SPECjms2007,\n abstract = {Message-oriented middleware (MOM) is at the core of a vast number of financial services and telco applications, and is gaining increasing traction in other industries, such as manufacturing, transportation, health-care and supply chain management. Novel messaging applications, however, pose some serious performance and scalability challenges. In this paper, we present a methodology for performance evaluation of MOM platforms using the SPECjms2007 benchmark which is the world\'s first industry-standard benchmark specialized for MOM. SPECjms2007 is based on a novel application in the supply chain management domain designed to stress MOM infrastructures in a manner representative of real-world applications. In addition to providing a standard workload and metrics for MOM performance, the benchmark provides a flexible performance analysis framework that allows users to tailor the workload to their requirements. The contributions of this paper are: i) we present a detailed workload characterization of SPECjms2007 with the goal to help users understand the internal components of the workload and the way they are scaled, ii) we show how the workload can be customized to exercise and evaluate selected aspects of MOM performance, iii) we present a case study of a leading JMS platform, the BEA WebLogic server, conducting an in-depth performance analysis of the platform under a number of different workload and configuration scenarios. The methodology we propose is the first one that uses an industry-standard benchmark providing both a representative workload as well as the ability to customize it to evaluate the features of MOM platforms selectively.},\n address = {Amsterdam, The Netherlands},\n author = {Kai Sachs and Samuel Kounev and Jean Bacon and Alejandro Buchmann},\n doi = {10.1016/j.peva.2009.01.003},\n journal = {Performance Evaluation},\n month = {August},\n number = {8},\n pages = {410--434},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/571.pdf},\n publisher = {Elsevier Science Publishers B. V.},\n title = {{Performance evaluation of message-oriented middleware using the SPECjms2007 benchmark}},\n url = {http://www.elsevier.com/wps/find/journaldescription.cws_home/505618/description},\n volume = {66},\n year = {2009},\n}\n\n','\n\nKai Sachs, Samuel Kounev, Jean Bacon, and Alejandro Buchmann.\nPerformance evaluation of message-oriented middleware using the\nSPECjms2007 benchmark.\nPerformance Evaluation, 66(8):410-434, August 2009, Elsevier\nScience Publishers B. V., Amsterdam, The Netherlands.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@article{SaKoBaBu2008-PERFEVAL-SPECjms2007,\nabstract = {Message-oriented middleware (MOM) is at the core of a vast number of financial services and telco applications, and is gaining increasing traction in other industries, such as manufacturing, transportation, health-care and supply chain management. Novel messaging applications, however, pose some serious performance and scalability challenges. In this paper, we present a methodology for performance evaluation of MOM platforms using the SPECjms2007 benchmark which is the world\'s first industry-standard benchmark specialized for MOM. SPECjms2007 is based on a novel application in the supply chain management domain designed to stress MOM infrastructures in a manner representative of real-world applications. In addition to providing a standard workload and metrics for MOM performance, the benchmark provides a flexible performance analysis framework that allows users to tailor the workload to their requirements. The contributions of this paper are: i) we present a detailed workload characterization of SPECjms2007 with the goal to help users understand the internal components of the workload and the way they are scaled, ii) we show how the workload can be customized to exercise and evaluate selected aspects of MOM performance, iii) we present a case study of a leading JMS platform, the BEA WebLogic server, conducting an in-depth performance analysis of the platform under a number of different workload and configuration scenarios. The methodology we propose is the first one that uses an industry-standard benchmark providing both a representative workload as well as the ability to customize it to evaluate the features of MOM platforms selectively.},\naddress = {Amsterdam, The Netherlands},\nauthor = {Kai Sachs and Samuel Kounev and Jean Bacon and Alejandro Buchmann},\ndoi = {10.1016/j.peva.2009.01.003},\njournal = {Performance Evaluation},\nmonth = {August},\nnumber = {8},\npages = {410--434},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/571.pdf},\npublisher = {Elsevier Science Publishers B. V.},\ntitle = {{Performance evaluation of message-oriented middleware using the SPECjms2007 benchmark}},\nurl = {http://www.elsevier.com/wps/find/journaldescription.cws_home/505618/description},\nvolume = {66},\nyear = {2009}\n}\n
\n
\nMessage-oriented middleware (MOM) is at the core of a vast number of financial services and telco applications, and is gaining increasing traction in other industries, such as manufacturing, transportation, health-care and supply chain management. Novel messaging applications, however, pose some serious performance and scalability challenges. In this paper, we present a methodology for performance evaluation of MOM platforms using the SPECjms2007 benchmark which is the world\'s first industry-standard benchmark specialized for MOM. SPECjms2007 is based on a novel application in the supply chain management domain designed to stress MOM infrastructures in a manner representative of real-world applications. In addition to providing a standard workload and metrics for MOM performance, the benchmark provides a flexible performance analysis framework that allows users to tailor the workload to their requirements. The contributions of this paper are: i) we present a detailed workload characterization of SPECjms2007 with the goal to help users understand the internal components of the workload and the way they are scaled, ii) we show how the workload can be customized to exercise and evaluate selected aspects of MOM performance, iii) we present a case study of a leading JMS platform, the BEA WebLogic server, conducting an in-depth performance analysis of the platform under a number of different workload and configuration scenarios. The methodology we propose is the first one that uses an industry-standard benchmark providing both a representative workload as well as the ability to customize it to evaluate the features of MOM platforms selectively.\n
\n','
\n@article{SaKoBaBu2008-PERFEVAL-SPECjms2007,\n  abstract = {Message-oriented middleware (MOM) is at the core of a vast number of financial services and telco applications, and is gaining increasing traction in other industries, such as manufacturing, transportation, health-care and supply chain management. Novel messaging applications, however, pose some serious performance and scalability challenges. In this paper, we present a methodology for performance evaluation of MOM platforms using the SPECjms2007 benchmark which is the world\'s first industry-standard benchmark specialized for MOM. SPECjms2007 is based on a novel application in the supply chain management domain designed to stress MOM infrastructures in a manner representative of real-world applications. In addition to providing a standard workload and metrics for MOM performance, the benchmark provides a flexible performance analysis framework that allows users to tailor the workload to their requirements. The contributions of this paper are: i) we present a detailed workload characterization of SPECjms2007 with the goal to help users understand the internal components of the workload and the way they are scaled, ii) we show how the workload can be customized to exercise and evaluate selected aspects of MOM performance, iii) we present a case study of a leading JMS platform, the BEA WebLogic server, conducting an in-depth performance analysis of the platform under a number of different workload and configuration scenarios. The methodology we propose is the first one that uses an industry-standard benchmark providing both a representative workload as well as the ability to customize it to evaluate the features of MOM platforms selectively.},\n  address = {Amsterdam, The Netherlands},\n  author = {Kai Sachs and Samuel Kounev and Jean Bacon and Alejandro Buchmann},\n  doi = {10.1016/j.peva.2009.01.003},\n  journal = {Performance Evaluation},\n  month = {August},\n  number = {8},\n  pages = {410--434},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/571.pdf},\n  publisher = {Elsevier Science Publishers B. V.},\n  title = {{Performance evaluation of message-oriented middleware using the SPECjms2007 benchmark}},\n  url = {http://www.elsevier.com/wps/find/journaldescription.cws_home/505618/description},\n  volume = {66},\n  year = {2009}\n}\n
\n\n','Message-oriented middleware (MOM) is at the core of a vast number of financial services and telco applications, and is gaining increasing traction in other industries, such as manufacturing, transportation, health-care and supply chain management. Novel messaging applications, however, pose some serious performance and scalability challenges. In this paper, we present a methodology for performance evaluation of MOM platforms using the SPECjms2007 benchmark which is the world\'s first industry-standard benchmark specialized for MOM. SPECjms2007 is based on a novel application in the supply chain management domain designed to stress MOM infrastructures in a manner representative of real-world applications. In addition to providing a standard workload and metrics for MOM performance, the benchmark provides a flexible performance analysis framework that allows users to tailor the workload to their requirements. The contributions of this paper are: i) we present a detailed workload characterization of SPECjms2007 with the goal to help users understand the internal components of the workload and the way they are scaled, ii) we show how the workload can be customized to exercise and evaluate selected aspects of MOM performance, iii) we present a case study of a leading JMS platform, the BEA WebLogic server, conducting an in-depth performance analysis of the platform under a number of different workload and configuration scenarios. The methodology we propose is the first one that uses an industry-standard benchmark providing both a representative workload as well as the ability to customize it to evaluate the features of MOM platforms selectively.','{Performance evaluation of message-oriented middleware using the SPECjms2007 benchmark}',0,8,2009,8,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(572,'paper','SaKoBu2011-SoSyM-PerfModMoEdSys','article','@article{SaKoBu2011-SoSyM-PerfModMoEdSys,\n title = {Performance modeling and analysis of message-oriented event-driven systems},\n journal = {Journal of Software and Systems Modeling},\n pages = {705--729},\n publisher = {Springer-Verlag},\n year = {2013},\n volume = {12},\n number = {4},\n month = {},\n abstract = {Message-oriented event-driven systems are becoming increasingly ubiquitous in many industry domains including telecommunications, transportation and supply chain management. Applications in these areas typically have stringent requirements for performance and scalability. To guarantee adequate quality-of-service, systems must be subjected to a rigorous performance and scalability analysis before they are put into production. In this paper, we present a comprehensive modeling methodology for message-oriented event-driven systems in the context of a case study of a representative application in the supply chain management domain. The methodology, which is based on queueing Petri nets, provides a basis for performance analysis and capacity planning. We study a deployment of the SPECjms2007 standard benchmark on a leading commercial middleware platform. A detailed system model is built in a step-by-step fashion and then used to predict the system performance under various workload and configuration scenarios. After the case study, we present a set of generic performance modeling patterns that can be used as building blocks when modeling message-oriented event-driven systems. The results demonstrate the effectiveness, practicality and accuracy of the proposed modeling and prediction approach.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/572.pdf},\n issn = {1619-1366},\n doi = {10.1007/s10270-012-0228-1},\n author = {Sachs, Kai and Kounev, Samuel and Buchmann, Alejandro},\n}\n\n','\n\nKai Sachs, Samuel Kounev, and Alejandro Buchmann.\nPerformance modeling and analysis of message-oriented event-driven\nsystems.\nJournal of Software and Systems Modeling, 12(4):705-729, 2013,\nSpringer-Verlag.\n[ bib | DOI | .pdf | Abstract  ] 
\n@article{SaKoBu2011-SoSyM-PerfModMoEdSys,\ntitle = {Performance modeling and analysis of message-oriented event-driven systems},\njournal = {Journal of Software and Systems Modeling},\npages = {705--729},\npublisher = {Springer-Verlag},\nyear = {2013},\nvolume = {12},\nnumber = {4},\nmonth = {},\nabstract = {Message-oriented event-driven systems are becoming increasingly ubiquitous in many industry domains including telecommunications, transportation and supply chain management. Applications in these areas typically have stringent requirements for performance and scalability. To guarantee adequate quality-of-service, systems must be subjected to a rigorous performance and scalability analysis before they are put into production. In this paper, we present a comprehensive modeling methodology for message-oriented event-driven systems in the context of a case study of a representative application in the supply chain management domain. The methodology, which is based on queueing Petri nets, provides a basis for performance analysis and capacity planning. We study a deployment of the SPECjms2007 standard benchmark on a leading commercial middleware platform. A detailed system model is built in a step-by-step fashion and then used to predict the system performance under various workload and configuration scenarios. After the case study, we present a set of generic performance modeling patterns that can be used as building blocks when modeling message-oriented event-driven systems. The results demonstrate the effectiveness, practicality and accuracy of the proposed modeling and prediction approach.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/572.pdf},\nissn = {1619-1366},\ndoi = {10.1007/s10270-012-0228-1},\nauthor = {Sachs, Kai and Kounev, Samuel and Buchmann, Alejandro}\n}\n
\n
\nMessage-oriented event-driven systems are becoming increasingly ubiquitous in many industry domains including telecommunications, transportation and supply chain management. Applications in these areas typically have stringent requirements for performance and scalability. To guarantee adequate quality-of-service, systems must be subjected to a rigorous performance and scalability analysis before they are put into production. In this paper, we present a comprehensive modeling methodology for message-oriented event-driven systems in the context of a case study of a representative application in the supply chain management domain. The methodology, which is based on queueing Petri nets, provides a basis for performance analysis and capacity planning. We study a deployment of the SPECjms2007 standard benchmark on a leading commercial middleware platform. A detailed system model is built in a step-by-step fashion and then used to predict the system performance under various workload and configuration scenarios. After the case study, we present a set of generic performance modeling patterns that can be used as building blocks when modeling message-oriented event-driven systems. The results demonstrate the effectiveness, practicality and accuracy of the proposed modeling and prediction approach.\n
\n','
\n@article{SaKoBu2011-SoSyM-PerfModMoEdSys,\n  title = {Performance modeling and analysis of message-oriented event-driven systems},\n  journal = {Journal of Software and Systems Modeling},\n  pages = {705--729},\n  publisher = {Springer-Verlag},\n  year = {2013},\n  volume = {12},\n  number = {4},\n  month = {},\n  abstract = {Message-oriented event-driven systems are becoming increasingly ubiquitous in many industry domains including telecommunications, transportation and supply chain management. Applications in these areas typically have stringent requirements for performance and scalability. To guarantee adequate quality-of-service, systems must be subjected to a rigorous performance and scalability analysis before they are put into production. In this paper, we present a comprehensive modeling methodology for message-oriented event-driven systems in the context of a case study of a representative application in the supply chain management domain. The methodology, which is based on queueing Petri nets, provides a basis for performance analysis and capacity planning. We study a deployment of the SPECjms2007 standard benchmark on a leading commercial middleware platform. A detailed system model is built in a step-by-step fashion and then used to predict the system performance under various workload and configuration scenarios. After the case study, we present a set of generic performance modeling patterns that can be used as building blocks when modeling message-oriented event-driven systems. The results demonstrate the effectiveness, practicality and accuracy of the proposed modeling and prediction approach.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/572.pdf},\n  issn = {1619-1366},\n  doi = {10.1007/s10270-012-0228-1},\n  author = {Sachs, Kai and Kounev, Samuel and Buchmann, Alejandro}\n}\n
\n\n','Message-oriented event-driven systems are becoming increasingly ubiquitous in many industry domains including telecommunications, transportation and supply chain management. Applications in these areas typically have stringent requirements for performance and scalability. To guarantee adequate quality-of-service, systems must be subjected to a rigorous performance and scalability analysis before they are put into production. In this paper, we present a comprehensive modeling methodology for message-oriented event-driven systems in the context of a case study of a representative application in the supply chain management domain. The methodology, which is based on queueing Petri nets, provides a basis for performance analysis and capacity planning. We study a deployment of the SPECjms2007 standard benchmark on a leading commercial middleware platform. A detailed system model is built in a step-by-step fashion and then used to predict the system performance under various workload and configuration scenarios. After the case study, we present a set of generic performance modeling patterns that can be used as building blocks when modeling message-oriented event-driven systems. The results demonstrate the effectiveness, practicality and accuracy of the proposed modeling and prediction approach.','Performance modeling and analysis of message-oriented event-driven systems',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(573,'paper','SaKoCaBu2007-SPEC_BW-BenchmarkingMOM','inproceedings','@inproceedings{SaKoCaBu2007-SPEC_BW-BenchmarkingMOM,\n abstract = {Message-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern information-driven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scalability of MOM. With all major vendors adopting JMS (Java Message Service) as a standard interface to MOM servers, there is at last a means for creating a standardized workload for evaluating products in this space. This paper describes a novel application in the supply chain management domain that has been specifically designed as a representative workload scenario for evaluating the performance and scalability of MOM products. This scenario is used as a basis in SPEC\'s new SPECjms benchmark which will be the world\'s first industry-standard benchmark for MOM.},\n author = {Kai Sachs and Samuel Kounev and Marc Carter and Alejandro Buchmann},\n booktitle = {Proceedings of the 2007 SPEC Benchmark Workshop, Austin, Texas, January 21, 2007},\n month = {January},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/573.pdf},\n publisher = {SPEC},\n title = {{Designing a Workload Scenario for Benchmarking Message-Oriented Middleware}},\n url = {http://www.spec.org/workshops/2007/austin/},\n year = {2007},\n}\n\n','\n\nKai Sachs, Samuel Kounev, Marc Carter, and Alejandro Buchmann.\nDesigning a Workload Scenario for Benchmarking Message-Oriented\nMiddleware.\nIn Proceedings of the 2007 SPEC Benchmark Workshop, Austin,\nTexas, January 21, 2007, January 2007. SPEC.\nJanuary 2007.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{SaKoCaBu2007-SPEC_BW-BenchmarkingMOM,\nabstract = {Message-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern information-driven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scalability of MOM. With all major vendors adopting JMS (Java Message Service) as a standard interface to MOM servers, there is at last a means for creating a standardized workload for evaluating products in this space. This paper describes a novel application in the supply chain management domain that has been specifically designed as a representative workload scenario for evaluating the performance and scalability of MOM products. This scenario is used as a basis in SPEC\'s new SPECjms benchmark which will be the world\'s first industry-standard benchmark for MOM.},\nauthor = {Kai Sachs and Samuel Kounev and Marc Carter and Alejandro Buchmann},\nbooktitle = {Proceedings of the 2007 SPEC Benchmark Workshop, Austin, Texas, January 21, 2007},\nmonth = {January},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/573.pdf},\npublisher = {SPEC},\ntitle = {{Designing a Workload Scenario for Benchmarking Message-Oriented Middleware}},\nurl = {http://www.spec.org/workshops/2007/austin/},\nyear = {2007}\n}\n
\n
\nMessage-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern information-driven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scalability of MOM. With all major vendors adopting JMS (Java Message Service) as a standard interface to MOM servers, there is at last a means for creating a standardized workload for evaluating products in this space. This paper describes a novel application in the supply chain management domain that has been specifically designed as a representative workload scenario for evaluating the performance and scalability of MOM products. This scenario is used as a basis in SPEC\'s new SPECjms benchmark which will be the world\'s first industry-standard benchmark for MOM.\n
\n','
\n@inproceedings{SaKoCaBu2007-SPEC_BW-BenchmarkingMOM,\n  abstract = {Message-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern information-driven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scalability of MOM. With all major vendors adopting JMS (Java Message Service) as a standard interface to MOM servers, there is at last a means for creating a standardized workload for evaluating products in this space. This paper describes a novel application in the supply chain management domain that has been specifically designed as a representative workload scenario for evaluating the performance and scalability of MOM products. This scenario is used as a basis in SPEC\'s new SPECjms benchmark which will be the world\'s first industry-standard benchmark for MOM.},\n  author = {Kai Sachs and Samuel Kounev and Marc Carter and Alejandro Buchmann},\n  booktitle = {Proceedings of the 2007 SPEC Benchmark Workshop, Austin, Texas, January 21, 2007},\n  month = {January},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/573.pdf},\n  publisher = {SPEC},\n  title = {{Designing a Workload Scenario for Benchmarking Message-Oriented Middleware}},\n  url = {http://www.spec.org/workshops/2007/austin/},\n  year = {2007}\n}\n
\n\n','Message-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern information-driven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scalability of MOM. With all major vendors adopting JMS (Java Message Service) as a standard interface to MOM servers, there is at last a means for creating a standardized workload for evaluating products in this space. This paper describes a novel application in the supply chain management domain that has been specifically designed as a representative workload scenario for evaluating the performance and scalability of MOM products. This scenario is used as a basis in SPEC\'s new SPECjms benchmark which will be the world\'s first industry-standard benchmark for MOM.','{Designing a Workload Scenario for Benchmarking Message-Oriented Middleware}',0,1,2007,1,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(579,'paper','SchroterMuhlRichling2010Stochastic','inproceedings','@inproceedings{SchroterMuhlRichling2010Stochastic,\n author = {Schr{\\\"{o}}ter, Arnd and M{\\\"{u}}hl, Gero and Kounev, Samuel and Parzyjegla, Helge and Richling, Jan},\n booktitle = {4th ACM International Conference on Distributed Event-Based Systems (DEBS 2010), July 12-15, Cambridge, United Kingdom},\n note = {Acceptance Rate: 25\\%},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/579.pdf},\n publisher = {ACM, New York, USA},\n title = {{Stochastic Performance Analysis and Capacity Planning of Publish/Subscribe Systems}},\n year = {2010},\n}\n\n','\n\nArnd Schröter, Gero Mühl, Samuel Kounev, Helge Parzyjegla, and Jan\nRichling.\nStochastic Performance Analysis and Capacity Planning of\nPublish/Subscribe Systems.\nIn 4th ACM International Conference on Distributed Event-Based\nSystems (DEBS 2010), July 12-15, Cambridge, United Kingdom, 2010. ACM, New\nYork, USA.\n2010, Acceptance Rate: 25%.\n[ bib | .pdf  ] 
\n@inproceedings{SchroterMuhlRichling2010Stochastic,\nauthor = {Schr{\\\"{o}}ter, Arnd and M{\\\"{u}}hl, Gero and Kounev, Samuel and Parzyjegla, Helge and Richling, Jan},\nbooktitle = {4th ACM International Conference on Distributed Event-Based Systems (DEBS 2010), July 12-15, Cambridge, United Kingdom},\nnote = {Acceptance Rate: 25\\%},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/579.pdf},\npublisher = {ACM, New York, USA},\ntitle = {{Stochastic Performance Analysis and Capacity Planning of Publish/Subscribe Systems}},\nyear = {2010}\n}\n
\n
\n','
\n@inproceedings{SchroterMuhlRichling2010Stochastic,\n  author = {Schr{\\\"{o}}ter, Arnd and M{\\\"{u}}hl, Gero and Kounev, Samuel and Parzyjegla, Helge and Richling, Jan},\n  booktitle = {4th ACM International Conference on Distributed Event-Based Systems (DEBS 2010), July 12-15, Cambridge, United Kingdom},\n  note = {Acceptance Rate: 25\\%},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/579.pdf},\n  publisher = {ACM, New York, USA},\n  title = {{Stochastic Performance Analysis and Capacity Planning of Publish/Subscribe Systems}},\n  year = {2010}\n}\n
\n\n',NULL,'{Stochastic Performance Analysis and Capacity Planning of Publish/Subscribe Systems}',0,0,2010,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(580,'paper','schuster2010a','inproceedings','@inproceedings{schuster2010a,\n abstract = {In recent years continuously changing market situations required IT systems that are flexible and highly responsive to changes of the underlying business processes. The transformation to service-oriented architecture (SOA) concepts, mainly services and loose coupling, promises to meet these demands. However, elevated complexity in management and evolution processes is required for the migration of existing systems towards SOA. Studies in this area of research have revealed a gap between in continuous and actual tool support of development teams throughout the process phases of evolution processes. Thus, in this article we introduce a method that fosters evolution by an iterative approach and illustrate how each phase of this method can be tool-supported.},\n author = {Thomas Schuster and Christoph Rathfelder and Nelly Schuster and Jens Nimis},\n booktitle = {Proceedings of the International Workshop on SOA Migration and Evolution 2010 (SOAME 2010) as part of the 14th European Conference on Software Maintenance and Reengineering (CSMR 2010)},\n day = {15},\n month = {March},\n pages = {1--10},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/580.pdf},\n title = {Comprehensive tool support for iterative SOA evolution},\n year = {2010},\n}\n\n','\n\nThomas Schuster, Christoph Rathfelder, Nelly Schuster, and Jens Nimis.\nComprehensive tool support for iterative soa evolution.\nIn Proceedings of the International Workshop on SOA Migration\nand Evolution 2010 (SOAME 2010) as part of the 14th European Conference on\nSoftware Maintenance and Reengineering (CSMR 2010), March 15, 2010, pages\n1-10.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{schuster2010a,\nabstract = {In recent years continuously changing market situations required IT systems that are flexible and highly responsive to changes of the underlying business processes. The transformation to service-oriented architecture (SOA) concepts, mainly services and loose coupling, promises to meet these demands. However, elevated complexity in management and evolution processes is required for the migration of existing systems towards SOA. Studies in this area of research have revealed a gap between in continuous and actual tool support of development teams throughout the process phases of evolution processes. Thus, in this article we introduce a method that fosters evolution by an iterative approach and illustrate how each phase of this method can be tool-supported.},\nauthor = {Thomas Schuster and Christoph Rathfelder and Nelly Schuster and Jens Nimis},\nbooktitle = {Proceedings of the International Workshop on SOA Migration and Evolution 2010 (SOAME 2010) as part of the 14th European Conference on Software Maintenance and Reengineering (CSMR 2010)},\nday = {15},\nmonth = {March},\npages = {1--10},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/580.pdf},\ntitle = {Comprehensive tool support for iterative SOA evolution},\nyear = {2010}\n}\n
\n
\nIn recent years continuously changing market situations required IT systems that are flexible and highly responsive to changes of the underlying business processes. The transformation to service-oriented architecture (SOA) concepts, mainly services and loose coupling, promises to meet these demands. However, elevated complexity in management and evolution processes is required for the migration of existing systems towards SOA. Studies in this area of research have revealed a gap between in continuous and actual tool support of development teams throughout the process phases of evolution processes. Thus, in this article we introduce a method that fosters evolution by an iterative approach and illustrate how each phase of this method can be tool-supported.\n
\n','
\n@inproceedings{schuster2010a,\n  abstract = {In recent years continuously changing market situations required IT systems that are flexible and highly responsive to changes of the underlying business processes. The transformation to service-oriented architecture (SOA) concepts, mainly services and loose coupling, promises to meet these demands. However, elevated complexity in management and evolution processes is required for the migration of existing systems towards SOA. Studies in this area of research have revealed a gap between in continuous and actual tool support of development teams throughout the process phases of evolution processes. Thus, in this article we introduce a method that fosters evolution by an iterative approach and illustrate how each phase of this method can be tool-supported.},\n  author = {Thomas Schuster and Christoph Rathfelder and Nelly Schuster and Jens Nimis},\n  booktitle = {Proceedings of the International Workshop on SOA Migration and Evolution 2010 (SOAME 2010) as part of the 14th European Conference on Software Maintenance and Reengineering (CSMR 2010)},\n  day = {15},\n  month = {March},\n  pages = {1--10},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/580.pdf},\n  title = {Comprehensive tool support for iterative SOA evolution},\n  year = {2010}\n}\n
\n\n','In recent years continuously changing market situations required IT systems that are flexible and highly responsive to changes of the underlying business processes. The transformation to service-oriented architecture (SOA) concepts, mainly services and loose coupling, promises to meet these demands. However, elevated complexity in management and evolution processes is required for the migration of existing systems towards SOA. Studies in this area of research have revealed a gap between in continuous and actual tool support of development teams throughout the process phases of evolution processes. Thus, in this article we introduce a method that fosters evolution by an iterative approach and illustrate how each phase of this method can be tool-supported.','Comprehensive tool support for iterative SOA evolution',0,3,2010,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(584,'paper','sp2007-SPEC-SPECjms2007','misc','@misc{sp2007-SPEC-SPECjms2007,\n author = {SPEC},\n howpublished = {Standard Performance Evaluation Corporation},\n month = {October},\n note = {SPECtacular Performance Award},\n title = {{SPECjms2007 - First industry-standard benchmark for enterprise messaging servers (JMS~1.1).}},\n url = {http://www.spec.org/jms2007/},\n year = {2007},\n}\n\n','\n\nSPEC.\nSPECjms2007 - First industry-standard benchmark for enterprise\nmessaging servers (JMS 1.1).\nStandard Performance Evaluation Corporation, October 2007.\nSPECtacular Performance Award.\n[ bib | http  ] 
\n@misc{sp2007-SPEC-SPECjms2007,\nauthor = {SPEC},\nhowpublished = {Standard Performance Evaluation Corporation},\nmonth = {October},\nnote = {SPECtacular Performance Award},\ntitle = {{SPECjms2007 - First industry-standard benchmark for enterprise messaging servers (JMS~1.1).}},\nurl = {http://www.spec.org/jms2007/},\nyear = {2007}\n}\n
\n
\n','
\n@misc{sp2007-SPEC-SPECjms2007,\n  author = {SPEC},\n  howpublished = {Standard Performance Evaluation Corporation},\n  month = {October},\n  note = {SPECtacular Performance Award},\n  title = {{SPECjms2007 - First industry-standard benchmark for enterprise messaging servers (JMS~1.1).}},\n  url = {http://www.spec.org/jms2007/},\n  year = {2007}\n}\n
\n\n',NULL,'{SPECjms2007 - First industry-standard benchmark for enterprise messaging servers (JMS~1.1).}',0,10,2007,10,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(585,'paper','sp2005-SPEC-SPECjbb2005','misc','@misc{sp2005-SPEC-SPECjbb2005,\n abstract = {SPECjbb2005 (Java Server Benchmark) is SPEC\'s benchmark for evaluating the performance of server side Java. Like its predecessor, SPECjbb2000, SPECjbb2005 evaluates the performance of server side Java by emulating a three-tier client/server system (with emphasis on the middle tier). The benchmark exercises the implementations of the JVM (Java Virtual Machine), JIT (Just-In-Time) compiler, garbage collection, threads and some aspects of the operating system. It also measures the performance of CPUs, caches, memory hierarchy and the scalability of shared memory processors (SMPs). SPECjbb2005 provides a new enhanced workload, implemented in a more object-oriented manner to reflect how real-world applications are designed and introduces new features such as XML processing and BigDecimal computations to make the benchmark a more realistic reflection of today\'s applications.},\n author = {SPEC},\n howpublished = {Standard Performance Evaluation Corporation},\n month = {June},\n note = {SPECtacular Award},\n title = {{SPECjbb2005 - Industry-standard server-side Java benchmark (J2SE 5.0).}},\n url = {http://www.spec.org/jbb2005/},\n year = {2005},\n}\n\n','\n\nSPEC.\nSPECjbb2005 - Industry-standard server-side Java benchmark (J2SE\n5.0).\nStandard Performance Evaluation Corporation, June 2005.\nSPECtacular Award.\n[ bib | http | Abstract  ] 
\n@misc{sp2005-SPEC-SPECjbb2005,\nabstract = {SPECjbb2005 (Java Server Benchmark) is SPEC\'s benchmark for evaluating the performance of server side Java. Like its predecessor, SPECjbb2000, SPECjbb2005 evaluates the performance of server side Java by emulating a three-tier client/server system (with emphasis on the middle tier). The benchmark exercises the implementations of the JVM (Java Virtual Machine), JIT (Just-In-Time) compiler, garbage collection, threads and some aspects of the operating system. It also measures the performance of CPUs, caches, memory hierarchy and the scalability of shared memory processors (SMPs). SPECjbb2005 provides a new enhanced workload, implemented in a more object-oriented manner to reflect how real-world applications are designed and introduces new features such as XML processing and BigDecimal computations to make the benchmark a more realistic reflection of today\'s applications.},\nauthor = {SPEC},\nhowpublished = {Standard Performance Evaluation Corporation},\nmonth = {June},\nnote = {SPECtacular Award},\ntitle = {{SPECjbb2005 - Industry-standard server-side Java benchmark (J2SE 5.0).}},\nurl = {http://www.spec.org/jbb2005/},\nyear = {2005}\n}\n
\n
\nSPECjbb2005 (Java Server Benchmark) is SPEC\'s benchmark for evaluating the performance of server side Java. Like its predecessor, SPECjbb2000, SPECjbb2005 evaluates the performance of server side Java by emulating a three-tier client/server system (with emphasis on the middle tier). The benchmark exercises the implementations of the JVM (Java Virtual Machine), JIT (Just-In-Time) compiler, garbage collection, threads and some aspects of the operating system. It also measures the performance of CPUs, caches, memory hierarchy and the scalability of shared memory processors (SMPs). SPECjbb2005 provides a new enhanced workload, implemented in a more object-oriented manner to reflect how real-world applications are designed and introduces new features such as XML processing and BigDecimal computations to make the benchmark a more realistic reflection of today\'s applications.\n
\n','
\n@misc{sp2005-SPEC-SPECjbb2005,\n  abstract = {SPECjbb2005 (Java Server Benchmark) is SPEC\'s benchmark for evaluating the performance of server side Java. Like its predecessor, SPECjbb2000, SPECjbb2005 evaluates the performance of server side Java by emulating a three-tier client/server system (with emphasis on the middle tier). The benchmark exercises the implementations of the JVM (Java Virtual Machine), JIT (Just-In-Time) compiler, garbage collection, threads and some aspects of the operating system. It also measures the performance of CPUs, caches, memory hierarchy and the scalability of shared memory processors (SMPs). SPECjbb2005 provides a new enhanced workload, implemented in a more object-oriented manner to reflect how real-world applications are designed and introduces new features such as XML processing and BigDecimal computations to make the benchmark a more realistic reflection of today\'s applications.},\n  author = {SPEC},\n  howpublished = {Standard Performance Evaluation Corporation},\n  month = {June},\n  note = {SPECtacular Award},\n  title = {{SPECjbb2005 - Industry-standard server-side Java benchmark (J2SE 5.0).}},\n  url = {http://www.spec.org/jbb2005/},\n  year = {2005}\n}\n
\n\n','SPECjbb2005 (Java Server Benchmark) is SPEC\'s benchmark for evaluating the performance of server side Java. Like its predecessor, SPECjbb2000, SPECjbb2005 evaluates the performance of server side Java by emulating a three-tier client/server system (with emphasis on the middle tier). The benchmark exercises the implementations of the JVM (Java Virtual Machine), JIT (Just-In-Time) compiler, garbage collection, threads and some aspects of the operating system. It also measures the performance of CPUs, caches, memory hierarchy and the scalability of shared memory processors (SMPs). SPECjbb2005 provides a new enhanced workload, implemented in a more object-oriented manner to reflect how real-world applications are designed and introduces new features such as XML processing and BigDecimal computations to make the benchmark a more realistic reflection of today\'s applications.','{SPECjbb2005 - Industry-standard server-side Java benchmark (J2SE 5.0).}',0,6,2005,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(586,'paper','sp2004-SPEC-SPECjAppServer2004','misc','@misc{sp2004-SPEC-SPECjAppServer2004,\n absract = {SPECjAppServer2004 (Java Application Server) is a multi-tier benchmark for measuring the performance of Java 2 Enterprise Edition (J2EE) technology-based application servers. SPECjAppServer2004 is an end-to-end application which exercises all major J2EE technologies implemented by compliant application servers as follows: * The web container, including servlets and JSPs * The EJB container * EJB2.0 Container Managed Persistence * JMS and Message Driven Beans * Transaction management * Database connectivity Moreover, SPECjAppServer2004 also heavily exercises all parts of the underlying infrastructure that make up the application environment, including hardware, JVM software, database software, JDBC drivers, and the system network.},\n author = {SPEC},\n howpublished = {Standard Performance Evaluation Corporation},\n month = {April},\n note = {SPECtacular Performance Award},\n title = {{SPECjAppServer2004 - Industry-standard enterprise Java application server benchmark (J2EE 1.4).}},\n url = {http://www.spec.org/jAppServer2004/},\n year = {2004},\n}\n\n','\n\nSPEC.\nSPECjAppServer2004 - Industry-standard enterprise Java application\nserver benchmark (J2EE 1.4).\nStandard Performance Evaluation Corporation, April 2004.\nSPECtacular Performance Award.\n[ bib | http  ] 
\n@misc{sp2004-SPEC-SPECjAppServer2004,\nabsract = {SPECjAppServer2004 (Java Application Server) is a multi-tier benchmark for measuring the performance of Java 2 Enterprise Edition (J2EE) technology-based application servers. SPECjAppServer2004 is an end-to-end application which exercises all major J2EE technologies implemented by compliant application servers as follows: * The web container, including servlets and JSPs * The EJB container * EJB2.0 Container Managed Persistence * JMS and Message Driven Beans * Transaction management * Database connectivity Moreover, SPECjAppServer2004 also heavily exercises all parts of the underlying infrastructure that make up the application environment, including hardware, JVM software, database software, JDBC drivers, and the system network.},\nauthor = {SPEC},\nhowpublished = {Standard Performance Evaluation Corporation},\nmonth = {April},\nnote = {SPECtacular Performance Award},\ntitle = {{SPECjAppServer2004 - Industry-standard enterprise Java application server benchmark (J2EE 1.4).}},\nurl = {http://www.spec.org/jAppServer2004/},\nyear = {2004}\n}\n
\n
\n','
\n@misc{sp2004-SPEC-SPECjAppServer2004,\n  absract = {SPECjAppServer2004 (Java Application Server) is a multi-tier benchmark for measuring the performance of Java 2 Enterprise Edition (J2EE) technology-based application servers. SPECjAppServer2004 is an end-to-end application which exercises all major J2EE technologies implemented by compliant application servers as follows: * The web container, including servlets and JSPs * The EJB container * EJB2.0 Container Managed Persistence * JMS and Message Driven Beans * Transaction management * Database connectivity Moreover, SPECjAppServer2004 also heavily exercises all parts of the underlying infrastructure that make up the application environment, including hardware, JVM software, database software, JDBC drivers, and the system network.},\n  author = {SPEC},\n  howpublished = {Standard Performance Evaluation Corporation},\n  month = {April},\n  note = {SPECtacular Performance Award},\n  title = {{SPECjAppServer2004 - Industry-standard enterprise Java application server benchmark (J2EE 1.4).}},\n  url = {http://www.spec.org/jAppServer2004/},\n  year = {2004}\n}\n
\n\n',NULL,'{SPECjAppServer2004 - Industry-standard enterprise Java application server benchmark (J2EE 1.4).}',0,4,2004,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(587,'paper','sp2002-SPEC-SPECjAppServer2001','misc','@misc{sp2002-SPEC-SPECjAppServer2001,\n abstract = {SPECjAppServer2001 (Java Application Server) is a client/server benchmark for measuring the performance of Java Enterprise Application Servers using a subset of J2EE API\'s in a complete end-to-end web application. Joining the client-side SPECjvm98 and the server side SPECjbb2000, SPECjAppServer2001 continues the SPEC tradition of giving Java users the most objective and representative benchmark for measuring a system\'s ability to run Java applications. SPEC has designed the SPECjAppServer2001 benchmark to exercise the Java Enterprise Application Server, the Java Virtual Machine (JVM), as well as the server Systems Under Test (SUT). As a true J2EE application the benchmark will require a functional RDBMS (for JDBC) and a Web Server, but the benchmark has been designed so that the SUT can be a single system. Please note that while the SPECjAppServer2001 suite is still available for purchase, the suite has been retired, no further results are being accepted for publication, and support is no longer provided.},\n author = {SPEC},\n howpublished = {Standard Performance Evaluation Corporation},\n month = {September},\n title = {{SPECjAppServer2001 - Industry-standard enterprise Java application server benchmark (J2EE 1.2).}},\n url = {http://www.spec.org/jAppServer2001/},\n year = {2002},\n}\n\n','\n\nSPEC.\nSPECjAppServer2001 - Industry-standard enterprise Java application\nserver benchmark (J2EE 1.2).\nStandard Performance Evaluation Corporation, September 2002.\n[ bib | http | Abstract  ] 
\n@misc{sp2002-SPEC-SPECjAppServer2001,\nabstract = {SPECjAppServer2001 (Java Application Server) is a client/server benchmark for measuring the performance of Java Enterprise Application Servers using a subset of J2EE API\'s in a complete end-to-end web application. Joining the client-side SPECjvm98 and the server side SPECjbb2000, SPECjAppServer2001 continues the SPEC tradition of giving Java users the most objective and representative benchmark for measuring a system\'s ability to run Java applications. SPEC has designed the SPECjAppServer2001 benchmark to exercise the Java Enterprise Application Server, the Java Virtual Machine (JVM), as well as the server Systems Under Test (SUT). As a true J2EE application the benchmark will require a functional RDBMS (for JDBC) and a Web Server, but the benchmark has been designed so that the SUT can be a single system. Please note that while the SPECjAppServer2001 suite is still available for purchase, the suite has been retired, no further results are being accepted for publication, and support is no longer provided.},\nauthor = {SPEC},\nhowpublished = {Standard Performance Evaluation Corporation},\nmonth = {September},\ntitle = {{SPECjAppServer2001 - Industry-standard enterprise Java application server benchmark (J2EE 1.2).}},\nurl = {http://www.spec.org/jAppServer2001/},\nyear = {2002}\n}\n
\n
\nSPECjAppServer2001 (Java Application Server) is a client/server benchmark for measuring the performance of Java Enterprise Application Servers using a subset of J2EE API\'s in a complete end-to-end web application. Joining the client-side SPECjvm98 and the server side SPECjbb2000, SPECjAppServer2001 continues the SPEC tradition of giving Java users the most objective and representative benchmark for measuring a system\'s ability to run Java applications. SPEC has designed the SPECjAppServer2001 benchmark to exercise the Java Enterprise Application Server, the Java Virtual Machine (JVM), as well as the server Systems Under Test (SUT). As a true J2EE application the benchmark will require a functional RDBMS (for JDBC) and a Web Server, but the benchmark has been designed so that the SUT can be a single system. Please note that while the SPECjAppServer2001 suite is still available for purchase, the suite has been retired, no further results are being accepted for publication, and support is no longer provided.\n
\n','
\n@misc{sp2002-SPEC-SPECjAppServer2001,\n  abstract = {SPECjAppServer2001 (Java Application Server) is a client/server benchmark for measuring the performance of Java Enterprise Application Servers using a subset of J2EE API\'s in a complete end-to-end web application. Joining the client-side SPECjvm98 and the server side SPECjbb2000, SPECjAppServer2001 continues the SPEC tradition of giving Java users the most objective and representative benchmark for measuring a system\'s ability to run Java applications. SPEC has designed the SPECjAppServer2001 benchmark to exercise the Java Enterprise Application Server, the Java Virtual Machine (JVM), as well as the server Systems Under Test (SUT). As a true J2EE application the benchmark will require a functional RDBMS (for JDBC) and a Web Server, but the benchmark has been designed so that the SUT can be a single system. Please note that while the SPECjAppServer2001 suite is still available for purchase, the suite has been retired, no further results are being accepted for publication, and support is no longer provided.},\n  author = {SPEC},\n  howpublished = {Standard Performance Evaluation Corporation},\n  month = {September},\n  title = {{SPECjAppServer2001 - Industry-standard enterprise Java application server benchmark (J2EE 1.2).}},\n  url = {http://www.spec.org/jAppServer2001/},\n  year = {2002}\n}\n
\n\n','SPECjAppServer2001 (Java Application Server) is a client/server benchmark for measuring the performance of Java Enterprise Application Servers using a subset of J2EE API\'s in a complete end-to-end web application. Joining the client-side SPECjvm98 and the server side SPECjbb2000, SPECjAppServer2001 continues the SPEC tradition of giving Java users the most objective and representative benchmark for measuring a system\'s ability to run Java applications. SPEC has designed the SPECjAppServer2001 benchmark to exercise the Java Enterprise Application Server, the Java Virtual Machine (JVM), as well as the server Systems Under Test (SUT). As a true J2EE application the benchmark will require a functional RDBMS (for JDBC) and a Web Server, but the benchmark has been designed so that the SUT can be a single system. Please note that while the SPECjAppServer2001 suite is still available for purchase, the suite has been retired, no further results are being accepted for publication, and support is no longer provided.','{SPECjAppServer2001 - Industry-standard enterprise Java application server benchmark (J2EE 1.2).}',0,9,2002,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(588,'paper','sp2002-SPEC-SPECjAppServer2002','misc','@misc{sp2002-SPEC-SPECjAppServer2002,\n abstract = {SPECjAppServer2002 (Java Application Server) is a client/server benchmark for measuring the performance of Java Enterprise Application Servers using a subset of J2EE APIs in a complete end-to-end web application. It is the same as SPECjAppServer2001 (released in September 2002) except that the Enterprise Java Beans (EJBs) are defined using the EJB 2.0 specification instead of the EJB 1.1 specification. SPECjAppServer2002 can therefore take advantage of several EJB 2.0 features such as local interfaces, the EJB-QL query language, and Container Managed Relationships (CMR) between entity beans. Joining the client-side SPECjvm98 and the server side SPECjbb2000, SPECjAppServer2002 and SPECjAppServer2001 continue the SPEC tradition of giving Java users the most objective and representative benchmarks for measuring a system\'s ability to run Java applications. SPEC has designed the SPECjAppServer2002 benchmark to exercise the Java Enterprise Application Server, the Java Virtual Machine (JVM), as well as the server Systems Under Test (SUT). As a true J2EE application the benchmark will require a functional RDBMS (for JDBC) and a Web Server, but the benchmark has been designed so that the SUT can be a single system. Please note that while the SPECjAppServer2002 suite is still available for purchase, the suite has been retired, no further results are being accepted for publication, and support is no longer provided.},\n author = {SPEC},\n howpublished = {Standard Performance Evaluation Corporation},\n month = {November},\n title = {{SPECjAppServer2002 - Industry-standard enterprise Java application server benchmark (J2EE 1.3).}},\n url = {http://www.spec.org/jAppServer2002/},\n year = {2002},\n}\n\n','\n\nSPEC.\nSPECjAppServer2002 - Industry-standard enterprise Java application\nserver benchmark (J2EE 1.3).\nStandard Performance Evaluation Corporation, November 2002.\n[ bib | http | Abstract  ] 
\n@misc{sp2002-SPEC-SPECjAppServer2002,\nabstract = {SPECjAppServer2002 (Java Application Server) is a client/server benchmark for measuring the performance of Java Enterprise Application Servers using a subset of J2EE APIs in a complete end-to-end web application. It is the same as SPECjAppServer2001 (released in September 2002) except that the Enterprise Java Beans (EJBs) are defined using the EJB 2.0 specification instead of the EJB 1.1 specification. SPECjAppServer2002 can therefore take advantage of several EJB 2.0 features such as local interfaces, the EJB-QL query language, and Container Managed Relationships (CMR) between entity beans. Joining the client-side SPECjvm98 and the server side SPECjbb2000, SPECjAppServer2002 and SPECjAppServer2001 continue the SPEC tradition of giving Java users the most objective and representative benchmarks for measuring a system\'s ability to run Java applications. SPEC has designed the SPECjAppServer2002 benchmark to exercise the Java Enterprise Application Server, the Java Virtual Machine (JVM), as well as the server Systems Under Test (SUT). As a true J2EE application the benchmark will require a functional RDBMS (for JDBC) and a Web Server, but the benchmark has been designed so that the SUT can be a single system. Please note that while the SPECjAppServer2002 suite is still available for purchase, the suite has been retired, no further results are being accepted for publication, and support is no longer provided.},\nauthor = {SPEC},\nhowpublished = {Standard Performance Evaluation Corporation},\nmonth = {November},\ntitle = {{SPECjAppServer2002 - Industry-standard enterprise Java application server benchmark (J2EE 1.3).}},\nurl = {http://www.spec.org/jAppServer2002/},\nyear = {2002}\n}\n
\n
\nSPECjAppServer2002 (Java Application Server) is a client/server benchmark for measuring the performance of Java Enterprise Application Servers using a subset of J2EE APIs in a complete end-to-end web application. It is the same as SPECjAppServer2001 (released in September 2002) except that the Enterprise Java Beans (EJBs) are defined using the EJB 2.0 specification instead of the EJB 1.1 specification. SPECjAppServer2002 can therefore take advantage of several EJB 2.0 features such as local interfaces, the EJB-QL query language, and Container Managed Relationships (CMR) between entity beans. Joining the client-side SPECjvm98 and the server side SPECjbb2000, SPECjAppServer2002 and SPECjAppServer2001 continue the SPEC tradition of giving Java users the most objective and representative benchmarks for measuring a system\'s ability to run Java applications. SPEC has designed the SPECjAppServer2002 benchmark to exercise the Java Enterprise Application Server, the Java Virtual Machine (JVM), as well as the server Systems Under Test (SUT). As a true J2EE application the benchmark will require a functional RDBMS (for JDBC) and a Web Server, but the benchmark has been designed so that the SUT can be a single system. Please note that while the SPECjAppServer2002 suite is still available for purchase, the suite has been retired, no further results are being accepted for publication, and support is no longer provided.\n
\n','
\n@misc{sp2002-SPEC-SPECjAppServer2002,\n  abstract = {SPECjAppServer2002 (Java Application Server) is a client/server benchmark for measuring the performance of Java Enterprise Application Servers using a subset of J2EE APIs in a complete end-to-end web application. It is the same as SPECjAppServer2001 (released in September 2002) except that the Enterprise Java Beans (EJBs) are defined using the EJB 2.0 specification instead of the EJB 1.1 specification. SPECjAppServer2002 can therefore take advantage of several EJB 2.0 features such as local interfaces, the EJB-QL query language, and Container Managed Relationships (CMR) between entity beans. Joining the client-side SPECjvm98 and the server side SPECjbb2000, SPECjAppServer2002 and SPECjAppServer2001 continue the SPEC tradition of giving Java users the most objective and representative benchmarks for measuring a system\'s ability to run Java applications. SPEC has designed the SPECjAppServer2002 benchmark to exercise the Java Enterprise Application Server, the Java Virtual Machine (JVM), as well as the server Systems Under Test (SUT). As a true J2EE application the benchmark will require a functional RDBMS (for JDBC) and a Web Server, but the benchmark has been designed so that the SUT can be a single system. Please note that while the SPECjAppServer2002 suite is still available for purchase, the suite has been retired, no further results are being accepted for publication, and support is no longer provided.},\n  author = {SPEC},\n  howpublished = {Standard Performance Evaluation Corporation},\n  month = {November},\n  title = {{SPECjAppServer2002 - Industry-standard enterprise Java application server benchmark (J2EE 1.3).}},\n  url = {http://www.spec.org/jAppServer2002/},\n  year = {2002}\n}\n
\n\n','SPECjAppServer2002 (Java Application Server) is a client/server benchmark for measuring the performance of Java Enterprise Application Servers using a subset of J2EE APIs in a complete end-to-end web application. It is the same as SPECjAppServer2001 (released in September 2002) except that the Enterprise Java Beans (EJBs) are defined using the EJB 2.0 specification instead of the EJB 1.1 specification. SPECjAppServer2002 can therefore take advantage of several EJB 2.0 features such as local interfaces, the EJB-QL query language, and Container Managed Relationships (CMR) between entity beans. Joining the client-side SPECjvm98 and the server side SPECjbb2000, SPECjAppServer2002 and SPECjAppServer2001 continue the SPEC tradition of giving Java users the most objective and representative benchmarks for measuring a system\'s ability to run Java applications. SPEC has designed the SPECjAppServer2002 benchmark to exercise the Java Enterprise Application Server, the Java Virtual Machine (JVM), as well as the server Systems Under Test (SUT). As a true J2EE application the benchmark will require a functional RDBMS (for JDBC) and a Web Server, but the benchmark has been designed so that the SUT can be a single system. Please note that while the SPECjAppServer2002 suite is still available for purchase, the suite has been retired, no further results are being accepted for publication, and support is no longer provided.','{SPECjAppServer2002 - Industry-standard enterprise Java application server benchmark (J2EE 1.3).}',0,11,2002,11,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(589,'paper','Spinner2011a','mastersthesis','@mastersthesis{Spinner2011a,\n title = {{Evaluating Approaches to Resource Demand Estimation}},\n year = {2011},\n month = {7},\n abstract = {Proactively managing the performance and resource efficiency of running software systems requires techniques to predict system performance and resource consumption. Typically, performance predictions are based on performance models that capture the performance-relevant aspects of the considered software system. Building performance models involves the estimation of resource demands, i.e., estimating the time a unit of work spends obtaining service from a resource. A number of approaches to estimating the resource demands of a system already exist, e.g., based on regression analysis or stochastic filtering. These approaches differ in their accuracy, their robustness and their applicability. For instance, there are notable differences in the amount and type of measurement data that is required as input. However, to the best of our knowledge, a comprehensive evaluation and comparison of these approaches in a representative context does not exist. In this thesis, we give an overview of the state-of-the-art in resource demand estimation and develop a classification scheme for approaches to resource demand estimation. We implement a sub-set of these estimation approaches and evaluate them in a representative environment. We analyze the influence of various factors of the environment on the estimation accuracy, considering the impact of current technologies, such as multi-core processors and virtualization. Our work improves the comparability of existing estimation approaches and facilitates the selection of an approach in a given application scenario. Additionally, it shows possible directions for future research in the field of resource demand estimation.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/589.pdf},\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n school = {Karlsruhe Institute of Technology (KIT)},\n author = {Spinner, Simon},\n note = {Best Graduate Award from the Faculty of Informatics},\n}\n\n','\n\nSimon Spinner.\nEvaluating Approaches to Resource Demand Estimation.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, 7 2011.\nBest Graduate Award from the Faculty of Informatics.\n[ bib | .pdf | Abstract  ] 
\n@mastersthesis{Spinner2011a,\ntitle = {{Evaluating Approaches to Resource Demand Estimation}},\nyear = {2011},\nmonth = {7},\nabstract = {Proactively managing the performance and resource efficiency of running software systems requires techniques to predict system performance and resource consumption. Typically, performance predictions are based on performance models that capture the performance-relevant aspects of the considered software system. Building performance models involves the estimation of resource demands, i.e., estimating the time a unit of work spends obtaining service from a resource. A number of approaches to estimating the resource demands of a system already exist, e.g., based on regression analysis or stochastic filtering. These approaches differ in their accuracy, their robustness and their applicability. For instance, there are notable differences in the amount and type of measurement data that is required as input. However, to the best of our knowledge, a comprehensive evaluation and comparison of these approaches in a representative context does not exist. In this thesis, we give an overview of the state-of-the-art in resource demand estimation and develop a classification scheme for approaches to resource demand estimation. We implement a sub-set of these estimation approaches and evaluate them in a representative environment. We analyze the influence of various factors of the environment on the estimation accuracy, considering the impact of current technologies, such as multi-core processors and virtualization. Our work improves the comparability of existing estimation approaches and facilitates the selection of an approach in a given application scenario. Additionally, it shows possible directions for future research in the field of resource demand estimation.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/589.pdf},\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nschool = {Karlsruhe Institute of Technology (KIT)},\nauthor = {Spinner, Simon},\nnote = {Best Graduate Award from the Faculty of Informatics}\n}\n
\n
\nProactively managing the performance and resource efficiency of running software systems requires techniques to predict system performance and resource consumption. Typically, performance predictions are based on performance models that capture the performance-relevant aspects of the considered software system. Building performance models involves the estimation of resource demands, i.e., estimating the time a unit of work spends obtaining service from a resource. A number of approaches to estimating the resource demands of a system already exist, e.g., based on regression analysis or stochastic filtering. These approaches differ in their accuracy, their robustness and their applicability. For instance, there are notable differences in the amount and type of measurement data that is required as input. However, to the best of our knowledge, a comprehensive evaluation and comparison of these approaches in a representative context does not exist. In this thesis, we give an overview of the state-of-the-art in resource demand estimation and develop a classification scheme for approaches to resource demand estimation. We implement a sub-set of these estimation approaches and evaluate them in a representative environment. We analyze the influence of various factors of the environment on the estimation accuracy, considering the impact of current technologies, such as multi-core processors and virtualization. Our work improves the comparability of existing estimation approaches and facilitates the selection of an approach in a given application scenario. Additionally, it shows possible directions for future research in the field of resource demand estimation.\n
\n','
\n@mastersthesis{Spinner2011a,\n  title = {{Evaluating Approaches to Resource Demand Estimation}},\n  year = {2011},\n  month = {7},\n  abstract = {Proactively managing the performance and resource efficiency of running software systems requires techniques to predict system performance and resource consumption. Typically, performance predictions are based on performance models that capture the performance-relevant aspects of the considered software system. Building performance models involves the estimation of resource demands, i.e., estimating the time a unit of work spends obtaining service from a resource. A number of approaches to estimating the resource demands of a system already exist, e.g., based on regression analysis or stochastic filtering. These approaches differ in their accuracy, their robustness and their applicability. For instance, there are notable differences in the amount and type of measurement data that is required as input. However, to the best of our knowledge, a comprehensive evaluation and comparison of these approaches in a representative context does not exist. In this thesis, we give an overview of the state-of-the-art in resource demand estimation and develop a classification scheme for approaches to resource demand estimation. We implement a sub-set of these estimation approaches and evaluate them in a representative environment. We analyze the influence of various factors of the environment on the estimation accuracy, considering the impact of current technologies, such as multi-core processors and virtualization. Our work improves the comparability of existing estimation approaches and facilitates the selection of an approach in a given application scenario. Additionally, it shows possible directions for future research in the field of resource demand estimation.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/589.pdf},\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  author = {Spinner, Simon},\n  note = {Best Graduate Award from the Faculty of Informatics}\n}\n
\n\n','Proactively managing the performance and resource efficiency of running software systems requires techniques to predict system performance and resource consumption. Typically, performance predictions are based on performance models that capture the performance-relevant aspects of the considered software system. Building performance models involves the estimation of resource demands, i.e., estimating the time a unit of work spends obtaining service from a resource. A number of approaches to estimating the resource demands of a system already exist, e.g., based on regression analysis or stochastic filtering. These approaches differ in their accuracy, their robustness and their applicability. For instance, there are notable differences in the amount and type of measurement data that is required as input. However, to the best of our knowledge, a comprehensive evaluation and comparison of these approaches in a representative context does not exist. In this thesis, we give an overview of the state-of-the-art in resource demand estimation and develop a classification scheme for approaches to resource demand estimation. We implement a sub-set of these estimation approaches and evaluate them in a representative environment. We analyze the influence of various factors of the environment on the estimation accuracy, considering the impact of current technologies, such as multi-core processors and virtualization. Our work improves the comparability of existing estimation approaches and facilitates the selection of an approach in a given application scenario. Additionally, it shows possible directions for future research in the field of resource demand estimation.','{Evaluating Approaches to Resource Demand Estimation}',0,7,2011,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(590,'paper','SpKoMe2012-PETRINETS-QPME','inproceedings','@inproceedings{SpKoMe2012-PETRINETS-QPME,\n abstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present our tool QPME (Queueing Petri net Modeling Environment) for modeling and analysis using queueing Petri nets. QPME provides an Eclipse-based editor for building queueing Petri net models and a powerful simulation engine for analyzing these models. The development of the tool started in 2003 and since then the tool has been distributed to more than 120 organizations worldwide.},\n address = {Berlin, Heidelberg},\n author = {Simon Spinner and Samuel Kounev and Philipp Meier},\n booktitle = {Proceedings of the 33rd International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2012)},\n day = {27--29},\n editor = {Haddad, Serge and Pomello, Lucia},\n isbn = {978-3-642-31130-7},\n location = {Hamburg, Germany},\n month = {June},\n pages = {388--397},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/590.pdf},\n publisher = {Springer-Verlag},\n series = {Lecture Notes in Computer Science (LNCS)},\n title = {{Stochastic Modeling and Analysis using QPME: Queueing Petri Net Modeling Environment v2.0}},\n url = {http://dx.doi.org/10.1007/978-3-642-31131-4_21},\n volume = {7347},\n year = {2012},\n}\n\n','\n\nSimon Spinner, Samuel Kounev, and Philipp Meier.\nStochastic Modeling and Analysis using QPME: Queueing Petri Net\nModeling Environment v2.0.\nIn Proceedings of the 33rd International Conference on\nApplication and Theory of Petri Nets and Concurrency (Petri Nets 2012),\nSerge Haddad and Lucia Pomello, editors, Hamburg, Germany, June 27-29, 2012,\nvolume 7347 of Lecture Notes in Computer Science (LNCS), pages\n388-397. Springer-Verlag, Berlin, Heidelberg.\nJune 2012.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{SpKoMe2012-PETRINETS-QPME,\nabstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present our tool QPME (Queueing Petri net Modeling Environment) for modeling and analysis using queueing Petri nets. QPME provides an Eclipse-based editor for building queueing Petri net models and a powerful simulation engine for analyzing these models. The development of the tool started in 2003 and since then the tool has been distributed to more than 120 organizations worldwide.},\naddress = {Berlin, Heidelberg},\nauthor = {Simon Spinner and Samuel Kounev and Philipp Meier},\nbooktitle = {Proceedings of the 33rd International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2012)},\nday = {27--29},\neditor = {Haddad, Serge and Pomello, Lucia},\nisbn = {978-3-642-31130-7},\nlocation = {Hamburg, Germany},\nmonth = {June},\npages = {388--397},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/590.pdf},\npublisher = {Springer-Verlag},\nseries = {Lecture Notes in Computer Science (LNCS)},\ntitle = {{Stochastic Modeling and Analysis using QPME: Queueing Petri Net Modeling Environment v2.0}},\nurl = {http://dx.doi.org/10.1007/978-3-642-31131-4_21},\nvolume = {7347},\nyear = {2012}\n}\n
\n
\nQueueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present our tool QPME (Queueing Petri net Modeling Environment) for modeling and analysis using queueing Petri nets. QPME provides an Eclipse-based editor for building queueing Petri net models and a powerful simulation engine for analyzing these models. The development of the tool started in 2003 and since then the tool has been distributed to more than 120 organizations worldwide.\n
\n','
\n@inproceedings{SpKoMe2012-PETRINETS-QPME,\n  abstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present our tool QPME (Queueing Petri net Modeling Environment) for modeling and analysis using queueing Petri nets. QPME provides an Eclipse-based editor for building queueing Petri net models and a powerful simulation engine for analyzing these models. The development of the tool started in 2003 and since then the tool has been distributed to more than 120 organizations worldwide.},\n  address = {Berlin, Heidelberg},\n  author = {Simon Spinner and Samuel Kounev and Philipp Meier},\n  booktitle = {Proceedings of the 33rd International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2012)},\n  day = {27--29},\n  editor = {Haddad, Serge and Pomello, Lucia},\n  isbn = {978-3-642-31130-7},\n  location = {Hamburg, Germany},\n  month = {June},\n  pages = {388--397},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/590.pdf},\n  publisher = {Springer-Verlag},\n  series = {Lecture Notes in Computer Science (LNCS)},\n  title = {{Stochastic Modeling and Analysis using QPME: Queueing Petri Net Modeling Environment v2.0}},\n  url = {http://dx.doi.org/10.1007/978-3-642-31131-4_21},\n  volume = {7347},\n  year = {2012}\n}\n
\n\n','Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present our tool QPME (Queueing Petri net Modeling Environment) for modeling and analysis using queueing Petri nets. QPME provides an Eclipse-based editor for building queueing Petri net models and a powerful simulation engine for analyzing these models. The development of the tool started in 2003 and since then the tool has been distributed to more than 120 organizations worldwide.','{Stochastic Modeling and Analysis using QPME: Queueing Petri Net Modeling Environment v2.0}',0,6,2012,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(596,'paper','theilmann2010a','incollection','@incollection{theilmann2010a,\n address = {Hershey, PA, USA},\n author = {Wolfgang Theilmann and Sergio Garcia Gomez and John Kennedy and Davide Lorenzoli and Christoph Rathfelder and Thomas Roeblitz and Gabriele Zacco},\n booktitle = {{Handbook of Research on Service-Oriented Systems and Non-Functional Properties: Future Directions}},\n editor = {Stephan Reiff-Marganiec and Marcel Tilly},\n pages = {470--490},\n publisher = {IGI Global},\n title = {{A} {F}ramework for {M}ulti-level {SLA} {M}anagement},\n url = {http://www.igi-global.com/book/handbook-research-service-oriented-systems/55308},\n year = {2012},\n}\n\n','\n\nWolfgang Theilmann, Sergio Garcia Gomez, John Kennedy, Davide Lorenzoli,\nChristoph Rathfelder, Thomas Roeblitz, and Gabriele Zacco.\nA Framework for Multi-level SLA Management.\nIn Handbook of Research on Service-Oriented Systems and\nNon-Functional Properties: Future Directions, Stephan Reiff-Marganiec and\nMarcel Tilly, editors, pages 470-490. IGI Global, Hershey, PA, USA, 2012.\n[ bib | http  ] 
\n@incollection{theilmann2010a,\naddress = {Hershey, PA, USA},\nauthor = {Wolfgang Theilmann and Sergio Garcia Gomez and John Kennedy and Davide Lorenzoli and Christoph Rathfelder and Thomas Roeblitz and Gabriele Zacco},\nbooktitle = {{Handbook of Research on Service-Oriented Systems and Non-Functional Properties: Future Directions}},\neditor = {Stephan Reiff-Marganiec and Marcel Tilly},\npages = {470--490},\npublisher = {IGI Global},\ntitle = {{A} {F}ramework for {M}ulti-level {SLA} {M}anagement},\nurl = {http://www.igi-global.com/book/handbook-research-service-oriented-systems/55308},\nyear = {2012}\n}\n
\n
\n','
\n@incollection{theilmann2010a,\n  address = {Hershey, PA, USA},\n  author = {Wolfgang Theilmann and Sergio Garcia Gomez and John Kennedy and Davide Lorenzoli and Christoph Rathfelder and Thomas Roeblitz and Gabriele Zacco},\n  booktitle = {{Handbook of Research on Service-Oriented Systems and Non-Functional Properties: Future Directions}},\n  editor = {Stephan Reiff-Marganiec and Marcel Tilly},\n  pages = {470--490},\n  publisher = {IGI Global},\n  title = {{A} {F}ramework for {M}ulti-level {SLA} {M}anagement},\n  url = {http://www.igi-global.com/book/handbook-research-service-oriented-systems/55308},\n  year = {2012}\n}\n
\n\n',NULL,'{A} {F}ramework for {M}ulti-level {SLA} {M}anagement',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(597,'paper','Thomas20111','proceedings','@proceedings{Thomas20111,\n title = {Fifth International Workshop on the Practical Application of Stochastic Modelling (PASM)},\n editor = {Nigel Thomas and Jeremy Bradley and William Knottenbelt and Samuel Kounev and Nikolaus Huber and Fabian Brosig},\n volume = {275},\n series = {Electronic Notes in Theoretical Computer Science},\n address = {Amsterdam, The Netherlands},\n month = {September},\n issn = {1571-0661},\n pages = {1--174},\n publisher = {Elsevier Science Publishers B. V.},\n doi = {10.1016/j.entcs.2011.09.001},\n year = {2011},\n pages = {1--174},\n}\n\n','\n\nNigel Thomas, Jeremy Bradley, William Knottenbelt, Samuel Kounev, Nikolaus\nHuber, and Fabian Brosig, editors.\nFifth International Workshop on the Practical Application of\nStochastic Modelling (PASM), volume 275 of Electronic Notes in\nTheoretical Computer Science, Amsterdam, The Netherlands, September 2011.\nElsevier Science Publishers B. V.\n[ bib | DOI  ] 
\n@proceedings{Thomas20111,\ntitle = {Fifth International Workshop on the Practical Application of Stochastic Modelling (PASM)},\neditor = {Nigel Thomas and Jeremy Bradley and William Knottenbelt and Samuel Kounev and Nikolaus Huber and Fabian Brosig},\nvolume = {275},\nseries = {Electronic Notes in Theoretical Computer Science},\naddress = {Amsterdam, The Netherlands},\nmonth = {September},\nissn = {1571-0661},\npages = {1--174},\npublisher = {Elsevier Science Publishers B. V.},\ndoi = {10.1016/j.entcs.2011.09.001},\nyear = {2011},\npages = {1--174}\n}\n
\n
\n','
\n@proceedings{Thomas20111,\n  title = {Fifth International Workshop on the Practical Application of Stochastic Modelling (PASM)},\n  editor = {Nigel Thomas and Jeremy Bradley and William Knottenbelt and Samuel Kounev and Nikolaus Huber and Fabian Brosig},\n  volume = {275},\n  series = {Electronic Notes in Theoretical Computer Science},\n  address = {Amsterdam, The Netherlands},\n  month = {September},\n  issn = {1571-0661},\n  pages = {1--174},\n  publisher = {Elsevier Science Publishers B. V.},\n  doi = {10.1016/j.entcs.2011.09.001},\n  year = {2011},\n  pages = {1--174}\n}\n
\n\n',NULL,'Fifth International Workshop on the Practical Application of Stochastic Modelling (PASM)',0,9,2011,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0); -INSERT INTO `Entry` VALUES (606,'paper','VaNoKoRe2013-EPEW-IndustrialCaseStudySystemz','incollection','@incollection{VaNoKoRe2013-EPEW-IndustrialCaseStudySystemz,\n author = {Vaupel, Robert and Noorshams, Qais and Kounev, Samuel and Reussner, Ralf},\n booktitle = {Computer Performance Engineering, Proceedings of the 10th European Performance Engineering Workshop (EPEW 2013), Venice, Italy},\n doi = {10.1007/978-3-642-40725-3_20},\n editor = {Balsamo, Maria Simonetta and Knottenbelt, William J. and Marin, Andrea},\n isbn = {978-3-642-40724-6},\n keywords = {Business Transactions; Performance; Prediction},\n pages = {263-275},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/606.pdf},\n publisher = {Springer Berlin Heidelberg},\n series = {Lecture Notes in Computer Science (LNCS)},\n title = {{Using Queuing Models for Large System Migration Scenarios -- An Industrial Case Study with IBM System z}},\n url = {http://dx.doi.org/10.1007/978-3-642-40725-3_20},\n volume = {8168},\n year = {2013},\n month = {September},\n day = {16--17},\n}\n\n','\n\nRobert Vaupel, Qais Noorshams, Samuel Kounev, and Ralf Reussner.\nUsing Queuing Models for Large System Migration Scenarios - An\nIndustrial Case Study with IBM System z.\nIn Computer Performance Engineering, Proceedings of the 10th\nEuropean Performance Engineering Workshop (EPEW 2013), Venice, Italy,\nMaria Simonetta Balsamo, William J. Knottenbelt, and Andrea Marin, editors,\nvolume 8168 of Lecture Notes in Computer Science (LNCS), pages\n263-275. Springer Berlin Heidelberg, September 2013.\n[ bib | DOI | http | .pdf  ] 
\n@incollection{VaNoKoRe2013-EPEW-IndustrialCaseStudySystemz,\nauthor = {Vaupel, Robert and Noorshams, Qais and Kounev, Samuel and Reussner, Ralf},\nbooktitle = {Computer Performance Engineering, Proceedings of the 10th European Performance Engineering Workshop (EPEW 2013), Venice, Italy},\ndoi = {10.1007/978-3-642-40725-3_20},\neditor = {Balsamo, Maria Simonetta and Knottenbelt, William J. and Marin, Andrea},\nisbn = {978-3-642-40724-6},\nkeywords = {Business Transactions; Performance; Prediction},\npages = {263-275},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/606.pdf},\npublisher = {Springer Berlin Heidelberg},\nseries = {Lecture Notes in Computer Science (LNCS)},\ntitle = {{Using Queuing Models for Large System Migration Scenarios -- An Industrial Case Study with IBM System z}},\nurl = {http://dx.doi.org/10.1007/978-3-642-40725-3_20},\nvolume = {8168},\nyear = {2013},\nmonth = {September},\nday = {16--17}\n}\n
\n
\n','
\n@incollection{VaNoKoRe2013-EPEW-IndustrialCaseStudySystemz,\n  author = {Vaupel, Robert and Noorshams, Qais and Kounev, Samuel and Reussner, Ralf},\n  booktitle = {Computer Performance Engineering, Proceedings of the 10th European Performance Engineering Workshop (EPEW 2013), Venice, Italy},\n  doi = {10.1007/978-3-642-40725-3_20},\n  editor = {Balsamo, Maria Simonetta and Knottenbelt, William J. and Marin, Andrea},\n  isbn = {978-3-642-40724-6},\n  keywords = {Business Transactions; Performance; Prediction},\n  pages = {263-275},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/606.pdf},\n  publisher = {Springer Berlin Heidelberg},\n  series = {Lecture Notes in Computer Science (LNCS)},\n  title = {{Using Queuing Models for Large System Migration Scenarios -- An Industrial Case Study with IBM System z}},\n  url = {http://dx.doi.org/10.1007/978-3-642-40725-3_20},\n  volume = {8168},\n  year = {2013},\n  month = {September},\n  day = {16--17}\n}\n
\n\n',NULL,'{Using Queuing Models for Large System Migration Scenarios -- An Industrial Case Study with IBM System z}',0,9,2013,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(615,'paper','ViMaSaKo2012-ResBook-ResilBenchmark','incollection','@incollection{ViMaSaKo2012-ResBook-ResilBenchmark,\n address = {Berlin, Heidelberg},\n author = {Marco Vieira and Henrique Madeira and Kai Sachs and Samuel Kounev},\n booktitle = {{Resilience Assessment and Evaluation of Computing Systems}},\n editor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\n isbn = {978-3-642-29031-2},\n note = {ISBN: 978-3-642-29031-2},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/615.pdf},\n publisher = {Springer-Verlag},\n series = {XVIII},\n title = {{Resilience Benchmarking}},\n url = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\n year = {2012},\n}\n\n','\n\nMarco Vieira, Henrique Madeira, Kai Sachs, and Samuel Kounev.\nResilience Benchmarking.\nIn Resilience Assessment and Evaluation of Computing Systems,\nK. Wolter, A. Avritzer, M. Vieira, and A. van Moorsel, editors, XVIII.\nSpringer-Verlag, Berlin, Heidelberg, 2012.\nISBN: 978-3-642-29031-2.\n[ bib | http | .pdf  ] 
\n@incollection{ViMaSaKo2012-ResBook-ResilBenchmark,\naddress = {Berlin, Heidelberg},\nauthor = {Marco Vieira and Henrique Madeira and Kai Sachs and Samuel Kounev},\nbooktitle = {{Resilience Assessment and Evaluation of Computing Systems}},\neditor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\nisbn = {978-3-642-29031-2},\nnote = {ISBN: 978-3-642-29031-2},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/615.pdf},\npublisher = {Springer-Verlag},\nseries = {XVIII},\ntitle = {{Resilience Benchmarking}},\nurl = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\nyear = {2012}\n}\n
\n
\n','
\n@incollection{ViMaSaKo2012-ResBook-ResilBenchmark,\n  address = {Berlin, Heidelberg},\n  author = {Marco Vieira and Henrique Madeira and Kai Sachs and Samuel Kounev},\n  booktitle = {{Resilience Assessment and Evaluation of Computing Systems}},\n  editor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\n  isbn = {978-3-642-29031-2},\n  note = {ISBN: 978-3-642-29031-2},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/615.pdf},\n  publisher = {Springer-Verlag},\n  series = {XVIII},\n  title = {{Resilience Benchmarking}},\n  url = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\n  year = {2012}\n}\n
\n\n',NULL,'{Resilience Benchmarking}',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(629,'paper','westermann2012b','inproceedings','@inproceedings{westermann2012b,\n author = {Dennis Westermann and Jens Happe and Rouven Krebs and Roozbeh Farahbod},\n booktitle = {Proceedings of the 27th IEEE/ACM International Conference On Automated Software Engineering (ASE 2012)},\n day = {3--7},\n location = {Essen, Germany},\n month = {September},\n title = {Automated Inference of Goal-oriented Performance Prediction Functions},\n year = {2012},\n}\n\n','\n\nDennis Westermann, Jens Happe, Rouven Krebs, and Roozbeh Farahbod.\nAutomated inference of goal-oriented performance prediction\nfunctions.\nIn Proceedings of the 27th IEEE/ACM International Conference On\nAutomated Software Engineering (ASE 2012), Essen, Germany, September 3-7,\n2012.\n[ bib  ] 
\n@inproceedings{westermann2012b,\nauthor = {Dennis Westermann and Jens Happe and Rouven Krebs and Roozbeh Farahbod},\nbooktitle = {Proceedings of the 27th IEEE/ACM International Conference On Automated Software Engineering (ASE 2012)},\nday = {3--7},\nlocation = {Essen, Germany},\nmonth = {September},\ntitle = {Automated Inference of Goal-oriented Performance Prediction Functions},\nyear = {2012}\n}\n
\n
\n','
\n@inproceedings{westermann2012b,\n  author = {Dennis Westermann and Jens Happe and Rouven Krebs and Roozbeh Farahbod},\n  booktitle = {Proceedings of the 27th IEEE/ACM International Conference On Automated Software Engineering (ASE 2012)},\n  day = {3--7},\n  location = {Essen, Germany},\n  month = {September},\n  title = {Automated Inference of Goal-oriented Performance Prediction Functions},\n  year = {2012}\n}\n
\n\n',NULL,'Automated Inference of Goal-oriented Performance Prediction Functions',0,9,2012,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(639,'paper','DBLP-conf-wosp-2011','proceedings','@proceedings{DBLP-conf-wosp-2011,\n address = {New York, NY, USA},\n editor = {Samuel Kounev and Vittorio Cortellessa and Raffaela Mirandola and David J. Lilja},\n isbn = {978-1-4503-0519-8},\n month = {March},\n publisher = {ACM},\n title = {ICPE\'11 - 2nd Joint ACM/SPEC International Conference on Performance Engineering, Karlsruhe, Germany, March 14--16, 2011},\n year = {2011},\n}\n\n','\n\nSamuel Kounev, Vittorio Cortellessa, Raffaela Mirandola, and David J. Lilja,\neditors.\nICPE\'11 - 2nd Joint ACM/SPEC International Conference on\nPerformance Engineering, Karlsruhe, Germany, March 14-16, 2011, New York,\nNY, USA, March 2011. ACM.\n[ bib  ] 
\n@proceedings{DBLP-conf-wosp-2011,\naddress = {New York, NY, USA},\neditor = {Samuel Kounev and Vittorio Cortellessa and Raffaela Mirandola and David J. Lilja},\nisbn = {978-1-4503-0519-8},\nmonth = {March},\npublisher = {ACM},\ntitle = {ICPE\'11 - 2nd Joint ACM/SPEC International Conference on Performance Engineering, Karlsruhe, Germany, March 14--16, 2011},\nyear = {2011}\n}\n
\n
\n','
\n@proceedings{DBLP-conf-wosp-2011,\n  address = {New York, NY, USA},\n  editor = {Samuel Kounev and Vittorio Cortellessa and Raffaela Mirandola and David J. Lilja},\n  isbn = {978-1-4503-0519-8},\n  month = {March},\n  publisher = {ACM},\n  title = {ICPE\'11 - 2nd Joint ACM/SPEC International Conference on Performance Engineering, Karlsruhe, Germany, March 14--16, 2011},\n  year = {2011}\n}\n
\n\n',NULL,'ICPE\'11 - 2nd Joint ACM/SPEC International Conference on Performance Engineering, Karlsruhe, Germany, March 14--16, 2011',0,3,2011,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(640,'paper','kounev2008c','proceedings','@proceedings{kounev2008c,\n abstract = {This book constitutes the refereed proceedings of the SPEC International Performance Evaluation Workshop, SIPEW 2008, held in Darmstadt, Germany, in June 2008. The 17 revised full papers presented together with 3 keynote talks were carefully reviewed and selected out of 39 submissions for inclusion in the book. The papers are organized in topical sections on models for software performance engineering; benchmarks and workload characterization; Web services and service-oriented architectures; power and performance; and profiling, monitoring and optimization.},\n address = {Heidelberg, Germany},\n editor = {Samuel Kounev and Ian Gorton and Kai Sachs},\n isbn = {978-3-540-69813-5},\n month = {June},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science (LNCS)},\n title = {{Performance Evaluation: Metrics, Models and Benchmarks, Proceedings of the 2008 SPEC International Performance Evaluation Workshop (SIPEW 2008), Darmstadt, Germany, June 27-28}},\n url = {http://www.springer.com/computer/programming/book/978-3-540-69813-5},\n volume = {5119},\n year = {2008},\n}\n\n','\n\nSamuel Kounev, Ian Gorton, and Kai Sachs, editors.\nPerformance Evaluation: Metrics, Models and Benchmarks,\nProceedings of the 2008 SPEC International Performance Evaluation Workshop\n(SIPEW 2008), Darmstadt, Germany, June 27-28, volume 5119 of Lecture\nNotes in Computer Science (LNCS), Heidelberg, Germany, June 2008. Springer.\n[ bib | http | Abstract  ] 
\n@proceedings{kounev2008c,\nabstract = {This book constitutes the refereed proceedings of the SPEC International Performance Evaluation Workshop, SIPEW 2008, held in Darmstadt, Germany, in June 2008. The 17 revised full papers presented together with 3 keynote talks were carefully reviewed and selected out of 39 submissions for inclusion in the book. The papers are organized in topical sections on models for software performance engineering; benchmarks and workload characterization; Web services and service-oriented architectures; power and performance; and profiling, monitoring and optimization.},\naddress = {Heidelberg, Germany},\neditor = {Samuel Kounev and Ian Gorton and Kai Sachs},\nisbn = {978-3-540-69813-5},\nmonth = {June},\npublisher = {Springer},\nseries = {Lecture Notes in Computer Science (LNCS)},\ntitle = {{Performance Evaluation: Metrics, Models and Benchmarks, Proceedings of the 2008 SPEC International Performance Evaluation Workshop (SIPEW 2008), Darmstadt, Germany, June 27-28}},\nurl = {http://www.springer.com/computer/programming/book/978-3-540-69813-5},\nvolume = {5119},\nyear = {2008}\n}\n
\n
\nThis book constitutes the refereed proceedings of the SPEC International Performance Evaluation Workshop, SIPEW 2008, held in Darmstadt, Germany, in June 2008. The 17 revised full papers presented together with 3 keynote talks were carefully reviewed and selected out of 39 submissions for inclusion in the book. The papers are organized in topical sections on models for software performance engineering; benchmarks and workload characterization; Web services and service-oriented architectures; power and performance; and profiling, monitoring and optimization.\n
\n','
\n@proceedings{kounev2008c,\n  abstract = {This book constitutes the refereed proceedings of the SPEC International Performance Evaluation Workshop, SIPEW 2008, held in Darmstadt, Germany, in June 2008. The 17 revised full papers presented together with 3 keynote talks were carefully reviewed and selected out of 39 submissions for inclusion in the book. The papers are organized in topical sections on models for software performance engineering; benchmarks and workload characterization; Web services and service-oriented architectures; power and performance; and profiling, monitoring and optimization.},\n  address = {Heidelberg, Germany},\n  editor = {Samuel Kounev and Ian Gorton and Kai Sachs},\n  isbn = {978-3-540-69813-5},\n  month = {June},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science (LNCS)},\n  title = {{Performance Evaluation: Metrics, Models and Benchmarks, Proceedings of the 2008 SPEC International Performance Evaluation Workshop (SIPEW 2008), Darmstadt, Germany, June 27-28}},\n  url = {http://www.springer.com/computer/programming/book/978-3-540-69813-5},\n  volume = {5119},\n  year = {2008}\n}\n
\n\n','This book constitutes the refereed proceedings of the SPEC International Performance Evaluation Workshop, SIPEW 2008, held in Darmstadt, Germany, in June 2008. The 17 revised full papers presented together with 3 keynote talks were carefully reviewed and selected out of 39 submissions for inclusion in the book. The papers are organized in topical sections on models for software performance engineering; benchmarks and workload characterization; Web services and service-oriented architectures; power and performance; and profiling, monitoring and optimization.','{Performance Evaluation: Metrics, Models and Benchmarks, Proceedings of the 2008 SPEC International Performance Evaluation Workshop (SIPEW 2008), Darmstadt, Germany, June 27-28}',0,6,2008,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(641,'paper','KoZsSa2013-HOTTOPICS-Proceedings','proceedings','@proceedings{KoZsSa2013-HOTTOPICS-Proceedings,\n day = {20--21},\n editor = {Samuel Kounev and Steffen Zschaler and Kai Sachs},\n location = {Prague, Czech Republic},\n month = {April},\n publisher = {ACM},\n title = {Proceedings of the 2013 International Workshop on Hot Topics in Cloud Services (HotTopiCS 2013)},\n year = {2013},\n}\n\n','\n\nSamuel Kounev, Steffen Zschaler, and Kai Sachs, editors.\nProceedings of the 2013 International Workshop on Hot Topics in\nCloud Services (HotTopiCS 2013). ACM, April 2013.\n[ bib  ] 
\n@proceedings{KoZsSa2013-HOTTOPICS-Proceedings,\nday = {20--21},\neditor = {Samuel Kounev and Steffen Zschaler and Kai Sachs},\nlocation = {Prague, Czech Republic},\nmonth = {April},\npublisher = {ACM},\ntitle = {Proceedings of the 2013 International Workshop on Hot Topics in Cloud Services (HotTopiCS 2013)},\nyear = {2013}\n}\n
\n
\n','
\n@proceedings{KoZsSa2013-HOTTOPICS-Proceedings,\n  day = {20--21},\n  editor = {Samuel Kounev and Steffen Zschaler and Kai Sachs},\n  location = {Prague, Czech Republic},\n  month = {April},\n  publisher = {ACM},\n  title = {Proceedings of the 2013 International Workshop on Hot Topics in Cloud Services (HotTopiCS 2013)},\n  year = {2013}\n}\n
\n\n',NULL,'Proceedings of the 2013 International Workshop on Hot Topics in Cloud Services (HotTopiCS 2013)',0,4,2013,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(642,'paper','PaKo2010-KIT-YoungInformatics','proceedings','@proceedings{PaKo2010-KIT-YoungInformatics,\n address = {Karlsruhe, Germany},\n editor = {Victor Pankratius and Samuel Kounev},\n month = {July},\n note = {ISBN: 978-3-86644-508-6},\n publisher = {KIT Scientific Publishing},\n title = {{Emerging Research Directions in Computer Science. Contributions from the Young Informatics Faculty in Karlsruhe}},\n url = {http://uvka.ubka.uni-karlsruhe.de/shop/isbn/978-3-86644-508-6},\n year = {2010},\n}\n\n','\n\nVictor Pankratius and Samuel Kounev, editors.\nEmerging Research Directions in Computer Science. Contributions\nfrom the Young Informatics Faculty in Karlsruhe, Karlsruhe, Germany, July\n2010. KIT Scientific Publishing.\nISBN: 978-3-86644-508-6.\n[ bib | http  ] 
\n@proceedings{PaKo2010-KIT-YoungInformatics,\naddress = {Karlsruhe, Germany},\neditor = {Victor Pankratius and Samuel Kounev},\nmonth = {July},\nnote = {ISBN: 978-3-86644-508-6},\npublisher = {KIT Scientific Publishing},\ntitle = {{Emerging Research Directions in Computer Science. Contributions from the Young Informatics Faculty in Karlsruhe}},\nurl = {http://uvka.ubka.uni-karlsruhe.de/shop/isbn/978-3-86644-508-6},\nyear = {2010}\n}\n
\n
\n','
\n@proceedings{PaKo2010-KIT-YoungInformatics,\n  address = {Karlsruhe, Germany},\n  editor = {Victor Pankratius and Samuel Kounev},\n  month = {July},\n  note = {ISBN: 978-3-86644-508-6},\n  publisher = {KIT Scientific Publishing},\n  title = {{Emerging Research Directions in Computer Science. Contributions from the Young Informatics Faculty in Karlsruhe}},\n  url = {http://uvka.ubka.uni-karlsruhe.de/shop/isbn/978-3-86644-508-6},\n  year = {2010}\n}\n
\n\n',NULL,'{Emerging Research Directions in Computer Science. Contributions from the Young Informatics Faculty in Karlsruhe}',0,7,2010,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(646,'paper','KrMoKo2013-SciCo-MetricsAndTechniquesForPerformanceIsolation','article','@article{KrMoKo2013-SciCo-MetricsAndTechniquesForPerformanceIsolation,\n author = {Rouven Krebs and Christof Momm and Samuel Kounev},\n journal = {Elsevier Science of Computer Programming Journal (SciCo)},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/646.pdf},\n publisher = {Elsevier B.V.},\n title = {{Metrics and Techniques for Quantifying Performance Isolation in Cloud Environments}},\n year = {2014},\n volume = {Vol. 90, Part B},\n pages = {116--134},\n month = {February},\n}\n\n','\n\nRouven Krebs, Christof Momm, and Samuel Kounev.\nMetrics and Techniques for Quantifying Performance Isolation in\nCloud Environments.\nElsevier Science of Computer Programming Journal (SciCo), Vol.\n90, Part B:116-134, February 2014, Elsevier B.V.\n[ bib | .pdf  ] 
\n@article{KrMoKo2013-SciCo-MetricsAndTechniquesForPerformanceIsolation,\nauthor = {Rouven Krebs and Christof Momm and Samuel Kounev},\njournal = {Elsevier Science of Computer Programming Journal (SciCo)},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/646.pdf},\npublisher = {Elsevier B.V.},\ntitle = {{Metrics and Techniques for Quantifying Performance Isolation in Cloud Environments}},\nyear = {2014},\nvolume = {Vol. 90, Part B},\npages = {116--134},\nmonth = {February}\n}\n
\n
\n','
\n@article{KrMoKo2013-SciCo-MetricsAndTechniquesForPerformanceIsolation,\n  author = {Rouven Krebs and Christof Momm and Samuel Kounev},\n  journal = {Elsevier Science of Computer Programming Journal (SciCo)},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/646.pdf},\n  publisher = {Elsevier B.V.},\n  title = {{Metrics and Techniques for Quantifying Performance Isolation in Cloud Environments}},\n  year = {2014},\n  volume = {Vol. 90, Part B},\n  pages = {116--134},\n  month = {February}\n}\n
\n\n',NULL,'{Metrics and Techniques for Quantifying Performance Isolation in Cloud Environments}',0,2,2014,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(649,'paper','BrHuKo2013-SciCo-SoftwarePerformanceAbstractions','article','@article{BrHuKo2013-SciCo-SoftwarePerformanceAbstractions,\n author = {Fabian Brosig and Nikolaus Huber and Samuel Kounev},\n doi = {10.1016/j.scico.2013.06.004},\n journal = {Elsevier Science of Computer Programming Journal (SciCo)},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/649.pdf},\n publisher = {Elsevier},\n volume = {Vol. 90, Part B},\n pages = {71--92},\n title = {{Architecture-Level Software Performance Abstractions for Online Performance Prediction}},\n url = {http://authors.elsevier.com/sd/article/S0167642313001421},\n year = {2014},\n month = {September},\n}\n\n','\n\nFabian Brosig, Nikolaus Huber, and Samuel Kounev.\nArchitecture-Level Software Performance Abstractions for Online\nPerformance Prediction.\nElsevier Science of Computer Programming Journal (SciCo), Vol.\n90, Part B:71-92, September 2014, Elsevier.\n[ bib | DOI | http | .pdf  ] 
\n@article{BrHuKo2013-SciCo-SoftwarePerformanceAbstractions,\nauthor = {Fabian Brosig and Nikolaus Huber and Samuel Kounev},\ndoi = {10.1016/j.scico.2013.06.004},\njournal = {Elsevier Science of Computer Programming Journal (SciCo)},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/649.pdf},\npublisher = {Elsevier},\nvolume = {Vol. 90, Part B},\npages = {71--92},\ntitle = {{Architecture-Level Software Performance Abstractions for Online Performance Prediction}},\nurl = {http://authors.elsevier.com/sd/article/S0167642313001421},\nyear = {2014},\nmonth = {September}\n}\n
\n
\n','
\n@article{BrHuKo2013-SciCo-SoftwarePerformanceAbstractions,\n  author = {Fabian Brosig and Nikolaus Huber and Samuel Kounev},\n  doi = {10.1016/j.scico.2013.06.004},\n  journal = {Elsevier Science of Computer Programming Journal (SciCo)},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/649.pdf},\n  publisher = {Elsevier},\n  volume = {Vol. 90, Part B},\n  pages = {71--92},\n  title = {{Architecture-Level Software Performance Abstractions for Online Performance Prediction}},\n  url = {http://authors.elsevier.com/sd/article/S0167642313001421},\n  year = {2014},\n  month = {September}\n}\n
\n\n',NULL,'{Architecture-Level Software Performance Abstractions for Online Performance Prediction}',0,9,2014,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(651,'paper','BrGoHuKo2013-MASCOTS-EvaluationApproachesForPerformancePredictionInVirtualizedEnvironments','inproceedings','@inproceedings{BrGoHuKo2013-MASCOTS-EvaluationApproachesForPerformancePredictionInVirtualizedEnvironments,\n author = {Fabian Brosig and Fabian Gorsler and Nikolaus Huber and Samuel Kounev},\n booktitle = {Proceedings of the IEEE 21st International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2013)},\n day = {14--16},\n location = {San Francisco, USA},\n month = {August},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/651.pdf},\n title = {{Evaluating Approaches for Performance Prediction in Virtualized Environments}},\n titleaddon = {{(Short Paper)}},\n year = {2013},\n}\n\n','\n\nFabian Brosig, Fabian Gorsler, Nikolaus Huber, and Samuel Kounev.\nEvaluating Approaches for Performance Prediction in Virtualized\nEnvironments (Short Paper).\nIn Proceedings of the IEEE 21st International Symposium on\nModeling, Analysis and Simulation of Computer and Telecommunication Systems\n(MASCOTS 2013), San Francisco, USA, August 14-16, 2013.\n[ bib | .pdf  ] 
\n@inproceedings{BrGoHuKo2013-MASCOTS-EvaluationApproachesForPerformancePredictionInVirtualizedEnvironments,\nauthor = {Fabian Brosig and Fabian Gorsler and Nikolaus Huber and Samuel Kounev},\nbooktitle = {Proceedings of the IEEE 21st International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2013)},\nday = {14--16},\nlocation = {San Francisco, USA},\nmonth = {August},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/651.pdf},\ntitle = {{Evaluating Approaches for Performance Prediction in Virtualized Environments}},\ntitleaddon = {{(Short Paper)}},\nyear = {2013}\n}\n
\n
\n','
\n@inproceedings{BrGoHuKo2013-MASCOTS-EvaluationApproachesForPerformancePredictionInVirtualizedEnvironments,\n  author = {Fabian Brosig and Fabian Gorsler and Nikolaus Huber and Samuel Kounev},\n  booktitle = {Proceedings of the IEEE 21st International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2013)},\n  day = {14--16},\n  location = {San Francisco, USA},\n  month = {August},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/651.pdf},\n  title = {{Evaluating Approaches for Performance Prediction in Virtualized Environments}},\n  titleaddon = {{(Short Paper)}},\n  year = {2013}\n}\n
\n\n',NULL,'{Evaluating Approaches for Performance Prediction in Virtualized Environments}',0,8,2013,8,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(663,'paper','HuHoKoBrKo2014-SOCA-ModelingRuntimeAdaptation','article','@article{HuHoKoBrKo2014-SOCA-ModelingRuntimeAdaptation,\n author = {Nikolaus Huber and Andr\\\'{e} van Hoorn and Anne Koziolek and Fabian Brosig and Samuel Kounev},\n doi = {10.1007/s11761-013-0144-4},\n journal = {Service Oriented Computing and Applications Journal (SOCA)},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/663.pdf},\n publisher = {Springer-Verlag},\n title = {{Modeling Run-Time Adaptation at the System Architecture Level in Dynamic Service-Oriented Environments}},\n volume = {8},\n number = {1},\n pages = {73--89},\n year = {2014},\n month = {{March}},\n}\n\n','\n\nNikolaus Huber, André van Hoorn, Anne Koziolek, Fabian Brosig, and Samuel\nKounev.\nModeling Run-Time Adaptation at the System Architecture Level in\nDynamic Service-Oriented Environments.\nService Oriented Computing and Applications Journal (SOCA),\n8(1):73-89, March 2014, Springer-Verlag.\n[ bib | DOI | .pdf  ] 
\n@article{HuHoKoBrKo2014-SOCA-ModelingRuntimeAdaptation,\nauthor = {Nikolaus Huber and Andr\\\'{e} van Hoorn and Anne Koziolek and Fabian Brosig and Samuel Kounev},\ndoi = {10.1007/s11761-013-0144-4},\njournal = {Service Oriented Computing and Applications Journal (SOCA)},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/663.pdf},\npublisher = {Springer-Verlag},\ntitle = {{Modeling Run-Time Adaptation at the System Architecture Level in Dynamic Service-Oriented Environments}},\nvolume = {8},\nnumber = {1},\npages = {73--89},\nyear = {2014},\nmonth = {{March}}\n}\n
\n
\n','
\n@article{HuHoKoBrKo2014-SOCA-ModelingRuntimeAdaptation,\n  author = {Nikolaus Huber and Andr\\\'{e} van Hoorn and Anne Koziolek and Fabian Brosig and Samuel Kounev},\n  doi = {10.1007/s11761-013-0144-4},\n  journal = {Service Oriented Computing and Applications Journal (SOCA)},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/663.pdf},\n  publisher = {Springer-Verlag},\n  title = {{Modeling Run-Time Adaptation at the System Architecture Level in Dynamic Service-Oriented Environments}},\n  volume = {8},\n  number = {1},\n  pages = {73--89},\n  year = {2014},\n  month = {{March}}\n}\n
\n\n',NULL,'{Modeling Run-Time Adaptation at the System Architecture Level in Dynamic Service-Oriented Environments}',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(664,'paper','RyPs2010-ICSS-GF','incollection','@incollection{RyPs2010-ICSS-GF,\n address = {ul. Maszynowa 5/9, 02-392 Warszawa, Poland},\n author = {Piotr Rygielski and Pawe\\l{} \\\'Swi\\k{a}tek},\n booktitle = {Applications of Systems Science},\n editor = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Krzysztof Brzostowski},\n month = {September},\n note = {Most Promising Student Paper Award},\n pages = {217--226},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/664.pdf},\n publisher = {Exit},\n title = {{Optimal Complex Services Composition in SOA Systems}},\n year = {2010},\n abstract = {One of the most important tasks in service oriented architecture paradigm based systems is the task of composition of the complex service. Aim of this paper is to focus on the very last phase of the composition process, where proper atomic service versions are picked to execute the whole complex service. An exact algorithm is proposed in this paper solving two tasks based on popular quality of service delivery approaches: best-effort and differentiated services. The procedure of graph reduction has been introduced to generate space of possible solutions in such way that decision is made in more efficient way. The graph-fold algorithm was tested in simulation environment where its performance was compared to five reference algorithms. Moreover ability to deliver quality at desired level has been tested.},\n}\n\n','\n\nPiotr Rygielski and Pawel Świątek.\nOptimal Complex Services Composition in SOA Systems.\nIn Applications of Systems Science, Adam Grzech, Pawel\nŚwiątek, and Krzysztof Brzostowski, editors, pages 217-226. Exit, ul.\nMaszynowa 5/9, 02-392 Warszawa, Poland, September 2010.\nMost Promising Student Paper Award.\n[ bib | .pdf | Abstract  ] 
\n@incollection{RyPs2010-ICSS-GF,\naddress = {ul. Maszynowa 5/9, 02-392 Warszawa, Poland},\nauthor = {Piotr Rygielski and Pawe\\l{} \\\'Swi\\k{a}tek},\nbooktitle = {Applications of Systems Science},\neditor = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Krzysztof Brzostowski},\nmonth = {September},\nnote = {Most Promising Student Paper Award},\npages = {217--226},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/664.pdf},\npublisher = {Exit},\ntitle = {{Optimal Complex Services Composition in SOA Systems}},\nyear = {2010},\nabstract = {One of the most important tasks in service oriented architecture paradigm based systems is the task of composition of the complex service. Aim of this paper is to focus on the very last phase of the composition process, where proper atomic service versions are picked to execute the whole complex service. An exact algorithm is proposed in this paper solving two tasks based on popular quality of service delivery approaches: best-effort and differentiated services. The procedure of graph reduction has been introduced to generate space of possible solutions in such way that decision is made in more efficient way. The graph-fold algorithm was tested in simulation environment where its performance was compared to five reference algorithms. Moreover ability to deliver quality at desired level has been tested.}\n}\n
\n
\nOne of the most important tasks in service oriented architecture paradigm based systems is the task of composition of the complex service. Aim of this paper is to focus on the very last phase of the composition process, where proper atomic service versions are picked to execute the whole complex service. An exact algorithm is proposed in this paper solving two tasks based on popular quality of service delivery approaches: best-effort and differentiated services. The procedure of graph reduction has been introduced to generate space of possible solutions in such way that decision is made in more efficient way. The graph-fold algorithm was tested in simulation environment where its performance was compared to five reference algorithms. Moreover ability to deliver quality at desired level has been tested.\n
\n','
\n@incollection{RyPs2010-ICSS-GF,\n  address = {ul. Maszynowa 5/9, 02-392 Warszawa, Poland},\n  author = {Piotr Rygielski and Pawe\\l{} \\\'Swi\\k{a}tek},\n  booktitle = {Applications of Systems Science},\n  editor = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Krzysztof Brzostowski},\n  month = {September},\n  note = {Most Promising Student Paper Award},\n  pages = {217--226},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/664.pdf},\n  publisher = {Exit},\n  title = {{Optimal Complex Services Composition in SOA Systems}},\n  year = {2010},\n  abstract = {One of the most important tasks in service oriented architecture paradigm based systems is the task of composition of the complex service. Aim of this paper is to focus on the very last phase of the composition process, where proper atomic service versions are picked to execute the whole complex service. An exact algorithm is proposed in this paper solving two tasks based on popular quality of service delivery approaches: best-effort and differentiated services. The procedure of graph reduction has been introduced to generate space of possible solutions in such way that decision is made in more efficient way. The graph-fold algorithm was tested in simulation environment where its performance was compared to five reference algorithms. Moreover ability to deliver quality at desired level has been tested.}\n}\n
\n\n','One of the most important tasks in service oriented architecture paradigm based systems is the task of composition of the complex service. Aim of this paper is to focus on the very last phase of the composition process, where proper atomic service versions are picked to execute the whole complex service. An exact algorithm is proposed in this paper solving two tasks based on popular quality of service delivery approaches: best-effort and differentiated services. The procedure of graph reduction has been introduced to generate space of possible solutions in such way that decision is made in more efficient way. The graph-fold algorithm was tested in simulation environment where its performance was compared to five reference algorithms. Moreover ability to deliver quality at desired level has been tested.','{Optimal Complex Services Composition in SOA Systems}',0,9,2010,9,NULL,NULL,'SOA','0000-00-00 00:00:00','2016-06-01 09:41:00',0),(665,'paper','RyPs2010-ICSS-handover','incollection','@incollection{RyPs2010-ICSS-handover,\n address = {ul. Maszynowa 5/9, 02-392 Warszawa, Poland},\n author = {Piotr Rygielski and Pawe\\l{} \\\'Swi\\k{a}tek},\n booktitle = {Applications of Systems Science},\n editor = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Krzysztof Brzostowski},\n month = {September},\n pages = {227--236},\n publisher = {Exit},\n title = {{Wireless Network Management Through Network-Enforced Handover}},\n year = {2010},\n}\n\n','\n\nPiotr Rygielski and Pawel Świątek.\nWireless Network Management Through Network-Enforced Handover.\nIn Applications of Systems Science, Adam Grzech, Pawel\nŚwiątek, and Krzysztof Brzostowski, editors, pages 227-236. Exit, ul.\nMaszynowa 5/9, 02-392 Warszawa, Poland, September 2010.\n[ bib  ] 
\n@incollection{RyPs2010-ICSS-handover,\naddress = {ul. Maszynowa 5/9, 02-392 Warszawa, Poland},\nauthor = {Piotr Rygielski and Pawe\\l{} \\\'Swi\\k{a}tek},\nbooktitle = {Applications of Systems Science},\neditor = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Krzysztof Brzostowski},\nmonth = {September},\npages = {227--236},\npublisher = {Exit},\ntitle = {{Wireless Network Management Through Network-Enforced Handover}},\nyear = {2010}\n}\n
\n
\n','
\n@incollection{RyPs2010-ICSS-handover,\n  address = {ul. Maszynowa 5/9, 02-392 Warszawa, Poland},\n  author = {Piotr Rygielski and Pawe\\l{} \\\'Swi\\k{a}tek},\n  booktitle = {Applications of Systems Science},\n  editor = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Krzysztof Brzostowski},\n  month = {September},\n  pages = {227--236},\n  publisher = {Exit},\n  title = {{Wireless Network Management Through Network-Enforced Handover}},\n  year = {2010}\n}\n
\n\n',NULL,'{Wireless Network Management Through Network-Enforced Handover}',0,9,2010,9,NULL,NULL,'Networking; Resource Management; Simulation; QoS in Networks','0000-00-00 00:00:00','2016-06-01 09:41:00',0),(666,'paper','GrRySw2010-SOAbook','incollection','@incollection{GrRySw2010-SOAbook,\n address = {Pozna{\\\'n}, Poland},\n author = {Adam Grzech and Piotr Rygielski and Pawel \\\'{S}wi\\k{a}tek},\n booktitle = {SOA Infrastructure Tools: Concepts and Methods},\n editor = {Stanislaw Ambroszkiewicz and Jerzy Brzezi\\\'{n}ski and Wojciech Cellary and Adam Grzech and Krzysztof Zieli\\\"{n}ski},\n isbn = {978-83-7417-544-9},\n pages = {289--312},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/666.pdf},\n publisher = {Pozna{\\\'n} University of Economics Press},\n title = {{QoS-aware Complex Service Composition in SOA-based Systems}},\n year = {2010},\n abstract = {In this work, a method for the QoS-aware complex service composition in SOA-based systems is presented. The considered complex service composition process consists of three stages: complex service structure, scenario and plan composition. Complex service structure contains a set of required functionalities and precedence relations between them, and is derived directly from a service level agreement. Service scenario is derived from service structure by choosing the optimal (in the sense of certain quality criterion) order of execution of required functionalities. Finally, a service plan emerges from a scenario by choosing the best versions of atomic services for the delivery of required functionalities. For such distinguished composition process methods for complex service scenario and execution plan optimization are proposed. Optimization of a complex service scenario is based on the analysis of possible parallel executions of required functionalities. In order to deliver required level of the quality of service, well known QoS assurance models (i.e.: best effort, integrated services and differentiated services) are applied in the process of complex service execution plan optimization.},\n}\n\n','\n\nAdam Grzech, Piotr Rygielski, and Pawel Świątek.\nQoS-aware Complex Service Composition in SOA-based Systems.\nIn SOA Infrastructure Tools: Concepts and Methods, Stanislaw\nAmbroszkiewicz, Jerzy Brzeziński, Wojciech Cellary, Adam Grzech, and\nKrzysztof Zielinski, editors, pages 289-312. Poznań University of\nEconomics Press, Poznań, Poland, 2010.\n[ bib | .pdf | Abstract  ] 
\n@incollection{GrRySw2010-SOAbook,\naddress = {Pozna{\\\'n}, Poland},\nauthor = {Adam Grzech and Piotr Rygielski and Pawel \\\'{S}wi\\k{a}tek},\nbooktitle = {SOA Infrastructure Tools: Concepts and Methods},\neditor = {Stanislaw Ambroszkiewicz and Jerzy Brzezi\\\'{n}ski and Wojciech Cellary and Adam Grzech and Krzysztof Zieli\\\"{n}ski},\nisbn = {978-83-7417-544-9},\npages = {289--312},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/666.pdf},\npublisher = {Pozna{\\\'n} University of Economics Press},\ntitle = {{QoS-aware Complex Service Composition in SOA-based Systems}},\nyear = {2010},\nabstract = {In this work, a method for the QoS-aware complex service composition in SOA-based systems is presented. The considered complex service composition process consists of three stages: complex service structure, scenario and plan composition. Complex service structure contains a set of required functionalities and precedence relations between them, and is derived directly from a service level agreement. Service scenario is derived from service structure by choosing the optimal (in the sense of certain quality criterion) order of execution of required functionalities. Finally, a service plan emerges from a scenario by choosing the best versions of atomic services for the delivery of required functionalities. For such distinguished composition process methods for complex service scenario and execution plan optimization are proposed. Optimization of a complex service scenario is based on the analysis of possible parallel executions of required functionalities. In order to deliver required level of the quality of service, well known QoS assurance models (i.e.: best effort, integrated services and differentiated services) are applied in the process of complex service execution plan optimization.}\n}\n
\n
\nIn this work, a method for the QoS-aware complex service composition in SOA-based systems is presented. The considered complex service composition process consists of three stages: complex service structure, scenario and plan composition. Complex service structure contains a set of required functionalities and precedence relations between them, and is derived directly from a service level agreement. Service scenario is derived from service structure by choosing the optimal (in the sense of certain quality criterion) order of execution of required functionalities. Finally, a service plan emerges from a scenario by choosing the best versions of atomic services for the delivery of required functionalities. For such distinguished composition process methods for complex service scenario and execution plan optimization are proposed. Optimization of a complex service scenario is based on the analysis of possible parallel executions of required functionalities. In order to deliver required level of the quality of service, well known QoS assurance models (i.e.: best effort, integrated services and differentiated services) are applied in the process of complex service execution plan optimization.\n
\n','
\n@incollection{GrRySw2010-SOAbook,\n  address = {Pozna{\\\'n}, Poland},\n  author = {Adam Grzech and Piotr Rygielski and Pawel \\\'{S}wi\\k{a}tek},\n  booktitle = {SOA Infrastructure Tools: Concepts and Methods},\n  editor = {Stanislaw Ambroszkiewicz and Jerzy Brzezi\\\'{n}ski and Wojciech Cellary and Adam Grzech and Krzysztof Zieli\\\"{n}ski},\n  isbn = {978-83-7417-544-9},\n  pages = {289--312},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/666.pdf},\n  publisher = {Pozna{\\\'n} University of Economics Press},\n  title = {{QoS-aware Complex Service Composition in SOA-based Systems}},\n  year = {2010},\n  abstract = {In this work, a method for the QoS-aware complex service composition in SOA-based systems is presented. The considered complex service composition process consists of three stages: complex service structure, scenario and plan composition. Complex service structure contains a set of required functionalities and precedence relations between them, and is derived directly from a service level agreement. Service scenario is derived from service structure by choosing the optimal (in the sense of certain quality criterion) order of execution of required functionalities. Finally, a service plan emerges from a scenario by choosing the best versions of atomic services for the delivery of required functionalities. For such distinguished composition process methods for complex service scenario and execution plan optimization are proposed. Optimization of a complex service scenario is based on the analysis of possible parallel executions of required functionalities. In order to deliver required level of the quality of service, well known QoS assurance models (i.e.: best effort, integrated services and differentiated services) are applied in the process of complex service execution plan optimization.}\n}\n
\n\n','In this work, a method for the QoS-aware complex service composition in SOA-based systems is presented. The considered complex service composition process consists of three stages: complex service structure, scenario and plan composition. Complex service structure contains a set of required functionalities and precedence relations between them, and is derived directly from a service level agreement. Service scenario is derived from service structure by choosing the optimal (in the sense of certain quality criterion) order of execution of required functionalities. Finally, a service plan emerges from a scenario by choosing the best versions of atomic services for the delivery of required functionalities. For such distinguished composition process methods for complex service scenario and execution plan optimization are proposed. Optimization of a complex service scenario is based on the analysis of possible parallel executions of required functionalities. In order to deliver required level of the quality of service, well known QoS assurance models (i.e.: best effort, integrated services and differentiated services) are applied in the process of complex service execution plan optimization.','{QoS-aware Complex Service Composition in SOA-based Systems}',0,0,2010,0,NULL,NULL,'Resource Management; SOA','0000-00-00 00:00:00','2016-06-01 09:41:00',0),(667,'paper','GrSwRy2009-ICSE','inproceedings','@inproceedings{GrSwRy2009-ICSE,\n author = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Piotr Rygielski},\n booktitle = {Proceedings of Twentieth International Conference on Systems Engineering, (ICSE 2009)},\n day = {8--10},\n editor = {Keith J. Burnham and Olivier C. L. Haas},\n location = {Coventry, UK},\n month = {September},\n pages = {181--184},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/667.pdf},\n publisher = {Coventry University Press},\n title = {{Twostage Packet Scheduling in the Network Node}},\n year = {2009},\n abstract = {In this paper the problem of two-stage packet scheduling on parallel processors is considered. It is assumed, that each processor schedules packets according to Weighted Round Robin (WRR) rule. In order to deliver required level of the quality of service (QoS) weights of local WRR algorithms are adapted such that QoS requirements are met for all distinguished traffic classes. Adaptation of WRR weights relies on the adaptation through identification (Bubnicki, 2005) methodology with the diagonal recurrent neural network (DRNN) applied as the model of QoS parameters. Simulation study of the performance of proposed scheduling methodology shows, that it can deliver better QoS guaranties and higher systems throughput than commonly used reference algorithms.},\n}\n\n','\n\nAdam Grzech, Pawel Świątek, and Piotr Rygielski.\nTwostage Packet Scheduling in the Network Node.\nIn Proceedings of Twentieth International Conference on Systems\nEngineering, (ICSE 2009), Keith J. Burnham and Olivier C. L. Haas, editors,\nCoventry, UK, September 8-10, 2009, pages 181-184. Coventry University\nPress.\nSeptember 2009.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{GrSwRy2009-ICSE,\nauthor = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Piotr Rygielski},\nbooktitle = {Proceedings of Twentieth International Conference on Systems Engineering, (ICSE 2009)},\nday = {8--10},\neditor = {Keith J. Burnham and Olivier C. L. Haas},\nlocation = {Coventry, UK},\nmonth = {September},\npages = {181--184},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/667.pdf},\npublisher = {Coventry University Press},\ntitle = {{Twostage Packet Scheduling in the Network Node}},\nyear = {2009},\nabstract = {In this paper the problem of two-stage packet scheduling on parallel processors is considered. It is assumed, that each processor schedules packets according to Weighted Round Robin (WRR) rule. In order to deliver required level of the quality of service (QoS) weights of local WRR algorithms are adapted such that QoS requirements are met for all distinguished traffic classes. Adaptation of WRR weights relies on the adaptation through identification (Bubnicki, 2005) methodology with the diagonal recurrent neural network (DRNN) applied as the model of QoS parameters. Simulation study of the performance of proposed scheduling methodology shows, that it can deliver better QoS guaranties and higher systems throughput than commonly used reference algorithms.}\n}\n
\n
\nIn this paper the problem of two-stage packet scheduling on parallel processors is considered. It is assumed, that each processor schedules packets according to Weighted Round Robin (WRR) rule. In order to deliver required level of the quality of service (QoS) weights of local WRR algorithms are adapted such that QoS requirements are met for all distinguished traffic classes. Adaptation of WRR weights relies on the adaptation through identification (Bubnicki, 2005) methodology with the diagonal recurrent neural network (DRNN) applied as the model of QoS parameters. Simulation study of the performance of proposed scheduling methodology shows, that it can deliver better QoS guaranties and higher systems throughput than commonly used reference algorithms.\n
\n','
\n@inproceedings{GrSwRy2009-ICSE,\n  author = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Piotr Rygielski},\n  booktitle = {Proceedings of Twentieth International Conference on Systems Engineering, (ICSE 2009)},\n  day = {8--10},\n  editor = {Keith J. Burnham and Olivier C. L. Haas},\n  location = {Coventry, UK},\n  month = {September},\n  pages = {181--184},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/667.pdf},\n  publisher = {Coventry University Press},\n  title = {{Twostage Packet Scheduling in the Network Node}},\n  year = {2009},\n  abstract = {In this paper the problem of two-stage packet scheduling on parallel processors is considered. It is assumed, that each processor schedules packets according to Weighted Round Robin (WRR) rule. In order to deliver required level of the quality of service (QoS) weights of local WRR algorithms are adapted such that QoS requirements are met for all distinguished traffic classes. Adaptation of WRR weights relies on the adaptation through identification (Bubnicki, 2005) methodology with the diagonal recurrent neural network (DRNN) applied as the model of QoS parameters. Simulation study of the performance of proposed scheduling methodology shows, that it can deliver better QoS guaranties and higher systems throughput than commonly used reference algorithms.}\n}\n
\n\n','In this paper the problem of two-stage packet scheduling on parallel processors is considered. It is assumed, that each processor schedules packets according to Weighted Round Robin (WRR) rule. In order to deliver required level of the quality of service (QoS) weights of local WRR algorithms are adapted such that QoS requirements are met for all distinguished traffic classes. Adaptation of WRR weights relies on the adaptation through identification (Bubnicki, 2005) methodology with the diagonal recurrent neural network (DRNN) applied as the model of QoS parameters. Simulation study of the performance of proposed scheduling methodology shows, that it can deliver better QoS guaranties and higher systems throughput than commonly used reference algorithms.','{Twostage Packet Scheduling in the Network Node}',0,9,2009,9,NULL,NULL,'QoS in Networks; Networking','0000-00-00 00:00:00','2016-06-01 09:41:00',0),(668,'paper','GrSwRy2009-PTS','inproceedings','@inproceedings{GrSwRy2009-PTS,\n author = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Piotr Rygielski},\n booktitle = {Proceedings of the 16th Polish Teletraffic Symposium (PTS 2009)},\n day = {24--25},\n isbn = {978-83-7283-317-4},\n location = {L{\\\'o}d{\\\'Z}, Poland},\n month = {September},\n note = {Young Author Best Paper Award},\n organization = {Technical University of \\L{}{\\\'o}d{\\\'Z}},\n pages = {53--56},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/668.pdf},\n title = {{Improving QoS Guaranties via Adaptive Packet Scheduling}},\n year = {2009},\n abstract = {In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network node is one of the crucial mechanisms essential for delivery of required level of quality of services (QoS). In order to satisfy QoS guaranties for each connection belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions basing on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: connections lengths, packet intensities within connections, etc.). Here we propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of system and traffic characteristics. By means of computer simulation, on representative examples, we show, that utilization of additional knowledge in the process of packet scheduling may improve QoS guaranties for serviced traffic.},\n}\n\n','\n\nAdam Grzech, Pawel Świątek, and Piotr Rygielski.\nImproving QoS Guaranties via Adaptive Packet Scheduling.\nIn Proceedings of the 16th Polish Teletraffic Symposium (PTS\n2009), Lódź, Poland, September 24-25, 2009, pages 53-56. Technical\nUniversity of Lódź.\nYoung Author Best Paper Award.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{GrSwRy2009-PTS,\nauthor = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Piotr Rygielski},\nbooktitle = {Proceedings of the 16th Polish Teletraffic Symposium (PTS 2009)},\nday = {24--25},\nisbn = {978-83-7283-317-4},\nlocation = {L{\\\'o}d{\\\'Z}, Poland},\nmonth = {September},\nnote = {Young Author Best Paper Award},\norganization = {Technical University of \\L{}{\\\'o}d{\\\'Z}},\npages = {53--56},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/668.pdf},\ntitle = {{Improving QoS Guaranties via Adaptive Packet Scheduling}},\nyear = {2009},\nabstract = {In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network node is one of the crucial mechanisms essential for delivery of required level of quality of services (QoS). In order to satisfy QoS guaranties for each connection belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions basing on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: connections lengths, packet intensities within connections, etc.). Here we propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of system and traffic characteristics. By means of computer simulation, on representative examples, we show, that utilization of additional knowledge in the process of packet scheduling may improve QoS guaranties for serviced traffic.}\n}\n
\n
\nIn this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network node is one of the crucial mechanisms essential for delivery of required level of quality of services (QoS). In order to satisfy QoS guaranties for each connection belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions basing on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: connections lengths, packet intensities within connections, etc.). Here we propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of system and traffic characteristics. By means of computer simulation, on representative examples, we show, that utilization of additional knowledge in the process of packet scheduling may improve QoS guaranties for serviced traffic.\n
\n','
\n@inproceedings{GrSwRy2009-PTS,\n  author = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Piotr Rygielski},\n  booktitle = {Proceedings of the 16th Polish Teletraffic Symposium (PTS 2009)},\n  day = {24--25},\n  isbn = {978-83-7283-317-4},\n  location = {L{\\\'o}d{\\\'Z}, Poland},\n  month = {September},\n  note = {Young Author Best Paper Award},\n  organization = {Technical University of \\L{}{\\\'o}d{\\\'Z}},\n  pages = {53--56},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/668.pdf},\n  title = {{Improving QoS Guaranties via Adaptive Packet Scheduling}},\n  year = {2009},\n  abstract = {In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network node is one of the crucial mechanisms essential for delivery of required level of quality of services (QoS). In order to satisfy QoS guaranties for each connection belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions basing on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: connections lengths, packet intensities within connections, etc.). Here we propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of system and traffic characteristics. By means of computer simulation, on representative examples, we show, that utilization of additional knowledge in the process of packet scheduling may improve QoS guaranties for serviced traffic.}\n}\n
\n\n','In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network node is one of the crucial mechanisms essential for delivery of required level of quality of services (QoS). In order to satisfy QoS guaranties for each connection belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions basing on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: connections lengths, packet intensities within connections, etc.). Here we propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of system and traffic characteristics. By means of computer simulation, on representative examples, we show, that utilization of additional knowledge in the process of packet scheduling may improve QoS guaranties for serviced traffic.','{Improving QoS Guaranties via Adaptive Packet Scheduling}',0,9,2009,9,NULL,NULL,'QoS in Networks; Networking;','0000-00-00 00:00:00','2016-06-01 09:41:00',0),(669,'paper','GrRySw2009-HETNETS-sim','inproceedings','@inproceedings{GrRySw2009-HETNETS-sim,\n address = {Ba{l}tycka 5, 44-100 Gliwice, Poland},\n author = {Adam Grzech and Piotr Rygielski and Pawel \\\'Swi\\k{a}tek},\n booktitle = {Performance modeling and evaluation of heterogeneous networks, 6th Working International Conference (HET-NETs 2010)},\n day = {14--16},\n editor = {Tadeusz Czach{\\\'o}rski},\n isbn = {978-83-926054-4-7},\n location = {Zakopane, Poland},\n month = {January},\n pages = {89--97},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/669.pdf},\n publisher = {Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences},\n title = {{Simulation Environment for Delivering Quality of Service in Systems Based on Service-Oriented Architecture Paradigm}},\n year = {2010},\n abstract = {In this paper a model of complex service in service-oriented architecture (SOA) system is presented. A complex service is composed with a set of atomic services. Each atomic service is characterized with its own non-functional parameters what allows to formulate quality of service optimization tasks. A simulation environment has been developed to allow experiments execution to determine quality of service (QoS) of composed service.},\n}\n\n','\n\nAdam Grzech, Piotr Rygielski, and Pawel Świątek.\nSimulation Environment for Delivering Quality of Service in Systems\nBased on Service-Oriented Architecture Paradigm.\nIn Performance modeling and evaluation of heterogeneous\nnetworks, 6th Working International Conference (HET-NETs 2010), Tadeusz\nCzachórski, editor, Zakopane, Poland, January 14-16, 2010, pages 89-97.\nInstitute of Theoretical and Applied Informatics of the Polish Academy of\nSciences, Baltycka 5, 44-100 Gliwice, Poland.\nJanuary 2010.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{GrRySw2009-HETNETS-sim,\naddress = {Ba{l}tycka 5, 44-100 Gliwice, Poland},\nauthor = {Adam Grzech and Piotr Rygielski and Pawel \\\'Swi\\k{a}tek},\nbooktitle = {Performance modeling and evaluation of heterogeneous networks, 6th Working International Conference (HET-NETs 2010)},\nday = {14--16},\neditor = {Tadeusz Czach{\\\'o}rski},\nisbn = {978-83-926054-4-7},\nlocation = {Zakopane, Poland},\nmonth = {January},\npages = {89--97},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/669.pdf},\npublisher = {Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences},\ntitle = {{Simulation Environment for Delivering Quality of Service in Systems Based on Service-Oriented Architecture Paradigm}},\nyear = {2010},\nabstract = {In this paper a model of complex service in service-oriented architecture (SOA) system is presented. A complex service is composed with a set of atomic services. Each atomic service is characterized with its own non-functional parameters what allows to formulate quality of service optimization tasks. A simulation environment has been developed to allow experiments execution to determine quality of service (QoS) of composed service.}\n}\n
\n
\nIn this paper a model of complex service in service-oriented architecture (SOA) system is presented. A complex service is composed with a set of atomic services. Each atomic service is characterized with its own non-functional parameters what allows to formulate quality of service optimization tasks. A simulation environment has been developed to allow experiments execution to determine quality of service (QoS) of composed service.\n
\n','
\n@inproceedings{GrRySw2009-HETNETS-sim,\n  address = {Ba{l}tycka 5, 44-100 Gliwice, Poland},\n  author = {Adam Grzech and Piotr Rygielski and Pawel \\\'Swi\\k{a}tek},\n  booktitle = {Performance modeling and evaluation of heterogeneous networks, 6th Working International Conference (HET-NETs 2010)},\n  day = {14--16},\n  editor = {Tadeusz Czach{\\\'o}rski},\n  isbn = {978-83-926054-4-7},\n  location = {Zakopane, Poland},\n  month = {January},\n  pages = {89--97},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/669.pdf},\n  publisher = {Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences},\n  title = {{Simulation Environment for Delivering Quality of Service in Systems Based on Service-Oriented Architecture Paradigm}},\n  year = {2010},\n  abstract = {In this paper a model of complex service in service-oriented architecture (SOA) system is presented. A complex service is composed with a set of atomic services. Each atomic service is characterized with its own non-functional parameters what allows to formulate quality of service optimization tasks. A simulation environment has been developed to allow experiments execution to determine quality of service (QoS) of composed service.}\n}\n
\n\n','In this paper a model of complex service in service-oriented architecture (SOA) system is presented. A complex service is composed with a set of atomic services. Each atomic service is characterized with its own non-functional parameters what allows to formulate quality of service optimization tasks. A simulation environment has been developed to allow experiments execution to determine quality of service (QoS) of composed service.','{Simulation Environment for Delivering Quality of Service in Systems Based on Service-Oriented Architecture Paradigm}',0,1,2010,1,NULL,NULL,'SOA; QoS in Networks; Simulation','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(670,'paper','GrRySw2009-HETNETS-QoS','inproceedings','@inproceedings{GrRySw2009-HETNETS-QoS,\n address = {Ba{l}tycka 5, 44-100 Gliwice, Poland},\n author = {Adam Grzech and Piotr Rygielski and Pawel \\\'Swi\\k{a}tek},\n booktitle = {Performance modelling and evaluation of heterogeneous networks, 6th Working International Conference (HET-NETs 2010)},\n day = {14--16},\n editor = {Tadeusz Czach{\\\'o}rski},\n isbn = {978-83-926054-4-7},\n location = {Zakopane, Poland},\n month = {January},\n pages = {35--47},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/670.pdf},\n publisher = {Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences},\n title = {{QoS-aware Infrastructure Resources Allocation in Systems Based on Service-Oriented Architecture Paradigm}},\n year = {2010},\n abstract = {In this paper the task of communication and computational resources allocation in systems based on SOA paradigm is considered. The task of resources allocation consists in assigning resources to each incoming service request in such a way, that required level of the quality of service is met. Complex services performance time in distributed environment is assumed as the quality of service measure. Models of the system and analysis of service response time presented in this paper allowed to formulate several tasks of resource allocation in terms of well known quality of service assurance models: best effort, IntServ and DiffServ. For each formulated task solution algorithms were proposed and their correctness was evaluated by means of simulation.},\n}\n\n','\n\nAdam Grzech, Piotr Rygielski, and Pawel Świątek.\nQoS-aware Infrastructure Resources Allocation in Systems Based on\nService-Oriented Architecture Paradigm.\nIn Performance modelling and evaluation of heterogeneous\nnetworks, 6th Working International Conference (HET-NETs 2010), Tadeusz\nCzachórski, editor, Zakopane, Poland, January 14-16, 2010, pages 35-47.\nInstitute of Theoretical and Applied Informatics of the Polish Academy of\nSciences, Baltycka 5, 44-100 Gliwice, Poland.\nJanuary 2010.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{GrRySw2009-HETNETS-QoS,\naddress = {Ba{l}tycka 5, 44-100 Gliwice, Poland},\nauthor = {Adam Grzech and Piotr Rygielski and Pawel \\\'Swi\\k{a}tek},\nbooktitle = {Performance modelling and evaluation of heterogeneous networks, 6th Working International Conference (HET-NETs 2010)},\nday = {14--16},\neditor = {Tadeusz Czach{\\\'o}rski},\nisbn = {978-83-926054-4-7},\nlocation = {Zakopane, Poland},\nmonth = {January},\npages = {35--47},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/670.pdf},\npublisher = {Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences},\ntitle = {{QoS-aware Infrastructure Resources Allocation in Systems Based on Service-Oriented Architecture Paradigm}},\nyear = {2010},\nabstract = {In this paper the task of communication and computational resources allocation in systems based on SOA paradigm is considered. The task of resources allocation consists in assigning resources to each incoming service request in such a way, that required level of the quality of service is met. Complex services performance time in distributed environment is assumed as the quality of service measure. Models of the system and analysis of service response time presented in this paper allowed to formulate several tasks of resource allocation in terms of well known quality of service assurance models: best effort, IntServ and DiffServ. For each formulated task solution algorithms were proposed and their correctness was evaluated by means of simulation.}\n}\n
\n
\nIn this paper the task of communication and computational resources allocation in systems based on SOA paradigm is considered. The task of resources allocation consists in assigning resources to each incoming service request in such a way, that required level of the quality of service is met. Complex services performance time in distributed environment is assumed as the quality of service measure. Models of the system and analysis of service response time presented in this paper allowed to formulate several tasks of resource allocation in terms of well known quality of service assurance models: best effort, IntServ and DiffServ. For each formulated task solution algorithms were proposed and their correctness was evaluated by means of simulation.\n
\n','
\n@inproceedings{GrRySw2009-HETNETS-QoS,\n  address = {Ba{l}tycka 5, 44-100 Gliwice, Poland},\n  author = {Adam Grzech and Piotr Rygielski and Pawel \\\'Swi\\k{a}tek},\n  booktitle = {Performance modelling and evaluation of heterogeneous networks, 6th Working International Conference (HET-NETs 2010)},\n  day = {14--16},\n  editor = {Tadeusz Czach{\\\'o}rski},\n  isbn = {978-83-926054-4-7},\n  location = {Zakopane, Poland},\n  month = {January},\n  pages = {35--47},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/670.pdf},\n  publisher = {Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences},\n  title = {{QoS-aware Infrastructure Resources Allocation in Systems Based on Service-Oriented Architecture Paradigm}},\n  year = {2010},\n  abstract = {In this paper the task of communication and computational resources allocation in systems based on SOA paradigm is considered. The task of resources allocation consists in assigning resources to each incoming service request in such a way, that required level of the quality of service is met. Complex services performance time in distributed environment is assumed as the quality of service measure. Models of the system and analysis of service response time presented in this paper allowed to formulate several tasks of resource allocation in terms of well known quality of service assurance models: best effort, IntServ and DiffServ. For each formulated task solution algorithms were proposed and their correctness was evaluated by means of simulation.}\n}\n
\n\n','In this paper the task of communication and computational resources allocation in systems based on SOA paradigm is considered. The task of resources allocation consists in assigning resources to each incoming service request in such a way, that required level of the quality of service is met. Complex services performance time in distributed environment is assumed as the quality of service measure. Models of the system and analysis of service response time presented in this paper allowed to formulate several tasks of resource allocation in terms of well known quality of service assurance models: best effort, IntServ and DiffServ. For each formulated task solution algorithms were proposed and their correctness was evaluated by means of simulation.','{QoS-aware Infrastructure Resources Allocation in Systems Based on Service-Oriented Architecture Paradigm}',0,1,2010,1,NULL,NULL,'SOA; QoS in Networks; Simulation','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(671,'paper','GrSwRy2011-ETS','inproceedings','@inproceedings{GrSwRy2011-ETS,\n address = {Pozna{\\\'n}, Poland},\n author = {Pawel \\\'Swi\\k{a}tek and Piotr Rygielski and Adam Grzech},\n booktitle = {{Proceedings of the First European Teletraffic Seminar: an initiative to strengthen collaboration on Network Design and Performance (ETS 2011)}},\n day = {14--16},\n editor = {Grzegorz Danilewicz},\n location = {Pozna{\\\'n}, Poland},\n month = {February},\n pages = {80--84},\n publisher = {ASART STUDIO Agnieszka Chwalisz},\n title = {{Handover: a Tool for Optimization of Wireless Networks}},\n year = {2011},\n abstract = {The growth of mobile devices equipped with wireless network interface on the market puts researchers focus on the new area of wireless connection management. In this paper we introduce an approach of wireless network management with handovers which occurs when user is moving through the area that is covered with more than one wireless network. The task of user’s assignment to the wireless network is considered in this paper. There have been two main tasks formulated: local optimization, where user chooses the network to connect and global one, where the network management system picks users in order to maximize users satisfaction. The users have to be assigned with proper amount of communicational resources in every moment of the passing of considered geographical area. I this paper we propose three heuristic algorithms of user QoS-constrained assignment to networks. In two algorithms the user makes decision basing on his knowledge about network and his mobile device state and in the third algorithm, the networks management system decides which users to connect. The evaluation of proposed algorithms is done by means of computer simulation.},\n}\n\n','\n\nPawel Świątek, Piotr Rygielski, and Adam Grzech.\nHandover: a Tool for Optimization of Wireless Networks.\nIn Proceedings of the First European Teletraffic Seminar: an\ninitiative to strengthen collaboration on Network Design and Performance (ETS\n2011), Grzegorz Danilewicz, editor, Poznań, Poland, February 14-16,\n2011, pages 80-84. ASART STUDIO Agnieszka Chwalisz, Poznań, Poland.\nFebruary 2011.\n[ bib | Abstract  ] 
\n@inproceedings{GrSwRy2011-ETS,\naddress = {Pozna{\\\'n}, Poland},\nauthor = {Pawel \\\'Swi\\k{a}tek and Piotr Rygielski and Adam Grzech},\nbooktitle = {{Proceedings of the First European Teletraffic Seminar: an initiative to strengthen collaboration on Network Design and Performance (ETS 2011)}},\nday = {14--16},\neditor = {Grzegorz Danilewicz},\nlocation = {Pozna{\\\'n}, Poland},\nmonth = {February},\npages = {80--84},\npublisher = {ASART STUDIO Agnieszka Chwalisz},\ntitle = {{Handover: a Tool for Optimization of Wireless Networks}},\nyear = {2011},\nabstract = {The growth of mobile devices equipped with wireless network interface on the market puts researchers focus on the new area of wireless connection management. In this paper we introduce an approach of wireless network management with handovers which occurs when user is moving through the area that is covered with more than one wireless network. The task of user’s assignment to the wireless network is considered in this paper. There have been two main tasks formulated: local optimization, where user chooses the network to connect and global one, where the network management system picks users in order to maximize users satisfaction. The users have to be assigned with proper amount of communicational resources in every moment of the passing of considered geographical area. I this paper we propose three heuristic algorithms of user QoS-constrained assignment to networks. In two algorithms the user makes decision basing on his knowledge about network and his mobile device state and in the third algorithm, the networks management system decides which users to connect. The evaluation of proposed algorithms is done by means of computer simulation.}\n}\n
\n
\nThe growth of mobile devices equipped with wireless network interface on the market puts researchers focus on the new area of wireless connection management. In this paper we introduce an approach of wireless network management with handovers which occurs when user is moving through the area that is covered with more than one wireless network. The task of user’s assignment to the wireless network is considered in this paper. There have been two main tasks formulated: local optimization, where user chooses the network to connect and global one, where the network management system picks users in order to maximize users satisfaction. The users have to be assigned with proper amount of communicational resources in every moment of the passing of considered geographical area. I this paper we propose three heuristic algorithms of user QoS-constrained assignment to networks. In two algorithms the user makes decision basing on his knowledge about network and his mobile device state and in the third algorithm, the networks management system decides which users to connect. The evaluation of proposed algorithms is done by means of computer simulation.\n
\n','
\n@inproceedings{GrSwRy2011-ETS,\n  address = {Pozna{\\\'n}, Poland},\n  author = {Pawel \\\'Swi\\k{a}tek and Piotr Rygielski and Adam Grzech},\n  booktitle = {{Proceedings of the First European Teletraffic Seminar: an initiative to strengthen collaboration on Network Design and Performance (ETS 2011)}},\n  day = {14--16},\n  editor = {Grzegorz Danilewicz},\n  location = {Pozna{\\\'n}, Poland},\n  month = {February},\n  pages = {80--84},\n  publisher = {ASART STUDIO Agnieszka Chwalisz},\n  title = {{Handover: a Tool for Optimization of Wireless Networks}},\n  year = {2011},\n  abstract = {The growth of mobile devices equipped with wireless network interface on the market puts researchers focus on the new area of wireless connection management. In this paper we introduce an approach of wireless network management with handovers which occurs when user is moving through the area that is covered with more than one wireless network. The task of user’s assignment to the wireless network is considered in this paper. There have been two main tasks formulated: local optimization, where user chooses the network to connect and global one, where the network management system picks users in order to maximize users satisfaction. The users have to be assigned with proper amount of communicational resources in every moment of the passing of considered geographical area. I this paper we propose three heuristic algorithms of user QoS-constrained assignment to networks. In two algorithms the user makes decision basing on his knowledge about network and his mobile device state and in the third algorithm, the networks management system decides which users to connect. The evaluation of proposed algorithms is done by means of computer simulation.}\n}\n
\n\n','The growth of mobile devices equipped with wireless network interface on the market puts researchers focus on the new area of wireless connection management. In this paper we introduce an approach of wireless network management with handovers which occurs when user is moving through the area that is covered with more than one wireless network. The task of user’s assignment to the wireless network is considered in this paper. There have been two main tasks formulated: local optimization, where user chooses the network to connect and global one, where the network management system picks users in order to maximize users satisfaction. The users have to be assigned with proper amount of communicational resources in every moment of the passing of considered geographical area. I this paper we propose three heuristic algorithms of user QoS-constrained assignment to networks. In two algorithms the user makes decision basing on his knowledge about network and his mobile device state and in the third algorithm, the networks management system decides which users to connect. The evaluation of proposed algorithms is done by means of computer simulation.','{Handover: a Tool for Optimization of Wireless Networks}',0,2,2011,2,NULL,NULL,'QoS in Networks; Resource Management; Networking;','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(672,'paper','RySwJuGr2011-KES','inproceedings','@inproceedings{RySwJuGr2011-KES,\n address = {Berlin, Heidelberg},\n author = {Rygielski, Piotr and \\\'{S}wi\\k{a}tek, Pawel and Juszczyszyn, Krzysztof and Grzech, Adam},\n booktitle = {Knowledge-Based and Intelligent Information and Engineering Systems, Part II (KES 2011)},\n day = {12--14},\n edition = {1},\n editor = {Koenig, A. and Dengel, A. and Hinkelmann, K. and Kise, K. and Howlett, R.J. and Jain, L.C.},\n isbn = {978-3-642-23862-8},\n location = {Kaiserslautern, Germany},\n month = {September},\n pages = {687--696},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/672.pdf},\n publisher = {Springer-Verlag},\n series = {{Lecture Notes in Computer Science (LNCS)}},\n title = {{Prediction Based Handovers for Wireless Networks Resources Management}},\n url = {http://dl.acm.org/citation.cfm?id=2041341.2041419},\n volume = {6882},\n year = {2011},\n abstract = {The paper is devoted to the problem of mobility and resources management in heterogeneous wireless networks. It is assumed that in certain area covered by multiple overlapping wireless networks there is certain number of mobile client which consume networks resources by use of available communication services (e.g., voice or data transmission) delivered by network providers. Moreover it is assumed, that communication services continuity may be assured with use of common handover techniques supporting clients mobility (e.g: MIPv6, IEEE 802.21, etc.). The task of mobility and resources management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g. utilization of network resources). In this paper we show that gathering knowledge about clients movement and prediction of their future position may significantly improve the overall quality of delivered services and network resources utilization.},\n}\n\n','\n\nPiotr Rygielski, Pawel Świątek, Krzysztof Juszczyszyn, and Adam Grzech.\nPrediction Based Handovers for Wireless Networks Resources\nManagement.\nIn Knowledge-Based and Intelligent Information and Engineering\nSystems, Part II (KES 2011), A. Koenig, A. Dengel, K. Hinkelmann, K. Kise,\nR.J. Howlett, and L.C. Jain, editors, Kaiserslautern, Germany, September\n12-14, 2011, volume 6882 of Lecture Notes in Computer Science\n(LNCS), pages 687-696. Springer-Verlag, Berlin, Heidelberg.\nSeptember 2011.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{RySwJuGr2011-KES,\naddress = {Berlin, Heidelberg},\nauthor = {Rygielski, Piotr and \\\'{S}wi\\k{a}tek, Pawel and Juszczyszyn, Krzysztof and Grzech, Adam},\nbooktitle = {Knowledge-Based and Intelligent Information and Engineering Systems, Part II (KES 2011)},\nday = {12--14},\nedition = {1},\neditor = {Koenig, A. and Dengel, A. and Hinkelmann, K. and Kise, K. and Howlett, R.J. and Jain, L.C.},\nisbn = {978-3-642-23862-8},\nlocation = {Kaiserslautern, Germany},\nmonth = {September},\npages = {687--696},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/672.pdf},\npublisher = {Springer-Verlag},\nseries = {{Lecture Notes in Computer Science (LNCS)}},\ntitle = {{Prediction Based Handovers for Wireless Networks Resources Management}},\nurl = {http://dl.acm.org/citation.cfm?id=2041341.2041419},\nvolume = {6882},\nyear = {2011},\nabstract = {The paper is devoted to the problem of mobility and resources management in heterogeneous wireless networks. It is assumed that in certain area covered by multiple overlapping wireless networks there is certain number of mobile client which consume networks resources by use of available communication services (e.g., voice or data transmission) delivered by network providers. Moreover it is assumed, that communication services continuity may be assured with use of common handover techniques supporting clients mobility (e.g: MIPv6, IEEE 802.21, etc.). The task of mobility and resources management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g. utilization of network resources). In this paper we show that gathering knowledge about clients movement and prediction of their future position may significantly improve the overall quality of delivered services and network resources utilization.}\n}\n
\n
\nThe paper is devoted to the problem of mobility and resources management in heterogeneous wireless networks. It is assumed that in certain area covered by multiple overlapping wireless networks there is certain number of mobile client which consume networks resources by use of available communication services (e.g., voice or data transmission) delivered by network providers. Moreover it is assumed, that communication services continuity may be assured with use of common handover techniques supporting clients mobility (e.g: MIPv6, IEEE 802.21, etc.). The task of mobility and resources management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g. utilization of network resources). In this paper we show that gathering knowledge about clients movement and prediction of their future position may significantly improve the overall quality of delivered services and network resources utilization.\n
\n','
\n@inproceedings{RySwJuGr2011-KES,\n  address = {Berlin, Heidelberg},\n  author = {Rygielski, Piotr and \\\'{S}wi\\k{a}tek, Pawel and Juszczyszyn, Krzysztof and Grzech, Adam},\n  booktitle = {Knowledge-Based and Intelligent Information and Engineering Systems, Part II (KES 2011)},\n  day = {12--14},\n  edition = {1},\n  editor = {Koenig, A. and Dengel, A. and Hinkelmann, K. and Kise, K. and Howlett, R.J. and Jain, L.C.},\n  isbn = {978-3-642-23862-8},\n  location = {Kaiserslautern, Germany},\n  month = {September},\n  pages = {687--696},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/672.pdf},\n  publisher = {Springer-Verlag},\n  series = {{Lecture Notes in Computer Science (LNCS)}},\n  title = {{Prediction Based Handovers for Wireless Networks Resources Management}},\n  url = {http://dl.acm.org/citation.cfm?id=2041341.2041419},\n  volume = {6882},\n  year = {2011},\n  abstract = {The paper is devoted to the problem of mobility and resources management in heterogeneous wireless networks. It is assumed that in certain area covered by multiple overlapping wireless networks there is certain number of mobile client which consume networks resources by use of available communication services (e.g., voice or data transmission) delivered by network providers. Moreover it is assumed, that communication services continuity may be assured with use of common handover techniques supporting clients mobility (e.g: MIPv6, IEEE 802.21, etc.). The task of mobility and resources management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g. utilization of network resources). In this paper we show that gathering knowledge about clients movement and prediction of their future position may significantly improve the overall quality of delivered services and network resources utilization.}\n}\n
\n\n','The paper is devoted to the problem of mobility and resources management in heterogeneous wireless networks. It is assumed that in certain area covered by multiple overlapping wireless networks there is certain number of mobile client which consume networks resources by use of available communication services (e.g., voice or data transmission) delivered by network providers. Moreover it is assumed, that communication services continuity may be assured with use of common handover techniques supporting clients mobility (e.g: MIPv6, IEEE 802.21, etc.). The task of mobility and resources management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g. utilization of network resources). In this paper we show that gathering knowledge about clients movement and prediction of their future position may significantly improve the overall quality of delivered services and network resources utilization.','{Prediction Based Handovers for Wireless Networks Resources Management}',0,9,2011,9,NULL,NULL,'QoS in Networks; Resource Management; Prediction; Networking;','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(673,'paper','RyTo2011-KES','inproceedings','@inproceedings{RyTo2011-KES,\n address = {Berlin, Heidelberg},\n author = {Rygielski, Piotr and Tomczak, Jakub},\n booktitle = {Knowledge-Based and Intelligent Information and Engineering Systems, Part II (KES 2011)},\n day = {12--14},\n edition = {1},\n editor = {Koenig, A. and Dengel, A. and Hinkelmann, K. and Kise, K. and Howlett, R.J. and Jain, L.C.},\n isbn = {978-3-642-23862-8},\n location = {Kaiserslautern, Germany},\n month = {September},\n pages = {591--600},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/673.pdf},\n publisher = {Springer-Verlag},\n series = {{Lecture Notes in Computer Science (LNCS)}},\n title = {{Context Change Detection for Resource Allocation in Service-Oriented Systems}},\n volume = {6882},\n year = {2011},\n abstract = {In this paper, the problem of detecting the major changes in the stream of service requests is formulated. The change of stream component varies over time and depends on, e.g., a time of a day. The underlying cause of the change is called a context. Hence, at each moment there exists a probability distribution determining the probability of requesting the system service conditioned by the context. The aim is to find such a moment in which the distributions change. To solve that problem dissimilarity measures between two probability distributions are given. Nevertheless, detecting every change is not interesting but only long-lasting changes because of the costs of the service system resources reallocation. Therefore, in the proposed algorithm an issue of sensitivity to temporary changes detection is considered},\n}\n\n','\n\nPiotr Rygielski and Jakub Tomczak.\nContext Change Detection for Resource Allocation in Service-Oriented\nSystems.\nIn Knowledge-Based and Intelligent Information and Engineering\nSystems, Part II (KES 2011), A. Koenig, A. Dengel, K. Hinkelmann, K. Kise,\nR.J. Howlett, and L.C. Jain, editors, Kaiserslautern, Germany, September\n12-14, 2011, volume 6882 of Lecture Notes in Computer Science\n(LNCS), pages 591-600. Springer-Verlag, Berlin, Heidelberg.\nSeptember 2011.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{RyTo2011-KES,\naddress = {Berlin, Heidelberg},\nauthor = {Rygielski, Piotr and Tomczak, Jakub},\nbooktitle = {Knowledge-Based and Intelligent Information and Engineering Systems, Part II (KES 2011)},\nday = {12--14},\nedition = {1},\neditor = {Koenig, A. and Dengel, A. and Hinkelmann, K. and Kise, K. and Howlett, R.J. and Jain, L.C.},\nisbn = {978-3-642-23862-8},\nlocation = {Kaiserslautern, Germany},\nmonth = {September},\npages = {591--600},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/673.pdf},\npublisher = {Springer-Verlag},\nseries = {{Lecture Notes in Computer Science (LNCS)}},\ntitle = {{Context Change Detection for Resource Allocation in Service-Oriented Systems}},\nvolume = {6882},\nyear = {2011},\nabstract = {In this paper, the problem of detecting the major changes in the stream of service requests is formulated. The change of stream component varies over time and depends on, e.g., a time of a day. The underlying cause of the change is called a context. Hence, at each moment there exists a probability distribution determining the probability of requesting the system service conditioned by the context. The aim is to find such a moment in which the distributions change. To solve that problem dissimilarity measures between two probability distributions are given. Nevertheless, detecting every change is not interesting but only long-lasting changes because of the costs of the service system resources reallocation. Therefore, in the proposed algorithm an issue of sensitivity to temporary changes detection is considered}\n}\n
\n
\nIn this paper, the problem of detecting the major changes in the stream of service requests is formulated. The change of stream component varies over time and depends on, e.g., a time of a day. The underlying cause of the change is called a context. Hence, at each moment there exists a probability distribution determining the probability of requesting the system service conditioned by the context. The aim is to find such a moment in which the distributions change. To solve that problem dissimilarity measures between two probability distributions are given. Nevertheless, detecting every change is not interesting but only long-lasting changes because of the costs of the service system resources reallocation. Therefore, in the proposed algorithm an issue of sensitivity to temporary changes detection is considered\n
\n','
\n@inproceedings{RyTo2011-KES,\n  address = {Berlin, Heidelberg},\n  author = {Rygielski, Piotr and Tomczak, Jakub},\n  booktitle = {Knowledge-Based and Intelligent Information and Engineering Systems, Part II (KES 2011)},\n  day = {12--14},\n  edition = {1},\n  editor = {Koenig, A. and Dengel, A. and Hinkelmann, K. and Kise, K. and Howlett, R.J. and Jain, L.C.},\n  isbn = {978-3-642-23862-8},\n  location = {Kaiserslautern, Germany},\n  month = {September},\n  pages = {591--600},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/673.pdf},\n  publisher = {Springer-Verlag},\n  series = {{Lecture Notes in Computer Science (LNCS)}},\n  title = {{Context Change Detection for Resource Allocation in Service-Oriented Systems}},\n  volume = {6882},\n  year = {2011},\n  abstract = {In this paper, the problem of detecting the major changes in the stream of service requests is formulated. The change of stream component varies over time and depends on, e.g., a time of a day. The underlying cause of the change is called a context. Hence, at each moment there exists a probability distribution determining the probability of requesting the system service conditioned by the context. The aim is to find such a moment in which the distributions change. To solve that problem dissimilarity measures between two probability distributions are given. Nevertheless, detecting every change is not interesting but only long-lasting changes because of the costs of the service system resources reallocation. Therefore, in the proposed algorithm an issue of sensitivity to temporary changes detection is considered}\n}\n
\n\n','In this paper, the problem of detecting the major changes in the stream of service requests is formulated. The change of stream component varies over time and depends on, e.g., a time of a day. The underlying cause of the change is called a context. Hence, at each moment there exists a probability distribution determining the probability of requesting the system service conditioned by the context. The aim is to find such a moment in which the distributions change. To solve that problem dissimilarity measures between two probability distributions are given. Nevertheless, detecting every change is not interesting but only long-lasting changes because of the costs of the service system resources reallocation. Therefore, in the proposed algorithm an issue of sensitivity to temporary changes detection is considered','{Context Change Detection for Resource Allocation in Service-Oriented Systems}',0,9,2011,9,NULL,NULL,'Resource Management; SOA; Networking;','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(674,'paper','GrSwRy2010-SS','article','@article{GrSwRy2010-SS,\n address = {Wroclaw, Poland},\n author = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Piotr Rygielski},\n journal = {Systems Science},\n number = {1},\n pages = {7--12},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/674.pdf},\n publisher = {Wroclaw University of Technology Press},\n title = {{Adaptive Packet Scheduling for Requests Delay Guaranties in Packet-Switched Communication Network}},\n url = {http://linksource.ebsco.com/linking.aspx?issn=0137-1223&volume=36&spage=7},\n volume = {36},\n year = {2010},\n abstract = {In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network edge nodes is one of the crucial mechanisms essential for delivery of required level of quality of end-to-end network services (QoS). In order to satisfy QoS guaranties for each incoming request belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions based on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: lengths of connections following requests, packet intensities within requests, etc.). The paper is devoted to propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of networkÂ’s load and traffic characteristics. By means of computer simulation, on representative examples, it was shown, that utilization of additional knowledge about incoming traffic in the process of packet scheduling may improve QoS guaranties for serviced traffic.},\n}\n\n','\n\nAdam Grzech, Pawel Świątek, and Piotr Rygielski.\nAdaptive Packet Scheduling for Requests Delay Guaranties in\nPacket-Switched Communication Network.\nSystems Science, 36(1):7-12, 2010, Wroclaw University of\nTechnology Press, Wroclaw, Poland.\n[ bib | http | .pdf | Abstract  ] 
\n@article{GrSwRy2010-SS,\naddress = {Wroclaw, Poland},\nauthor = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Piotr Rygielski},\njournal = {Systems Science},\nnumber = {1},\npages = {7--12},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/674.pdf},\npublisher = {Wroclaw University of Technology Press},\ntitle = {{Adaptive Packet Scheduling for Requests Delay Guaranties in Packet-Switched Communication Network}},\nurl = {http://linksource.ebsco.com/linking.aspx?issn=0137-1223&volume=36&spage=7},\nvolume = {36},\nyear = {2010},\nabstract = {In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network edge nodes is one of the crucial mechanisms essential for delivery of required level of quality of end-to-end network services (QoS). In order to satisfy QoS guaranties for each incoming request belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions based on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: lengths of connections following requests, packet intensities within requests, etc.). The paper is devoted to propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of networkÂ’s load and traffic characteristics. By means of computer simulation, on representative examples, it was shown, that utilization of additional knowledge about incoming traffic in the process of packet scheduling may improve QoS guaranties for serviced traffic.}\n}\n
\n
\nIn this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network edge nodes is one of the crucial mechanisms essential for delivery of required level of quality of end-to-end network services (QoS). In order to satisfy QoS guaranties for each incoming request belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions based on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: lengths of connections following requests, packet intensities within requests, etc.). The paper is devoted to propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of networkÂ’s load and traffic characteristics. By means of computer simulation, on representative examples, it was shown, that utilization of additional knowledge about incoming traffic in the process of packet scheduling may improve QoS guaranties for serviced traffic.\n
\n','
\n@article{GrSwRy2010-SS,\n  address = {Wroclaw, Poland},\n  author = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Piotr Rygielski},\n  journal = {Systems Science},\n  number = {1},\n  pages = {7--12},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/674.pdf},\n  publisher = {Wroclaw University of Technology Press},\n  title = {{Adaptive Packet Scheduling for Requests Delay Guaranties in Packet-Switched Communication Network}},\n  url = {http://linksource.ebsco.com/linking.aspx?issn=0137-1223&volume=36&spage=7},\n  volume = {36},\n  year = {2010},\n  abstract = {In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network edge nodes is one of the crucial mechanisms essential for delivery of required level of quality of end-to-end network services (QoS). In order to satisfy QoS guaranties for each incoming request belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions based on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: lengths of connections following requests, packet intensities within requests, etc.). The paper is devoted to propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of networkÂ’s load and traffic characteristics. By means of computer simulation, on representative examples, it was shown, that utilization of additional knowledge about incoming traffic in the process of packet scheduling may improve QoS guaranties for serviced traffic.}\n}\n
\n\n','In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network edge nodes is one of the crucial mechanisms essential for delivery of required level of quality of end-to-end network services (QoS). In order to satisfy QoS guaranties for each incoming request belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions based on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: lengths of connections following requests, packet intensities within requests, etc.). The paper is devoted to propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of networkÂ’s load and traffic characteristics. By means of computer simulation, on representative examples, it was shown, that utilization of additional knowledge about incoming traffic in the process of packet scheduling may improve QoS guaranties for serviced traffic.','{Adaptive Packet Scheduling for Requests Delay Guaranties in Packet-Switched Communication Network}',0,0,2010,0,NULL,NULL,'QoS in Networks; Prediction; Networking','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(675,'paper','SwRyGr2011-EAT','article','@article{SwRyGr2011-EAT,\n address = {Pozna{\\\'n}, Poland},\n author = {Pawel \\\'{S}wi\\k{a}tek and Piotr Rygielski and Adam Grzech},\n isbn = {2081-8580},\n journal = {Advances in Electronics and Telecommunications},\n month = {November},\n number = {3},\n pages = {50--54},\n publisher = {Pozna{\\\'n} University of Technology Press},\n title = {{Resources Management and Services Personalization in Future Internet Applications}},\n url = {http://www.advances.et.put.poznan.pl/},\n volume = {2},\n year = {2011},\n}\n\n','\n\nPawel Świątek, Piotr Rygielski, and Adam Grzech.\nResources Management and Services Personalization in Future Internet\nApplications.\nAdvances in Electronics and Telecommunications, 2(3):50-54,\nNovember 2011, Poznań University of Technology Press, Poznań, Poland.\n[ bib | http  ] 
\n@article{SwRyGr2011-EAT,\naddress = {Pozna{\\\'n}, Poland},\nauthor = {Pawel \\\'{S}wi\\k{a}tek and Piotr Rygielski and Adam Grzech},\nisbn = {2081-8580},\njournal = {Advances in Electronics and Telecommunications},\nmonth = {November},\nnumber = {3},\npages = {50--54},\npublisher = {Pozna{\\\'n} University of Technology Press},\ntitle = {{Resources Management and Services Personalization in Future Internet Applications}},\nurl = {http://www.advances.et.put.poznan.pl/},\nvolume = {2},\nyear = {2011}\n}\n
\n
\n','
\n@article{SwRyGr2011-EAT,\n  address = {Pozna{\\\'n}, Poland},\n  author = {Pawel \\\'{S}wi\\k{a}tek and Piotr Rygielski and Adam Grzech},\n  isbn = {2081-8580},\n  journal = {Advances in Electronics and Telecommunications},\n  month = {November},\n  number = {3},\n  pages = {50--54},\n  publisher = {Pozna{\\\'n} University of Technology Press},\n  title = {{Resources Management and Services Personalization in Future Internet Applications}},\n  url = {http://www.advances.et.put.poznan.pl/},\n  volume = {2},\n  year = {2011}\n}\n
\n\n',NULL,'{Resources Management and Services Personalization in Future Internet Applications}',0,11,2011,11,NULL,NULL,'QoS in Networks; Resource Management; Networking','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(676,'paper','GrSwRy2010-CBS','article','@article{GrSwRy2010-CBS,\n address = {Bristol, PA, USA},\n author = {Adam Grzech and Pawel \\\'{S}wi\\k{a}tek and Piotr Rygielski},\n issn = {0196-9722},\n journal = {{Cybernetics and Systems: An International Journal (CBS)}},\n month = {November},\n number = {8},\n pages = {610--627},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/676.pdf},\n publisher = {Taylor & Francis, Inc.},\n title = {Translations of Service Level Agreement in Systems Based on Service Oriented Architectures},\n url = {http://dx.doi.org/10.1080/01969722.2010.520225},\n volume = {41},\n year = {2010},\n note = {5-Year Impact Factor (2014): 0.968},\n abstract = {The gain of the article is to introduce and to discuss a formal specification of a computer system\'s service level agreement (SLA) and its translation into the structure of complex services (composed of atomic services) delivering required functionalities and nonfunctionalities in a distributed environment. It is assumed that the SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define the structure of the adequate complex services in form of a directed graph, where potential parallelism of atomic services performance may be taken into account. The latter qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structures are available at the considered distributed environment in different versions and locations. Different versions of atomic services are atomic services delivering the required functionalities and satisfy non-functionalities at various levels. Different locations (installation place) of available atomic services means that the cost of atomic services delivery (communication and calculation) depends on parts of the distributed systems where the services are performed. The proposed model of SLA translation into complex services structures and variants may be applied among others to calculate upper and lower complex services delivery times and to estimate the validity of possible parallelism in complex services.},\n}\n\n','\n\nAdam Grzech, Pawel Świątek, and Piotr Rygielski.\nTranslations of service level agreement in systems based on service\noriented architectures.\nCybernetics and Systems: An International Journal (CBS),\n41(8):610-627, November 2010, Taylor & Francis, Inc., Bristol, PA, USA.\n5-Year Impact Factor (2014): 0.968.\n[ bib | http | .pdf | Abstract  ] 
\n@article{GrSwRy2010-CBS,\naddress = {Bristol, PA, USA},\nauthor = {Adam Grzech and Pawel \\\'{S}wi\\k{a}tek and Piotr Rygielski},\nissn = {0196-9722},\njournal = {{Cybernetics and Systems: An International Journal (CBS)}},\nmonth = {November},\nnumber = {8},\npages = {610--627},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/676.pdf},\npublisher = {Taylor & Francis, Inc.},\ntitle = {Translations of Service Level Agreement in Systems Based on Service Oriented Architectures},\nurl = {http://dx.doi.org/10.1080/01969722.2010.520225},\nvolume = {41},\nyear = {2010},\nnote = {5-Year Impact Factor (2014): 0.968},\nabstract = {The gain of the article is to introduce and to discuss a formal specification of a computer system\'s service level agreement (SLA) and its translation into the structure of complex services (composed of atomic services) delivering required functionalities and nonfunctionalities in a distributed environment. It is assumed that the SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define the structure of the adequate complex services in form of a directed graph, where potential parallelism of atomic services performance may be taken into account. The latter qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structures are available at the considered distributed environment in different versions and locations. Different versions of atomic services are atomic services delivering the required functionalities and satisfy non-functionalities at various levels. Different locations (installation place) of available atomic services means that the cost of atomic services delivery (communication and calculation) depends on parts of the distributed systems where the services are performed. The proposed model of SLA translation into complex services structures and variants may be applied among others to calculate upper and lower complex services delivery times and to estimate the validity of possible parallelism in complex services.}\n}\n
\n
\nThe gain of the article is to introduce and to discuss a formal specification of a computer system\'s service level agreement (SLA) and its translation into the structure of complex services (composed of atomic services) delivering required functionalities and nonfunctionalities in a distributed environment. It is assumed that the SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define the structure of the adequate complex services in form of a directed graph, where potential parallelism of atomic services performance may be taken into account. The latter qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structures are available at the considered distributed environment in different versions and locations. Different versions of atomic services are atomic services delivering the required functionalities and satisfy non-functionalities at various levels. Different locations (installation place) of available atomic services means that the cost of atomic services delivery (communication and calculation) depends on parts of the distributed systems where the services are performed. The proposed model of SLA translation into complex services structures and variants may be applied among others to calculate upper and lower complex services delivery times and to estimate the validity of possible parallelism in complex services.\n
\n','
\n@article{GrSwRy2010-CBS,\n  address = {Bristol, PA, USA},\n  author = {Adam Grzech and Pawel \\\'{S}wi\\k{a}tek and Piotr Rygielski},\n  issn = {0196-9722},\n  journal = {{Cybernetics and Systems: An International Journal (CBS)}},\n  month = {November},\n  number = {8},\n  pages = {610--627},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/676.pdf},\n  publisher = {Taylor & Francis, Inc.},\n  title = {Translations of Service Level Agreement in Systems Based on Service Oriented Architectures},\n  url = {http://dx.doi.org/10.1080/01969722.2010.520225},\n  volume = {41},\n  year = {2010},\n  note = {5-Year Impact Factor (2014): 0.968},\n  abstract = {The gain of the article is to introduce and to discuss a formal specification of a computer system\'s service level agreement (SLA) and its translation into the structure of complex services (composed of atomic services) delivering required functionalities and nonfunctionalities in a distributed environment. It is assumed that the SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define the structure of the adequate complex services in form of a directed graph, where potential parallelism of atomic services performance may be taken into account. The latter qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structures are available at the considered distributed environment in different versions and locations. Different versions of atomic services are atomic services delivering the required functionalities and satisfy non-functionalities at various levels. Different locations (installation place) of available atomic services means that the cost of atomic services delivery (communication and calculation) depends on parts of the distributed systems where the services are performed. The proposed model of SLA translation into complex services structures and variants may be applied among others to calculate upper and lower complex services delivery times and to estimate the validity of possible parallelism in complex services.}\n}\n
\n\n','The gain of the article is to introduce and to discuss a formal specification of a computer system\'s service level agreement (SLA) and its translation into the structure of complex services (composed of atomic services) delivering required functionalities and nonfunctionalities in a distributed environment. It is assumed that the SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define the structure of the adequate complex services in form of a directed graph, where potential parallelism of atomic services performance may be taken into account. The latter qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structures are available at the considered distributed environment in different versions and locations. Different versions of atomic services are atomic services delivering the required functionalities and satisfy non-functionalities at various levels. Different locations (installation place) of available atomic services means that the cost of atomic services delivery (communication and calculation) depends on parts of the distributed systems where the services are performed. The proposed model of SLA translation into complex services structures and variants may be applied among others to calculate upper and lower complex services delivery times and to estimate the validity of possible parallelism in complex services.','Translations of Service Level Agreement in Systems Based on Service Oriented Architectures',0,11,2010,11,NULL,NULL,'SOA','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(677,'paper','RySw2010-SS','article','@article{RySw2010-SS,\n address = {Wroclaw, Poland},\n author = {Piotr Rygielski and Pawel \\\'Swi\\k{a}tek},\n journal = {Systems Science},\n number = {3},\n pages = {25--32},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/677.pdf},\n publisher = {Wroclaw University of Technology Press},\n title = {{Graph-fold: an Efficient Method for Complex Service Execution Plan Optimization}},\n url = {http://linksource.ebsco.com/linking.aspx?issn=0137-1223&volume=36&spage=25},\n volume = {36},\n year = {2010},\n abstract = {The task of optimization of the complex service execution plan is the last stage of the process of complex services composition in systems based on the SOA paradigm. In general this task consists of choosing proper versions of atomic services, delivering requested functionalities, such that non-functional requirements for complex service are satisfied. In most real-life cases this task is reduced to the problem of multidimensional knapsack problem (MKP), which is known to be NP-hard. Therefore, in order to facilitate effective complex service composition, it is crucial to provide an efficient MKP solution algorithm. In this paper a novel approach to the problem of optimization of complex service execution plan is introduced. In the proposed approach the MKP feasible solution space is constructed in such a way, that the optimal solution can be found in constant time. Of course, since MKP is NP-hard, the process of solution space construction takes an exponential time, This time, however, is amortized by multiple usages of single solution space for determination of optimal execution plans for multiple complex service requests.},\n}\n\n','\n\nPiotr Rygielski and Pawel Świątek.\nGraph-fold: an Efficient Method for Complex Service Execution Plan\nOptimization.\nSystems Science, 36(3):25-32, 2010, Wroclaw University of\nTechnology Press, Wroclaw, Poland.\n[ bib | http | .pdf | Abstract  ] 
\n@article{RySw2010-SS,\naddress = {Wroclaw, Poland},\nauthor = {Piotr Rygielski and Pawel \\\'Swi\\k{a}tek},\njournal = {Systems Science},\nnumber = {3},\npages = {25--32},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/677.pdf},\npublisher = {Wroclaw University of Technology Press},\ntitle = {{Graph-fold: an Efficient Method for Complex Service Execution Plan Optimization}},\nurl = {http://linksource.ebsco.com/linking.aspx?issn=0137-1223&volume=36&spage=25},\nvolume = {36},\nyear = {2010},\nabstract = {The task of optimization of the complex service execution plan is the last stage of the process of complex services composition in systems based on the SOA paradigm. In general this task consists of choosing proper versions of atomic services, delivering requested functionalities, such that non-functional requirements for complex service are satisfied. In most real-life cases this task is reduced to the problem of multidimensional knapsack problem (MKP), which is known to be NP-hard. Therefore, in order to facilitate effective complex service composition, it is crucial to provide an efficient MKP solution algorithm. In this paper a novel approach to the problem of optimization of complex service execution plan is introduced. In the proposed approach the MKP feasible solution space is constructed in such a way, that the optimal solution can be found in constant time. Of course, since MKP is NP-hard, the process of solution space construction takes an exponential time, This time, however, is amortized by multiple usages of single solution space for determination of optimal execution plans for multiple complex service requests.}\n}\n
\n
\nThe task of optimization of the complex service execution plan is the last stage of the process of complex services composition in systems based on the SOA paradigm. In general this task consists of choosing proper versions of atomic services, delivering requested functionalities, such that non-functional requirements for complex service are satisfied. In most real-life cases this task is reduced to the problem of multidimensional knapsack problem (MKP), which is known to be NP-hard. Therefore, in order to facilitate effective complex service composition, it is crucial to provide an efficient MKP solution algorithm. In this paper a novel approach to the problem of optimization of complex service execution plan is introduced. In the proposed approach the MKP feasible solution space is constructed in such a way, that the optimal solution can be found in constant time. Of course, since MKP is NP-hard, the process of solution space construction takes an exponential time, This time, however, is amortized by multiple usages of single solution space for determination of optimal execution plans for multiple complex service requests.\n
\n','
\n@article{RySw2010-SS,\n  address = {Wroclaw, Poland},\n  author = {Piotr Rygielski and Pawel \\\'Swi\\k{a}tek},\n  journal = {Systems Science},\n  number = {3},\n  pages = {25--32},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/677.pdf},\n  publisher = {Wroclaw University of Technology Press},\n  title = {{Graph-fold: an Efficient Method for Complex Service Execution Plan Optimization}},\n  url = {http://linksource.ebsco.com/linking.aspx?issn=0137-1223&volume=36&spage=25},\n  volume = {36},\n  year = {2010},\n  abstract = {The task of optimization of the complex service execution plan is the last stage of the process of complex services composition in systems based on the SOA paradigm. In general this task consists of choosing proper versions of atomic services, delivering requested functionalities, such that non-functional requirements for complex service are satisfied. In most real-life cases this task is reduced to the problem of multidimensional knapsack problem (MKP), which is known to be NP-hard. Therefore, in order to facilitate effective complex service composition, it is crucial to provide an efficient MKP solution algorithm. In this paper a novel approach to the problem of optimization of complex service execution plan is introduced. In the proposed approach the MKP feasible solution space is constructed in such a way, that the optimal solution can be found in constant time. Of course, since MKP is NP-hard, the process of solution space construction takes an exponential time, This time, however, is amortized by multiple usages of single solution space for determination of optimal execution plans for multiple complex service requests.}\n}\n
\n\n','The task of optimization of the complex service execution plan is the last stage of the process of complex services composition in systems based on the SOA paradigm. In general this task consists of choosing proper versions of atomic services, delivering requested functionalities, such that non-functional requirements for complex service are satisfied. In most real-life cases this task is reduced to the problem of multidimensional knapsack problem (MKP), which is known to be NP-hard. Therefore, in order to facilitate effective complex service composition, it is crucial to provide an efficient MKP solution algorithm. In this paper a novel approach to the problem of optimization of complex service execution plan is introduced. In the proposed approach the MKP feasible solution space is constructed in such a way, that the optimal solution can be found in constant time. Of course, since MKP is NP-hard, the process of solution space construction takes an exponential time, This time, however, is amortized by multiple usages of single solution space for determination of optimal execution plans for multiple complex service requests.','{Graph-fold: an Efficient Method for Complex Service Execution Plan Optimization}',0,0,2010,0,NULL,NULL,'SOA; Optimization','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(678,'paper','RyGo2011-ICSEng','inproceedings','@inproceedings{RyGo2011-ICSEng,\n address = {Los Alamitos, California USA},\n author = {Piotr Rygielski and Adam Gonczarek},\n booktitle = {ICSEng 2011: Proceedings of the 21st international conference on Systems Engineering (ICSEng 2011)},\n day = {16--18},\n editor = {Henry Selvaraj and Dawid Zydek},\n location = {Las Vegas, Nevada, USA},\n month = {August},\n pages = {212--216},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/678.pdf},\n publisher = {IEEE Computer Society\'s Conference Publishing Services},\n title = {{Migration-aware Optimization of Virtualized Computational Resources Allocation in Complex Systems}},\n year = {2011},\n abstract = {In this paper a task of resources allocation in the complex system is considered. Novelty of the formulated task consists of assumption that the applications assigned with resources of one machine can be migrated to another machine during system lifetime. The formulated task has been solved using proposed heuristic optimization method. Due to non-convex set of valid solutions the optimization procedure has been decomposed into two stages and forms approach similar to the relax-and-round approach. Proposed decomposition approach facilitates fast algorithm convergence and guaranties that achieved solution satisfies assumed constraints},\n}\n\n','\n\nPiotr Rygielski and Adam Gonczarek.\nMigration-aware Optimization of Virtualized Computational Resources\nAllocation in Complex Systems.\nIn ICSEng 2011: Proceedings of the 21st international conference\non Systems Engineering (ICSEng 2011), Henry Selvaraj and Dawid Zydek,\neditors, Las Vegas, Nevada, USA, August 16-18, 2011, pages 212-216. IEEE\nComputer Society\'s Conference Publishing Services, Los Alamitos, California\nUSA.\nAugust 2011.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{RyGo2011-ICSEng,\naddress = {Los Alamitos, California USA},\nauthor = {Piotr Rygielski and Adam Gonczarek},\nbooktitle = {ICSEng 2011: Proceedings of the 21st international conference on Systems Engineering (ICSEng 2011)},\nday = {16--18},\neditor = {Henry Selvaraj and Dawid Zydek},\nlocation = {Las Vegas, Nevada, USA},\nmonth = {August},\npages = {212--216},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/678.pdf},\npublisher = {IEEE Computer Society\'s Conference Publishing Services},\ntitle = {{Migration-aware Optimization of Virtualized Computational Resources Allocation in Complex Systems}},\nyear = {2011},\nabstract = {In this paper a task of resources allocation in the complex system is considered. Novelty of the formulated task consists of assumption that the applications assigned with resources of one machine can be migrated to another machine during system lifetime. The formulated task has been solved using proposed heuristic optimization method. Due to non-convex set of valid solutions the optimization procedure has been decomposed into two stages and forms approach similar to the relax-and-round approach. Proposed decomposition approach facilitates fast algorithm convergence and guaranties that achieved solution satisfies assumed constraints}\n}\n
\n
\nIn this paper a task of resources allocation in the complex system is considered. Novelty of the formulated task consists of assumption that the applications assigned with resources of one machine can be migrated to another machine during system lifetime. The formulated task has been solved using proposed heuristic optimization method. Due to non-convex set of valid solutions the optimization procedure has been decomposed into two stages and forms approach similar to the relax-and-round approach. Proposed decomposition approach facilitates fast algorithm convergence and guaranties that achieved solution satisfies assumed constraints\n
\n','
\n@inproceedings{RyGo2011-ICSEng,\n  address = {Los Alamitos, California USA},\n  author = {Piotr Rygielski and Adam Gonczarek},\n  booktitle = {ICSEng 2011: Proceedings of the 21st international conference on Systems Engineering (ICSEng 2011)},\n  day = {16--18},\n  editor = {Henry Selvaraj and Dawid Zydek},\n  location = {Las Vegas, Nevada, USA},\n  month = {August},\n  pages = {212--216},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/678.pdf},\n  publisher = {IEEE Computer Society\'s Conference Publishing Services},\n  title = {{Migration-aware Optimization of Virtualized Computational Resources Allocation in Complex Systems}},\n  year = {2011},\n  abstract = {In this paper a task of resources allocation in the complex system is considered. Novelty of the formulated task consists of assumption that the applications assigned with resources of one machine can be migrated to another machine during system lifetime. The formulated task has been solved using proposed heuristic optimization method. Due to non-convex set of valid solutions the optimization procedure has been decomposed into two stages and forms approach similar to the relax-and-round approach. Proposed decomposition approach facilitates fast algorithm convergence and guaranties that achieved solution satisfies assumed constraints}\n}\n
\n\n','In this paper a task of resources allocation in the complex system is considered. Novelty of the formulated task consists of assumption that the applications assigned with resources of one machine can be migrated to another machine during system lifetime. The formulated task has been solved using proposed heuristic optimization method. Due to non-convex set of valid solutions the optimization procedure has been decomposed into two stages and forms approach similar to the relax-and-round approach. Proposed decomposition approach facilitates fast algorithm convergence and guaranties that achieved solution satisfies assumed constraints','{Migration-aware Optimization of Virtualized Computational Resources Allocation in Complex Systems}',0,8,2011,8,NULL,NULL,'SOA; Optimization; Virtualization; Resource Management','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(679,'paper','GrRy2010-KES','inproceedings','@inproceedings{GrRy2010-KES,\n address = {Berlin, Heidelberg},\n author = {Grzech, Adam and Rygielski, Piotr},\n booktitle = {Proceedings of the 14th International Conference on Knowledge-based and Intelligent Information and Engineering Systems (KES 2010)},\n day = {8--10},\n editor = {Setchi, Rossitza and Jordanov, Ivan},\n isbn = {978-3-642-15389-1},\n location = {Cardiff, UK},\n month = {September},\n pages = {523--532},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/679.pdf},\n publisher = {Springer-Verlag},\n series = {Lecture Notes in Computer Science (LNCS)},\n title = {{Translations of Service Level Agreement in Systems Based on Service Oriented Architecture}},\n url = {http://dl.acm.org/citation.cfm?id=1885375.1885435},\n volume = {6277},\n year = {2010},\n abstract = {The gain of the paper is to introduce and to discuss a formal specification of computer system’s Service Level Agreement (SLA) and its translation into structure of complex services (composed of atomic services) delivering required functionalities and non-functionalities in distributed environment. The SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define structure of the adequate complex services as a directed graph, where potential parallelism of atomic services performance may be taken into account. The qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structure are available in the environment in different versions and locations. Different versions of atomic services are delivering the required functionalities and satisfy non-functionalities at various levels. Various locations of atomic services means that the time and cost of atomic services delivery (communication and calculation) may vary. Proposed model of SLA translation into complex services causes that a scenario variants may be applied — among others — to calculate upper and lower complex services’ delivering times and to estimate validity of possible parallelism in complex services.},\n}\n\n','\n\nAdam Grzech and Piotr Rygielski.\nTranslations of Service Level Agreement in Systems Based on Service\nOriented Architecture.\nIn Proceedings of the 14th International Conference on\nKnowledge-based and Intelligent Information and Engineering Systems (KES\n2010), Rossitza Setchi and Ivan Jordanov, editors, Cardiff, UK, September\n8-10, 2010, volume 6277 of Lecture Notes in Computer Science (LNCS),\npages 523-532. Springer-Verlag, Berlin, Heidelberg.\nSeptember 2010.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{GrRy2010-KES,\naddress = {Berlin, Heidelberg},\nauthor = {Grzech, Adam and Rygielski, Piotr},\nbooktitle = {Proceedings of the 14th International Conference on Knowledge-based and Intelligent Information and Engineering Systems (KES 2010)},\nday = {8--10},\neditor = {Setchi, Rossitza and Jordanov, Ivan},\nisbn = {978-3-642-15389-1},\nlocation = {Cardiff, UK},\nmonth = {September},\npages = {523--532},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/679.pdf},\npublisher = {Springer-Verlag},\nseries = {Lecture Notes in Computer Science (LNCS)},\ntitle = {{Translations of Service Level Agreement in Systems Based on Service Oriented Architecture}},\nurl = {http://dl.acm.org/citation.cfm?id=1885375.1885435},\nvolume = {6277},\nyear = {2010},\nabstract = {The gain of the paper is to introduce and to discuss a formal specification of computer system’s Service Level Agreement (SLA) and its translation into structure of complex services (composed of atomic services) delivering required functionalities and non-functionalities in distributed environment. The SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define structure of the adequate complex services as a directed graph, where potential parallelism of atomic services performance may be taken into account. The qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structure are available in the environment in different versions and locations. Different versions of atomic services are delivering the required functionalities and satisfy non-functionalities at various levels. Various locations of atomic services means that the time and cost of atomic services delivery (communication and calculation) may vary. Proposed model of SLA translation into complex services causes that a scenario variants may be applied — among others — to calculate upper and lower complex services’ delivering times and to estimate validity of possible parallelism in complex services.}\n}\n
\n
\nThe gain of the paper is to introduce and to discuss a formal specification of computer system’s Service Level Agreement (SLA) and its translation into structure of complex services (composed of atomic services) delivering required functionalities and non-functionalities in distributed environment. The SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define structure of the adequate complex services as a directed graph, where potential parallelism of atomic services performance may be taken into account. The qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structure are available in the environment in different versions and locations. Different versions of atomic services are delivering the required functionalities and satisfy non-functionalities at various levels. Various locations of atomic services means that the time and cost of atomic services delivery (communication and calculation) may vary. Proposed model of SLA translation into complex services causes that a scenario variants may be applied — among others — to calculate upper and lower complex services’ delivering times and to estimate validity of possible parallelism in complex services.\n
\n','
\n@inproceedings{GrRy2010-KES,\n  address = {Berlin, Heidelberg},\n  author = {Grzech, Adam and Rygielski, Piotr},\n  booktitle = {Proceedings of the 14th International Conference on Knowledge-based and Intelligent Information and Engineering Systems (KES 2010)},\n  day = {8--10},\n  editor = {Setchi, Rossitza and Jordanov, Ivan},\n  isbn = {978-3-642-15389-1},\n  location = {Cardiff, UK},\n  month = {September},\n  pages = {523--532},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/679.pdf},\n  publisher = {Springer-Verlag},\n  series = {Lecture Notes in Computer Science (LNCS)},\n  title = {{Translations of Service Level Agreement in Systems Based on Service Oriented Architecture}},\n  url = {http://dl.acm.org/citation.cfm?id=1885375.1885435},\n  volume = {6277},\n  year = {2010},\n  abstract = {The gain of the paper is to introduce and to discuss a formal specification of computer system’s Service Level Agreement (SLA) and its translation into structure of complex services (composed of atomic services) delivering required functionalities and non-functionalities in distributed environment. The SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define structure of the adequate complex services as a directed graph, where potential parallelism of atomic services performance may be taken into account. The qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structure are available in the environment in different versions and locations. Different versions of atomic services are delivering the required functionalities and satisfy non-functionalities at various levels. Various locations of atomic services means that the time and cost of atomic services delivery (communication and calculation) may vary. Proposed model of SLA translation into complex services causes that a scenario variants may be applied — among others — to calculate upper and lower complex services’ delivering times and to estimate validity of possible parallelism in complex services.}\n}\n
\n\n','The gain of the paper is to introduce and to discuss a formal specification of computer system’s Service Level Agreement (SLA) and its translation into structure of complex services (composed of atomic services) delivering required functionalities and non-functionalities in distributed environment. The SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define structure of the adequate complex services as a directed graph, where potential parallelism of atomic services performance may be taken into account. The qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structure are available in the environment in different versions and locations. Different versions of atomic services are delivering the required functionalities and satisfy non-functionalities at various levels. Various locations of atomic services means that the time and cost of atomic services delivery (communication and calculation) may vary. Proposed model of SLA translation into complex services causes that a scenario variants may be applied — among others — to calculate upper and lower complex services’ delivering times and to estimate validity of possible parallelism in complex services.','{Translations of Service Level Agreement in Systems Based on Service Oriented Architecture}',0,9,2010,9,NULL,NULL,'SOA; Optimization','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(680,'paper','SwRy2011-CIST','inproceedings','@inproceedings{SwRy2011-CIST,\n author = {\\\'{S}wi\\k{a}tek, Pawe{\\l} and Rygielski, Piotr},\n booktitle = {{Proceedings of the VIth International Scientific and Technical Conference (CSIT 2011)}},\n day = {16--19},\n location = {Lviv, Ukraine},\n month = {November},\n pages = {136--139},\n publisher = {Publishing House Vezha&Co},\n title = {{Universal Comunication Platform for QoS-aware Delivery of Complex Services}},\n year = {2011},\n}\n\n','\n\nPawel Świątek and Piotr Rygielski.\nUniversal Comunication Platform for QoS-aware Delivery of Complex\nServices.\nIn Proceedings of the VIth International Scientific and\nTechnical Conference (CSIT 2011), Lviv, Ukraine, November 16-19, 2011,\npages 136-139. Publishing House Vezha&Co.\nNovember 2011.\n[ bib  ] 
\n@inproceedings{SwRy2011-CIST,\nauthor = {\\\'{S}wi\\k{a}tek, Pawe{\\l} and Rygielski, Piotr},\nbooktitle = {{Proceedings of the VIth International Scientific and Technical Conference (CSIT 2011)}},\nday = {16--19},\nlocation = {Lviv, Ukraine},\nmonth = {November},\npages = {136--139},\npublisher = {Publishing House Vezha&Co},\ntitle = {{Universal Comunication Platform for QoS-aware Delivery of Complex Services}},\nyear = {2011}\n}\n
\n
\n','
\n@inproceedings{SwRy2011-CIST,\n  author = {\\\'{S}wi\\k{a}tek, Pawe{\\l} and Rygielski, Piotr},\n  booktitle = {{Proceedings of the VIth International Scientific and Technical Conference (CSIT 2011)}},\n  day = {16--19},\n  location = {Lviv, Ukraine},\n  month = {November},\n  pages = {136--139},\n  publisher = {Publishing House Vezha&Co},\n  title = {{Universal Comunication Platform for QoS-aware Delivery of Complex Services}},\n  year = {2011}\n}\n
\n\n',NULL,'{Universal Comunication Platform for QoS-aware Delivery of Complex Services}',0,11,2011,11,NULL,NULL,'SOA; Virtualization; Resource Management; QoS in Networks; Networking','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(681,'paper','GrSwRy2010-IFIP','incollection','@incollection{GrSwRy2010-IFIP,\n address = {Boston},\n author = {Grzech, Adam and \\\'Swi\\k{a}tek, Pawel and Rygielski, Piotr},\n booktitle = {Software Services for e-World},\n editor = {Cellary, Wojciech and Estevez, Elsa},\n isbn = {978-3-642-16282-4},\n month = {November},\n pages = {17--28},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/681.pdf},\n publisher = {Springer},\n series = {IFIP Advances in Information and Communication Technology},\n title = {{Dynamic Resources Allocation for Delivery of Personalized Services}},\n url = {http://dx.doi.org/10.1007/978-3-642-16283-1_6},\n volume = {341},\n year = {2010},\n abstract = {The aim of this paper is to introduce a problem of e-health services quality management. The process of delivering e-health services to users consists of two major tasks: service personalization and resources allocation. In this paper we introduce a use-cases of e-health system and distinguish services that can be offered. In order to satisfy user requirements one have to manage resources properly especially when communication conditions change (e.g. in an ambulance). An exemplary solution has been presented and conclusions for further work have been formulated.},\n}\n\n','\n\nAdam Grzech, Pawel Świątek, and Piotr Rygielski.\nDynamic Resources Allocation for Delivery of Personalized Services.\nIn Software Services for e-World, Wojciech Cellary and Elsa\nEstevez, editors, volume 341 of IFIP Advances in Information and\nCommunication Technology, pages 17-28. Springer, Boston, November 2010.\n[ bib | http | .pdf | Abstract  ] 
\n@incollection{GrSwRy2010-IFIP,\naddress = {Boston},\nauthor = {Grzech, Adam and \\\'Swi\\k{a}tek, Pawel and Rygielski, Piotr},\nbooktitle = {Software Services for e-World},\neditor = {Cellary, Wojciech and Estevez, Elsa},\nisbn = {978-3-642-16282-4},\nmonth = {November},\npages = {17--28},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/681.pdf},\npublisher = {Springer},\nseries = {IFIP Advances in Information and Communication Technology},\ntitle = {{Dynamic Resources Allocation for Delivery of Personalized Services}},\nurl = {http://dx.doi.org/10.1007/978-3-642-16283-1_6},\nvolume = {341},\nyear = {2010},\nabstract = {The aim of this paper is to introduce a problem of e-health services quality management. The process of delivering e-health services to users consists of two major tasks: service personalization and resources allocation. In this paper we introduce a use-cases of e-health system and distinguish services that can be offered. In order to satisfy user requirements one have to manage resources properly especially when communication conditions change (e.g. in an ambulance). An exemplary solution has been presented and conclusions for further work have been formulated.}\n}\n
\n
\nThe aim of this paper is to introduce a problem of e-health services quality management. The process of delivering e-health services to users consists of two major tasks: service personalization and resources allocation. In this paper we introduce a use-cases of e-health system and distinguish services that can be offered. In order to satisfy user requirements one have to manage resources properly especially when communication conditions change (e.g. in an ambulance). An exemplary solution has been presented and conclusions for further work have been formulated.\n
\n','
\n@incollection{GrSwRy2010-IFIP,\n  address = {Boston},\n  author = {Grzech, Adam and \\\'Swi\\k{a}tek, Pawel and Rygielski, Piotr},\n  booktitle = {Software Services for e-World},\n  editor = {Cellary, Wojciech and Estevez, Elsa},\n  isbn = {978-3-642-16282-4},\n  month = {November},\n  pages = {17--28},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/681.pdf},\n  publisher = {Springer},\n  series = {IFIP Advances in Information and Communication Technology},\n  title = {{Dynamic Resources Allocation for Delivery of Personalized Services}},\n  url = {http://dx.doi.org/10.1007/978-3-642-16283-1_6},\n  volume = {341},\n  year = {2010},\n  abstract = {The aim of this paper is to introduce a problem of e-health services quality management. The process of delivering e-health services to users consists of two major tasks: service personalization and resources allocation. In this paper we introduce a use-cases of e-health system and distinguish services that can be offered. In order to satisfy user requirements one have to manage resources properly especially when communication conditions change (e.g. in an ambulance). An exemplary solution has been presented and conclusions for further work have been formulated.}\n}\n
\n\n','The aim of this paper is to introduce a problem of e-health services quality management. The process of delivering e-health services to users consists of two major tasks: service personalization and resources allocation. In this paper we introduce a use-cases of e-health system and distinguish services that can be offered. In order to satisfy user requirements one have to manage resources properly especially when communication conditions change (e.g. in an ambulance). An exemplary solution has been presented and conclusions for further work have been formulated.','{Dynamic Resources Allocation for Delivery of Personalized Services}',0,11,2010,11,NULL,NULL,'Virtualization; Resource Management; QoS in Networks; Networking','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(682,'paper','SwRyJuGr2012-CBS','article','@article{SwRyJuGr2012-CBS,\n address = {Bristol, PA, USA},\n author = {Pawe{l} \\\'{S}wi\\k{a}tek and Piotr Rygielski and Krzysztof Juszczyszyn and Adam Grzech},\n isbn = {0196-9722},\n journal = {{Cybernetics and Systems: An International Journal (CBS)}},\n month = {May},\n number = {4},\n pages = {340--353},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/682.pdf},\n publisher = {Taylor & Francis, Inc.},\n title = {{User Assignment and Movement Prediction in Wireless Networks}},\n url = {http://www.tandfonline.com/doi/abs/10.1080/01969722.2012.678219},\n volume = {43},\n note = {5-Year Impact Factor (2014): 0.968},\n year = {2012},\n abstract = {The article is devoted to the problem of mobility and resource management in heterogeneous wireless networks. It is assumed that in certain areas covered by multiple overlapping wireless networks there are a certain number of mobile clients that consume networks resources by use of the available communication services (e.g., voice or data transmission) delivered by network providers. Moreover, it is assumed that the continuity of communication services may be assured by the use of common handover techniques supporting client mobility (e.g., Mobile IPv6, IEEE 802.21, etc.). The task of mobility and resource management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g., utilization of network resources). In this article we show that gathering knowledge about client movements and prediction of their future positions may significantly improve the overall quality of the services delivered and network resource utilization.},\n}\n\n','\n\nPawel Świątek, Piotr Rygielski, Krzysztof Juszczyszyn, and Adam\nGrzech.\nUser Assignment and Movement Prediction in Wireless Networks.\nCybernetics and Systems: An International Journal (CBS),\n43(4):340-353, May 2012, Taylor & Francis, Inc., Bristol, PA, USA.\n5-Year Impact Factor (2014): 0.968.\n[ bib | http | .pdf | Abstract  ] 
\n@article{SwRyJuGr2012-CBS,\naddress = {Bristol, PA, USA},\nauthor = {Pawe{l} \\\'{S}wi\\k{a}tek and Piotr Rygielski and Krzysztof Juszczyszyn and Adam Grzech},\nisbn = {0196-9722},\njournal = {{Cybernetics and Systems: An International Journal (CBS)}},\nmonth = {May},\nnumber = {4},\npages = {340--353},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/682.pdf},\npublisher = {Taylor & Francis, Inc.},\ntitle = {{User Assignment and Movement Prediction in Wireless Networks}},\nurl = {http://www.tandfonline.com/doi/abs/10.1080/01969722.2012.678219},\nvolume = {43},\nnote = {5-Year Impact Factor (2014): 0.968},\nyear = {2012},\nabstract = {The article is devoted to the problem of mobility and resource management in heterogeneous wireless networks. It is assumed that in certain areas covered by multiple overlapping wireless networks there are a certain number of mobile clients that consume networks resources by use of the available communication services (e.g., voice or data transmission) delivered by network providers. Moreover, it is assumed that the continuity of communication services may be assured by the use of common handover techniques supporting client mobility (e.g., Mobile IPv6, IEEE 802.21, etc.). The task of mobility and resource management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g., utilization of network resources). In this article we show that gathering knowledge about client movements and prediction of their future positions may significantly improve the overall quality of the services delivered and network resource utilization.}\n}\n
\n
\nThe article is devoted to the problem of mobility and resource management in heterogeneous wireless networks. It is assumed that in certain areas covered by multiple overlapping wireless networks there are a certain number of mobile clients that consume networks resources by use of the available communication services (e.g., voice or data transmission) delivered by network providers. Moreover, it is assumed that the continuity of communication services may be assured by the use of common handover techniques supporting client mobility (e.g., Mobile IPv6, IEEE 802.21, etc.). The task of mobility and resource management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g., utilization of network resources). In this article we show that gathering knowledge about client movements and prediction of their future positions may significantly improve the overall quality of the services delivered and network resource utilization.\n
\n','
\n@article{SwRyJuGr2012-CBS,\n  address = {Bristol, PA, USA},\n  author = {Pawe{l} \\\'{S}wi\\k{a}tek and Piotr Rygielski and Krzysztof Juszczyszyn and Adam Grzech},\n  isbn = {0196-9722},\n  journal = {{Cybernetics and Systems: An International Journal (CBS)}},\n  month = {May},\n  number = {4},\n  pages = {340--353},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/682.pdf},\n  publisher = {Taylor & Francis, Inc.},\n  title = {{User Assignment and Movement Prediction in Wireless Networks}},\n  url = {http://www.tandfonline.com/doi/abs/10.1080/01969722.2012.678219},\n  volume = {43},\n  note = {5-Year Impact Factor (2014): 0.968},\n  year = {2012},\n  abstract = {The article is devoted to the problem of mobility and resource management in heterogeneous wireless networks. It is assumed that in certain areas covered by multiple overlapping wireless networks there are a certain number of mobile clients that consume networks resources by use of the available communication services (e.g., voice or data transmission) delivered by network providers. Moreover, it is assumed that the continuity of communication services may be assured by the use of common handover techniques supporting client mobility (e.g., Mobile IPv6, IEEE 802.21, etc.). The task of mobility and resource management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g., utilization of network resources). In this article we show that gathering knowledge about client movements and prediction of their future positions may significantly improve the overall quality of the services delivered and network resource utilization.}\n}\n
\n\n','The article is devoted to the problem of mobility and resource management in heterogeneous wireless networks. It is assumed that in certain areas covered by multiple overlapping wireless networks there are a certain number of mobile clients that consume networks resources by use of the available communication services (e.g., voice or data transmission) delivered by network providers. Moreover, it is assumed that the continuity of communication services may be assured by the use of common handover techniques supporting client mobility (e.g., Mobile IPv6, IEEE 802.21, etc.). The task of mobility and resource management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g., utilization of network resources). In this article we show that gathering knowledge about client movements and prediction of their future positions may significantly improve the overall quality of the services delivered and network resource utilization.','{User Assignment and Movement Prediction in Wireless Networks}',0,5,2012,5,NULL,NULL,'Resource Management; QoS in Networks; Prediction; Networking','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(683,'paper','rygielski2009a','mastersthesis','@mastersthesis{rygielski2009a,\n abstract = {In this thesis, the problem of controlling network traffic for guaranteeing demanded Quality of Service level was presented. An architecture for network node with parallel processing units was considered and exemplary problems of teletraffic control were formulated. The process of service is a multistage process. A simulation environment was designed and developed for the needs of quantitatively analysis of control algorithms placed on the node. There were load balancing and packet scheduling algorithms implemented. Exemplary simulations were run to present functionality of environment and the way, users should implement their own, new algorithms was presented. At the end, the work was summarised and the future work plans were presented.},\n address = {Wybrze{\\.z}e Wyspia{\\\'n}skiego 27, 50-370 Wroclaw, Poland},\n author = {Piotr Rygielski},\n month = {July},\n note = {The work is written in Polish language.},\n school = {Wroclaw University of Technology},\n title = {{Software implementation of the simulation environment of the system for multistage parallel processing of teletraffic in the node of the packet-switched network for traffic control algorithms performance analysis purposes.}},\n year = {2009},\n}\n\n','\n\nPiotr Rygielski.\nSoftware implementation of the simulation environment of the system\nfor multistage parallel processing of teletraffic in the node of the\npacket-switched network for traffic control algorithms performance analysis\npurposes.\nMaster\'s thesis, Wroclaw University of Technology, Wybrzeże\nWyspiańskiego 27, 50-370 Wroclaw, Poland, July 2009.\nThe work is written in Polish language.\n[ bib | Abstract  ] 
\n@mastersthesis{rygielski2009a,\nabstract = {In this thesis, the problem of controlling network traffic for guaranteeing demanded Quality of Service level was presented. An architecture for network node with parallel processing units was considered and exemplary problems of teletraffic control were formulated. The process of service is a multistage process. A simulation environment was designed and developed for the needs of quantitatively analysis of control algorithms placed on the node. There were load balancing and packet scheduling algorithms implemented. Exemplary simulations were run to present functionality of environment and the way, users should implement their own, new algorithms was presented. At the end, the work was summarised and the future work plans were presented.},\naddress = {Wybrze{\\.z}e Wyspia{\\\'n}skiego 27, 50-370 Wroclaw, Poland},\nauthor = {Piotr Rygielski},\nmonth = {July},\nnote = {The work is written in Polish language.},\nschool = {Wroclaw University of Technology},\ntitle = {{Software implementation of the simulation environment of the system for multistage parallel processing of teletraffic in the node of the packet-switched network for traffic control algorithms performance analysis purposes.}},\nyear = {2009}\n}\n
\n
\nIn this thesis, the problem of controlling network traffic for guaranteeing demanded Quality of Service level was presented. An architecture for network node with parallel processing units was considered and exemplary problems of teletraffic control were formulated. The process of service is a multistage process. A simulation environment was designed and developed for the needs of quantitatively analysis of control algorithms placed on the node. There were load balancing and packet scheduling algorithms implemented. Exemplary simulations were run to present functionality of environment and the way, users should implement their own, new algorithms was presented. At the end, the work was summarised and the future work plans were presented.\n
\n','
\n@mastersthesis{rygielski2009a,\n  abstract = {In this thesis, the problem of controlling network traffic for guaranteeing demanded Quality of Service level was presented. An architecture for network node with parallel processing units was considered and exemplary problems of teletraffic control were formulated. The process of service is a multistage process. A simulation environment was designed and developed for the needs of quantitatively analysis of control algorithms placed on the node. There were load balancing and packet scheduling algorithms implemented. Exemplary simulations were run to present functionality of environment and the way, users should implement their own, new algorithms was presented. At the end, the work was summarised and the future work plans were presented.},\n  address = {Wybrze{\\.z}e Wyspia{\\\'n}skiego 27, 50-370 Wroclaw, Poland},\n  author = {Piotr Rygielski},\n  month = {July},\n  note = {The work is written in Polish language.},\n  school = {Wroclaw University of Technology},\n  title = {{Software implementation of the simulation environment of the system for multistage parallel processing of teletraffic in the node of the packet-switched network for traffic control algorithms performance analysis purposes.}},\n  year = {2009}\n}\n
\n\n','In this thesis, the problem of controlling network traffic for guaranteeing demanded Quality of Service level was presented. An architecture for network node with parallel processing units was considered and exemplary problems of teletraffic control were formulated. The process of service is a multistage process. A simulation environment was designed and developed for the needs of quantitatively analysis of control algorithms placed on the node. There were load balancing and packet scheduling algorithms implemented. Exemplary simulations were run to present functionality of environment and the way, users should implement their own, new algorithms was presented. At the end, the work was summarised and the future work plans were presented.','{Software implementation of the simulation environment of the system for multistage parallel processing of teletraffic in the node of the packet-switched network for traffic control algorithms performance analysis purposes.}',0,7,2009,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(684,'paper','SPEC-RG-NEWSLETTER-1','misc','@misc{SPEC-RG-NEWSLETTER-1,\n author = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\n month = {September},\n note = {Published by Standard Performance Evaluation Corporation (SPEC)},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/684.pdf},\n title = {{SPEC Research Group Newsletter, vol. 1 no. 1}},\n url = {http://research.spec.org/en/newsletter.html},\n year = {2012},\n}\n\n','\n\nSamuel Kounev, Kai Sachs, and Piotr Rygielski.\nSPEC Research Group Newsletter, vol. 1 no. 1, September 2012.\nPublished by Standard Performance Evaluation Corporation (SPEC).\n[ bib | .html | .pdf  ] 
\n@misc{SPEC-RG-NEWSLETTER-1,\nauthor = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\nmonth = {September},\nnote = {Published by Standard Performance Evaluation Corporation (SPEC)},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/684.pdf},\ntitle = {{SPEC Research Group Newsletter, vol. 1 no. 1}},\nurl = {http://research.spec.org/en/newsletter.html},\nyear = {2012}\n}\n
\n
\n','
\n@misc{SPEC-RG-NEWSLETTER-1,\n  author = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\n  month = {September},\n  note = {Published by Standard Performance Evaluation Corporation (SPEC)},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/684.pdf},\n  title = {{SPEC Research Group Newsletter, vol. 1 no. 1}},\n  url = {http://research.spec.org/en/newsletter.html},\n  year = {2012}\n}\n
\n\n',NULL,'{SPEC Research Group Newsletter, vol. 1 no. 1}',0,9,2012,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(685,'paper','SPEC-RG-NEWSLETTER-2','misc','@misc{SPEC-RG-NEWSLETTER-2,\n author = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\n month = {June},\n note = {Published by Standard Performance Evaluation Corporation (SPEC)},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/685.pdf},\n title = {{SPEC Research Group Newsletter, vol. 1 no. 2}},\n url = {http://research.spec.org/en/newsletter.html},\n year = {2013},\n}\n\n','\n\nSamuel Kounev, Kai Sachs, and Piotr Rygielski.\nSPEC Research Group Newsletter, vol. 1 no. 2, June 2013.\nPublished by Standard Performance Evaluation Corporation (SPEC).\n[ bib | .html | .pdf  ] 
\n@misc{SPEC-RG-NEWSLETTER-2,\nauthor = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\nmonth = {June},\nnote = {Published by Standard Performance Evaluation Corporation (SPEC)},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/685.pdf},\ntitle = {{SPEC Research Group Newsletter, vol. 1 no. 2}},\nurl = {http://research.spec.org/en/newsletter.html},\nyear = {2013}\n}\n
\n
\n','
\n@misc{SPEC-RG-NEWSLETTER-2,\n  author = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\n  month = {June},\n  note = {Published by Standard Performance Evaluation Corporation (SPEC)},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/685.pdf},\n  title = {{SPEC Research Group Newsletter, vol. 1 no. 2}},\n  url = {http://research.spec.org/en/newsletter.html},\n  year = {2013}\n}\n
\n\n',NULL,'{SPEC Research Group Newsletter, vol. 1 no. 2}',0,6,2013,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(686,'paper','RyKoZs2013-ThroughputPrediction','inproceedings','@inproceedings{RyKoZs2013-ThroughputPrediction,\n author = {Piotr Rygielski and Samuel Kounev and Steffen Zschaler},\n booktitle = {{Proceedings of the 2nd IEEE International Workshop on Measurements and Networking (M\\&N 2013)}},\n day = {7--8},\n location = {Naples, Italy},\n month = {October},\n pages = {167--172},\n isbn = {978-1-4673-2873-9},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/686.pdf},\n title = {{Model-Based Throughput Prediction in Data Center Networks}},\n year = {2013},\n abstract = {In this paper, we address the problem of performance analysis in computer networks. We present a new meta-model designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. We evaluate the approach in a case study of a road traffic monitoring system. We compare the performance prediction results against the real system and a benchmark. The presented results show that our approach, despite of introducing many modeling abstractions, delivers predictions with errors less than 32% and correctly detects bottlenecks in the modeled network.},\n}\n\n','\n\nPiotr Rygielski, Samuel Kounev, and Steffen Zschaler.\nModel-Based Throughput Prediction in Data Center Networks.\nIn Proceedings of the 2nd IEEE International Workshop on\nMeasurements and Networking (M&N 2013), Naples, Italy, October 7-8, 2013,\npages 167-172.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{RyKoZs2013-ThroughputPrediction,\nauthor = {Piotr Rygielski and Samuel Kounev and Steffen Zschaler},\nbooktitle = {{Proceedings of the 2nd IEEE International Workshop on Measurements and Networking (M\\&N 2013)}},\nday = {7--8},\nlocation = {Naples, Italy},\nmonth = {October},\npages = {167--172},\nisbn = {978-1-4673-2873-9},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/686.pdf},\ntitle = {{Model-Based Throughput Prediction in Data Center Networks}},\nyear = {2013},\nabstract = {In this paper, we address the problem of performance analysis in computer networks. We present a new meta-model designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. We evaluate the approach in a case study of a road traffic monitoring system. We compare the performance prediction results against the real system and a benchmark. The presented results show that our approach, despite of introducing many modeling abstractions, delivers predictions with errors less than 32% and correctly detects bottlenecks in the modeled network.}\n}\n
\n
\nIn this paper, we address the problem of performance analysis in computer networks. We present a new meta-model designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. We evaluate the approach in a case study of a road traffic monitoring system. We compare the performance prediction results against the real system and a benchmark. The presented results show that our approach, despite of introducing many modeling abstractions, delivers predictions with errors less than 32% and correctly detects bottlenecks in the modeled network.\n
\n','
\n@inproceedings{RyKoZs2013-ThroughputPrediction,\n  author = {Piotr Rygielski and Samuel Kounev and Steffen Zschaler},\n  booktitle = {{Proceedings of the 2nd IEEE International Workshop on Measurements and Networking (M\\&N 2013)}},\n  day = {7--8},\n  location = {Naples, Italy},\n  month = {October},\n  pages = {167--172},\n  isbn = {978-1-4673-2873-9},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/686.pdf},\n  title = {{Model-Based Throughput Prediction in Data Center Networks}},\n  year = {2013},\n  abstract = {In this paper, we address the problem of performance analysis in computer networks. We present a new meta-model designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. We evaluate the approach in a case study of a road traffic monitoring system. We compare the performance prediction results against the real system and a benchmark. The presented results show that our approach, despite of introducing many modeling abstractions, delivers predictions with errors less than 32% and correctly detects bottlenecks in the modeled network.}\n}\n
\n\n','In this paper, we address the problem of performance analysis in computer networks. We present a new meta-model designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. We evaluate the approach in a case study of a road traffic monitoring system. We compare the performance prediction results against the real system and a benchmark. The presented results show that our approach, despite of introducing many modeling abstractions, delivers predictions with errors less than 32% and correctly detects bottlenecks in the modeled network.','{Model-Based Throughput Prediction in Data Center Networks}',0,10,2013,10,NULL,NULL,'Networking; Simulation; Modeling; Performance; Prediction','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(688,'paper','KrLoKo2013-CGC-FeedbackController','inproceedings','@inproceedings{KrLoKo2013-CGC-FeedbackController,\n author = {Rouven Krebs and Arpit Mehta},\n booktitle = {Proceedings of the 3rd IEEE International Conference on Cloud and Green Computing (CGC 2013)},\n location = {Karlsruhe, Germany},\n title = {{A Feedback Controlled Scheduler for Performance Isolation in Multi-tenant Applications}},\n notes = {Poster},\n year = {2013},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/688.pdf},\n}\n\n','\n\nRouven Krebs and Arpit Mehta.\nA Feedback Controlled Scheduler for Performance Isolation in\nMulti-tenant Applications.\nIn Proceedings of the 3rd IEEE International Conference on Cloud\nand Green Computing (CGC 2013), Karlsruhe, Germany, 2013.\n[ bib | .pdf  ] 
\n@inproceedings{KrLoKo2013-CGC-FeedbackController,\nauthor = {Rouven Krebs and Arpit Mehta},\nbooktitle = {Proceedings of the 3rd IEEE International Conference on Cloud and Green Computing (CGC 2013)},\nlocation = {Karlsruhe, Germany},\ntitle = {{A Feedback Controlled Scheduler for Performance Isolation in Multi-tenant Applications}},\nnotes = {Poster},\nyear = {2013},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/688.pdf}\n}\n
\n
\n','
\n@inproceedings{KrLoKo2013-CGC-FeedbackController,\n  author = {Rouven Krebs and Arpit Mehta},\n  booktitle = {Proceedings of the 3rd IEEE International Conference on Cloud and Green Computing (CGC 2013)},\n  location = {Karlsruhe, Germany},\n  title = {{A Feedback Controlled Scheduler for Performance Isolation in Multi-tenant Applications}},\n  notes = {Poster},\n  year = {2013},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/688.pdf}\n}\n
\n\n',NULL,'{A Feedback Controlled Scheduler for Performance Isolation in Multi-tenant Applications}',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(689,'paper','MoKoJuBa2013-BMSD-SoftReservations','inproceedings','@inproceedings{MoKoJuBa2013-BMSD-SoftReservations,\n author = {Seyed Vahid Mohammadi and Samuel Kounev and Adri\\\"{a}n Juan-Verdejo and Bholanathsingh Surajbali},\n booktitle = {Proceedings of the 3rd International Symposium on Business Modeling and Software Design (BMSD 2013)},\n location = {Noordwijkerhout, The Netherlands},\n title = {{Soft Reservations: Uncertainty-Aware Resource Reservations in IaaS Environments}},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/689.pdf},\n year = {2013},\n}\n\n','\n\nSeyed Vahid Mohammadi, Samuel Kounev, Adriän Juan-Verdejo, and\nBholanathsingh Surajbali.\nSoft Reservations: Uncertainty-Aware Resource Reservations in IaaS\nEnvironments.\nIn Proceedings of the 3rd International Symposium on Business\nModeling and Software Design (BMSD 2013), Noordwijkerhout, The Netherlands,\n2013.\n[ bib | .pdf  ] 
\n@inproceedings{MoKoJuBa2013-BMSD-SoftReservations,\nauthor = {Seyed Vahid Mohammadi and Samuel Kounev and Adri\\\"{a}n Juan-Verdejo and Bholanathsingh Surajbali},\nbooktitle = {Proceedings of the 3rd International Symposium on Business Modeling and Software Design (BMSD 2013)},\nlocation = {Noordwijkerhout, The Netherlands},\ntitle = {{Soft Reservations: Uncertainty-Aware Resource Reservations in IaaS Environments}},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/689.pdf},\nyear = {2013}\n}\n
\n
\n','
\n@inproceedings{MoKoJuBa2013-BMSD-SoftReservations,\n  author = {Seyed Vahid Mohammadi and Samuel Kounev and Adri\\\"{a}n Juan-Verdejo and Bholanathsingh Surajbali},\n  booktitle = {Proceedings of the 3rd International Symposium on Business Modeling and Software Design (BMSD 2013)},\n  location = {Noordwijkerhout, The Netherlands},\n  title = {{Soft Reservations: Uncertainty-Aware Resource Reservations in IaaS Environments}},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/689.pdf},\n  year = {2013}\n}\n
\n\n',NULL,'{Soft Reservations: Uncertainty-Aware Resource Reservations in IaaS Environments}',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(690,'paper','Gorsler2013a','mastersthesis','@mastersthesis{Gorsler2013a,\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n author = {Fabian Gorsler},\n month = {July},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/690.pdf},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Online Performance Queries for Architecture-Level Performance Models}},\n year = {2013},\n}\n\n','\n\nFabian Gorsler.\nOnline Performance Queries for Architecture-Level Performance\nModels.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, July 2013.\n[ bib | .pdf  ] 
\n@mastersthesis{Gorsler2013a,\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nauthor = {Fabian Gorsler},\nmonth = {July},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/690.pdf},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Online Performance Queries for Architecture-Level Performance Models}},\nyear = {2013}\n}\n
\n
\n','
\n@mastersthesis{Gorsler2013a,\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  author = {Fabian Gorsler},\n  month = {July},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/690.pdf},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Online Performance Queries for Architecture-Level Performance Models}},\n  year = {2013}\n}\n
\n\n',NULL,'{Online Performance Queries for Architecture-Level Performance Models}',0,7,2013,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(691,'paper','Walter2013-parallel-simulation','mastersthesis','@mastersthesis{Walter2013-parallel-simulation,\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n author = {J\\\"{u}rgen Walter},\n month = {October},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Parallel Simulation of Queueing Petri Net Models}},\n year = {2013},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/691.pdf},\n type = {Master Thesis},\n abstract = {For years the CPU clock frequency was the key to improve processor performance. Nowadays, modern processors enable performance improvements by increasing the number of cores. However, existing software needs to be adapted to be able to utilize multiple cores. Such an adaptation poses many challenges in the field of discrete-event software simulation. Decades of intensive research have been spent to find a general solution for parallel discrete event simulation. In this context, QNs and PNs have been extensively studied. However, to the best of our knowledge, there is only one previous work that considers the concurrent simulation of QPN [Juergens1997]. This work focuses on comparing different synchronization algorithms and excludes a majority of lookahead calculation and net decomposition. In this thesis, we build upon and extend this work. For this purpose, we adapted and extended findings from QNs, PNs and parallel simulation in general. We apply our findings to SimQPN, which is a sequential simulation engine for QPN. Among other application areas, SimQPN is currently applied to online performance prediction for which a speedup due to parallelization is desirable. We present a parallel SimQPN implementation that employs application level and event level parallelism. A validation ensures the functional correctness of the new parallel implementations. The parallelization of multiple runs enables almost linear speedup. We parallelized the execution of a single run by the use of a conservative barrier-based synchronization algorithm. The speedup for a single run depends on the capability of the model. Hence, a number of experiments on different net characteristics were conducted showing that for certain models a superlinear speedup is possible.},\n}\n\n','\n\nJürgen Walter.\nParallel Simulation of Queueing Petri Net Models.\nMaster thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, October 2013.\n[ bib | .pdf | Abstract  ] 
\n@mastersthesis{Walter2013-parallel-simulation,\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nauthor = {J\\\"{u}rgen Walter},\nmonth = {October},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Parallel Simulation of Queueing Petri Net Models}},\nyear = {2013},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/691.pdf},\ntype = {Master Thesis},\nabstract = {For years the CPU clock frequency was the key to improve processor performance. Nowadays, modern processors enable performance improvements by increasing the number of cores. However, existing software needs to be adapted to be able to utilize multiple cores. Such an adaptation poses many challenges in the field of discrete-event software simulation. Decades of intensive research have been spent to find a general solution for parallel discrete event simulation. In this context, QNs and PNs have been extensively studied. However, to the best of our knowledge, there is only one previous work that considers the concurrent simulation of QPN [Juergens1997]. This work focuses on comparing different synchronization algorithms and excludes a majority of lookahead calculation and net decomposition. In this thesis, we build upon and extend this work. For this purpose, we adapted and extended findings from QNs, PNs and parallel simulation in general. We apply our findings to SimQPN, which is a sequential simulation engine for QPN. Among other application areas, SimQPN is currently applied to online performance prediction for which a speedup due to parallelization is desirable. We present a parallel SimQPN implementation that employs application level and event level parallelism. A validation ensures the functional correctness of the new parallel implementations. The parallelization of multiple runs enables almost linear speedup. We parallelized the execution of a single run by the use of a conservative barrier-based synchronization algorithm. The speedup for a single run depends on the capability of the model. Hence, a number of experiments on different net characteristics were conducted showing that for certain models a superlinear speedup is possible.}\n}\n
\n
\nFor years the CPU clock frequency was the key to improve processor performance. Nowadays, modern processors enable performance improvements by increasing the number of cores. However, existing software needs to be adapted to be able to utilize multiple cores. Such an adaptation poses many challenges in the field of discrete-event software simulation. Decades of intensive research have been spent to find a general solution for parallel discrete event simulation. In this context, QNs and PNs have been extensively studied. However, to the best of our knowledge, there is only one previous work that considers the concurrent simulation of QPN [Juergens1997]. This work focuses on comparing different synchronization algorithms and excludes a majority of lookahead calculation and net decomposition. In this thesis, we build upon and extend this work. For this purpose, we adapted and extended findings from QNs, PNs and parallel simulation in general. We apply our findings to SimQPN, which is a sequential simulation engine for QPN. Among other application areas, SimQPN is currently applied to online performance prediction for which a speedup due to parallelization is desirable. We present a parallel SimQPN implementation that employs application level and event level parallelism. A validation ensures the functional correctness of the new parallel implementations. The parallelization of multiple runs enables almost linear speedup. We parallelized the execution of a single run by the use of a conservative barrier-based synchronization algorithm. The speedup for a single run depends on the capability of the model. Hence, a number of experiments on different net characteristics were conducted showing that for certain models a superlinear speedup is possible.\n
\n','
\n@mastersthesis{Walter2013-parallel-simulation,\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  author = {J\\\"{u}rgen Walter},\n  month = {October},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Parallel Simulation of Queueing Petri Net Models}},\n  year = {2013},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/691.pdf},\n  type = {Master Thesis},\n  abstract = {For years the CPU clock frequency was the key to improve processor performance. Nowadays, modern processors enable performance improvements by increasing the number of cores. However, existing software needs to be adapted to be able to utilize multiple cores. Such an adaptation poses many challenges in the field of discrete-event software simulation. Decades of intensive research have been spent to find a general solution for parallel discrete event simulation. In this context, QNs and PNs have been extensively studied. However, to the best of our knowledge, there is only one previous work that considers the concurrent simulation of QPN [Juergens1997]. This work focuses on comparing different synchronization algorithms and excludes a majority of lookahead calculation and net decomposition. In this thesis, we build upon and extend this work. For this purpose, we adapted and extended findings from QNs, PNs and parallel simulation in general. We apply our findings to SimQPN, which is a sequential simulation engine for QPN. Among other application areas, SimQPN is currently applied to online performance prediction for which a speedup due to parallelization is desirable. We present a parallel SimQPN implementation that employs application level and event level parallelism. A validation ensures the functional correctness of the new parallel implementations. The parallelization of multiple runs enables almost linear speedup. We parallelized the execution of a single run by the use of a conservative barrier-based synchronization algorithm. The speedup for a single run depends on the capability of the model. Hence, a number of experiments on different net characteristics were conducted showing that for certain models a superlinear speedup is possible.}\n}\n
\n\n','For years the CPU clock frequency was the key to improve processor performance. Nowadays, modern processors enable performance improvements by increasing the number of cores. However, existing software needs to be adapted to be able to utilize multiple cores. Such an adaptation poses many challenges in the field of discrete-event software simulation. Decades of intensive research have been spent to find a general solution for parallel discrete event simulation. In this context, QNs and PNs have been extensively studied. However, to the best of our knowledge, there is only one previous work that considers the concurrent simulation of QPN [Juergens1997]. This work focuses on comparing different synchronization algorithms and excludes a majority of lookahead calculation and net decomposition. In this thesis, we build upon and extend this work. For this purpose, we adapted and extended findings from QNs, PNs and parallel simulation in general. We apply our findings to SimQPN, which is a sequential simulation engine for QPN. Among other application areas, SimQPN is currently applied to online performance prediction for which a speedup due to parallelization is desirable. We present a parallel SimQPN implementation that employs application level and event level parallelism. A validation ensures the functional correctness of the new parallel implementations. The parallelization of multiple runs enables almost linear speedup. We parallelized the execution of a single run by the use of a conservative barrier-based synchronization algorithm. The speedup for a single run depends on the capability of the model. Hence, a number of experiments on different net characteristics were conducted showing that for certain models a superlinear speedup is possible.','{Parallel Simulation of Queueing Petri Net Models}',0,10,2013,10,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(697,'paper','GoBrKo2013-ControllingPCM','inproceedings','@inproceedings{GoBrKo2013-ControllingPCM,\n title = {Controlling the Palladio Bench using the Descartes Query Language},\n author = {Gorsler, Fabian and Brosig, Fabian and Kounev, Samuel},\n booktitle = {Proceedings of the Symposium on Software Performance: Joint Kieker/Palladio Days (KPDAYS 2013)},\n year = {2013},\n address = {Aachen, Germany},\n editor = {Becker, Steffen and Hasselbring, Wilhelm and van Hoorn, Andr\\\'{e} and Reussner, Ralf},\n month = {November},\n number = {1083},\n pages = {109--118},\n publisher = {CEUR-WS.org},\n abstract = {The Palladio Bench is a tool to model, simulate and analyze Palladio Component Model (PCM) instances. However, for the Palladio Bench, no single interface to automate experiments or Application Programming Interface (API) to trigger the simulation of PCM instances and to extract performance prediction results is available. The Descartes Query Language (DQL) is a novel approach of a declarative query language to integrate different performance modeling and prediction techniques behind a unifying interface. Users benefit from the abstraction of specific tools to prepare and trigger performance predictions, less effort to obtain performance metrics of interest, and means to automate performance predictions. In this paper, we describe the realization of a DQL Connector for PCM and demonstrate the applicability of our approach in a case study.},\n url = {http://ceur-ws.org/Vol-1083/},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/697.pdf},\n}\n\n','\n\nFabian Gorsler, Fabian Brosig, and Samuel Kounev.\nControlling the palladio bench using the descartes query language.\nIn Proceedings of the Symposium on Software Performance: Joint\nKieker/Palladio Days (KPDAYS 2013), Steffen Becker, Wilhelm Hasselbring,\nAndré van Hoorn, and Ralf Reussner, editors, November 2013, number 1083,\npages 109-118. CEUR-WS.org, Aachen, Germany.\nNovember 2013.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{GoBrKo2013-ControllingPCM,\ntitle = {Controlling the Palladio Bench using the Descartes Query Language},\nauthor = {Gorsler, Fabian and Brosig, Fabian and Kounev, Samuel},\nbooktitle = {Proceedings of the Symposium on Software Performance: Joint Kieker/Palladio Days (KPDAYS 2013)},\nyear = {2013},\naddress = {Aachen, Germany},\neditor = {Becker, Steffen and Hasselbring, Wilhelm and van Hoorn, Andr\\\'{e} and Reussner, Ralf},\nmonth = {November},\nnumber = {1083},\npages = {109--118},\npublisher = {CEUR-WS.org},\nabstract = {The Palladio Bench is a tool to model, simulate and analyze Palladio Component Model (PCM) instances. However, for the Palladio Bench, no single interface to automate experiments or Application Programming Interface (API) to trigger the simulation of PCM instances and to extract performance prediction results is available. The Descartes Query Language (DQL) is a novel approach of a declarative query language to integrate different performance modeling and prediction techniques behind a unifying interface. Users benefit from the abstraction of specific tools to prepare and trigger performance predictions, less effort to obtain performance metrics of interest, and means to automate performance predictions. In this paper, we describe the realization of a DQL Connector for PCM and demonstrate the applicability of our approach in a case study.},\nurl = {http://ceur-ws.org/Vol-1083/},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/697.pdf}\n}\n
\n
\nThe Palladio Bench is a tool to model, simulate and analyze Palladio Component Model (PCM) instances. However, for the Palladio Bench, no single interface to automate experiments or Application Programming Interface (API) to trigger the simulation of PCM instances and to extract performance prediction results is available. The Descartes Query Language (DQL) is a novel approach of a declarative query language to integrate different performance modeling and prediction techniques behind a unifying interface. Users benefit from the abstraction of specific tools to prepare and trigger performance predictions, less effort to obtain performance metrics of interest, and means to automate performance predictions. In this paper, we describe the realization of a DQL Connector for PCM and demonstrate the applicability of our approach in a case study.\n
\n','
\n@inproceedings{GoBrKo2013-ControllingPCM,\n  title = {Controlling the Palladio Bench using the Descartes Query Language},\n  author = {Gorsler, Fabian and Brosig, Fabian and Kounev, Samuel},\n  booktitle = {Proceedings of the Symposium on Software Performance: Joint Kieker/Palladio Days (KPDAYS 2013)},\n  year = {2013},\n  address = {Aachen, Germany},\n  editor = {Becker, Steffen and Hasselbring, Wilhelm and van Hoorn, Andr\\\'{e} and Reussner, Ralf},\n  month = {November},\n  number = {1083},\n  pages = {109--118},\n  publisher = {CEUR-WS.org},\n  abstract = {The Palladio Bench is a tool to model, simulate and analyze Palladio Component Model (PCM) instances. However, for the Palladio Bench, no single interface to automate experiments or Application Programming Interface (API) to trigger the simulation of PCM instances and to extract performance prediction results is available. The Descartes Query Language (DQL) is a novel approach of a declarative query language to integrate different performance modeling and prediction techniques behind a unifying interface. Users benefit from the abstraction of specific tools to prepare and trigger performance predictions, less effort to obtain performance metrics of interest, and means to automate performance predictions. In this paper, we describe the realization of a DQL Connector for PCM and demonstrate the applicability of our approach in a case study.},\n  url = {http://ceur-ws.org/Vol-1083/},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/697.pdf}\n}\n
\n\n','The Palladio Bench is a tool to model, simulate and analyze Palladio Component Model (PCM) instances. However, for the Palladio Bench, no single interface to automate experiments or Application Programming Interface (API) to trigger the simulation of PCM instances and to extract performance prediction results is available. The Descartes Query Language (DQL) is a novel approach of a declarative query language to integrate different performance modeling and prediction techniques behind a unifying interface. Users benefit from the abstraction of specific tools to prepare and trigger performance predictions, less effort to obtain performance metrics of interest, and means to automate performance predictions. In this paper, we describe the realization of a DQL Connector for PCM and demonstrate the applicability of our approach in a case study.','Controlling the Palladio Bench using the Descartes Query Language',0,11,2013,11,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(702,'paper','GoBrKo2014-PerformanceQueries','inproceedings','@inproceedings{GoBrKo2014-PerformanceQueries,\n title = {{Performance Queries for Architecture-Level Performance Models}},\n author = {Gorsler, Fabian and Brosig, Fabian and Kounev, Samuel},\n booktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n year = {2014},\n month = {{March}},\n address = {New York, NY, USA},\n note = {Acceptance Rate (Full Paper): 14/56 = 25\\%.},\n publisher = {ACM},\n location = {Dublin, Ireland},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/702.pdf},\n doi = {10.1145/2568088.2568100},\n}\n\n','\n\nFabian Gorsler, Fabian Brosig, and Samuel Kounev.\nPerformance Queries for Architecture-Level Performance Models.\nIn Proceedings of the 5th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2014), Dublin, Ireland, March 2014. ACM, New\nYork, NY, USA.\nMarch 2014, Acceptance Rate (Full Paper): 14/56 = 25%.\n[ bib | DOI | .pdf  ] 
\n@inproceedings{GoBrKo2014-PerformanceQueries,\ntitle = {{Performance Queries for Architecture-Level Performance Models}},\nauthor = {Gorsler, Fabian and Brosig, Fabian and Kounev, Samuel},\nbooktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\nyear = {2014},\nmonth = {{March}},\naddress = {New York, NY, USA},\nnote = {Acceptance Rate (Full Paper): 14/56 = 25\\%.},\npublisher = {ACM},\nlocation = {Dublin, Ireland},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/702.pdf},\ndoi = {10.1145/2568088.2568100}\n}\n
\n
\n','
\n@inproceedings{GoBrKo2014-PerformanceQueries,\n  title = {{Performance Queries for Architecture-Level Performance Models}},\n  author = {Gorsler, Fabian and Brosig, Fabian and Kounev, Samuel},\n  booktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n  year = {2014},\n  month = {{March}},\n  address = {New York, NY, USA},\n  note = {Acceptance Rate (Full Paper): 14/56 = 25\\%.},\n  publisher = {ACM},\n  location = {Dublin, Ireland},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/702.pdf},\n  doi = {10.1145/2568088.2568100}\n}\n
\n\n',NULL,'{Performance Queries for Architecture-Level Performance Models}',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(703,'paper','SpCaZhKo2014-ICPEDemo-LibReDE','inproceedings','@inproceedings{SpCaZhKo2014-ICPEDemo-LibReDE,\n abstract = {When creating a performance model, it is necessary to quantify the amount of resources consumed by an application serving individual requests. In distributed enterprise systems, these resource demands usually cannot be observed directly, their estimation is a major challenge. Different statistical approaches to resource demand estimation based on monitoring data have been proposed, e.g., using linear regression or Kalman filtering techniques. In this paper, we present LibReDE, a library of ready-to-use implementations of approaches to resource demand estimation that can be used for online and offline analysis. It is the first publicly available tool for this task and aims at supporting performance engineers during performance model construction. The library enables the quick comparison of the estimation accuracy of different approaches in a given context and thus helps to select an optimal one.},\n author = {Simon Spinner and Giuliano Casale and Xiaoyun Zhu and Samuel Kounev},\n titleaddon = {{(Demo Paper)}},\n booktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n day = {22--26},\n location = {Dublin, Ireland},\n month = {March},\n publisher = {ACM Press},\n isbn = {978-1-4503-2733-6},\n title = {{LibReDE: A Library for Resource Demand Estimation}},\n year = {2014},\n pages = {227--228},\n url = {http://doi.acm.org/10.1145/2568088.2576093},\n address = {New York, NY, USA},\n doi = {10.1145/2568088.2576093},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/703.pdf},\n}\n\n','\n\nSimon Spinner, Giuliano Casale, Xiaoyun Zhu, and Samuel Kounev.\nLibReDE: A Library for Resource Demand Estimation (Demo Paper).\nIn Proceedings of the 5th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2014), Dublin, Ireland, March 22-26, 2014,\npages 227-228. ACM Press, New York, NY, USA.\nMarch 2014.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{SpCaZhKo2014-ICPEDemo-LibReDE,\nabstract = {When creating a performance model, it is necessary to quantify the amount of resources consumed by an application serving individual requests. In distributed enterprise systems, these resource demands usually cannot be observed directly, their estimation is a major challenge. Different statistical approaches to resource demand estimation based on monitoring data have been proposed, e.g., using linear regression or Kalman filtering techniques. In this paper, we present LibReDE, a library of ready-to-use implementations of approaches to resource demand estimation that can be used for online and offline analysis. It is the first publicly available tool for this task and aims at supporting performance engineers during performance model construction. The library enables the quick comparison of the estimation accuracy of different approaches in a given context and thus helps to select an optimal one.},\nauthor = {Simon Spinner and Giuliano Casale and Xiaoyun Zhu and Samuel Kounev},\ntitleaddon = {{(Demo Paper)}},\nbooktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\nday = {22--26},\nlocation = {Dublin, Ireland},\nmonth = {March},\npublisher = {ACM Press},\nisbn = {978-1-4503-2733-6},\ntitle = {{LibReDE: A Library for Resource Demand Estimation}},\nyear = {2014},\npages = {227--228},\nurl = {http://doi.acm.org/10.1145/2568088.2576093},\naddress = {New York, NY, USA},\ndoi = {10.1145/2568088.2576093},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/703.pdf}\n}\n
\n
\nWhen creating a performance model, it is necessary to quantify the amount of resources consumed by an application serving individual requests. In distributed enterprise systems, these resource demands usually cannot be observed directly, their estimation is a major challenge. Different statistical approaches to resource demand estimation based on monitoring data have been proposed, e.g., using linear regression or Kalman filtering techniques. In this paper, we present LibReDE, a library of ready-to-use implementations of approaches to resource demand estimation that can be used for online and offline analysis. It is the first publicly available tool for this task and aims at supporting performance engineers during performance model construction. The library enables the quick comparison of the estimation accuracy of different approaches in a given context and thus helps to select an optimal one.\n
\n','
\n@inproceedings{SpCaZhKo2014-ICPEDemo-LibReDE,\n  abstract = {When creating a performance model, it is necessary to quantify the amount of resources consumed by an application serving individual requests. In distributed enterprise systems, these resource demands usually cannot be observed directly, their estimation is a major challenge. Different statistical approaches to resource demand estimation based on monitoring data have been proposed, e.g., using linear regression or Kalman filtering techniques. In this paper, we present LibReDE, a library of ready-to-use implementations of approaches to resource demand estimation that can be used for online and offline analysis. It is the first publicly available tool for this task and aims at supporting performance engineers during performance model construction. The library enables the quick comparison of the estimation accuracy of different approaches in a given context and thus helps to select an optimal one.},\n  author = {Simon Spinner and Giuliano Casale and Xiaoyun Zhu and Samuel Kounev},\n  titleaddon = {{(Demo Paper)}},\n  booktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n  day = {22--26},\n  location = {Dublin, Ireland},\n  month = {March},\n  publisher = {ACM Press},\n  isbn = {978-1-4503-2733-6},\n  title = {{LibReDE: A Library for Resource Demand Estimation}},\n  year = {2014},\n  pages = {227--228},\n  url = {http://doi.acm.org/10.1145/2568088.2576093},\n  address = {New York, NY, USA},\n  doi = {10.1145/2568088.2576093},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/703.pdf}\n}\n
\n\n','When creating a performance model, it is necessary to quantify the amount of resources consumed by an application serving individual requests. In distributed enterprise systems, these resource demands usually cannot be observed directly, their estimation is a major challenge. Different statistical approaches to resource demand estimation based on monitoring data have been proposed, e.g., using linear regression or Kalman filtering techniques. In this paper, we present LibReDE, a library of ready-to-use implementations of approaches to resource demand estimation that can be used for online and offline analysis. It is the first publicly available tool for this task and aims at supporting performance engineers during performance model construction. The library enables the quick comparison of the estimation accuracy of different approaches in a given context and thus helps to select an optimal one.','{LibReDE: A Library for Resource Demand Estimation}',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(705,'paper','RyKo2014-DCPerf-DNI2QPN','inproceedings','@inproceedings{RyKo2014-DCPerf-DNI2QPN,\n author = {Piotr Rygielski and Samuel Kounev},\n booktitle = {34th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2014 Workshops). 4th International Workshop on Data Center Performance, (DCPerf 2014)},\n location = {Madrid, Spain},\n title = {{Data Center Network Throughput Analysis using Queueing Petri Nets}},\n year = {2014},\n month = {June},\n day = {30},\n pages = {100--105},\n doi = {10.1109/ICDCSW.2014.11},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/705.pdf},\n abstract = {In this paper, we address the problem of performance analysis in computer networks. We present a metamodel designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. In this paper, we present the transformation to Queueing Petri Nets (QPNs) and simulate them using SimQPN simulator. We show that despite the high level of abstraction of the QPNs, we are able to estimate the utilization of resources with good accuracy within a short time.},\n}\n\n','\n\nPiotr Rygielski and Samuel Kounev.\nData Center Network Throughput Analysis using Queueing Petri Nets.\nIn 34th IEEE International Conference on Distributed Computing\nSystems Workshops (ICDCS 2014 Workshops). 4th International Workshop on Data\nCenter Performance, (DCPerf 2014), Madrid, Spain, June 30, 2014, pages\n100-105.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{RyKo2014-DCPerf-DNI2QPN,\nauthor = {Piotr Rygielski and Samuel Kounev},\nbooktitle = {34th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2014 Workshops). 4th International Workshop on Data Center Performance, (DCPerf 2014)},\nlocation = {Madrid, Spain},\ntitle = {{Data Center Network Throughput Analysis using Queueing Petri Nets}},\nyear = {2014},\nmonth = {June},\nday = {30},\npages = {100--105},\ndoi = {10.1109/ICDCSW.2014.11},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/705.pdf},\nabstract = {In this paper, we address the problem of performance analysis in computer networks. We present a metamodel designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. In this paper, we present the transformation to Queueing Petri Nets (QPNs) and simulate them using SimQPN simulator. We show that despite the high level of abstraction of the QPNs, we are able to estimate the utilization of resources with good accuracy within a short time.}\n}\n
\n
\nIn this paper, we address the problem of performance analysis in computer networks. We present a metamodel designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. In this paper, we present the transformation to Queueing Petri Nets (QPNs) and simulate them using SimQPN simulator. We show that despite the high level of abstraction of the QPNs, we are able to estimate the utilization of resources with good accuracy within a short time.\n
\n','
\n@inproceedings{RyKo2014-DCPerf-DNI2QPN,\n  author = {Piotr Rygielski and Samuel Kounev},\n  booktitle = {34th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2014 Workshops). 4th International Workshop on Data Center Performance, (DCPerf 2014)},\n  location = {Madrid, Spain},\n  title = {{Data Center Network Throughput Analysis using Queueing Petri Nets}},\n  year = {2014},\n  month = {June},\n  day = {30},\n  pages = {100--105},\n  doi = {10.1109/ICDCSW.2014.11},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/705.pdf},\n  abstract = {In this paper, we address the problem of performance analysis in computer networks. We present a metamodel designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. In this paper, we present the transformation to Queueing Petri Nets (QPNs) and simulate them using SimQPN simulator. We show that despite the high level of abstraction of the QPNs, we are able to estimate the utilization of resources with good accuracy within a short time.}\n}\n
\n\n','In this paper, we address the problem of performance analysis in computer networks. We present a metamodel designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. In this paper, we present the transformation to Queueing Petri Nets (QPNs) and simulate them using SimQPN simulator. We show that despite the high level of abstraction of the QPNs, we are able to estimate the utilization of resources with good accuracy within a short time.','{Data Center Network Throughput Analysis using Queueing Petri Nets}',0,6,2014,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(706,'paper','KrScHe2014-HotTopiCS-OptimizationApproach','inproceedings','@inproceedings{KrScHe2014-HotTopiCS-OptimizationApproach,\n abstract = {{Software-as-a-Service (SaaS) often shares one single application instance among different tenants to reduce costs. However, sharing potentially leads to undesired influence from one tenant onto the performance observed by the others. Furthermore, providing one tenant additional resources to support its increasing demands without increasing the performance of tenants who do not pay for it is a major challenge. The application intentionally does not manage hardware resources, and the OS is not aware of application level entities like tenants. Thus, it is difficult to control the performance of different tenants to keep them isolated. These problems gain importance as performance is one of the major obstacles for cloud customers. Existing work applies request based admission control mechanisms like a weighted round robin with an individual queue for each tenant to control the share guaranteed for a tenant. However, the computation of the concrete weights for such an admission control is still challenging. In this paper, we present a fitness function and optimization approach reflecting various requirements from this field to compute proper weights with the goal to ensure an isolated performance as foundation to scale on a tenants basis.}},\n author = {Rouven Krebs and Philipp Schneider and Nikolas Herbst},\n booktitle = {Proceedings of the 2nd International Workshop on Hot Topics in Cloud Service Scalability (HotTopiCS 2014), co-located with the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n day = {22},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/706.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/706},\n location = {Dublin, Ireland},\n month = {March},\n publisher = {ACM},\n keywords = {SaaS, Multi-Tenancy, Performance, Isolation, Scalability},\n title = {{Optimization Method for Request Admission Control to Guarantee Performance Isolation}},\n year = {2014},\n}\n\n','\n\nRouven Krebs, Philipp Schneider, and Nikolas Herbst.\nOptimization Method for Request Admission Control to Guarantee\nPerformance Isolation.\nIn Proceedings of the 2nd International Workshop on Hot Topics\nin Cloud Service Scalability (HotTopiCS 2014), co-located with the 5th\nACM/SPEC International Conference on Performance Engineering (ICPE 2014),\nDublin, Ireland, March 22, 2014. ACM.\nMarch 2014.\n[ bib | slides | .pdf | Abstract  ] 
\n@inproceedings{KrScHe2014-HotTopiCS-OptimizationApproach,\nabstract = {{Software-as-a-Service (SaaS) often shares one single application instance among different tenants to reduce costs. However, sharing potentially leads to undesired influence from one tenant onto the performance observed by the others. Furthermore, providing one tenant additional resources to support its increasing demands without increasing the performance of tenants who do not pay for it is a major challenge. The application intentionally does not manage hardware resources, and the OS is not aware of application level entities like tenants. Thus, it is difficult to control the performance of different tenants to keep them isolated. These problems gain importance as performance is one of the major obstacles for cloud customers. Existing work applies request based admission control mechanisms like a weighted round robin with an individual queue for each tenant to control the share guaranteed for a tenant. However, the computation of the concrete weights for such an admission control is still challenging. In this paper, we present a fitness function and optimization approach reflecting various requirements from this field to compute proper weights with the goal to ensure an isolated performance as foundation to scale on a tenants basis.}},\nauthor = {Rouven Krebs and Philipp Schneider and Nikolas Herbst},\nbooktitle = {Proceedings of the 2nd International Workshop on Hot Topics in Cloud Service Scalability (HotTopiCS 2014), co-located with the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\nday = {22},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/706.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/706},\nlocation = {Dublin, Ireland},\nmonth = {March},\npublisher = {ACM},\nkeywords = {SaaS, Multi-Tenancy, Performance, Isolation, Scalability},\ntitle = {{Optimization Method for Request Admission Control to Guarantee Performance Isolation}},\nyear = {2014}\n}\n
\n
\nSoftware-as-a-Service (SaaS) often shares one single application instance among different tenants to reduce costs. However, sharing potentially leads to undesired influence from one tenant onto the performance observed by the others. Furthermore, providing one tenant additional resources to support its increasing demands without increasing the performance of tenants who do not pay for it is a major challenge. The application intentionally does not manage hardware resources, and the OS is not aware of application level entities like tenants. Thus, it is difficult to control the performance of different tenants to keep them isolated. These problems gain importance as performance is one of the major obstacles for cloud customers. Existing work applies request based admission control mechanisms like a weighted round robin with an individual queue for each tenant to control the share guaranteed for a tenant. However, the computation of the concrete weights for such an admission control is still challenging. In this paper, we present a fitness function and optimization approach reflecting various requirements from this field to compute proper weights with the goal to ensure an isolated performance as foundation to scale on a tenants basis.\n
\n','
\n@inproceedings{KrScHe2014-HotTopiCS-OptimizationApproach,\n  abstract = {{Software-as-a-Service (SaaS) often shares one single application instance among different tenants to reduce costs. However, sharing potentially leads to undesired influence from one tenant onto the performance observed by the others. Furthermore, providing one tenant additional resources to support its increasing demands without increasing the performance of tenants who do not pay for it is a major challenge. The application intentionally does not manage hardware resources, and the OS is not aware of application level entities like tenants. Thus, it is difficult to control the performance of different tenants to keep them isolated. These problems gain importance as performance is one of the major obstacles for cloud customers. Existing work applies request based admission control mechanisms like a weighted round robin with an individual queue for each tenant to control the share guaranteed for a tenant. However, the computation of the concrete weights for such an admission control is still challenging. In this paper, we present a fitness function and optimization approach reflecting various requirements from this field to compute proper weights with the goal to ensure an isolated performance as foundation to scale on a tenants basis.}},\n  author = {Rouven Krebs and Philipp Schneider and Nikolas Herbst},\n  booktitle = {Proceedings of the 2nd International Workshop on Hot Topics in Cloud Service Scalability (HotTopiCS 2014), co-located with the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n  day = {22},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/706.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/706},\n  location = {Dublin, Ireland},\n  month = {March},\n  publisher = {ACM},\n  keywords = {SaaS, Multi-Tenancy, Performance, Isolation, Scalability},\n  title = {{Optimization Method for Request Admission Control to Guarantee Performance Isolation}},\n  year = {2014}\n}\n
\n\n','{Software-as-a-Service (SaaS) often shares one single application instance among different tenants to reduce costs. However, sharing potentially leads to undesired influence from one tenant onto the performance observed by the others. Furthermore, providing one tenant additional resources to support its increasing demands without increasing the performance of tenants who do not pay for it is a major challenge. The application intentionally does not manage hardware resources, and the OS is not aware of application level entities like tenants. Thus, it is difficult to control the performance of different tenants to keep them isolated. These problems gain importance as performance is one of the major obstacles for cloud customers. Existing work applies request based admission control mechanisms like a weighted round robin with an individual queue for each tenant to control the share guaranteed for a tenant. However, the computation of the concrete weights for such an admission control is still challenging. In this paper, we present a fitness function and optimization approach reflecting various requirements from this field to compute proper weights with the goal to ensure an isolated performance as foundation to scale on a tenants basis.}','{Optimization Method for Request Admission Control to Guarantee Performance Isolation}',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(707,'paper','KrSpAhKo2014_CCGrid_ResourceIsolation','inproceedings','@inproceedings{KrSpAhKo2014_CCGrid_ResourceIsolation,\n abstract = {{Multi-tenancy is an approach to share one application instance among multiple customers by providing each of them a dedicated view. This approach is commonly used by SaaS providers to reduce the costs for service provisioning. Tenants also expect to be isolated in terms of the performance they observe and the providers inability to offer performance guarantees is a major obstacle for potential cloud customers. To guarantee an isolated performance it is essential to control the resources used by a tenant. This is a challenge, because the layers of the execution environment, responsible for controlling resource usage (e.g., operating system), normally do not have knowledge about entities defined at the application level and thus they cannot distinguish between different tenants. Furthermore, it is hard to predict how tenant requests propagate through the multiple layers of the execution environment down to the physical resource layer. The intended abstraction of the application from the resource controlling layers does not allow to solely solving this problem in the application. In this paper, we propose an approach which applies resource demand estimation techniques in combination with a request based admission control. The resource demand estimation is used to determine resource consumption information for individual requests. The admission control mechanism uses this knowledge to delay requests originating from tenants that exceed their allocated resource share. The proposed method is validated by a widely accepted benchmark showing its applicability in a setup motivated by today\'s platform environments.}},\n author = {Rouven Krebs and Simon Spinner and Nadia Ahmed and Samuel Kounev},\n booktitle = {Proceedings of the 14th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2014)},\n day = {26},\n location = {Chicago, IL, USA},\n month = {May},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/707.pdf},\n publisher = {IEEE/ACM},\n title = {{Resource Usage Control In Multi-Tenant Applications}},\n note = {Acceptance Rate: 19\\% (54/283)},\n year = {2014},\n doi = {10.1109/CCGrid.2014.80},\n pages = {122-131},\n}\n\n','\n\nRouven Krebs, Simon Spinner, Nadia Ahmed, and Samuel Kounev.\nResource Usage Control In Multi-Tenant Applications.\nIn Proceedings of the 14th IEEE/ACM International Symposium on\nCluster, Cloud and Grid Computing (CCGrid 2014), Chicago, IL, USA, May 26,\n2014, pages 122-131. IEEE/ACM.\nMay 2014, Acceptance Rate: 19% (54/283).\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{KrSpAhKo2014_CCGrid_ResourceIsolation,\nabstract = {{Multi-tenancy is an approach to share one application instance among multiple customers by providing each of them a dedicated view. This approach is commonly used by SaaS providers to reduce the costs for service provisioning. Tenants also expect to be isolated in terms of the performance they observe and the providers inability to offer performance guarantees is a major obstacle for potential cloud customers. To guarantee an isolated performance it is essential to control the resources used by a tenant. This is a challenge, because the layers of the execution environment, responsible for controlling resource usage (e.g., operating system), normally do not have knowledge about entities defined at the application level and thus they cannot distinguish between different tenants. Furthermore, it is hard to predict how tenant requests propagate through the multiple layers of the execution environment down to the physical resource layer. The intended abstraction of the application from the resource controlling layers does not allow to solely solving this problem in the application. In this paper, we propose an approach which applies resource demand estimation techniques in combination with a request based admission control. The resource demand estimation is used to determine resource consumption information for individual requests. The admission control mechanism uses this knowledge to delay requests originating from tenants that exceed their allocated resource share. The proposed method is validated by a widely accepted benchmark showing its applicability in a setup motivated by today\'s platform environments.}},\nauthor = {Rouven Krebs and Simon Spinner and Nadia Ahmed and Samuel Kounev},\nbooktitle = {Proceedings of the 14th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2014)},\nday = {26},\nlocation = {Chicago, IL, USA},\nmonth = {May},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/707.pdf},\npublisher = {IEEE/ACM},\ntitle = {{Resource Usage Control In Multi-Tenant Applications}},\nnote = {Acceptance Rate: 19\\% (54/283)},\nyear = {2014},\ndoi = {10.1109/CCGrid.2014.80},\npages = {122-131}\n}\n
\n
\nMulti-tenancy is an approach to share one application instance among multiple customers by providing each of them a dedicated view. This approach is commonly used by SaaS providers to reduce the costs for service provisioning. Tenants also expect to be isolated in terms of the performance they observe and the providers inability to offer performance guarantees is a major obstacle for potential cloud customers. To guarantee an isolated performance it is essential to control the resources used by a tenant. This is a challenge, because the layers of the execution environment, responsible for controlling resource usage (e.g., operating system), normally do not have knowledge about entities defined at the application level and thus they cannot distinguish between different tenants. Furthermore, it is hard to predict how tenant requests propagate through the multiple layers of the execution environment down to the physical resource layer. The intended abstraction of the application from the resource controlling layers does not allow to solely solving this problem in the application. In this paper, we propose an approach which applies resource demand estimation techniques in combination with a request based admission control. The resource demand estimation is used to determine resource consumption information for individual requests. The admission control mechanism uses this knowledge to delay requests originating from tenants that exceed their allocated resource share. The proposed method is validated by a widely accepted benchmark showing its applicability in a setup motivated by today\'s platform environments.\n
\n','
\n@inproceedings{KrSpAhKo2014_CCGrid_ResourceIsolation,\n  abstract = {{Multi-tenancy is an approach to share one application instance among multiple customers by providing each of them a dedicated view. This approach is commonly used by SaaS providers to reduce the costs for service provisioning. Tenants also expect to be isolated in terms of the performance they observe and the providers inability to offer performance guarantees is a major obstacle for potential cloud customers. To guarantee an isolated performance it is essential to control the resources used by a tenant. This is a challenge, because the layers of the execution environment, responsible for controlling resource usage (e.g., operating system), normally do not have knowledge about entities defined at the application level and thus they cannot distinguish between different tenants. Furthermore, it is hard to predict how tenant requests propagate through the multiple layers of the execution environment down to the physical resource layer. The intended abstraction of the application from the resource controlling layers does not allow to solely solving this problem in the application. In this paper, we propose an approach which applies resource demand estimation techniques in combination with a request based admission control. The resource demand estimation is used to determine resource consumption information for individual requests. The admission control mechanism uses this knowledge to delay requests originating from tenants that exceed their allocated resource share. The proposed method is validated by a widely accepted benchmark showing its applicability in a setup motivated by today\'s platform environments.}},\n  author = {Rouven Krebs and Simon Spinner and Nadia Ahmed and Samuel Kounev},\n  booktitle = {Proceedings of the 14th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2014)},\n  day = {26},\n  location = {Chicago, IL, USA},\n  month = {May},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/707.pdf},\n  publisher = {IEEE/ACM},\n  title = {{Resource Usage Control In Multi-Tenant Applications}},\n  note = {Acceptance Rate: 19\\% (54/283)},\n  year = {2014},\n  doi = {10.1109/CCGrid.2014.80},\n  pages = {122-131}\n}\n
\n\n','{Multi-tenancy is an approach to share one application instance among multiple customers by providing each of them a dedicated view. This approach is commonly used by SaaS providers to reduce the costs for service provisioning. Tenants also expect to be isolated in terms of the performance they observe and the providers inability to offer performance guarantees is a major obstacle for potential cloud customers. To guarantee an isolated performance it is essential to control the resources used by a tenant. This is a challenge, because the layers of the execution environment, responsible for controlling resource usage (e.g., operating system), normally do not have knowledge about entities defined at the application level and thus they cannot distinguish between different tenants. Furthermore, it is hard to predict how tenant requests propagate through the multiple layers of the execution environment down to the physical resource layer. The intended abstraction of the application from the resource controlling layers does not allow to solely solving this problem in the application. In this paper, we propose an approach which applies resource demand estimation techniques in combination with a request based admission control. The resource demand estimation is used to determine resource consumption information for individual requests. The admission control mechanism uses this knowledge to delay requests originating from tenants that exceed their allocated resource share. The proposed method is validated by a widely accepted benchmark showing its applicability in a setup motivated by today\'s platform environments.}','{Resource Usage Control In Multi-Tenant Applications}',0,5,2014,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 10:27:45',0),(708,'paper','KrLo2014_Closer_IsolationTypes','inproceedings','@inproceedings{KrLo2014_Closer_IsolationTypes,\n abstract = {{Multi-tenancy is an approach to share one application instance among multiple customers by providing each of them a dedicated view. This approach is commonly used by SaaS providers to reduce the costs for service provisioning. Tenants also expect to be isolated in terms of the performance they observe and the providers inability to offer performance guarantees is a major obstacle for potential cloud customers. To guarantee an isolated performance it is essential to control the resources used by a tenant. This is a challenge, because the layers of the execution environment, responsible for controlling resource usage (e.g., operating system), normally do not have knowledge about entities defined at the application level and thus they cannot distinguish between different tenants. Furthermore, it is hard to predict how tenant requests propagate through the multiple layers of the execution environment down to the physical resource layer. The intended abstraction of the application from the resource controlling layers does not allow to solely solving this problem in the application. In this paper, we propose an approach which applies resource demand estimation techniques in combination with a request based admission control. The resource demand estimation is used to determine resource consumption information for individual requests. The admission control mechanism uses this knowledge to delay requests originating from tenants that exceed their allocated resource share. The proposed method is validated by a widely accepted benchmark showing its applicability in a setup motivated by todayâ??s platform environments.}},\n author = {Rouven Krebs and Manuel Loesch},\n booktitle = {Proceedings of 4th International Conference On Cloud Computing And Services Science (CLOSER 2014)},\n day = {3},\n location = {Barcelona, Spain},\n month = {April},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/708.pdf},\n publisher = {SciTePress},\n title = {{Comparison of Request Admission Based Performance Isolation Approaches in Multi-Tenant SaaS Applications (Short Paper)}},\n year = {2014},\n}\n\n','\n\nRouven Krebs and Manuel Loesch.\nComparison of Request Admission Based Performance Isolation\nApproaches in Multi-Tenant SaaS Applications (Short Paper).\nIn Proceedings of 4th International Conference On Cloud\nComputing And Services Science (CLOSER 2014), Barcelona, Spain, April 3,\n2014. SciTePress.\nApril 2014.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{KrLo2014_Closer_IsolationTypes,\nabstract = {{Multi-tenancy is an approach to share one application instance among multiple customers by providing each of them a dedicated view. This approach is commonly used by SaaS providers to reduce the costs for service provisioning. Tenants also expect to be isolated in terms of the performance they observe and the providers inability to offer performance guarantees is a major obstacle for potential cloud customers. To guarantee an isolated performance it is essential to control the resources used by a tenant. This is a challenge, because the layers of the execution environment, responsible for controlling resource usage (e.g., operating system), normally do not have knowledge about entities defined at the application level and thus they cannot distinguish between different tenants. Furthermore, it is hard to predict how tenant requests propagate through the multiple layers of the execution environment down to the physical resource layer. The intended abstraction of the application from the resource controlling layers does not allow to solely solving this problem in the application. In this paper, we propose an approach which applies resource demand estimation techniques in combination with a request based admission control. The resource demand estimation is used to determine resource consumption information for individual requests. The admission control mechanism uses this knowledge to delay requests originating from tenants that exceed their allocated resource share. The proposed method is validated by a widely accepted benchmark showing its applicability in a setup motivated by todayâ??s platform environments.}},\nauthor = {Rouven Krebs and Manuel Loesch},\nbooktitle = {Proceedings of 4th International Conference On Cloud Computing And Services Science (CLOSER 2014)},\nday = {3},\nlocation = {Barcelona, Spain},\nmonth = {April},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/708.pdf},\npublisher = {SciTePress},\ntitle = {{Comparison of Request Admission Based Performance Isolation Approaches in Multi-Tenant SaaS Applications (Short Paper)}},\nyear = {2014}\n}\n
\n
\nMulti-tenancy is an approach to share one application instance among multiple customers by providing each of them a dedicated view. This approach is commonly used by SaaS providers to reduce the costs for service provisioning. Tenants also expect to be isolated in terms of the performance they observe and the providers inability to offer performance guarantees is a major obstacle for potential cloud customers. To guarantee an isolated performance it is essential to control the resources used by a tenant. This is a challenge, because the layers of the execution environment, responsible for controlling resource usage (e.g., operating system), normally do not have knowledge about entities defined at the application level and thus they cannot distinguish between different tenants. Furthermore, it is hard to predict how tenant requests propagate through the multiple layers of the execution environment down to the physical resource layer. The intended abstraction of the application from the resource controlling layers does not allow to solely solving this problem in the application. In this paper, we propose an approach which applies resource demand estimation techniques in combination with a request based admission control. The resource demand estimation is used to determine resource consumption information for individual requests. The admission control mechanism uses this knowledge to delay requests originating from tenants that exceed their allocated resource share. The proposed method is validated by a widely accepted benchmark showing its applicability in a setup motivated by todayâ??s platform environments.\n
\n','
\n@inproceedings{KrLo2014_Closer_IsolationTypes,\n  abstract = {{Multi-tenancy is an approach to share one application instance among multiple customers by providing each of them a dedicated view. This approach is commonly used by SaaS providers to reduce the costs for service provisioning. Tenants also expect to be isolated in terms of the performance they observe and the providers inability to offer performance guarantees is a major obstacle for potential cloud customers. To guarantee an isolated performance it is essential to control the resources used by a tenant. This is a challenge, because the layers of the execution environment, responsible for controlling resource usage (e.g., operating system), normally do not have knowledge about entities defined at the application level and thus they cannot distinguish between different tenants. Furthermore, it is hard to predict how tenant requests propagate through the multiple layers of the execution environment down to the physical resource layer. The intended abstraction of the application from the resource controlling layers does not allow to solely solving this problem in the application. In this paper, we propose an approach which applies resource demand estimation techniques in combination with a request based admission control. The resource demand estimation is used to determine resource consumption information for individual requests. The admission control mechanism uses this knowledge to delay requests originating from tenants that exceed their allocated resource share. The proposed method is validated by a widely accepted benchmark showing its applicability in a setup motivated by todayâ??s platform environments.}},\n  author = {Rouven Krebs and Manuel Loesch},\n  booktitle = {Proceedings of 4th International Conference On Cloud Computing And Services Science (CLOSER 2014)},\n  day = {3},\n  location = {Barcelona, Spain},\n  month = {April},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/708.pdf},\n  publisher = {SciTePress},\n  title = {{Comparison of Request Admission Based Performance Isolation Approaches in Multi-Tenant SaaS Applications (Short Paper)}},\n  year = {2014}\n}\n
\n\n','{Multi-tenancy is an approach to share one application instance among multiple customers by providing each of them a dedicated view. This approach is commonly used by SaaS providers to reduce the costs for service provisioning. Tenants also expect to be isolated in terms of the performance they observe and the providers inability to offer performance guarantees is a major obstacle for potential cloud customers. To guarantee an isolated performance it is essential to control the resources used by a tenant. This is a challenge, because the layers of the execution environment, responsible for controlling resource usage (e.g., operating system), normally do not have knowledge about entities defined at the application level and thus they cannot distinguish between different tenants. Furthermore, it is hard to predict how tenant requests propagate through the multiple layers of the execution environment down to the physical resource layer. The intended abstraction of the application from the resource controlling layers does not allow to solely solving this problem in the application. In this paper, we propose an approach which applies resource demand estimation techniques in combination with a request based admission control. The resource demand estimation is used to determine resource consumption information for individual requests. The admission control mechanism uses this knowledge to delay requests originating from tenants that exceed their allocated resource share. The proposed method is validated by a widely accepted benchmark showing its applicability in a setup motivated by todayâ??s platform environments.}','{Comparison of Request Admission Based Performance Isolation Approaches in Multi-Tenant SaaS Applications (Short Paper)}',0,4,2014,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(709,'paper','SPEC-RG-NEWSLETTER-3','misc','@misc{SPEC-RG-NEWSLETTER-3,\n author = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\n month = {March},\n note = {Published by Standard Performance Evaluation Corporation (SPEC)},\n title = {{SPEC Research Group Newsletter, vol. 1 no. 3}},\n url = {http://research.spec.org/en/newsletter.html},\n year = {2014},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/709.pdf},\n}\n\n','\n\nSamuel Kounev, Kai Sachs, and Piotr Rygielski.\nSPEC Research Group Newsletter, vol. 1 no. 3, March 2014.\nPublished by Standard Performance Evaluation Corporation (SPEC).\n[ bib | .html | .pdf  ] 
\n@misc{SPEC-RG-NEWSLETTER-3,\nauthor = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\nmonth = {March},\nnote = {Published by Standard Performance Evaluation Corporation (SPEC)},\ntitle = {{SPEC Research Group Newsletter, vol. 1 no. 3}},\nurl = {http://research.spec.org/en/newsletter.html},\nyear = {2014},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/709.pdf}\n}\n
\n
\n','
\n@misc{SPEC-RG-NEWSLETTER-3,\n  author = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\n  month = {March},\n  note = {Published by Standard Performance Evaluation Corporation (SPEC)},\n  title = {{SPEC Research Group Newsletter, vol. 1 no. 3}},\n  url = {http://research.spec.org/en/newsletter.html},\n  year = {2014},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/709.pdf}\n}\n
\n\n',NULL,'{SPEC Research Group Newsletter, vol. 1 no. 3}',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(710,'paper','Osman2013','incollection','@incollection{Osman2013,\n title = {Performance Modelling of Concurrency Control Schemes for Relational Databases},\n year = {2013},\n volume = {7984},\n pages = {337-351},\n pdf = {http://dx.doi.org/10.1007/978-3-642-39408-9_24},\n editor = {Dudin, Alexander and Turck, Koen},\n publisher = {Springer Berlin Heidelberg},\n series = {Lecture Notes in Computer Science},\n booktitle = {Analytical and Stochastic Modeling Techniques and Applications},\n isbn = {978-3-642-39407-2},\n doi = {10.1007/978-3-642-39408-9_24},\n author = {Osman, Rasha and Coulden, David and Knottenbelt, WilliamJ.},\n}\n\n','\n\nRasha Osman, David Coulden, and WilliamJ. Knottenbelt.\nPerformance modelling of concurrency control schemes for relational\ndatabases.\nIn Analytical and Stochastic Modeling Techniques and\nApplications, Alexander Dudin and Koen Turck, editors, volume 7984 of \nLecture Notes in Computer Science, pages 337-351. Springer Berlin\nHeidelberg, 2013.\n[ bib | DOI | http  ] 
\n@incollection{Osman2013,\ntitle = {Performance Modelling of Concurrency Control Schemes for Relational Databases},\nyear = {2013},\nvolume = {7984},\npages = {337-351},\npdf = {http://dx.doi.org/10.1007/978-3-642-39408-9_24},\neditor = {Dudin, Alexander and Turck, Koen},\npublisher = {Springer Berlin Heidelberg},\nseries = {Lecture Notes in Computer Science},\nbooktitle = {Analytical and Stochastic Modeling Techniques and Applications},\nisbn = {978-3-642-39407-2},\ndoi = {10.1007/978-3-642-39408-9_24},\nauthor = {Osman, Rasha and Coulden, David and Knottenbelt, WilliamJ.}\n}\n
\n
\n','
\n@incollection{Osman2013,\n  title = {Performance Modelling of Concurrency Control Schemes for Relational Databases},\n  year = {2013},\n  volume = {7984},\n  pages = {337-351},\n  pdf = {http://dx.doi.org/10.1007/978-3-642-39408-9_24},\n  editor = {Dudin, Alexander and Turck, Koen},\n  publisher = {Springer Berlin Heidelberg},\n  series = {Lecture Notes in Computer Science},\n  booktitle = {Analytical and Stochastic Modeling Techniques and Applications},\n  isbn = {978-3-642-39407-2},\n  doi = {10.1007/978-3-642-39408-9_24},\n  author = {Osman, Rasha and Coulden, David and Knottenbelt, WilliamJ.}\n}\n
\n\n',NULL,'Performance Modelling of Concurrency Control Schemes for Relational Databases',0,0,2013,0,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(711,'paper','Coulden-2013-PMD-2479871.2479919','inproceedings','@inproceedings{Coulden-2013-PMD-2479871.2479919,\n title = {{Performance Modelling of Database Contention Using Queueing Petri Nets}},\n year = {2013},\n pages = {331--334},\n keywords = {database locking, performance modelling, queueing petri nets},\n pdf = {http://doi.acm.org/10.1145/2479871.2479919},\n publisher = {ACM},\n address = {New York, NY, USA},\n series = {ICPE 2013},\n booktitle = {Proceedings of the ACM/SPEC International conference on performance engineering},\n isbn = {978-1-4503-1636-1},\n doi = {10.1145/2479871.2479919},\n author = {Coulden, David and Osman, Rasha and Knottenbelt, William J.},\n}\n\n','\n\nDavid Coulden, Rasha Osman, and William J. Knottenbelt.\nPerformance Modelling of Database Contention Using Queueing Petri\nNets.\nIn Proceedings of the ACM/SPEC International conference on\nperformance engineering, 2013, ICPE 2013, pages 331-334. ACM, New York, NY,\nUSA.\n2013.\n[ bib | DOI | http  ] 
\n@inproceedings{Coulden-2013-PMD-2479871.2479919,\ntitle = {{Performance Modelling of Database Contention Using Queueing Petri Nets}},\nyear = {2013},\npages = {331--334},\nkeywords = {database locking, performance modelling, queueing petri nets},\npdf = {http://doi.acm.org/10.1145/2479871.2479919},\npublisher = {ACM},\naddress = {New York, NY, USA},\nseries = {ICPE 2013},\nbooktitle = {Proceedings of the ACM/SPEC International conference on performance engineering},\nisbn = {978-1-4503-1636-1},\ndoi = {10.1145/2479871.2479919},\nauthor = {Coulden, David and Osman, Rasha and Knottenbelt, William J.}\n}\n
\n
\n','
\n@inproceedings{Coulden-2013-PMD-2479871.2479919,\n  title = {{Performance Modelling of Database Contention Using Queueing Petri Nets}},\n  year = {2013},\n  pages = {331--334},\n  keywords = {database locking, performance modelling, queueing petri nets},\n  pdf = {http://doi.acm.org/10.1145/2479871.2479919},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  series = {ICPE 2013},\n  booktitle = {Proceedings of the ACM/SPEC International conference on performance engineering},\n  isbn = {978-1-4503-1636-1},\n  doi = {10.1145/2479871.2479919},\n  author = {Coulden, David and Osman, Rasha and Knottenbelt, William J.}\n}\n
\n\n',NULL,'{Performance Modelling of Database Contention Using Queueing Petri Nets}',0,0,2013,0,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(712,'paper','2012-Babka-PhD','phdthesis','@phdthesis{2012-Babka-PhD,\n title = {Improving Accuracy of Software Performance Models on Multicore Platforms with Shared Caches},\n year = {2012},\n month = {9},\n school = {Charles University in Prague, Czech Republic},\n author = {Babka, Vlastimil},\n}\n\n','\n\nVlastimil Babka.\nImproving Accuracy of Software Performance Models on Multicore\nPlatforms with Shared Caches.\nPhD thesis, Charles University in Prague, Czech Republic, 9 2012.\n[ bib  ] 
\n@phdthesis{2012-Babka-PhD,\ntitle = {Improving Accuracy of Software Performance Models on Multicore Platforms with Shared Caches},\nyear = {2012},\nmonth = {9},\nschool = {Charles University in Prague, Czech Republic},\nauthor = {Babka, Vlastimil}\n}\n
\n
\n','
\n@phdthesis{2012-Babka-PhD,\n  title = {Improving Accuracy of Software Performance Models on Multicore Platforms with Shared Caches},\n  year = {2012},\n  month = {9},\n  school = {Charles University in Prague, Czech Republic},\n  author = {Babka, Vlastimil}\n}\n
\n\n',NULL,'Improving Accuracy of Software Performance Models on Multicore Platforms with Shared Caches',0,9,2012,9,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(714,'paper','2011_QImpress_Deliverable','techreport','@techreport{2011_QImpress_Deliverable,\n title = {Resource Impact Analysis},\n year = {2011},\n month = {1},\n pdf = {http://www.q-impress.eu/wordpress/wp-content/uploads/2010/11/D3.4-Resource_impact_analysis.pdf},\n institution = {Q-ImPrESS Project Deliverable D3.4},\n author = {Babka, Vlastimil and Bulej, Lubomir and Libic, Peter and Marek, Lukas and Martinec, Tomas and Podzimek, Andrej and Tuma, Petr},\n}\n\n','\n\nVlastimil Babka, Lubomir Bulej, Peter Libic, Lukas Marek, Tomas Martinec,\nAndrej Podzimek, and Petr Tuma.\nResource impact analysis.\nTechnical report, Q-ImPrESS Project Deliverable D3.4, 1 2011.\n[ bib | .pdf  ] 
\n@techreport{2011_QImpress_Deliverable,\ntitle = {Resource Impact Analysis},\nyear = {2011},\nmonth = {1},\npdf = {http://www.q-impress.eu/wordpress/wp-content/uploads/2010/11/D3.4-Resource_impact_analysis.pdf},\ninstitution = {Q-ImPrESS Project Deliverable D3.4},\nauthor = {Babka, Vlastimil and Bulej, Lubomir and Libic, Peter and Marek, Lukas and Martinec, Tomas and Podzimek, Andrej and Tuma, Petr}\n}\n
\n
\n','
\n@techreport{2011_QImpress_Deliverable,\n  title = {Resource Impact Analysis},\n  year = {2011},\n  month = {1},\n  pdf = {http://www.q-impress.eu/wordpress/wp-content/uploads/2010/11/D3.4-Resource_impact_analysis.pdf},\n  institution = {Q-ImPrESS Project Deliverable D3.4},\n  author = {Babka, Vlastimil and Bulej, Lubomir and Libic, Peter and Marek, Lukas and Martinec, Tomas and Podzimek, Andrej and Tuma, Petr}\n}\n
\n\n',NULL,'Resource Impact Analysis',0,1,2011,1,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(715,'paper','Babka-2011-LAI-2186355.2186377','inproceedings','@inproceedings{Babka-2011-LAI-2186355.2186377,\n title = {Can linear approximation improve performance prediction ?},\n year = {2011},\n pages = {250--264},\n abstract = {Software performance evaluation relies on the ability of simple models to predict the performance of complex systems. Often, however, the models are not capturing potentially relevant effects in system behavior, such as sharing of memory caches or sharing of cores by hardware threads. The goal of this paper is to investigate whether and to what degree a simple linear adjustment of service demands in software performance models captures these effects and thus improves accuracy. Outlined experiments explore the limits of the approach on two hardware platforms that include shared caches and hardware threads, with results indicating that the approach can improve throughput prediction accuracy significantly, but can also lead to loss of accuracy when the performance models are otherwise defective.},\n publisher = {Springer-Verlag},\n address = {Berlin, Heidelberg},\n booktitle = {Proceedings of the 8th European conference on Computer Performance Engineering},\n isbn = {978-3-642-24748-4},\n doi = {10.1007/978-3-642-24749-1_19},\n author = {Babka, Vlastimil and Tuma, Petr},\n}\n\n','\n\nVlastimil Babka and Petr Tuma.\nCan linear approximation improve performance prediction ?\nIn Proceedings of the 8th European conference on Computer\nPerformance Engineering, 2011, pages 250-264. Springer-Verlag, Berlin,\nHeidelberg.\n2011.\n[ bib | DOI | Abstract  ] 
\n@inproceedings{Babka-2011-LAI-2186355.2186377,\ntitle = {Can linear approximation improve performance prediction ?},\nyear = {2011},\npages = {250--264},\nabstract = {Software performance evaluation relies on the ability of simple models to predict the performance of complex systems. Often, however, the models are not capturing potentially relevant effects in system behavior, such as sharing of memory caches or sharing of cores by hardware threads. The goal of this paper is to investigate whether and to what degree a simple linear adjustment of service demands in software performance models captures these effects and thus improves accuracy. Outlined experiments explore the limits of the approach on two hardware platforms that include shared caches and hardware threads, with results indicating that the approach can improve throughput prediction accuracy significantly, but can also lead to loss of accuracy when the performance models are otherwise defective.},\npublisher = {Springer-Verlag},\naddress = {Berlin, Heidelberg},\nbooktitle = {Proceedings of the 8th European conference on Computer Performance Engineering},\nisbn = {978-3-642-24748-4},\ndoi = {10.1007/978-3-642-24749-1_19},\nauthor = {Babka, Vlastimil and Tuma, Petr}\n}\n
\n
\nSoftware performance evaluation relies on the ability of simple models to predict the performance of complex systems. Often, however, the models are not capturing potentially relevant effects in system behavior, such as sharing of memory caches or sharing of cores by hardware threads. The goal of this paper is to investigate whether and to what degree a simple linear adjustment of service demands in software performance models captures these effects and thus improves accuracy. Outlined experiments explore the limits of the approach on two hardware platforms that include shared caches and hardware threads, with results indicating that the approach can improve throughput prediction accuracy significantly, but can also lead to loss of accuracy when the performance models are otherwise defective.\n
\n','
\n@inproceedings{Babka-2011-LAI-2186355.2186377,\n  title = {Can linear approximation improve performance prediction ?},\n  year = {2011},\n  pages = {250--264},\n  abstract = {Software performance evaluation relies on the ability of simple models to predict the performance of complex systems. Often, however, the models are not capturing potentially relevant effects in system behavior, such as sharing of memory caches or sharing of cores by hardware threads. The goal of this paper is to investigate whether and to what degree a simple linear adjustment of service demands in software performance models captures these effects and thus improves accuracy. Outlined experiments explore the limits of the approach on two hardware platforms that include shared caches and hardware threads, with results indicating that the approach can improve throughput prediction accuracy significantly, but can also lead to loss of accuracy when the performance models are otherwise defective.},\n  publisher = {Springer-Verlag},\n  address = {Berlin, Heidelberg},\n  booktitle = {Proceedings of the 8th European conference on Computer Performance Engineering},\n  isbn = {978-3-642-24748-4},\n  doi = {10.1007/978-3-642-24749-1_19},\n  author = {Babka, Vlastimil and Tuma, Petr}\n}\n
\n\n','Software performance evaluation relies on the ability of simple models to predict the performance of complex systems. Often, however, the models are not capturing potentially relevant effects in system behavior, such as sharing of memory caches or sharing of cores by hardware threads. The goal of this paper is to investigate whether and to what degree a simple linear adjustment of service demands in software performance models captures these effects and thus improves accuracy. Outlined experiments explore the limits of the approach on two hardware platforms that include shared caches and hardware threads, with results indicating that the approach can improve throughput prediction accuracy significantly, but can also lead to loss of accuracy when the performance models are otherwise defective.','Can linear approximation improve performance prediction ?',0,0,2011,0,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(716,'paper','Babka-2010-VMP-2163764.2163769','inproceedings','@inproceedings{Babka-2010-VMP-2163764.2163769,\n title = {Validating model-driven performance predictions on random software systems},\n year = {2010},\n pages = {3--19},\n publisher = {Springer-Verlag},\n address = {Berlin, Heidelberg},\n booktitle = {Proceedings of the 6th international conference on Quality of Software Architectures: research into Practice - Reality and Gaps},\n isbn = {978-3-642-13820-1},\n doi = {10.1007/978-3-642-13821-8_3},\n author = {Babka, Vlastimil and Tuma, Petr and Bulej, Lubomir},\n}\n\n','\n\nVlastimil Babka, Petr Tuma, and Lubomir Bulej.\nValidating model-driven performance predictions on random software\nsystems.\nIn Proceedings of the 6th international conference on Quality of\nSoftware Architectures: research into Practice - Reality and Gaps, 2010,\npages 3-19. Springer-Verlag, Berlin, Heidelberg.\n2010.\n[ bib | DOI  ] 
\n@inproceedings{Babka-2010-VMP-2163764.2163769,\ntitle = {Validating model-driven performance predictions on random software systems},\nyear = {2010},\npages = {3--19},\npublisher = {Springer-Verlag},\naddress = {Berlin, Heidelberg},\nbooktitle = {Proceedings of the 6th international conference on Quality of Software Architectures: research into Practice - Reality and Gaps},\nisbn = {978-3-642-13820-1},\ndoi = {10.1007/978-3-642-13821-8_3},\nauthor = {Babka, Vlastimil and Tuma, Petr and Bulej, Lubomir}\n}\n
\n
\n','
\n@inproceedings{Babka-2010-VMP-2163764.2163769,\n  title = {Validating model-driven performance predictions on random software systems},\n  year = {2010},\n  pages = {3--19},\n  publisher = {Springer-Verlag},\n  address = {Berlin, Heidelberg},\n  booktitle = {Proceedings of the 6th international conference on Quality of Software Architectures: research into Practice - Reality and Gaps},\n  isbn = {978-3-642-13820-1},\n  doi = {10.1007/978-3-642-13821-8_3},\n  author = {Babka, Vlastimil and Tuma, Petr and Bulej, Lubomir}\n}\n
\n\n',NULL,'Validating model-driven performance predictions on random software systems',0,0,2010,0,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(717,'paper','KoSa2009-DEBSPerformance','article','@article{KoSa2009-DEBSPerformance,\n title = {{Benchmarking and Performance Modeling of Event-Based Systems}},\n journal = {it - Information Technology},\n year = {2009},\n month = {October},\n volume = {51},\n number = {5},\n pages = {262--269},\n abstract = {Event-based systems are used increasingly often to build loosely-coupled distributed applications. With their growing popularity and gradual adoption in mission critical areas, the need for novel techniques for benchmarking and performance modeling of event-based systems is increasing. In this article, we provide an overview of the state-of-the-art in this area considering both centralized systems based on message-oriented middleware as well as large-scale distributed publish/subscribe systems. We consider a number of specific techniques for benchmarking and performance modeling, discuss their advantages and disadvantages, and provide references for further information. The techniques we review help to ensure that systems are designed and sized to meet their quality-of-service requirements.},\n pdf = {http://www.dvs.tu-darmstadt.de/publications/pdf/itit.2009.0550.pdf},\n publisher = {Oldenbourg Wissenschaftsverlag},\n address = {Munich, Germany},\n doi = {10.1524/itit.2009.0550},\n author = {Kounev, Samuel and Sachs, Kai},\n}\n\n','\n\nSamuel Kounev and Kai Sachs.\nBenchmarking and Performance Modeling of Event-Based Systems.\nit - Information Technology, 51(5):262-269, October 2009,\nOldenbourg Wissenschaftsverlag, Munich, Germany.\n[ bib | DOI | .pdf | Abstract  ] 
\n@article{KoSa2009-DEBSPerformance,\ntitle = {{Benchmarking and Performance Modeling of Event-Based Systems}},\njournal = {it - Information Technology},\nyear = {2009},\nmonth = {October},\nvolume = {51},\nnumber = {5},\npages = {262--269},\nabstract = {Event-based systems are used increasingly often to build loosely-coupled distributed applications. With their growing popularity and gradual adoption in mission critical areas, the need for novel techniques for benchmarking and performance modeling of event-based systems is increasing. In this article, we provide an overview of the state-of-the-art in this area considering both centralized systems based on message-oriented middleware as well as large-scale distributed publish/subscribe systems. We consider a number of specific techniques for benchmarking and performance modeling, discuss their advantages and disadvantages, and provide references for further information. The techniques we review help to ensure that systems are designed and sized to meet their quality-of-service requirements.},\npdf = {http://www.dvs.tu-darmstadt.de/publications/pdf/itit.2009.0550.pdf},\npublisher = {Oldenbourg Wissenschaftsverlag},\naddress = {Munich, Germany},\ndoi = {10.1524/itit.2009.0550},\nauthor = {Kounev, Samuel and Sachs, Kai}\n}\n
\n
\nEvent-based systems are used increasingly often to build loosely-coupled distributed applications. With their growing popularity and gradual adoption in mission critical areas, the need for novel techniques for benchmarking and performance modeling of event-based systems is increasing. In this article, we provide an overview of the state-of-the-art in this area considering both centralized systems based on message-oriented middleware as well as large-scale distributed publish/subscribe systems. We consider a number of specific techniques for benchmarking and performance modeling, discuss their advantages and disadvantages, and provide references for further information. The techniques we review help to ensure that systems are designed and sized to meet their quality-of-service requirements.\n
\n','
\n@article{KoSa2009-DEBSPerformance,\n  title = {{Benchmarking and Performance Modeling of Event-Based Systems}},\n  journal = {it - Information Technology},\n  year = {2009},\n  month = {October},\n  volume = {51},\n  number = {5},\n  pages = {262--269},\n  abstract = {Event-based systems are used increasingly often to build loosely-coupled distributed applications. With their growing popularity and gradual adoption in mission critical areas, the need for novel techniques for benchmarking and performance modeling of event-based systems is increasing. In this article, we provide an overview of the state-of-the-art in this area considering both centralized systems based on message-oriented middleware as well as large-scale distributed publish/subscribe systems. We consider a number of specific techniques for benchmarking and performance modeling, discuss their advantages and disadvantages, and provide references for further information. The techniques we review help to ensure that systems are designed and sized to meet their quality-of-service requirements.},\n  pdf = {http://www.dvs.tu-darmstadt.de/publications/pdf/itit.2009.0550.pdf},\n  publisher = {Oldenbourg Wissenschaftsverlag},\n  address = {Munich, Germany},\n  doi = {10.1524/itit.2009.0550},\n  author = {Kounev, Samuel and Sachs, Kai}\n}\n
\n\n','Event-based systems are used increasingly often to build loosely-coupled distributed applications. With their growing popularity and gradual adoption in mission critical areas, the need for novel techniques for benchmarking and performance modeling of event-based systems is increasing. In this article, we provide an overview of the state-of-the-art in this area considering both centralized systems based on message-oriented middleware as well as large-scale distributed publish/subscribe systems. We consider a number of specific techniques for benchmarking and performance modeling, discuss their advantages and disadvantages, and provide references for further information. The techniques we review help to ensure that systems are designed and sized to meet their quality-of-service requirements.','{Benchmarking and Performance Modeling of Event-Based Systems}',0,10,2009,10,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(718,'paper','SeLa2008','inproceedings','@inproceedings{SeLa2008,\n title = {An Operational Activity Analysis Using Analytic Hierarchy Process and Queuing Petri Net},\n year = {2008},\n month = {6},\n pages = {107--121},\n editor = {Joseph Barjis and Murali Mohan Narasipuram and Peter Rittgen and Ela Hunt and Xavier Franch and Remi Coletta},\n booktitle = {Proceedings of the 4th International Workshop on Enterprise & Organizational Modeling and Simulation held in conjunction with the CAiSE\'08 Conference, Montpellier, France, June 16-17},\n author = {Ait Seddik, Arezki and Lallement, Patrick},\n}\n\n','\n\nArezki Ait Seddik and Patrick Lallement.\nAn operational activity analysis using analytic hierarchy process and\nqueuing petri net.\nIn Proceedings of the 4th International Workshop on Enterprise &\nOrganizational Modeling and Simulation held in conjunction with the CAiSE\'08\nConference, Montpellier, France, June 16-17, Joseph Barjis, Murali Mohan\nNarasipuram, Peter Rittgen, Ela Hunt, Xavier Franch, and Remi Coletta,\neditors, 6 2008, pages 107-121.\n[ bib  ] 
\n@inproceedings{SeLa2008,\ntitle = {An Operational Activity Analysis Using Analytic Hierarchy Process and Queuing Petri Net},\nyear = {2008},\nmonth = {6},\npages = {107--121},\neditor = {Joseph Barjis and Murali Mohan Narasipuram and Peter Rittgen and Ela Hunt and Xavier Franch and Remi Coletta},\nbooktitle = {Proceedings of the 4th International Workshop on Enterprise & Organizational Modeling and Simulation held in conjunction with the CAiSE\'08 Conference, Montpellier, France, June 16-17},\nauthor = {Ait Seddik, Arezki and Lallement, Patrick}\n}\n
\n
\n','
\n@inproceedings{SeLa2008,\n  title = {An Operational Activity Analysis Using Analytic Hierarchy Process and Queuing Petri Net},\n  year = {2008},\n  month = {6},\n  pages = {107--121},\n  editor = {Joseph Barjis and Murali Mohan Narasipuram and Peter Rittgen and Ela Hunt and Xavier Franch and Remi Coletta},\n  booktitle = {Proceedings of the 4th International Workshop on Enterprise & Organizational Modeling and Simulation held in conjunction with the CAiSE\'08 Conference, Montpellier, France, June 16-17},\n  author = {Ait Seddik, Arezki and Lallement, Patrick}\n}\n
\n\n',NULL,'An Operational Activity Analysis Using Analytic Hierarchy Process and Queuing Petri Net',0,6,2008,6,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(720,'paper','He2007-TUD-LQNvsQPN','mastersthesis','@mastersthesis{He2007-TUD-LQNvsQPN,\n title = {Performance Modelling of Java EE Applications using LQNs and QPNs},\n year = {2007},\n month = {9},\n school = {Technische Universit{\"a}t Darmstadt, Darmstadt, Germany},\n author = {Heimburger, Frank},\n}\n\n','\n\nFrank Heimburger.\nPerformance modelling of java ee applications using lqns and qpns.\nMaster\'s thesis, Technische Universit\"at Darmstadt, Darmstadt,\nGermany, 9 2007.\n[ bib  ] 
\n@mastersthesis{He2007-TUD-LQNvsQPN,\ntitle = {Performance Modelling of Java EE Applications using LQNs and QPNs},\nyear = {2007},\nmonth = {9},\nschool = {Technische Universit{\"a}t Darmstadt, Darmstadt, Germany},\nauthor = {Heimburger, Frank}\n}\n
\n
\n','
\n@mastersthesis{He2007-TUD-LQNvsQPN,\n  title = {Performance Modelling of Java EE Applications using LQNs and QPNs},\n  year = {2007},\n  month = {9},\n  school = {Technische Universit{\"a}t Darmstadt, Darmstadt, Germany},\n  author = {Heimburger, Frank}\n}\n
\n\n',NULL,'Performance Modelling of Java EE Applications using LQNs and QPNs',0,9,2007,9,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(721,'paper','Du2006-TUD-QPE','mastersthesis','@mastersthesis{Du2006-TUD-QPE,\n title = {{QPE - A Graphical Editor for Modeling using Queueing Petri Nets}},\n year = {2006},\n month = {3},\n school = {{Technische Universit{\\\"a}t Darmstadt}},\n author = {Dutz, Christofer},\n}\n\n','\n\nChristofer Dutz.\nQPE - A Graphical Editor for Modeling using Queueing Petri Nets.\nMaster\'s thesis, Technische Universität Darmstadt, 3 2006.\n[ bib  ] 
\n@mastersthesis{Du2006-TUD-QPE,\ntitle = {{QPE - A Graphical Editor for Modeling using Queueing Petri Nets}},\nyear = {2006},\nmonth = {3},\nschool = {{Technische Universit{\\\"a}t Darmstadt}},\nauthor = {Dutz, Christofer}\n}\n
\n
\n','
\n@mastersthesis{Du2006-TUD-QPE,\n  title = {{QPE - A Graphical Editor for Modeling using Queueing Petri Nets}},\n  year = {2006},\n  month = {3},\n  school = {{Technische Universit{\\\"a}t Darmstadt}},\n  author = {Dutz, Christofer}\n}\n
\n\n',NULL,'{QPE - A Graphical Editor for Modeling using Queueing Petri Nets}',0,3,2006,3,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(722,'paper','BeSh2004','inproceedings','@inproceedings{BeSh2004,\n title = {Performance Prediction and Physical Design of J2EE based Web applications},\n year = {2004},\n month = {7},\n booktitle = {WSEAS CSCC 2004, Athens, Greece},\n author = {Bellur, Umesh and Shirabate, Akhilesh},\n}\n\n','\n\nUmesh Bellur and Akhilesh Shirabate.\nPerformance prediction and physical design of j2ee based web\napplications.\nIn WSEAS CSCC 2004, Athens, Greece, 7 2004.\n[ bib  ] 
\n@inproceedings{BeSh2004,\ntitle = {Performance Prediction and Physical Design of J2EE based Web applications},\nyear = {2004},\nmonth = {7},\nbooktitle = {WSEAS CSCC 2004, Athens, Greece},\nauthor = {Bellur, Umesh and Shirabate, Akhilesh}\n}\n
\n
\n','
\n@inproceedings{BeSh2004,\n  title = {Performance Prediction and Physical Design of J2EE based Web applications},\n  year = {2004},\n  month = {7},\n  booktitle = {WSEAS CSCC 2004, Athens, Greece},\n  author = {Bellur, Umesh and Shirabate, Akhilesh}\n}\n
\n\n',NULL,'Performance Prediction and Physical Design of J2EE based Web applications',0,7,2004,7,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(723,'paper','BaKr2002-SPNs_Intro_to_the_Theory','book','@book{BaKr2002-SPNs_Intro_to_the_Theory,\n title = {Stochastic Petri Nets - An Introduction to the Theory},\n year = {2002},\n publisher = {Vieweg Verlag},\n author = {Bause, Falko and Kritzinger, Pieter S.},\n}\n\n','\n\nFalko Bause and Pieter S. Kritzinger.\nStochastic Petri Nets - An Introduction to the Theory.\nVieweg Verlag, 2002.\n[ bib  ] 
\n@book{BaKr2002-SPNs_Intro_to_the_Theory,\ntitle = {Stochastic Petri Nets - An Introduction to the Theory},\nyear = {2002},\npublisher = {Vieweg Verlag},\nauthor = {Bause, Falko and Kritzinger, Pieter S.}\n}\n
\n
\n','
\n@book{BaKr2002-SPNs_Intro_to_the_Theory,\n  title = {Stochastic Petri Nets - An Introduction to the Theory},\n  year = {2002},\n  publisher = {Vieweg Verlag},\n  author = {Bause, Falko and Kritzinger, Pieter S.}\n}\n
\n\n',NULL,'Stochastic Petri Nets - An Introduction to the Theory',0,0,2002,0,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(724,'paper','933169','article','@article{933169,\n title = {Modeling, scheduling, and prediction in wafer fabrication systems using queueing Petri net and genetic algorithm},\n journal = {Proceedings of the 2001 IEEE International Conference on Robotics and Automation (ICRA 2001)},\n year = {2001},\n month = {7},\n volume = {4},\n pages = {3559-3564},\n isbn = {0-7803-6576-3},\n issn = {1050-4729},\n doi = {10.1109/ROBOT.2001.933169},\n author = {Wen, Hung-We and Fu, Li-Chen and Huang, Shih-Shinh},\n}\n\n','\n\nHung-We Wen, Li-Chen Fu, and Shih-Shinh Huang.\nModeling, scheduling, and prediction in wafer fabrication systems\nusing queueing petri net and genetic algorithm.\nProceedings of the 2001 IEEE International Conference on\nRobotics and Automation (ICRA 2001), 4:3559-3564, 7 2001.\n[ bib | DOI  ] 
\n@article{933169,\ntitle = {Modeling, scheduling, and prediction in wafer fabrication systems using queueing Petri net and genetic algorithm},\njournal = {Proceedings of the 2001 IEEE International Conference on Robotics and Automation (ICRA 2001)},\nyear = {2001},\nmonth = {7},\nvolume = {4},\npages = {3559-3564},\nisbn = {0-7803-6576-3},\nissn = {1050-4729},\ndoi = {10.1109/ROBOT.2001.933169},\nauthor = {Wen, Hung-We and Fu, Li-Chen and Huang, Shih-Shinh}\n}\n
\n
\n','
\n@article{933169,\n  title = {Modeling, scheduling, and prediction in wafer fabrication systems using queueing Petri net and genetic algorithm},\n  journal = {Proceedings of the 2001 IEEE International Conference on Robotics and Automation (ICRA 2001)},\n  year = {2001},\n  month = {7},\n  volume = {4},\n  pages = {3559-3564},\n  isbn = {0-7803-6576-3},\n  issn = {1050-4729},\n  doi = {10.1109/ROBOT.2001.933169},\n  author = {Wen, Hung-We and Fu, Li-Chen and Huang, Shih-Shinh}\n}\n
\n\n',NULL,'Modeling, scheduling, and prediction in wafer fabrication systems using queueing Petri net and genetic algorithm',0,7,2001,7,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(725,'paper','BaBu1998-QPNs_with_PF_Solution','article','@article{BaBu1998-QPNs_with_PF_Solution,\n title = {Queueing Petri Nets with Product Form Solution},\n journal = {Performance Evaluation},\n year = {1998},\n volume = {32},\n number = {4},\n pages = {265--299},\n author = {Bause, Falko and Buchholz, Peter},\n}\n\n','\n\nFalko Bause and Peter Buchholz.\nQueueing petri nets with product form solution.\nPerformance Evaluation, 32(4):265-299, 1998.\n[ bib  ] 
\n@article{BaBu1998-QPNs_with_PF_Solution,\ntitle = {Queueing Petri Nets with Product Form Solution},\njournal = {Performance Evaluation},\nyear = {1998},\nvolume = {32},\nnumber = {4},\npages = {265--299},\nauthor = {Bause, Falko and Buchholz, Peter}\n}\n
\n
\n','
\n@article{BaBu1998-QPNs_with_PF_Solution,\n  title = {Queueing Petri Nets with Product Form Solution},\n  journal = {Performance Evaluation},\n  year = {1998},\n  volume = {32},\n  number = {4},\n  pages = {265--299},\n  author = {Bause, Falko and Buchholz, Peter}\n}\n
\n\n',NULL,'Queueing Petri Nets with Product Form Solution',0,0,1998,0,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(726,'paper','BaBuKe1997-Integrating_Software_and_Hardware_Perf_Models','inproceedings','@inproceedings{BaBuKe1997-Integrating_Software_and_Hardware_Perf_Models,\n title = {Integrating Software and Hardware Performance Models Using Hierarchical Queueing Petri Nets},\n year = {1997},\n booktitle = {Proceedings of the 9.verb=~=ITGverb=~=/verb=~=GIverb=~=- Fachtagung Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen,verb=~=(MMB\'97), Freiberg, Germany, September 17-19},\n author = {Bause, Falko and Buchholz, Peter and Kemper, Peter},\n}\n\n','\n\nFalko Bause, Peter Buchholz, and Peter Kemper.\nIntegrating software and hardware performance models using\nhierarchical queueing petri nets.\nIn Proceedings of the 9.verb= =ITGverb= =/verb= =GIverb= =-\nFachtagung Messung, Modellierung und Bewertung von Rechen- und\nKommunikationssystemen,verb= =(MMB\'97), Freiberg, Germany, September 17-19,\n1997.\n[ bib  ] 
\n@inproceedings{BaBuKe1997-Integrating_Software_and_Hardware_Perf_Models,\ntitle = {Integrating Software and Hardware Performance Models Using Hierarchical Queueing Petri Nets},\nyear = {1997},\nbooktitle = {Proceedings of the 9.verb=~=ITGverb=~=/verb=~=GIverb=~=- Fachtagung Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen,verb=~=(MMB\'97), Freiberg, Germany, September 17-19},\nauthor = {Bause, Falko and Buchholz, Peter and Kemper, Peter}\n}\n
\n
\n','
\n@inproceedings{BaBuKe1997-Integrating_Software_and_Hardware_Perf_Models,\n  title = {Integrating Software and Hardware Performance Models Using Hierarchical Queueing Petri Nets},\n  year = {1997},\n  booktitle = {Proceedings of the 9.verb=~=ITGverb=~=/verb=~=GIverb=~=- Fachtagung Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen,verb=~=(MMB\'97), Freiberg, Germany, September 17-19},\n  author = {Bause, Falko and Buchholz, Peter and Kemper, Peter}\n}\n
\n\n',NULL,'Integrating Software and Hardware Performance Models Using Hierarchical Queueing Petri Nets',0,0,1997,0,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(727,'paper','BaBuKe1995-QPN_Tool_for_HQPN','inproceedings','@inproceedings{BaBuKe1995-QPN_Tool_for_HQPN,\n title = {QPN-Tool for the Specification and Analysis of Hierarchically Combined Queueing Petri Nets},\n year = {1995},\n volume = {977},\n pages = {224--238},\n editor = {Beilner, H. and Bause, F.},\n publisher = {Springer},\n address = {Heidelberg, Germany},\n series = {Lecture Notes in Computer Science},\n booktitle = {Quantitative Evaluation of Computing and Communication Systems},\n author = {Bause, Falko and Buchholz, Peter and Kemper, Peter},\n}\n\n','\n\nFalko Bause, Peter Buchholz, and Peter Kemper.\nQpn-tool for the specification and analysis of hierarchically\ncombined queueing petri nets.\nIn Quantitative Evaluation of Computing and Communication\nSystems, H. Beilner and F. Bause, editors, 1995, volume 977 of Lecture\nNotes in Computer Science, pages 224-238. Springer, Heidelberg, Germany.\n1995.\n[ bib  ] 
\n@inproceedings{BaBuKe1995-QPN_Tool_for_HQPN,\ntitle = {QPN-Tool for the Specification and Analysis of Hierarchically Combined Queueing Petri Nets},\nyear = {1995},\nvolume = {977},\npages = {224--238},\neditor = {Beilner, H. and Bause, F.},\npublisher = {Springer},\naddress = {Heidelberg, Germany},\nseries = {Lecture Notes in Computer Science},\nbooktitle = {Quantitative Evaluation of Computing and Communication Systems},\nauthor = {Bause, Falko and Buchholz, Peter and Kemper, Peter}\n}\n
\n
\n','
\n@inproceedings{BaBuKe1995-QPN_Tool_for_HQPN,\n  title = {QPN-Tool for the Specification and Analysis of Hierarchically Combined Queueing Petri Nets},\n  year = {1995},\n  volume = {977},\n  pages = {224--238},\n  editor = {Beilner, H. and Bause, F.},\n  publisher = {Springer},\n  address = {Heidelberg, Germany},\n  series = {Lecture Notes in Computer Science},\n  booktitle = {Quantitative Evaluation of Computing and Communication Systems},\n  author = {Bause, Falko and Buchholz, Peter and Kemper, Peter}\n}\n
\n\n',NULL,'QPN-Tool for the Specification and Analysis of Hierarchically Combined Queueing Petri Nets',0,0,1995,0,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(728,'paper','BaBuKe1994-HQPNs','inproceedings','@inproceedings{BaBuKe1994-HQPNs,\n title = {Hierarchically Combined Queueing Petri Nets},\n year = {1994},\n month = {6},\n number = {199},\n pages = {176--182},\n publisher = {Springer},\n address = {Heidelberg, Germany},\n series = {LNCI 199},\n booktitle = {Proceedings of the 11th International Conference on Analysis and Optimization of Systems, Discrete Event Systems, Sophie-Antipolis, France},\n author = {Bause, Falko and Buchholz, Peter and Kemper, Peter},\n}\n\n','\n\nFalko Bause, Peter Buchholz, and Peter Kemper.\nHierarchically combined queueing petri nets.\nIn Proceedings of the 11th International Conference on Analysis\nand Optimization of Systems, Discrete Event Systems, Sophie-Antipolis,\nFrance, 6 1994, number 199 in LNCI 199, pages 176-182. Springer,\nHeidelberg, Germany.\n6 1994.\n[ bib  ] 
\n@inproceedings{BaBuKe1994-HQPNs,\ntitle = {Hierarchically Combined Queueing Petri Nets},\nyear = {1994},\nmonth = {6},\nnumber = {199},\npages = {176--182},\npublisher = {Springer},\naddress = {Heidelberg, Germany},\nseries = {LNCI 199},\nbooktitle = {Proceedings of the 11th International Conference on Analysis and Optimization of Systems, Discrete Event Systems, Sophie-Antipolis, France},\nauthor = {Bause, Falko and Buchholz, Peter and Kemper, Peter}\n}\n
\n
\n','
\n@inproceedings{BaBuKe1994-HQPNs,\n  title = {Hierarchically Combined Queueing Petri Nets},\n  year = {1994},\n  month = {6},\n  number = {199},\n  pages = {176--182},\n  publisher = {Springer},\n  address = {Heidelberg, Germany},\n  series = {LNCI 199},\n  booktitle = {Proceedings of the 11th International Conference on Analysis and Optimization of Systems, Discrete Event Systems, Sophie-Antipolis, France},\n  author = {Bause, Falko and Buchholz, Peter and Kemper, Peter}\n}\n
\n\n',NULL,'Hierarchically Combined Queueing Petri Nets',0,6,1994,6,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(729,'paper','Ba1993-QPN_Formalism','inproceedings','@inproceedings{Ba1993-QPN_Formalism,\n title = {Queueing Petri Nets - A formalism for the combined qualitative and quantitative analysis of systems},\n year = {1993},\n pages = {14--23},\n publisher = {IEEE Computer Society},\n address = {Washington, DC, USA},\n booktitle = {Proceedings of the 5th International Workshop on Petri Nets and Performance Models, Toulouse, France, October 19-22},\n author = {Bause, Falko},\n}\n\n','\n\nFalko Bause.\nQueueing petri nets - a formalism for the combined qualitative and\nquantitative analysis of systems.\nIn Proceedings of the 5th International Workshop on Petri Nets\nand Performance Models, Toulouse, France, October 19-22, 1993, pages 14-23.\nIEEE Computer Society, Washington, DC, USA.\n1993.\n[ bib  ] 
\n@inproceedings{Ba1993-QPN_Formalism,\ntitle = {Queueing Petri Nets - A formalism for the combined qualitative and quantitative analysis of systems},\nyear = {1993},\npages = {14--23},\npublisher = {IEEE Computer Society},\naddress = {Washington, DC, USA},\nbooktitle = {Proceedings of the 5th International Workshop on Petri Nets and Performance Models, Toulouse, France, October 19-22},\nauthor = {Bause, Falko}\n}\n
\n
\n','
\n@inproceedings{Ba1993-QPN_Formalism,\n  title = {Queueing Petri Nets - A formalism for the combined qualitative and quantitative analysis of systems},\n  year = {1993},\n  pages = {14--23},\n  publisher = {IEEE Computer Society},\n  address = {Washington, DC, USA},\n  booktitle = {Proceedings of the 5th International Workshop on Petri Nets and Performance Models, Toulouse, France, October 19-22},\n  author = {Bause, Falko}\n}\n
\n\n',NULL,'Queueing Petri Nets - A formalism for the combined qualitative and quantitative analysis of systems',0,0,1993,0,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(730,'paper','Ba1993-QPN+PN--QPN','techreport','@techreport{Ba1993-QPN+PN--QPN,\n title = {QN + PN = QPN - Combining Queueing Networks and Petri Nets},\n year = {1993},\n institution = {Department of CS, University of Dortmund, Germany},\n type = {Technical Report No.461},\n author = {Bause, Falko},\n}\n\n','\n\nFalko Bause.\nQn + pn = qpn - combining queueing networks and petri nets.\nTechnical report no.461, Department of CS, University of Dortmund,\nGermany, 1993.\n[ bib  ] 
\n@techreport{Ba1993-QPN+PN--QPN,\ntitle = {QN + PN = QPN - Combining Queueing Networks and Petri Nets},\nyear = {1993},\ninstitution = {Department of CS, University of Dortmund, Germany},\ntype = {Technical Report No.461},\nauthor = {Bause, Falko}\n}\n
\n
\n','
\n@techreport{Ba1993-QPN+PN--QPN,\n  title = {QN + PN = QPN - Combining Queueing Networks and Petri Nets},\n  year = {1993},\n  institution = {Department of CS, University of Dortmund, Germany},\n  type = {Technical Report No.461},\n  author = {Bause, Falko}\n}\n
\n\n',NULL,'QN + PN = QPN - Combining Queueing Networks and Petri Nets',0,0,1993,0,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(738,'paper','intervalPowerVariants','article','@article{intervalPowerVariants,\n abstract = {The article gives an overview of power function variants and compares three differently extensive versions for use in interval arithmetics. Aiming at the general power function for inclusion in interval libraries, which is defined for as many pairs of base and exponent as possible, we observe that the definition of a power for each such pair depends on the context. This problem eventually comes up at the point where reasonable doubts about the definition 0_sup_0 and powers with negative base in correlation with a non-integral exponent arise. We come up with several variants serving distinct purposes, yet also recommend a general-purpose power function, which is unique for being restricted to integral exponents on the domain of negative bases. Three different variants of interval power functions satisfy all meaningful general exponentiation needs. We provide a unified treatment to handle the variants and present valuable implementation techniques for the computation of these interval functions along with a mathematic foundation.},\n year = {2013},\n issn = {1432-7643},\n journal = {Soft Computing},\n volume = {17},\n number = {8},\n doi = {10.1007/s00500-013-1008-8},\n title = {Variants of the general interval power function},\n url = {http://dx.doi.org/10.1007/s00500-013-1008-8},\n publisher = {Springer Berlin Heidelberg},\n keywords = {Power function; Interval arithmetic; Interval functions},\n author = {Heimlich, Oliver and Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\n pages = {1357-1366},\n language = {English},\n}\n\n','\n\nOliver Heimlich, Marco Nehmeier, and Jürgen Wolff von Gudenberg.\nVariants of the general interval power function.\nSoft Computing, 17(8):1357-1366, 2013, Springer Berlin\nHeidelberg.\n[ bib | DOI | http | Abstract  ] 
\n@article{intervalPowerVariants,\nabstract = {The article gives an overview of power function variants and compares three differently extensive versions for use in interval arithmetics. Aiming at the general power function for inclusion in interval libraries, which is defined for as many pairs of base and exponent as possible, we observe that the definition of a power for each such pair depends on the context. This problem eventually comes up at the point where reasonable doubts about the definition 0_sup_0 and powers with negative base in correlation with a non-integral exponent arise. We come up with several variants serving distinct purposes, yet also recommend a general-purpose power function, which is unique for being restricted to integral exponents on the domain of negative bases. Three different variants of interval power functions satisfy all meaningful general exponentiation needs. We provide a unified treatment to handle the variants and present valuable implementation techniques for the computation of these interval functions along with a mathematic foundation.},\nyear = {2013},\nissn = {1432-7643},\njournal = {Soft Computing},\nvolume = {17},\nnumber = {8},\ndoi = {10.1007/s00500-013-1008-8},\ntitle = {Variants of the general interval power function},\nurl = {http://dx.doi.org/10.1007/s00500-013-1008-8},\npublisher = {Springer Berlin Heidelberg},\nkeywords = {Power function; Interval arithmetic; Interval functions},\nauthor = {Heimlich, Oliver and Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\npages = {1357-1366},\nlanguage = {English}\n}\n
\n
\nThe article gives an overview of power function variants and compares three differently extensive versions for use in interval arithmetics. Aiming at the general power function for inclusion in interval libraries, which is defined for as many pairs of base and exponent as possible, we observe that the definition of a power for each such pair depends on the context. This problem eventually comes up at the point where reasonable doubts about the definition 0_sup_0 and powers with negative base in correlation with a non-integral exponent arise. We come up with several variants serving distinct purposes, yet also recommend a general-purpose power function, which is unique for being restricted to integral exponents on the domain of negative bases. Three different variants of interval power functions satisfy all meaningful general exponentiation needs. We provide a unified treatment to handle the variants and present valuable implementation techniques for the computation of these interval functions along with a mathematic foundation.\n
\n','
\n@article{intervalPowerVariants,\n  abstract = {The article gives an overview of power function variants and compares three differently extensive versions for use in interval arithmetics. Aiming at the general power function for inclusion in interval libraries, which is defined for as many pairs of base and exponent as possible, we observe that the definition of a power for each such pair depends on the context. This problem eventually comes up at the point where reasonable doubts about the definition 0_sup_0 and powers with negative base in correlation with a non-integral exponent arise. We come up with several variants serving distinct purposes, yet also recommend a general-purpose power function, which is unique for being restricted to integral exponents on the domain of negative bases. Three different variants of interval power functions satisfy all meaningful general exponentiation needs. We provide a unified treatment to handle the variants and present valuable implementation techniques for the computation of these interval functions along with a mathematic foundation.},\n  year = {2013},\n  issn = {1432-7643},\n  journal = {Soft Computing},\n  volume = {17},\n  number = {8},\n  doi = {10.1007/s00500-013-1008-8},\n  title = {Variants of the general interval power function},\n  url = {http://dx.doi.org/10.1007/s00500-013-1008-8},\n  publisher = {Springer Berlin Heidelberg},\n  keywords = {Power function; Interval arithmetic; Interval functions},\n  author = {Heimlich, Oliver and Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\n  pages = {1357-1366},\n  language = {English}\n}\n
\n\n','The article gives an overview of power function variants and compares three differently extensive versions for use in interval arithmetics. Aiming at the general power function for inclusion in interval libraries, which is defined for as many pairs of base and exponent as possible, we observe that the definition of a power for each such pair depends on the context. This problem eventually comes up at the point where reasonable doubts about the definition 0_sup_0 and powers with negative base in correlation with a non-integral exponent arise. We come up with several variants serving distinct purposes, yet also recommend a general-purpose power function, which is unique for being restricted to integral exponents on the domain of negative bases. Three different variants of interval power functions satisfy all meaningful general exponentiation needs. We provide a unified treatment to handle the variants and present valuable implementation techniques for the computation of these interval functions along with a mathematic foundation.','Variants of the general interval power function',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 10:30:35',0),(739,'paper','siegelScan2010','article','@article{siegelScan2010,\n abstract = {Long accumulators for the exact summation of floating point numbers or products are well known tools in numerical analysis especially in algorithms verifying the result (C++ Toolbox for Verified Computing, Springer, New York, 1995). An exact dot product is one of the features of the upcoming interval standard (IEEE Interval Standard Working Group, P1788. http://grouper.ieee.org/groups/1788/). Usually an accumulator is realized as a memory block with operations to add floating point numbers and products. Several variants have been proposed to avoid carry rippling: use separate accumulators for positive and negative numbers, initialize the accu with a pattern not equal to zero, or perform a kind of carry look-ahead-technique. All these approaches are described in detail in Kulisch (Computer arithmetic and validity—theory, implementation, and applications. Series: de Gruyter Studies in Mathematics 33, 2008) and Bohlender (Computer arithmetic and self-validating numerical methods, Academic Press, San Diego, 1990). In this paper we propose a long accumulator similar to a carry-save adder. The main idea is to augment the long accumulator with cache information. The cache is used to store the carries or borrows, instead of propagating them through the whole accumulator every time. Due to the cache, operations are kept local in our approach. The full information of the exact result is represented by the accu and the cache. When we want to deliver the result we have to add the contents of the cache into the accumulator. In this paper we present an implementation in software and compare it with other approaches. Furthermore we discuss the advantages of this algorithm for a hardware implementation.},\n added-at = {2012-03-04T10:59:16.000+0100},\n affiliation = {Institute of Computer Science, University of W\\\"urzburg, 97074 W\\\"urzburg, Germany},\n author = {Siegel, Stefan and Wolff von Gudenberg, J\\\"urgen},\n biburl = {http://www.bibsonomy.org/bibtex/2d08a4994b594b6d5f24aec838016f013/info2},\n interhash = {77fc08bc44fdcd1bb684d4d66e36c1b1},\n intrahash = {d08a4994b594b6d5f24aec838016f013},\n issn = {0010-485X},\n issue = {2},\n journal = {Computing},\n keyword = {Informatik},\n keywords = {info2 myown rari},\n note = {10.1007/s00607-011-0164-x},\n pages = {203-213},\n publisher = {Springer Wien},\n timestamp = {2012-03-04T10:59:16.000+0100},\n title = {A long accumulator like a carry-save adder},\n url = {http://dx.doi.org/10.1007/s00607-011-0164-x},\n volume = {94},\n year = {2012},\n}\n\n','\n\nStefan Siegel and Jürgen Wolff von Gudenberg.\nA long accumulator like a carry-save adder.\nComputing, 94:203-213, 2012, Springer Wien.\n10.1007/s00607-011-0164-x.\n[ bib | http | Abstract  ] 
\n@article{siegelScan2010,\nabstract = {Long accumulators for the exact summation of floating point numbers or products are well known tools in numerical analysis especially in algorithms verifying the result (C++ Toolbox for Verified Computing, Springer, New York, 1995). An exact dot product is one of the features of the upcoming interval standard (IEEE Interval Standard Working Group, P1788. http://grouper.ieee.org/groups/1788/). Usually an accumulator is realized as a memory block with operations to add floating point numbers and products. Several variants have been proposed to avoid carry rippling: use separate accumulators for positive and negative numbers, initialize the accu with a pattern not equal to zero, or perform a kind of carry look-ahead-technique. All these approaches are described in detail in Kulisch (Computer arithmetic and validity—theory, implementation, and applications. Series: de Gruyter Studies in Mathematics 33, 2008) and Bohlender (Computer arithmetic and self-validating numerical methods, Academic Press, San Diego, 1990). In this paper we propose a long accumulator similar to a carry-save adder. The main idea is to augment the long accumulator with cache information. The cache is used to store the carries or borrows, instead of propagating them through the whole accumulator every time. Due to the cache, operations are kept local in our approach. The full information of the exact result is represented by the accu and the cache. When we want to deliver the result we have to add the contents of the cache into the accumulator. In this paper we present an implementation in software and compare it with other approaches. Furthermore we discuss the advantages of this algorithm for a hardware implementation.},\nadded-at = {2012-03-04T10:59:16.000+0100},\naffiliation = {Institute of Computer Science, University of W\\\"urzburg, 97074 W\\\"urzburg, Germany},\nauthor = {Siegel, Stefan and Wolff von Gudenberg, J\\\"urgen},\nbiburl = {http://www.bibsonomy.org/bibtex/2d08a4994b594b6d5f24aec838016f013/info2},\ninterhash = {77fc08bc44fdcd1bb684d4d66e36c1b1},\nintrahash = {d08a4994b594b6d5f24aec838016f013},\nissn = {0010-485X},\nissue = {2},\njournal = {Computing},\nkeyword = {Informatik},\nkeywords = {info2 myown rari},\nnote = {10.1007/s00607-011-0164-x},\npages = {203-213},\npublisher = {Springer Wien},\ntimestamp = {2012-03-04T10:59:16.000+0100},\ntitle = {A long accumulator like a carry-save adder},\nurl = {http://dx.doi.org/10.1007/s00607-011-0164-x},\nvolume = {94},\nyear = {2012}\n}\n
\n
\nLong accumulators for the exact summation of floating point numbers or products are well known tools in numerical analysis especially in algorithms verifying the result (C++ Toolbox for Verified Computing, Springer, New York, 1995). An exact dot product is one of the features of the upcoming interval standard (IEEE Interval Standard Working Group, P1788. http://grouper.ieee.org/groups/1788/). Usually an accumulator is realized as a memory block with operations to add floating point numbers and products. Several variants have been proposed to avoid carry rippling: use separate accumulators for positive and negative numbers, initialize the accu with a pattern not equal to zero, or perform a kind of carry look-ahead-technique. All these approaches are described in detail in Kulisch (Computer arithmetic and validity—theory, implementation, and applications. Series: de Gruyter Studies in Mathematics 33, 2008) and Bohlender (Computer arithmetic and self-validating numerical methods, Academic Press, San Diego, 1990). In this paper we propose a long accumulator similar to a carry-save adder. The main idea is to augment the long accumulator with cache information. The cache is used to store the carries or borrows, instead of propagating them through the whole accumulator every time. Due to the cache, operations are kept local in our approach. The full information of the exact result is represented by the accu and the cache. When we want to deliver the result we have to add the contents of the cache into the accumulator. In this paper we present an implementation in software and compare it with other approaches. Furthermore we discuss the advantages of this algorithm for a hardware implementation.\n
\n','
\n@article{siegelScan2010,\n  abstract = {Long accumulators for the exact summation of floating point numbers or products are well known tools in numerical analysis especially in algorithms verifying the result (C++ Toolbox for Verified Computing, Springer, New York, 1995). An exact dot product is one of the features of the upcoming interval standard (IEEE Interval Standard Working Group, P1788. http://grouper.ieee.org/groups/1788/). Usually an accumulator is realized as a memory block with operations to add floating point numbers and products. Several variants have been proposed to avoid carry rippling: use separate accumulators for positive and negative numbers, initialize the accu with a pattern not equal to zero, or perform a kind of carry look-ahead-technique. All these approaches are described in detail in Kulisch (Computer arithmetic and validity—theory, implementation, and applications. Series: de Gruyter Studies in Mathematics 33, 2008) and Bohlender (Computer arithmetic and self-validating numerical methods, Academic Press, San Diego, 1990). In this paper we propose a long accumulator similar to a carry-save adder. The main idea is to augment the long accumulator with cache information. The cache is used to store the carries or borrows, instead of propagating them through the whole accumulator every time. Due to the cache, operations are kept local in our approach. The full information of the exact result is represented by the accu and the cache. When we want to deliver the result we have to add the contents of the cache into the accumulator. In this paper we present an implementation in software and compare it with other approaches. Furthermore we discuss the advantages of this algorithm for a hardware implementation.},\n  added-at = {2012-03-04T10:59:16.000+0100},\n  affiliation = {Institute of Computer Science, University of W\\\"urzburg, 97074 W\\\"urzburg, Germany},\n  author = {Siegel, Stefan and Wolff von Gudenberg, J\\\"urgen},\n  biburl = {http://www.bibsonomy.org/bibtex/2d08a4994b594b6d5f24aec838016f013/info2},\n  interhash = {77fc08bc44fdcd1bb684d4d66e36c1b1},\n  intrahash = {d08a4994b594b6d5f24aec838016f013},\n  issn = {0010-485X},\n  issue = {2},\n  journal = {Computing},\n  keyword = {Informatik},\n  keywords = {info2 myown rari},\n  note = {10.1007/s00607-011-0164-x},\n  pages = {203-213},\n  publisher = {Springer Wien},\n  timestamp = {2012-03-04T10:59:16.000+0100},\n  title = {A long accumulator like a carry-save adder},\n  url = {http://dx.doi.org/10.1007/s00607-011-0164-x},\n  volume = {94},\n  year = {2012}\n}\n
\n\n','Long accumulators for the exact summation of floating point numbers or products are well known tools in numerical analysis especially in algorithms verifying the result (C++ Toolbox for Verified Computing, Springer, New York, 1995). An exact dot product is one of the features of the upcoming interval standard (IEEE Interval Standard Working Group, P1788. http://grouper.ieee.org/groups/1788/). Usually an accumulator is realized as a memory block with operations to add floating point numbers and products. Several variants have been proposed to avoid carry rippling: use separate accumulators for positive and negative numbers, initialize the accu with a pattern not equal to zero, or perform a kind of carry look-ahead-technique. All these approaches are described in detail in Kulisch (Computer arithmetic and validity—theory, implementation, and applications. Series: de Gruyter Studies in Mathematics 33, 2008) and Bohlender (Computer arithmetic and self-validating numerical methods, Academic Press, San Diego, 1990). In this paper we propose a long accumulator similar to a carry-save adder. The main idea is to augment the long accumulator with cache information. The cache is used to store the carries or borrows, instead of propagating them through the whole accumulator every time. Due to the cache, operations are kept local in our approach. The full information of the exact result is represented by the accu and the cache. When we want to deliver the result we have to add the contents of the cache into the accumulator. In this paper we present an implementation in software and compare it with other approaches. Furthermore we discuss the advantages of this algorithm for a hardware implementation.','A long accumulator like a carry-save adder',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(740,'paper','iaHardwareScan2010','article','@article{iaHardwareScan2010,\n abstract = {Interval arithmetic, as it is standardized by the IEEE working group P1788 can be implemented by using floating point arithmetic units with directed rounding modes. The easiest way to represent an interval is by its two bounds. Simple formulas for the arithmetic operations can be applied. Our goal is to perform interval operations as fast as their floating point counterparts. Hence, we provide at least two units per operation. We also specify the operation for reverse multiplication (Neumaier in Vienna proposal for interval standardization, 2008) which can be implemented with the division unit. In this paper we do not care about optimization. Our primary intention is to give an easily understandable specification of hardware for interval arithmetic.},\n year = {2012},\n issn = {0010-485X},\n journal = {Computing},\n volume = {94},\n number = {2-4},\n doi = {10.1007/s00607-012-0185-0},\n title = {Specification of hardware for interval arithmetic},\n url = {http://dx.doi.org/10.1007/s00607-012-0185-0},\n publisher = {Springer Vienna},\n keywords = {Interval arithmetic; Hardware design; Interval standardization; 68-04; 94C99},\n author = {Nehmeier, Marco and Siegel, Stefan and Wolff von Gudenberg, J\\\"urgen},\n pages = {243-255},\n language = {English},\n}\n\n','\n\nMarco Nehmeier, Stefan Siegel, and Jürgen Wolff von Gudenberg.\nSpecification of hardware for interval arithmetic.\nComputing, 94(2-4):243-255, 2012, Springer Vienna.\n[ bib | DOI | http | Abstract  ] 
\n@article{iaHardwareScan2010,\nabstract = {Interval arithmetic, as it is standardized by the IEEE working group P1788 can be implemented by using floating point arithmetic units with directed rounding modes. The easiest way to represent an interval is by its two bounds. Simple formulas for the arithmetic operations can be applied. Our goal is to perform interval operations as fast as their floating point counterparts. Hence, we provide at least two units per operation. We also specify the operation for reverse multiplication (Neumaier in Vienna proposal for interval standardization, 2008) which can be implemented with the division unit. In this paper we do not care about optimization. Our primary intention is to give an easily understandable specification of hardware for interval arithmetic.},\nyear = {2012},\nissn = {0010-485X},\njournal = {Computing},\nvolume = {94},\nnumber = {2-4},\ndoi = {10.1007/s00607-012-0185-0},\ntitle = {Specification of hardware for interval arithmetic},\nurl = {http://dx.doi.org/10.1007/s00607-012-0185-0},\npublisher = {Springer Vienna},\nkeywords = {Interval arithmetic; Hardware design; Interval standardization; 68-04; 94C99},\nauthor = {Nehmeier, Marco and Siegel, Stefan and Wolff von Gudenberg, J\\\"urgen},\npages = {243-255},\nlanguage = {English}\n}\n
\n
\nInterval arithmetic, as it is standardized by the IEEE working group P1788 can be implemented by using floating point arithmetic units with directed rounding modes. The easiest way to represent an interval is by its two bounds. Simple formulas for the arithmetic operations can be applied. Our goal is to perform interval operations as fast as their floating point counterparts. Hence, we provide at least two units per operation. We also specify the operation for reverse multiplication (Neumaier in Vienna proposal for interval standardization, 2008) which can be implemented with the division unit. In this paper we do not care about optimization. Our primary intention is to give an easily understandable specification of hardware for interval arithmetic.\n
\n','
\n@article{iaHardwareScan2010,\n  abstract = {Interval arithmetic, as it is standardized by the IEEE working group P1788 can be implemented by using floating point arithmetic units with directed rounding modes. The easiest way to represent an interval is by its two bounds. Simple formulas for the arithmetic operations can be applied. Our goal is to perform interval operations as fast as their floating point counterparts. Hence, we provide at least two units per operation. We also specify the operation for reverse multiplication (Neumaier in Vienna proposal for interval standardization, 2008) which can be implemented with the division unit. In this paper we do not care about optimization. Our primary intention is to give an easily understandable specification of hardware for interval arithmetic.},\n  year = {2012},\n  issn = {0010-485X},\n  journal = {Computing},\n  volume = {94},\n  number = {2-4},\n  doi = {10.1007/s00607-012-0185-0},\n  title = {Specification of hardware for interval arithmetic},\n  url = {http://dx.doi.org/10.1007/s00607-012-0185-0},\n  publisher = {Springer Vienna},\n  keywords = {Interval arithmetic; Hardware design; Interval standardization; 68-04; 94C99},\n  author = {Nehmeier, Marco and Siegel, Stefan and Wolff von Gudenberg, J\\\"urgen},\n  pages = {243-255},\n  language = {English}\n}\n
\n\n','Interval arithmetic, as it is standardized by the IEEE working group P1788 can be implemented by using floating point arithmetic units with directed rounding modes. The easiest way to represent an interval is by its two bounds. Simple formulas for the arithmetic operations can be applied. Our goal is to perform interval operations as fast as their floating point counterparts. Hence, we provide at least two units per operation. We also specify the operation for reverse multiplication (Neumaier in Vienna proposal for interval standardization, 2008) which can be implemented with the division unit. In this paper we do not care about optimization. Our primary intention is to give an easily understandable specification of hardware for interval arithmetic.','Specification of hardware for interval arithmetic',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(741,'paper','tischlerScan08','article','@article{tischlerScan08,\n added-at = {2012-02-24T16:55:57.000+0100},\n author = {Tischler, German and Wolff von Gudenberg, J\\\"urgen},\n biburl = {http://www.bibsonomy.org/bibtex/214dcb975d4a421928dfa30e82e271f80/info2},\n interhash = {7de13a747748527178e9a9e83a38f4f1},\n intrahash = {14dcb975d4a421928dfa30e82e271f80},\n journal = {Reliable Computing},\n keywords = {info2 myown rari},\n month = {},\n number = {3},\n pages = {279--289},\n timestamp = {2012-02-24T16:55:57.000+0100},\n title = {Solving Decidability Problems with Interval Arithmetic},\n url = {http://interval.louisiana.edu/reliable-computing-journal/volume-15/no-3/reliable-computing-15-pp-279-289.pdf},\n volume = {15},\n year = {2011},\n}\n\n','\n\nGerman Tischler and Jürgen Wolff von Gudenberg.\nSolving decidability problems with interval arithmetic.\nReliable Computing, 15(3):279-289, 2011.\n[ bib | .pdf  ] 
\n@article{tischlerScan08,\nadded-at = {2012-02-24T16:55:57.000+0100},\nauthor = {Tischler, German and Wolff von Gudenberg, J\\\"urgen},\nbiburl = {http://www.bibsonomy.org/bibtex/214dcb975d4a421928dfa30e82e271f80/info2},\ninterhash = {7de13a747748527178e9a9e83a38f4f1},\nintrahash = {14dcb975d4a421928dfa30e82e271f80},\njournal = {Reliable Computing},\nkeywords = {info2 myown rari},\nmonth = {},\nnumber = {3},\npages = {279--289},\ntimestamp = {2012-02-24T16:55:57.000+0100},\ntitle = {Solving Decidability Problems with Interval Arithmetic},\nurl = {http://interval.louisiana.edu/reliable-computing-journal/volume-15/no-3/reliable-computing-15-pp-279-289.pdf},\nvolume = {15},\nyear = {2011}\n}\n
\n
\n','
\n@article{tischlerScan08,\n  added-at = {2012-02-24T16:55:57.000+0100},\n  author = {Tischler, German and Wolff von Gudenberg, J\\\"urgen},\n  biburl = {http://www.bibsonomy.org/bibtex/214dcb975d4a421928dfa30e82e271f80/info2},\n  interhash = {7de13a747748527178e9a9e83a38f4f1},\n  intrahash = {14dcb975d4a421928dfa30e82e271f80},\n  journal = {Reliable Computing},\n  keywords = {info2 myown rari},\n  month = {},\n  number = {3},\n  pages = {279--289},\n  timestamp = {2012-02-24T16:55:57.000+0100},\n  title = {Solving Decidability Problems with Interval Arithmetic},\n  url = {http://interval.louisiana.edu/reliable-computing-journal/volume-15/no-3/reliable-computing-15-pp-279-289.pdf},\n  volume = {15},\n  year = {2011}\n}\n
\n\n',NULL,'Solving Decidability Problems with Interval Arithmetic',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(742,'paper','nehmeierPara2010','incollection','@incollection{nehmeierPara2010,\n abstract = {In this paper we define the interval overlapping relation and develop a parallel hardware unit for its realization. As one application we consider the interval comparisons. It is shown that a detailed classification of the interval overlapping relation leads to a reduction of floating-point comparisons in common applications.},\n year = {2012},\n isbn = {978-3-642-28144-0},\n booktitle = {Applied Parallel and Scientific Computing},\n volume = {7134},\n series = {Lecture Notes in Computer Science},\n editor = {J\\\"onasson, Kristj\\\"an},\n doi = {10.1007/978-3-642-28145-7_13},\n title = {{P}arallel {D}etection of {I}nterval {O}verlapping},\n url = {http://dx.doi.org/10.1007/978-3-642-28145-7_13},\n publisher = {Springer Berlin Heidelberg},\n keywords = {interval arithmetic; interval relations; hardware unit},\n author = {Nehmeier, Marco and Siegel, Stefan and Wolff von Gudenberg, J\\\"urgen},\n pages = {127-136},\n language = {English},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/742.pdf},\n}\n\n','\n\nMarco Nehmeier, Stefan Siegel, and Jürgen Wolff von Gudenberg.\nParallel Detection of Interval Overlapping.\nIn Applied Parallel and Scientific Computing, Kristjän\nJönasson, editor, volume 7134 of Lecture Notes in Computer Science,\npages 127-136. Springer Berlin Heidelberg, 2012.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@incollection{nehmeierPara2010,\nabstract = {In this paper we define the interval overlapping relation and develop a parallel hardware unit for its realization. As one application we consider the interval comparisons. It is shown that a detailed classification of the interval overlapping relation leads to a reduction of floating-point comparisons in common applications.},\nyear = {2012},\nisbn = {978-3-642-28144-0},\nbooktitle = {Applied Parallel and Scientific Computing},\nvolume = {7134},\nseries = {Lecture Notes in Computer Science},\neditor = {J\\\"onasson, Kristj\\\"an},\ndoi = {10.1007/978-3-642-28145-7_13},\ntitle = {{P}arallel {D}etection of {I}nterval {O}verlapping},\nurl = {http://dx.doi.org/10.1007/978-3-642-28145-7_13},\npublisher = {Springer Berlin Heidelberg},\nkeywords = {interval arithmetic; interval relations; hardware unit},\nauthor = {Nehmeier, Marco and Siegel, Stefan and Wolff von Gudenberg, J\\\"urgen},\npages = {127-136},\nlanguage = {English},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/742.pdf}\n}\n
\n
\nIn this paper we define the interval overlapping relation and develop a parallel hardware unit for its realization. As one application we consider the interval comparisons. It is shown that a detailed classification of the interval overlapping relation leads to a reduction of floating-point comparisons in common applications.\n
\n','
\n@incollection{nehmeierPara2010,\n  abstract = {In this paper we define the interval overlapping relation and develop a parallel hardware unit for its realization. As one application we consider the interval comparisons. It is shown that a detailed classification of the interval overlapping relation leads to a reduction of floating-point comparisons in common applications.},\n  year = {2012},\n  isbn = {978-3-642-28144-0},\n  booktitle = {Applied Parallel and Scientific Computing},\n  volume = {7134},\n  series = {Lecture Notes in Computer Science},\n  editor = {J\\\"onasson, Kristj\\\"an},\n  doi = {10.1007/978-3-642-28145-7_13},\n  title = {{P}arallel {D}etection of {I}nterval {O}verlapping},\n  url = {http://dx.doi.org/10.1007/978-3-642-28145-7_13},\n  publisher = {Springer Berlin Heidelberg},\n  keywords = {interval arithmetic; interval relations; hardware unit},\n  author = {Nehmeier, Marco and Siegel, Stefan and Wolff von Gudenberg, J\\\"urgen},\n  pages = {127-136},\n  language = {English},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/742.pdf}\n}\n
\n\n','In this paper we define the interval overlapping relation and develop a parallel hardware unit for its realization. As one application we consider the interval comparisons. It is shown that a detailed classification of the interval overlapping relation leads to a reduction of floating-point comparisons in common applications.','{P}arallel {D}etection of {I}nterval {O}verlapping',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(743,'paper','nehmeierWconSC2011','inproceedings','@inproceedings{nehmeierWconSC2011,\n abstract = {The interval overlapping relation defines 13 different states of the relative position of two intervals. In this paper we show that this relation can be used to define the interval comparisons and lattice operations. The shift from a boolean (binary) comparison to a comprehensive relation (13 different states) enables the user to exploit involved dependencies. We further introduce an object oriented abstract datatype to provide a userfriendly interface.},\n address = {San Francisco, CA, USA},\n author = {Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\n booktitle = {Proceedings of the World Conference on Soft Computing 2011 (WConSC\'11)},\n month = {},\n title = {{I}nterval {C}omparisons and {L}attice {O}perations based on the {I}nterval {O}verlapping {R}elation},\n url = {http://wwwi2.informatik.uni-wuerzburg.de/publications/paperNehmeierWConSC11.pdf},\n year = {2011},\n}\n\n','\n\nMarco Nehmeier and Jürgen Wolff von Gudenberg.\nInterval Comparisons and Lattice Operations based on the\nInterval Overlapping Relation.\nIn Proceedings of the World Conference on Soft Computing 2011\n(WConSC\'11), 2011. San Francisco, CA, USA.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{nehmeierWconSC2011,\nabstract = {The interval overlapping relation defines 13 different states of the relative position of two intervals. In this paper we show that this relation can be used to define the interval comparisons and lattice operations. The shift from a boolean (binary) comparison to a comprehensive relation (13 different states) enables the user to exploit involved dependencies. We further introduce an object oriented abstract datatype to provide a userfriendly interface.},\naddress = {San Francisco, CA, USA},\nauthor = {Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\nbooktitle = {Proceedings of the World Conference on Soft Computing 2011 (WConSC\'11)},\nmonth = {},\ntitle = {{I}nterval {C}omparisons and {L}attice {O}perations based on the {I}nterval {O}verlapping {R}elation},\nurl = {http://wwwi2.informatik.uni-wuerzburg.de/publications/paperNehmeierWConSC11.pdf},\nyear = {2011}\n}\n
\n
\nThe interval overlapping relation defines 13 different states of the relative position of two intervals. In this paper we show that this relation can be used to define the interval comparisons and lattice operations. The shift from a boolean (binary) comparison to a comprehensive relation (13 different states) enables the user to exploit involved dependencies. We further introduce an object oriented abstract datatype to provide a userfriendly interface.\n
\n','
\n@inproceedings{nehmeierWconSC2011,\n  abstract = {The interval overlapping relation defines 13 different states of the relative position of two intervals. In this paper we show that this relation can be used to define the interval comparisons and lattice operations. The shift from a boolean (binary) comparison to a comprehensive relation (13 different states) enables the user to exploit involved dependencies. We further introduce an object oriented abstract datatype to provide a userfriendly interface.},\n  address = {San Francisco, CA, USA},\n  author = {Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\n  booktitle = {Proceedings of the World Conference on Soft Computing 2011 (WConSC\'11)},\n  month = {},\n  title = {{I}nterval {C}omparisons and {L}attice {O}perations based on the {I}nterval {O}verlapping {R}elation},\n  url = {http://wwwi2.informatik.uni-wuerzburg.de/publications/paperNehmeierWConSC11.pdf},\n  year = {2011}\n}\n
\n\n','The interval overlapping relation defines 13 different states of the relative position of two intervals. In this paper we show that this relation can be used to define the interval comparisons and lattice operations. The shift from a boolean (binary) comparison to a comprehensive relation (13 different states) enables the user to exploit involved dependencies. We further introduce an object oriented abstract datatype to provide a userfriendly interface.','{I}nterval {C}omparisons and {L}attice {O}perations based on the {I}nterval {O}verlapping {R}elation',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(744,'paper','nehmeierSCAN2008','article','@article{nehmeierSCAN2008,\n abstract = {In this paper we investigate how a C++ class library can be improved by the concept of expression templates. Our first result is a saving of rounding mode switches which considerably increases the performance. Our second result deals with handling the discontinuity flag that will probably be decided to be raised whenever a function is called outside its domain (loose evaluation). We discuss several alternatives and propose an expression related flag that can be used in a thread safe manner. Both results are reviewed with respect to the coming IEEE standard for interval arithmetic.},\n author = {Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\n journal = {Reliable Computing},\n month = {},\n number = {4},\n pages = {312--320},\n title = {filib++, {E}xpression {T}emplates and the {C}oming {I}nterval {S}tandard},\n url = {http://interval.louisiana.edu/reliable-computing-journal/volume-15/no-4/reliable-computing-15-pp-312-320.pdf},\n volume = {15},\n year = {2011},\n}\n\n','\n\nMarco Nehmeier and Jürgen Wolff von Gudenberg.\nfilib++, Expression Templates and the Coming Interval\nStandard.\nReliable Computing, 15(4):312-320, 2011.\n[ bib | .pdf | Abstract  ] 
\n@article{nehmeierSCAN2008,\nabstract = {In this paper we investigate how a C++ class library can be improved by the concept of expression templates. Our first result is a saving of rounding mode switches which considerably increases the performance. Our second result deals with handling the discontinuity flag that will probably be decided to be raised whenever a function is called outside its domain (loose evaluation). We discuss several alternatives and propose an expression related flag that can be used in a thread safe manner. Both results are reviewed with respect to the coming IEEE standard for interval arithmetic.},\nauthor = {Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\njournal = {Reliable Computing},\nmonth = {},\nnumber = {4},\npages = {312--320},\ntitle = {filib++, {E}xpression {T}emplates and the {C}oming {I}nterval {S}tandard},\nurl = {http://interval.louisiana.edu/reliable-computing-journal/volume-15/no-4/reliable-computing-15-pp-312-320.pdf},\nvolume = {15},\nyear = {2011}\n}\n
\n
\nIn this paper we investigate how a C++ class library can be improved by the concept of expression templates. Our first result is a saving of rounding mode switches which considerably increases the performance. Our second result deals with handling the discontinuity flag that will probably be decided to be raised whenever a function is called outside its domain (loose evaluation). We discuss several alternatives and propose an expression related flag that can be used in a thread safe manner. Both results are reviewed with respect to the coming IEEE standard for interval arithmetic.\n
\n','
\n@article{nehmeierSCAN2008,\n  abstract = {In this paper we investigate how a C++ class library can be improved by the concept of expression templates. Our first result is a saving of rounding mode switches which considerably increases the performance. Our second result deals with handling the discontinuity flag that will probably be decided to be raised whenever a function is called outside its domain (loose evaluation). We discuss several alternatives and propose an expression related flag that can be used in a thread safe manner. Both results are reviewed with respect to the coming IEEE standard for interval arithmetic.},\n  author = {Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\n  journal = {Reliable Computing},\n  month = {},\n  number = {4},\n  pages = {312--320},\n  title = {filib++, {E}xpression {T}emplates and the {C}oming {I}nterval {S}tandard},\n  url = {http://interval.louisiana.edu/reliable-computing-journal/volume-15/no-4/reliable-computing-15-pp-312-320.pdf},\n  volume = {15},\n  year = {2011}\n}\n
\n\n','In this paper we investigate how a C++ class library can be improved by the concept of expression templates. Our first result is a saving of rounding mode switches which considerably increases the performance. Our second result deals with handling the discontinuity flag that will probably be decided to be raised whenever a function is called outside its domain (loose evaluation). We discuss several alternatives and propose an expression related flag that can be used in a thread safe manner. Both results are reviewed with respect to the coming IEEE standard for interval arithmetic.','filib++, {E}xpression {T}emplates and the {C}oming {I}nterval {S}tandard',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(745,'paper','NoRoKoRe2014-MASCOTS-IOQPNs','inproceedings','@inproceedings{NoRoKoRe2014-MASCOTS-IOQPNs,\n author = {Qais Noorshams and Kiana Rostami and Samuel Kounev and Ralf Reussner},\n booktitle = {Proceedings of the IEEE 22nd International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems},\n series = {MASCOTS 2014},\n day = {09--11},\n location = {France, Paris},\n title = {{Modeling of I/O Performance Interference in Virtualized Environments with Queueing Petri Nets}},\n titleaddon = {{(Short Paper)}},\n year = {2014},\n month = {{September}},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/745.pdf},\n}\n\n','\n\nQais Noorshams, Kiana Rostami, Samuel Kounev, and Ralf Reussner.\nModeling of I/O Performance Interference in Virtualized Environments\nwith Queueing Petri Nets (Short Paper).\nIn Proceedings of the IEEE 22nd International Symposium on\nModeling, Analysis and Simulation of Computer and Telecommunication Systems,\nFrance, Paris, September 09-11, 2014, MASCOTS 2014.\n[ bib | .pdf  ] 
\n@inproceedings{NoRoKoRe2014-MASCOTS-IOQPNs,\nauthor = {Qais Noorshams and Kiana Rostami and Samuel Kounev and Ralf Reussner},\nbooktitle = {Proceedings of the IEEE 22nd International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems},\nseries = {MASCOTS 2014},\nday = {09--11},\nlocation = {France, Paris},\ntitle = {{Modeling of I/O Performance Interference in Virtualized Environments with Queueing Petri Nets}},\ntitleaddon = {{(Short Paper)}},\nyear = {2014},\nmonth = {{September}},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/745.pdf}\n}\n
\n
\n','
\n@inproceedings{NoRoKoRe2014-MASCOTS-IOQPNs,\n  author = {Qais Noorshams and Kiana Rostami and Samuel Kounev and Ralf Reussner},\n  booktitle = {Proceedings of the IEEE 22nd International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems},\n  series = {MASCOTS 2014},\n  day = {09--11},\n  location = {France, Paris},\n  title = {{Modeling of I/O Performance Interference in Virtualized Environments with Queueing Petri Nets}},\n  titleaddon = {{(Short Paper)}},\n  year = {2014},\n  month = {{September}},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/745.pdf}\n}\n
\n\n',NULL,'{Modeling of I/O Performance Interference in Virtualized Environments with Queueing Petri Nets}',0,9,2014,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(746,'paper','SpKoZhLuUyHoGr2014-SASO','inproceedings','@inproceedings{SpKoZhLuUyHoGr2014-SASO,\n author = {Spinner, Simon and Kounev, Samuel and Zhu, Xiaoyun and Lu, Lei and Uysal, Mustafa and Holler, Anne and Griffith, Rean},\n title = {{Runtime Vertical Scaling of Virtualized Applications via Online Model Estimation}},\n booktitle = {Proceedings of the 2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems (SASO)},\n location = {London, UK},\n organizer = {IEEE},\n day = {8--12},\n month = {September},\n year = {2014},\n publisher = {IEEE},\n pages = {157--166},\n doi = {10.1109/SASO.2014.29},\n note = {Acceptance Rate (Full Papers): 26%},\n abstract = {Applications in virtualized data centers are often subject to Service Level Objectives (SLOs) regarding their performance (e.g., latency or throughput). In order to fulfill these SLOs, it is necessary to allocate sufficient resources of different types (CPU, memory, I/O, etc.) to an application. However, the relationship between the application performance and the resource allocations is complex and depends on multiple factors including application architecture, system configuration, and workload demands. In this paper, we present a model-based approach to ensure that the application performance meets the user-defined SLO efficiently by runtime \"vertical scaling\" (i.e., adding or removing resources) of individual virtual machines (VMs) running the application. A layered performance model describing the relationship between the resource allocations and the observed application performance is automatically extracted and updated online using resource demand estimation techniques. Such a model is then used in a feedback controller to dynamically adapt the number of virtual CPUs of individual VMs. We have implemented the controller on top of the VMware vSphere platform and evaluated it in a case study using a real-world email and groupware server. The experimental results show that our approach allows the managed application to achieve SLO satisfaction in spite of workload demand variation while avoiding oscillations commonly observed with state-of-the-art threshold-based controllers.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/746.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/746},\n}\n\n','\n\nSimon Spinner, Samuel Kounev, Xiaoyun Zhu, Lei Lu, Mustafa Uysal, Anne Holler,\nand Rean Griffith.\nRuntime Vertical Scaling of Virtualized Applications via Online\nModel Estimation.\nIn Proceedings of the 2014 IEEE Eighth International Conference\non Self-Adaptive and Self-Organizing Systems (SASO), London, UK, September\n8-12, 2014, pages 157-166. IEEE.\nSeptember 2014, Acceptance Rate (Full Papers): 26%.\n[ bib | DOI | slides | .pdf | Abstract  ] 
\n@inproceedings{SpKoZhLuUyHoGr2014-SASO,\nauthor = {Spinner, Simon and Kounev, Samuel and Zhu, Xiaoyun and Lu, Lei and Uysal, Mustafa and Holler, Anne and Griffith, Rean},\ntitle = {{Runtime Vertical Scaling of Virtualized Applications via Online Model Estimation}},\nbooktitle = {Proceedings of the 2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems (SASO)},\nlocation = {London, UK},\norganizer = {IEEE},\nday = {8--12},\nmonth = {September},\nyear = {2014},\npublisher = {IEEE},\npages = {157--166},\ndoi = {10.1109/SASO.2014.29},\nnote = {Acceptance Rate (Full Papers): 26%},\nabstract = {Applications in virtualized data centers are often subject to Service Level Objectives (SLOs) regarding their performance (e.g., latency or throughput). In order to fulfill these SLOs, it is necessary to allocate sufficient resources of different types (CPU, memory, I/O, etc.) to an application. However, the relationship between the application performance and the resource allocations is complex and depends on multiple factors including application architecture, system configuration, and workload demands. In this paper, we present a model-based approach to ensure that the application performance meets the user-defined SLO efficiently by runtime \"vertical scaling\" (i.e., adding or removing resources) of individual virtual machines (VMs) running the application. A layered performance model describing the relationship between the resource allocations and the observed application performance is automatically extracted and updated online using resource demand estimation techniques. Such a model is then used in a feedback controller to dynamically adapt the number of virtual CPUs of individual VMs. We have implemented the controller on top of the VMware vSphere platform and evaluated it in a case study using a real-world email and groupware server. The experimental results show that our approach allows the managed application to achieve SLO satisfaction in spite of workload demand variation while avoiding oscillations commonly observed with state-of-the-art threshold-based controllers.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/746.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/746}\n}\n
\n
\nApplications in virtualized data centers are often subject to Service Level Objectives (SLOs) regarding their performance (e.g., latency or throughput). In order to fulfill these SLOs, it is necessary to allocate sufficient resources of different types (CPU, memory, I/O, etc.) to an application. However, the relationship between the application performance and the resource allocations is complex and depends on multiple factors including application architecture, system configuration, and workload demands. In this paper, we present a model-based approach to ensure that the application performance meets the user-defined SLO efficiently by runtime \"vertical scaling\" (i.e., adding or removing resources) of individual virtual machines (VMs) running the application. A layered performance model describing the relationship between the resource allocations and the observed application performance is automatically extracted and updated online using resource demand estimation techniques. Such a model is then used in a feedback controller to dynamically adapt the number of virtual CPUs of individual VMs. We have implemented the controller on top of the VMware vSphere platform and evaluated it in a case study using a real-world email and groupware server. The experimental results show that our approach allows the managed application to achieve SLO satisfaction in spite of workload demand variation while avoiding oscillations commonly observed with state-of-the-art threshold-based controllers.\n
\n','
\n@inproceedings{SpKoZhLuUyHoGr2014-SASO,\n  author = {Spinner, Simon and Kounev, Samuel and Zhu, Xiaoyun and Lu, Lei and Uysal, Mustafa and Holler, Anne and Griffith, Rean},\n  title = {{Runtime Vertical Scaling of Virtualized Applications via Online Model Estimation}},\n  booktitle = {Proceedings of the 2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems (SASO)},\n  location = {London, UK},\n  organizer = {IEEE},\n  day = {8--12},\n  month = {September},\n  year = {2014},\n  publisher = {IEEE},\n  pages = {157--166},\n  doi = {10.1109/SASO.2014.29},\n  note = {Acceptance Rate (Full Papers): 26%},\n  abstract = {Applications in virtualized data centers are often subject to Service Level Objectives (SLOs) regarding their performance (e.g., latency or throughput). In order to fulfill these SLOs, it is necessary to allocate sufficient resources of different types (CPU, memory, I/O, etc.) to an application. However, the relationship between the application performance and the resource allocations is complex and depends on multiple factors including application architecture, system configuration, and workload demands. In this paper, we present a model-based approach to ensure that the application performance meets the user-defined SLO efficiently by runtime \"vertical scaling\" (i.e., adding or removing resources) of individual virtual machines (VMs) running the application. A layered performance model describing the relationship between the resource allocations and the observed application performance is automatically extracted and updated online using resource demand estimation techniques. Such a model is then used in a feedback controller to dynamically adapt the number of virtual CPUs of individual VMs. We have implemented the controller on top of the VMware vSphere platform and evaluated it in a case study using a real-world email and groupware server. The experimental results show that our approach allows the managed application to achieve SLO satisfaction in spite of workload demand variation while avoiding oscillations commonly observed with state-of-the-art threshold-based controllers.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/746.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/746}\n}\n
\n\n','Applications in virtualized data centers are often subject to Service Level Objectives (SLOs) regarding their performance (e.g., latency or throughput). In order to fulfill these SLOs, it is necessary to allocate sufficient resources of different types (CPU, memory, I/O, etc.) to an application. However, the relationship between the application performance and the resource allocations is complex and depends on multiple factors including application architecture, system configuration, and workload demands. In this paper, we present a model-based approach to ensure that the application performance meets the user-defined SLO efficiently by runtime \"vertical scaling\" (i.e., adding or removing resources) of individual virtual machines (VMs) running the application. A layered performance model describing the relationship between the resource allocations and the observed application performance is automatically extracted and updated online using resource demand estimation techniques. Such a model is then used in a feedback controller to dynamically adapt the number of virtual CPUs of individual VMs. We have implemented the controller on top of the VMware vSphere platform and evaluated it in a case study using a real-world email and groupware server. The experimental results show that our approach allows the managed application to achieve SLO satisfaction in spite of workload demand variation while avoiding oscillations commonly observed with state-of-the-art threshold-based controllers.','{Runtime Vertical Scaling of Virtualized Applications via Online Model Estimation}',0,9,2014,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(747,'paper','Ko2014-QEST-Keynote','inproceedings','@inproceedings{Ko2014-QEST-Keynote,\n author = {Samuel Kounev},\n title = {{Quantitative Evaluation of Service Dependability in Shared Execution Environments (Extended Abstract of Keynote Talk)}},\n year = {2014},\n month = {{September}},\n day = {8--12},\n booktitle = {Proceedings of the 11th International Conference on Quantitative Evaluation of SysTems (QEST 2014), Florence, Italy},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/747.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/747},\n}\n\n','\n\nSamuel Kounev.\nQuantitative Evaluation of Service Dependability in Shared Execution\nEnvironments (Extended Abstract of Keynote Talk).\nIn Proceedings of the 11th International Conference on\nQuantitative Evaluation of SysTems (QEST 2014), Florence, Italy, September\n8-12, 2014.\n[ bib | slides | .pdf  ] 
\n@inproceedings{Ko2014-QEST-Keynote,\nauthor = {Samuel Kounev},\ntitle = {{Quantitative Evaluation of Service Dependability in Shared Execution Environments (Extended Abstract of Keynote Talk)}},\nyear = {2014},\nmonth = {{September}},\nday = {8--12},\nbooktitle = {Proceedings of the 11th International Conference on Quantitative Evaluation of SysTems (QEST 2014), Florence, Italy},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/747.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/747}\n}\n
\n
\n','
\n@inproceedings{Ko2014-QEST-Keynote,\n  author = {Samuel Kounev},\n  title = {{Quantitative Evaluation of Service Dependability in Shared Execution Environments (Extended Abstract of Keynote Talk)}},\n  year = {2014},\n  month = {{September}},\n  day = {8--12},\n  booktitle = {Proceedings of the 11th International Conference on Quantitative Evaluation of SysTems (QEST 2014), Florence, Italy},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/747.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/747}\n}\n
\n\n',NULL,'{Quantitative Evaluation of Service Dependability in Shared Execution Environments (Extended Abstract of Keynote Talk)}',0,9,2014,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(748,'paper','Kistowski2011a','mastersthesis','@mastersthesis{Kistowski2011a,\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n author = {J\\\'{o}akim von Kistowski},\n keywords = {Cloud, Resource Elasticity},\n school = {{Karlsruhe Institute of Technology (KIT)}},\n title = {{Defining and Measuring Workloads for Elasticity Benchmarking}},\n type = {{Bachelor Thesis}},\n year = {2011},\n}\n\n','\n\nJóakim von Kistowski.\nDefining and Measuring Workloads for Elasticity Benchmarking.\nBachelor Thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, 2011.\n[ bib  ] 
\n@mastersthesis{Kistowski2011a,\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nauthor = {J\\\'{o}akim von Kistowski},\nkeywords = {Cloud, Resource Elasticity},\nschool = {{Karlsruhe Institute of Technology (KIT)}},\ntitle = {{Defining and Measuring Workloads for Elasticity Benchmarking}},\ntype = {{Bachelor Thesis}},\nyear = {2011}\n}\n
\n
\n','
\n@mastersthesis{Kistowski2011a,\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  author = {J\\\'{o}akim von Kistowski},\n  keywords = {Cloud, Resource Elasticity},\n  school = {{Karlsruhe Institute of Technology (KIT)}},\n  title = {{Defining and Measuring Workloads for Elasticity Benchmarking}},\n  type = {{Bachelor Thesis}},\n  year = {2011}\n}\n
\n\n',NULL,'{Defining and Measuring Workloads for Elasticity Benchmarking}',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(749,'paper','Kistowski2014','mastersthesis','@mastersthesis{Kistowski2014,\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n abstract = {{Today\'s software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. Based on this observation, I identify the need for means allowing flexible definition of load profiles and address this by introducing two meta-models at different abstraction levels. At the lower abstraction level, the Descartes Load Intensity Meta-Model (DLIM) offers a structured and accessible way of describing the load intensity over time by editing and combining mathematical functions. The high-level Descartes Load Intensity Meta-Model (hl-DLIM) allows the description of load variations using few defined parameters that characterize the seasonal patterns, trends, bursts, and noise parts. Using these parameters, hl-DLIM is capable of describing a subset of most common load intensity variations. During the work on this thesis I developed LIMBO - an Eclipse-based tool for modeling variable load intensity profiles based on DLIM and hl-DLIM as underlying modeling formalisms. LIMBO provides visualization for DLIM instances and a model creation wizard based on hl-DLIM parameters. It also offers three automated model extraction processes with which to extract DLIM and hl-DLIM instances from existing arrival rate traces. It also offers a model-to-model transformation from hl-DLIM to DLIM. I demonstrate that both meta-models are capable of capturing real-world load profiles with acceptable accuracy, having an average median deviation of 19.9\\% from the original trace. This is done by comparing nine different real life traces, which were measured over duration of two weeks to seven months, to their respective model instances as extracted by the automated model extraction processes. I also evaluate the usability and accessibility of LIMBO based on a questionnaire which was answered by eight computer scientists from five different organizations within the performance engineering community.}},\n author = {J\\\'{o}akim von Kistowski},\n keywords = {Load Intensity, Model},\n school = {{Karlsruhe Institute of Technology (KIT)}},\n title = {{Modeling Variations in Load Intensity Profiles}},\n type = {{Master Thesis}},\n year = {2014},\n month = {March},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/749.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/749},\n note = {Gesellschaft zur F\\\"orderung des Forschungstransfers (GFFT) Prize \"Best Master Thesis\"},\n}\n\n','\n\nJóakim von Kistowski.\nModeling Variations in Load Intensity Profiles.\nMaster Thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, March 2014.\nGesellschaft zur Förderung des Forschungstransfers (GFFT) Prize\n\"Best Master Thesis\".\n[ bib | slides | .pdf | Abstract  ] 
\n@mastersthesis{Kistowski2014,\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nabstract = {{Today\'s software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. Based on this observation, I identify the need for means allowing flexible definition of load profiles and address this by introducing two meta-models at different abstraction levels. At the lower abstraction level, the Descartes Load Intensity Meta-Model (DLIM) offers a structured and accessible way of describing the load intensity over time by editing and combining mathematical functions. The high-level Descartes Load Intensity Meta-Model (hl-DLIM) allows the description of load variations using few defined parameters that characterize the seasonal patterns, trends, bursts, and noise parts. Using these parameters, hl-DLIM is capable of describing a subset of most common load intensity variations. During the work on this thesis I developed LIMBO - an Eclipse-based tool for modeling variable load intensity profiles based on DLIM and hl-DLIM as underlying modeling formalisms. LIMBO provides visualization for DLIM instances and a model creation wizard based on hl-DLIM parameters. It also offers three automated model extraction processes with which to extract DLIM and hl-DLIM instances from existing arrival rate traces. It also offers a model-to-model transformation from hl-DLIM to DLIM. I demonstrate that both meta-models are capable of capturing real-world load profiles with acceptable accuracy, having an average median deviation of 19.9\\% from the original trace. This is done by comparing nine different real life traces, which were measured over duration of two weeks to seven months, to their respective model instances as extracted by the automated model extraction processes. I also evaluate the usability and accessibility of LIMBO based on a questionnaire which was answered by eight computer scientists from five different organizations within the performance engineering community.}},\nauthor = {J\\\'{o}akim von Kistowski},\nkeywords = {Load Intensity, Model},\nschool = {{Karlsruhe Institute of Technology (KIT)}},\ntitle = {{Modeling Variations in Load Intensity Profiles}},\ntype = {{Master Thesis}},\nyear = {2014},\nmonth = {March},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/749.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/749},\nnote = {Gesellschaft zur F\\\"orderung des Forschungstransfers (GFFT) Prize \"Best Master Thesis\"}\n}\n
\n
\nToday\'s software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. Based on this observation, I identify the need for means allowing flexible definition of load profiles and address this by introducing two meta-models at different abstraction levels. At the lower abstraction level, the Descartes Load Intensity Meta-Model (DLIM) offers a structured and accessible way of describing the load intensity over time by editing and combining mathematical functions. The high-level Descartes Load Intensity Meta-Model (hl-DLIM) allows the description of load variations using few defined parameters that characterize the seasonal patterns, trends, bursts, and noise parts. Using these parameters, hl-DLIM is capable of describing a subset of most common load intensity variations. During the work on this thesis I developed LIMBO - an Eclipse-based tool for modeling variable load intensity profiles based on DLIM and hl-DLIM as underlying modeling formalisms. LIMBO provides visualization for DLIM instances and a model creation wizard based on hl-DLIM parameters. It also offers three automated model extraction processes with which to extract DLIM and hl-DLIM instances from existing arrival rate traces. It also offers a model-to-model transformation from hl-DLIM to DLIM. I demonstrate that both meta-models are capable of capturing real-world load profiles with acceptable accuracy, having an average median deviation of 19.9% from the original trace. This is done by comparing nine different real life traces, which were measured over duration of two weeks to seven months, to their respective model instances as extracted by the automated model extraction processes. I also evaluate the usability and accessibility of LIMBO based on a questionnaire which was answered by eight computer scientists from five different organizations within the performance engineering community.\n
\n','
\n@mastersthesis{Kistowski2014,\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  abstract = {{Today\'s software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. Based on this observation, I identify the need for means allowing flexible definition of load profiles and address this by introducing two meta-models at different abstraction levels. At the lower abstraction level, the Descartes Load Intensity Meta-Model (DLIM) offers a structured and accessible way of describing the load intensity over time by editing and combining mathematical functions. The high-level Descartes Load Intensity Meta-Model (hl-DLIM) allows the description of load variations using few defined parameters that characterize the seasonal patterns, trends, bursts, and noise parts. Using these parameters, hl-DLIM is capable of describing a subset of most common load intensity variations. During the work on this thesis I developed LIMBO - an Eclipse-based tool for modeling variable load intensity profiles based on DLIM and hl-DLIM as underlying modeling formalisms. LIMBO provides visualization for DLIM instances and a model creation wizard based on hl-DLIM parameters. It also offers three automated model extraction processes with which to extract DLIM and hl-DLIM instances from existing arrival rate traces. It also offers a model-to-model transformation from hl-DLIM to DLIM. I demonstrate that both meta-models are capable of capturing real-world load profiles with acceptable accuracy, having an average median deviation of 19.9\\% from the original trace. This is done by comparing nine different real life traces, which were measured over duration of two weeks to seven months, to their respective model instances as extracted by the automated model extraction processes. I also evaluate the usability and accessibility of LIMBO based on a questionnaire which was answered by eight computer scientists from five different organizations within the performance engineering community.}},\n  author = {J\\\'{o}akim von Kistowski},\n  keywords = {Load Intensity, Model},\n  school = {{Karlsruhe Institute of Technology (KIT)}},\n  title = {{Modeling Variations in Load Intensity Profiles}},\n  type = {{Master Thesis}},\n  year = {2014},\n  month = {March},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/749.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/749},\n  note = {Gesellschaft zur F\\\"orderung des Forschungstransfers (GFFT) Prize \"Best Master Thesis\"}\n}\n
\n\n','{Today\'s software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. Based on this observation, I identify the need for means allowing flexible definition of load profiles and address this by introducing two meta-models at different abstraction levels. At the lower abstraction level, the Descartes Load Intensity Meta-Model (DLIM) offers a structured and accessible way of describing the load intensity over time by editing and combining mathematical functions. The high-level Descartes Load Intensity Meta-Model (hl-DLIM) allows the description of load variations using few defined parameters that characterize the seasonal patterns, trends, bursts, and noise parts. Using these parameters, hl-DLIM is capable of describing a subset of most common load intensity variations. During the work on this thesis I developed LIMBO - an Eclipse-based tool for modeling variable load intensity profiles based on DLIM and hl-DLIM as underlying modeling formalisms. LIMBO provides visualization for DLIM instances and a model creation wizard based on hl-DLIM parameters. It also offers three automated model extraction processes with which to extract DLIM and hl-DLIM instances from existing arrival rate traces. It also offers a model-to-model transformation from hl-DLIM to DLIM. I demonstrate that both meta-models are capable of capturing real-world load profiles with acceptable accuracy, having an average median deviation of 19.9\\% from the original trace. This is done by comparing nine different real life traces, which were measured over duration of two weeks to seven months, to their respective model instances as extracted by the automated model extraction processes. I also evaluate the usability and accessibility of LIMBO based on a questionnaire which was answered by eight computer scientists from five different organizations within the performance engineering community.}','{Modeling Variations in Load Intensity Profiles}',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(750,'paper','MiPaAnViKo2014-ISSRE-AnAnalHypHanVulns','inproceedings','@inproceedings{MiPaAnViKo2014-ISSRE-AnAnalHypHanVulns,\n abstract = {{Hypervisors are becoming increasingly ubiquitous with the growing proliferation of virtualized data centers. As a result, attackers are exploring vectors to attack hypervisors, against which an attack may be executed via several attack vectors such as device drivers, virtual machine exit events, or hypercalls. Hypercalls enable intrusions in hypervisors through their hypercall interfaces. Despite the importance, there is very limited publicly available information on vulnerabilities of hypercall handlers and attacks triggering them, which significantly hinders advances towards monitoring and securing these interfaces. In this paper, we characterize the hypercall attack surface based on analyzing a set of vulnerabilities of hypercall handlers. We systematize and discuss the errors that caused the considered vulnerabilities, and activities for executing attacks triggering them. We also demonstrate attacks triggering the considered vulnerabilities and analyze their effects. Finally, we suggest an action plan for improving the security of hypercall interfaces.}},\n author = {Aleksandar Milenkoski and Bryan D. Payne and Nuno Antunes and Marco Vieira and Samuel Kounev},\n title = {{Experience Report: An Analysis of Hypercall Handler Vulnerabilities}},\n location = {Naples, Italy},\n month = {November},\n booktitle = {{Proceedings of The 25th IEEE International Symposium on Software Reliability Engineering (ISSRE 2014) --- Research Track}},\n organization = {IEEE},\n publisher = {IEEE Computer Society},\n note = {Acceptance Rate: 25\\%, Best Paper Award Nomination},\n address = {{Washington DC, USA}},\n year = {2014},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/750},\n url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6982618},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/750.pdf},\n}\n\n','\n\nAleksandar Milenkoski, Bryan D. Payne, Nuno Antunes, Marco Vieira, and Samuel\nKounev.\nExperience Report: An Analysis of Hypercall Handler\nVulnerabilities.\nIn Proceedings of The 25th IEEE International Symposium on\nSoftware Reliability Engineering (ISSRE 2014) - Research Track, Naples,\nItaly, November 2014. IEEE, IEEE Computer Society, Washington DC, USA.\nNovember 2014, Acceptance Rate: 25%, Best Paper Award\nNomination.\n[ bib | slides | http | .pdf | Abstract  ] 
\n@inproceedings{MiPaAnViKo2014-ISSRE-AnAnalHypHanVulns,\nabstract = {{Hypervisors are becoming increasingly ubiquitous with the growing proliferation of virtualized data centers. As a result, attackers are exploring vectors to attack hypervisors, against which an attack may be executed via several attack vectors such as device drivers, virtual machine exit events, or hypercalls. Hypercalls enable intrusions in hypervisors through their hypercall interfaces. Despite the importance, there is very limited publicly available information on vulnerabilities of hypercall handlers and attacks triggering them, which significantly hinders advances towards monitoring and securing these interfaces. In this paper, we characterize the hypercall attack surface based on analyzing a set of vulnerabilities of hypercall handlers. We systematize and discuss the errors that caused the considered vulnerabilities, and activities for executing attacks triggering them. We also demonstrate attacks triggering the considered vulnerabilities and analyze their effects. Finally, we suggest an action plan for improving the security of hypercall interfaces.}},\nauthor = {Aleksandar Milenkoski and Bryan D. Payne and Nuno Antunes and Marco Vieira and Samuel Kounev},\ntitle = {{Experience Report: An Analysis of Hypercall Handler Vulnerabilities}},\nlocation = {Naples, Italy},\nmonth = {November},\nbooktitle = {{Proceedings of The 25th IEEE International Symposium on Software Reliability Engineering (ISSRE 2014) --- Research Track}},\norganization = {IEEE},\npublisher = {IEEE Computer Society},\nnote = {Acceptance Rate: 25\\%, Best Paper Award Nomination},\naddress = {{Washington DC, USA}},\nyear = {2014},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/750},\nurl = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6982618},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/750.pdf}\n}\n
\n
\nHypervisors are becoming increasingly ubiquitous with the growing proliferation of virtualized data centers. As a result, attackers are exploring vectors to attack hypervisors, against which an attack may be executed via several attack vectors such as device drivers, virtual machine exit events, or hypercalls. Hypercalls enable intrusions in hypervisors through their hypercall interfaces. Despite the importance, there is very limited publicly available information on vulnerabilities of hypercall handlers and attacks triggering them, which significantly hinders advances towards monitoring and securing these interfaces. In this paper, we characterize the hypercall attack surface based on analyzing a set of vulnerabilities of hypercall handlers. We systematize and discuss the errors that caused the considered vulnerabilities, and activities for executing attacks triggering them. We also demonstrate attacks triggering the considered vulnerabilities and analyze their effects. Finally, we suggest an action plan for improving the security of hypercall interfaces.\n
\n','
\n@inproceedings{MiPaAnViKo2014-ISSRE-AnAnalHypHanVulns,\n  abstract = {{Hypervisors are becoming increasingly ubiquitous with the growing proliferation of virtualized data centers. As a result, attackers are exploring vectors to attack hypervisors, against which an attack may be executed via several attack vectors such as device drivers, virtual machine exit events, or hypercalls. Hypercalls enable intrusions in hypervisors through their hypercall interfaces. Despite the importance, there is very limited publicly available information on vulnerabilities of hypercall handlers and attacks triggering them, which significantly hinders advances towards monitoring and securing these interfaces. In this paper, we characterize the hypercall attack surface based on analyzing a set of vulnerabilities of hypercall handlers. We systematize and discuss the errors that caused the considered vulnerabilities, and activities for executing attacks triggering them. We also demonstrate attacks triggering the considered vulnerabilities and analyze their effects. Finally, we suggest an action plan for improving the security of hypercall interfaces.}},\n  author = {Aleksandar Milenkoski and Bryan D. Payne and Nuno Antunes and Marco Vieira and Samuel Kounev},\n  title = {{Experience Report: An Analysis of Hypercall Handler Vulnerabilities}},\n  location = {Naples, Italy},\n  month = {November},\n  booktitle = {{Proceedings of The 25th IEEE International Symposium on Software Reliability Engineering (ISSRE 2014) --- Research Track}},\n  organization = {IEEE},\n  publisher = {IEEE Computer Society},\n  note = {Acceptance Rate: 25\\%, Best Paper Award Nomination},\n  address = {{Washington DC, USA}},\n  year = {2014},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/750},\n  url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6982618},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/750.pdf}\n}\n
\n\n','{Hypervisors are becoming increasingly ubiquitous with the growing proliferation of virtualized data centers. As a result, attackers are exploring vectors to attack hypervisors, against which an attack may be executed via several attack vectors such as device drivers, virtual machine exit events, or hypercalls. Hypercalls enable intrusions in hypervisors through their hypercall interfaces. Despite the importance, there is very limited publicly available information on vulnerabilities of hypercall handlers and attacks triggering them, which significantly hinders advances towards monitoring and securing these interfaces. In this paper, we characterize the hypercall attack surface based on analyzing a set of vulnerabilities of hypercall handlers. We systematize and discuss the errors that caused the considered vulnerabilities, and activities for executing attacks triggering them. We also demonstrate attacks triggering the considered vulnerabilities and analyze their effects. Finally, we suggest an action plan for improving the security of hypercall interfaces.}','{Experience Report: An Analysis of Hypercall Handler Vulnerabilities}',0,11,2014,11,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(751,'paper','KrLoKo2014_CLOUD_Framework','inproceedings','@inproceedings{KrLoKo2014_CLOUD_Framework,\n abstract = {{Software-as-a-Service (SaaS) often shares one single application instance among different tenants to reduce costs. However, sharing potentially leads to undesired influence from one tenant onto the performance observed by the others. This is a significant problem as performance is one of the major obstacles for cloud customers. The application does intentionally not manage hardware resources, and the operating system is not aware of application level entities like tenants which makes the performance control a challenge. In case the SaaS is hosted on a Platform-as-a-Service (PaaS), the SaaS developer usually wants to control performance-related issues according to individual needs, and available information is even more limited. Thus, it is difficult to control the performance of different tenants to keep them isolated. Existing work focuses on concrete methods to provide performance isolation in systems where the whole stack is under control. In this paper we present a concrete PaaS enhancement which enables application developers to realize isolation methods for their hosted SaaS application. In a case study we evaluated the applicability and effectiveness of the enhancement in different environments.}},\n author = {Rouven Krebs and Manuel Loesch and Samuel Kounev},\n booktitle = {Proceedings of the 7th IEEE International Conference on Cloud Computing (IEEE Cloud 2014)},\n day = {2},\n location = {Anchorage, USA},\n month = {July},\n publisher = {IEEE},\n title = {{Platform-as-a-Service Architecture for Performance Isolated Multi-Tenant Applications}},\n year = {2014},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/751.pdf},\n}\n\n','\n\nRouven Krebs, Manuel Loesch, and Samuel Kounev.\nPlatform-as-a-Service Architecture for Performance Isolated\nMulti-Tenant Applications.\nIn Proceedings of the 7th IEEE International Conference on Cloud\nComputing (IEEE Cloud 2014), Anchorage, USA, July 2, 2014. IEEE.\nJuly 2014.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{KrLoKo2014_CLOUD_Framework,\nabstract = {{Software-as-a-Service (SaaS) often shares one single application instance among different tenants to reduce costs. However, sharing potentially leads to undesired influence from one tenant onto the performance observed by the others. This is a significant problem as performance is one of the major obstacles for cloud customers. The application does intentionally not manage hardware resources, and the operating system is not aware of application level entities like tenants which makes the performance control a challenge. In case the SaaS is hosted on a Platform-as-a-Service (PaaS), the SaaS developer usually wants to control performance-related issues according to individual needs, and available information is even more limited. Thus, it is difficult to control the performance of different tenants to keep them isolated. Existing work focuses on concrete methods to provide performance isolation in systems where the whole stack is under control. In this paper we present a concrete PaaS enhancement which enables application developers to realize isolation methods for their hosted SaaS application. In a case study we evaluated the applicability and effectiveness of the enhancement in different environments.}},\nauthor = {Rouven Krebs and Manuel Loesch and Samuel Kounev},\nbooktitle = {Proceedings of the 7th IEEE International Conference on Cloud Computing (IEEE Cloud 2014)},\nday = {2},\nlocation = {Anchorage, USA},\nmonth = {July},\npublisher = {IEEE},\ntitle = {{Platform-as-a-Service Architecture for Performance Isolated Multi-Tenant Applications}},\nyear = {2014},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/751.pdf}\n}\n
\n
\nSoftware-as-a-Service (SaaS) often shares one single application instance among different tenants to reduce costs. However, sharing potentially leads to undesired influence from one tenant onto the performance observed by the others. This is a significant problem as performance is one of the major obstacles for cloud customers. The application does intentionally not manage hardware resources, and the operating system is not aware of application level entities like tenants which makes the performance control a challenge. In case the SaaS is hosted on a Platform-as-a-Service (PaaS), the SaaS developer usually wants to control performance-related issues according to individual needs, and available information is even more limited. Thus, it is difficult to control the performance of different tenants to keep them isolated. Existing work focuses on concrete methods to provide performance isolation in systems where the whole stack is under control. In this paper we present a concrete PaaS enhancement which enables application developers to realize isolation methods for their hosted SaaS application. In a case study we evaluated the applicability and effectiveness of the enhancement in different environments.\n
\n','
\n@inproceedings{KrLoKo2014_CLOUD_Framework,\n  abstract = {{Software-as-a-Service (SaaS) often shares one single application instance among different tenants to reduce costs. However, sharing potentially leads to undesired influence from one tenant onto the performance observed by the others. This is a significant problem as performance is one of the major obstacles for cloud customers. The application does intentionally not manage hardware resources, and the operating system is not aware of application level entities like tenants which makes the performance control a challenge. In case the SaaS is hosted on a Platform-as-a-Service (PaaS), the SaaS developer usually wants to control performance-related issues according to individual needs, and available information is even more limited. Thus, it is difficult to control the performance of different tenants to keep them isolated. Existing work focuses on concrete methods to provide performance isolation in systems where the whole stack is under control. In this paper we present a concrete PaaS enhancement which enables application developers to realize isolation methods for their hosted SaaS application. In a case study we evaluated the applicability and effectiveness of the enhancement in different environments.}},\n  author = {Rouven Krebs and Manuel Loesch and Samuel Kounev},\n  booktitle = {Proceedings of the 7th IEEE International Conference on Cloud Computing (IEEE Cloud 2014)},\n  day = {2},\n  location = {Anchorage, USA},\n  month = {July},\n  publisher = {IEEE},\n  title = {{Platform-as-a-Service Architecture for Performance Isolated Multi-Tenant Applications}},\n  year = {2014},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/751.pdf}\n}\n
\n\n','{Software-as-a-Service (SaaS) often shares one single application instance among different tenants to reduce costs. However, sharing potentially leads to undesired influence from one tenant onto the performance observed by the others. This is a significant problem as performance is one of the major obstacles for cloud customers. The application does intentionally not manage hardware resources, and the operating system is not aware of application level entities like tenants which makes the performance control a challenge. In case the SaaS is hosted on a Platform-as-a-Service (PaaS), the SaaS developer usually wants to control performance-related issues according to individual needs, and available information is even more limited. Thus, it is difficult to control the performance of different tenants to keep them isolated. Existing work focuses on concrete methods to provide performance isolation in systems where the whole stack is under control. In this paper we present a concrete PaaS enhancement which enables application developers to realize isolation methods for their hosted SaaS application. In a case study we evaluated the applicability and effectiveness of the enhancement in different environments.}','{Platform-as-a-Service Architecture for Performance Isolated Multi-Tenant Applications}',0,7,2014,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(752,'paper','LoKr2014-CCIS-LocationsForIsolation','inproceedings','@inproceedings{LoKr2014-CCIS-LocationsForIsolation,\n author = {Manuel Loesch and Rouven Krebs},\n title = {{Locations for Performance Ensuring Admission Control in Load Balanced Multi-Tenant Systems}},\n booktitle = {Communications in Computer and Information Science - Third International Conference, CLOSER 2013, Aachen, Germany, May 8-10, 2013, Selected Papers},\n editor = {Springer},\n year = {2014},\n month = {May},\n abstract = {In the context of Software as a Service offerings, multi-tenant applications (MTAs) allow to increase the efficiency by sharing one application instance among several customers. Due to the tight coupling and sharing of resources on all layers up to the application layer, customers may influence each other with regards to the performance they observe. Existing research on performance isolation of MTAs focuses on methods and concrete algorithms. In this paper, we present concerns that are raised when serving a high amount of users in a load balancing cluster with multiple MTA instances. We identified potential positions in such an architecture where performance isolation can be enforced based on request admission control. Considering various approaches for request-to-instance allocation, our discussion shows that different positions come along with specific pros and cons that have influence on the ability to performance-isolate tenants.},\n}\n\n','\n\nManuel Loesch and Rouven Krebs.\nLocations for Performance Ensuring Admission Control in Load\nBalanced Multi-Tenant Systems.\nIn Communications in Computer and Information Science - Third\nInternational Conference, CLOSER 2013, Aachen, Germany, May 8-10, 2013,\nSelected Papers, Springer, editor, May 2014.\n[ bib | Abstract  ] 
\n@inproceedings{LoKr2014-CCIS-LocationsForIsolation,\nauthor = {Manuel Loesch and Rouven Krebs},\ntitle = {{Locations for Performance Ensuring Admission Control in Load Balanced Multi-Tenant Systems}},\nbooktitle = {Communications in Computer and Information Science - Third International Conference, CLOSER 2013, Aachen, Germany, May 8-10, 2013, Selected Papers},\neditor = {Springer},\nyear = {2014},\nmonth = {May},\nabstract = {In the context of Software as a Service offerings, multi-tenant applications (MTAs) allow to increase the efficiency by sharing one application instance among several customers. Due to the tight coupling and sharing of resources on all layers up to the application layer, customers may influence each other with regards to the performance they observe. Existing research on performance isolation of MTAs focuses on methods and concrete algorithms. In this paper, we present concerns that are raised when serving a high amount of users in a load balancing cluster with multiple MTA instances. We identified potential positions in such an architecture where performance isolation can be enforced based on request admission control. Considering various approaches for request-to-instance allocation, our discussion shows that different positions come along with specific pros and cons that have influence on the ability to performance-isolate tenants.}\n}\n
\n
\nIn the context of Software as a Service offerings, multi-tenant applications (MTAs) allow to increase the efficiency by sharing one application instance among several customers. Due to the tight coupling and sharing of resources on all layers up to the application layer, customers may influence each other with regards to the performance they observe. Existing research on performance isolation of MTAs focuses on methods and concrete algorithms. In this paper, we present concerns that are raised when serving a high amount of users in a load balancing cluster with multiple MTA instances. We identified potential positions in such an architecture where performance isolation can be enforced based on request admission control. Considering various approaches for request-to-instance allocation, our discussion shows that different positions come along with specific pros and cons that have influence on the ability to performance-isolate tenants.\n
\n','
\n@inproceedings{LoKr2014-CCIS-LocationsForIsolation,\n  author = {Manuel Loesch and Rouven Krebs},\n  title = {{Locations for Performance Ensuring Admission Control in Load Balanced Multi-Tenant Systems}},\n  booktitle = {Communications in Computer and Information Science - Third International Conference, CLOSER 2013, Aachen, Germany, May 8-10, 2013, Selected Papers},\n  editor = {Springer},\n  year = {2014},\n  month = {May},\n  abstract = {In the context of Software as a Service offerings, multi-tenant applications (MTAs) allow to increase the efficiency by sharing one application instance among several customers. Due to the tight coupling and sharing of resources on all layers up to the application layer, customers may influence each other with regards to the performance they observe. Existing research on performance isolation of MTAs focuses on methods and concrete algorithms. In this paper, we present concerns that are raised when serving a high amount of users in a load balancing cluster with multiple MTA instances. We identified potential positions in such an architecture where performance isolation can be enforced based on request admission control. Considering various approaches for request-to-instance allocation, our discussion shows that different positions come along with specific pros and cons that have influence on the ability to performance-isolate tenants.}\n}\n
\n\n','In the context of Software as a Service offerings, multi-tenant applications (MTAs) allow to increase the efficiency by sharing one application instance among several customers. Due to the tight coupling and sharing of resources on all layers up to the application layer, customers may influence each other with regards to the performance they observe. Existing research on performance isolation of MTAs focuses on methods and concrete algorithms. In this paper, we present concerns that are raised when serving a high amount of users in a load balancing cluster with multiple MTA instances. We identified potential positions in such an architecture where performance isolation can be enforced based on request admission control. Considering various approaches for request-to-instance allocation, our discussion shows that different positions come along with specific pros and cons that have influence on the ability to performance-isolate tenants.','{Locations for Performance Ensuring Admission Control in Load Balanced Multi-Tenant Systems}',0,5,2014,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(754,'paper','BrMeBeKoKoKo2014-TSE-ModelSolutionTradeOffs','article','@article{BrMeBeKoKoKo2014-TSE-ModelSolutionTradeOffs,\n author = {Fabian Brosig and Philipp Meier and Steffen Becker and Anne Koziolek and Heiko Koziolek and Samuel Kounev},\n journal = {IEEE Transactions on Software Engineering (TSE)},\n publisher = {IEEE},\n title = {{Quantitative Evaluation of Model-Driven Performance Analysis and Simulation of Component-based Architectures}},\n volume = {41},\n number = {2},\n pages = {157--175},\n year = {2015},\n month = {{February}},\n url = {http://dx.doi.org/10.1109/TSE.2014.2362755},\n doi = {10.1109/TSE.2014.2362755},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/754.pdf},\n}\n\n','\n\nFabian Brosig, Philipp Meier, Steffen Becker, Anne Koziolek, Heiko Koziolek,\nand Samuel Kounev.\nQuantitative Evaluation of Model-Driven Performance Analysis and\nSimulation of Component-based Architectures.\nIEEE Transactions on Software Engineering (TSE),\n41(2):157-175, February 2015, IEEE.\n[ bib | DOI | http | .pdf  ] 
\n@article{BrMeBeKoKoKo2014-TSE-ModelSolutionTradeOffs,\nauthor = {Fabian Brosig and Philipp Meier and Steffen Becker and Anne Koziolek and Heiko Koziolek and Samuel Kounev},\njournal = {IEEE Transactions on Software Engineering (TSE)},\npublisher = {IEEE},\ntitle = {{Quantitative Evaluation of Model-Driven Performance Analysis and Simulation of Component-based Architectures}},\nvolume = {41},\nnumber = {2},\npages = {157--175},\nyear = {2015},\nmonth = {{February}},\nurl = {http://dx.doi.org/10.1109/TSE.2014.2362755},\ndoi = {10.1109/TSE.2014.2362755},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/754.pdf}\n}\n
\n
\n','
\n@article{BrMeBeKoKoKo2014-TSE-ModelSolutionTradeOffs,\n  author = {Fabian Brosig and Philipp Meier and Steffen Becker and Anne Koziolek and Heiko Koziolek and Samuel Kounev},\n  journal = {IEEE Transactions on Software Engineering (TSE)},\n  publisher = {IEEE},\n  title = {{Quantitative Evaluation of Model-Driven Performance Analysis and Simulation of Component-based Architectures}},\n  volume = {41},\n  number = {2},\n  pages = {157--175},\n  year = {2015},\n  month = {{February}},\n  url = {http://dx.doi.org/10.1109/TSE.2014.2362755},\n  doi = {10.1109/TSE.2014.2362755},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/754.pdf}\n}\n
\n\n',NULL,'{Quantitative Evaluation of Model-Driven Performance Analysis and Simulation of Component-based Architectures}',0,2,2015,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(755,'paper','Kr2014-uspatent-Controller','misc','@misc{Kr2014-uspatent-Controller,\n author = {Krebs, Rouven and Mehta, Arpit},\n howpublished = {US Patent Application No 13/972,477},\n title = {Multi-Stage Feedback controller for prioritizing tenants for Multi-Tenant application},\n year = {2013},\n}\n\n','\n\nRouven Krebs and Arpit Mehta.\nMulti-stage feedback controller for prioritizing tenants for\nmulti-tenant application.\nUS Patent Application No 13/972,477, 2013.\n[ bib  ] 
\n@misc{Kr2014-uspatent-Controller,\nauthor = {Krebs, Rouven and Mehta, Arpit},\nhowpublished = {US Patent Application No 13/972,477},\ntitle = {Multi-Stage Feedback controller for prioritizing tenants for Multi-Tenant application},\nyear = {2013}\n}\n
\n
\n','
\n@misc{Kr2014-uspatent-Controller,\n  author = {Krebs, Rouven and Mehta, Arpit},\n  howpublished = {US Patent Application No 13/972,477},\n  title = {Multi-Stage Feedback controller for prioritizing tenants for Multi-Tenant application},\n  year = {2013}\n}\n
\n\n',NULL,'Multi-Stage Feedback controller for prioritizing tenants for Multi-Tenant application',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(756,'paper','Kr2014-uspatent-Probabilistic','misc','@misc{Kr2014-uspatent-Probabilistic,\n author = {Mehta, Arpit and Krebs, Rouven},\n howpublished = {US Patent Application No 13/904,729},\n title = {Probabilistic tenant selection in quota enforcing Request Admission mechanisms for Shared Applications},\n year = {2013},\n}\n\n','\n\nArpit Mehta and Rouven Krebs.\nProbabilistic tenant selection in quota enforcing request admission\nmechanisms for shared applications.\nUS Patent Application No 13/904,729, 2013.\n[ bib  ] 
\n@misc{Kr2014-uspatent-Probabilistic,\nauthor = {Mehta, Arpit and Krebs, Rouven},\nhowpublished = {US Patent Application No 13/904,729},\ntitle = {Probabilistic tenant selection in quota enforcing Request Admission mechanisms for Shared Applications},\nyear = {2013}\n}\n
\n
\n','
\n@misc{Kr2014-uspatent-Probabilistic,\n  author = {Mehta, Arpit and Krebs, Rouven},\n  howpublished = {US Patent Application No 13/904,729},\n  title = {Probabilistic tenant selection in quota enforcing Request Admission mechanisms for Shared Applications},\n  year = {2013}\n}\n
\n\n',NULL,'Probabilistic tenant selection in quota enforcing Request Admission mechanisms for Shared Applications',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(757,'paper','Kr2014-uspatent-ResourceControl','misc','@misc{Kr2014-uspatent-ResourceControl,\n author = {Krebs, Rouven and Mehta, Arpit},\n howpublished = {US Patent Application No 14/079,289},\n title = {Application Level Based Resource Management in Multi-Tenant Applications},\n year = {2013},\n}\n\n','\n\nRouven Krebs and Arpit Mehta.\nApplication level based resource management in multi-tenant\napplications.\nUS Patent Application No 14/079,289, 2013.\n[ bib  ] 
\n@misc{Kr2014-uspatent-ResourceControl,\nauthor = {Krebs, Rouven and Mehta, Arpit},\nhowpublished = {US Patent Application No 14/079,289},\ntitle = {Application Level Based Resource Management in Multi-Tenant Applications},\nyear = {2013}\n}\n
\n
\n','
\n@misc{Kr2014-uspatent-ResourceControl,\n  author = {Krebs, Rouven and Mehta, Arpit},\n  howpublished = {US Patent Application No 14/079,289},\n  title = {Application Level Based Resource Management in Multi-Tenant Applications},\n  year = {2013}\n}\n
\n\n',NULL,'Application Level Based Resource Management in Multi-Tenant Applications',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(758,'paper','MiViPaAnKo2014-TechReport-TechInformation','techreport','@techreport{MiViPaAnKo2014-TechReport-TechInformation,\n abstract = {{Modern virtualized service infrastructures expose attack vectors that enable attacks of high severity, such as attacks targeting hypervisors. A malicious user of a guest VM (virtual machine) may execute an attack against the underlying hypervisor via hypercalls, which are software traps from a kernel of a fully or partially paravirtualized guest VM to the hypervisor. The exploitation of a vulnerability of a hypercall handler may have severe consequences such as altering hypervisor\'s memory, which may result in the execution of malicious code with hypervisor privilege. Despite the importance of vulnerabilities of hypercall handlers, there is not much publicly available information on them. This significantly hinders advances towards securing hypercall interfaces. In this work, we provide in-depth technical information on publicly disclosed vulnerabilities of hypercall handlers. Our vulnerability analysis is based on reverse engineering the released patches fixing the considered vulnerabilities. For each analyzed vulnerability, we provide background information essential for understanding the vulnerability, and information on the vulnerable hypercall handler and the error causing the vulnerability. We also show how the vulnerability can be triggered and discuss the state of the targeted hypervisor after the vulnerability has been triggered.}},\n address = {{7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}},\n author = {Aleksandar Milenkoski and Marco Vieira and Bryan D. Payne and Nuno Antunes and Samuel Kounev},\n institution = {SPEC Research Group - IDS Benchmarking Working Group, Standard Performance Evaluation Corporation (SPEC)},\n month = {August},\n pdf = {http://research.spec.org/fileadmin/user_upload/documents/wg_ids/endorsed_publications/SPEC-RG-2014-001_HypercallVulnerabilities.pdf},\n title = {{Technical Information on Vulnerabilities of Hypercall Handlers}},\n type = {{Technical Report SPEC-RG-2014-001 v.1.0}},\n year = {2014},\n}\n\n','\n\nAleksandar Milenkoski, Marco Vieira, Bryan D. Payne, Nuno Antunes, and Samuel\nKounev.\nTechnical Information on Vulnerabilities of Hypercall Handlers.\nTechnical Report SPEC-RG-2014-001 v.1.0, SPEC Research Group - IDS\nBenchmarking Working Group, Standard Performance Evaluation Corporation\n(SPEC), 7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA,\nAugust 2014.\n[ bib | .pdf | Abstract  ] 
\n@techreport{MiViPaAnKo2014-TechReport-TechInformation,\nabstract = {{Modern virtualized service infrastructures expose attack vectors that enable attacks of high severity, such as attacks targeting hypervisors. A malicious user of a guest VM (virtual machine) may execute an attack against the underlying hypervisor via hypercalls, which are software traps from a kernel of a fully or partially paravirtualized guest VM to the hypervisor. The exploitation of a vulnerability of a hypercall handler may have severe consequences such as altering hypervisor\'s memory, which may result in the execution of malicious code with hypervisor privilege. Despite the importance of vulnerabilities of hypercall handlers, there is not much publicly available information on them. This significantly hinders advances towards securing hypercall interfaces. In this work, we provide in-depth technical information on publicly disclosed vulnerabilities of hypercall handlers. Our vulnerability analysis is based on reverse engineering the released patches fixing the considered vulnerabilities. For each analyzed vulnerability, we provide background information essential for understanding the vulnerability, and information on the vulnerable hypercall handler and the error causing the vulnerability. We also show how the vulnerability can be triggered and discuss the state of the targeted hypervisor after the vulnerability has been triggered.}},\naddress = {{7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}},\nauthor = {Aleksandar Milenkoski and Marco Vieira and Bryan D. Payne and Nuno Antunes and Samuel Kounev},\ninstitution = {SPEC Research Group - IDS Benchmarking Working Group, Standard Performance Evaluation Corporation (SPEC)},\nmonth = {August},\npdf = {http://research.spec.org/fileadmin/user_upload/documents/wg_ids/endorsed_publications/SPEC-RG-2014-001_HypercallVulnerabilities.pdf},\ntitle = {{Technical Information on Vulnerabilities of Hypercall Handlers}},\ntype = {{Technical Report SPEC-RG-2014-001 v.1.0}},\nyear = {2014}\n}\n
\n
\nModern virtualized service infrastructures expose attack vectors that enable attacks of high severity, such as attacks targeting hypervisors. A malicious user of a guest VM (virtual machine) may execute an attack against the underlying hypervisor via hypercalls, which are software traps from a kernel of a fully or partially paravirtualized guest VM to the hypervisor. The exploitation of a vulnerability of a hypercall handler may have severe consequences such as altering hypervisor\'s memory, which may result in the execution of malicious code with hypervisor privilege. Despite the importance of vulnerabilities of hypercall handlers, there is not much publicly available information on them. This significantly hinders advances towards securing hypercall interfaces. In this work, we provide in-depth technical information on publicly disclosed vulnerabilities of hypercall handlers. Our vulnerability analysis is based on reverse engineering the released patches fixing the considered vulnerabilities. For each analyzed vulnerability, we provide background information essential for understanding the vulnerability, and information on the vulnerable hypercall handler and the error causing the vulnerability. We also show how the vulnerability can be triggered and discuss the state of the targeted hypervisor after the vulnerability has been triggered.\n
\n','
\n@techreport{MiViPaAnKo2014-TechReport-TechInformation,\n  abstract = {{Modern virtualized service infrastructures expose attack vectors that enable attacks of high severity, such as attacks targeting hypervisors. A malicious user of a guest VM (virtual machine) may execute an attack against the underlying hypervisor via hypercalls, which are software traps from a kernel of a fully or partially paravirtualized guest VM to the hypervisor. The exploitation of a vulnerability of a hypercall handler may have severe consequences such as altering hypervisor\'s memory, which may result in the execution of malicious code with hypervisor privilege. Despite the importance of vulnerabilities of hypercall handlers, there is not much publicly available information on them. This significantly hinders advances towards securing hypercall interfaces. In this work, we provide in-depth technical information on publicly disclosed vulnerabilities of hypercall handlers. Our vulnerability analysis is based on reverse engineering the released patches fixing the considered vulnerabilities. For each analyzed vulnerability, we provide background information essential for understanding the vulnerability, and information on the vulnerable hypercall handler and the error causing the vulnerability. We also show how the vulnerability can be triggered and discuss the state of the targeted hypervisor after the vulnerability has been triggered.}},\n  address = {{7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}},\n  author = {Aleksandar Milenkoski and Marco Vieira and Bryan D. Payne and Nuno Antunes and Samuel Kounev},\n  institution = {SPEC Research Group - IDS Benchmarking Working Group, Standard Performance Evaluation Corporation (SPEC)},\n  month = {August},\n  pdf = {http://research.spec.org/fileadmin/user_upload/documents/wg_ids/endorsed_publications/SPEC-RG-2014-001_HypercallVulnerabilities.pdf},\n  title = {{Technical Information on Vulnerabilities of Hypercall Handlers}},\n  type = {{Technical Report SPEC-RG-2014-001 v.1.0}},\n  year = {2014}\n}\n
\n\n','{Modern virtualized service infrastructures expose attack vectors that enable attacks of high severity, such as attacks targeting hypervisors. A malicious user of a guest VM (virtual machine) may execute an attack against the underlying hypervisor via hypercalls, which are software traps from a kernel of a fully or partially paravirtualized guest VM to the hypervisor. The exploitation of a vulnerability of a hypercall handler may have severe consequences such as altering hypervisor\'s memory, which may result in the execution of malicious code with hypervisor privilege. Despite the importance of vulnerabilities of hypercall handlers, there is not much publicly available information on them. This significantly hinders advances towards securing hypercall interfaces. In this work, we provide in-depth technical information on publicly disclosed vulnerabilities of hypercall handlers. Our vulnerability analysis is based on reverse engineering the released patches fixing the considered vulnerabilities. For each analyzed vulnerability, we provide background information essential for understanding the vulnerability, and information on the vulnerable hypercall handler and the error causing the vulnerability. We also show how the vulnerability can be triggered and discuss the state of the targeted hypervisor after the vulnerability has been triggered.}','{Technical Information on Vulnerabilities of Hypercall Handlers}',0,8,2014,8,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(759,'paper','Huber2014-KIT-AutonomicPerformanceAwareResourceManagement','phdthesis','@phdthesis{Huber2014-KIT-AutonomicPerformanceAwareResourceManagement,\n author = {Nikolaus Huber},\n title = {Autonomic Performance-Aware Resource Management in Dynamic IT Service Infrastructures},\n year = {2014},\n month = {July},\n school = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\n url = {http://nbn-resolving.org/urn:nbn:de:swb:90-432462},\n pdf = {http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3234008},\n}\n\n','\n\nNikolaus Huber.\nAutonomic Performance-Aware Resource Management in Dynamic IT\nService Infrastructures.\nPhD thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, July 2014.\n[ bib | http | http  ] 
\n@phdthesis{Huber2014-KIT-AutonomicPerformanceAwareResourceManagement,\nauthor = {Nikolaus Huber},\ntitle = {Autonomic Performance-Aware Resource Management in Dynamic IT Service Infrastructures},\nyear = {2014},\nmonth = {July},\nschool = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\nurl = {http://nbn-resolving.org/urn:nbn:de:swb:90-432462},\npdf = {http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3234008}\n}\n
\n
\n','
\n@phdthesis{Huber2014-KIT-AutonomicPerformanceAwareResourceManagement,\n  author = {Nikolaus Huber},\n  title = {Autonomic Performance-Aware Resource Management in Dynamic IT Service Infrastructures},\n  year = {2014},\n  month = {July},\n  school = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\n  url = {http://nbn-resolving.org/urn:nbn:de:swb:90-432462},\n  pdf = {http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3234008}\n}\n
\n\n',NULL,'Autonomic Performance-Aware Resource Management in Dynamic IT Service Infrastructures',0,7,2014,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(760,'paper','nehmeierScan2010','article','@article{nehmeierScan2010,\n abstract = {In this paper we will discuss different realizations for an efficient interval arithmetic implementation using expression templates and template meta programming in C++. We will improve the handling of the rounding mode switches using expression templates and show how the constructed expression trees can be combined with other features like automatic differentiation. For a further improvement of the run time performance we try to move as many functionality as possible to the compile time using template meta programming techniques. In addition we will illustrate how an interval arithmetic implementation will profit from new features and keywords defined in the upcoming C++ standard.},\n year = {2012},\n issn = {0010-485X},\n journal = {Computing},\n volume = {94},\n number = {2-4},\n doi = {10.1007/s00607-011-0176-6},\n title = {Interval arithmetic using expression templates, template meta programming and the upcoming {C}++ standard},\n url = {http://dx.doi.org/10.1007/s00607-011-0176-6},\n publisher = {Springer Vienna},\n keywords = {Interval arithmetic; Automatic differentiation; Expression templates; Template meta programming; Compile time code optimization; C++; C++0x; 65G40; 65Y04; 68N15; 68N19; 68W30},\n author = {Nehmeier, Marco},\n pages = {215-228},\n language = {English},\n}\n\n','\n\nMarco Nehmeier.\nInterval arithmetic using expression templates, template meta\nprogramming and the upcoming C++ standard.\nComputing, 94(2-4):215-228, 2012, Springer Vienna.\n[ bib | DOI | http | Abstract  ] 
\n@article{nehmeierScan2010,\nabstract = {In this paper we will discuss different realizations for an efficient interval arithmetic implementation using expression templates and template meta programming in C++. We will improve the handling of the rounding mode switches using expression templates and show how the constructed expression trees can be combined with other features like automatic differentiation. For a further improvement of the run time performance we try to move as many functionality as possible to the compile time using template meta programming techniques. In addition we will illustrate how an interval arithmetic implementation will profit from new features and keywords defined in the upcoming C++ standard.},\nyear = {2012},\nissn = {0010-485X},\njournal = {Computing},\nvolume = {94},\nnumber = {2-4},\ndoi = {10.1007/s00607-011-0176-6},\ntitle = {Interval arithmetic using expression templates, template meta programming and the upcoming {C}++ standard},\nurl = {http://dx.doi.org/10.1007/s00607-011-0176-6},\npublisher = {Springer Vienna},\nkeywords = {Interval arithmetic; Automatic differentiation; Expression templates; Template meta programming; Compile time code optimization; C++; C++0x; 65G40; 65Y04; 68N15; 68N19; 68W30},\nauthor = {Nehmeier, Marco},\npages = {215-228},\nlanguage = {English}\n}\n
\n
\nIn this paper we will discuss different realizations for an efficient interval arithmetic implementation using expression templates and template meta programming in C++. We will improve the handling of the rounding mode switches using expression templates and show how the constructed expression trees can be combined with other features like automatic differentiation. For a further improvement of the run time performance we try to move as many functionality as possible to the compile time using template meta programming techniques. In addition we will illustrate how an interval arithmetic implementation will profit from new features and keywords defined in the upcoming C++ standard.\n
\n','
\n@article{nehmeierScan2010,\n  abstract = {In this paper we will discuss different realizations for an efficient interval arithmetic implementation using expression templates and template meta programming in C++. We will improve the handling of the rounding mode switches using expression templates and show how the constructed expression trees can be combined with other features like automatic differentiation. For a further improvement of the run time performance we try to move as many functionality as possible to the compile time using template meta programming techniques. In addition we will illustrate how an interval arithmetic implementation will profit from new features and keywords defined in the upcoming C++ standard.},\n  year = {2012},\n  issn = {0010-485X},\n  journal = {Computing},\n  volume = {94},\n  number = {2-4},\n  doi = {10.1007/s00607-011-0176-6},\n  title = {Interval arithmetic using expression templates, template meta programming and the upcoming {C}++ standard},\n  url = {http://dx.doi.org/10.1007/s00607-011-0176-6},\n  publisher = {Springer Vienna},\n  keywords = {Interval arithmetic; Automatic differentiation; Expression templates; Template meta programming; Compile time code optimization; C++; C++0x; 65G40; 65Y04; 68N15; 68N19; 68W30},\n  author = {Nehmeier, Marco},\n  pages = {215-228},\n  language = {English}\n}\n
\n\n','In this paper we will discuss different realizations for an efficient interval arithmetic implementation using expression templates and template meta programming in C++. We will improve the handling of the rounding mode switches using expression templates and show how the constructed expression trees can be combined with other features like automatic differentiation. For a further improvement of the run time performance we try to move as many functionality as possible to the compile time using template meta programming techniques. In addition we will illustrate how an interval arithmetic implementation will profit from new features and keywords defined in the upcoming C++ standard.','Interval arithmetic using expression templates, template meta programming and the upcoming {C}++ standard',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(761,'paper','nehmeierPara2012','incollection','@incollection{nehmeierPara2012,\n abstract = {In this paper we discuss a parallel variant of the interval Newton method for root finding of non linear continuously differentiable functions on the CUDA architecture. For this purpose we have investigated different dynamic load balancing methods to get an evenly balanced workload during the parallel computation. We tested the functionality, correctness and performance of our implementation in different case studies and compared it with other implementations.},\n year = {2013},\n isbn = {978-3-642-36802-8},\n booktitle = {Applied Parallel and Scientific Computing},\n volume = {7782},\n series = {Lecture Notes in Computer Science},\n editor = {Manninen, Pekka and \\\"Oster, Per},\n doi = {10.1007/978-3-642-36803-5_34},\n title = {{P}arallel {I}nterval {N}ewton {M}ethod on {CUDA}},\n url = {http://dx.doi.org/10.1007/978-3-642-36803-5_34},\n publisher = {Springer Berlin Heidelberg},\n keywords = {Interval arithmetic; Interval Newton method; Parallel computing; Load balancing; CUDA; GPGPU},\n author = {Beck, Philip-Daniel and Nehmeier, Marco},\n pages = {454-464},\n language = {English},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/761.pdf},\n}\n\n','\n\nPhilip-Daniel Beck and Marco Nehmeier.\nParallel Interval Newton Method on CUDA.\nIn Applied Parallel and Scientific Computing, Pekka Manninen\nand Per Öster, editors, volume 7782 of Lecture Notes in Computer\nScience, pages 454-464. Springer Berlin Heidelberg, 2013.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@incollection{nehmeierPara2012,\nabstract = {In this paper we discuss a parallel variant of the interval Newton method for root finding of non linear continuously differentiable functions on the CUDA architecture. For this purpose we have investigated different dynamic load balancing methods to get an evenly balanced workload during the parallel computation. We tested the functionality, correctness and performance of our implementation in different case studies and compared it with other implementations.},\nyear = {2013},\nisbn = {978-3-642-36802-8},\nbooktitle = {Applied Parallel and Scientific Computing},\nvolume = {7782},\nseries = {Lecture Notes in Computer Science},\neditor = {Manninen, Pekka and \\\"Oster, Per},\ndoi = {10.1007/978-3-642-36803-5_34},\ntitle = {{P}arallel {I}nterval {N}ewton {M}ethod on {CUDA}},\nurl = {http://dx.doi.org/10.1007/978-3-642-36803-5_34},\npublisher = {Springer Berlin Heidelberg},\nkeywords = {Interval arithmetic; Interval Newton method; Parallel computing; Load balancing; CUDA; GPGPU},\nauthor = {Beck, Philip-Daniel and Nehmeier, Marco},\npages = {454-464},\nlanguage = {English},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/761.pdf}\n}\n
\n
\nIn this paper we discuss a parallel variant of the interval Newton method for root finding of non linear continuously differentiable functions on the CUDA architecture. For this purpose we have investigated different dynamic load balancing methods to get an evenly balanced workload during the parallel computation. We tested the functionality, correctness and performance of our implementation in different case studies and compared it with other implementations.\n
\n','
\n@incollection{nehmeierPara2012,\n  abstract = {In this paper we discuss a parallel variant of the interval Newton method for root finding of non linear continuously differentiable functions on the CUDA architecture. For this purpose we have investigated different dynamic load balancing methods to get an evenly balanced workload during the parallel computation. We tested the functionality, correctness and performance of our implementation in different case studies and compared it with other implementations.},\n  year = {2013},\n  isbn = {978-3-642-36802-8},\n  booktitle = {Applied Parallel and Scientific Computing},\n  volume = {7782},\n  series = {Lecture Notes in Computer Science},\n  editor = {Manninen, Pekka and \\\"Oster, Per},\n  doi = {10.1007/978-3-642-36803-5_34},\n  title = {{P}arallel {I}nterval {N}ewton {M}ethod on {CUDA}},\n  url = {http://dx.doi.org/10.1007/978-3-642-36803-5_34},\n  publisher = {Springer Berlin Heidelberg},\n  keywords = {Interval arithmetic; Interval Newton method; Parallel computing; Load balancing; CUDA; GPGPU},\n  author = {Beck, Philip-Daniel and Nehmeier, Marco},\n  pages = {454-464},\n  language = {English},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/761.pdf}\n}\n
\n\n','In this paper we discuss a parallel variant of the interval Newton method for root finding of non linear continuously differentiable functions on the CUDA architecture. For this purpose we have investigated different dynamic load balancing methods to get an evenly balanced workload during the parallel computation. We tested the functionality, correctness and performance of our implementation in different case studies and compared it with other implementations.','{P}arallel {I}nterval {N}ewton {M}ethod on {CUDA}',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(762,'paper','nehmeierPPAM2011','incollection','@incollection{nehmeierPPAM2011,\n abstract = {In this paper we discuss the interaction of expression templates with OpenCL devices. We show how the expression tree of expression templates can be used to generate problem specific OpenCL kernels. In a second approach we use expression templates to optimize the data transfer between the host and the device which leads to a measurable performance increase in a domain specific language approach. We tested the functionality, correctness and performance for both implementations in a case study for vector and matrix operations.},\n year = {2012},\n isbn = {978-3-642-31499-5},\n booktitle = {Parallel Processing and Applied Mathematics},\n volume = {7204},\n series = {Lecture Notes in Computer Science},\n editor = {Wyrzykowski, Roman and Dongarra, Jack and Karczewski, Konrad and Wa\\\'sniewski, Jerzy},\n doi = {10.1007/978-3-642-31500-8_8},\n title = {{E}xpression {T}emplates and {OpenCL}},\n url = {http://dx.doi.org/10.1007/978-3-642-31500-8_8},\n publisher = {Springer Berlin Heidelberg},\n keywords = {GPGPU; OpenCL; C++; Expression templates; Domain specific language; Code generation},\n author = {Bawidamann, Uwe and Nehmeier, Marco},\n pages = {71-80},\n language = {English},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/762.pdf},\n}\n\n','\n\nUwe Bawidamann and Marco Nehmeier.\nExpression Templates and OpenCL.\nIn Parallel Processing and Applied Mathematics, Roman\nWyrzykowski, Jack Dongarra, Konrad Karczewski, and Jerzy Waśniewski,\neditors, volume 7204 of Lecture Notes in Computer Science, pages\n71-80. Springer Berlin Heidelberg, 2012.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@incollection{nehmeierPPAM2011,\nabstract = {In this paper we discuss the interaction of expression templates with OpenCL devices. We show how the expression tree of expression templates can be used to generate problem specific OpenCL kernels. In a second approach we use expression templates to optimize the data transfer between the host and the device which leads to a measurable performance increase in a domain specific language approach. We tested the functionality, correctness and performance for both implementations in a case study for vector and matrix operations.},\nyear = {2012},\nisbn = {978-3-642-31499-5},\nbooktitle = {Parallel Processing and Applied Mathematics},\nvolume = {7204},\nseries = {Lecture Notes in Computer Science},\neditor = {Wyrzykowski, Roman and Dongarra, Jack and Karczewski, Konrad and Wa\\\'sniewski, Jerzy},\ndoi = {10.1007/978-3-642-31500-8_8},\ntitle = {{E}xpression {T}emplates and {OpenCL}},\nurl = {http://dx.doi.org/10.1007/978-3-642-31500-8_8},\npublisher = {Springer Berlin Heidelberg},\nkeywords = {GPGPU; OpenCL; C++; Expression templates; Domain specific language; Code generation},\nauthor = {Bawidamann, Uwe and Nehmeier, Marco},\npages = {71-80},\nlanguage = {English},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/762.pdf}\n}\n
\n
\nIn this paper we discuss the interaction of expression templates with OpenCL devices. We show how the expression tree of expression templates can be used to generate problem specific OpenCL kernels. In a second approach we use expression templates to optimize the data transfer between the host and the device which leads to a measurable performance increase in a domain specific language approach. We tested the functionality, correctness and performance for both implementations in a case study for vector and matrix operations.\n
\n','
\n@incollection{nehmeierPPAM2011,\n  abstract = {In this paper we discuss the interaction of expression templates with OpenCL devices. We show how the expression tree of expression templates can be used to generate problem specific OpenCL kernels. In a second approach we use expression templates to optimize the data transfer between the host and the device which leads to a measurable performance increase in a domain specific language approach. We tested the functionality, correctness and performance for both implementations in a case study for vector and matrix operations.},\n  year = {2012},\n  isbn = {978-3-642-31499-5},\n  booktitle = {Parallel Processing and Applied Mathematics},\n  volume = {7204},\n  series = {Lecture Notes in Computer Science},\n  editor = {Wyrzykowski, Roman and Dongarra, Jack and Karczewski, Konrad and Wa\\\'sniewski, Jerzy},\n  doi = {10.1007/978-3-642-31500-8_8},\n  title = {{E}xpression {T}emplates and {OpenCL}},\n  url = {http://dx.doi.org/10.1007/978-3-642-31500-8_8},\n  publisher = {Springer Berlin Heidelberg},\n  keywords = {GPGPU; OpenCL; C++; Expression templates; Domain specific language; Code generation},\n  author = {Bawidamann, Uwe and Nehmeier, Marco},\n  pages = {71-80},\n  language = {English},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/762.pdf}\n}\n
\n\n','In this paper we discuss the interaction of expression templates with OpenCL devices. We show how the expression tree of expression templates can be used to generate problem specific OpenCL kernels. In a second approach we use expression templates to optimize the data transfer between the host and the device which leads to a measurable performance increase in a domain specific language approach. We tested the functionality, correctness and performance for both implementations in a case study for vector and matrix operations.','{E}xpression {T}emplates and {OpenCL}',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(763,'paper','nehmeierAD2012','incollection','@incollection{nehmeierAD2012,\n abstract = {In this paper we present a concept for a C++ implementation of forward automatic differentiation of an arbitrary order using expression templates and template metaprogramming. In contrast to other expression template implementations, the expression tree in our implementation has only symbolic characteristics. The run-time code is then generated from the tree structure using template metaprogramming functions to apply the rules of symbolic differentiation onto the single operations at compile-time. This generic approach has the advantage that the template metaprogramming functions are replaceable which offers the opportunity to easily generate different specialized algorithms. We tested the functionality, correctness and performance of a prototype in different case studies for floating point as well as interval data types and compared it against other implementations.},\n year = {2012},\n isbn = {978-3-642-30022-6},\n booktitle = {Recent Advances in Algorithmic Differentiation},\n volume = {87},\n series = {Lecture Notes in Computational Science and Engineering},\n editor = {Forth, Shaun and Hovland, Paul and Phipps, Eric and Utke, Jean and Walther, Andrea},\n doi = {10.1007/978-3-642-30023-3_24},\n title = {{G}enerative {P}rogramming for {A}utomatic {D}ifferentiation},\n url = {http://dx.doi.org/10.1007/978-3-642-30023-3_24},\n publisher = {Springer Berlin Heidelberg},\n keywords = {Automatic differentiation; Expression templates; Template metaprogramming; Generative programming; C $$++$$; C $$++$$ 11; C $$++$$ 0x},\n author = {Nehmeier, Marco},\n pages = {261-271},\n language = {English},\n}\n\n','\n\nMarco Nehmeier.\nGenerative Programming for Automatic Differentiation.\nIn Recent Advances in Algorithmic Differentiation, Shaun Forth,\nPaul Hovland, Eric Phipps, Jean Utke, and Andrea Walther, editors, volume 87\nof Lecture Notes in Computational Science and Engineering, pages\n261-271. Springer Berlin Heidelberg, 2012.\n[ bib | DOI | http | Abstract  ] 
\n@incollection{nehmeierAD2012,\nabstract = {In this paper we present a concept for a C++ implementation of forward automatic differentiation of an arbitrary order using expression templates and template metaprogramming. In contrast to other expression template implementations, the expression tree in our implementation has only symbolic characteristics. The run-time code is then generated from the tree structure using template metaprogramming functions to apply the rules of symbolic differentiation onto the single operations at compile-time. This generic approach has the advantage that the template metaprogramming functions are replaceable which offers the opportunity to easily generate different specialized algorithms. We tested the functionality, correctness and performance of a prototype in different case studies for floating point as well as interval data types and compared it against other implementations.},\nyear = {2012},\nisbn = {978-3-642-30022-6},\nbooktitle = {Recent Advances in Algorithmic Differentiation},\nvolume = {87},\nseries = {Lecture Notes in Computational Science and Engineering},\neditor = {Forth, Shaun and Hovland, Paul and Phipps, Eric and Utke, Jean and Walther, Andrea},\ndoi = {10.1007/978-3-642-30023-3_24},\ntitle = {{G}enerative {P}rogramming for {A}utomatic {D}ifferentiation},\nurl = {http://dx.doi.org/10.1007/978-3-642-30023-3_24},\npublisher = {Springer Berlin Heidelberg},\nkeywords = {Automatic differentiation; Expression templates; Template metaprogramming; Generative programming; C $$++$$; C $$++$$ 11; C $$++$$ 0x},\nauthor = {Nehmeier, Marco},\npages = {261-271},\nlanguage = {English}\n}\n
\n
\nIn this paper we present a concept for a C++ implementation of forward automatic differentiation of an arbitrary order using expression templates and template metaprogramming. In contrast to other expression template implementations, the expression tree in our implementation has only symbolic characteristics. The run-time code is then generated from the tree structure using template metaprogramming functions to apply the rules of symbolic differentiation onto the single operations at compile-time. This generic approach has the advantage that the template metaprogramming functions are replaceable which offers the opportunity to easily generate different specialized algorithms. We tested the functionality, correctness and performance of a prototype in different case studies for floating point as well as interval data types and compared it against other implementations.\n
\n','
\n@incollection{nehmeierAD2012,\n  abstract = {In this paper we present a concept for a C++ implementation of forward automatic differentiation of an arbitrary order using expression templates and template metaprogramming. In contrast to other expression template implementations, the expression tree in our implementation has only symbolic characteristics. The run-time code is then generated from the tree structure using template metaprogramming functions to apply the rules of symbolic differentiation onto the single operations at compile-time. This generic approach has the advantage that the template metaprogramming functions are replaceable which offers the opportunity to easily generate different specialized algorithms. We tested the functionality, correctness and performance of a prototype in different case studies for floating point as well as interval data types and compared it against other implementations.},\n  year = {2012},\n  isbn = {978-3-642-30022-6},\n  booktitle = {Recent Advances in Algorithmic Differentiation},\n  volume = {87},\n  series = {Lecture Notes in Computational Science and Engineering},\n  editor = {Forth, Shaun and Hovland, Paul and Phipps, Eric and Utke, Jean and Walther, Andrea},\n  doi = {10.1007/978-3-642-30023-3_24},\n  title = {{G}enerative {P}rogramming for {A}utomatic {D}ifferentiation},\n  url = {http://dx.doi.org/10.1007/978-3-642-30023-3_24},\n  publisher = {Springer Berlin Heidelberg},\n  keywords = {Automatic differentiation; Expression templates; Template metaprogramming; Generative programming; C $$++$$; C $$++$$ 11; C $$++$$ 0x},\n  author = {Nehmeier, Marco},\n  pages = {261-271},\n  language = {English}\n}\n
\n\n','In this paper we present a concept for a C++ implementation of forward automatic differentiation of an arbitrary order using expression templates and template metaprogramming. In contrast to other expression template implementations, the expression tree in our implementation has only symbolic characteristics. The run-time code is then generated from the tree structure using template metaprogramming functions to apply the rules of symbolic differentiation onto the single operations at compile-time. This generic approach has the advantage that the template metaprogramming functions are replaceable which offers the opportunity to easily generate different specialized algorithms. We tested the functionality, correctness and performance of a prototype in different case studies for floating point as well as interval data types and compared it against other implementations.','{G}enerative {P}rogramming for {A}utomatic {D}ifferentiation',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(764,'paper','nehmeierWiener2014','inproceedings','@inproceedings{nehmeierWiener2014,\n abstract = {In 2008 the IEEE interval standard working group P1788 has been founded to enlarge the acceptance of interval arithmetic. One of the main challenges for the working group was to cope with different approaches of interval arithmetic. Such as set based interval arithmetic or modal interval arithmetic, which have been developed during the last 50 years. For this reason a concept called flavors is defined by the standard. The concept specifies the behavior of the operations. Additionally, a so called decoration system is introduced to treat mathematical events like discontinuity or undefinedness of an expression for a given interval box. The C++ library libieeep1788 tries to implement all features of the tentative interval standard in a clear and straightforward manner. The main goal is to have a faithful reference implementation of the standard and not to use dubious optimizations and hacks. The main design concept of the library is to map the flavors concept one-to-one onto the implementation. To achieve this requirement the so called policy based class design is used. In this paper we will present the key concepts of the faithful C++ library libieeep1788 which will be accompanied by an overview of the preliminary IEEE P1788 interval standard.},\n author = {Nehmeier, Marco},\n booktitle = {Norbert Wiener in the 21st Century (21CW), 2014 IEEE Conference on},\n title = {libieeep1788: {A} {C++} {I}mplementation of the {IEEE} interval standard {P1788}},\n year = {2014},\n month = {June},\n pages = {1-6},\n doi = {10.1109/NORBERT.2014.6893854},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/764.pdf},\n}\n\n','\n\nMarco Nehmeier.\nlibieeep1788: A C++ Implementation of the IEEE interval\nstandard P1788.\nIn Norbert Wiener in the 21st Century (21CW), 2014 IEEE\nConference on, June 2014, pages 1-6.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{nehmeierWiener2014,\nabstract = {In 2008 the IEEE interval standard working group P1788 has been founded to enlarge the acceptance of interval arithmetic. One of the main challenges for the working group was to cope with different approaches of interval arithmetic. Such as set based interval arithmetic or modal interval arithmetic, which have been developed during the last 50 years. For this reason a concept called flavors is defined by the standard. The concept specifies the behavior of the operations. Additionally, a so called decoration system is introduced to treat mathematical events like discontinuity or undefinedness of an expression for a given interval box. The C++ library libieeep1788 tries to implement all features of the tentative interval standard in a clear and straightforward manner. The main goal is to have a faithful reference implementation of the standard and not to use dubious optimizations and hacks. The main design concept of the library is to map the flavors concept one-to-one onto the implementation. To achieve this requirement the so called policy based class design is used. In this paper we will present the key concepts of the faithful C++ library libieeep1788 which will be accompanied by an overview of the preliminary IEEE P1788 interval standard.},\nauthor = {Nehmeier, Marco},\nbooktitle = {Norbert Wiener in the 21st Century (21CW), 2014 IEEE Conference on},\ntitle = {libieeep1788: {A} {C++} {I}mplementation of the {IEEE} interval standard {P1788}},\nyear = {2014},\nmonth = {June},\npages = {1-6},\ndoi = {10.1109/NORBERT.2014.6893854},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/764.pdf}\n}\n
\n
\nIn 2008 the IEEE interval standard working group P1788 has been founded to enlarge the acceptance of interval arithmetic. One of the main challenges for the working group was to cope with different approaches of interval arithmetic. Such as set based interval arithmetic or modal interval arithmetic, which have been developed during the last 50 years. For this reason a concept called flavors is defined by the standard. The concept specifies the behavior of the operations. Additionally, a so called decoration system is introduced to treat mathematical events like discontinuity or undefinedness of an expression for a given interval box. The C++ library libieeep1788 tries to implement all features of the tentative interval standard in a clear and straightforward manner. The main goal is to have a faithful reference implementation of the standard and not to use dubious optimizations and hacks. The main design concept of the library is to map the flavors concept one-to-one onto the implementation. To achieve this requirement the so called policy based class design is used. In this paper we will present the key concepts of the faithful C++ library libieeep1788 which will be accompanied by an overview of the preliminary IEEE P1788 interval standard.\n
\n','
\n@inproceedings{nehmeierWiener2014,\n  abstract = {In 2008 the IEEE interval standard working group P1788 has been founded to enlarge the acceptance of interval arithmetic. One of the main challenges for the working group was to cope with different approaches of interval arithmetic. Such as set based interval arithmetic or modal interval arithmetic, which have been developed during the last 50 years. For this reason a concept called flavors is defined by the standard. The concept specifies the behavior of the operations. Additionally, a so called decoration system is introduced to treat mathematical events like discontinuity or undefinedness of an expression for a given interval box. The C++ library libieeep1788 tries to implement all features of the tentative interval standard in a clear and straightforward manner. The main goal is to have a faithful reference implementation of the standard and not to use dubious optimizations and hacks. The main design concept of the library is to map the flavors concept one-to-one onto the implementation. To achieve this requirement the so called policy based class design is used. In this paper we will present the key concepts of the faithful C++ library libieeep1788 which will be accompanied by an overview of the preliminary IEEE P1788 interval standard.},\n  author = {Nehmeier, Marco},\n  booktitle = {Norbert Wiener in the 21st Century (21CW), 2014 IEEE Conference on},\n  title = {libieeep1788: {A} {C++} {I}mplementation of the {IEEE} interval standard {P1788}},\n  year = {2014},\n  month = {June},\n  pages = {1-6},\n  doi = {10.1109/NORBERT.2014.6893854},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/764.pdf}\n}\n
\n\n','In 2008 the IEEE interval standard working group P1788 has been founded to enlarge the acceptance of interval arithmetic. One of the main challenges for the working group was to cope with different approaches of interval arithmetic. Such as set based interval arithmetic or modal interval arithmetic, which have been developed during the last 50 years. For this reason a concept called flavors is defined by the standard. The concept specifies the behavior of the operations. Additionally, a so called decoration system is introduced to treat mathematical events like discontinuity or undefinedness of an expression for a given interval box. The C++ library libieeep1788 tries to implement all features of the tentative interval standard in a clear and straightforward manner. The main goal is to have a faithful reference implementation of the standard and not to use dubious optimizations and hacks. The main design concept of the library is to map the flavors concept one-to-one onto the implementation. To achieve this requirement the so called policy based class design is used. In this paper we will present the key concepts of the faithful C++ library libieeep1788 which will be accompanied by an overview of the preliminary IEEE P1788 interval standard.','libieeep1788: {A} {C++} {I}mplementation of the {IEEE} interval standard {P1788}',0,6,2014,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 10:29:18',0),(765,'paper','nehmeierTR483','techreport','@techreport{nehmeierTR483,\n abstract = {The computation of the first or higher derivatives of a function is a common problem in scientific computing. The most obvious approach to compute the derivative values is the symbolic differentiation which applies the well known rules of differentiation onto the expression to compute a formal expression of the derivative function. Another method called numerical differentiation is the approximation of the derivative with difference quotients. Superior to these approaches is the automatic differentiation which is a technique to compute a value of the expression and the derivative together by applying the well known rules of differentiation. The difference to symbolic differentiation is that it propagates numerical values instead of formal expressions. Commonly used implementations of automatic differentiation may be divided into two categories, the implementations using operator overloading to compute the values of the function and the derivative together in contrast to special tools applying the technique of source transformation to mix in the expressions to compute the derivatives. Both of these techniques are somehow inflexible in the manner that the operators are not overloaded for high order differentiation or additional tools are required for the source transformation. In this paper we use expression templates and template meta programming to mix in the code for the partial differentiation. The main concept is to apply the symbolic differentiation at compile time only onto the single operations of the expression tree to create the run time code for the automatic differentiation. This has two advantages, we can, in theory, compute derivatives of any order and secondly the differentiation of the operations is done with types. This means that the symbolic differentiation of an operation with a specified order is performed only once by the compiler. Our generic approach provides a domain specific language for partial automatic differentiation of an arbitrary order which is easily extendable by new types. Several C++ and especially C++0x template programming concepts and techniques like variadic templates, type lists or variadic tuples are used to realize the specification of the automatic differentiation at compile time. Common template meta programming techniques are refined. We tested the functionality, correctness and performance of our implementation in different case studies for floating point as well as interval data types and compared it against other implementations.},\n author = {Nehmeier, Marco},\n institution = {Department of Computer Science, University of W\\\"urzburg},\n month = {December},\n number = {483},\n title = {{G}enerative {P}rogramming for {A}utomatic {D}ifferentiation in {C++0x}},\n url = {http://wwwi2.informatik.uni-wuerzburg.de/publications/TRnehmeier11MetaDiff.pdf},\n year = {2011},\n}\n\n','\n\nMarco Nehmeier.\nGenerative Programming for Automatic Differentiation in\nC++0x.\nTechnical Report 483, Department of Computer Science, University of\nWürzburg, December 2011.\n[ bib | .pdf | Abstract  ] 
\n@techreport{nehmeierTR483,\nabstract = {The computation of the first or higher derivatives of a function is a common problem in scientific computing. The most obvious approach to compute the derivative values is the symbolic differentiation which applies the well known rules of differentiation onto the expression to compute a formal expression of the derivative function. Another method called numerical differentiation is the approximation of the derivative with difference quotients. Superior to these approaches is the automatic differentiation which is a technique to compute a value of the expression and the derivative together by applying the well known rules of differentiation. The difference to symbolic differentiation is that it propagates numerical values instead of formal expressions. Commonly used implementations of automatic differentiation may be divided into two categories, the implementations using operator overloading to compute the values of the function and the derivative together in contrast to special tools applying the technique of source transformation to mix in the expressions to compute the derivatives. Both of these techniques are somehow inflexible in the manner that the operators are not overloaded for high order differentiation or additional tools are required for the source transformation. In this paper we use expression templates and template meta programming to mix in the code for the partial differentiation. The main concept is to apply the symbolic differentiation at compile time only onto the single operations of the expression tree to create the run time code for the automatic differentiation. This has two advantages, we can, in theory, compute derivatives of any order and secondly the differentiation of the operations is done with types. This means that the symbolic differentiation of an operation with a specified order is performed only once by the compiler. Our generic approach provides a domain specific language for partial automatic differentiation of an arbitrary order which is easily extendable by new types. Several C++ and especially C++0x template programming concepts and techniques like variadic templates, type lists or variadic tuples are used to realize the specification of the automatic differentiation at compile time. Common template meta programming techniques are refined. We tested the functionality, correctness and performance of our implementation in different case studies for floating point as well as interval data types and compared it against other implementations.},\nauthor = {Nehmeier, Marco},\ninstitution = {Department of Computer Science, University of W\\\"urzburg},\nmonth = {December},\nnumber = {483},\ntitle = {{G}enerative {P}rogramming for {A}utomatic {D}ifferentiation in {C++0x}},\nurl = {http://wwwi2.informatik.uni-wuerzburg.de/publications/TRnehmeier11MetaDiff.pdf},\nyear = {2011}\n}\n
\n
\nThe computation of the first or higher derivatives of a function is a common problem in scientific computing. The most obvious approach to compute the derivative values is the symbolic differentiation which applies the well known rules of differentiation onto the expression to compute a formal expression of the derivative function. Another method called numerical differentiation is the approximation of the derivative with difference quotients. Superior to these approaches is the automatic differentiation which is a technique to compute a value of the expression and the derivative together by applying the well known rules of differentiation. The difference to symbolic differentiation is that it propagates numerical values instead of formal expressions. Commonly used implementations of automatic differentiation may be divided into two categories, the implementations using operator overloading to compute the values of the function and the derivative together in contrast to special tools applying the technique of source transformation to mix in the expressions to compute the derivatives. Both of these techniques are somehow inflexible in the manner that the operators are not overloaded for high order differentiation or additional tools are required for the source transformation. In this paper we use expression templates and template meta programming to mix in the code for the partial differentiation. The main concept is to apply the symbolic differentiation at compile time only onto the single operations of the expression tree to create the run time code for the automatic differentiation. This has two advantages, we can, in theory, compute derivatives of any order and secondly the differentiation of the operations is done with types. This means that the symbolic differentiation of an operation with a specified order is performed only once by the compiler. Our generic approach provides a domain specific language for partial automatic differentiation of an arbitrary order which is easily extendable by new types. Several C++ and especially C++0x template programming concepts and techniques like variadic templates, type lists or variadic tuples are used to realize the specification of the automatic differentiation at compile time. Common template meta programming techniques are refined. We tested the functionality, correctness and performance of our implementation in different case studies for floating point as well as interval data types and compared it against other implementations.\n
\n','
\n@techreport{nehmeierTR483,\n  abstract = {The computation of the first or higher derivatives of a function is a common problem in scientific computing. The most obvious approach to compute the derivative values is the symbolic differentiation which applies the well known rules of differentiation onto the expression to compute a formal expression of the derivative function. Another method called numerical differentiation is the approximation of the derivative with difference quotients. Superior to these approaches is the automatic differentiation which is a technique to compute a value of the expression and the derivative together by applying the well known rules of differentiation. The difference to symbolic differentiation is that it propagates numerical values instead of formal expressions. Commonly used implementations of automatic differentiation may be divided into two categories, the implementations using operator overloading to compute the values of the function and the derivative together in contrast to special tools applying the technique of source transformation to mix in the expressions to compute the derivatives. Both of these techniques are somehow inflexible in the manner that the operators are not overloaded for high order differentiation or additional tools are required for the source transformation. In this paper we use expression templates and template meta programming to mix in the code for the partial differentiation. The main concept is to apply the symbolic differentiation at compile time only onto the single operations of the expression tree to create the run time code for the automatic differentiation. This has two advantages, we can, in theory, compute derivatives of any order and secondly the differentiation of the operations is done with types. This means that the symbolic differentiation of an operation with a specified order is performed only once by the compiler. Our generic approach provides a domain specific language for partial automatic differentiation of an arbitrary order which is easily extendable by new types. Several C++ and especially C++0x template programming concepts and techniques like variadic templates, type lists or variadic tuples are used to realize the specification of the automatic differentiation at compile time. Common template meta programming techniques are refined. We tested the functionality, correctness and performance of our implementation in different case studies for floating point as well as interval data types and compared it against other implementations.},\n  author = {Nehmeier, Marco},\n  institution = {Department of Computer Science, University of W\\\"urzburg},\n  month = {December},\n  number = {483},\n  title = {{G}enerative {P}rogramming for {A}utomatic {D}ifferentiation in {C++0x}},\n  url = {http://wwwi2.informatik.uni-wuerzburg.de/publications/TRnehmeier11MetaDiff.pdf},\n  year = {2011}\n}\n
\n\n','The computation of the first or higher derivatives of a function is a common problem in scientific computing. The most obvious approach to compute the derivative values is the symbolic differentiation which applies the well known rules of differentiation onto the expression to compute a formal expression of the derivative function. Another method called numerical differentiation is the approximation of the derivative with difference quotients. Superior to these approaches is the automatic differentiation which is a technique to compute a value of the expression and the derivative together by applying the well known rules of differentiation. The difference to symbolic differentiation is that it propagates numerical values instead of formal expressions. Commonly used implementations of automatic differentiation may be divided into two categories, the implementations using operator overloading to compute the values of the function and the derivative together in contrast to special tools applying the technique of source transformation to mix in the expressions to compute the derivatives. Both of these techniques are somehow inflexible in the manner that the operators are not overloaded for high order differentiation or additional tools are required for the source transformation. In this paper we use expression templates and template meta programming to mix in the code for the partial differentiation. The main concept is to apply the symbolic differentiation at compile time only onto the single operations of the expression tree to create the run time code for the automatic differentiation. This has two advantages, we can, in theory, compute derivatives of any order and secondly the differentiation of the operations is done with types. This means that the symbolic differentiation of an operation with a specified order is performed only once by the compiler. Our generic approach provides a domain specific language for partial automatic differentiation of an arbitrary order which is easily extendable by new types. Several C++ and especially C++0x template programming concepts and techniques like variadic templates, type lists or variadic tuples are used to realize the specification of the automatic differentiation at compile time. Common template meta programming techniques are refined. We tested the functionality, correctness and performance of our implementation in different case studies for floating point as well as interval data types and compared it against other implementations.','{G}enerative {P}rogramming for {A}utomatic {D}ifferentiation in {C++0x}',0,12,2011,12,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(766,'paper','nehmeierTR476','techreport','@techreport{nehmeierTR476,\n abstract = {In this paper we start with the definition of the interval overlapping relation showing the 13 different cases that may occur when to compare two non-empty intervals. This paper serves 2 purposes: 1. to define a solid foundation for interval comparisons and lattice operations 2. to provide an advanced interface for language embedding and application programs.},\n institution = {Department of Computer Science, University of W\\\"urzburg},\n author = {Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\n month = {September},\n number = {476},\n pdf = {http://wwwi2.informatik.uni-wuerzburg.de/publications/tr476.pdf},\n title = {{I}nterval {C}omparisons and {L}attice {O}perations based on the {I}nterval {O}verlapping {R}elation},\n type = {Technical Report},\n year = {2010},\n}\n\n','\n\nMarco Nehmeier and Jürgen Wolff von Gudenberg.\nInterval Comparisons and Lattice Operations based on the\nInterval Overlapping Relation.\nTechnical Report 476, Department of Computer Science, University of\nWürzburg, September 2010.\n[ bib | .pdf | Abstract  ] 
\n@techreport{nehmeierTR476,\nabstract = {In this paper we start with the definition of the interval overlapping relation showing the 13 different cases that may occur when to compare two non-empty intervals. This paper serves 2 purposes: 1. to define a solid foundation for interval comparisons and lattice operations 2. to provide an advanced interface for language embedding and application programs.},\ninstitution = {Department of Computer Science, University of W\\\"urzburg},\nauthor = {Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\nmonth = {September},\nnumber = {476},\npdf = {http://wwwi2.informatik.uni-wuerzburg.de/publications/tr476.pdf},\ntitle = {{I}nterval {C}omparisons and {L}attice {O}perations based on the {I}nterval {O}verlapping {R}elation},\ntype = {Technical Report},\nyear = {2010}\n}\n
\n
\nIn this paper we start with the definition of the interval overlapping relation showing the 13 different cases that may occur when to compare two non-empty intervals. This paper serves 2 purposes: 1. to define a solid foundation for interval comparisons and lattice operations 2. to provide an advanced interface for language embedding and application programs.\n
\n','
\n@techreport{nehmeierTR476,\n  abstract = {In this paper we start with the definition of the interval overlapping relation showing the 13 different cases that may occur when to compare two non-empty intervals. This paper serves 2 purposes: 1. to define a solid foundation for interval comparisons and lattice operations 2. to provide an advanced interface for language embedding and application programs.},\n  institution = {Department of Computer Science, University of W\\\"urzburg},\n  author = {Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\n  month = {September},\n  number = {476},\n  pdf = {http://wwwi2.informatik.uni-wuerzburg.de/publications/tr476.pdf},\n  title = {{I}nterval {C}omparisons and {L}attice {O}perations based on the {I}nterval {O}verlapping {R}elation},\n  type = {Technical Report},\n  year = {2010}\n}\n
\n\n','In this paper we start with the definition of the interval overlapping relation showing the 13 different cases that may occur when to compare two non-empty intervals. This paper serves 2 purposes: 1. to define a solid foundation for interval comparisons and lattice operations 2. to provide an advanced interface for language embedding and application programs.','{I}nterval {C}omparisons and {L}attice {O}perations based on the {I}nterval {O}verlapping {R}elation',0,9,2010,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(767,'paper','nehmeierDA','mastersthesis','@mastersthesis{nehmeierDA,\n abstract = {Im Bereich des wissenschaftlichen Rechnens st\\\"o{ss}t die Intervallarithmetik in den letzten Jahren auf immer mehr Akzeptanz. Eigenschaften, wie das sichere Einschlie{ss}en der Ergebnisse bei der Intervallauswertung, machen sie zu einem guten Mittel um mit den Rundungsfehlern der Gleitkommazahlen umzugehen. Auch k\\\"onnen Berechnungen auf Wertemengen mit garantierten Grenzen durchgef\\\"uhrt werden. Ebenso wird in Anwendungsgebieten wie der globalen Optimierung mittels \"Branch and Bound\" Algorithmen, der Robotik oder der Computergraphik die Intervallrechnung mit Erfolg eingesetzt. Im Gegensatz zu der vom \"Institute of Electrical and Electronics Engineers\" IEEE standardisierten Gleitkommaarithmetik, existiert f\"ur die Intervallrechnung jedoch keine Norm oder Implementierungsvorschrift. Viele verschiedene Implementierungen und Konzepte wurden \\\"uber die Jahre entwickelt und auch eingesetzt. Eine einheitliche Semantik wie bei den Gleitkommazahlen ist jedoch nicht gegeben. Um die Unterst\"utzung der Intervallarithmetik auf Rechnern zu verbessern, aber auch um die Akzeptanz bei Benutzern weiter zu erh\\\"ohen wird aktuell an einem IEEE Standard f\\\"ur Intervallrechnung gearbeitet. Diese Diplomarbeit besch\\\"aftigt sich mit den M\"oglichkeiten einer effizienten Implementierung der Intervallarithmetik auf Computersystemen mittels der Programmiersprache C++.},\n author = {Nehmeier, Marco},\n month = {},\n school = {Lehrstuhl f\\\"ur Informatik 2, Universit\\\"at W\\\"urzburg},\n title = {{E}ffiziente {I}ntervallarithmetik mit {C++}},\n type = {Diplomarbeit},\n url = {http://wwwi2.informatik.uni-wuerzburg.de/publications/daNehmeier09.pdf},\n year = {2009},\n}\n\n','\n\nMarco Nehmeier.\nEffiziente Intervallarithmetik mit C++.\nDiplomarbeit, Lehrstuhl für Informatik 2, Universität Würzburg,\n2009.\n[ bib | .pdf | Abstract  ] 
\n@mastersthesis{nehmeierDA,\nabstract = {Im Bereich des wissenschaftlichen Rechnens st\\\"o{ss}t die Intervallarithmetik in den letzten Jahren auf immer mehr Akzeptanz. Eigenschaften, wie das sichere Einschlie{ss}en der Ergebnisse bei der Intervallauswertung, machen sie zu einem guten Mittel um mit den Rundungsfehlern der Gleitkommazahlen umzugehen. Auch k\\\"onnen Berechnungen auf Wertemengen mit garantierten Grenzen durchgef\\\"uhrt werden. Ebenso wird in Anwendungsgebieten wie der globalen Optimierung mittels \"Branch and Bound\" Algorithmen, der Robotik oder der Computergraphik die Intervallrechnung mit Erfolg eingesetzt. Im Gegensatz zu der vom \"Institute of Electrical and Electronics Engineers\" IEEE standardisierten Gleitkommaarithmetik, existiert f\"ur die Intervallrechnung jedoch keine Norm oder Implementierungsvorschrift. Viele verschiedene Implementierungen und Konzepte wurden \\\"uber die Jahre entwickelt und auch eingesetzt. Eine einheitliche Semantik wie bei den Gleitkommazahlen ist jedoch nicht gegeben. Um die Unterst\"utzung der Intervallarithmetik auf Rechnern zu verbessern, aber auch um die Akzeptanz bei Benutzern weiter zu erh\\\"ohen wird aktuell an einem IEEE Standard f\\\"ur Intervallrechnung gearbeitet. Diese Diplomarbeit besch\\\"aftigt sich mit den M\"oglichkeiten einer effizienten Implementierung der Intervallarithmetik auf Computersystemen mittels der Programmiersprache C++.},\nauthor = {Nehmeier, Marco},\nmonth = {},\nschool = {Lehrstuhl f\\\"ur Informatik 2, Universit\\\"at W\\\"urzburg},\ntitle = {{E}ffiziente {I}ntervallarithmetik mit {C++}},\ntype = {Diplomarbeit},\nurl = {http://wwwi2.informatik.uni-wuerzburg.de/publications/daNehmeier09.pdf},\nyear = {2009}\n}\n
\n
\nIm Bereich des wissenschaftlichen Rechnens stösst die Intervallarithmetik in den letzten Jahren auf immer mehr Akzeptanz. Eigenschaften, wie das sichere Einschliessen der Ergebnisse bei der Intervallauswertung, machen sie zu einem guten Mittel um mit den Rundungsfehlern der Gleitkommazahlen umzugehen. Auch können Berechnungen auf Wertemengen mit garantierten Grenzen durchgeführt werden. Ebenso wird in Anwendungsgebieten wie der globalen Optimierung mittels \"Branch and Bound\" Algorithmen, der Robotik oder der Computergraphik die Intervallrechnung mit Erfolg eingesetzt. Im Gegensatz zu der vom \"Institute of Electrical and Electronics Engineers\" IEEE standardisierten Gleitkommaarithmetik, existiert f\"ur die Intervallrechnung jedoch keine Norm oder Implementierungsvorschrift. Viele verschiedene Implementierungen und Konzepte wurden über die Jahre entwickelt und auch eingesetzt. Eine einheitliche Semantik wie bei den Gleitkommazahlen ist jedoch nicht gegeben. Um die Unterst\"utzung der Intervallarithmetik auf Rechnern zu verbessern, aber auch um die Akzeptanz bei Benutzern weiter zu erhöhen wird aktuell an einem IEEE Standard für Intervallrechnung gearbeitet. Diese Diplomarbeit beschäftigt sich mit den M\"oglichkeiten einer effizienten Implementierung der Intervallarithmetik auf Computersystemen mittels der Programmiersprache C++.\n
\n','
\n@mastersthesis{nehmeierDA,\n  abstract = {Im Bereich des wissenschaftlichen Rechnens st\\\"o{ss}t die Intervallarithmetik in den letzten Jahren auf immer mehr Akzeptanz. Eigenschaften, wie das sichere Einschlie{ss}en der Ergebnisse bei der Intervallauswertung, machen sie zu einem guten Mittel um mit den Rundungsfehlern der Gleitkommazahlen umzugehen. Auch k\\\"onnen Berechnungen auf Wertemengen mit garantierten Grenzen durchgef\\\"uhrt werden. Ebenso wird in Anwendungsgebieten wie der globalen Optimierung mittels \"Branch and Bound\" Algorithmen, der Robotik oder der Computergraphik die Intervallrechnung mit Erfolg eingesetzt. Im Gegensatz zu der vom \"Institute of Electrical and Electronics Engineers\" IEEE standardisierten Gleitkommaarithmetik, existiert f\"ur die Intervallrechnung jedoch keine Norm oder Implementierungsvorschrift. Viele verschiedene Implementierungen und Konzepte wurden \\\"uber die Jahre entwickelt und auch eingesetzt. Eine einheitliche Semantik wie bei den Gleitkommazahlen ist jedoch nicht gegeben. Um die Unterst\"utzung der Intervallarithmetik auf Rechnern zu verbessern, aber auch um die Akzeptanz bei Benutzern weiter zu erh\\\"ohen wird aktuell an einem IEEE Standard f\\\"ur Intervallrechnung gearbeitet. Diese Diplomarbeit besch\\\"aftigt sich mit den M\"oglichkeiten einer effizienten Implementierung der Intervallarithmetik auf Computersystemen mittels der Programmiersprache C++.},\n  author = {Nehmeier, Marco},\n  month = {},\n  school = {Lehrstuhl f\\\"ur Informatik 2, Universit\\\"at W\\\"urzburg},\n  title = {{E}ffiziente {I}ntervallarithmetik mit {C++}},\n  type = {Diplomarbeit},\n  url = {http://wwwi2.informatik.uni-wuerzburg.de/publications/daNehmeier09.pdf},\n  year = {2009}\n}\n
\n\n','Im Bereich des wissenschaftlichen Rechnens st\\\"o{ss}t die Intervallarithmetik in den letzten Jahren auf immer mehr Akzeptanz. Eigenschaften, wie das sichere Einschlie{ss}en der Ergebnisse bei der Intervallauswertung, machen sie zu einem guten Mittel um mit den Rundungsfehlern der Gleitkommazahlen umzugehen. Auch k\\\"onnen Berechnungen auf Wertemengen mit garantierten Grenzen durchgef\\\"uhrt werden. Ebenso wird in Anwendungsgebieten wie der globalen Optimierung mittels \"Branch and Bound\" Algorithmen, der Robotik oder der Computergraphik die Intervallrechnung mit Erfolg eingesetzt. Im Gegensatz zu der vom \"Institute of Electrical and Electronics Engineers\" IEEE standardisierten Gleitkommaarithmetik, existiert f\"ur die Intervallrechnung jedoch keine Norm oder Implementierungsvorschrift. Viele verschiedene Implementierungen und Konzepte wurden \\\"uber die Jahre entwickelt und auch eingesetzt. Eine einheitliche Semantik wie bei den Gleitkommazahlen ist jedoch nicht gegeben. Um die Unterst\"utzung der Intervallarithmetik auf Rechnern zu verbessern, aber auch um die Akzeptanz bei Benutzern weiter zu erh\\\"ohen wird aktuell an einem IEEE Standard f\\\"ur Intervallrechnung gearbeitet. Diese Diplomarbeit besch\\\"aftigt sich mit den M\"oglichkeiten einer effizienten Implementierung der Intervallarithmetik auf Computersystemen mittels der Programmiersprache C++.','{E}ffiziente {I}ntervallarithmetik mit {C++}',0,0,2009,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(768,'paper','Brosig2014-KIT-OnlinePerformancePrediction','phdthesis','@phdthesis{Brosig2014-KIT-OnlinePerformancePrediction,\n author = {Fabian Brosig},\n title = {Architecture-Level Software Performance Models for Online Performance Prediction},\n year = {2014},\n month = {July},\n school = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\n url = {http://nbn-resolving.org/urn:nbn:de:swb:90-435372},\n pdf = {http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3263306},\n}\n\n','\n\nFabian Brosig.\nArchitecture-Level Software Performance Models for Online\nPerformance Prediction.\nPhD thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, July 2014.\n[ bib | http | http  ] 
\n@phdthesis{Brosig2014-KIT-OnlinePerformancePrediction,\nauthor = {Fabian Brosig},\ntitle = {Architecture-Level Software Performance Models for Online Performance Prediction},\nyear = {2014},\nmonth = {July},\nschool = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\nurl = {http://nbn-resolving.org/urn:nbn:de:swb:90-435372},\npdf = {http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3263306}\n}\n
\n
\n','
\n@phdthesis{Brosig2014-KIT-OnlinePerformancePrediction,\n  author = {Fabian Brosig},\n  title = {Architecture-Level Software Performance Models for Online Performance Prediction},\n  year = {2014},\n  month = {July},\n  school = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\n  url = {http://nbn-resolving.org/urn:nbn:de:swb:90-435372},\n  pdf = {http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3263306}\n}\n
\n\n',NULL,'Architecture-Level Software Performance Models for Online Performance Prediction',0,7,2014,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(769,'paper','RyKo-DNI-Manual-TR','techreport','@techreport{RyKo-DNI-Manual-TR,\n address = {Am Hubland, 97074 W\\\"{u}rzburg},\n author = {Piotr Rygielski and Samuel Kounev},\n institution = {Chair of Software Engineering, University of W\\\"{u}rzburg},\n month = {September},\n title = {{Descartes Network Infrastructures (DNI) Manual: Meta-models, Transformations, Examples}},\n type = {{Technical Report v.0.3}},\n year = {2014},\n url = {http://se.informatik.uni-wuerzburg.de/staff/piotr_rygielski/dni_manual/},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/769.pdf},\n abstract = {The goal of this document is to present the DNI Meta-Model, its instances, sub-meta-models, and model transformations in more details than in an usual conference or journal paper. We describe the meta-models and the transformations in details, give example of systems modeled using the meta-models, and present the transformations in a step-by-step manner.},\n}\n\n','\n\nPiotr Rygielski and Samuel Kounev.\nDescartes Network Infrastructures (DNI) Manual: Meta-models,\nTransformations, Examples.\nTechnical Report v.0.3, Chair of Software Engineering, University\nof Würzburg, Am Hubland, 97074 Würzburg, September 2014.\n[ bib | http | .pdf | Abstract  ] 
\n@techreport{RyKo-DNI-Manual-TR,\naddress = {Am Hubland, 97074 W\\\"{u}rzburg},\nauthor = {Piotr Rygielski and Samuel Kounev},\ninstitution = {Chair of Software Engineering, University of W\\\"{u}rzburg},\nmonth = {September},\ntitle = {{Descartes Network Infrastructures (DNI) Manual: Meta-models, Transformations, Examples}},\ntype = {{Technical Report v.0.3}},\nyear = {2014},\nurl = {http://se.informatik.uni-wuerzburg.de/staff/piotr_rygielski/dni_manual/},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/769.pdf},\nabstract = {The goal of this document is to present the DNI Meta-Model, its instances, sub-meta-models, and model transformations in more details than in an usual conference or journal paper. We describe the meta-models and the transformations in details, give example of systems modeled using the meta-models, and present the transformations in a step-by-step manner.}\n}\n
\n
\nThe goal of this document is to present the DNI Meta-Model, its instances, sub-meta-models, and model transformations in more details than in an usual conference or journal paper. We describe the meta-models and the transformations in details, give example of systems modeled using the meta-models, and present the transformations in a step-by-step manner.\n
\n','
\n@techreport{RyKo-DNI-Manual-TR,\n  address = {Am Hubland, 97074 W\\\"{u}rzburg},\n  author = {Piotr Rygielski and Samuel Kounev},\n  institution = {Chair of Software Engineering, University of W\\\"{u}rzburg},\n  month = {September},\n  title = {{Descartes Network Infrastructures (DNI) Manual: Meta-models, Transformations, Examples}},\n  type = {{Technical Report v.0.3}},\n  year = {2014},\n  url = {http://se.informatik.uni-wuerzburg.de/staff/piotr_rygielski/dni_manual/},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/769.pdf},\n  abstract = {The goal of this document is to present the DNI Meta-Model, its instances, sub-meta-models, and model transformations in more details than in an usual conference or journal paper. We describe the meta-models and the transformations in details, give example of systems modeled using the meta-models, and present the transformations in a step-by-step manner.}\n}\n
\n\n','The goal of this document is to present the DNI Meta-Model, its instances, sub-meta-models, and model transformations in more details than in an usual conference or journal paper. We describe the meta-models and the transformations in details, give example of systems modeled using the meta-models, and present the transformations in a step-by-step manner.','{Descartes Network Infrastructures (DNI) Manual: Meta-models, Transformations, Examples}',0,9,2014,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(770,'paper','Weber2014','mastersthesis','@mastersthesis{Weber2014,\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n abstract = {{Auto-scaling features offered by today\'s cloud infrastructures provide increased flexibility, especially for customers that experience high variations in the load intensity over time. However, auto-scaling features introduce new system quality attributes when considering their accuracy and timing. Therefore, distinguishing between different offerings has become a complex task, as it is not yet supported by reliable metrics and measurement approaches. This thesis discusses the shortcomings of existing approaches for measuring and evaluating elastic behavior and proposes a novel benchmark methodology specifically designed for evaluating the elasticity aspects of modern cloud platforms. The benchmarking concept uses open workloads with realistic load intensity profiles in order to induce resource demand variations on the benchmarked system and compares them with the actual variation of the allocated resources. To ensure a fair elasticity comparison between systems with di erent underlying hardware performance, the load intensity profiles are adjusted to induce identical resource demand variations on all compared platforms. Furthermore, this thesis proposes new metrics that capture the accuracy of resource allocations and deallocations, as well as the timing aspects of an auto-scaling mechanism, explicitly. The benchmark concept comprises four activities: The System Analysis evaluates the load processing capabilities of the benchmarked platform for different scaling stages. The Benchmark Calibration then uses the analysis results and adjusts a given load intensity profile in a system specific manner. Within the Measurement activity, the evaluated platformis exposed to a load varying ccording to the adjusted intensity profile. The final Elasticity Evaluation measures the quality of the observed elastic behavior using the proposed elasticity metrics. A java based framework for benchmarking the elasticity of IaaS cloud platforms called BUNGEE implements this concept and automates benchmarking activities. At the moment, BUNGEE allows to analyze the elasticity of CloudStack and Amazon Web Service (AWS) based clouds that scale CPU-bound virtual machines horizontally. Within an extensive evaluation, this thesis demonstrates the ability of the proposed elasticity metrics to consistently rank elastic systems on an ordinal scale. A case study that uses a realistic load profile, consisting of several millions of request submissions, exhibits the applicability of the benchmarking methodology for realistic scenarios. The case study is conducted on a private as well as on a public cloud and uses eleven different elasticity rule configurations and four instance types assigned to resources with different levels of effciency.}},\n author = {Andreas Weber},\n keywords = {Load Intensity, Benchmark, Cloud, Elasticity},\n school = {{Karlsruhe Institute of Technology (KIT)}},\n title = {{Resource Elasticity Benchmarking in Cloud Environments}},\n type = {{Master Thesis}},\n year = {2014},\n month = {August},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/770},\n pdf = {https://sdqweb.ipd.kit.edu/publications/pdfs/Weber2014.pdf},\n}\n\n','\n\nAndreas Weber.\nResource Elasticity Benchmarking in Cloud Environments.\nMaster Thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, August 2014.\n[ bib | slides | .pdf | Abstract  ] 
\n@mastersthesis{Weber2014,\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nabstract = {{Auto-scaling features offered by today\'s cloud infrastructures provide increased flexibility, especially for customers that experience high variations in the load intensity over time. However, auto-scaling features introduce new system quality attributes when considering their accuracy and timing. Therefore, distinguishing between different offerings has become a complex task, as it is not yet supported by reliable metrics and measurement approaches. This thesis discusses the shortcomings of existing approaches for measuring and evaluating elastic behavior and proposes a novel benchmark methodology specifically designed for evaluating the elasticity aspects of modern cloud platforms. The benchmarking concept uses open workloads with realistic load intensity profiles in order to induce resource demand variations on the benchmarked system and compares them with the actual variation of the allocated resources. To ensure a fair elasticity comparison between systems with di erent underlying hardware performance, the load intensity profiles are adjusted to induce identical resource demand variations on all compared platforms. Furthermore, this thesis proposes new metrics that capture the accuracy of resource allocations and deallocations, as well as the timing aspects of an auto-scaling mechanism, explicitly. The benchmark concept comprises four activities: The System Analysis evaluates the load processing capabilities of the benchmarked platform for different scaling stages. The Benchmark Calibration then uses the analysis results and adjusts a given load intensity profile in a system specific manner. Within the Measurement activity, the evaluated platformis exposed to a load varying ccording to the adjusted intensity profile. The final Elasticity Evaluation measures the quality of the observed elastic behavior using the proposed elasticity metrics. A java based framework for benchmarking the elasticity of IaaS cloud platforms called BUNGEE implements this concept and automates benchmarking activities. At the moment, BUNGEE allows to analyze the elasticity of CloudStack and Amazon Web Service (AWS) based clouds that scale CPU-bound virtual machines horizontally. Within an extensive evaluation, this thesis demonstrates the ability of the proposed elasticity metrics to consistently rank elastic systems on an ordinal scale. A case study that uses a realistic load profile, consisting of several millions of request submissions, exhibits the applicability of the benchmarking methodology for realistic scenarios. The case study is conducted on a private as well as on a public cloud and uses eleven different elasticity rule configurations and four instance types assigned to resources with different levels of effciency.}},\nauthor = {Andreas Weber},\nkeywords = {Load Intensity, Benchmark, Cloud, Elasticity},\nschool = {{Karlsruhe Institute of Technology (KIT)}},\ntitle = {{Resource Elasticity Benchmarking in Cloud Environments}},\ntype = {{Master Thesis}},\nyear = {2014},\nmonth = {August},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/770},\npdf = {https://sdqweb.ipd.kit.edu/publications/pdfs/Weber2014.pdf}\n}\n
\n
\nAuto-scaling features offered by today\'s cloud infrastructures provide increased flexibility, especially for customers that experience high variations in the load intensity over time. However, auto-scaling features introduce new system quality attributes when considering their accuracy and timing. Therefore, distinguishing between different offerings has become a complex task, as it is not yet supported by reliable metrics and measurement approaches. This thesis discusses the shortcomings of existing approaches for measuring and evaluating elastic behavior and proposes a novel benchmark methodology specifically designed for evaluating the elasticity aspects of modern cloud platforms. The benchmarking concept uses open workloads with realistic load intensity profiles in order to induce resource demand variations on the benchmarked system and compares them with the actual variation of the allocated resources. To ensure a fair elasticity comparison between systems with di erent underlying hardware performance, the load intensity profiles are adjusted to induce identical resource demand variations on all compared platforms. Furthermore, this thesis proposes new metrics that capture the accuracy of resource allocations and deallocations, as well as the timing aspects of an auto-scaling mechanism, explicitly. The benchmark concept comprises four activities: The System Analysis evaluates the load processing capabilities of the benchmarked platform for different scaling stages. The Benchmark Calibration then uses the analysis results and adjusts a given load intensity profile in a system specific manner. Within the Measurement activity, the evaluated platformis exposed to a load varying ccording to the adjusted intensity profile. The final Elasticity Evaluation measures the quality of the observed elastic behavior using the proposed elasticity metrics. A java based framework for benchmarking the elasticity of IaaS cloud platforms called BUNGEE implements this concept and automates benchmarking activities. At the moment, BUNGEE allows to analyze the elasticity of CloudStack and Amazon Web Service (AWS) based clouds that scale CPU-bound virtual machines horizontally. Within an extensive evaluation, this thesis demonstrates the ability of the proposed elasticity metrics to consistently rank elastic systems on an ordinal scale. A case study that uses a realistic load profile, consisting of several millions of request submissions, exhibits the applicability of the benchmarking methodology for realistic scenarios. The case study is conducted on a private as well as on a public cloud and uses eleven different elasticity rule configurations and four instance types assigned to resources with different levels of effciency.\n
\n','
\n@mastersthesis{Weber2014,\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  abstract = {{Auto-scaling features offered by today\'s cloud infrastructures provide increased flexibility, especially for customers that experience high variations in the load intensity over time. However, auto-scaling features introduce new system quality attributes when considering their accuracy and timing. Therefore, distinguishing between different offerings has become a complex task, as it is not yet supported by reliable metrics and measurement approaches. This thesis discusses the shortcomings of existing approaches for measuring and evaluating elastic behavior and proposes a novel benchmark methodology specifically designed for evaluating the elasticity aspects of modern cloud platforms. The benchmarking concept uses open workloads with realistic load intensity profiles in order to induce resource demand variations on the benchmarked system and compares them with the actual variation of the allocated resources. To ensure a fair elasticity comparison between systems with di erent underlying hardware performance, the load intensity profiles are adjusted to induce identical resource demand variations on all compared platforms. Furthermore, this thesis proposes new metrics that capture the accuracy of resource allocations and deallocations, as well as the timing aspects of an auto-scaling mechanism, explicitly. The benchmark concept comprises four activities: The System Analysis evaluates the load processing capabilities of the benchmarked platform for different scaling stages. The Benchmark Calibration then uses the analysis results and adjusts a given load intensity profile in a system specific manner. Within the Measurement activity, the evaluated platformis exposed to a load varying ccording to the adjusted intensity profile. The final Elasticity Evaluation measures the quality of the observed elastic behavior using the proposed elasticity metrics. A java based framework for benchmarking the elasticity of IaaS cloud platforms called BUNGEE implements this concept and automates benchmarking activities. At the moment, BUNGEE allows to analyze the elasticity of CloudStack and Amazon Web Service (AWS) based clouds that scale CPU-bound virtual machines horizontally. Within an extensive evaluation, this thesis demonstrates the ability of the proposed elasticity metrics to consistently rank elastic systems on an ordinal scale. A case study that uses a realistic load profile, consisting of several millions of request submissions, exhibits the applicability of the benchmarking methodology for realistic scenarios. The case study is conducted on a private as well as on a public cloud and uses eleven different elasticity rule configurations and four instance types assigned to resources with different levels of effciency.}},\n  author = {Andreas Weber},\n  keywords = {Load Intensity, Benchmark, Cloud, Elasticity},\n  school = {{Karlsruhe Institute of Technology (KIT)}},\n  title = {{Resource Elasticity Benchmarking in Cloud Environments}},\n  type = {{Master Thesis}},\n  year = {2014},\n  month = {August},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/770},\n  pdf = {https://sdqweb.ipd.kit.edu/publications/pdfs/Weber2014.pdf}\n}\n
\n\n','{Auto-scaling features offered by today\'s cloud infrastructures provide increased flexibility, especially for customers that experience high variations in the load intensity over time. However, auto-scaling features introduce new system quality attributes when considering their accuracy and timing. Therefore, distinguishing between different offerings has become a complex task, as it is not yet supported by reliable metrics and measurement approaches. This thesis discusses the shortcomings of existing approaches for measuring and evaluating elastic behavior and proposes a novel benchmark methodology specifically designed for evaluating the elasticity aspects of modern cloud platforms. The benchmarking concept uses open workloads with realistic load intensity profiles in order to induce resource demand variations on the benchmarked system and compares them with the actual variation of the allocated resources. To ensure a fair elasticity comparison between systems with di erent underlying hardware performance, the load intensity profiles are adjusted to induce identical resource demand variations on all compared platforms. Furthermore, this thesis proposes new metrics that capture the accuracy of resource allocations and deallocations, as well as the timing aspects of an auto-scaling mechanism, explicitly. The benchmark concept comprises four activities: The System Analysis evaluates the load processing capabilities of the benchmarked platform for different scaling stages. The Benchmark Calibration then uses the analysis results and adjusts a given load intensity profile in a system specific manner. Within the Measurement activity, the evaluated platformis exposed to a load varying ccording to the adjusted intensity profile. The final Elasticity Evaluation measures the quality of the observed elastic behavior using the proposed elasticity metrics. A java based framework for benchmarking the elasticity of IaaS cloud platforms called BUNGEE implements this concept and automates benchmarking activities. At the moment, BUNGEE allows to analyze the elasticity of CloudStack and Amazon Web Service (AWS) based clouds that scale CPU-bound virtual machines horizontally. Within an extensive evaluation, this thesis demonstrates the ability of the proposed elasticity metrics to consistently rank elastic systems on an ordinal scale. A case study that uses a realistic load profile, consisting of several millions of request submissions, exhibits the applicability of the benchmarking methodology for realistic scenarios. The case study is conducted on a private as well as on a public cloud and uses eleven different elasticity rule configurations and four instance types assigned to resources with different levels of effciency.}','{Resource Elasticity Benchmarking in Cloud Environments}',0,8,2014,8,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(771,'paper','KiHeKo2014-SOSP-LIMBO','inproceedings','@inproceedings{KiHeKo2014-SOSP-LIMBO,\n author = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Samuel Kounev},\n abstract = {{LIMBO is a tool for the creation of load profiles with variable intensity over time both from scratch and from existing data. Primarily, LIMBO\'s intended use is the description of load arrival behaviours in open workloads. Specifically, LIMBO can be employed for the creation of custom request or user arrival time-stamps or for the re-parameterization of existing traces. LIMBO bases on the Descartes Load Intensity Model (DLIM) for the formalized description of its load intensity profiles. The DLIM formalism can be understood as a structure for piece-wise defined and combined mathematical functions. We outline DLIM and its elements and demonstrate its integration within LIMBO. LIMBO is capable of generating request or user arrival time stamps from DLIM instances. In a next step, these generated time-stamps can be used for both open workload based benchmarking and simulations. The TimestampTimer plug-in for JMeter already allows the former. LIMBO also offers a range of tools for easy load intensity modeling and analysis, including, but not limited to, a visual decomposition of load intensity time-series into seasonal and trend parts, a simplified load intensity model as part of a model creation wizard, and an automated model instance extractor. As part of our LIMBO tutorial, we explain these features in detail. We demonstrate common use cases for LIMBO and show how they are supported. We also focus on LIMBOs extensible architecture and discuss how to use LIMBO as part of another tool-chain.}},\n title = {{Using and Extending LIMBO for the Descriptive Modeling of Arrival Behaviors}},\n booktitle = {Proceedings of the Symposium on Software Performance 2014},\n location = {Stuttgart, Germany},\n month = {November},\n year = {2014},\n publisher = {University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology},\n pages = {131--140},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/771.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/771},\n note = {Best Poster Award},\n}\n\n','\n\nJóakim von Kistowski, Nikolas Roman Herbst, and Samuel Kounev.\nUsing and Extending LIMBO for the Descriptive Modeling of Arrival\nBehaviors.\nIn Proceedings of the Symposium on Software Performance 2014,\nStuttgart, Germany, November 2014, pages 131-140. University of Stuttgart,\nFaculty of Computer Science, Electrical Engineering, and Information\nTechnology.\nNovember 2014, Best Poster Award.\n[ bib | slides | .pdf | Abstract  ] 
\n@inproceedings{KiHeKo2014-SOSP-LIMBO,\nauthor = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Samuel Kounev},\nabstract = {{LIMBO is a tool for the creation of load profiles with variable intensity over time both from scratch and from existing data. Primarily, LIMBO\'s intended use is the description of load arrival behaviours in open workloads. Specifically, LIMBO can be employed for the creation of custom request or user arrival time-stamps or for the re-parameterization of existing traces. LIMBO bases on the Descartes Load Intensity Model (DLIM) for the formalized description of its load intensity profiles. The DLIM formalism can be understood as a structure for piece-wise defined and combined mathematical functions. We outline DLIM and its elements and demonstrate its integration within LIMBO. LIMBO is capable of generating request or user arrival time stamps from DLIM instances. In a next step, these generated time-stamps can be used for both open workload based benchmarking and simulations. The TimestampTimer plug-in for JMeter already allows the former. LIMBO also offers a range of tools for easy load intensity modeling and analysis, including, but not limited to, a visual decomposition of load intensity time-series into seasonal and trend parts, a simplified load intensity model as part of a model creation wizard, and an automated model instance extractor. As part of our LIMBO tutorial, we explain these features in detail. We demonstrate common use cases for LIMBO and show how they are supported. We also focus on LIMBOs extensible architecture and discuss how to use LIMBO as part of another tool-chain.}},\ntitle = {{Using and Extending LIMBO for the Descriptive Modeling of Arrival Behaviors}},\nbooktitle = {Proceedings of the Symposium on Software Performance 2014},\nlocation = {Stuttgart, Germany},\nmonth = {November},\nyear = {2014},\npublisher = {University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology},\npages = {131--140},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/771.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/771},\nnote = {Best Poster Award}\n}\n
\n
\nLIMBO is a tool for the creation of load profiles with variable intensity over time both from scratch and from existing data. Primarily, LIMBO\'s intended use is the description of load arrival behaviours in open workloads. Specifically, LIMBO can be employed for the creation of custom request or user arrival time-stamps or for the re-parameterization of existing traces. LIMBO bases on the Descartes Load Intensity Model (DLIM) for the formalized description of its load intensity profiles. The DLIM formalism can be understood as a structure for piece-wise defined and combined mathematical functions. We outline DLIM and its elements and demonstrate its integration within LIMBO. LIMBO is capable of generating request or user arrival time stamps from DLIM instances. In a next step, these generated time-stamps can be used for both open workload based benchmarking and simulations. The TimestampTimer plug-in for JMeter already allows the former. LIMBO also offers a range of tools for easy load intensity modeling and analysis, including, but not limited to, a visual decomposition of load intensity time-series into seasonal and trend parts, a simplified load intensity model as part of a model creation wizard, and an automated model instance extractor. As part of our LIMBO tutorial, we explain these features in detail. We demonstrate common use cases for LIMBO and show how they are supported. We also focus on LIMBOs extensible architecture and discuss how to use LIMBO as part of another tool-chain.\n
\n','
\n@inproceedings{KiHeKo2014-SOSP-LIMBO,\n  author = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Samuel Kounev},\n  abstract = {{LIMBO is a tool for the creation of load profiles with variable intensity over time both from scratch and from existing data. Primarily, LIMBO\'s intended use is the description of load arrival behaviours in open workloads. Specifically, LIMBO can be employed for the creation of custom request or user arrival time-stamps or for the re-parameterization of existing traces. LIMBO bases on the Descartes Load Intensity Model (DLIM) for the formalized description of its load intensity profiles. The DLIM formalism can be understood as a structure for piece-wise defined and combined mathematical functions. We outline DLIM and its elements and demonstrate its integration within LIMBO. LIMBO is capable of generating request or user arrival time stamps from DLIM instances. In a next step, these generated time-stamps can be used for both open workload based benchmarking and simulations. The TimestampTimer plug-in for JMeter already allows the former. LIMBO also offers a range of tools for easy load intensity modeling and analysis, including, but not limited to, a visual decomposition of load intensity time-series into seasonal and trend parts, a simplified load intensity model as part of a model creation wizard, and an automated model instance extractor. As part of our LIMBO tutorial, we explain these features in detail. We demonstrate common use cases for LIMBO and show how they are supported. We also focus on LIMBOs extensible architecture and discuss how to use LIMBO as part of another tool-chain.}},\n  title = {{Using and Extending LIMBO for the Descriptive Modeling of Arrival Behaviors}},\n  booktitle = {Proceedings of the Symposium on Software Performance 2014},\n  location = {Stuttgart, Germany},\n  month = {November},\n  year = {2014},\n  publisher = {University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology},\n  pages = {131--140},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/771.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/771},\n  note = {Best Poster Award}\n}\n
\n\n','{LIMBO is a tool for the creation of load profiles with variable intensity over time both from scratch and from existing data. Primarily, LIMBO\'s intended use is the description of load arrival behaviours in open workloads. Specifically, LIMBO can be employed for the creation of custom request or user arrival time-stamps or for the re-parameterization of existing traces. LIMBO bases on the Descartes Load Intensity Model (DLIM) for the formalized description of its load intensity profiles. The DLIM formalism can be understood as a structure for piece-wise defined and combined mathematical functions. We outline DLIM and its elements and demonstrate its integration within LIMBO. LIMBO is capable of generating request or user arrival time stamps from DLIM instances. In a next step, these generated time-stamps can be used for both open workload based benchmarking and simulations. The TimestampTimer plug-in for JMeter already allows the former. LIMBO also offers a range of tools for easy load intensity modeling and analysis, including, but not limited to, a visual decomposition of load intensity time-series into seasonal and trend parts, a simplified load intensity model as part of a model creation wizard, and an automated model instance extractor. As part of our LIMBO tutorial, we explain these features in detail. We demonstrate common use cases for LIMBO and show how they are supported. We also focus on LIMBOs extensible architecture and discuss how to use LIMBO as part of another tool-chain.}','{Using and Extending LIMBO for the Descriptive Modeling of Arrival Behaviors}',0,11,2014,11,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(772,'paper','KiBlBeLaArKo2015-ICPE-SERT','inproceedings','@inproceedings{KiBlBeLaArKo2015-ICPE-SERT,\n author = {J\\\'{o}akim von Kistowski and Hansfried Block and John Beckett and Klaus-Dieter Lange and Jeremy A. Arnold and Samuel Kounev},\n abstract = {{ Energy efficiency of servers has become a significant research topic over the last years, as server energy consumption varies depending on multiple factors, such as server utilization and workload type. Server energy analysis and estimation must take all relevant factors into account to ensure reliable estimates and conclusions. Thorough system analysis requires benchmarks capable of testing different system resources at different load levels using multiple workload types. Server energy estimation approaches, on the other hand, require knowledge about the interactions of these factors for the creation of accurate power models. Common approaches to energy-aware workload classification classify workloads depending on the resource types used by the different workloads. However, they rarely take into account differences in workloads targeting the same resources. Industrial energy-efficiency benchmarks typically do not evaluate the system\'s energy consumption at different resource load levels, and they only provide data for system analysis at maximum system load. In this paper, we benchmark multiple server configurations using the CPU worklets included in SPEC\'s Server Efficiency Rating Tool (SERT). We evaluate the impact of load levels and different CPU workloads on power consumption and energy efficiency. We analyze how functions approximating the measured power consumption differ over multiple server configurations and architectures. We show that workloads targeting the same resource can differ significantly in their power draw and energy efficiency. The power consumption of a given workload type varies depending on utilization, hardware and software configuration. The power consumption of CPU-intensive workloads does not scale uniformly with increased load, nor do hardware or software configuration changes affect it in a uniform manner.}},\n title = {{Analysis of the Influences on Server Power Consumption and Energy Efficiency for CPU-Intensive Workloads}},\n year = {2015},\n booktitle = {Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering (ICPE 2015)},\n location = {Austin, TX, USA},\n month = {February},\n publisher = {ACM},\n series = {ICPE \'15},\n doi = {http://dx.doi.org/10.1145/2668930.2688057},\n publisher = {ACM},\n address = {New York, NY, USA},\n keywords = {SPEC, SERT, Power, Workload Characterization, Energy Efficiency, Metrics, Utilization},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/772.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/772},\n note = {acceptance rate: 27\\%},\n}\n\n','\n\nJóakim von Kistowski, Hansfried Block, John Beckett, Klaus-Dieter Lange,\nJeremy A. Arnold, and Samuel Kounev.\nAnalysis of the Influences on Server Power Consumption and Energy\nEfficiency for CPU-Intensive Workloads.\nIn Proceedings of the 6th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2015), Austin, TX, USA, February 2015, ICPE\n\'15. ACM, New York, NY, USA.\nFebruary 2015, acceptance rate: 27%.\n[ bib | DOI | slides | .pdf | Abstract  ] 
\n@inproceedings{KiBlBeLaArKo2015-ICPE-SERT,\nauthor = {J\\\'{o}akim von Kistowski and Hansfried Block and John Beckett and Klaus-Dieter Lange and Jeremy A. Arnold and Samuel Kounev},\nabstract = {{ Energy efficiency of servers has become a significant research topic over the last years, as server energy consumption varies depending on multiple factors, such as server utilization and workload type. Server energy analysis and estimation must take all relevant factors into account to ensure reliable estimates and conclusions. Thorough system analysis requires benchmarks capable of testing different system resources at different load levels using multiple workload types. Server energy estimation approaches, on the other hand, require knowledge about the interactions of these factors for the creation of accurate power models. Common approaches to energy-aware workload classification classify workloads depending on the resource types used by the different workloads. However, they rarely take into account differences in workloads targeting the same resources. Industrial energy-efficiency benchmarks typically do not evaluate the system\'s energy consumption at different resource load levels, and they only provide data for system analysis at maximum system load. In this paper, we benchmark multiple server configurations using the CPU worklets included in SPEC\'s Server Efficiency Rating Tool (SERT). We evaluate the impact of load levels and different CPU workloads on power consumption and energy efficiency. We analyze how functions approximating the measured power consumption differ over multiple server configurations and architectures. We show that workloads targeting the same resource can differ significantly in their power draw and energy efficiency. The power consumption of a given workload type varies depending on utilization, hardware and software configuration. The power consumption of CPU-intensive workloads does not scale uniformly with increased load, nor do hardware or software configuration changes affect it in a uniform manner.}},\ntitle = {{Analysis of the Influences on Server Power Consumption and Energy Efficiency for CPU-Intensive Workloads}},\nyear = {2015},\nbooktitle = {Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering (ICPE 2015)},\nlocation = {Austin, TX, USA},\nmonth = {February},\npublisher = {ACM},\nseries = {ICPE \'15},\ndoi = {http://dx.doi.org/10.1145/2668930.2688057},\npublisher = {ACM},\naddress = {New York, NY, USA},\nkeywords = {SPEC, SERT, Power, Workload Characterization, Energy Efficiency, Metrics, Utilization},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/772.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/772},\nnote = {acceptance rate: 27\\%}\n}\n
\n
\nEnergy efficiency of servers has become a significant research topic over the last years, as server energy consumption varies depending on multiple factors, such as server utilization and workload type. Server energy analysis and estimation must take all relevant factors into account to ensure reliable estimates and conclusions. Thorough system analysis requires benchmarks capable of testing different system resources at different load levels using multiple workload types. Server energy estimation approaches, on the other hand, require knowledge about the interactions of these factors for the creation of accurate power models. Common approaches to energy-aware workload classification classify workloads depending on the resource types used by the different workloads. However, they rarely take into account differences in workloads targeting the same resources. Industrial energy-efficiency benchmarks typically do not evaluate the system\'s energy consumption at different resource load levels, and they only provide data for system analysis at maximum system load. In this paper, we benchmark multiple server configurations using the CPU worklets included in SPEC\'s Server Efficiency Rating Tool (SERT). We evaluate the impact of load levels and different CPU workloads on power consumption and energy efficiency. We analyze how functions approximating the measured power consumption differ over multiple server configurations and architectures. We show that workloads targeting the same resource can differ significantly in their power draw and energy efficiency. The power consumption of a given workload type varies depending on utilization, hardware and software configuration. The power consumption of CPU-intensive workloads does not scale uniformly with increased load, nor do hardware or software configuration changes affect it in a uniform manner.\n
\n','
\n@inproceedings{KiBlBeLaArKo2015-ICPE-SERT,\n  author = {J\\\'{o}akim von Kistowski and Hansfried Block and John Beckett and Klaus-Dieter Lange and Jeremy A. Arnold and Samuel Kounev},\n  abstract = {{ Energy efficiency of servers has become a significant research topic over the last years, as server energy consumption varies depending on multiple factors, such as server utilization and workload type. Server energy analysis and estimation must take all relevant factors into account to ensure reliable estimates and conclusions. Thorough system analysis requires benchmarks capable of testing different system resources at different load levels using multiple workload types. Server energy estimation approaches, on the other hand, require knowledge about the interactions of these factors for the creation of accurate power models. Common approaches to energy-aware workload classification classify workloads depending on the resource types used by the different workloads. However, they rarely take into account differences in workloads targeting the same resources. Industrial energy-efficiency benchmarks typically do not evaluate the system\'s energy consumption at different resource load levels, and they only provide data for system analysis at maximum system load. In this paper, we benchmark multiple server configurations using the CPU worklets included in SPEC\'s Server Efficiency Rating Tool (SERT). We evaluate the impact of load levels and different CPU workloads on power consumption and energy efficiency. We analyze how functions approximating the measured power consumption differ over multiple server configurations and architectures. We show that workloads targeting the same resource can differ significantly in their power draw and energy efficiency. The power consumption of a given workload type varies depending on utilization, hardware and software configuration. The power consumption of CPU-intensive workloads does not scale uniformly with increased load, nor do hardware or software configuration changes affect it in a uniform manner.}},\n  title = {{Analysis of the Influences on Server Power Consumption and Energy Efficiency for CPU-Intensive Workloads}},\n  year = {2015},\n  booktitle = {Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering (ICPE 2015)},\n  location = {Austin, TX, USA},\n  month = {February},\n  publisher = {ACM},\n  series = {ICPE \'15},\n  doi = {http://dx.doi.org/10.1145/2668930.2688057},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  keywords = {SPEC, SERT, Power, Workload Characterization, Energy Efficiency, Metrics, Utilization},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/772.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/772},\n  note = {acceptance rate: 27\\%}\n}\n
\n\n','{ Energy efficiency of servers has become a significant research topic over the last years, as server energy consumption varies depending on multiple factors, such as server utilization and workload type. Server energy analysis and estimation must take all relevant factors into account to ensure reliable estimates and conclusions. Thorough system analysis requires benchmarks capable of testing different system resources at different load levels using multiple workload types. Server energy estimation approaches, on the other hand, require knowledge about the interactions of these factors for the creation of accurate power models. Common approaches to energy-aware workload classification classify workloads depending on the resource types used by the different workloads. However, they rarely take into account differences in workloads targeting the same resources. Industrial energy-efficiency benchmarks typically do not evaluate the system\'s energy consumption at different resource load levels, and they only provide data for system analysis at maximum system load. In this paper, we benchmark multiple server configurations using the CPU worklets included in SPEC\'s Server Efficiency Rating Tool (SERT). We evaluate the impact of load levels and different CPU workloads on power consumption and energy efficiency. We analyze how functions approximating the measured power consumption differ over multiple server configurations and architectures. We show that workloads targeting the same resource can differ significantly in their power draw and energy efficiency. The power consumption of a given workload type varies depending on utilization, hardware and software configuration. The power consumption of CPU-intensive workloads does not scale uniformly with increased load, nor do hardware or software configuration changes affect it in a uniform manner.}','{Analysis of the Influences on Server Power Consumption and Energy Efficiency for CPU-Intensive Workloads}',0,2,2015,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(773,'paper','KiArHuLaHeCa2015-ICPE-Benchmark','inproceedings','@inproceedings{KiArHuLaHeCa2015-ICPE-Benchmark,\n author = {J\\\'{o}akim von Kistowski and Jeremy A. Arnold and Karl Huppler and Klaus-Dieter Lange and John L. Henning and Paul Cao},\n abstract = {{Standardized benchmarks have become widely accepted tools for the comparison of products and evaluation of methodologies. These benchmarks are created by consortia like SPEC and TPC under confidentiality agreements which provide little opportunity for outside observers to get a look at the processes and concerns that are prevalent in benchmark development. This paper introduces the primary concerns of benchmark development from the perspectives of SPEC and TPC committees. We provide a benchmark definition, outline the types of benchmarks, and explain the characteristics of a good benchmark. We focus on the characteristics important for a standardized benchmark, as created by the SPEC and TPC consortia. To this end, we specify the primary criteria to be employed for benchmark design and workload selection. We use multiple standardized benchmarks as examples to demonstrate how these criteria are ensured.}},\n title = {{How to Build a Benchmark}},\n year = {2015},\n booktitle = {Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering (ICPE 2015)},\n location = {Austin, TX, USA},\n month = {February},\n publisher = {ACM},\n series = {ICPE \'15},\n doi = {http://dx.doi.org/10.1145/2668930.2688819},\n publisher = {ACM},\n address = {New York, NY, USA},\n keywords = {SPEC; TPC; SPECpower\\_ssj2008; SERT; SPEC CPU},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/773.pdf},\n}\n\n','\n\nJóakim von Kistowski, Jeremy A. Arnold, Karl Huppler, Klaus-Dieter Lange,\nJohn L. Henning, and Paul Cao.\nHow to Build a Benchmark.\nIn Proceedings of the 6th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2015), Austin, TX, USA, February 2015, ICPE\n\'15. ACM, New York, NY, USA.\nFebruary 2015.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{KiArHuLaHeCa2015-ICPE-Benchmark,\nauthor = {J\\\'{o}akim von Kistowski and Jeremy A. Arnold and Karl Huppler and Klaus-Dieter Lange and John L. Henning and Paul Cao},\nabstract = {{Standardized benchmarks have become widely accepted tools for the comparison of products and evaluation of methodologies. These benchmarks are created by consortia like SPEC and TPC under confidentiality agreements which provide little opportunity for outside observers to get a look at the processes and concerns that are prevalent in benchmark development. This paper introduces the primary concerns of benchmark development from the perspectives of SPEC and TPC committees. We provide a benchmark definition, outline the types of benchmarks, and explain the characteristics of a good benchmark. We focus on the characteristics important for a standardized benchmark, as created by the SPEC and TPC consortia. To this end, we specify the primary criteria to be employed for benchmark design and workload selection. We use multiple standardized benchmarks as examples to demonstrate how these criteria are ensured.}},\ntitle = {{How to Build a Benchmark}},\nyear = {2015},\nbooktitle = {Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering (ICPE 2015)},\nlocation = {Austin, TX, USA},\nmonth = {February},\npublisher = {ACM},\nseries = {ICPE \'15},\ndoi = {http://dx.doi.org/10.1145/2668930.2688819},\npublisher = {ACM},\naddress = {New York, NY, USA},\nkeywords = {SPEC; TPC; SPECpower\\_ssj2008; SERT; SPEC CPU},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/773.pdf}\n}\n
\n
\nStandardized benchmarks have become widely accepted tools for the comparison of products and evaluation of methodologies. These benchmarks are created by consortia like SPEC and TPC under confidentiality agreements which provide little opportunity for outside observers to get a look at the processes and concerns that are prevalent in benchmark development. This paper introduces the primary concerns of benchmark development from the perspectives of SPEC and TPC committees. We provide a benchmark definition, outline the types of benchmarks, and explain the characteristics of a good benchmark. We focus on the characteristics important for a standardized benchmark, as created by the SPEC and TPC consortia. To this end, we specify the primary criteria to be employed for benchmark design and workload selection. We use multiple standardized benchmarks as examples to demonstrate how these criteria are ensured.\n
\n','
\n@inproceedings{KiArHuLaHeCa2015-ICPE-Benchmark,\n  author = {J\\\'{o}akim von Kistowski and Jeremy A. Arnold and Karl Huppler and Klaus-Dieter Lange and John L. Henning and Paul Cao},\n  abstract = {{Standardized benchmarks have become widely accepted tools for the comparison of products and evaluation of methodologies. These benchmarks are created by consortia like SPEC and TPC under confidentiality agreements which provide little opportunity for outside observers to get a look at the processes and concerns that are prevalent in benchmark development. This paper introduces the primary concerns of benchmark development from the perspectives of SPEC and TPC committees. We provide a benchmark definition, outline the types of benchmarks, and explain the characteristics of a good benchmark. We focus on the characteristics important for a standardized benchmark, as created by the SPEC and TPC consortia. To this end, we specify the primary criteria to be employed for benchmark design and workload selection. We use multiple standardized benchmarks as examples to demonstrate how these criteria are ensured.}},\n  title = {{How to Build a Benchmark}},\n  year = {2015},\n  booktitle = {Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering (ICPE 2015)},\n  location = {Austin, TX, USA},\n  month = {February},\n  publisher = {ACM},\n  series = {ICPE \'15},\n  doi = {http://dx.doi.org/10.1145/2668930.2688819},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  keywords = {SPEC; TPC; SPECpower\\_ssj2008; SERT; SPEC CPU},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/773.pdf}\n}\n
\n\n','{Standardized benchmarks have become widely accepted tools for the comparison of products and evaluation of methodologies. These benchmarks are created by consortia like SPEC and TPC under confidentiality agreements which provide little opportunity for outside observers to get a look at the processes and concerns that are prevalent in benchmark development. This paper introduces the primary concerns of benchmark development from the perspectives of SPEC and TPC committees. We provide a benchmark definition, outline the types of benchmarks, and explain the characteristics of a good benchmark. We focus on the characteristics important for a standardized benchmark, as created by the SPEC and TPC consortia. To this end, we specify the primary criteria to be employed for benchmark design and workload selection. We use multiple standardized benchmarks as examples to demonstrate how these criteria are ensured.}','{How to Build a Benchmark}',0,2,2015,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(774,'paper','WvGa','techreport','@techreport{WvGa,\n author = {G. Bohlender and E. Kaucher and R. Klatte and U. Kulisch and W. L. Miranker and Ch. Ullrich and J. Wolff v. Gudenberg},\n title = {FORTRAN for Contemporary Numerical Computation},\n institution = {IBM Research Report RC 8348, 1980},\n year = {1980},\n}\n\n','\n\nG. Bohlender, E. Kaucher, R. Klatte, U. Kulisch, W. L. Miranker, Ch. Ullrich,\nand J. Wolff v. Gudenberg.\nFortran for contemporary numerical computation.\nTechnical report, IBM Research Report RC 8348, 1980, 1980.\n[ bib  ] 
\n@techreport{WvGa,\nauthor = {G. Bohlender and E. Kaucher and R. Klatte and U. Kulisch and W. L. Miranker and Ch. Ullrich and J. Wolff v. Gudenberg},\ntitle = {FORTRAN for Contemporary Numerical Computation},\ninstitution = {IBM Research Report RC 8348, 1980},\nyear = {1980}\n}\n
\n
\n','
\n@techreport{WvGa,\n  author = {G. Bohlender and E. Kaucher and R. Klatte and U. Kulisch and W. L. Miranker and Ch. Ullrich and J. Wolff v. Gudenberg},\n  title = {FORTRAN for Contemporary Numerical Computation},\n  institution = {IBM Research Report RC 8348, 1980},\n  year = {1980}\n}\n
\n\n',NULL,'FORTRAN for Contemporary Numerical Computation',0,0,1980,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(775,'paper','Ko2015-ICPE_LT_Workshop-Keynote','inproceedings','@inproceedings{Ko2015-ICPE_LT_Workshop-Keynote,\n author = {Samuel Kounev},\n booktitle = {Proceedings of the 4th International Workshop on Large-Scale Testing (LT 2015), co-located with the 6th ACM/SPEC International Conference on Performance Engineering (ICPE 2015)},\n day = {1},\n location = {Austin, Texas, USA},\n month = {February},\n publisher = {ACM},\n title = {{Load Testing Elasticity and Performance Isolation in Shared Execution Environments}},\n numpages = {2},\n address = {New York, NY, USA},\n year = {2015},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/775.pdf},\n}\n\n','\n\nSamuel Kounev.\nLoad Testing Elasticity and Performance Isolation in Shared\nExecution Environments.\nIn Proceedings of the 4th International Workshop on Large-Scale\nTesting (LT 2015), co-located with the 6th ACM/SPEC International Conference\non Performance Engineering (ICPE 2015), Austin, Texas, USA, February 1,\n2015. ACM, New York, NY, USA.\nFebruary 2015.\n[ bib | .pdf  ] 
\n@inproceedings{Ko2015-ICPE_LT_Workshop-Keynote,\nauthor = {Samuel Kounev},\nbooktitle = {Proceedings of the 4th International Workshop on Large-Scale Testing (LT 2015), co-located with the 6th ACM/SPEC International Conference on Performance Engineering (ICPE 2015)},\nday = {1},\nlocation = {Austin, Texas, USA},\nmonth = {February},\npublisher = {ACM},\ntitle = {{Load Testing Elasticity and Performance Isolation in Shared Execution Environments}},\nnumpages = {2},\naddress = {New York, NY, USA},\nyear = {2015},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/775.pdf}\n}\n
\n
\n','
\n@inproceedings{Ko2015-ICPE_LT_Workshop-Keynote,\n  author = {Samuel Kounev},\n  booktitle = {Proceedings of the 4th International Workshop on Large-Scale Testing (LT 2015), co-located with the 6th ACM/SPEC International Conference on Performance Engineering (ICPE 2015)},\n  day = {1},\n  location = {Austin, Texas, USA},\n  month = {February},\n  publisher = {ACM},\n  title = {{Load Testing Elasticity and Performance Isolation in Shared Execution Environments}},\n  numpages = {2},\n  address = {New York, NY, USA},\n  year = {2015},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/775.pdf}\n}\n
\n\n',NULL,'{Load Testing Elasticity and Performance Isolation in Shared Execution Environments}',0,2,2015,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(776,'paper','KoBrHu2015-SE-SelfAwareDescartes','inproceedings','@inproceedings{KoBrHu2015-SE-SelfAwareDescartes,\n address = {Bonn, Germany},\n author = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\n booktitle = {Software Engineering 2015, Fachtagung des GI-Fachbereichs Softwaretechnik, 17. - 20. M\\\"{a}rz 2015, Dresden, Deutschland},\n publisher = {GI},\n series = {Lecture Notes in Informatics (LNI)},\n title = {{The Descartes Modeling Language for Self-Aware Performance and Resource Management}},\n year = {2015},\n month = {March},\n titleaddon = {{(Talk Extended Abstract)}},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/776.pdf},\n}\n\n','\n\nSamuel Kounev, Fabian Brosig, and Nikolaus Huber.\nThe Descartes Modeling Language for Self-Aware Performance and\nResource Management (Talk Extended Abstract).\nIn Software Engineering 2015, Fachtagung des GI-Fachbereichs\nSoftwaretechnik, 17. - 20. März 2015, Dresden, Deutschland, March 2015,\nLecture Notes in Informatics (LNI). GI, Bonn, Germany.\nMarch 2015.\n[ bib | .pdf  ] 
\n@inproceedings{KoBrHu2015-SE-SelfAwareDescartes,\naddress = {Bonn, Germany},\nauthor = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\nbooktitle = {Software Engineering 2015, Fachtagung des GI-Fachbereichs Softwaretechnik, 17. - 20. M\\\"{a}rz 2015, Dresden, Deutschland},\npublisher = {GI},\nseries = {Lecture Notes in Informatics (LNI)},\ntitle = {{The Descartes Modeling Language for Self-Aware Performance and Resource Management}},\nyear = {2015},\nmonth = {March},\ntitleaddon = {{(Talk Extended Abstract)}},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/776.pdf}\n}\n
\n
\n','
\n@inproceedings{KoBrHu2015-SE-SelfAwareDescartes,\n  address = {Bonn, Germany},\n  author = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\n  booktitle = {Software Engineering 2015, Fachtagung des GI-Fachbereichs Softwaretechnik, 17. - 20. M\\\"{a}rz 2015, Dresden, Deutschland},\n  publisher = {GI},\n  series = {Lecture Notes in Informatics (LNI)},\n  title = {{The Descartes Modeling Language for Self-Aware Performance and Resource Management}},\n  year = {2015},\n  month = {March},\n  titleaddon = {{(Talk Extended Abstract)}},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/776.pdf}\n}\n
\n\n',NULL,'{The Descartes Modeling Language for Self-Aware Performance and Resource Management}',0,3,2015,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(777,'paper','PT2011-kompozycja','article','@article{PT2011-kompozycja,\n author = {Krzysztof Brzostowski and Piotr Rygielski},\n title = {Automatyczna kompozycja uslug monitorowania dla systemu wspomagania treningu wytrzymalo\\\'sciowego sportowc\\\'ow},\n journal = {Przegl\\k{a}d Telekomunikacyjny, Wiadomo\\\'sci Telekomunikacyjne},\n volume = {84},\n issue = {8/9},\n pages = {1017--1022},\n note = {In Polish},\n year = {2011},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/777.pdf},\n}\n\n','\n\nKrzysztof Brzostowski and Piotr Rygielski.\nAutomatyczna kompozycja uslug monitorowania dla systemu wspomagania\ntreningu wytrzymalościowego sportowców.\nPrzegląd Telekomunikacyjny, Wiadomości Telekomunikacyjne,\n84:1017-1022, 2011.\nIn Polish.\n[ bib | .pdf  ] 
\n@article{PT2011-kompozycja,\nauthor = {Krzysztof Brzostowski and Piotr Rygielski},\ntitle = {Automatyczna kompozycja uslug monitorowania dla systemu wspomagania treningu wytrzymalo\\\'sciowego sportowc\\\'ow},\njournal = {Przegl\\k{a}d Telekomunikacyjny, Wiadomo\\\'sci Telekomunikacyjne},\nvolume = {84},\nissue = {8/9},\npages = {1017--1022},\nnote = {In Polish},\nyear = {2011},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/777.pdf}\n}\n
\n
\n','
\n@article{PT2011-kompozycja,\n  author = {Krzysztof Brzostowski and Piotr Rygielski},\n  title = {Automatyczna kompozycja uslug monitorowania dla systemu wspomagania treningu wytrzymalo\\\'sciowego sportowc\\\'ow},\n  journal = {Przegl\\k{a}d Telekomunikacyjny, Wiadomo\\\'sci Telekomunikacyjne},\n  volume = {84},\n  issue = {8/9},\n  pages = {1017--1022},\n  note = {In Polish},\n  year = {2011},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/777.pdf}\n}\n
\n\n',NULL,'Automatyczna kompozycja uslug monitorowania dla systemu wspomagania treningu wytrzymalo\\\'sciowego sportowc\\\'ow',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(778,'paper','BuNoKoKoReAm2015-ICPE-WorkloadCharacterization','inproceedings','@inproceedings{BuNoKoKoReAm2015-ICPE-WorkloadCharacterization,\n address = {New York, NY, USA},\n author = {Busch, Axel and Noorshams, Qais and Kounev, Samuel and Koziolek, Anne and Reussner, Ralf and Amrehn, Erich},\n booktitle = {Proceedings of the ACM/SPEC International Conference on Performance Engineering},\n location = {Austin, Texas, USA},\n publisher = {ACM},\n series = {ICPE \'15},\n title = {{Automated Workload Characterization for I/O Performance Analysis in Virtualized Environments}},\n year = {2015},\n month = {February},\n url = {http://dx.doi.org/10.1145/2668930.2688050},\n doi = {10.1145/2668930.2688050},\n note = {Acceptance Rate (Full Paper): 15/56 = 27\\%.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/778.pdf},\n}\n\n','\n\nAxel Busch, Qais Noorshams, Samuel Kounev, Anne Koziolek, Ralf Reussner, and\nErich Amrehn.\nAutomated Workload Characterization for I/O Performance Analysis in\nVirtualized Environments.\nIn Proceedings of the ACM/SPEC International Conference on\nPerformance Engineering, Austin, Texas, USA, February 2015, ICPE \'15. ACM,\nNew York, NY, USA.\nFebruary 2015, Acceptance Rate (Full Paper): 15/56 = 27%.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{BuNoKoKoReAm2015-ICPE-WorkloadCharacterization,\naddress = {New York, NY, USA},\nauthor = {Busch, Axel and Noorshams, Qais and Kounev, Samuel and Koziolek, Anne and Reussner, Ralf and Amrehn, Erich},\nbooktitle = {Proceedings of the ACM/SPEC International Conference on Performance Engineering},\nlocation = {Austin, Texas, USA},\npublisher = {ACM},\nseries = {ICPE \'15},\ntitle = {{Automated Workload Characterization for I/O Performance Analysis in Virtualized Environments}},\nyear = {2015},\nmonth = {February},\nurl = {http://dx.doi.org/10.1145/2668930.2688050},\ndoi = {10.1145/2668930.2688050},\nnote = {Acceptance Rate (Full Paper): 15/56 = 27\\%.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/778.pdf}\n}\n
\n
\n','
\n@inproceedings{BuNoKoKoReAm2015-ICPE-WorkloadCharacterization,\n  address = {New York, NY, USA},\n  author = {Busch, Axel and Noorshams, Qais and Kounev, Samuel and Koziolek, Anne and Reussner, Ralf and Amrehn, Erich},\n  booktitle = {Proceedings of the ACM/SPEC International Conference on Performance Engineering},\n  location = {Austin, Texas, USA},\n  publisher = {ACM},\n  series = {ICPE \'15},\n  title = {{Automated Workload Characterization for I/O Performance Analysis in Virtualized Environments}},\n  year = {2015},\n  month = {February},\n  url = {http://dx.doi.org/10.1145/2668930.2688050},\n  doi = {10.1145/2668930.2688050},\n  note = {Acceptance Rate (Full Paper): 15/56 = 27\\%.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/778.pdf}\n}\n
\n\n',NULL,'{Automated Workload Characterization for I/O Performance Analysis in Virtualized Environments}',0,2,2015,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(779,'paper','ReWeNoHaRe2014-AMT-Transformation','inproceedings','@inproceedings{ReWeNoHaRe2014-AMT-Transformation,\n author = {Andreas Rentschler and Dominik Werle and Qais Noorshams and Lucia Happe and Ralf Reussner},\n title = {{Remodularizing Legacy Model Transformations with Automatic Clustering Techniques}},\n _ee = {http://ceur-ws.org/Vol-1077/amt13_submission_4.pdf},\n editor = {Benoit Baudry and J{\\\"u}rgen Dingel and Levi Lucio and Hans Vangheluwe},\n booktitle = {Proceedings of the 3rd Workshop on the Analysis of Model Transformations (AMT@MODELS 2014), Valencia, Spain, September 29, 2014},\n publisher = {CEUR-WS.org},\n series = {CEUR Workshop Proceedings},\n _volume = {1077},\n month = {October},\n year = {2014},\n bibsource = {DBLP, http://dblp.uni-trier.de},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/779.pdf},\n}\n\n','\n\nAndreas Rentschler, Dominik Werle, Qais Noorshams, Lucia Happe, and Ralf\nReussner.\nRemodularizing Legacy Model Transformations with Automatic\nClustering Techniques.\nIn Proceedings of the 3rd Workshop on the Analysis of Model\nTransformations (AMT@MODELS 2014), Valencia, Spain, September 29, 2014,\nBenoit Baudry, Jürgen Dingel, Levi Lucio, and Hans Vangheluwe, editors,\nOctober 2014, CEUR Workshop Proceedings. CEUR-WS.org.\nOctober 2014.\n[ bib | .pdf  ] 
\n@inproceedings{ReWeNoHaRe2014-AMT-Transformation,\nauthor = {Andreas Rentschler and Dominik Werle and Qais Noorshams and Lucia Happe and Ralf Reussner},\ntitle = {{Remodularizing Legacy Model Transformations with Automatic Clustering Techniques}},\n_ee = {http://ceur-ws.org/Vol-1077/amt13_submission_4.pdf},\neditor = {Benoit Baudry and J{\\\"u}rgen Dingel and Levi Lucio and Hans Vangheluwe},\nbooktitle = {Proceedings of the 3rd Workshop on the Analysis of Model Transformations (AMT@MODELS 2014), Valencia, Spain, September 29, 2014},\npublisher = {CEUR-WS.org},\nseries = {CEUR Workshop Proceedings},\n_volume = {1077},\nmonth = {October},\nyear = {2014},\nbibsource = {DBLP, http://dblp.uni-trier.de},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/779.pdf}\n}\n
\n
\n','
\n@inproceedings{ReWeNoHaRe2014-AMT-Transformation,\n  author = {Andreas Rentschler and Dominik Werle and Qais Noorshams and Lucia Happe and Ralf Reussner},\n  title = {{Remodularizing Legacy Model Transformations with Automatic Clustering Techniques}},\n  _ee = {http://ceur-ws.org/Vol-1077/amt13_submission_4.pdf},\n  editor = {Benoit Baudry and J{\\\"u}rgen Dingel and Levi Lucio and Hans Vangheluwe},\n  booktitle = {Proceedings of the 3rd Workshop on the Analysis of Model Transformations (AMT@MODELS 2014), Valencia, Spain, September 29, 2014},\n  publisher = {CEUR-WS.org},\n  series = {CEUR Workshop Proceedings},\n  _volume = {1077},\n  month = {October},\n  year = {2014},\n  bibsource = {DBLP, http://dblp.uni-trier.de},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/779.pdf}\n}\n
\n\n',NULL,'{Remodularizing Legacy Model Transformations with Automatic Clustering Techniques}',0,10,2014,10,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(780,'paper','KiHeZoKoHo2015_SEAMS_DLIMExtraction','inproceedings','@inproceedings{KiHeZoKoHo2015_SEAMS_DLIMExtraction,\n author = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Daniel Zoller and Samuel Kounev and Andreas Hotho},\n title = {{Modeling and Extracting Load Intensity Profiles}},\n keywords = {load intensity variation, load profile, meta-modeling, model extraction, open workloads, transformation},\n booktitle = {Proceedings of the 10th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2015)},\n abstract = {Today\'s system developers and operators face the challenge of creating software systems that make efficient use of dynamically allocated resources under highly variable and dynamic load profiles, while at the same time delivering reliable performance. Benchmarking of systems under these constraints is difficult, as state-of-the-art benchmarking frameworks provide only limited support for emulating such dynamic and highly variable load profiles for the creation of realistic workload scenarios. Industrial benchmarks typically confine themselves to workloads with constant or stepwise increasing loads. Alternatively, they support replaying of recorded load traces. Statistical load intensity descriptions also do not sufficiently capture concrete pattern load profile variations over time. To address these issues, we present the Descartes Load Intensity Model (DLIM). DLIM provides a modeling formalism for describing load intensity variations over time. A DLIM instance can be used as a compact representation of a recorded load intensity trace, providing a powerful tool for benchmarking and performance analysis. As manually obtaining DLIM instances can be time consuming, we present three different automated extraction methods, which also help to enable autonomous system analysis for self-adaptive systems. Model expressiveness is validated using the presented extraction methods. Extracted DLIM instances exhibit a median modeling error of 12.4% on average over nine different real-world traces covering between two weeks and seven months. Additionally, extraction methods perform orders of magnitude faster than existing time series decomposition approaches.},\n day = {18--19},\n location = {Firenze, Italy},\n month = {May},\n year = {2015},\n note = {Acceptance rate: 29\\%},\n doi = {http://dx.doi.org/10.1109/SEAMS.2015.19},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/780.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/780},\n}\n\n','\n\nJóakim von Kistowski, Nikolas Roman Herbst, Daniel Zoller, Samuel Kounev,\nand Andreas Hotho.\nModeling and Extracting Load Intensity Profiles.\nIn Proceedings of the 10th International Symposium on Software\nEngineering for Adaptive and Self-Managing Systems (SEAMS 2015), Firenze,\nItaly, May 18-19, 2015.\nAcceptance rate: 29%.\n[ bib | DOI | slides | .pdf | Abstract  ] 
\n@inproceedings{KiHeZoKoHo2015_SEAMS_DLIMExtraction,\nauthor = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Daniel Zoller and Samuel Kounev and Andreas Hotho},\ntitle = {{Modeling and Extracting Load Intensity Profiles}},\nkeywords = {load intensity variation, load profile, meta-modeling, model extraction, open workloads, transformation},\nbooktitle = {Proceedings of the 10th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2015)},\nabstract = {Today\'s system developers and operators face the challenge of creating software systems that make efficient use of dynamically allocated resources under highly variable and dynamic load profiles, while at the same time delivering reliable performance. Benchmarking of systems under these constraints is difficult, as state-of-the-art benchmarking frameworks provide only limited support for emulating such dynamic and highly variable load profiles for the creation of realistic workload scenarios. Industrial benchmarks typically confine themselves to workloads with constant or stepwise increasing loads. Alternatively, they support replaying of recorded load traces. Statistical load intensity descriptions also do not sufficiently capture concrete pattern load profile variations over time. To address these issues, we present the Descartes Load Intensity Model (DLIM). DLIM provides a modeling formalism for describing load intensity variations over time. A DLIM instance can be used as a compact representation of a recorded load intensity trace, providing a powerful tool for benchmarking and performance analysis. As manually obtaining DLIM instances can be time consuming, we present three different automated extraction methods, which also help to enable autonomous system analysis for self-adaptive systems. Model expressiveness is validated using the presented extraction methods. Extracted DLIM instances exhibit a median modeling error of 12.4% on average over nine different real-world traces covering between two weeks and seven months. Additionally, extraction methods perform orders of magnitude faster than existing time series decomposition approaches.},\nday = {18--19},\nlocation = {Firenze, Italy},\nmonth = {May},\nyear = {2015},\nnote = {Acceptance rate: 29\\%},\ndoi = {http://dx.doi.org/10.1109/SEAMS.2015.19},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/780.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/780}\n}\n
\n
\nToday\'s system developers and operators face the challenge of creating software systems that make efficient use of dynamically allocated resources under highly variable and dynamic load profiles, while at the same time delivering reliable performance. Benchmarking of systems under these constraints is difficult, as state-of-the-art benchmarking frameworks provide only limited support for emulating such dynamic and highly variable load profiles for the creation of realistic workload scenarios. Industrial benchmarks typically confine themselves to workloads with constant or stepwise increasing loads. Alternatively, they support replaying of recorded load traces. Statistical load intensity descriptions also do not sufficiently capture concrete pattern load profile variations over time. To address these issues, we present the Descartes Load Intensity Model (DLIM). DLIM provides a modeling formalism for describing load intensity variations over time. A DLIM instance can be used as a compact representation of a recorded load intensity trace, providing a powerful tool for benchmarking and performance analysis. As manually obtaining DLIM instances can be time consuming, we present three different automated extraction methods, which also help to enable autonomous system analysis for self-adaptive systems. Model expressiveness is validated using the presented extraction methods. Extracted DLIM instances exhibit a median modeling error of 12.4% on average over nine different real-world traces covering between two weeks and seven months. Additionally, extraction methods perform orders of magnitude faster than existing time series decomposition approaches.\n
\n','
\n@inproceedings{KiHeZoKoHo2015_SEAMS_DLIMExtraction,\n  author = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Daniel Zoller and Samuel Kounev and Andreas Hotho},\n  title = {{Modeling and Extracting Load Intensity Profiles}},\n  keywords = {load intensity variation, load profile, meta-modeling, model extraction, open workloads, transformation},\n  booktitle = {Proceedings of the 10th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2015)},\n  abstract = {Today\'s system developers and operators face the challenge of creating software systems that make efficient use of dynamically allocated resources under highly variable and dynamic load profiles, while at the same time delivering reliable performance. Benchmarking of systems under these constraints is difficult, as state-of-the-art benchmarking frameworks provide only limited support for emulating such dynamic and highly variable load profiles for the creation of realistic workload scenarios. Industrial benchmarks typically confine themselves to workloads with constant or stepwise increasing loads. Alternatively, they support replaying of recorded load traces. Statistical load intensity descriptions also do not sufficiently capture concrete pattern load profile variations over time. To address these issues, we present the Descartes Load Intensity Model (DLIM). DLIM provides a modeling formalism for describing load intensity variations over time. A DLIM instance can be used as a compact representation of a recorded load intensity trace, providing a powerful tool for benchmarking and performance analysis. As manually obtaining DLIM instances can be time consuming, we present three different automated extraction methods, which also help to enable autonomous system analysis for self-adaptive systems. Model expressiveness is validated using the presented extraction methods. Extracted DLIM instances exhibit a median modeling error of 12.4% on average over nine different real-world traces covering between two weeks and seven months. Additionally, extraction methods perform orders of magnitude faster than existing time series decomposition approaches.},\n  day = {18--19},\n  location = {Firenze, Italy},\n  month = {May},\n  year = {2015},\n  note = {Acceptance rate: 29\\%},\n  doi = {http://dx.doi.org/10.1109/SEAMS.2015.19},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/780.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/780}\n}\n
\n\n','Today\'s system developers and operators face the challenge of creating software systems that make efficient use of dynamically allocated resources under highly variable and dynamic load profiles, while at the same time delivering reliable performance. Benchmarking of systems under these constraints is difficult, as state-of-the-art benchmarking frameworks provide only limited support for emulating such dynamic and highly variable load profiles for the creation of realistic workload scenarios. Industrial benchmarks typically confine themselves to workloads with constant or stepwise increasing loads. Alternatively, they support replaying of recorded load traces. Statistical load intensity descriptions also do not sufficiently capture concrete pattern load profile variations over time. To address these issues, we present the Descartes Load Intensity Model (DLIM). DLIM provides a modeling formalism for describing load intensity variations over time. A DLIM instance can be used as a compact representation of a recorded load intensity trace, providing a powerful tool for benchmarking and performance analysis. As manually obtaining DLIM instances can be time consuming, we present three different automated extraction methods, which also help to enable autonomous system analysis for self-adaptive systems. Model expressiveness is validated using the presented extraction methods. Extracted DLIM instances exhibit a median modeling error of 12.4% on average over nine different real-world traces covering between two weeks and seven months. Additionally, extraction methods perform orders of magnitude faster than existing time series decomposition approaches.','{Modeling and Extracting Load Intensity Profiles}',0,5,2015,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(781,'paper','SPEC-RG-NEWSLETTER-4','misc','@misc{SPEC-RG-NEWSLETTER-4,\n author = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\n month = {January},\n note = {Published by Standard Performance Evaluation Corporation (SPEC)},\n title = {{SPEC Research Group Newsletter, vol. 1 no. 4}},\n url = {http://research.spec.org/en/newsletter.html},\n year = {2015},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/781.pdf},\n}\n\n','\n\nSamuel Kounev, Kai Sachs, and Piotr Rygielski.\nSPEC Research Group Newsletter, vol. 1 no. 4, January 2015.\nPublished by Standard Performance Evaluation Corporation (SPEC).\n[ bib | .html | .pdf  ] 
\n@misc{SPEC-RG-NEWSLETTER-4,\nauthor = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\nmonth = {January},\nnote = {Published by Standard Performance Evaluation Corporation (SPEC)},\ntitle = {{SPEC Research Group Newsletter, vol. 1 no. 4}},\nurl = {http://research.spec.org/en/newsletter.html},\nyear = {2015},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/781.pdf}\n}\n
\n
\n','
\n@misc{SPEC-RG-NEWSLETTER-4,\n  author = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\n  month = {January},\n  note = {Published by Standard Performance Evaluation Corporation (SPEC)},\n  title = {{SPEC Research Group Newsletter, vol. 1 no. 4}},\n  url = {http://research.spec.org/en/newsletter.html},\n  year = {2015},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/781.pdf}\n}\n
\n\n',NULL,'{SPEC Research Group Newsletter, vol. 1 no. 4}',0,1,2015,1,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(782,'paper','HeKoWeGr_2015_SEAMS_BUNGEE','inproceedings','@inproceedings{HeKoWeGr_2015_SEAMS_BUNGEE,\n author = {Nikolas Roman Herbst and Samuel Kounev and Andreas Weber and Henning Groenda},\n title = {{BUNGEE: An Elasticity Benchmark for Self-Adaptive IaaS Cloud Environments}},\n keywords = {IaaS, benchmark, metric, cloud, elasticity, resource, measurement},\n booktitle = {Proceedings of the 10th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2015)},\n abstract = {Today\'s infrastructure clouds provide resource elasticity (i.e. auto-scaling) mechanisms enabling self-adaptive resource provisioning to reflect variations in the load intensity over time. These mechanisms impact on the application performance, however, their effect in specific situations is hard to quantify and compare. To evaluate the quality of elasticity mechanisms provided by different platforms and configurations, respective metrics and benchmarks are required. Existing metrics for elasticity only consider the time required to provision and deprovision resources or the costs impact of adaptations. Existing benchmarks lack the capability to handle open workloads with realistic load intensity profiles and do not explicitly distinguish between the performance exhibited by the provisioned underlying resources, on the one hand, and the quality of the elasticity mechanisms themselves, on the other hand. In this paper, we propose reliable metrics for quantifying the timing aspects and accuracy of elasticity. Based on these metrics, we propose a novel approach for benchmarking the elasticity of Infrastructure-as-a-Service (IaaS) cloud platforms independent of the performance exhibited by the provisioned underlying resources. We show that the proposed metrics provide consistent ranking of elastic platforms on an ordinal scale. Finally, we present an extensive case study of real-world complexity demonstrating that the proposed approach is applicable in realistic scenarios and can cope with different levels of resource efficiency.},\n day = {18--19},\n location = {Firenze, Italy},\n month = {May},\n year = {2015},\n note = {Acceptance rate: 29\\%},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/782.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/782},\n}\n\n','\n\nNikolas Roman Herbst, Samuel Kounev, Andreas Weber, and Henning Groenda.\nBUNGEE: An Elasticity Benchmark for Self-Adaptive IaaS Cloud\nEnvironments.\nIn Proceedings of the 10th International Symposium on Software\nEngineering for Adaptive and Self-Managing Systems (SEAMS 2015), Firenze,\nItaly, May 18-19, 2015.\nAcceptance rate: 29%.\n[ bib | slides | .pdf | Abstract  ] 
\n@inproceedings{HeKoWeGr_2015_SEAMS_BUNGEE,\nauthor = {Nikolas Roman Herbst and Samuel Kounev and Andreas Weber and Henning Groenda},\ntitle = {{BUNGEE: An Elasticity Benchmark for Self-Adaptive IaaS Cloud Environments}},\nkeywords = {IaaS, benchmark, metric, cloud, elasticity, resource, measurement},\nbooktitle = {Proceedings of the 10th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2015)},\nabstract = {Today\'s infrastructure clouds provide resource elasticity (i.e. auto-scaling) mechanisms enabling self-adaptive resource provisioning to reflect variations in the load intensity over time. These mechanisms impact on the application performance, however, their effect in specific situations is hard to quantify and compare. To evaluate the quality of elasticity mechanisms provided by different platforms and configurations, respective metrics and benchmarks are required. Existing metrics for elasticity only consider the time required to provision and deprovision resources or the costs impact of adaptations. Existing benchmarks lack the capability to handle open workloads with realistic load intensity profiles and do not explicitly distinguish between the performance exhibited by the provisioned underlying resources, on the one hand, and the quality of the elasticity mechanisms themselves, on the other hand. In this paper, we propose reliable metrics for quantifying the timing aspects and accuracy of elasticity. Based on these metrics, we propose a novel approach for benchmarking the elasticity of Infrastructure-as-a-Service (IaaS) cloud platforms independent of the performance exhibited by the provisioned underlying resources. We show that the proposed metrics provide consistent ranking of elastic platforms on an ordinal scale. Finally, we present an extensive case study of real-world complexity demonstrating that the proposed approach is applicable in realistic scenarios and can cope with different levels of resource efficiency.},\nday = {18--19},\nlocation = {Firenze, Italy},\nmonth = {May},\nyear = {2015},\nnote = {Acceptance rate: 29\\%},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/782.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/782}\n}\n
\n
\nToday\'s infrastructure clouds provide resource elasticity (i.e. auto-scaling) mechanisms enabling self-adaptive resource provisioning to reflect variations in the load intensity over time. These mechanisms impact on the application performance, however, their effect in specific situations is hard to quantify and compare. To evaluate the quality of elasticity mechanisms provided by different platforms and configurations, respective metrics and benchmarks are required. Existing metrics for elasticity only consider the time required to provision and deprovision resources or the costs impact of adaptations. Existing benchmarks lack the capability to handle open workloads with realistic load intensity profiles and do not explicitly distinguish between the performance exhibited by the provisioned underlying resources, on the one hand, and the quality of the elasticity mechanisms themselves, on the other hand. In this paper, we propose reliable metrics for quantifying the timing aspects and accuracy of elasticity. Based on these metrics, we propose a novel approach for benchmarking the elasticity of Infrastructure-as-a-Service (IaaS) cloud platforms independent of the performance exhibited by the provisioned underlying resources. We show that the proposed metrics provide consistent ranking of elastic platforms on an ordinal scale. Finally, we present an extensive case study of real-world complexity demonstrating that the proposed approach is applicable in realistic scenarios and can cope with different levels of resource efficiency.\n
\n','
\n@inproceedings{HeKoWeGr_2015_SEAMS_BUNGEE,\n  author = {Nikolas Roman Herbst and Samuel Kounev and Andreas Weber and Henning Groenda},\n  title = {{BUNGEE: An Elasticity Benchmark for Self-Adaptive IaaS Cloud Environments}},\n  keywords = {IaaS, benchmark, metric, cloud, elasticity, resource, measurement},\n  booktitle = {Proceedings of the 10th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2015)},\n  abstract = {Today\'s infrastructure clouds provide resource elasticity (i.e. auto-scaling) mechanisms enabling self-adaptive resource provisioning to reflect variations in the load intensity over time. These mechanisms impact on the application performance, however, their effect in specific situations is hard to quantify and compare. To evaluate the quality of elasticity mechanisms provided by different platforms and configurations, respective metrics and benchmarks are required. Existing metrics for elasticity only consider the time required to provision and deprovision resources or the costs impact of adaptations. Existing benchmarks lack the capability to handle open workloads with realistic load intensity profiles and do not explicitly distinguish between the performance exhibited by the provisioned underlying resources, on the one hand, and the quality of the elasticity mechanisms themselves, on the other hand. In this paper, we propose reliable metrics for quantifying the timing aspects and accuracy of elasticity. Based on these metrics, we propose a novel approach for benchmarking the elasticity of Infrastructure-as-a-Service (IaaS) cloud platforms independent of the performance exhibited by the provisioned underlying resources. We show that the proposed metrics provide consistent ranking of elastic platforms on an ordinal scale. Finally, we present an extensive case study of real-world complexity demonstrating that the proposed approach is applicable in realistic scenarios and can cope with different levels of resource efficiency.},\n  day = {18--19},\n  location = {Firenze, Italy},\n  month = {May},\n  year = {2015},\n  note = {Acceptance rate: 29\\%},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/782.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/782}\n}\n
\n\n','Today\'s infrastructure clouds provide resource elasticity (i.e. auto-scaling) mechanisms enabling self-adaptive resource provisioning to reflect variations in the load intensity over time. These mechanisms impact on the application performance, however, their effect in specific situations is hard to quantify and compare. To evaluate the quality of elasticity mechanisms provided by different platforms and configurations, respective metrics and benchmarks are required. Existing metrics for elasticity only consider the time required to provision and deprovision resources or the costs impact of adaptations. Existing benchmarks lack the capability to handle open workloads with realistic load intensity profiles and do not explicitly distinguish between the performance exhibited by the provisioned underlying resources, on the one hand, and the quality of the elasticity mechanisms themselves, on the other hand. In this paper, we propose reliable metrics for quantifying the timing aspects and accuracy of elasticity. Based on these metrics, we propose a novel approach for benchmarking the elasticity of Infrastructure-as-a-Service (IaaS) cloud platforms independent of the performance exhibited by the provisioned underlying resources. We show that the proposed metrics provide consistent ranking of elastic platforms on an ordinal scale. Finally, we present an extensive case study of real-world complexity demonstrating that the proposed approach is applicable in realistic scenarios and can cope with different levels of resource efficiency.','{BUNGEE: An Elasticity Benchmark for Self-Adaptive IaaS Cloud Environments}',0,5,2015,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(783,'paper','Yavuz2013-monitoring-control-flow','mastersthesis','@mastersthesis{Yavuz2013-monitoring-control-flow,\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n author = {Can Alexander Yavuz},\n month = {April},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{\\\"{U}berwachung des effektiven Kontrollflusses einer mehrschichtigen Anwendung}},\n year = {2013},\n type = {Bachelor\'s Thesis},\n}\n\n','\n\nCan Alexander Yavuz.\nÜberwachung des effektiven Kontrollflusses einer mehrschichtigen\nAnwendung.\nBachelor\'s thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, April 2013.\n[ bib  ] 
\n@mastersthesis{Yavuz2013-monitoring-control-flow,\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nauthor = {Can Alexander Yavuz},\nmonth = {April},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{\\\"{U}berwachung des effektiven Kontrollflusses einer mehrschichtigen Anwendung}},\nyear = {2013},\ntype = {Bachelor\'s Thesis}\n}\n
\n
\n','
\n@mastersthesis{Yavuz2013-monitoring-control-flow,\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  author = {Can Alexander Yavuz},\n  month = {April},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{\\\"{U}berwachung des effektiven Kontrollflusses einer mehrschichtigen Anwendung}},\n  year = {2013},\n  type = {Bachelor\'s Thesis}\n}\n
\n\n',NULL,'{\\\"{U}berwachung des effektiven Kontrollflusses einer mehrschichtigen Anwendung}',0,4,2013,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(784,'talk','talk-Kounev-LT2015','misc','@misc{talk-Kounev-LT2015,\n title = {{Load Testing Elasticity and Performance Isolation in Shared Execution Environments.}},\n howpublished = {Keynote Talk at the 4th International Workshop on Large-Scale Testing (LT 2015), co-located with ICPE 2015, Austin, TX, USA, February 1, 2015},\n author = {Samuel Kounev},\n days = {1},\n month = {February},\n year = {2015},\n}\n\n','\n\nSamuel Kounev.\nLoad Testing Elasticity and Performance Isolation in Shared\nExecution Environments.\nKeynote Talk at the 4th International Workshop on Large-Scale Testing\n(LT 2015), co-located with ICPE 2015, Austin, TX, USA, February 1, 2015,\nFebruary 2015.\n[ bib  ] 
\n@misc{talk-Kounev-LT2015,\ntitle = {{Load Testing Elasticity and Performance Isolation in Shared Execution Environments.}},\nhowpublished = {Keynote Talk at the 4th International Workshop on Large-Scale Testing (LT 2015), co-located with ICPE 2015, Austin, TX, USA, February 1, 2015},\nauthor = {Samuel Kounev},\ndays = {1},\nmonth = {February},\nyear = {2015}\n}\n
\n
\n','
\n@misc{talk-Kounev-LT2015,\n  title = {{Load Testing Elasticity and Performance Isolation in Shared Execution Environments.}},\n  howpublished = {Keynote Talk at the 4th International Workshop on Large-Scale Testing (LT 2015), co-located with ICPE 2015, Austin, TX, USA, February 1, 2015},\n  author = {Samuel Kounev},\n  days = {1},\n  month = {February},\n  year = {2015}\n}\n
\n\n',NULL,'{Load Testing Elasticity and Performance Isolation in Shared Execution Environments.}',0,2,2015,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(785,'talk','talk-Rygielski-OEW2012','misc','@misc{talk-Rygielski-OEW2012,\n author = {Piotr Rygielski},\n title = {{Modeling Virtualized Cloud Data Center Networks: Do We need QoS in Networks?}},\n howpublished = {Open Excellence Workshop (Invited Talk), Charles University in Prague, Czech Republic.},\n days = {21},\n month = {June},\n year = {2012},\n}\n\n','\n\nPiotr Rygielski.\nModeling Virtualized Cloud Data Center Networks: Do We need QoS in\nNetworks?\nOpen Excellence Workshop (Invited Talk), Charles University in\nPrague, Czech Republic., June 2012.\n[ bib  ] 
\n@misc{talk-Rygielski-OEW2012,\nauthor = {Piotr Rygielski},\ntitle = {{Modeling Virtualized Cloud Data Center Networks: Do We need QoS in Networks?}},\nhowpublished = {Open Excellence Workshop (Invited Talk), Charles University in Prague, Czech Republic.},\ndays = {21},\nmonth = {June},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Rygielski-OEW2012,\n  author = {Piotr Rygielski},\n  title = {{Modeling Virtualized Cloud Data Center Networks: Do We need QoS in Networks?}},\n  howpublished = {Open Excellence Workshop (Invited Talk), Charles University in Prague, Czech Republic.},\n  days = {21},\n  month = {June},\n  year = {2012}\n}\n
\n\n',NULL,'{Modeling Virtualized Cloud Data Center Networks: Do We need QoS in Networks?}',0,6,2012,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(786,'paper','Rattu2012','mastersthesis','@mastersthesis{Rattu2012,\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n author = {Dharminder Rattu},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Infrastructure Reconfiguration Using Architecture-Level Performance Models}},\n year = {2012},\n type = {{Master\'s thesis}},\n}\n\n','\n\nDharminder Rattu.\nInfrastructure Reconfiguration Using Architecture-Level Performance\nModels.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, 2012.\n[ bib  ] 
\n@mastersthesis{Rattu2012,\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nauthor = {Dharminder Rattu},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Infrastructure Reconfiguration Using Architecture-Level Performance Models}},\nyear = {2012},\ntype = {{Master\'s thesis}}\n}\n
\n
\n','
\n@mastersthesis{Rattu2012,\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  author = {Dharminder Rattu},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Infrastructure Reconfiguration Using Architecture-Level Performance Models}},\n  year = {2012},\n  type = {{Master\'s thesis}}\n}\n
\n\n',NULL,'{Infrastructure Reconfiguration Using Architecture-Level Performance Models}',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(787,'paper','Schott2012','mastersthesis','@mastersthesis{Schott2012,\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n author = {Waldemar Schott},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Verbesserte Performance-Vorhersage f\\\"{u}r virtualisierte Umgebungen durchIntegration von Messergebnissen}},\n year = {2012},\n type = {{Bachelor\'s thesis}},\n note = {{(in German)}},\n}\n\n','\n\nWaldemar Schott.\nVerbesserte Performance-Vorhersage für virtualisierte Umgebungen\ndurchIntegration von Messergebnissen.\nBachelor\'s thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, 2012.\n(in German).\n[ bib  ] 
\n@mastersthesis{Schott2012,\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nauthor = {Waldemar Schott},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Verbesserte Performance-Vorhersage f\\\"{u}r virtualisierte Umgebungen durchIntegration von Messergebnissen}},\nyear = {2012},\ntype = {{Bachelor\'s thesis}},\nnote = {{(in German)}}\n}\n
\n
\n','
\n@mastersthesis{Schott2012,\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  author = {Waldemar Schott},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Verbesserte Performance-Vorhersage f\\\"{u}r virtualisierte Umgebungen durchIntegration von Messergebnissen}},\n  year = {2012},\n  type = {{Bachelor\'s thesis}},\n  note = {{(in German)}}\n}\n
\n\n',NULL,'{Verbesserte Performance-Vorhersage f\\\"{u}r virtualisierte Umgebungen durchIntegration von Messergebnissen}',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 10:18:11',0),(788,'paper','Hildebrandt2014','mastersthesis','@mastersthesis{Hildebrandt2014,\n author = {Adrian Hildebrandt},\n address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n school = {University of W\\\"urzburg},\n title = {{Automated Transformation of Descartes Modeling Language to Palladio Component Models}},\n year = {2015},\n month = {January},\n type = {{Bachelor Thesis}},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/788},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/788.pdf},\n}\n\n','\n\nAdrian Hildebrandt.\nAutomated Transformation of Descartes Modeling Language to Palladio\nComponent Models.\nBachelor Thesis, University of Würzburg, Am Hubland,\nInformatikgebäude, 97074 Würzburg, Germany, January 2015.\n[ bib | slides | .pdf  ] 
\n@mastersthesis{Hildebrandt2014,\nauthor = {Adrian Hildebrandt},\naddress = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\nschool = {University of W\\\"urzburg},\ntitle = {{Automated Transformation of Descartes Modeling Language to Palladio Component Models}},\nyear = {2015},\nmonth = {January},\ntype = {{Bachelor Thesis}},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/788},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/788.pdf}\n}\n
\n
\n','
\n@mastersthesis{Hildebrandt2014,\n  author = {Adrian Hildebrandt},\n  address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n  school = {University of W\\\"urzburg},\n  title = {{Automated Transformation of Descartes Modeling Language to Palladio Component Models}},\n  year = {2015},\n  month = {January},\n  type = {{Bachelor Thesis}},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/788},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/788.pdf}\n}\n
\n\n',NULL,'{Automated Transformation of Descartes Modeling Language to Palladio Component Models}',0,1,2015,1,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(789,'paper','RyKoTr2015-SIMUTools-FlexPerformancePrediction','inproceedings','@inproceedings{RyKoTr2015-SIMUTools-FlexPerformancePrediction,\n title = {{Flexible Performance Prediction of Data Center Networks using Automatically Generated Simulation Models}},\n year = {2015},\n month = {August},\n days = {24--26},\n pages = {119--128},\n isbn = {978-1-63190-079-2},\n doi = {10.4108/eai.24-8-2015.2260961},\n location = {Athens, Greece},\n booktitle = {Proceedings of the Eighth International Conference on Simulation Tools and Techniques (SIMUTools 2015)},\n author = {Piotr Rygielski and Samuel Kounev and Phuoc Tran-Gia},\n abstract = {{Using different modeling and simulation approaches for predicting network performance requires extensive experience and involves a number of time consuming manual steps regarding each of the modeling formalisms. In this paper, we propose a generic approach to modeling the performance of data center networks. The approach offers multiple performance models but requires to use only a single modeling language. We propose a two-step modeling methodology, in which a high-level descriptive model of the network is built in the first step, and in the second step model-to-model transformations are used to automatically transform the descriptive model to different network simulation models. We automatically generate three performance models defined at different levels of abstraction to analyze network throughput. By offering multiple simulation models in parallel, we provide flexibility in trading-off between the modeling accuracy and the simulation overhead. We analyze the simulation models by comparing the prediction accuracy with respect to the simulation duration. We observe, that in the investigated scenarios the solution duration of coarser simulation models is up to 300 times shorter, whereas the average prediction accuracy decreases only by 4 percent.}},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/789.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/789},\n}\n\n','\n\nPiotr Rygielski, Samuel Kounev, and Phuoc Tran-Gia.\nFlexible Performance Prediction of Data Center Networks using\nAutomatically Generated Simulation Models.\nIn Proceedings of the Eighth International Conference on\nSimulation Tools and Techniques (SIMUTools 2015), Athens, Greece, August\n2015, pages 119-128.\n[ bib | DOI | slides | .pdf | Abstract  ] 
\n@inproceedings{RyKoTr2015-SIMUTools-FlexPerformancePrediction,\ntitle = {{Flexible Performance Prediction of Data Center Networks using Automatically Generated Simulation Models}},\nyear = {2015},\nmonth = {August},\ndays = {24--26},\npages = {119--128},\nisbn = {978-1-63190-079-2},\ndoi = {10.4108/eai.24-8-2015.2260961},\nlocation = {Athens, Greece},\nbooktitle = {Proceedings of the Eighth International Conference on Simulation Tools and Techniques (SIMUTools 2015)},\nauthor = {Piotr Rygielski and Samuel Kounev and Phuoc Tran-Gia},\nabstract = {{Using different modeling and simulation approaches for predicting network performance requires extensive experience and involves a number of time consuming manual steps regarding each of the modeling formalisms. In this paper, we propose a generic approach to modeling the performance of data center networks. The approach offers multiple performance models but requires to use only a single modeling language. We propose a two-step modeling methodology, in which a high-level descriptive model of the network is built in the first step, and in the second step model-to-model transformations are used to automatically transform the descriptive model to different network simulation models. We automatically generate three performance models defined at different levels of abstraction to analyze network throughput. By offering multiple simulation models in parallel, we provide flexibility in trading-off between the modeling accuracy and the simulation overhead. We analyze the simulation models by comparing the prediction accuracy with respect to the simulation duration. We observe, that in the investigated scenarios the solution duration of coarser simulation models is up to 300 times shorter, whereas the average prediction accuracy decreases only by 4 percent.}},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/789.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/789}\n}\n
\n
\nUsing different modeling and simulation approaches for predicting network performance requires extensive experience and involves a number of time consuming manual steps regarding each of the modeling formalisms. In this paper, we propose a generic approach to modeling the performance of data center networks. The approach offers multiple performance models but requires to use only a single modeling language. We propose a two-step modeling methodology, in which a high-level descriptive model of the network is built in the first step, and in the second step model-to-model transformations are used to automatically transform the descriptive model to different network simulation models. We automatically generate three performance models defined at different levels of abstraction to analyze network throughput. By offering multiple simulation models in parallel, we provide flexibility in trading-off between the modeling accuracy and the simulation overhead. We analyze the simulation models by comparing the prediction accuracy with respect to the simulation duration. We observe, that in the investigated scenarios the solution duration of coarser simulation models is up to 300 times shorter, whereas the average prediction accuracy decreases only by 4 percent.\n
\n','
\n@inproceedings{RyKoTr2015-SIMUTools-FlexPerformancePrediction,\n  title = {{Flexible Performance Prediction of Data Center Networks using Automatically Generated Simulation Models}},\n  year = {2015},\n  month = {August},\n  days = {24--26},\n  pages = {119--128},\n  isbn = {978-1-63190-079-2},\n  doi = {10.4108/eai.24-8-2015.2260961},\n  location = {Athens, Greece},\n  booktitle = {Proceedings of the Eighth International Conference on Simulation Tools and Techniques (SIMUTools 2015)},\n  author = {Piotr Rygielski and Samuel Kounev and Phuoc Tran-Gia},\n  abstract = {{Using different modeling and simulation approaches for predicting network performance requires extensive experience and involves a number of time consuming manual steps regarding each of the modeling formalisms. In this paper, we propose a generic approach to modeling the performance of data center networks. The approach offers multiple performance models but requires to use only a single modeling language. We propose a two-step modeling methodology, in which a high-level descriptive model of the network is built in the first step, and in the second step model-to-model transformations are used to automatically transform the descriptive model to different network simulation models. We automatically generate three performance models defined at different levels of abstraction to analyze network throughput. By offering multiple simulation models in parallel, we provide flexibility in trading-off between the modeling accuracy and the simulation overhead. We analyze the simulation models by comparing the prediction accuracy with respect to the simulation duration. We observe, that in the investigated scenarios the solution duration of coarser simulation models is up to 300 times shorter, whereas the average prediction accuracy decreases only by 4 percent.}},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/789.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/789}\n}\n
\n\n','{Using different modeling and simulation approaches for predicting network performance requires extensive experience and involves a number of time consuming manual steps regarding each of the modeling formalisms. In this paper, we propose a generic approach to modeling the performance of data center networks. The approach offers multiple performance models but requires to use only a single modeling language. We propose a two-step modeling methodology, in which a high-level descriptive model of the network is built in the first step, and in the second step model-to-model transformations are used to automatically transform the descriptive model to different network simulation models. We automatically generate three performance models defined at different levels of abstraction to analyze network throughput. By offering multiple simulation models in parallel, we provide flexibility in trading-off between the modeling accuracy and the simulation overhead. We analyze the simulation models by comparing the prediction accuracy with respect to the simulation duration. We observe, that in the investigated scenarios the solution duration of coarser simulation models is up to 300 times shorter, whereas the average prediction accuracy decreases only by 4 percent.}','{Flexible Performance Prediction of Data Center Networks using Automatically Generated Simulation Models}',0,8,2015,8,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:04',0),(790,'paper','Ko2005-TUD-PhD_Thesis_as_phdthesis_class','phdthesis','@phdthesis{Ko2005-TUD-PhD_Thesis_as_phdthesis_class,\n title = {Performance Engineering of Distributed Component-Based Systems - Benchmarking, Modeling and Performance Prediction},\n year = {2005},\n month = {December},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa//uploads/papers/paper-288.pdf},\n school = {Technische Universit{\\\"a}t Darmstadt, Germany},\n author = {Kounev, Samuel},\n note = {Distinguished Dissertation Award},\n}\n\n','\n\nSamuel Kounev.\nPerformance Engineering of Distributed Component-Based Systems -\nBenchmarking, Modeling and Performance Prediction.\nPhD thesis, Technische Universität Darmstadt, Germany, December\n2005.\nDistinguished Dissertation Award.\n[ bib | .pdf  ] 
\n@phdthesis{Ko2005-TUD-PhD_Thesis_as_phdthesis_class,\ntitle = {Performance Engineering of Distributed Component-Based Systems - Benchmarking, Modeling and Performance Prediction},\nyear = {2005},\nmonth = {December},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa//uploads/papers/paper-288.pdf},\nschool = {Technische Universit{\\\"a}t Darmstadt, Germany},\nauthor = {Kounev, Samuel},\nnote = {Distinguished Dissertation Award}\n}\n
\n
\n','
\n@phdthesis{Ko2005-TUD-PhD_Thesis_as_phdthesis_class,\n  title = {Performance Engineering of Distributed Component-Based Systems - Benchmarking, Modeling and Performance Prediction},\n  year = {2005},\n  month = {December},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa//uploads/papers/paper-288.pdf},\n  school = {Technische Universit{\\\"a}t Darmstadt, Germany},\n  author = {Kounev, Samuel},\n  note = {Distinguished Dissertation Award}\n}\n
\n\n',NULL,'Performance Engineering of Distributed Component-Based Systems - Benchmarking, Modeling and Performance Prediction',0,12,2005,12,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:04',0),(791,'paper','SpHeKoZhLuUyGr2015-CLOUD-ProactiveMemoryScaling','inproceedings','@inproceedings{SpHeKoZhLuUyGr2015-CLOUD-ProactiveMemoryScaling,\n author = {Simon Spinner and Nikolas Herbst and Samuel Kounev and Xiaoyun Zhu and Lei Lu and Mustafa Uysal and Rean Griffith},\n title = {{Proactive Memory Scaling of Virtualized Applications}},\n booktitle = {Proceedings of the 2015 IEEE 8th International Conference on Cloud Computing (IEEE CLOUD 2015)},\n day = {27},\n location = {New York, NY, USA},\n month = {June},\n publisher = {IEEE},\n year = {2015},\n pages = {277--284},\n note = {Acceptance Rate: 15%},\n doi = {10.1109/CLOUD.2015.45},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/791.pdf},\n abstract = {{Enterprise applications in virtualized environments are often subject to time-varying workloads with multiple seasonal patterns and trends. In order to ensure quality of service for such applications while avoiding over-provisioning, resources need to be dynamically adapted to accommodate the current workload demands. Many memory-intensive applications are not suitable for the traditional horizontal scaling approach often used for runtime performance management, as it relies on complex and expensive state replication. On the other hand, vertical scaling of memory often requires a restart of the application. In this paper, we propose a proactive approach to memory scaling for virtualized applications. It uses statistical forecasting to predict the future workload and reconfigure the memory size of the virtual machine of an application automatically. To this end, we propose an extended forecasting technique that leverages meta-knowledge, such as calendar information, to improve the forecast accuracy. In addition, we develop an application controller to adjust settings associated with application memory management during memory reconfiguration. Our evaluation using real-world traces shows that the forecast accuracy quantified with the MASE error metric can be improved by 11-59%. Furthermore, we demonstrate that the proactive approach can reduce the impact of reconfiguration on application availability by over 80% and significantly improve performance relative to a reactive controller.}},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/791},\n}\n\n','\n\nSimon Spinner, Nikolas Herbst, Samuel Kounev, Xiaoyun Zhu, Lei Lu, Mustafa\nUysal, and Rean Griffith.\nProactive Memory Scaling of Virtualized Applications.\nIn Proceedings of the 2015 IEEE 8th International Conference on\nCloud Computing (IEEE CLOUD 2015), New York, NY, USA, June 27, 2015, pages\n277-284. IEEE.\nJune 2015, Acceptance Rate: 15%.\n[ bib | DOI | slides | .pdf | Abstract  ] 
\n@inproceedings{SpHeKoZhLuUyGr2015-CLOUD-ProactiveMemoryScaling,\nauthor = {Simon Spinner and Nikolas Herbst and Samuel Kounev and Xiaoyun Zhu and Lei Lu and Mustafa Uysal and Rean Griffith},\ntitle = {{Proactive Memory Scaling of Virtualized Applications}},\nbooktitle = {Proceedings of the 2015 IEEE 8th International Conference on Cloud Computing (IEEE CLOUD 2015)},\nday = {27},\nlocation = {New York, NY, USA},\nmonth = {June},\npublisher = {IEEE},\nyear = {2015},\npages = {277--284},\nnote = {Acceptance Rate: 15%},\ndoi = {10.1109/CLOUD.2015.45},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/791.pdf},\nabstract = {{Enterprise applications in virtualized environments are often subject to time-varying workloads with multiple seasonal patterns and trends. In order to ensure quality of service for such applications while avoiding over-provisioning, resources need to be dynamically adapted to accommodate the current workload demands. Many memory-intensive applications are not suitable for the traditional horizontal scaling approach often used for runtime performance management, as it relies on complex and expensive state replication. On the other hand, vertical scaling of memory often requires a restart of the application. In this paper, we propose a proactive approach to memory scaling for virtualized applications. It uses statistical forecasting to predict the future workload and reconfigure the memory size of the virtual machine of an application automatically. To this end, we propose an extended forecasting technique that leverages meta-knowledge, such as calendar information, to improve the forecast accuracy. In addition, we develop an application controller to adjust settings associated with application memory management during memory reconfiguration. Our evaluation using real-world traces shows that the forecast accuracy quantified with the MASE error metric can be improved by 11-59%. Furthermore, we demonstrate that the proactive approach can reduce the impact of reconfiguration on application availability by over 80% and significantly improve performance relative to a reactive controller.}},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/791}\n}\n
\n
\nEnterprise applications in virtualized environments are often subject to time-varying workloads with multiple seasonal patterns and trends. In order to ensure quality of service for such applications while avoiding over-provisioning, resources need to be dynamically adapted to accommodate the current workload demands. Many memory-intensive applications are not suitable for the traditional horizontal scaling approach often used for runtime performance management, as it relies on complex and expensive state replication. On the other hand, vertical scaling of memory often requires a restart of the application. In this paper, we propose a proactive approach to memory scaling for virtualized applications. It uses statistical forecasting to predict the future workload and reconfigure the memory size of the virtual machine of an application automatically. To this end, we propose an extended forecasting technique that leverages meta-knowledge, such as calendar information, to improve the forecast accuracy. In addition, we develop an application controller to adjust settings associated with application memory management during memory reconfiguration. Our evaluation using real-world traces shows that the forecast accuracy quantified with the MASE error metric can be improved by 11-59%. Furthermore, we demonstrate that the proactive approach can reduce the impact of reconfiguration on application availability by over 80% and significantly improve performance relative to a reactive controller.\n
\n','
\n@inproceedings{SpHeKoZhLuUyGr2015-CLOUD-ProactiveMemoryScaling,\n  author = {Simon Spinner and Nikolas Herbst and Samuel Kounev and Xiaoyun Zhu and Lei Lu and Mustafa Uysal and Rean Griffith},\n  title = {{Proactive Memory Scaling of Virtualized Applications}},\n  booktitle = {Proceedings of the 2015 IEEE 8th International Conference on Cloud Computing (IEEE CLOUD 2015)},\n  day = {27},\n  location = {New York, NY, USA},\n  month = {June},\n  publisher = {IEEE},\n  year = {2015},\n  pages = {277--284},\n  note = {Acceptance Rate: 15%},\n  doi = {10.1109/CLOUD.2015.45},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/791.pdf},\n  abstract = {{Enterprise applications in virtualized environments are often subject to time-varying workloads with multiple seasonal patterns and trends. In order to ensure quality of service for such applications while avoiding over-provisioning, resources need to be dynamically adapted to accommodate the current workload demands. Many memory-intensive applications are not suitable for the traditional horizontal scaling approach often used for runtime performance management, as it relies on complex and expensive state replication. On the other hand, vertical scaling of memory often requires a restart of the application. In this paper, we propose a proactive approach to memory scaling for virtualized applications. It uses statistical forecasting to predict the future workload and reconfigure the memory size of the virtual machine of an application automatically. To this end, we propose an extended forecasting technique that leverages meta-knowledge, such as calendar information, to improve the forecast accuracy. In addition, we develop an application controller to adjust settings associated with application memory management during memory reconfiguration. Our evaluation using real-world traces shows that the forecast accuracy quantified with the MASE error metric can be improved by 11-59%. Furthermore, we demonstrate that the proactive approach can reduce the impact of reconfiguration on application availability by over 80% and significantly improve performance relative to a reactive controller.}},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/791}\n}\n
\n\n','{Enterprise applications in virtualized environments are often subject to time-varying workloads with multiple seasonal patterns and trends. In order to ensure quality of service for such applications while avoiding over-provisioning, resources need to be dynamically adapted to accommodate the current workload demands. Many memory-intensive applications are not suitable for the traditional horizontal scaling approach often used for runtime performance management, as it relies on complex and expensive state replication. On the other hand, vertical scaling of memory often requires a restart of the application. In this paper, we propose a proactive approach to memory scaling for virtualized applications. It uses statistical forecasting to predict the future workload and reconfigure the memory size of the virtual machine of an application automatically. To this end, we propose an extended forecasting technique that leverages meta-knowledge, such as calendar information, to improve the forecast accuracy. In addition, we develop an application controller to adjust settings associated with application memory management during memory reconfiguration. Our evaluation using real-world traces shows that the forecast accuracy quantified with the MASE error metric can be improved by 11-59%. Furthermore, we demonstrate that the proactive approach can reduce the impact of reconfiguration on application availability by over 80% and significantly improve performance relative to a reactive controller.}','{Proactive Memory Scaling of Virtualized Applications}',0,6,2015,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:04',0),(792,'paper','WaSpKo-SIMUTools-QPNParallelSimulation','inproceedings','@inproceedings{WaSpKo-SIMUTools-QPNParallelSimulation,\n title = {{Parallel Simulation of Queueing Petri Nets}},\n year = {2015},\n month = {August},\n days = {24--26},\n location = {Athens, Greece},\n booktitle = {Proceedings of the Eighth EAI International Conference on Simulation Tools and Techniques (SIMUTools 2015)},\n author = {J\\\"{u}rgen Walter and Simon Spinner and Samuel Kounev},\n abstract = {Queueing Petri nets show high accurracy to model and analyze cloud scenarios. To apply these models in online scenarios a speedup of simulation is desirable. One way to speedup simulation is parallelization. Decades of intensive research showed no general solution for parallel discrete event simulation, which provides reasonable speedups. We research the application of parallel simulation for cloud scenarios. We develop a parallel simulation engine that shows speedup for certain scenarios common in cloud models. We present a parallel simualtion engine that employs application level and event level parallelism. We parallelize the execution of a single run by the use of a conservative barrier-based synchronization algorithm. The speedup for a single run depends on the capability of the model. Hence, a number of experiments on different net characteristics were conducted showing that for certain models a superlinear speedup is possible.},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/792},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/792.pdf},\n}\n\n','\n\nJürgen Walter, Simon Spinner, and Samuel Kounev.\nParallel Simulation of Queueing Petri Nets.\nIn Proceedings of the Eighth EAI International Conference on\nSimulation Tools and Techniques (SIMUTools 2015), Athens, Greece, August\n2015.\n[ bib | slides | .pdf | Abstract  ] 
\n@inproceedings{WaSpKo-SIMUTools-QPNParallelSimulation,\ntitle = {{Parallel Simulation of Queueing Petri Nets}},\nyear = {2015},\nmonth = {August},\ndays = {24--26},\nlocation = {Athens, Greece},\nbooktitle = {Proceedings of the Eighth EAI International Conference on Simulation Tools and Techniques (SIMUTools 2015)},\nauthor = {J\\\"{u}rgen Walter and Simon Spinner and Samuel Kounev},\nabstract = {Queueing Petri nets show high accurracy to model and analyze cloud scenarios. To apply these models in online scenarios a speedup of simulation is desirable. One way to speedup simulation is parallelization. Decades of intensive research showed no general solution for parallel discrete event simulation, which provides reasonable speedups. We research the application of parallel simulation for cloud scenarios. We develop a parallel simulation engine that shows speedup for certain scenarios common in cloud models. We present a parallel simualtion engine that employs application level and event level parallelism. We parallelize the execution of a single run by the use of a conservative barrier-based synchronization algorithm. The speedup for a single run depends on the capability of the model. Hence, a number of experiments on different net characteristics were conducted showing that for certain models a superlinear speedup is possible.},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/792},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/792.pdf}\n}\n
\n
\nQueueing Petri nets show high accurracy to model and analyze cloud scenarios. To apply these models in online scenarios a speedup of simulation is desirable. One way to speedup simulation is parallelization. Decades of intensive research showed no general solution for parallel discrete event simulation, which provides reasonable speedups. We research the application of parallel simulation for cloud scenarios. We develop a parallel simulation engine that shows speedup for certain scenarios common in cloud models. We present a parallel simualtion engine that employs application level and event level parallelism. We parallelize the execution of a single run by the use of a conservative barrier-based synchronization algorithm. The speedup for a single run depends on the capability of the model. Hence, a number of experiments on different net characteristics were conducted showing that for certain models a superlinear speedup is possible.\n
\n','
\n@inproceedings{WaSpKo-SIMUTools-QPNParallelSimulation,\n  title = {{Parallel Simulation of Queueing Petri Nets}},\n  year = {2015},\n  month = {August},\n  days = {24--26},\n  location = {Athens, Greece},\n  booktitle = {Proceedings of the Eighth EAI International Conference on Simulation Tools and Techniques (SIMUTools 2015)},\n  author = {J\\\"{u}rgen Walter and Simon Spinner and Samuel Kounev},\n  abstract = {Queueing Petri nets show high accurracy to model and analyze cloud scenarios. To apply these models in online scenarios a speedup of simulation is desirable. One way to speedup simulation is parallelization. Decades of intensive research showed no general solution for parallel discrete event simulation, which provides reasonable speedups. We research the application of parallel simulation for cloud scenarios. We develop a parallel simulation engine that shows speedup for certain scenarios common in cloud models. We present a parallel simualtion engine that employs application level and event level parallelism. We parallelize the execution of a single run by the use of a conservative barrier-based synchronization algorithm. The speedup for a single run depends on the capability of the model. Hence, a number of experiments on different net characteristics were conducted showing that for certain models a superlinear speedup is possible.},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/792},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/792.pdf}\n}\n
\n\n','Queueing Petri nets show high accurracy to model and analyze cloud scenarios. To apply these models in online scenarios a speedup of simulation is desirable. One way to speedup simulation is parallelization. Decades of intensive research showed no general solution for parallel discrete event simulation, which provides reasonable speedups. We research the application of parallel simulation for cloud scenarios. We develop a parallel simulation engine that shows speedup for certain scenarios common in cloud models. We present a parallel simualtion engine that employs application level and event level parallelism. We parallelize the execution of a single run by the use of a conservative barrier-based synchronization algorithm. The speedup for a single run depends on the capability of the model. Hence, a number of experiments on different net characteristics were conducted showing that for certain models a superlinear speedup is possible.','{Parallel Simulation of Queueing Petri Nets}',0,8,2015,8,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:04',0),(793,'paper','CaAnViMiKo2015-DSN-Challenges','inproceedings','@inproceedings{CaAnViMiKo2015-DSN-Challenges,\n author = {Diogo Carvalho and Nuno Antunes and Marco Vieira and Aleksandar Milenkoski and Samuel Kounev},\n booktitle = {The 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2015)},\n publisher = {{IEEE}},\n location = {Rio de Janeiro, Brazil},\n title = {{Challenges of Assessing the Hypercall Interface Robustness}},\n titleaddon = {{(Fast Abstract)}},\n year = {2015},\n month = {June},\n abstract = {{Assessing the robustness of hypercall interfaces is essential to understand the dependability of virtualized infrastructures. However, the particularities in the domain raise particular challenges, as discussed in the present paper.}},\n}\n\n','\n\nDiogo Carvalho, Nuno Antunes, Marco Vieira, Aleksandar Milenkoski, and Samuel\nKounev.\nChallenges of Assessing the Hypercall Interface Robustness (Fast\nAbstract).\nIn The 45th Annual IEEE/IFIP International Conference on\nDependable Systems and Networks (DSN 2015), Rio de Janeiro, Brazil, June\n2015. IEEE.\nJune 2015.\n[ bib | Abstract  ] 
\n@inproceedings{CaAnViMiKo2015-DSN-Challenges,\nauthor = {Diogo Carvalho and Nuno Antunes and Marco Vieira and Aleksandar Milenkoski and Samuel Kounev},\nbooktitle = {The 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2015)},\npublisher = {{IEEE}},\nlocation = {Rio de Janeiro, Brazil},\ntitle = {{Challenges of Assessing the Hypercall Interface Robustness}},\ntitleaddon = {{(Fast Abstract)}},\nyear = {2015},\nmonth = {June},\nabstract = {{Assessing the robustness of hypercall interfaces is essential to understand the dependability of virtualized infrastructures. However, the particularities in the domain raise particular challenges, as discussed in the present paper.}}\n}\n
\n
\nAssessing the robustness of hypercall interfaces is essential to understand the dependability of virtualized infrastructures. However, the particularities in the domain raise particular challenges, as discussed in the present paper.\n
\n','
\n@inproceedings{CaAnViMiKo2015-DSN-Challenges,\n  author = {Diogo Carvalho and Nuno Antunes and Marco Vieira and Aleksandar Milenkoski and Samuel Kounev},\n  booktitle = {The 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2015)},\n  publisher = {{IEEE}},\n  location = {Rio de Janeiro, Brazil},\n  title = {{Challenges of Assessing the Hypercall Interface Robustness}},\n  titleaddon = {{(Fast Abstract)}},\n  year = {2015},\n  month = {June},\n  abstract = {{Assessing the robustness of hypercall interfaces is essential to understand the dependability of virtualized infrastructures. However, the particularities in the domain raise particular challenges, as discussed in the present paper.}}\n}\n
\n\n','{Assessing the robustness of hypercall interfaces is essential to understand the dependability of virtualized infrastructures. However, the particularities in the domain raise particular challenges, as discussed in the present paper.}','{Challenges of Assessing the Hypercall Interface Robustness}',0,6,2015,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:04',0),(798,'paper','Schott2013','mastersthesis','@mastersthesis{Schott2013,\n author = {Waldemar Schott},\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {Automated Model-based System Reconfiguration: A Case Study},\n year = {2013},\n mont = {July},\n type = {{Master Thesis}},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/798},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/798.pdf},\n}\n\n','\n\nWaldemar Schott.\nAutomated model-based system reconfiguration: A case study.\nMaster Thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, 2013.\n[ bib | slides | .pdf  ] 
\n@mastersthesis{Schott2013,\nauthor = {Waldemar Schott},\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {Automated Model-based System Reconfiguration: A Case Study},\nyear = {2013},\nmont = {July},\ntype = {{Master Thesis}},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/798},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/798.pdf}\n}\n
\n
\n','
\n@mastersthesis{Schott2013,\n  author = {Waldemar Schott},\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {Automated Model-based System Reconfiguration: A Case Study},\n  year = {2013},\n  mont = {July},\n  type = {{Master Thesis}},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/798},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/798.pdf}\n}\n
\n\n',NULL,'Automated Model-based System Reconfiguration: A Case Study',0,0,2013,0,NULL,NULL,NULL,'2015-05-11 14:14:02','2016-06-01 09:41:04',0),(799,'paper','Eismann2015','mastersthesis','@mastersthesis{Eismann2015,\n author = {Simon Eismann},\n address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n school = {University of W\\\"urzburg},\n title = {{Declarative Automation Framework for QPME based on DQL}},\n year = {2015},\n month = {March},\n type = {{Bachelor Thesis}},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/799},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/799.pdf},\n}\n\n','\n\nSimon Eismann.\nDeclarative Automation Framework for QPME based on DQL.\nBachelor Thesis, University of Würzburg, Am Hubland,\nInformatikgebäude, 97074 Würzburg, Germany, March 2015.\n[ bib | slides | .pdf  ] 
\n@mastersthesis{Eismann2015,\nauthor = {Simon Eismann},\naddress = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\nschool = {University of W\\\"urzburg},\ntitle = {{Declarative Automation Framework for QPME based on DQL}},\nyear = {2015},\nmonth = {March},\ntype = {{Bachelor Thesis}},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/799},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/799.pdf}\n}\n
\n
\n','
\n@mastersthesis{Eismann2015,\n  author = {Simon Eismann},\n  address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n  school = {University of W\\\"urzburg},\n  title = {{Declarative Automation Framework for QPME based on DQL}},\n  year = {2015},\n  month = {March},\n  type = {{Bachelor Thesis}},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/799},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/799.pdf}\n}\n
\n\n',NULL,'{Declarative Automation Framework for QPME based on DQL}',0,3,2015,3,NULL,NULL,NULL,'2015-05-12 11:32:26','2016-06-01 09:41:04',0),(802,'paper','KoZhKeKw2015','book','@book{KoZhKeKw2015,\n address = {Dagstuhl, Germany},\n editor = {Kounev, Samuel and Zhu, Xiaoyun and Kephart, Jeffrey O. and Kwiatkowska, Marta and Aleksandar Milenkoski (Assistant Editor)},\n series = {Dagstuhl Reports},\n title = {{Model-driven Algorithms and Architectures for Self-Aware Computing Systems}},\n year = {2015},\n month = {January},\n abstract = {{This report documents the program and the outcomes of Dagstuhl Seminar 15041 \"Model-driven Algorithms and Architectures for Self-Aware Computing Systems\". The design of self-aware computing systems calls for an integrated interdisciplinary approach building on results from multiple areas of computer science and engineering, including software and systems engineering, systems modeling, simulation and analysis, autonomic and organic computing, machine learning and artificial intelligence, data center resource management, and so on. The Dagstuhl Seminar 15041 served as a platform to raise the awareness about the relevant research efforts in the respective research communities as well as existing synergies that can be exploited to advance the state-of-the-art, formulate a new research agenda that takes a broader view on the problem following an integrated and interdisciplinary approach, and establish collaborations between academia and industry.}},\n url = {http://drops.dagstuhl.de/opus/volltexte/2015/5038/},\n pdf = {http://drops.dagstuhl.de/opus/volltexte/2015/5038/pdf/dagrep_v005_i001_p164_s15041.pdf},\n}\n\n','\n\nSamuel Kounev, Xiaoyun Zhu, Jeffrey O. Kephart, Marta Kwiatkowska, and\nAleksandar Milenkoski (Assistant Editor), editors.\nModel-driven Algorithms and Architectures for Self-Aware\nComputing Systems.\nDagstuhl Reports. Dagstuhl, Germany, January 2015.\n[ bib | http | .pdf | Abstract  ] 
\n@book{KoZhKeKw2015,\naddress = {Dagstuhl, Germany},\neditor = {Kounev, Samuel and Zhu, Xiaoyun and Kephart, Jeffrey O. and Kwiatkowska, Marta and Aleksandar Milenkoski (Assistant Editor)},\nseries = {Dagstuhl Reports},\ntitle = {{Model-driven Algorithms and Architectures for Self-Aware Computing Systems}},\nyear = {2015},\nmonth = {January},\nabstract = {{This report documents the program and the outcomes of Dagstuhl Seminar 15041 \"Model-driven Algorithms and Architectures for Self-Aware Computing Systems\". The design of self-aware computing systems calls for an integrated interdisciplinary approach building on results from multiple areas of computer science and engineering, including software and systems engineering, systems modeling, simulation and analysis, autonomic and organic computing, machine learning and artificial intelligence, data center resource management, and so on. The Dagstuhl Seminar 15041 served as a platform to raise the awareness about the relevant research efforts in the respective research communities as well as existing synergies that can be exploited to advance the state-of-the-art, formulate a new research agenda that takes a broader view on the problem following an integrated and interdisciplinary approach, and establish collaborations between academia and industry.}},\nurl = {http://drops.dagstuhl.de/opus/volltexte/2015/5038/},\npdf = {http://drops.dagstuhl.de/opus/volltexte/2015/5038/pdf/dagrep_v005_i001_p164_s15041.pdf}\n}\n
\n
\nThis report documents the program and the outcomes of Dagstuhl Seminar 15041 \"Model-driven Algorithms and Architectures for Self-Aware Computing Systems\". The design of self-aware computing systems calls for an integrated interdisciplinary approach building on results from multiple areas of computer science and engineering, including software and systems engineering, systems modeling, simulation and analysis, autonomic and organic computing, machine learning and artificial intelligence, data center resource management, and so on. The Dagstuhl Seminar 15041 served as a platform to raise the awareness about the relevant research efforts in the respective research communities as well as existing synergies that can be exploited to advance the state-of-the-art, formulate a new research agenda that takes a broader view on the problem following an integrated and interdisciplinary approach, and establish collaborations between academia and industry.\n
\n','
\n@book{KoZhKeKw2015,\n  address = {Dagstuhl, Germany},\n  editor = {Kounev, Samuel and Zhu, Xiaoyun and Kephart, Jeffrey O. and Kwiatkowska, Marta and Aleksandar Milenkoski (Assistant Editor)},\n  series = {Dagstuhl Reports},\n  title = {{Model-driven Algorithms and Architectures for Self-Aware Computing Systems}},\n  year = {2015},\n  month = {January},\n  abstract = {{This report documents the program and the outcomes of Dagstuhl Seminar 15041 \"Model-driven Algorithms and Architectures for Self-Aware Computing Systems\". The design of self-aware computing systems calls for an integrated interdisciplinary approach building on results from multiple areas of computer science and engineering, including software and systems engineering, systems modeling, simulation and analysis, autonomic and organic computing, machine learning and artificial intelligence, data center resource management, and so on. The Dagstuhl Seminar 15041 served as a platform to raise the awareness about the relevant research efforts in the respective research communities as well as existing synergies that can be exploited to advance the state-of-the-art, formulate a new research agenda that takes a broader view on the problem following an integrated and interdisciplinary approach, and establish collaborations between academia and industry.}},\n  url = {http://drops.dagstuhl.de/opus/volltexte/2015/5038/},\n  pdf = {http://drops.dagstuhl.de/opus/volltexte/2015/5038/pdf/dagrep_v005_i001_p164_s15041.pdf}\n}\n
\n\n','{This report documents the program and the outcomes of Dagstuhl Seminar 15041 \"Model-driven Algorithms and Architectures for Self-Aware Computing Systems\". The design of self-aware computing systems calls for an integrated interdisciplinary approach building on results from multiple areas of computer science and engineering, including software and systems engineering, systems modeling, simulation and analysis, autonomic and organic computing, machine learning and artificial intelligence, data center resource management, and so on. The Dagstuhl Seminar 15041 served as a platform to raise the awareness about the relevant research efforts in the respective research communities as well as existing synergies that can be exploited to advance the state-of-the-art, formulate a new research agenda that takes a broader view on the problem following an integrated and interdisciplinary approach, and establish collaborations between academia and industry.}','{Model-driven Algorithms and Architectures for Self-Aware Computing Systems}',0,1,2015,1,NULL,NULL,NULL,'2015-05-15 09:51:25','2016-06-01 09:41:04',0),(803,'paper','LaGeSpRyZiKoTG-SDN-Controller-Placement-ITC2015','inproceedings','@inproceedings{LaGeSpRyZiKoTG-SDN-Controller-Placement-ITC2015,\n author = {Stanislav Lange and Steffen Gebert and Joachim Spoerhase and Piotr Rygielski and Thomas Zinner and Samuel Kounev and Phuoc Tran-Gia},\n title = {{Specialized Heuristics for the Controller Placement Problem in Large Scale SDN Networks}},\n booktitle = {27th International Teletraffic Congress ({ITC 2015})},\n address = {Ghent, Belgium},\n day = {8--10},\n month = {September},\n year = {2015},\n pages = {210--218},\n url = {http://dx.doi.org/10.1109/ITC.2015.32},\n doi = {10.1109/ITC.2015.32},\n abstract = {{The Software Defined Networking~(SDN) concept introduces a paradigm shift in the networking world towards an externalized control plane which is logically centralized. When designing an SDN-based WAN architecture, it is of vital importance to find a feasible solution to the controller placement problem, i.e., to decide where to position a limited amount of resources within the network. In addition to time-independent constraints regarding aspects like scalability, resilience, and control plane communication delays, dynamically changing network conditions like traffic patterns or bandwidth demands need to be considered as well. Consequently, such dynamic environments call for a regular and fast recalculation of placements in order to adapt to the current situation in a timely manner. While an exhaustive evaluation of all possible solutions can be performed within a practically feasible time frame for small and medium-sized networks, such an approach is out of scope for large problem instances which have significantly higher time and memory requirements. Therefore, this work investigates a specialized heuristic, which takes into account a particular set of optimization objectives and returns solutions representing the possible trade-offs between them. Due to its low computation time and acceptable margin of error, this heuristic can be employed by automatic decision systems operating in dynamic environments.}},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/803.pdf},\n}\n\n','\n\nStanislav Lange, Steffen Gebert, Joachim Spoerhase, Piotr Rygielski, Thomas\nZinner, Samuel Kounev, and Phuoc Tran-Gia.\nSpecialized Heuristics for the Controller Placement Problem in Large\nScale SDN Networks.\nIn 27th International Teletraffic Congress (ITC 2015),\nSeptember 8-10, 2015, pages 210-218. Ghent, Belgium.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{LaGeSpRyZiKoTG-SDN-Controller-Placement-ITC2015,\nauthor = {Stanislav Lange and Steffen Gebert and Joachim Spoerhase and Piotr Rygielski and Thomas Zinner and Samuel Kounev and Phuoc Tran-Gia},\ntitle = {{Specialized Heuristics for the Controller Placement Problem in Large Scale SDN Networks}},\nbooktitle = {27th International Teletraffic Congress ({ITC 2015})},\naddress = {Ghent, Belgium},\nday = {8--10},\nmonth = {September},\nyear = {2015},\npages = {210--218},\nurl = {http://dx.doi.org/10.1109/ITC.2015.32},\ndoi = {10.1109/ITC.2015.32},\nabstract = {{The Software Defined Networking~(SDN) concept introduces a paradigm shift in the networking world towards an externalized control plane which is logically centralized. When designing an SDN-based WAN architecture, it is of vital importance to find a feasible solution to the controller placement problem, i.e., to decide where to position a limited amount of resources within the network. In addition to time-independent constraints regarding aspects like scalability, resilience, and control plane communication delays, dynamically changing network conditions like traffic patterns or bandwidth demands need to be considered as well. Consequently, such dynamic environments call for a regular and fast recalculation of placements in order to adapt to the current situation in a timely manner. While an exhaustive evaluation of all possible solutions can be performed within a practically feasible time frame for small and medium-sized networks, such an approach is out of scope for large problem instances which have significantly higher time and memory requirements. Therefore, this work investigates a specialized heuristic, which takes into account a particular set of optimization objectives and returns solutions representing the possible trade-offs between them. Due to its low computation time and acceptable margin of error, this heuristic can be employed by automatic decision systems operating in dynamic environments.}},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/803.pdf}\n}\n
\n
\nThe Software Defined Networking (SDN) concept introduces a paradigm shift in the networking world towards an externalized control plane which is logically centralized. When designing an SDN-based WAN architecture, it is of vital importance to find a feasible solution to the controller placement problem, i.e., to decide where to position a limited amount of resources within the network. In addition to time-independent constraints regarding aspects like scalability, resilience, and control plane communication delays, dynamically changing network conditions like traffic patterns or bandwidth demands need to be considered as well. Consequently, such dynamic environments call for a regular and fast recalculation of placements in order to adapt to the current situation in a timely manner. While an exhaustive evaluation of all possible solutions can be performed within a practically feasible time frame for small and medium-sized networks, such an approach is out of scope for large problem instances which have significantly higher time and memory requirements. Therefore, this work investigates a specialized heuristic, which takes into account a particular set of optimization objectives and returns solutions representing the possible trade-offs between them. Due to its low computation time and acceptable margin of error, this heuristic can be employed by automatic decision systems operating in dynamic environments.\n
\n','
\n@inproceedings{LaGeSpRyZiKoTG-SDN-Controller-Placement-ITC2015,\n  author = {Stanislav Lange and Steffen Gebert and Joachim Spoerhase and Piotr Rygielski and Thomas Zinner and Samuel Kounev and Phuoc Tran-Gia},\n  title = {{Specialized Heuristics for the Controller Placement Problem in Large Scale SDN Networks}},\n  booktitle = {27th International Teletraffic Congress ({ITC 2015})},\n  address = {Ghent, Belgium},\n  day = {8--10},\n  month = {September},\n  year = {2015},\n  pages = {210--218},\n  url = {http://dx.doi.org/10.1109/ITC.2015.32},\n  doi = {10.1109/ITC.2015.32},\n  abstract = {{The Software Defined Networking~(SDN) concept introduces a paradigm shift in the networking world towards an externalized control plane which is logically centralized. When designing an SDN-based WAN architecture, it is of vital importance to find a feasible solution to the controller placement problem, i.e., to decide where to position a limited amount of resources within the network. In addition to time-independent constraints regarding aspects like scalability, resilience, and control plane communication delays, dynamically changing network conditions like traffic patterns or bandwidth demands need to be considered as well. Consequently, such dynamic environments call for a regular and fast recalculation of placements in order to adapt to the current situation in a timely manner. While an exhaustive evaluation of all possible solutions can be performed within a practically feasible time frame for small and medium-sized networks, such an approach is out of scope for large problem instances which have significantly higher time and memory requirements. Therefore, this work investigates a specialized heuristic, which takes into account a particular set of optimization objectives and returns solutions representing the possible trade-offs between them. Due to its low computation time and acceptable margin of error, this heuristic can be employed by automatic decision systems operating in dynamic environments.}},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/803.pdf}\n}\n
\n\n','{The Software Defined Networking~(SDN) concept introduces a paradigm shift in the networking world towards an externalized control plane which is logically centralized. When designing an SDN-based WAN architecture, it is of vital importance to find a feasible solution to the controller placement problem, i.e., to decide where to position a limited amount of resources within the network. In addition to time-independent constraints regarding aspects like scalability, resilience, and control plane communication delays, dynamically changing network conditions like traffic patterns or bandwidth demands need to be considered as well. Consequently, such dynamic environments call for a regular and fast recalculation of placements in order to adapt to the current situation in a timely manner. While an exhaustive evaluation of all possible solutions can be performed within a practically feasible time frame for small and medium-sized networks, such an approach is out of scope for large problem instances which have significantly higher time and memory requirements. Therefore, this work investigates a specialized heuristic, which takes into account a particular set of optimization objectives and returns solutions representing the possible trade-offs between them. Due to its low computation time and acceptable margin of error, this heuristic can be employed by automatic decision systems operating in dynamic environments.}','{Specialized Heuristics for the Controller Placement Problem in Large Scale SDN Networks}',0,9,2015,9,NULL,NULL,NULL,'2015-05-18 08:02:38','2016-06-01 09:41:04',0),(804,'talk','talk-Kounev-WsWue15','misc','@misc{talk-Kounev-WsWue15,\n author = {Samuel Kounev},\n title = {{Engineering & Provisioning of Cloud Applications - Research and Entrepreneurship}},\n howpublished = {Winder School, University of W\\\"urzburg, Germany},\n days = {17},\n month = {February},\n year = {2015},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/804},\n}\n\n','\n\nSamuel Kounev.\nEngineering & Provisioning of Cloud Applications - Research and\nEntrepreneurship.\nWinder School, University of Würzburg, Germany, February 2015.\n[ bib | slides  ] 
\n@misc{talk-Kounev-WsWue15,\nauthor = {Samuel Kounev},\ntitle = {{Engineering & Provisioning of Cloud Applications - Research and Entrepreneurship}},\nhowpublished = {Winder School, University of W\\\"urzburg, Germany},\ndays = {17},\nmonth = {February},\nyear = {2015},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/804}\n}\n
\n
\n','
\n@misc{talk-Kounev-WsWue15,\n  author = {Samuel Kounev},\n  title = {{Engineering & Provisioning of Cloud Applications - Research and Entrepreneurship}},\n  howpublished = {Winder School, University of W\\\"urzburg, Germany},\n  days = {17},\n  month = {February},\n  year = {2015},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/804}\n}\n
\n\n',NULL,'{Engineering & Provisioning of Cloud Applications - Research and Entrepreneurship}',0,2,2015,2,NULL,NULL,NULL,'2015-05-19 21:02:57','2016-06-01 09:41:04',0),(805,'talk','talk-Kounev-SPEC15','misc','@misc{talk-Kounev-SPEC15,\n author = {Samuel Kounev},\n title = {{The SPEC Research Group - Status Quo}},\n howpublished = {Talk at the SPEC 2015 Annual Meeting, Austin, Texas, USA},\n days = {5},\n month = {February},\n year = {2015},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/805},\n}\n\n','\n\nSamuel Kounev.\nThe SPEC Research Group - Status Quo.\nTalk at the SPEC 2015 Annual Meeting, Austin, Texas, USA, February\n2015.\n[ bib | slides  ] 
\n@misc{talk-Kounev-SPEC15,\nauthor = {Samuel Kounev},\ntitle = {{The SPEC Research Group - Status Quo}},\nhowpublished = {Talk at the SPEC 2015 Annual Meeting, Austin, Texas, USA},\ndays = {5},\nmonth = {February},\nyear = {2015},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/805}\n}\n
\n
\n','
\n@misc{talk-Kounev-SPEC15,\n  author = {Samuel Kounev},\n  title = {{The SPEC Research Group - Status Quo}},\n  howpublished = {Talk at the SPEC 2015 Annual Meeting, Austin, Texas, USA},\n  days = {5},\n  month = {February},\n  year = {2015},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/805}\n}\n
\n\n',NULL,'{The SPEC Research Group - Status Quo}',0,2,2015,2,NULL,NULL,NULL,'2015-05-21 08:52:29','2016-06-01 09:41:04',0),(806,'talk','talk-Kounev-LT15','misc','@misc{talk-Kounev-LT15,\n author = {Samuel Kounev},\n title = {{Load Testing Elasticity and Performance Isolation in Shared Execution Environments}},\n howpublished = {Keynote Talk at the 4th International Workshop on Large-Scale Testing (LT 2015), co-located with ICPE 2015, Austin, TX, USA},\n days = {1},\n month = {February},\n year = {2015},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/806},\n}\n\n','\n\nSamuel Kounev.\nLoad Testing Elasticity and Performance Isolation in Shared\nExecution Environments.\nKeynote Talk at the 4th International Workshop on Large-Scale Testing\n(LT 2015), co-located with ICPE 2015, Austin, TX, USA, February 2015.\n[ bib | slides  ] 
\n@misc{talk-Kounev-LT15,\nauthor = {Samuel Kounev},\ntitle = {{Load Testing Elasticity and Performance Isolation in Shared Execution Environments}},\nhowpublished = {Keynote Talk at the 4th International Workshop on Large-Scale Testing (LT 2015), co-located with ICPE 2015, Austin, TX, USA},\ndays = {1},\nmonth = {February},\nyear = {2015},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/806}\n}\n
\n
\n','
\n@misc{talk-Kounev-LT15,\n  author = {Samuel Kounev},\n  title = {{Load Testing Elasticity and Performance Isolation in Shared Execution Environments}},\n  howpublished = {Keynote Talk at the 4th International Workshop on Large-Scale Testing (LT 2015), co-located with ICPE 2015, Austin, TX, USA},\n  days = {1},\n  month = {February},\n  year = {2015},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/806}\n}\n
\n\n',NULL,'{Load Testing Elasticity and Performance Isolation in Shared Execution Environments}',0,2,2015,2,NULL,NULL,NULL,'2015-05-21 08:56:21','2016-06-01 09:41:04',0),(807,'talk','talk-Kounev-Dagstuhl15','misc','@misc{talk-Kounev-Dagstuhl15,\n author = {Samuel Kounev},\n title = {{Software Engineering for Self-Aware Computing}},\n howpublished = {Tutorial Talk at Dagstuhl Seminar 15041 on \'\'Model-driven Algorithms and Architectures for Self-Aware Computing Systems\'\'},\n days = {19},\n month = {January},\n year = {2015},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/807},\n}\n\n','\n\nSamuel Kounev.\nSoftware Engineering for Self-Aware Computing.\nTutorial Talk at Dagstuhl Seminar 15041 on ”Model-driven Algorithms\nand Architectures for Self-Aware Computing Systems”, January 2015.\n[ bib | slides  ] 
\n@misc{talk-Kounev-Dagstuhl15,\nauthor = {Samuel Kounev},\ntitle = {{Software Engineering for Self-Aware Computing}},\nhowpublished = {Tutorial Talk at Dagstuhl Seminar 15041 on \'\'Model-driven Algorithms and Architectures for Self-Aware Computing Systems\'\'},\ndays = {19},\nmonth = {January},\nyear = {2015},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/807}\n}\n
\n
\n','
\n@misc{talk-Kounev-Dagstuhl15,\n  author = {Samuel Kounev},\n  title = {{Software Engineering for Self-Aware Computing}},\n  howpublished = {Tutorial Talk at Dagstuhl Seminar 15041 on \'\'Model-driven Algorithms and Architectures for Self-Aware Computing Systems\'\'},\n  days = {19},\n  month = {January},\n  year = {2015},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/807}\n}\n
\n\n',NULL,'{Software Engineering for Self-Aware Computing}',0,1,2015,1,NULL,NULL,NULL,'2015-05-21 08:59:01','2016-06-01 09:41:04',0),(808,'talk','talk-Kounev-Dagstuhl15-2','misc','@misc{talk-Kounev-Dagstuhl15-2,\n author = {Samuel Kounev},\n title = {{The Descartes Modeling Language and Tool Chain}},\n howpublished = {Presentation at Dagstuhl Seminar 15041 on \'\'Model-driven Algorithms and Architectures for Self-Aware Computing Systems\'\'},\n days = {21},\n month = {January},\n year = {2015},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/808},\n}\n\n','\n\nSamuel Kounev.\nThe Descartes Modeling Language and Tool Chain.\nPresentation at Dagstuhl Seminar 15041 on ”Model-driven Algorithms\nand Architectures for Self-Aware Computing Systems”, January 2015.\n[ bib | slides  ] 
\n@misc{talk-Kounev-Dagstuhl15-2,\nauthor = {Samuel Kounev},\ntitle = {{The Descartes Modeling Language and Tool Chain}},\nhowpublished = {Presentation at Dagstuhl Seminar 15041 on \'\'Model-driven Algorithms and Architectures for Self-Aware Computing Systems\'\'},\ndays = {21},\nmonth = {January},\nyear = {2015},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/808}\n}\n
\n
\n','
\n@misc{talk-Kounev-Dagstuhl15-2,\n  author = {Samuel Kounev},\n  title = {{The Descartes Modeling Language and Tool Chain}},\n  howpublished = {Presentation at Dagstuhl Seminar 15041 on \'\'Model-driven Algorithms and Architectures for Self-Aware Computing Systems\'\'},\n  days = {21},\n  month = {January},\n  year = {2015},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/808}\n}\n
\n\n',NULL,'{The Descartes Modeling Language and Tool Chain}',0,1,2015,1,NULL,NULL,NULL,'2015-05-21 09:02:30','2016-06-01 09:41:04',0),(809,'talk','talk-Kounev-Florence15','misc','@misc{talk-Kounev-Florence15,\n author = {Samuel Kounev},\n title = {{Quantitative Evaluation of Service Dependability in Shared Execution Environments}},\n howpublished = {Keynote Talk at FLORENCE 2014 - a joint scientific event of QEST 2014, SAFECOMP 2014, FORMATS 2014, EPEW 2014 and FMICS 2014, Florence, Italy},\n days = {8-12},\n month = {September},\n year = {2014},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/809},\n}\n\n','\n\nSamuel Kounev.\nQuantitative Evaluation of Service Dependability in Shared Execution\nEnvironments.\nKeynote Talk at FLORENCE 2014 - a joint scientific event of QEST\n2014, SAFECOMP 2014, FORMATS 2014, EPEW 2014 and FMICS 2014, Florence, Italy,\nSeptember 2014.\n[ bib | slides  ] 
\n@misc{talk-Kounev-Florence15,\nauthor = {Samuel Kounev},\ntitle = {{Quantitative Evaluation of Service Dependability in Shared Execution Environments}},\nhowpublished = {Keynote Talk at FLORENCE 2014 - a joint scientific event of QEST 2014, SAFECOMP 2014, FORMATS 2014, EPEW 2014 and FMICS 2014, Florence, Italy},\ndays = {8-12},\nmonth = {September},\nyear = {2014},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/809}\n}\n
\n
\n','
\n@misc{talk-Kounev-Florence15,\n  author = {Samuel Kounev},\n  title = {{Quantitative Evaluation of Service Dependability in Shared Execution Environments}},\n  howpublished = {Keynote Talk at FLORENCE 2014 - a joint scientific event of QEST 2014, SAFECOMP 2014, FORMATS 2014, EPEW 2014 and FMICS 2014, Florence, Italy},\n  days = {8-12},\n  month = {September},\n  year = {2014},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/809}\n}\n
\n\n',NULL,'{Quantitative Evaluation of Service Dependability in Shared Execution Environments}',0,9,2014,9,NULL,NULL,NULL,'2015-05-21 09:05:51','2016-06-01 09:41:04',0),(810,'talk','talk-Kounev-WelcomeWue14','misc','@misc{talk-Kounev-WelcomeWue14,\n author = {Samuel Kounev},\n title = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\n howpublished = {Faculty of Mathematics and Computer Science, University of W\\\"{u}rzburg},\n days = {5},\n month = {May},\n year = {2014},\n}\n\n','\n\nSamuel Kounev.\nIngenieurmässige Entwicklung verlässlicher und effizienter\nSoftware-Systeme.\nFaculty of Mathematics and Computer Science, University of\nWürzburg, May 2014.\n[ bib  ] 
\n@misc{talk-Kounev-WelcomeWue14,\nauthor = {Samuel Kounev},\ntitle = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\nhowpublished = {Faculty of Mathematics and Computer Science, University of W\\\"{u}rzburg},\ndays = {5},\nmonth = {May},\nyear = {2014}\n}\n
\n
\n','
\n@misc{talk-Kounev-WelcomeWue14,\n  author = {Samuel Kounev},\n  title = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\n  howpublished = {Faculty of Mathematics and Computer Science, University of W\\\"{u}rzburg},\n  days = {5},\n  month = {May},\n  year = {2014}\n}\n
\n\n',NULL,'{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}',0,5,2014,5,NULL,NULL,NULL,'2015-05-21 09:08:40','2016-06-01 09:41:04',0),(811,'talk','talk-Kounev-SOSP14','misc','@misc{talk-Kounev-SOSP14,\n author = {Samuel Kounev},\n title = {{The Descartes Modeling Language: Status Quo}},\n howpublished = {Technical Talk at the Symposium on Software Performance (SOSP 2014), Joint Descartes/Kieker/Palladio Days (Joint Developer and Community Meeting), Stuttgart, Germany},\n days = {26-28},\n month = {November},\n year = {2014},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/811},\n}\n\n','\n\nSamuel Kounev.\nThe Descartes Modeling Language: Status Quo.\nTechnical Talk at the Symposium on Software Performance (SOSP 2014),\nJoint Descartes/Kieker/Palladio Days (Joint Developer and Community Meeting),\nStuttgart, Germany, November 2014.\n[ bib | slides  ] 
\n@misc{talk-Kounev-SOSP14,\nauthor = {Samuel Kounev},\ntitle = {{The Descartes Modeling Language: Status Quo}},\nhowpublished = {Technical Talk at the Symposium on Software Performance (SOSP 2014), Joint Descartes/Kieker/Palladio Days (Joint Developer and Community Meeting), Stuttgart, Germany},\ndays = {26-28},\nmonth = {November},\nyear = {2014},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/811}\n}\n
\n
\n','
\n@misc{talk-Kounev-SOSP14,\n  author = {Samuel Kounev},\n  title = {{The Descartes Modeling Language: Status Quo}},\n  howpublished = {Technical Talk at the Symposium on Software Performance (SOSP 2014), Joint Descartes/Kieker/Palladio Days (Joint Developer and Community Meeting), Stuttgart, Germany},\n  days = {26-28},\n  month = {November},\n  year = {2014},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/811}\n}\n
\n\n',NULL,'{The Descartes Modeling Language: Status Quo}',0,11,2014,11,NULL,NULL,NULL,'2015-05-21 09:10:31','2016-06-01 09:41:04',0),(812,'talk','talk-Kounev-VMWare13','misc','@misc{talk-Kounev-VMWare13,\n author = {Samuel Kounev},\n title = {{Online model-based performance and resource management in virtualized application environments}},\n howpublished = {Invited Talk. 2013 VMware Academic Research Symposium, Palo Alto, CA, USA},\n days = {17},\n month = {July},\n year = {2013},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/812},\n}\n\n','\n\nSamuel Kounev.\nOnline model-based performance and resource management in\nvirtualized application environments.\nInvited Talk. 2013 VMware Academic Research Symposium, Palo Alto, CA,\nUSA, July 2013.\n[ bib | slides  ] 
\n@misc{talk-Kounev-VMWare13,\nauthor = {Samuel Kounev},\ntitle = {{Online model-based performance and resource management in virtualized application environments}},\nhowpublished = {Invited Talk. 2013 VMware Academic Research Symposium, Palo Alto, CA, USA},\ndays = {17},\nmonth = {July},\nyear = {2013},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/812}\n}\n
\n
\n','
\n@misc{talk-Kounev-VMWare13,\n  author = {Samuel Kounev},\n  title = {{Online model-based performance and resource management in virtualized application environments}},\n  howpublished = {Invited Talk. 2013 VMware Academic Research Symposium, Palo Alto, CA, USA},\n  days = {17},\n  month = {July},\n  year = {2013},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/812}\n}\n
\n\n',NULL,'{Online model-based performance and resource management in virtualized application environments}',0,7,2013,7,NULL,NULL,NULL,'2015-05-21 09:14:16','2016-06-01 09:41:04',0),(813,'talk','talk-Kounev-Salesforce13','misc','@misc{talk-Kounev-Salesforce13,\n author = {Samuel Kounev},\n title = {{Online workload forecasting and performance prediction for elastic capacity management in cloud environments}},\n howpublished = {Invited Talk. Salesforce.com, San Francisco, CA, USA},\n days = {16},\n month = {July},\n year = {2013},\n}\n\n','\n\nSamuel Kounev.\nOnline workload forecasting and performance prediction for elastic\ncapacity management in cloud environments.\nInvited Talk. Salesforce.com, San Francisco, CA, USA, July 2013.\n[ bib  ] 
\n@misc{talk-Kounev-Salesforce13,\nauthor = {Samuel Kounev},\ntitle = {{Online workload forecasting and performance prediction for elastic capacity management in cloud environments}},\nhowpublished = {Invited Talk. Salesforce.com, San Francisco, CA, USA},\ndays = {16},\nmonth = {July},\nyear = {2013}\n}\n
\n
\n','
\n@misc{talk-Kounev-Salesforce13,\n  author = {Samuel Kounev},\n  title = {{Online workload forecasting and performance prediction for elastic capacity management in cloud environments}},\n  howpublished = {Invited Talk. Salesforce.com, San Francisco, CA, USA},\n  days = {16},\n  month = {July},\n  year = {2013}\n}\n
\n\n',NULL,'{Online workload forecasting and performance prediction for elastic capacity management in cloud environments}',0,7,2013,7,NULL,NULL,NULL,'2015-05-21 09:16:15','2016-06-01 09:41:04',0),(814,'talk','talk-Kounev-hottopics13','misc','@misc{talk-Kounev-hottopics13,\n author = {Samuel Kounev},\n title = {{RELATE: A Research Training Network on Engineering and Provisioning of Service-Based Cloud Applications}},\n howpublished = {Invited Talk, International Workshop on Hot Topics in Cloud Services (HotTopiCS 2013), Prague, Czech Republic},\n days = {20-21},\n month = {April},\n year = {2013},\n}\n\n','\n\nSamuel Kounev.\nRELATE: A Research Training Network on Engineering and Provisioning\nof Service-Based Cloud Applications.\nInvited Talk, International Workshop on Hot Topics in Cloud Services\n(HotTopiCS 2013), Prague, Czech Republic, April 2013.\n[ bib  ] 
\n@misc{talk-Kounev-hottopics13,\nauthor = {Samuel Kounev},\ntitle = {{RELATE: A Research Training Network on Engineering and Provisioning of Service-Based Cloud Applications}},\nhowpublished = {Invited Talk, International Workshop on Hot Topics in Cloud Services (HotTopiCS 2013), Prague, Czech Republic},\ndays = {20-21},\nmonth = {April},\nyear = {2013}\n}\n
\n
\n','
\n@misc{talk-Kounev-hottopics13,\n  author = {Samuel Kounev},\n  title = {{RELATE: A Research Training Network on Engineering and Provisioning of Service-Based Cloud Applications}},\n  howpublished = {Invited Talk, International Workshop on Hot Topics in Cloud Services (HotTopiCS 2013), Prague, Czech Republic},\n  days = {20-21},\n  month = {April},\n  year = {2013}\n}\n
\n\n',NULL,'{RELATE: A Research Training Network on Engineering and Provisioning of Service-Based Cloud Applications}',0,4,2013,4,NULL,NULL,NULL,'2015-05-21 09:19:29','2016-06-01 09:41:04',0),(815,'talk','talk-Kounev-ERCFinal','misc','@misc{talk-Kounev-ERCFinal,\n author = {Samuel Kounev},\n title = {{ERC Starting Grant Finalist}},\n howpublished = {(top 18\\% out of 3.329 StG applicants), European Research Council, Brussels, Belgium},\n}\n\n','\n\nSamuel Kounev.\nERC Starting Grant Finalist.\n(top 18% out of 3.329 StG applicants), European Research Council,\nBrussels, Belgium.\n[ bib  ] 
\n@misc{talk-Kounev-ERCFinal,\nauthor = {Samuel Kounev},\ntitle = {{ERC Starting Grant Finalist}},\nhowpublished = {(top 18\\% out of 3.329 StG applicants), European Research Council, Brussels, Belgium}\n}\n
\n
\n','
\n@misc{talk-Kounev-ERCFinal,\n  author = {Samuel Kounev},\n  title = {{ERC Starting Grant Finalist}},\n  howpublished = {(top 18\\% out of 3.329 StG applicants), European Research Council, Brussels, Belgium}\n}\n
\n\n',NULL,'{ERC Starting Grant Finalist}',0,0,NULL,0,NULL,NULL,NULL,'2015-05-21 09:21:08','2016-06-01 09:41:04',0),(816,'talk','talk-Kounev-DMMDublin13','misc','@misc{talk-Kounev-DMMDublin13,\n author = {Samuel Kounev},\n title = {{The Descartes Meta-Model (DMM) - An Architecture-level Modeling Language for Online Quality-of-Service and Resource Management}},\n howpublished = {Invited Talk. UCD School of Computer Science and Informatics, University College Dublin, Dublin, Ireland},\n days = {22},\n month = {March},\n year = {2013},\n}\n\n','\n\nSamuel Kounev.\nThe Descartes Meta-Model (DMM) - An Architecture-level Modeling\nLanguage for Online Quality-of-Service and Resource Management.\nInvited Talk. UCD School of Computer Science and Informatics,\nUniversity College Dublin, Dublin, Ireland, March 2013.\n[ bib  ] 
\n@misc{talk-Kounev-DMMDublin13,\nauthor = {Samuel Kounev},\ntitle = {{The Descartes Meta-Model (DMM) - An Architecture-level Modeling Language for Online Quality-of-Service and Resource Management}},\nhowpublished = {Invited Talk. UCD School of Computer Science and Informatics, University College Dublin, Dublin, Ireland},\ndays = {22},\nmonth = {March},\nyear = {2013}\n}\n
\n
\n','
\n@misc{talk-Kounev-DMMDublin13,\n  author = {Samuel Kounev},\n  title = {{The Descartes Meta-Model (DMM) - An Architecture-level Modeling Language for Online Quality-of-Service and Resource Management}},\n  howpublished = {Invited Talk. UCD School of Computer Science and Informatics, University College Dublin, Dublin, Ireland},\n  days = {22},\n  month = {March},\n  year = {2013}\n}\n
\n\n',NULL,'{The Descartes Meta-Model (DMM) - An Architecture-level Modeling Language for Online Quality-of-Service and Resource Management}',0,3,2013,3,NULL,NULL,NULL,'2015-05-21 09:22:11','2016-06-01 09:41:04',0),(817,'talk','talk-Kounev-WueInv13','misc','@misc{talk-Kounev-WueInv13,\n author = {Samuel Kounev},\n title = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\n howpublished = {Invited Talk, Faculty of Mathematics and Computer Science, University of W\\\"{u}rzburg, W\\\"{u}rzburg},\n days = {5},\n month = {March},\n year = {2013},\n}\n\n','\n\nSamuel Kounev.\nIngenieurmässige Entwicklung verlässlicher und effizienter\nSoftware-Systeme.\nInvited Talk, Faculty of Mathematics and Computer Science, University\nof Würzburg, Würzburg, March 2013.\n[ bib  ] 
\n@misc{talk-Kounev-WueInv13,\nauthor = {Samuel Kounev},\ntitle = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\nhowpublished = {Invited Talk, Faculty of Mathematics and Computer Science, University of W\\\"{u}rzburg, W\\\"{u}rzburg},\ndays = {5},\nmonth = {March},\nyear = {2013}\n}\n
\n
\n','
\n@misc{talk-Kounev-WueInv13,\n  author = {Samuel Kounev},\n  title = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\n  howpublished = {Invited Talk, Faculty of Mathematics and Computer Science, University of W\\\"{u}rzburg, W\\\"{u}rzburg},\n  days = {5},\n  month = {March},\n  year = {2013}\n}\n
\n\n',NULL,'{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}',0,3,2013,3,NULL,NULL,NULL,'2015-05-21 09:25:30','2016-06-01 10:34:02',0),(818,'talk','talk-Kounev-relate-KIT-12','misc','@misc{talk-Kounev-relate-KIT-12,\n author = {Samuel Kounev},\n title = {{Design-Time vs. Run-Time Models for Quality-of-Service Prediction}},\n howpublished = {Keynote Talk, Open Excellence Workshop on \"Online Models for Quality-of-Service and Resource Management in Modern IT Systems\" organized by the \"RELATE\" FP7 Marie Curie Initial Training Network (ITN), Karlsruhe, Germany},\n days = {4},\n month = {December},\n year = {2012},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/818},\n}\n\n','\n\nSamuel Kounev.\nDesign-Time vs. Run-Time Models for Quality-of-Service Prediction.\nKeynote Talk, Open Excellence Workshop on \"Online Models for\nQuality-of-Service and Resource Management in Modern IT Systems\" organized by\nthe \"RELATE\" FP7 Marie Curie Initial Training Network (ITN), Karlsruhe,\nGermany, December 2012.\n[ bib | slides  ] 
\n@misc{talk-Kounev-relate-KIT-12,\nauthor = {Samuel Kounev},\ntitle = {{Design-Time vs. Run-Time Models for Quality-of-Service Prediction}},\nhowpublished = {Keynote Talk, Open Excellence Workshop on \"Online Models for Quality-of-Service and Resource Management in Modern IT Systems\" organized by the \"RELATE\" FP7 Marie Curie Initial Training Network (ITN), Karlsruhe, Germany},\ndays = {4},\nmonth = {December},\nyear = {2012},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/818}\n}\n
\n
\n','
\n@misc{talk-Kounev-relate-KIT-12,\n  author = {Samuel Kounev},\n  title = {{Design-Time vs. Run-Time Models for Quality-of-Service Prediction}},\n  howpublished = {Keynote Talk, Open Excellence Workshop on \"Online Models for Quality-of-Service and Resource Management in Modern IT Systems\" organized by the \"RELATE\" FP7 Marie Curie Initial Training Network (ITN), Karlsruhe, Germany},\n  days = {4},\n  month = {December},\n  year = {2012},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/818}\n}\n
\n\n',NULL,'{Design-Time vs. Run-Time Models for Quality-of-Service Prediction}',0,12,2012,12,NULL,NULL,NULL,'2015-05-21 09:34:37','2016-06-01 09:41:04',0),(819,'talk','talk-Kounev-InvUlm12','misc','@misc{talk-Kounev-InvUlm12,\n author = {Samuel Kounev},\n title = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\n howpublished = {Invited Talk, Faculty of Engineering and Computer Science, University of Ulm, Ulm, Germany},\n days = {12},\n month = {November},\n year = {2012},\n}\n\n','\n\nSamuel Kounev.\nIngenieurmässige Entwicklung verlässlicher und effizienter\nSoftware-Systeme.\nInvited Talk, Faculty of Engineering and Computer Science, University\nof Ulm, Ulm, Germany, November 2012.\n[ bib  ] 
\n@misc{talk-Kounev-InvUlm12,\nauthor = {Samuel Kounev},\ntitle = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\nhowpublished = {Invited Talk, Faculty of Engineering and Computer Science, University of Ulm, Ulm, Germany},\ndays = {12},\nmonth = {November},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Kounev-InvUlm12,\n  author = {Samuel Kounev},\n  title = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\n  howpublished = {Invited Talk, Faculty of Engineering and Computer Science, University of Ulm, Ulm, Germany},\n  days = {12},\n  month = {November},\n  year = {2012}\n}\n
\n\n',NULL,'{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}',0,11,2012,11,NULL,NULL,NULL,'2015-05-21 09:56:58','2016-06-01 09:41:04',0),(820,'talk','talk-Kounev-InvStutt12','misc','@misc{talk-Kounev-InvStutt12,\n author = {Samuel Kounev},\n title = {{Engineering of Dependable and Efficient Self-Aware Complex Systems}},\n howpublished = {Invited Talk (Kolloquiumsvortrag), Faculty of Computer Science, Electrical Engineering and Information Technology, University of Stuttgart, Stuttgart, Germany},\n days = {9},\n month = {July},\n year = {2012},\n}\n\n','\n\nSamuel Kounev.\nEngineering of Dependable and Efficient Self-Aware Complex Systems.\nInvited Talk (Kolloquiumsvortrag), Faculty of Computer Science,\nElectrical Engineering and Information Technology, University of Stuttgart,\nStuttgart, Germany, July 2012.\n[ bib  ] 
\n@misc{talk-Kounev-InvStutt12,\nauthor = {Samuel Kounev},\ntitle = {{Engineering of Dependable and Efficient Self-Aware Complex Systems}},\nhowpublished = {Invited Talk (Kolloquiumsvortrag), Faculty of Computer Science, Electrical Engineering and Information Technology, University of Stuttgart, Stuttgart, Germany},\ndays = {9},\nmonth = {July},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Kounev-InvStutt12,\n  author = {Samuel Kounev},\n  title = {{Engineering of Dependable and Efficient Self-Aware Complex Systems}},\n  howpublished = {Invited Talk (Kolloquiumsvortrag), Faculty of Computer Science, Electrical Engineering and Information Technology, University of Stuttgart, Stuttgart, Germany},\n  days = {9},\n  month = {July},\n  year = {2012}\n}\n
\n\n',NULL,'{Engineering of Dependable and Efficient Self-Aware Complex Systems}',0,7,2012,7,NULL,NULL,NULL,'2015-05-21 10:01:32','2016-06-01 09:41:04',0),(821,'talk','talk-Kounev-InvPassau12','misc','@misc{talk-Kounev-InvPassau12,\n author = {Samuel Kounev},\n title = {{Engineering of Dependable and Efficient Self-Aware Complex Systems}},\n howpublished = {Invited Talk, Faculty of Computer Science and Mathematics, University of Passau, Passau, Germany},\n days = {29},\n month = {June},\n year = {2012},\n}\n\n','\n\nSamuel Kounev.\nEngineering of Dependable and Efficient Self-Aware Complex Systems.\nInvited Talk, Faculty of Computer Science and Mathematics, University\nof Passau, Passau, Germany, June 2012.\n[ bib  ] 
\n@misc{talk-Kounev-InvPassau12,\nauthor = {Samuel Kounev},\ntitle = {{Engineering of Dependable and Efficient Self-Aware Complex Systems}},\nhowpublished = {Invited Talk, Faculty of Computer Science and Mathematics, University of Passau, Passau, Germany},\ndays = {29},\nmonth = {June},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Kounev-InvPassau12,\n  author = {Samuel Kounev},\n  title = {{Engineering of Dependable and Efficient Self-Aware Complex Systems}},\n  howpublished = {Invited Talk, Faculty of Computer Science and Mathematics, University of Passau, Passau, Germany},\n  days = {29},\n  month = {June},\n  year = {2012}\n}\n
\n\n',NULL,'{Engineering of Dependable and Efficient Self-Aware Complex Systems}',0,6,2012,6,NULL,NULL,NULL,'2015-05-21 10:23:52','2016-06-01 09:41:04',0),(822,'talk','talk-Kounev-InvPrague12','misc','@misc{talk-Kounev-InvPrague12,\n author = {Samuel Kounev},\n title = {{Introduction to the Descartes Meta-Model (DMM)}},\n howpublished = {Invited Talk, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic},\n days = {4},\n month = {June},\n year = {2012},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/822},\n}\n\n','\n\nSamuel Kounev.\nIntroduction to the Descartes Meta-Model (DMM).\nInvited Talk, Faculty of Mathematics and Physics, Charles University,\nPrague, Czech Republic, June 2012.\n[ bib | slides  ] 
\n@misc{talk-Kounev-InvPrague12,\nauthor = {Samuel Kounev},\ntitle = {{Introduction to the Descartes Meta-Model (DMM)}},\nhowpublished = {Invited Talk, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic},\ndays = {4},\nmonth = {June},\nyear = {2012},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/822}\n}\n
\n
\n','
\n@misc{talk-Kounev-InvPrague12,\n  author = {Samuel Kounev},\n  title = {{Introduction to the Descartes Meta-Model (DMM)}},\n  howpublished = {Invited Talk, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic},\n  days = {4},\n  month = {June},\n  year = {2012},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/822}\n}\n
\n\n',NULL,'{Introduction to the Descartes Meta-Model (DMM)}',0,6,2012,6,NULL,NULL,NULL,'2015-05-21 10:25:20','2016-06-01 09:41:04',0),(823,'talk','talk-Kounev-Dagstuhl12','misc','@misc{talk-Kounev-Dagstuhl12,\n author = {Samuel Kounev},\n title = {{Engineering of Self-Aware Software Systems -- An Online Model-based Approach}},\n howpublished = {Dagstuhl Seminar 12211 \'\'Quality-of-Service Attributes in Service- and Cloud-based Systems\'\', Schloss Dagstuhl, Germany},\n days = {23},\n month = {May},\n year = {2012},\n}\n\n','\n\nSamuel Kounev.\nEngineering of Self-Aware Software Systems - An Online Model-based\nApproach.\nDagstuhl Seminar 12211 ”Quality-of-Service Attributes in Service-\nand Cloud-based Systems”, Schloss Dagstuhl, Germany, May 2012.\n[ bib  ] 
\n@misc{talk-Kounev-Dagstuhl12,\nauthor = {Samuel Kounev},\ntitle = {{Engineering of Self-Aware Software Systems -- An Online Model-based Approach}},\nhowpublished = {Dagstuhl Seminar 12211 \'\'Quality-of-Service Attributes in Service- and Cloud-based Systems\'\', Schloss Dagstuhl, Germany},\ndays = {23},\nmonth = {May},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Kounev-Dagstuhl12,\n  author = {Samuel Kounev},\n  title = {{Engineering of Self-Aware Software Systems -- An Online Model-based Approach}},\n  howpublished = {Dagstuhl Seminar 12211 \'\'Quality-of-Service Attributes in Service- and Cloud-based Systems\'\', Schloss Dagstuhl, Germany},\n  days = {23},\n  month = {May},\n  year = {2012}\n}\n
\n\n',NULL,'{Engineering of Self-Aware Software Systems -- An Online Model-based Approach}',0,5,2012,5,NULL,NULL,NULL,'2015-05-21 10:27:47','2016-06-01 09:41:04',0),(824,'talk','talk-Kounev-Cloudzone12','misc','@misc{talk-Kounev-Cloudzone12,\n author = {Samuel Kounev},\n title = {{Cloud Computing Challenges and Opportunities for Service Providers}},\n howpublished = {Invited Talk, CLOUDZONE 2012, Karlsruher Messe- und Kongress-GmbH, Karlsruhe, Germany},\n days = {11},\n month = {May},\n year = {2012},\n}\n\n','\n\nSamuel Kounev.\nCloud Computing Challenges and Opportunities for Service Providers.\nInvited Talk, CLOUDZONE 2012, Karlsruher Messe- und Kongress-GmbH,\nKarlsruhe, Germany, May 2012.\n[ bib  ] 
\n@misc{talk-Kounev-Cloudzone12,\nauthor = {Samuel Kounev},\ntitle = {{Cloud Computing Challenges and Opportunities for Service Providers}},\nhowpublished = {Invited Talk, CLOUDZONE 2012, Karlsruher Messe- und Kongress-GmbH, Karlsruhe, Germany},\ndays = {11},\nmonth = {May},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Kounev-Cloudzone12,\n  author = {Samuel Kounev},\n  title = {{Cloud Computing Challenges and Opportunities for Service Providers}},\n  howpublished = {Invited Talk, CLOUDZONE 2012, Karlsruher Messe- und Kongress-GmbH, Karlsruhe, Germany},\n  days = {11},\n  month = {May},\n  year = {2012}\n}\n
\n\n',NULL,'{Cloud Computing Challenges and Opportunities for Service Providers}',0,5,2012,5,NULL,NULL,NULL,'2015-05-21 10:32:40','2016-06-01 09:41:04',0),(825,'talk','talk-Kounev-SAPResearch12','misc','@misc{talk-Kounev-SAPResearch12,\n author = {Samuel Kounev},\n title = {{The Descartes Meta-Model for Online QoS and Resource Management}},\n howpublished = {Invited Talk, SAP Research, Karlsruhe/Darmstadt, Germany},\n days = {4},\n month = {May},\n year = {2012},\n}\n\n','\n\nSamuel Kounev.\nThe Descartes Meta-Model for Online QoS and Resource Management.\nInvited Talk, SAP Research, Karlsruhe/Darmstadt, Germany, May 2012.\n[ bib  ] 
\n@misc{talk-Kounev-SAPResearch12,\nauthor = {Samuel Kounev},\ntitle = {{The Descartes Meta-Model for Online QoS and Resource Management}},\nhowpublished = {Invited Talk, SAP Research, Karlsruhe/Darmstadt, Germany},\ndays = {4},\nmonth = {May},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Kounev-SAPResearch12,\n  author = {Samuel Kounev},\n  title = {{The Descartes Meta-Model for Online QoS and Resource Management}},\n  howpublished = {Invited Talk, SAP Research, Karlsruhe/Darmstadt, Germany},\n  days = {4},\n  month = {May},\n  year = {2012}\n}\n
\n\n',NULL,'{The Descartes Meta-Model for Online QoS and Resource Management}',0,5,2012,5,NULL,NULL,NULL,'2015-05-21 10:33:54','2016-06-01 09:41:04',0),(826,'talk','talk-Kounev-IBM12','misc','@misc{talk-Kounev-IBM12,\n author = {Samuel Kounev},\n title = {{Model-based Self-Adaptive Resource Management in Virtualized Environments}},\n howpublished = {Invited Talk, IBM T.J. Watson Research Center, New York, USA},\n days = {27},\n month = {April},\n year = {2012},\n}\n\n','\n\nSamuel Kounev.\nModel-based Self-Adaptive Resource Management in Virtualized\nEnvironments.\nInvited Talk, IBM T.J. Watson Research Center, New York, USA, April\n2012.\n[ bib  ] 
\n@misc{talk-Kounev-IBM12,\nauthor = {Samuel Kounev},\ntitle = {{Model-based Self-Adaptive Resource Management in Virtualized Environments}},\nhowpublished = {Invited Talk, IBM T.J. Watson Research Center, New York, USA},\ndays = {27},\nmonth = {April},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Kounev-IBM12,\n  author = {Samuel Kounev},\n  title = {{Model-based Self-Adaptive Resource Management in Virtualized Environments}},\n  howpublished = {Invited Talk, IBM T.J. Watson Research Center, New York, USA},\n  days = {27},\n  month = {April},\n  year = {2012}\n}\n
\n\n',NULL,'{Model-based Self-Adaptive Resource Management in Virtualized Environments}',0,4,2012,4,NULL,NULL,NULL,'2015-05-21 10:38:47','2016-06-01 09:41:04',0),(827,'talk','talk-Kounev-AMCSPEC12','misc','@misc{talk-Kounev-AMCSPEC12,\n author = {Samuel Kounev},\n title = {{Introduction to Queueing Petri Nets: Modeling Formalism, Tool Support and Case Studies}},\n howpublished = {Tutorial Presentation, 3rd ACM/SPEC International Conference on Performance Engineering (ICPE 2012), Boston, USA},\n days = {22},\n month = {April},\n year = {2012},\n}\n\n','\n\nSamuel Kounev.\nIntroduction to Queueing Petri Nets: Modeling Formalism, Tool\nSupport and Case Studies.\nTutorial Presentation, 3rd ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2012), Boston, USA, April 2012.\n[ bib  ] 
\n@misc{talk-Kounev-AMCSPEC12,\nauthor = {Samuel Kounev},\ntitle = {{Introduction to Queueing Petri Nets: Modeling Formalism, Tool Support and Case Studies}},\nhowpublished = {Tutorial Presentation, 3rd ACM/SPEC International Conference on Performance Engineering (ICPE 2012), Boston, USA},\ndays = {22},\nmonth = {April},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Kounev-AMCSPEC12,\n  author = {Samuel Kounev},\n  title = {{Introduction to Queueing Petri Nets: Modeling Formalism, Tool Support and Case Studies}},\n  howpublished = {Tutorial Presentation, 3rd ACM/SPEC International Conference on Performance Engineering (ICPE 2012), Boston, USA},\n  days = {22},\n  month = {April},\n  year = {2012}\n}\n
\n\n',NULL,'{Introduction to Queueing Petri Nets: Modeling Formalism, Tool Support and Case Studies}',0,4,2012,4,NULL,NULL,NULL,'2015-05-21 10:42:08','2016-06-01 09:41:04',0),(828,'talk','talk-Kounev-FESCA12','misc','@misc{talk-Kounev-FESCA12,\n author = {Samuel Kounev},\n title = {{Modeling of Event-based Communication in Component-based Architectures: State-of-the-Art and Future Directions}},\n howpublished = {Keynote Talk, 9th International Workshop on Formal Engineering approaches to Software Components and Architectures (FESCA @ ETAPS 2012), Tallinn, Estonia},\n days = {31},\n month = {March},\n year = {2012},\n}\n\n','\n\nSamuel Kounev.\nModeling of Event-based Communication in Component-based\nArchitectures: State-of-the-Art and Future Directions.\nKeynote Talk, 9th International Workshop on Formal Engineering\napproaches to Software Components and Architectures (FESCA @ ETAPS 2012),\nTallinn, Estonia, March 2012.\n[ bib  ] 
\n@misc{talk-Kounev-FESCA12,\nauthor = {Samuel Kounev},\ntitle = {{Modeling of Event-based Communication in Component-based Architectures: State-of-the-Art and Future Directions}},\nhowpublished = {Keynote Talk, 9th International Workshop on Formal Engineering approaches to Software Components and Architectures (FESCA @ ETAPS 2012), Tallinn, Estonia},\ndays = {31},\nmonth = {March},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Kounev-FESCA12,\n  author = {Samuel Kounev},\n  title = {{Modeling of Event-based Communication in Component-based Architectures: State-of-the-Art and Future Directions}},\n  howpublished = {Keynote Talk, 9th International Workshop on Formal Engineering approaches to Software Components and Architectures (FESCA @ ETAPS 2012), Tallinn, Estonia},\n  days = {31},\n  month = {March},\n  year = {2012}\n}\n
\n\n',NULL,'{Modeling of Event-based Communication in Component-based Architectures: State-of-the-Art and Future Directions}',0,3,2012,3,NULL,NULL,NULL,'2015-05-21 10:44:52','2016-06-01 09:41:04',0),(829,'talk','talk-Kounev-MultiSkill-KIT12','misc','@misc{talk-Kounev-MultiSkill-KIT12,\n author = {Samuel Kounev},\n title = {{Industry Trends and Research Challenges in Cloud Computing}},\n howpublished = {Keynote Talk, Multi-Skills Training Camp, \"RELATE\" Marie Curie Initial Training Network (ITN), Karlsruhe, Germany},\n days = {13},\n month = {March},\n year = {2012},\n}\n\n','\n\nSamuel Kounev.\nIndustry Trends and Research Challenges in Cloud Computing.\nKeynote Talk, Multi-Skills Training Camp, \"RELATE\" Marie Curie\nInitial Training Network (ITN), Karlsruhe, Germany, March 2012.\n[ bib  ] 
\n@misc{talk-Kounev-MultiSkill-KIT12,\nauthor = {Samuel Kounev},\ntitle = {{Industry Trends and Research Challenges in Cloud Computing}},\nhowpublished = {Keynote Talk, Multi-Skills Training Camp, \"RELATE\" Marie Curie Initial Training Network (ITN), Karlsruhe, Germany},\ndays = {13},\nmonth = {March},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Kounev-MultiSkill-KIT12,\n  author = {Samuel Kounev},\n  title = {{Industry Trends and Research Challenges in Cloud Computing}},\n  howpublished = {Keynote Talk, Multi-Skills Training Camp, \"RELATE\" Marie Curie Initial Training Network (ITN), Karlsruhe, Germany},\n  days = {13},\n  month = {March},\n  year = {2012}\n}\n
\n\n',NULL,'{Industry Trends and Research Challenges in Cloud Computing}',0,3,2012,3,NULL,NULL,NULL,'2015-05-21 10:51:57','2016-06-01 09:41:04',0),(830,'talk','talk-Kounev-InvImperial11','misc','@misc{talk-Kounev-InvImperial11,\n author = {Samuel Kounev},\n title = {{Engineering of Self-Aware IT Systems and Services}},\n howpublished = {Invited Talk, Imperial College London, Department of Computing, London, UK},\n days = {21},\n month = {November},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nEngineering of Self-Aware IT Systems and Services.\nInvited Talk, Imperial College London, Department of Computing,\nLondon, UK, November 2011.\n[ bib  ] 
\n@misc{talk-Kounev-InvImperial11,\nauthor = {Samuel Kounev},\ntitle = {{Engineering of Self-Aware IT Systems and Services}},\nhowpublished = {Invited Talk, Imperial College London, Department of Computing, London, UK},\ndays = {21},\nmonth = {November},\nyear = {2011}\n}\n
\n
\n','
\n@misc{talk-Kounev-InvImperial11,\n  author = {Samuel Kounev},\n  title = {{Engineering of Self-Aware IT Systems and Services}},\n  howpublished = {Invited Talk, Imperial College London, Department of Computing, London, UK},\n  days = {21},\n  month = {November},\n  year = {2011}\n}\n
\n\n',NULL,'{Engineering of Self-Aware IT Systems and Services}',0,11,2011,11,NULL,NULL,NULL,'2015-05-22 08:27:40','2016-06-01 09:41:04',0),(831,'talk','talk-Kounev-Palladio11','misc','@misc{talk-Kounev-Palladio11,\n author = {Samuel Kounev},\n title = {{From Offline to Online Component Models for Run-Time Resource Management}},\n howpublished = {Invited Talk, Palladio Days 2011, FZI Forschungzentrum Informatik, Karlsruhe, Germany},\n days = {17},\n month = {November},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nFrom Offline to Online Component Models for Run-Time Resource\nManagement.\nInvited Talk, Palladio Days 2011, FZI Forschungzentrum Informatik,\nKarlsruhe, Germany, November 2011.\n[ bib  ] 
\n@misc{talk-Kounev-Palladio11,\nauthor = {Samuel Kounev},\ntitle = {{From Offline to Online Component Models for Run-Time Resource Management}},\nhowpublished = {Invited Talk, Palladio Days 2011, FZI Forschungzentrum Informatik, Karlsruhe, Germany},\ndays = {17},\nmonth = {November},\nyear = {2011}\n}\n
\n
\n','
\n@misc{talk-Kounev-Palladio11,\n  author = {Samuel Kounev},\n  title = {{From Offline to Online Component Models for Run-Time Resource Management}},\n  howpublished = {Invited Talk, Palladio Days 2011, FZI Forschungzentrum Informatik, Karlsruhe, Germany},\n  days = {17},\n  month = {November},\n  year = {2011}\n}\n
\n\n',NULL,'{From Offline to Online Component Models for Run-Time Resource Management}',0,11,2011,11,NULL,NULL,NULL,'2015-05-22 08:29:37','2016-06-01 09:41:05',0),(832,'talk','talk-Kounev-BYonder11','misc','@misc{talk-Kounev-BYonder11,\n author = {Samuel Kounev},\n title = {{Descartes Research Group at KIT: Engineering of Self-Aware IT Systems and Services}},\n howpublished = {Invited Talk, Blue Yonder GmbH & Co. KG, Karlsruhe, Germany},\n days = {10},\n month = {November},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nDescartes Research Group at KIT: Engineering of Self-Aware IT\nSystems and Services.\nInvited Talk, Blue Yonder GmbH & Co. KG, Karlsruhe, Germany, November\n2011.\n[ bib  ] 
\n@misc{talk-Kounev-BYonder11,\nauthor = {Samuel Kounev},\ntitle = {{Descartes Research Group at KIT: Engineering of Self-Aware IT Systems and Services}},\nhowpublished = {Invited Talk, Blue Yonder GmbH & Co. KG, Karlsruhe, Germany},\ndays = {10},\nmonth = {November},\nyear = {2011}\n}\n
\n
\n','
\n@misc{talk-Kounev-BYonder11,\n  author = {Samuel Kounev},\n  title = {{Descartes Research Group at KIT: Engineering of Self-Aware IT Systems and Services}},\n  howpublished = {Invited Talk, Blue Yonder GmbH & Co. KG, Karlsruhe, Germany},\n  days = {10},\n  month = {November},\n  year = {2011}\n}\n
\n\n',NULL,'{Descartes Research Group at KIT: Engineering of Self-Aware IT Systems and Services}',0,11,2011,11,NULL,NULL,NULL,'2015-05-22 08:31:43','2016-06-01 09:41:05',0),(833,'talk','talk-Kounev-EPEW11','misc','@misc{talk-Kounev-EPEW11,\n author = {Samuel Kounev},\n title = {{Engineering of Self-Aware IT Systems and Services: State-of-the-Art and Research Challenges}},\n howpublished = {Keynote Talk, 8th European Performance Engineering Workshop, Borrowdale, The English Lake District},\n days = {12-13},\n month = {October},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nEngineering of Self-Aware IT Systems and Services: State-of-the-Art\nand Research Challenges.\nKeynote Talk, 8th European Performance Engineering Workshop,\nBorrowdale, The English Lake District, October 2011.\n[ bib  ] 
\n@misc{talk-Kounev-EPEW11,\nauthor = {Samuel Kounev},\ntitle = {{Engineering of Self-Aware IT Systems and Services: State-of-the-Art and Research Challenges}},\nhowpublished = {Keynote Talk, 8th European Performance Engineering Workshop, Borrowdale, The English Lake District},\ndays = {12-13},\nmonth = {October},\nyear = {2011}\n}\n
\n
\n','
\n@misc{talk-Kounev-EPEW11,\n  author = {Samuel Kounev},\n  title = {{Engineering of Self-Aware IT Systems and Services: State-of-the-Art and Research Challenges}},\n  howpublished = {Keynote Talk, 8th European Performance Engineering Workshop, Borrowdale, The English Lake District},\n  days = {12-13},\n  month = {October},\n  year = {2011}\n}\n
\n\n',NULL,'{Engineering of Self-Aware IT Systems and Services: State-of-the-Art and Research Challenges}',0,10,2011,10,NULL,NULL,NULL,'2015-05-22 08:33:14','2016-06-01 09:41:05',0),(834,'talk','talk-Kounev-VMWare11','misc','@misc{talk-Kounev-VMWare11,\n author = {Samuel Kounev},\n title = {{Model-based Self-Adaptive Resource Management in Virtualized Environments}},\n howpublished = {Invited Talk, VMware, Inc., USA},\n days = {9},\n month = {June},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nModel-based Self-Adaptive Resource Management in Virtualized\nEnvironments.\nInvited Talk, VMware, Inc., USA, June 2011.\n[ bib  ] 
\n@misc{talk-Kounev-VMWare11,\nauthor = {Samuel Kounev},\ntitle = {{Model-based Self-Adaptive Resource Management in Virtualized Environments}},\nhowpublished = {Invited Talk, VMware, Inc., USA},\ndays = {9},\nmonth = {June},\nyear = {2011}\n}\n
\n
\n','
\n@misc{talk-Kounev-VMWare11,\n  author = {Samuel Kounev},\n  title = {{Model-based Self-Adaptive Resource Management in Virtualized Environments}},\n  howpublished = {Invited Talk, VMware, Inc., USA},\n  days = {9},\n  month = {June},\n  year = {2011}\n}\n
\n\n',NULL,'{Model-based Self-Adaptive Resource Management in Virtualized Environments}',0,6,2011,6,NULL,NULL,NULL,'2015-05-22 08:35:40','2016-06-01 09:41:05',0),(835,'talk','talk-Kounev-Dagstuhl11','misc','@misc{talk-Kounev-Dagstuhl11,\n author = {Samuel Kounev},\n title = {{Descartes Research Group at KIT: Towards Engineering of Self-Aware Software Systems}},\n howpublished = {Invited Talk, Jahrestreffen des Beirates der Universit\\\"atsprofessoren in der Gesselschaft f\\\"ur Informatik (GIBU), Schloss Dagstuhl},\n days = {17-20},\n month = {April},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nDescartes Research Group at KIT: Towards Engineering of Self-Aware\nSoftware Systems.\nInvited Talk, Jahrestreffen des Beirates der\nUniversitätsprofessoren in der Gesselschaft für Informatik (GIBU),\nSchloss Dagstuhl, April 2011.\n[ bib  ] 
\n@misc{talk-Kounev-Dagstuhl11,\nauthor = {Samuel Kounev},\ntitle = {{Descartes Research Group at KIT: Towards Engineering of Self-Aware Software Systems}},\nhowpublished = {Invited Talk, Jahrestreffen des Beirates der Universit\\\"atsprofessoren in der Gesselschaft f\\\"ur Informatik (GIBU), Schloss Dagstuhl},\ndays = {17-20},\nmonth = {April},\nyear = {2011}\n}\n
\n
\n','
\n@misc{talk-Kounev-Dagstuhl11,\n  author = {Samuel Kounev},\n  title = {{Descartes Research Group at KIT: Towards Engineering of Self-Aware Software Systems}},\n  howpublished = {Invited Talk, Jahrestreffen des Beirates der Universit\\\"atsprofessoren in der Gesselschaft f\\\"ur Informatik (GIBU), Schloss Dagstuhl},\n  days = {17-20},\n  month = {April},\n  year = {2011}\n}\n
\n\n',NULL,'{Descartes Research Group at KIT: Towards Engineering of Self-Aware Software Systems}',0,4,2011,4,NULL,NULL,NULL,'2015-05-22 08:37:09','2016-06-01 09:41:05',0),(836,'talk','talk-Kounev-Nachwuchs11','misc','@misc{talk-Kounev-Nachwuchs11,\n author = {Samuel Kounev},\n title = {{Self-Aware Software and Systems Engineering: A Vision and Research Roadmap}},\n howpublished = {Software Engineering 2011 (SE 2011), Nachwuchswissenschaftler-Symposium, Karlsruhe},\n days = {24},\n month = {February},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nSelf-Aware Software and Systems Engineering: A Vision and Research\nRoadmap.\nSoftware Engineering 2011 (SE 2011),\nNachwuchswissenschaftler-Symposium, Karlsruhe, February 2011.\n[ bib  ] 
\n@misc{talk-Kounev-Nachwuchs11,\nauthor = {Samuel Kounev},\ntitle = {{Self-Aware Software and Systems Engineering: A Vision and Research Roadmap}},\nhowpublished = {Software Engineering 2011 (SE 2011), Nachwuchswissenschaftler-Symposium, Karlsruhe},\ndays = {24},\nmonth = {February},\nyear = {2011}\n}\n
\n
\n','
\n@misc{talk-Kounev-Nachwuchs11,\n  author = {Samuel Kounev},\n  title = {{Self-Aware Software and Systems Engineering: A Vision and Research Roadmap}},\n  howpublished = {Software Engineering 2011 (SE 2011), Nachwuchswissenschaftler-Symposium, Karlsruhe},\n  days = {24},\n  month = {February},\n  year = {2011}\n}\n
\n\n',NULL,'{Self-Aware Software and Systems Engineering: A Vision and Research Roadmap}',0,2,2011,2,NULL,NULL,NULL,'2015-05-22 08:39:08','2016-06-01 09:41:05',0),(837,'talk','talk-Kounev-KielKolloq11','misc','@misc{talk-Kounev-KielKolloq11,\n author = {Samuel Kounev},\n title = {{Automatic Performance Model Extraction for Run-Time Capacity Management}},\n howpublished = {Invited Talk (Kolloquiumsvortrag), Department of Computer Science, Christian-Albrechts-Universit\\\"{a}t zu Kiel, Kiel},\n days = {21},\n month = {January},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nAutomatic Performance Model Extraction for Run-Time Capacity\nManagement.\nInvited Talk (Kolloquiumsvortrag), Department of Computer Science,\nChristian-Albrechts-Universität zu Kiel, Kiel, January 2011.\n[ bib  ] 
\n@misc{talk-Kounev-KielKolloq11,\nauthor = {Samuel Kounev},\ntitle = {{Automatic Performance Model Extraction for Run-Time Capacity Management}},\nhowpublished = {Invited Talk (Kolloquiumsvortrag), Department of Computer Science, Christian-Albrechts-Universit\\\"{a}t zu Kiel, Kiel},\ndays = {21},\nmonth = {January},\nyear = {2011}\n}\n
\n
\n','
\n@misc{talk-Kounev-KielKolloq11,\n  author = {Samuel Kounev},\n  title = {{Automatic Performance Model Extraction for Run-Time Capacity Management}},\n  howpublished = {Invited Talk (Kolloquiumsvortrag), Department of Computer Science, Christian-Albrechts-Universit\\\"{a}t zu Kiel, Kiel},\n  days = {21},\n  month = {January},\n  year = {2011}\n}\n
\n\n',NULL,'{Automatic Performance Model Extraction for Run-Time Capacity Management}',0,1,2011,1,NULL,NULL,NULL,'2015-05-22 08:41:17','2016-06-01 10:23:40',0),(838,'talk','talk-Kounev-KITNachwuchs10','misc','@misc{talk-Kounev-KITNachwuchs10,\n author = {Samuel Kounev},\n title = {{Engineering of Next Generation Self-Aware Software Systems: A Research Roadmap}},\n howpublished = {Informatik am KIT: Die Nachwuchsgruppen stellen sich vor, Karlsruhe Institute of Technology, Karlsruhe, Germany},\n days = {26},\n month = {July},\n year = {2010},\n}\n\n','\n\nSamuel Kounev.\nEngineering of Next Generation Self-Aware Software Systems: A\nResearch Roadmap.\nInformatik am KIT: Die Nachwuchsgruppen stellen sich vor, Karlsruhe\nInstitute of Technology, Karlsruhe, Germany, July 2010.\n[ bib  ] 
\n@misc{talk-Kounev-KITNachwuchs10,\nauthor = {Samuel Kounev},\ntitle = {{Engineering of Next Generation Self-Aware Software Systems: A Research Roadmap}},\nhowpublished = {Informatik am KIT: Die Nachwuchsgruppen stellen sich vor, Karlsruhe Institute of Technology, Karlsruhe, Germany},\ndays = {26},\nmonth = {July},\nyear = {2010}\n}\n
\n
\n','
\n@misc{talk-Kounev-KITNachwuchs10,\n  author = {Samuel Kounev},\n  title = {{Engineering of Next Generation Self-Aware Software Systems: A Research Roadmap}},\n  howpublished = {Informatik am KIT: Die Nachwuchsgruppen stellen sich vor, Karlsruhe Institute of Technology, Karlsruhe, Germany},\n  days = {26},\n  month = {July},\n  year = {2010}\n}\n
\n\n',NULL,'{Engineering of Next Generation Self-Aware Software Systems: A Research Roadmap}',0,7,2010,7,NULL,NULL,NULL,'2015-05-22 08:43:24','2016-06-01 09:41:05',0),(839,'talk','talk-Kounev-Dagstuhl10','misc','@misc{talk-Kounev-Dagstuhl10,\n author = {Samuel Kounev},\n title = {{Towards Self-Aware Dependability Management in Virtualized Service Infrastructures}},\n howpublished = {Dagstuhl Seminar 10292, Resilience Assessment and Evaluation, Schloss Dagstuhl, Germany},\n days = {22},\n month = {July},\n year = {2010},\n}\n\n','\n\nSamuel Kounev.\nTowards Self-Aware Dependability Management in Virtualized Service\nInfrastructures.\nDagstuhl Seminar 10292, Resilience Assessment and Evaluation, Schloss\nDagstuhl, Germany, July 2010.\n[ bib  ] 
\n@misc{talk-Kounev-Dagstuhl10,\nauthor = {Samuel Kounev},\ntitle = {{Towards Self-Aware Dependability Management in Virtualized Service Infrastructures}},\nhowpublished = {Dagstuhl Seminar 10292, Resilience Assessment and Evaluation, Schloss Dagstuhl, Germany},\ndays = {22},\nmonth = {July},\nyear = {2010}\n}\n
\n
\n','
\n@misc{talk-Kounev-Dagstuhl10,\n  author = {Samuel Kounev},\n  title = {{Towards Self-Aware Dependability Management in Virtualized Service Infrastructures}},\n  howpublished = {Dagstuhl Seminar 10292, Resilience Assessment and Evaluation, Schloss Dagstuhl, Germany},\n  days = {22},\n  month = {July},\n  year = {2010}\n}\n
\n\n',NULL,'{Towards Self-Aware Dependability Management in Virtualized Service Infrastructures}',0,7,2010,7,NULL,NULL,NULL,'2015-05-22 08:46:38','2016-06-01 09:41:05',0),(840,'talk','talk-Kounev-GIF10','misc','@misc{talk-Kounev-GIF10,\n author = {Samuel Kounev},\n title = {{Performance Management in the Cloud}},\n howpublished = {Invited Talk, Annual Meeting of the GI Fachgruppe Software Architectures 2010, Munich, Germany},\n days = {16},\n month = {July},\n year = {2010},\n}\n\n','\n\nSamuel Kounev.\nPerformance Management in the Cloud.\nInvited Talk, Annual Meeting of the GI Fachgruppe Software\nArchitectures 2010, Munich, Germany, July 2010.\n[ bib  ] 
\n@misc{talk-Kounev-GIF10,\nauthor = {Samuel Kounev},\ntitle = {{Performance Management in the Cloud}},\nhowpublished = {Invited Talk, Annual Meeting of the GI Fachgruppe Software Architectures 2010, Munich, Germany},\ndays = {16},\nmonth = {July},\nyear = {2010}\n}\n
\n
\n','
\n@misc{talk-Kounev-GIF10,\n  author = {Samuel Kounev},\n  title = {{Performance Management in the Cloud}},\n  howpublished = {Invited Talk, Annual Meeting of the GI Fachgruppe Software Architectures 2010, Munich, Germany},\n  days = {16},\n  month = {July},\n  year = {2010}\n}\n
\n\n',NULL,'{Performance Management in the Cloud}',0,7,2010,7,NULL,NULL,NULL,'2015-05-22 08:49:09','2016-06-01 09:41:05',0),(841,'talk','talk-Kounev-Oracle09','misc','@misc{talk-Kounev-Oracle09,\n author = {Samuel Kounev},\n title = {{Automated Model-based Capacity Planning for Java EE applications}},\n howpublished = {Invited Talk, Oracle Corp, USA},\n days = {9},\n month = {December},\n year = {2009},\n}\n\n','\n\nSamuel Kounev.\nAutomated Model-based Capacity Planning for Java EE applications.\nInvited Talk, Oracle Corp, USA, December 2009.\n[ bib  ] 
\n@misc{talk-Kounev-Oracle09,\nauthor = {Samuel Kounev},\ntitle = {{Automated Model-based Capacity Planning for Java EE applications}},\nhowpublished = {Invited Talk, Oracle Corp, USA},\ndays = {9},\nmonth = {December},\nyear = {2009}\n}\n
\n
\n','
\n@misc{talk-Kounev-Oracle09,\n  author = {Samuel Kounev},\n  title = {{Automated Model-based Capacity Planning for Java EE applications}},\n  howpublished = {Invited Talk, Oracle Corp, USA},\n  days = {9},\n  month = {December},\n  year = {2009}\n}\n
\n\n',NULL,'{Automated Model-based Capacity Planning for Java EE applications}',0,12,2009,12,NULL,NULL,NULL,'2015-05-22 08:51:48','2016-06-01 09:41:05',0),(842,'talk','talk-Kounev-OraclePres09','misc','@misc{talk-Kounev-OraclePres09,\n author = {Samuel Kounev},\n title = {Using WebLogic Diagnostics Framework to Enable Performance Prediction for Java EE Applications},\n howpublished = {Presentation to Oracle Corp, USA},\n days = {9},\n month = {September},\n year = {2009},\n}\n\n','\n\nSamuel Kounev.\nUsing weblogic diagnostics framework to enable performance prediction\nfor java ee applications.\nPresentation to Oracle Corp, USA, September 2009.\n[ bib  ] 
\n@misc{talk-Kounev-OraclePres09,\nauthor = {Samuel Kounev},\ntitle = {Using WebLogic Diagnostics Framework to Enable Performance Prediction for Java EE Applications},\nhowpublished = {Presentation to Oracle Corp, USA},\ndays = {9},\nmonth = {September},\nyear = {2009}\n}\n
\n
\n','
\n@misc{talk-Kounev-OraclePres09,\n  author = {Samuel Kounev},\n  title = {Using WebLogic Diagnostics Framework to Enable Performance Prediction for Java EE Applications},\n  howpublished = {Presentation to Oracle Corp, USA},\n  days = {9},\n  month = {September},\n  year = {2009}\n}\n
\n\n',NULL,'Using WebLogic Diagnostics Framework to Enable Performance Prediction for Java EE Applications',0,9,2009,9,NULL,NULL,NULL,'2015-05-22 08:53:03','2016-06-01 09:41:05',0),(843,'talk','talk-Kounev-infoex09','misc','@misc{talk-Kounev-infoex09,\n author = {Samuel Kounev},\n title = {{Performance-Engineering-Research an der Universit\\\"{a}t Karlsruhe}},\n howpublished = {Invited Talk, CA infoexchange 2009 Conference, Mannheim, Germany},\n days = {20},\n month = {May},\n year = {2009},\n}\n\n','\n\nSamuel Kounev.\nPerformance-Engineering-Research an der Universität Karlsruhe.\nInvited Talk, CA infoexchange 2009 Conference, Mannheim, Germany, May\n2009.\n[ bib  ] 
\n@misc{talk-Kounev-infoex09,\nauthor = {Samuel Kounev},\ntitle = {{Performance-Engineering-Research an der Universit\\\"{a}t Karlsruhe}},\nhowpublished = {Invited Talk, CA infoexchange 2009 Conference, Mannheim, Germany},\ndays = {20},\nmonth = {May},\nyear = {2009}\n}\n
\n
\n','
\n@misc{talk-Kounev-infoex09,\n  author = {Samuel Kounev},\n  title = {{Performance-Engineering-Research an der Universit\\\"{a}t Karlsruhe}},\n  howpublished = {Invited Talk, CA infoexchange 2009 Conference, Mannheim, Germany},\n  days = {20},\n  month = {May},\n  year = {2009}\n}\n
\n\n',NULL,'{Performance-Engineering-Research an der Universit\\\"{a}t Karlsruhe}',0,5,2009,5,NULL,NULL,NULL,'2015-05-22 08:54:49','2016-06-01 09:41:05',0),(844,'talk','talk-Kounev-ABB09','misc','@misc{talk-Kounev-ABB09,\n author = {Samuel Kounev},\n title = {{SOA2 - A Vision of Next Generation Service-Oriented Architectures}},\n howpublished = {Invited Talk (Kolloquiumsvortrag), ABB Corporate Research, Ladenburg, Germany},\n days = {3},\n month = {April},\n year = {2009},\n}\n\n','\n\nSamuel Kounev.\nSOA2 - A Vision of Next Generation Service-Oriented Architectures.\nInvited Talk (Kolloquiumsvortrag), ABB Corporate Research, Ladenburg,\nGermany, April 2009.\n[ bib  ] 
\n@misc{talk-Kounev-ABB09,\nauthor = {Samuel Kounev},\ntitle = {{SOA2 - A Vision of Next Generation Service-Oriented Architectures}},\nhowpublished = {Invited Talk (Kolloquiumsvortrag), ABB Corporate Research, Ladenburg, Germany},\ndays = {3},\nmonth = {April},\nyear = {2009}\n}\n
\n
\n','
\n@misc{talk-Kounev-ABB09,\n  author = {Samuel Kounev},\n  title = {{SOA2 - A Vision of Next Generation Service-Oriented Architectures}},\n  howpublished = {Invited Talk (Kolloquiumsvortrag), ABB Corporate Research, Ladenburg, Germany},\n  days = {3},\n  month = {April},\n  year = {2009}\n}\n
\n\n',NULL,'{SOA2 - A Vision of Next Generation Service-Oriented Architectures}',0,4,2009,4,NULL,NULL,NULL,'2015-05-22 08:56:26','2016-06-01 09:41:05',0),(845,'talk','talk-Kounev-SOA209','misc','@misc{talk-Kounev-SOA209,\n author = {Samuel Kounev},\n title = {{Keynote: SOA2 - Eine Vision f\\\"{u}r die n\\\"{a}chste Generation dienstorienterter Software-Architekturen}},\n howpublished = {Invited Talk, Deutschepost Strategietagung - 6100 Application Service Management MAIL/Retail, St. Goar, Germany},\n days = {9},\n month = {February},\n year = {2009},\n}\n\n','\n\nSamuel Kounev.\nKeynote: SOA2 - Eine Vision für die nächste Generation\ndienstorienterter Software-Architekturen.\nInvited Talk, Deutschepost Strategietagung - 6100 Application Service\nManagement MAIL/Retail, St. Goar, Germany, February 2009.\n[ bib  ] 
\n@misc{talk-Kounev-SOA209,\nauthor = {Samuel Kounev},\ntitle = {{Keynote: SOA2 - Eine Vision f\\\"{u}r die n\\\"{a}chste Generation dienstorienterter Software-Architekturen}},\nhowpublished = {Invited Talk, Deutschepost Strategietagung - 6100 Application Service Management MAIL/Retail, St. Goar, Germany},\ndays = {9},\nmonth = {February},\nyear = {2009}\n}\n
\n
\n','
\n@misc{talk-Kounev-SOA209,\n  author = {Samuel Kounev},\n  title = {{Keynote: SOA2 - Eine Vision f\\\"{u}r die n\\\"{a}chste Generation dienstorienterter Software-Architekturen}},\n  howpublished = {Invited Talk, Deutschepost Strategietagung - 6100 Application Service Management MAIL/Retail, St. Goar, Germany},\n  days = {9},\n  month = {February},\n  year = {2009}\n}\n
\n\n',NULL,'{Keynote: SOA2 - Eine Vision f\\\"{u}r die n\\\"{a}chste Generation dienstorienterter Software-Architekturen}',0,2,2009,2,NULL,NULL,NULL,'2015-05-22 08:59:41','2016-06-01 09:41:05',0),(846,'talk','talk-Kounev-DFG08','misc','@misc{talk-Kounev-DFG08,\n author = {Samuel Kounev},\n title = {{Descartes Projekt - Autonomes Performanz-und Ressourcen-Management in dynamischen, dienstorientierten Umgebungen}},\n howpublished = {Invited Talk, DFG Fachforum Informatik, Deutsche Forschungsgemeinschaft (German Research Foundation), Bonn, Germany},\n days = {30},\n month = {September},\n year = {2008},\n}\n\n','\n\nSamuel Kounev.\nDescartes Projekt - Autonomes Performanz-und Ressourcen-Management\nin dynamischen, dienstorientierten Umgebungen.\nInvited Talk, DFG Fachforum Informatik, Deutsche\nForschungsgemeinschaft (German Research Foundation), Bonn, Germany, September\n2008.\n[ bib  ] 
\n@misc{talk-Kounev-DFG08,\nauthor = {Samuel Kounev},\ntitle = {{Descartes Projekt - Autonomes Performanz-und Ressourcen-Management in dynamischen, dienstorientierten Umgebungen}},\nhowpublished = {Invited Talk, DFG Fachforum Informatik, Deutsche Forschungsgemeinschaft (German Research Foundation), Bonn, Germany},\ndays = {30},\nmonth = {September},\nyear = {2008}\n}\n
\n
\n','
\n@misc{talk-Kounev-DFG08,\n  author = {Samuel Kounev},\n  title = {{Descartes Projekt - Autonomes Performanz-und Ressourcen-Management in dynamischen, dienstorientierten Umgebungen}},\n  howpublished = {Invited Talk, DFG Fachforum Informatik, Deutsche Forschungsgemeinschaft (German Research Foundation), Bonn, Germany},\n  days = {30},\n  month = {September},\n  year = {2008}\n}\n
\n\n',NULL,'{Descartes Projekt - Autonomes Performanz-und Ressourcen-Management in dynamischen, dienstorientierten Umgebungen}',0,9,2008,9,NULL,NULL,NULL,'2015-05-22 09:02:09','2016-06-01 09:41:05',0),(847,'talk','talk-Kounev-Oldenburg08','misc','@misc{talk-Kounev-Oldenburg08,\n author = {Samuel Kounev},\n title = {{QoS-aware resource allocation and load-balancing in enterprise Grids using online simulation}},\n howpublished = {Invited Talk (Kolloquiumsvortrag), University of Oldenburg, Department of Computing Science, Oldenburg, Germany},\n days = {26},\n month = {August},\n year = {2008},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/847},\n}\n\n','\n\nSamuel Kounev.\nQoS-aware resource allocation and load-balancing in enterprise Grids\nusing online simulation.\nInvited Talk (Kolloquiumsvortrag), University of Oldenburg,\nDepartment of Computing Science, Oldenburg, Germany, August 2008.\n[ bib | slides  ] 
\n@misc{talk-Kounev-Oldenburg08,\nauthor = {Samuel Kounev},\ntitle = {{QoS-aware resource allocation and load-balancing in enterprise Grids using online simulation}},\nhowpublished = {Invited Talk (Kolloquiumsvortrag), University of Oldenburg, Department of Computing Science, Oldenburg, Germany},\ndays = {26},\nmonth = {August},\nyear = {2008},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/847}\n}\n
\n
\n','
\n@misc{talk-Kounev-Oldenburg08,\n  author = {Samuel Kounev},\n  title = {{QoS-aware resource allocation and load-balancing in enterprise Grids using online simulation}},\n  howpublished = {Invited Talk (Kolloquiumsvortrag), University of Oldenburg, Department of Computing Science, Oldenburg, Germany},\n  days = {26},\n  month = {August},\n  year = {2008},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/847}\n}\n
\n\n',NULL,'{QoS-aware resource allocation and load-balancing in enterprise Grids using online simulation}',0,8,2008,8,NULL,NULL,NULL,'2015-05-22 09:04:50','2016-06-01 09:41:05',0),(848,'talk','talk-Kounev-Cambridge08','misc','@misc{talk-Kounev-Cambridge08,\n author = {Samuel Kounev},\n title = {{Towards Autonomic QoS Management in Event-based and Service-Oriented Environments}},\n howpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\n days = {11},\n month = {March},\n year = {2008},\n}\n\n','\n\nSamuel Kounev.\nTowards Autonomic QoS Management in Event-based and Service-Oriented\nEnvironments.\nUniversity of Cambridge, Computer Laboratory, Cambridge, UK, March\n2008.\n[ bib  ] 
\n@misc{talk-Kounev-Cambridge08,\nauthor = {Samuel Kounev},\ntitle = {{Towards Autonomic QoS Management in Event-based and Service-Oriented Environments}},\nhowpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\ndays = {11},\nmonth = {March},\nyear = {2008}\n}\n
\n
\n','
\n@misc{talk-Kounev-Cambridge08,\n  author = {Samuel Kounev},\n  title = {{Towards Autonomic QoS Management in Event-based and Service-Oriented Environments}},\n  howpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\n  days = {11},\n  month = {March},\n  year = {2008}\n}\n
\n\n',NULL,'{Towards Autonomic QoS Management in Event-based and Service-Oriented Environments}',0,3,2008,3,NULL,NULL,NULL,'2015-05-22 09:07:03','2016-06-01 09:41:05',0),(849,'talk','talk-Kounev-NewcastleTyne08','misc','@misc{talk-Kounev-NewcastleTyne08,\n author = {Samuel Kounev},\n title = {{Autonomic QoS control in enterprise Grid environments using online simulation}},\n howpublished = {Invited Talk (Kolloquiumsvortrag), School of Computing Science, Newcastle University, Newcastle upon Tyne, UK},\n days = {12},\n month = {February},\n year = {2008},\n}\n\n','\n\nSamuel Kounev.\nAutonomic QoS control in enterprise Grid environments using online\nsimulation.\nInvited Talk (Kolloquiumsvortrag), School of Computing Science,\nNewcastle University, Newcastle upon Tyne, UK, February 2008.\n[ bib  ] 
\n@misc{talk-Kounev-NewcastleTyne08,\nauthor = {Samuel Kounev},\ntitle = {{Autonomic QoS control in enterprise Grid environments using online simulation}},\nhowpublished = {Invited Talk (Kolloquiumsvortrag), School of Computing Science, Newcastle University, Newcastle upon Tyne, UK},\ndays = {12},\nmonth = {February},\nyear = {2008}\n}\n
\n
\n','
\n@misc{talk-Kounev-NewcastleTyne08,\n  author = {Samuel Kounev},\n  title = {{Autonomic QoS control in enterprise Grid environments using online simulation}},\n  howpublished = {Invited Talk (Kolloquiumsvortrag), School of Computing Science, Newcastle University, Newcastle upon Tyne, UK},\n  days = {12},\n  month = {February},\n  year = {2008}\n}\n
\n\n',NULL,'{Autonomic QoS control in enterprise Grid environments using online simulation}',0,2,2008,2,NULL,NULL,NULL,'2015-05-22 09:09:25','2016-06-01 09:41:05',0),(850,'talk','talk-Kounev-Charles08','misc','@misc{talk-Kounev-Charles08,\n author = {Samuel Kounev},\n title = {{Performance Prediction using QPN Models: From Capacity Planning to Online Performance Management}},\n howpublished = {Invited Talk, Department of Software Engineering, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic},\n days = {16},\n month = {January},\n year = {2008},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/850},\n}\n\n','\n\nSamuel Kounev.\nPerformance Prediction using QPN Models: From Capacity Planning to\nOnline Performance Management.\nInvited Talk, Department of Software Engineering, Faculty of\nMathematics and Physics, Charles University, Prague, Czech Republic, January\n2008.\n[ bib | slides  ] 
\n@misc{talk-Kounev-Charles08,\nauthor = {Samuel Kounev},\ntitle = {{Performance Prediction using QPN Models: From Capacity Planning to Online Performance Management}},\nhowpublished = {Invited Talk, Department of Software Engineering, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic},\ndays = {16},\nmonth = {January},\nyear = {2008},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/850}\n}\n
\n
\n','
\n@misc{talk-Kounev-Charles08,\n  author = {Samuel Kounev},\n  title = {{Performance Prediction using QPN Models: From Capacity Planning to Online Performance Management}},\n  howpublished = {Invited Talk, Department of Software Engineering, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic},\n  days = {16},\n  month = {January},\n  year = {2008},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/850}\n}\n
\n\n',NULL,'{Performance Prediction using QPN Models: From Capacity Planning to Online Performance Management}',0,1,2008,1,NULL,NULL,NULL,'2015-05-22 09:11:16','2016-06-01 09:41:05',0),(851,'talk','talk-Kounev-SPECjms07','misc','@misc{talk-Kounev-SPECjms07,\n author = {Samuel Kounev},\n title = {{SPECjms2007 - A Novel Benchmark and Performance Analysis Framework for Message-Oriented Middleware}},\n howpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\n days = {16},\n month = {October},\n year = {2007},\n}\n\n','\n\nSamuel Kounev.\nSPECjms2007 - A Novel Benchmark and Performance Analysis Framework\nfor Message-Oriented Middleware.\nUniversity of Cambridge, Computer Laboratory, Cambridge, UK, October\n2007.\n[ bib  ] 
\n@misc{talk-Kounev-SPECjms07,\nauthor = {Samuel Kounev},\ntitle = {{SPECjms2007 - A Novel Benchmark and Performance Analysis Framework for Message-Oriented Middleware}},\nhowpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\ndays = {16},\nmonth = {October},\nyear = {2007}\n}\n
\n
\n','
\n@misc{talk-Kounev-SPECjms07,\n  author = {Samuel Kounev},\n  title = {{SPECjms2007 - A Novel Benchmark and Performance Analysis Framework for Message-Oriented Middleware}},\n  howpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\n  days = {16},\n  month = {October},\n  year = {2007}\n}\n
\n\n',NULL,'{SPECjms2007 - A Novel Benchmark and Performance Analysis Framework for Message-Oriented Middleware}',0,10,2007,10,NULL,NULL,NULL,'2015-05-22 09:13:41','2016-06-01 09:41:05',0),(852,'talk','talk-Kounev-SPEC08','misc','@misc{talk-Kounev-SPEC08,\n author = {Samuel Kounev},\n title = {{SPEC Enterprise Java Benchmarks: State of the Art and Future Directions}},\n howpublished = {Invited Talk, SPEC Benchmarking Joint US/Europe Colloquium, Dresden, Germany},\n days = {22},\n month = {June},\n year = {2007},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/852},\n}\n\n','\n\nSamuel Kounev.\nSPEC Enterprise Java Benchmarks: State of the Art and Future\nDirections.\nInvited Talk, SPEC Benchmarking Joint US/Europe Colloquium, Dresden,\nGermany, June 2007.\n[ bib | slides  ] 
\n@misc{talk-Kounev-SPEC08,\nauthor = {Samuel Kounev},\ntitle = {{SPEC Enterprise Java Benchmarks: State of the Art and Future Directions}},\nhowpublished = {Invited Talk, SPEC Benchmarking Joint US/Europe Colloquium, Dresden, Germany},\ndays = {22},\nmonth = {June},\nyear = {2007},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/852}\n}\n
\n
\n','
\n@misc{talk-Kounev-SPEC08,\n  author = {Samuel Kounev},\n  title = {{SPEC Enterprise Java Benchmarks: State of the Art and Future Directions}},\n  howpublished = {Invited Talk, SPEC Benchmarking Joint US/Europe Colloquium, Dresden, Germany},\n  days = {22},\n  month = {June},\n  year = {2007},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/852}\n}\n
\n\n',NULL,'{SPEC Enterprise Java Benchmarks: State of the Art and Future Directions}',0,6,2007,6,NULL,NULL,NULL,'2015-05-22 09:15:33','2016-06-01 09:41:05',0),(853,'talk','talk-Kounev-Edinburgh07','misc','@misc{talk-Kounev-Edinburgh07,\n author = {Samuel Kounev},\n title = {{Performance Modeling and Evaluation of Distributed Component Systems using Queueing Petri Nets}},\n howpublished = {Invited Talk (Kolloquiumsvortrag), University of Edinburgh, Laboratory for Foundations of Computer Science, School of Informatics, Edinburgh, UK},\n days = {4},\n month = {May},\n year = {2007},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/853},\n}\n\n','\n\nSamuel Kounev.\nPerformance Modeling and Evaluation of Distributed Component Systems\nusing Queueing Petri Nets.\nInvited Talk (Kolloquiumsvortrag), University of Edinburgh,\nLaboratory for Foundations of Computer Science, School of Informatics,\nEdinburgh, UK, May 2007.\n[ bib | slides  ] 
\n@misc{talk-Kounev-Edinburgh07,\nauthor = {Samuel Kounev},\ntitle = {{Performance Modeling and Evaluation of Distributed Component Systems using Queueing Petri Nets}},\nhowpublished = {Invited Talk (Kolloquiumsvortrag), University of Edinburgh, Laboratory for Foundations of Computer Science, School of Informatics, Edinburgh, UK},\ndays = {4},\nmonth = {May},\nyear = {2007},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/853}\n}\n
\n
\n','
\n@misc{talk-Kounev-Edinburgh07,\n  author = {Samuel Kounev},\n  title = {{Performance Modeling and Evaluation of Distributed Component Systems using Queueing Petri Nets}},\n  howpublished = {Invited Talk (Kolloquiumsvortrag), University of Edinburgh, Laboratory for Foundations of Computer Science, School of Informatics, Edinburgh, UK},\n  days = {4},\n  month = {May},\n  year = {2007},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/853}\n}\n
\n\n',NULL,'{Performance Modeling and Evaluation of Distributed Component Systems using Queueing Petri Nets}',0,5,2007,5,NULL,NULL,NULL,'2015-05-22 09:18:37','2016-06-01 09:41:05',0),(854,'talk','talk-Kounev-Camb07','misc','@misc{talk-Kounev-Camb07,\n author = {Samuel Kounev},\n title = {{An Approach to Performance Modeling and Analysis of Distributed Event-Based Systems}},\n howpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\n days = {13},\n month = {March},\n year = {2007},\n}\n\n','\n\nSamuel Kounev.\nAn Approach to Performance Modeling and Analysis of Distributed\nEvent-Based Systems.\nUniversity of Cambridge, Computer Laboratory, Cambridge, UK, March\n2007.\n[ bib  ] 
\n@misc{talk-Kounev-Camb07,\nauthor = {Samuel Kounev},\ntitle = {{An Approach to Performance Modeling and Analysis of Distributed Event-Based Systems}},\nhowpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\ndays = {13},\nmonth = {March},\nyear = {2007}\n}\n
\n
\n','
\n@misc{talk-Kounev-Camb07,\n  author = {Samuel Kounev},\n  title = {{An Approach to Performance Modeling and Analysis of Distributed Event-Based Systems}},\n  howpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\n  days = {13},\n  month = {March},\n  year = {2007}\n}\n
\n\n',NULL,'{An Approach to Performance Modeling and Analysis of Distributed Event-Based Systems}',0,3,2007,3,NULL,NULL,NULL,'2015-05-23 07:29:41','2016-06-01 09:41:05',0),(855,'talk','talk-Kounev-Camb06','misc','@misc{talk-Kounev-Camb06,\n author = {Samuel Kounev},\n title = {{A Practical Approach for Predicting the Performance and Scalability of Distributed Component Systems}},\n howpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\n days = {13},\n month = {April},\n year = {2006},\n}\n\n','\n\nSamuel Kounev.\nA Practical Approach for Predicting the Performance and Scalability\nof Distributed Component Systems.\nUniversity of Cambridge, Computer Laboratory, Cambridge, UK, April\n2006.\n[ bib  ] 
\n@misc{talk-Kounev-Camb06,\nauthor = {Samuel Kounev},\ntitle = {{A Practical Approach for Predicting the Performance and Scalability of Distributed Component Systems}},\nhowpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\ndays = {13},\nmonth = {April},\nyear = {2006}\n}\n
\n
\n','
\n@misc{talk-Kounev-Camb06,\n  author = {Samuel Kounev},\n  title = {{A Practical Approach for Predicting the Performance and Scalability of Distributed Component Systems}},\n  howpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\n  days = {13},\n  month = {April},\n  year = {2006}\n}\n
\n\n',NULL,'{A Practical Approach for Predicting the Performance and Scalability of Distributed Component Systems}',0,4,2006,4,NULL,NULL,NULL,'2015-05-23 07:32:54','2016-06-01 09:41:05',0),(856,'talk','talk-Kounev-Camb06-2','misc','@misc{talk-Kounev-Camb06-2,\n author = {Samuel Kounev},\n title = {{Performance Modeling and Evaluation of Event-based Systems}},\n howpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\n days = {3},\n month = {March},\n year = {2006},\n}\n\n','\n\nSamuel Kounev.\nPerformance Modeling and Evaluation of Event-based Systems.\nUniversity of Cambridge, Computer Laboratory, Cambridge, UK, March\n2006.\n[ bib  ] 
\n@misc{talk-Kounev-Camb06-2,\nauthor = {Samuel Kounev},\ntitle = {{Performance Modeling and Evaluation of Event-based Systems}},\nhowpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\ndays = {3},\nmonth = {March},\nyear = {2006}\n}\n
\n
\n','
\n@misc{talk-Kounev-Camb06-2,\n  author = {Samuel Kounev},\n  title = {{Performance Modeling and Evaluation of Event-based Systems}},\n  howpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\n  days = {3},\n  month = {March},\n  year = {2006}\n}\n
\n\n',NULL,'{Performance Modeling and Evaluation of Event-based Systems}',0,3,2006,3,NULL,NULL,NULL,'2015-05-23 07:35:16','2016-06-01 09:41:05',0),(857,'talk','talk-Kounev-TUBerlin05','misc','@misc{talk-Kounev-TUBerlin05,\n author = {Samuel Kounev},\n title = {{Performance Engineering of Distributed Component Systems - From Benchmarking to Modeling and Performance Prediction}},\n howpublished = {Invited Talk, Technical University of Berlin, Institut f\\\"{u}r Technische Informatik und Mikroelektronik, Berlin},\n days = {29},\n month = {April},\n year = {2005},\n}\n\n','\n\nSamuel Kounev.\nPerformance Engineering of Distributed Component Systems - From\nBenchmarking to Modeling and Performance Prediction.\nInvited Talk, Technical University of Berlin, Institut für\nTechnische Informatik und Mikroelektronik, Berlin, April 2005.\n[ bib  ] 
\n@misc{talk-Kounev-TUBerlin05,\nauthor = {Samuel Kounev},\ntitle = {{Performance Engineering of Distributed Component Systems - From Benchmarking to Modeling and Performance Prediction}},\nhowpublished = {Invited Talk, Technical University of Berlin, Institut f\\\"{u}r Technische Informatik und Mikroelektronik, Berlin},\ndays = {29},\nmonth = {April},\nyear = {2005}\n}\n
\n
\n','
\n@misc{talk-Kounev-TUBerlin05,\n  author = {Samuel Kounev},\n  title = {{Performance Engineering of Distributed Component Systems - From Benchmarking to Modeling and Performance Prediction}},\n  howpublished = {Invited Talk, Technical University of Berlin, Institut f\\\"{u}r Technische Informatik und Mikroelektronik, Berlin},\n  days = {29},\n  month = {April},\n  year = {2005}\n}\n
\n\n',NULL,'{Performance Engineering of Distributed Component Systems - From Benchmarking to Modeling and Performance Prediction}',0,4,2005,4,NULL,NULL,NULL,'2015-05-23 07:37:36','2016-06-01 09:41:05',0),(858,'talk','talk-Kounev-SAP05','misc','@misc{talk-Kounev-SAP05,\n author = {Samuel Kounev},\n title = {{E-Business Performance and Scalability - From Measuring to Predicting}},\n howpublished = {Invited Talk (Kolloquiumsvortrag), SAP Research Forum, Walldorf, Germany},\n days = {27},\n month = {January},\n year = {2005},\n}\n\n','\n\nSamuel Kounev.\nE-Business Performance and Scalability - From Measuring to\nPredicting.\nInvited Talk (Kolloquiumsvortrag), SAP Research Forum, Walldorf,\nGermany, January 2005.\n[ bib  ] 
\n@misc{talk-Kounev-SAP05,\nauthor = {Samuel Kounev},\ntitle = {{E-Business Performance and Scalability - From Measuring to Predicting}},\nhowpublished = {Invited Talk (Kolloquiumsvortrag), SAP Research Forum, Walldorf, Germany},\ndays = {27},\nmonth = {January},\nyear = {2005}\n}\n
\n
\n','
\n@misc{talk-Kounev-SAP05,\n  author = {Samuel Kounev},\n  title = {{E-Business Performance and Scalability - From Measuring to Predicting}},\n  howpublished = {Invited Talk (Kolloquiumsvortrag), SAP Research Forum, Walldorf, Germany},\n  days = {27},\n  month = {January},\n  year = {2005}\n}\n
\n\n',NULL,'{E-Business Performance and Scalability - From Measuring to Predicting}',0,1,2005,1,NULL,NULL,NULL,'2015-05-23 07:40:19','2016-06-01 09:41:05',0),(859,'talk','talk-Kounev-Dagstuhl03','misc','@misc{talk-Kounev-Dagstuhl03,\n author = {Samuel Kounev},\n title = {{Performance Modeling of Distributed E-Business Applications using Queueing Petri Nets}},\n howpublished = {Invited Talk, Dagstuhl - Workshop of five Informatik-Graduiertenkolles, Schloss Dagstuhl},\n days = {16-18},\n month = {June},\n year = {2003},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/859},\n}\n\n','\n\nSamuel Kounev.\nPerformance Modeling of Distributed E-Business Applications using\nQueueing Petri Nets.\nInvited Talk, Dagstuhl - Workshop of five\nInformatik-Graduiertenkolles, Schloss Dagstuhl, June 2003.\n[ bib | slides  ] 
\n@misc{talk-Kounev-Dagstuhl03,\nauthor = {Samuel Kounev},\ntitle = {{Performance Modeling of Distributed E-Business Applications using Queueing Petri Nets}},\nhowpublished = {Invited Talk, Dagstuhl - Workshop of five Informatik-Graduiertenkolles, Schloss Dagstuhl},\ndays = {16-18},\nmonth = {June},\nyear = {2003},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/859}\n}\n
\n
\n','
\n@misc{talk-Kounev-Dagstuhl03,\n  author = {Samuel Kounev},\n  title = {{Performance Modeling of Distributed E-Business Applications using Queueing Petri Nets}},\n  howpublished = {Invited Talk, Dagstuhl - Workshop of five Informatik-Graduiertenkolles, Schloss Dagstuhl},\n  days = {16-18},\n  month = {June},\n  year = {2003},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/859}\n}\n
\n\n',NULL,'{Performance Modeling of Distributed E-Business Applications using Queueing Petri Nets}',0,6,2003,6,NULL,NULL,NULL,'2015-05-23 07:41:19','2016-06-01 09:41:05',0),(860,'talk','talk-Kounev-DVSPhD02','misc','@misc{talk-Kounev-DVSPhD02,\n author = {Samuel Kounev},\n title = {{J2EE PERFORMANCE: From Benchmarking to Sizing and Capacity Planning}},\n howpublished = {DVS-PhD Internal Workshop, Darmstadt, Germany},\n days = {21},\n month = {May},\n year = {2002},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/860},\n}\n\n','\n\nSamuel Kounev.\nJ2EE PERFORMANCE: From Benchmarking to Sizing and Capacity\nPlanning.\nDVS-PhD Internal Workshop, Darmstadt, Germany, May 2002.\n[ bib | slides  ] 
\n@misc{talk-Kounev-DVSPhD02,\nauthor = {Samuel Kounev},\ntitle = {{J2EE PERFORMANCE: From Benchmarking to Sizing and Capacity Planning}},\nhowpublished = {DVS-PhD Internal Workshop, Darmstadt, Germany},\ndays = {21},\nmonth = {May},\nyear = {2002},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/860}\n}\n
\n
\n','
\n@misc{talk-Kounev-DVSPhD02,\n  author = {Samuel Kounev},\n  title = {{J2EE PERFORMANCE: From Benchmarking to Sizing and Capacity Planning}},\n  howpublished = {DVS-PhD Internal Workshop, Darmstadt, Germany},\n  days = {21},\n  month = {May},\n  year = {2002},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/860}\n}\n
\n\n',NULL,'{J2EE PERFORMANCE: From Benchmarking to Sizing and Capacity Planning}',0,5,2002,5,NULL,NULL,NULL,'2015-05-23 07:42:59','2016-06-01 09:41:05',0),(861,'talk','talk-Kounev-BEA01','misc','@misc{talk-Kounev-BEA01,\n author = {Samuel Kounev},\n title = {{Implementing and Optimizing Sun\'s ECperf Benchmark with BEA WebLogic Server}},\n howpublished = {Invited Talk, BEA Hochschul-Industrie-Kooperations-Tagung, Frankfurt, Germany},\n days = {13},\n month = {November},\n year = {2001},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/861},\n}\n\n','\n\nSamuel Kounev.\nImplementing and Optimizing Sun\'s ECperf Benchmark with BEA WebLogic\nServer.\nInvited Talk, BEA Hochschul-Industrie-Kooperations-Tagung, Frankfurt,\nGermany, November 2001.\n[ bib | slides  ] 
\n@misc{talk-Kounev-BEA01,\nauthor = {Samuel Kounev},\ntitle = {{Implementing and Optimizing Sun\'s ECperf Benchmark with BEA WebLogic Server}},\nhowpublished = {Invited Talk, BEA Hochschul-Industrie-Kooperations-Tagung, Frankfurt, Germany},\ndays = {13},\nmonth = {November},\nyear = {2001},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/861}\n}\n
\n
\n','
\n@misc{talk-Kounev-BEA01,\n  author = {Samuel Kounev},\n  title = {{Implementing and Optimizing Sun\'s ECperf Benchmark with BEA WebLogic Server}},\n  howpublished = {Invited Talk, BEA Hochschul-Industrie-Kooperations-Tagung, Frankfurt, Germany},\n  days = {13},\n  month = {November},\n  year = {2001},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/861}\n}\n
\n\n',NULL,'{Implementing and Optimizing Sun\'s ECperf Benchmark with BEA WebLogic Server}',0,11,2001,11,NULL,NULL,NULL,'2015-05-23 07:44:28','2016-06-01 09:41:05',0),(862,'talk','talk-Kounev-BGOUG99','misc','@misc{talk-Kounev-BGOUG99,\n author = {Samuel Kounev},\n title = {{Electronic Store: MALL2000 - Mall for Online Business beyond the Year 2000}},\n howpublished = {Invited Talk, Bulgarian Oracle User Group (BGOUG) Annual Conference 1999, Sofia, Bulgaria},\n days = {4-5},\n month = {November},\n year = {1999},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/862},\n}\n\n','\n\nSamuel Kounev.\nElectronic Store: MALL2000 - Mall for Online Business beyond the\nYear 2000.\nInvited Talk, Bulgarian Oracle User Group (BGOUG) Annual Conference\n1999, Sofia, Bulgaria, November 1999.\n[ bib | slides  ] 
\n@misc{talk-Kounev-BGOUG99,\nauthor = {Samuel Kounev},\ntitle = {{Electronic Store: MALL2000 - Mall for Online Business beyond the Year 2000}},\nhowpublished = {Invited Talk, Bulgarian Oracle User Group (BGOUG) Annual Conference 1999, Sofia, Bulgaria},\ndays = {4-5},\nmonth = {November},\nyear = {1999},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/862}\n}\n
\n
\n','
\n@misc{talk-Kounev-BGOUG99,\n  author = {Samuel Kounev},\n  title = {{Electronic Store: MALL2000 - Mall for Online Business beyond the Year 2000}},\n  howpublished = {Invited Talk, Bulgarian Oracle User Group (BGOUG) Annual Conference 1999, Sofia, Bulgaria},\n  days = {4-5},\n  month = {November},\n  year = {1999},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/862}\n}\n
\n\n',NULL,'{Electronic Store: MALL2000 - Mall for Online Business beyond the Year 2000}',0,11,1999,11,NULL,NULL,NULL,'2015-05-23 07:46:32','2016-06-01 09:41:05',0),(864,'paper','thesis-Yavuz2013','mastersthesis','@mastersthesis{thesis-Yavuz2013,\n author = {Can Alexander Yavuz},\n month = {April},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{\\\"{U}berwachung des effektiven Kontrollflusses einer mehrschichtigen Anwendung}},\n type = {Bachelor\'s thesis (in German)},\n year = {2013},\n}\n\n','\n\nCan Alexander Yavuz.\nÜberwachung des effektiven Kontrollflusses einer mehrschichtigen\nAnwendung.\nBachelor\'s thesis (in german), Karlsruhe Institute of Technology\n(KIT), April 2013.\n[ bib  ] 
\n@mastersthesis{thesis-Yavuz2013,\nauthor = {Can Alexander Yavuz},\nmonth = {April},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{\\\"{U}berwachung des effektiven Kontrollflusses einer mehrschichtigen Anwendung}},\ntype = {Bachelor\'s thesis (in German)},\nyear = {2013}\n}\n
\n
\n','
\n@mastersthesis{thesis-Yavuz2013,\n  author = {Can Alexander Yavuz},\n  month = {April},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{\\\"{U}berwachung des effektiven Kontrollflusses einer mehrschichtigen Anwendung}},\n  type = {Bachelor\'s thesis (in German)},\n  year = {2013}\n}\n
\n\n',NULL,'{\\\"{U}berwachung des effektiven Kontrollflusses einer mehrschichtigen Anwendung}',0,4,2013,4,NULL,NULL,NULL,'2015-05-23 08:09:55','2016-06-01 09:41:05',0),(865,'paper','thesis-Busch2013','mastersthesis','@mastersthesis{thesis-Busch2013,\n author = {Axel Busch},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Workload Characterization for I/O Performance Analysis on IBM System z}},\n type = {Master\'s thesis},\n year = {2013},\n}\n\n','\n\nAxel Busch.\nWorkload Characterization for I/O Performance Analysis on IBM System\nz.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), 2013.\n[ bib  ] 
\n@mastersthesis{thesis-Busch2013,\nauthor = {Axel Busch},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Workload Characterization for I/O Performance Analysis on IBM System z}},\ntype = {Master\'s thesis},\nyear = {2013}\n}\n
\n
\n','
\n@mastersthesis{thesis-Busch2013,\n  author = {Axel Busch},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Workload Characterization for I/O Performance Analysis on IBM System z}},\n  type = {Master\'s thesis},\n  year = {2013}\n}\n
\n\n',NULL,'{Workload Characterization for I/O Performance Analysis on IBM System z}',0,0,2013,0,NULL,NULL,NULL,'2015-05-23 08:10:50','2016-06-01 09:41:05',0),(867,'paper','thesis-Rostami2012','mastersthesis','@mastersthesis{thesis-Rostami2012,\n author = {Kiana Rostami},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Performance-Vorhersage von virtualisiertem Storage mit Warteschlangennetzen}},\n type = {Bachelor\'s thesis (in German)},\n year = {2012},\n}\n\n','\n\nKiana Rostami.\nPerformance-Vorhersage von virtualisiertem Storage mit\nWarteschlangennetzen.\nBachelor\'s thesis (in german), Karlsruhe Institute of Technology\n(KIT), 2012.\n[ bib  ] 
\n@mastersthesis{thesis-Rostami2012,\nauthor = {Kiana Rostami},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Performance-Vorhersage von virtualisiertem Storage mit Warteschlangennetzen}},\ntype = {Bachelor\'s thesis (in German)},\nyear = {2012}\n}\n
\n
\n','
\n@mastersthesis{thesis-Rostami2012,\n  author = {Kiana Rostami},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Performance-Vorhersage von virtualisiertem Storage mit Warteschlangennetzen}},\n  type = {Bachelor\'s thesis (in German)},\n  year = {2012}\n}\n
\n\n',NULL,'{Performance-Vorhersage von virtualisiertem Storage mit Warteschlangennetzen}',0,0,2012,0,NULL,NULL,NULL,'2015-05-23 08:12:49','2016-06-01 09:41:05',0),(868,'paper','thesis-Bruhn2012','mastersthesis','@mastersthesis{thesis-Bruhn2012,\n author = {Dominik Bruhn},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Modeling and Experimental Analysis of Virtualized Storage Performance using IBM System Z as Example}},\n type = {Master\'s thesis},\n year = {2012},\n}\n\n','\n\nDominik Bruhn.\nModeling and Experimental Analysis of Virtualized Storage\nPerformance using IBM System Z as Example.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), 2012.\n[ bib  ] 
\n@mastersthesis{thesis-Bruhn2012,\nauthor = {Dominik Bruhn},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Modeling and Experimental Analysis of Virtualized Storage Performance using IBM System Z as Example}},\ntype = {Master\'s thesis},\nyear = {2012}\n}\n
\n
\n','
\n@mastersthesis{thesis-Bruhn2012,\n  author = {Dominik Bruhn},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Modeling and Experimental Analysis of Virtualized Storage Performance using IBM System Z as Example}},\n  type = {Master\'s thesis},\n  year = {2012}\n}\n
\n\n',NULL,'{Modeling and Experimental Analysis of Virtualized Storage Performance using IBM System Z as Example}',0,0,2012,0,NULL,NULL,NULL,'2015-05-23 08:14:05','2016-06-01 09:41:05',0),(870,'paper','thesis-Schott2012','mastersthesis','@mastersthesis{thesis-Schott2012,\n author = {Waldemar Schott},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Verbesserte Performance-Vorhersage f\\\"{u}r virtualisierte Umgebungen durchIntegration von Messergebnissen}},\n type = {{Bachelor\'s thesis (in German)}},\n year = {2012},\n}\n\n','\n\nWaldemar Schott.\nVerbesserte Performance-Vorhersage für virtualisierte Umgebungen\ndurchIntegration von Messergebnissen.\nBachelor\'s thesis (in German), Karlsruhe Institute of Technology\n(KIT), 2012.\n[ bib  ] 
\n@mastersthesis{thesis-Schott2012,\nauthor = {Waldemar Schott},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Verbesserte Performance-Vorhersage f\\\"{u}r virtualisierte Umgebungen durchIntegration von Messergebnissen}},\ntype = {{Bachelor\'s thesis (in German)}},\nyear = {2012}\n}\n
\n
\n','
\n@mastersthesis{thesis-Schott2012,\n  author = {Waldemar Schott},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Verbesserte Performance-Vorhersage f\\\"{u}r virtualisierte Umgebungen durchIntegration von Messergebnissen}},\n  type = {{Bachelor\'s thesis (in German)}},\n  year = {2012}\n}\n
\n\n',NULL,'{Verbesserte Performance-Vorhersage f\\\"{u}r virtualisierte Umgebungen durchIntegration von Messergebnissen}',0,0,2012,0,NULL,NULL,NULL,'2015-05-23 08:22:49','2016-06-01 09:41:05',0),(871,'paper','thesis-Becker2011','mastersthesis','@mastersthesis{thesis-Becker2011,\n author = {Stefan Becker},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Performance-Modellierung des 1\\&1 Mail-Systems}},\n type = {{Master\'s thesis (in German)}},\n year = {2011},\n}\n\n','\n\nStefan Becker.\nPerformance-Modellierung des 1&1 Mail-Systems.\nMaster\'s thesis (in German), Karlsruhe Institute of Technology\n(KIT), 2011.\n[ bib  ] 
\n@mastersthesis{thesis-Becker2011,\nauthor = {Stefan Becker},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Performance-Modellierung des 1\\&1 Mail-Systems}},\ntype = {{Master\'s thesis (in German)}},\nyear = {2011}\n}\n
\n
\n','
\n@mastersthesis{thesis-Becker2011,\n  author = {Stefan Becker},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Performance-Modellierung des 1\\&1 Mail-Systems}},\n  type = {{Master\'s thesis (in German)}},\n  year = {2011}\n}\n
\n\n',NULL,'{Performance-Modellierung des 1\\&1 Mail-Systems}',0,0,2011,0,NULL,NULL,NULL,'2015-05-23 08:24:16','2016-06-01 09:41:05',0),(872,'paper','thesis-Kusnady2011','mastersthesis','@mastersthesis{thesis-Kusnady2011,\n author = {Enrico Kusnady},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{QoS-aware Resource Allocation in Virtualized Environments}},\n type = {Master\'s thesis},\n year = {2011},\n}\n\n','\n\nEnrico Kusnady.\nQoS-aware Resource Allocation in Virtualized Environments.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), 2011.\n[ bib  ] 
\n@mastersthesis{thesis-Kusnady2011,\nauthor = {Enrico Kusnady},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{QoS-aware Resource Allocation in Virtualized Environments}},\ntype = {Master\'s thesis},\nyear = {2011}\n}\n
\n
\n','
\n@mastersthesis{thesis-Kusnady2011,\n  author = {Enrico Kusnady},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{QoS-aware Resource Allocation in Virtualized Environments}},\n  type = {Master\'s thesis},\n  year = {2011}\n}\n
\n\n',NULL,'{QoS-aware Resource Allocation in Virtualized Environments}',0,0,2011,0,NULL,NULL,NULL,'2015-05-23 08:26:14','2016-06-01 09:41:05',0),(873,'paper','thesis-vQuast2010','mastersthesis','@mastersthesis{thesis-vQuast2010,\n author = {Marcel von Quast},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Automatisierte Performance-Analyse von Virtualisierungsplattformen}},\n type = {Master\'s thesis (in German)},\n year = {2010},\n}\n\n','\n\nMarcel von Quast.\nAutomatisierte Performance-Analyse von Virtualisierungsplattformen.\nMaster\'s thesis (in german), Karlsruhe Institute of Technology (KIT),\n2010.\n[ bib  ] 
\n@mastersthesis{thesis-vQuast2010,\nauthor = {Marcel von Quast},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Automatisierte Performance-Analyse von Virtualisierungsplattformen}},\ntype = {Master\'s thesis (in German)},\nyear = {2010}\n}\n
\n
\n','
\n@mastersthesis{thesis-vQuast2010,\n  author = {Marcel von Quast},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Automatisierte Performance-Analyse von Virtualisierungsplattformen}},\n  type = {Master\'s thesis (in German)},\n  year = {2010}\n}\n
\n\n',NULL,'{Automatisierte Performance-Analyse von Virtualisierungsplattformen}',0,0,2010,0,NULL,NULL,NULL,'2015-05-23 08:27:20','2016-06-01 09:41:05',0),(875,'paper','thesis-Bender2010','mastersthesis','@mastersthesis{thesis-Bender2010,\n author = {Konstantin Bender},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Automated Performance Model Extraction of Enterprise Data Fabrics}},\n year = {2010},\n month = {May},\n}\n\n','\n\nKonstantin Bender.\nAutomated Performance Model Extraction of Enterprise Data Fabrics.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), May 2010.\n[ bib  ] 
\n@mastersthesis{thesis-Bender2010,\nauthor = {Konstantin Bender},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Automated Performance Model Extraction of Enterprise Data Fabrics}},\nyear = {2010},\nmonth = {May}\n}\n
\n
\n','
\n@mastersthesis{thesis-Bender2010,\n  author = {Konstantin Bender},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Automated Performance Model Extraction of Enterprise Data Fabrics}},\n  year = {2010},\n  month = {May}\n}\n
\n\n',NULL,'{Automated Performance Model Extraction of Enterprise Data Fabrics}',0,5,2010,5,NULL,NULL,NULL,'2015-05-23 08:33:23','2016-06-01 09:41:05',0),(876,'paper','thesis-Klatt2010','mastersthesis','@mastersthesis{thesis-Klatt2010,\n author = {Benjamin Klatt},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Modelling and prediction of event-based communication in component-based architectures}},\n type = {Master\'s thesis},\n year = {2010},\n note = {ObjektForum Thesis Award},\n}\n\n','\n\nBenjamin Klatt.\nModelling and prediction of event-based communication in\ncomponent-based architectures.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), 2010.\nObjektForum Thesis Award.\n[ bib  ] 
\n@mastersthesis{thesis-Klatt2010,\nauthor = {Benjamin Klatt},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Modelling and prediction of event-based communication in component-based architectures}},\ntype = {Master\'s thesis},\nyear = {2010},\nnote = {ObjektForum Thesis Award}\n}\n
\n
\n','
\n@mastersthesis{thesis-Klatt2010,\n  author = {Benjamin Klatt},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Modelling and prediction of event-based communication in component-based architectures}},\n  type = {Master\'s thesis},\n  year = {2010},\n  note = {ObjektForum Thesis Award}\n}\n
\n\n',NULL,'{Modelling and prediction of event-based communication in component-based architectures}',0,0,2010,0,NULL,NULL,NULL,'2015-05-23 08:34:46','2016-06-01 09:41:05',0),(877,'paper','thesis-Zipp2009','mastersthesis','@mastersthesis{thesis-Zipp2009,\n author = {Frederik Zipp},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Querying, Aggregating and Visualizing QPN Model Analysis Data}},\n type = {Study thesis},\n year = {2009},\n}\n\n','\n\nFrederik Zipp.\nQuerying, Aggregating and Visualizing QPN Model Analysis Data.\nStudy thesis, Karlsruhe Institute of Technology (KIT), 2009.\n[ bib  ] 
\n@mastersthesis{thesis-Zipp2009,\nauthor = {Frederik Zipp},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Querying, Aggregating and Visualizing QPN Model Analysis Data}},\ntype = {Study thesis},\nyear = {2009}\n}\n
\n
\n','
\n@mastersthesis{thesis-Zipp2009,\n  author = {Frederik Zipp},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Querying, Aggregating and Visualizing QPN Model Analysis Data}},\n  type = {Study thesis},\n  year = {2009}\n}\n
\n\n',NULL,'{Querying, Aggregating and Visualizing QPN Model Analysis Data}',0,0,2009,0,NULL,NULL,NULL,'2015-05-23 08:35:28','2016-06-01 09:41:05',0),(878,'paper','KiBeLaBlArKo2015-MASCOTS','inproceedings','@inproceedings{KiBeLaBlArKo2015-MASCOTS,\n author = {J\\\'{o}akim von Kistowski and John Beckett and Klaus-Dieter Lange and Hansfried Block and Jeremy A. Arnold and Samuel Kounev},\n abstract = {{Energy efficiency of servers has become a significant issue over the last years. Load distribution plays a crucial role in the improvement of energy efficiency as (un-)balancing strategies can be leveraged to distribute load over one or multiple systems in a way in which resources are utilized at high performance, yet low overall power consumption. This can be achieved on multiple levels, from load distribution on single CPU cores to machine level load balancing on distributed systems. With modern day server architectures providing load balancing opportunities at several layers, answering the question of optimal load distribution has become non-trivial. Work has to be distributed hierarchically in a fashion that enables maximum energy efficiency at each level. Current approaches balance load based on generalized assumptions about the energy efficiency of servers. These assumptions are based either on very machine-specific or highly generalized observations that may or may not hold true over a variety of systems and configurations. In this paper, we use a modified version of the SPEC SERT suite to measure the energy efficiency of a variety of hierarchical load distribution strategies on single and multi-node systems. We introduce a new strategy and evaluate energy efficiency for homogeneous and heterogeneous workloads over different hardware configurations. Our results show that the selection of a load distribution strategy depends heavily on workload, system utilization, as well as hardware. Used in conjunction with existing strategies, our new load distribution strategy can reduce a single system\'s power consumption by up to 10.7%.}},\n title = {{Energy Efficiency of Hierarchical Server Load Distribution Strategies}},\n year = {2015},\n booktitle = {Proceedings of the IEEE 23nd International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2015)},\n location = {Atlanta, GA, USA},\n month = {October},\n day = {5--7},\n publisher = {IEEE},\n keywords = {SPEC, SERT, Power, Benchmarking, Workload, Energy Efficiency, Metrics, Utilization, Load level},\n note = {Full paper acceptance rate: 19\\%},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/878.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/878},\n doi = {http://dx.doi.org/10.1109/MASCOTS.2015.11},\n}\n\n','\n\nJóakim von Kistowski, John Beckett, Klaus-Dieter Lange, Hansfried Block,\nJeremy A. Arnold, and Samuel Kounev.\nEnergy Efficiency of Hierarchical Server Load Distribution\nStrategies.\nIn Proceedings of the IEEE 23nd International Symposium on\nModeling, Analysis and Simulation of Computer and Telecommunication Systems\n(MASCOTS 2015), Atlanta, GA, USA, October 5-7, 2015. IEEE.\nOctober 2015, Full paper acceptance rate: 19%.\n[ bib | DOI | slides | .pdf | Abstract  ] 
\n@inproceedings{KiBeLaBlArKo2015-MASCOTS,\nauthor = {J\\\'{o}akim von Kistowski and John Beckett and Klaus-Dieter Lange and Hansfried Block and Jeremy A. Arnold and Samuel Kounev},\nabstract = {{Energy efficiency of servers has become a significant issue over the last years. Load distribution plays a crucial role in the improvement of energy efficiency as (un-)balancing strategies can be leveraged to distribute load over one or multiple systems in a way in which resources are utilized at high performance, yet low overall power consumption. This can be achieved on multiple levels, from load distribution on single CPU cores to machine level load balancing on distributed systems. With modern day server architectures providing load balancing opportunities at several layers, answering the question of optimal load distribution has become non-trivial. Work has to be distributed hierarchically in a fashion that enables maximum energy efficiency at each level. Current approaches balance load based on generalized assumptions about the energy efficiency of servers. These assumptions are based either on very machine-specific or highly generalized observations that may or may not hold true over a variety of systems and configurations. In this paper, we use a modified version of the SPEC SERT suite to measure the energy efficiency of a variety of hierarchical load distribution strategies on single and multi-node systems. We introduce a new strategy and evaluate energy efficiency for homogeneous and heterogeneous workloads over different hardware configurations. Our results show that the selection of a load distribution strategy depends heavily on workload, system utilization, as well as hardware. Used in conjunction with existing strategies, our new load distribution strategy can reduce a single system\'s power consumption by up to 10.7%.}},\ntitle = {{Energy Efficiency of Hierarchical Server Load Distribution Strategies}},\nyear = {2015},\nbooktitle = {Proceedings of the IEEE 23nd International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2015)},\nlocation = {Atlanta, GA, USA},\nmonth = {October},\nday = {5--7},\npublisher = {IEEE},\nkeywords = {SPEC, SERT, Power, Benchmarking, Workload, Energy Efficiency, Metrics, Utilization, Load level},\nnote = {Full paper acceptance rate: 19\\%},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/878.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/878},\ndoi = {http://dx.doi.org/10.1109/MASCOTS.2015.11}\n}\n
\n
\nEnergy efficiency of servers has become a significant issue over the last years. Load distribution plays a crucial role in the improvement of energy efficiency as (un-)balancing strategies can be leveraged to distribute load over one or multiple systems in a way in which resources are utilized at high performance, yet low overall power consumption. This can be achieved on multiple levels, from load distribution on single CPU cores to machine level load balancing on distributed systems. With modern day server architectures providing load balancing opportunities at several layers, answering the question of optimal load distribution has become non-trivial. Work has to be distributed hierarchically in a fashion that enables maximum energy efficiency at each level. Current approaches balance load based on generalized assumptions about the energy efficiency of servers. These assumptions are based either on very machine-specific or highly generalized observations that may or may not hold true over a variety of systems and configurations. In this paper, we use a modified version of the SPEC SERT suite to measure the energy efficiency of a variety of hierarchical load distribution strategies on single and multi-node systems. We introduce a new strategy and evaluate energy efficiency for homogeneous and heterogeneous workloads over different hardware configurations. Our results show that the selection of a load distribution strategy depends heavily on workload, system utilization, as well as hardware. Used in conjunction with existing strategies, our new load distribution strategy can reduce a single system\'s power consumption by up to 10.7%.\n
\n','
\n@inproceedings{KiBeLaBlArKo2015-MASCOTS,\n  author = {J\\\'{o}akim von Kistowski and John Beckett and Klaus-Dieter Lange and Hansfried Block and Jeremy A. Arnold and Samuel Kounev},\n  abstract = {{Energy efficiency of servers has become a significant issue over the last years. Load distribution plays a crucial role in the improvement of energy efficiency as (un-)balancing strategies can be leveraged to distribute load over one or multiple systems in a way in which resources are utilized at high performance, yet low overall power consumption. This can be achieved on multiple levels, from load distribution on single CPU cores to machine level load balancing on distributed systems. With modern day server architectures providing load balancing opportunities at several layers, answering the question of optimal load distribution has become non-trivial. Work has to be distributed hierarchically in a fashion that enables maximum energy efficiency at each level. Current approaches balance load based on generalized assumptions about the energy efficiency of servers. These assumptions are based either on very machine-specific or highly generalized observations that may or may not hold true over a variety of systems and configurations. In this paper, we use a modified version of the SPEC SERT suite to measure the energy efficiency of a variety of hierarchical load distribution strategies on single and multi-node systems. We introduce a new strategy and evaluate energy efficiency for homogeneous and heterogeneous workloads over different hardware configurations. Our results show that the selection of a load distribution strategy depends heavily on workload, system utilization, as well as hardware. Used in conjunction with existing strategies, our new load distribution strategy can reduce a single system\'s power consumption by up to 10.7%.}},\n  title = {{Energy Efficiency of Hierarchical Server Load Distribution Strategies}},\n  year = {2015},\n  booktitle = {Proceedings of the IEEE 23nd International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2015)},\n  location = {Atlanta, GA, USA},\n  month = {October},\n  day = {5--7},\n  publisher = {IEEE},\n  keywords = {SPEC, SERT, Power, Benchmarking, Workload, Energy Efficiency, Metrics, Utilization, Load level},\n  note = {Full paper acceptance rate: 19\\%},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/878.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/878},\n  doi = {http://dx.doi.org/10.1109/MASCOTS.2015.11}\n}\n
\n\n','{Energy efficiency of servers has become a significant issue over the last years. Load distribution plays a crucial role in the improvement of energy efficiency as (un-)balancing strategies can be leveraged to distribute load over one or multiple systems in a way in which resources are utilized at high performance, yet low overall power consumption. This can be achieved on multiple levels, from load distribution on single CPU cores to machine level load balancing on distributed systems. With modern day server architectures providing load balancing opportunities at several layers, answering the question of optimal load distribution has become non-trivial. Work has to be distributed hierarchically in a fashion that enables maximum energy efficiency at each level. Current approaches balance load based on generalized assumptions about the energy efficiency of servers. These assumptions are based either on very machine-specific or highly generalized observations that may or may not hold true over a variety of systems and configurations. In this paper, we use a modified version of the SPEC SERT suite to measure the energy efficiency of a variety of hierarchical load distribution strategies on single and multi-node systems. We introduce a new strategy and evaluate energy efficiency for homogeneous and heterogeneous workloads over different hardware configurations. Our results show that the selection of a load distribution strategy depends heavily on workload, system utilization, as well as hardware. Used in conjunction with existing strategies, our new load distribution strategy can reduce a single system\'s power consumption by up to 10.7%.}','{Energy Efficiency of Hierarchical Server Load Distribution Strategies}',0,10,2015,10,NULL,NULL,NULL,'2015-05-27 13:55:28','2016-06-01 09:41:05',0),(879,'talk','Talk-KoBrHu2015-SE-SelfAwareDescartes','misc','@misc{Talk-KoBrHu2015-SE-SelfAwareDescartes,\n address = {Bonn, Germany},\n author = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\n howpublished = {Software Engineering 2015, Fachtagung des GI-Fachbereichs Softwaretechnik, 17. - 20. M\\\"{a}rz 2015, Dresden, Deutschland},\n title = {{The Descartes Modeling Language for Self-Aware Performance and Resource Management}},\n year = {2015},\n month = {March},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/879},\n}\n\n','\n\nSamuel Kounev, Fabian Brosig, and Nikolaus Huber.\nThe Descartes Modeling Language for Self-Aware Performance and\nResource Management.\nSoftware Engineering 2015, Fachtagung des GI-Fachbereichs\nSoftwaretechnik, 17. - 20. März 2015, Dresden, Deutschland, March 2015.\n[ bib | slides  ] 
\n@misc{Talk-KoBrHu2015-SE-SelfAwareDescartes,\naddress = {Bonn, Germany},\nauthor = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\nhowpublished = {Software Engineering 2015, Fachtagung des GI-Fachbereichs Softwaretechnik, 17. - 20. M\\\"{a}rz 2015, Dresden, Deutschland},\ntitle = {{The Descartes Modeling Language for Self-Aware Performance and Resource Management}},\nyear = {2015},\nmonth = {March},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/879}\n}\n
\n
\n','
\n@misc{Talk-KoBrHu2015-SE-SelfAwareDescartes,\n  address = {Bonn, Germany},\n  author = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\n  howpublished = {Software Engineering 2015, Fachtagung des GI-Fachbereichs Softwaretechnik, 17. - 20. M\\\"{a}rz 2015, Dresden, Deutschland},\n  title = {{The Descartes Modeling Language for Self-Aware Performance and Resource Management}},\n  year = {2015},\n  month = {March},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/879}\n}\n
\n\n',NULL,'{The Descartes Modeling Language for Self-Aware Performance and Resource Management}',0,3,2015,3,NULL,NULL,NULL,'2015-05-27 14:39:49','2016-06-01 09:41:05',0),(881,'talk','talk-Walter-SOSP14','misc','@misc{talk-Walter-SOSP14,\n author = {J\\\"{u}rgen Walter and Simon Spinner and Samuel Kounev},\n title = {{Parallel Simulation of Queueing Petri Nets}},\n howpublished = {Technical Talk at Symposion on Software Performance (SOSP) 2014},\n days = {28},\n month = {November},\n year = {2014},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/881},\n}\n\n','\n\nJürgen Walter, Simon Spinner, and Samuel Kounev.\nParallel Simulation of Queueing Petri Nets.\nTechnical Talk at Symposion on Software Performance (SOSP) 2014,\nNovember 2014.\n[ bib | slides  ] 
\n@misc{talk-Walter-SOSP14,\nauthor = {J\\\"{u}rgen Walter and Simon Spinner and Samuel Kounev},\ntitle = {{Parallel Simulation of Queueing Petri Nets}},\nhowpublished = {Technical Talk at Symposion on Software Performance (SOSP) 2014},\ndays = {28},\nmonth = {November},\nyear = {2014},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/881}\n}\n
\n
\n','
\n@misc{talk-Walter-SOSP14,\n  author = {J\\\"{u}rgen Walter and Simon Spinner and Samuel Kounev},\n  title = {{Parallel Simulation of Queueing Petri Nets}},\n  howpublished = {Technical Talk at Symposion on Software Performance (SOSP) 2014},\n  days = {28},\n  month = {November},\n  year = {2014},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/881}\n}\n
\n\n',NULL,'{Parallel Simulation of Queueing Petri Nets}',0,11,2014,11,NULL,NULL,NULL,'2015-06-03 14:38:41','2016-06-01 09:41:05',0),(882,'talk','talk-Spinner-SOSP14','misc','@misc{talk-Spinner-SOSP14,\n author = {Simon Spinner and J\\\"{u}rgen Walter},\n title = {{LibReDE: A Library for Resource Demand Estimation}},\n howpublished = {Technical Talk at Symposion on Software Performance (SOSP) 2014},\n days = {28},\n month = {November},\n year = {2014},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/882},\n}\n\n','\n\nSimon Spinner and Jürgen Walter.\nLibReDE: A Library for Resource Demand Estimation.\nTechnical Talk at Symposion on Software Performance (SOSP) 2014,\nNovember 2014.\n[ bib | slides  ] 
\n@misc{talk-Spinner-SOSP14,\nauthor = {Simon Spinner and J\\\"{u}rgen Walter},\ntitle = {{LibReDE: A Library for Resource Demand Estimation}},\nhowpublished = {Technical Talk at Symposion on Software Performance (SOSP) 2014},\ndays = {28},\nmonth = {November},\nyear = {2014},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/882}\n}\n
\n
\n','
\n@misc{talk-Spinner-SOSP14,\n  author = {Simon Spinner and J\\\"{u}rgen Walter},\n  title = {{LibReDE: A Library for Resource Demand Estimation}},\n  howpublished = {Technical Talk at Symposion on Software Performance (SOSP) 2014},\n  days = {28},\n  month = {November},\n  year = {2014},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/882}\n}\n
\n\n',NULL,'{LibReDE: A Library for Resource Demand Estimation}',0,11,2014,11,NULL,NULL,NULL,'2015-06-03 14:43:40','2016-06-01 09:41:05',0),(883,'paper','nehmeierTR495','techreport','@techreport{nehmeierTR495,\n abstract = {Libraries implementing the interval arithmetic standard IEEE 1788 have to be tested for errors. Although the standard is language agnostic, the different implementations are not. Therefore the same tests must be implemented in many different languages. Hence it is useful to only have to formulate the tests once in a domain-specific language and to subsequently generate the language-specific test code automatically. To save time and encourage test-driven development, we present a language for testing interval arithmetic libraries and a corresponding source code generator which produces language-specific unit tests.},\n author = {Kiesner, Maximilian and Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\n institution = {Department of Computer Science, University of W\\\"urzburg},\n month = {June},\n number = {495},\n title = {{ITF1788: An Interval Testframework for IEEE 1788}},\n url = {http://wwwi2.informatik.uni-wuerzburg.de/publications/tr495.pdf},\n year = {2015},\n}\n\n','\n\nMaximilian Kiesner, Marco Nehmeier, and Jürgen Wolff von Gudenberg.\nITF1788: An Interval Testframework for IEEE 1788.\nTechnical Report 495, Department of Computer Science, University of\nWürzburg, June 2015.\n[ bib | .pdf | Abstract  ] 
\n@techreport{nehmeierTR495,\nabstract = {Libraries implementing the interval arithmetic standard IEEE 1788 have to be tested for errors. Although the standard is language agnostic, the different implementations are not. Therefore the same tests must be implemented in many different languages. Hence it is useful to only have to formulate the tests once in a domain-specific language and to subsequently generate the language-specific test code automatically. To save time and encourage test-driven development, we present a language for testing interval arithmetic libraries and a corresponding source code generator which produces language-specific unit tests.},\nauthor = {Kiesner, Maximilian and Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\ninstitution = {Department of Computer Science, University of W\\\"urzburg},\nmonth = {June},\nnumber = {495},\ntitle = {{ITF1788: An Interval Testframework for IEEE 1788}},\nurl = {http://wwwi2.informatik.uni-wuerzburg.de/publications/tr495.pdf},\nyear = {2015}\n}\n
\n
\nLibraries implementing the interval arithmetic standard IEEE 1788 have to be tested for errors. Although the standard is language agnostic, the different implementations are not. Therefore the same tests must be implemented in many different languages. Hence it is useful to only have to formulate the tests once in a domain-specific language and to subsequently generate the language-specific test code automatically. To save time and encourage test-driven development, we present a language for testing interval arithmetic libraries and a corresponding source code generator which produces language-specific unit tests.\n
\n','
\n@techreport{nehmeierTR495,\n  abstract = {Libraries implementing the interval arithmetic standard IEEE 1788 have to be tested for errors. Although the standard is language agnostic, the different implementations are not. Therefore the same tests must be implemented in many different languages. Hence it is useful to only have to formulate the tests once in a domain-specific language and to subsequently generate the language-specific test code automatically. To save time and encourage test-driven development, we present a language for testing interval arithmetic libraries and a corresponding source code generator which produces language-specific unit tests.},\n  author = {Kiesner, Maximilian and Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\n  institution = {Department of Computer Science, University of W\\\"urzburg},\n  month = {June},\n  number = {495},\n  title = {{ITF1788: An Interval Testframework for IEEE 1788}},\n  url = {http://wwwi2.informatik.uni-wuerzburg.de/publications/tr495.pdf},\n  year = {2015}\n}\n
\n\n','Libraries implementing the interval arithmetic standard IEEE 1788 have to be tested for errors. Although the standard is language agnostic, the different implementations are not. Therefore the same tests must be implemented in many different languages. Hence it is useful to only have to formulate the tests once in a domain-specific language and to subsequently generate the language-specific test code automatically. To save time and encourage test-driven development, we present a language for testing interval arithmetic libraries and a corresponding source code generator which produces language-specific unit tests.','{ITF1788: An Interval Testframework for IEEE 1788}',0,6,2015,6,NULL,NULL,NULL,'2015-06-17 13:04:01','2016-06-01 10:31:37',0),(884,'talk','talk-Kounev-CAS2015','misc','@misc{talk-Kounev-CAS2015,\n author = {Samuel Kounev},\n title = {{Software Engineering Research at the University of W\\\"urzburg}},\n howpublished = {Invited Talk, CAS Software AG, Karlsruhe, Germany},\n days = {26},\n month = {June},\n year = {2015},\n}\n\n','\n\nSamuel Kounev.\nSoftware Engineering Research at the University of Würzburg.\nInvited Talk, CAS Software AG, Karlsruhe, Germany, June 2015.\n[ bib  ] 
\n@misc{talk-Kounev-CAS2015,\nauthor = {Samuel Kounev},\ntitle = {{Software Engineering Research at the University of W\\\"urzburg}},\nhowpublished = {Invited Talk, CAS Software AG, Karlsruhe, Germany},\ndays = {26},\nmonth = {June},\nyear = {2015}\n}\n
\n
\n','
\n@misc{talk-Kounev-CAS2015,\n  author = {Samuel Kounev},\n  title = {{Software Engineering Research at the University of W\\\"urzburg}},\n  howpublished = {Invited Talk, CAS Software AG, Karlsruhe, Germany},\n  days = {26},\n  month = {June},\n  year = {2015}\n}\n
\n\n',NULL,'{Software Engineering Research at the University of W\\\"urzburg}',0,6,2015,6,NULL,NULL,NULL,'2015-06-19 10:59:06','2016-06-01 09:41:05',0),(885,'talk','talk-Kounev-DATEV_TrendScout2015a','misc','@misc{talk-Kounev-DATEV_TrendScout2015a,\n author = {Samuel Kounev},\n title = {{How elastic is your cloud? From metrics to benchmarks}},\n howpublished = {Invited Talk, DATEV Trendscout, N\\\"urnberg, Germany},\n days = {5},\n month = {May},\n year = {2015},\n}\n\n','\n\nSamuel Kounev.\nHow elastic is your cloud? From metrics to benchmarks.\nInvited Talk, DATEV Trendscout, Nürnberg, Germany, May 2015.\n[ bib  ] 
\n@misc{talk-Kounev-DATEV_TrendScout2015a,\nauthor = {Samuel Kounev},\ntitle = {{How elastic is your cloud? From metrics to benchmarks}},\nhowpublished = {Invited Talk, DATEV Trendscout, N\\\"urnberg, Germany},\ndays = {5},\nmonth = {May},\nyear = {2015}\n}\n
\n
\n','
\n@misc{talk-Kounev-DATEV_TrendScout2015a,\n  author = {Samuel Kounev},\n  title = {{How elastic is your cloud? From metrics to benchmarks}},\n  howpublished = {Invited Talk, DATEV Trendscout, N\\\"urnberg, Germany},\n  days = {5},\n  month = {May},\n  year = {2015}\n}\n
\n\n',NULL,'{How elastic is your cloud? From metrics to benchmarks}',0,5,2015,5,NULL,NULL,NULL,'2015-06-19 11:04:38','2016-06-01 09:41:05',0),(886,'talk','talk-Kounev-DATEV2015','misc','@misc{talk-Kounev-DATEV2015,\n author = {Samuel Kounev},\n title = {{Self-Aware Performance and Resource Management in Shared IT Infrastructures}},\n howpublished = {Invited Talk, DATEV eG, 90329 N\\\"urnberg, Germany},\n days = {5},\n month = {May},\n year = {2015},\n}\n\n','\n\nSamuel Kounev.\nSelf-Aware Performance and Resource Management in Shared IT\nInfrastructures.\nInvited Talk, DATEV eG, 90329 Nürnberg, Germany, May 2015.\n[ bib  ] 
\n@misc{talk-Kounev-DATEV2015,\nauthor = {Samuel Kounev},\ntitle = {{Self-Aware Performance and Resource Management in Shared IT Infrastructures}},\nhowpublished = {Invited Talk, DATEV eG, 90329 N\\\"urnberg, Germany},\ndays = {5},\nmonth = {May},\nyear = {2015}\n}\n
\n
\n','
\n@misc{talk-Kounev-DATEV2015,\n  author = {Samuel Kounev},\n  title = {{Self-Aware Performance and Resource Management in Shared IT Infrastructures}},\n  howpublished = {Invited Talk, DATEV eG, 90329 N\\\"urnberg, Germany},\n  days = {5},\n  month = {May},\n  year = {2015}\n}\n
\n\n',NULL,'{Self-Aware Performance and Resource Management in Shared IT Infrastructures}',0,5,2015,5,NULL,NULL,NULL,'2015-06-19 11:06:28','2016-06-01 09:41:05',0),(887,'paper','WiDlBrSpKoKr2015-EPEW-LibredePMWT','inproceedings','@inproceedings{WiDlBrSpKoKr2015-EPEW-LibredePMWT,\n author = {Felix Willnecker and Markus Dlugi and Andreas Brunnert and Simon Spinner and Samuel Kounev and Helmut Krcmar},\n title = {{Comparing the Accuracy of Resource Demand Measurement and Estimation Techniques}},\n booktitle = {Computer Performance Engineering - Proceedings of the 12th European Workshop (EPEW 2015)},\n location = {Madrid, Spain},\n series = {Lecture Notes in Computer Science},\n volume = {9272},\n pages = {115-129},\n editor = {Beltr\\\'{a}n, Marta and Knottenbelt, William and Bradley, Jeremy},\n year = {2015},\n month = {{August}},\n isbn = {978-3-319-23266-9},\n doi = {10.1007/978-3-319-23267-6_8},\n publisher = {Springer},\n location = {Madrid, Spain},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/887.pdf},\n abstract = {Resource demands are a core aspect of performance models. They describe how an operation utilizes a resource and therefore influence the systems performance metrics: response time, resource utilization and throughput. Such demands can be determined by two extraction classes: direct measurement or demand estimation. Selecting the best suited technique depends on available tools, acceptable measurement overhead and the level of granularity necessary for the performance model. This work compares two direct measurement techniques and an adaptive estimation technique based on multiple statistical approaches to evaluate strengths and weaknesses of each technique.We conduct a series of experiments using the SPECjEnterprise2010 industry benchmark and an automatic performance model generator for architecture-level performance models based on the Palladio Component Model. To compare the techniques we conduct two experiments with different levels of granularity on a standalone system, followed by one experiment using a distributed SPECjEnterprise2010 deployment combining both extraction classes for generating a full-stack performance model.},\n}\n\n','\n\nFelix Willnecker, Markus Dlugi, Andreas Brunnert, Simon Spinner, Samuel Kounev,\nand Helmut Krcmar.\nComparing the Accuracy of Resource Demand Measurement and Estimation\nTechniques.\nIn Computer Performance Engineering - Proceedings of the 12th\nEuropean Workshop (EPEW 2015), Marta Beltrán, William Knottenbelt, and\nJeremy Bradley, editors, Madrid, Spain, August 2015, volume 9272 of \nLecture Notes in Computer Science, pages 115-129. Springer.\nAugust 2015.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{WiDlBrSpKoKr2015-EPEW-LibredePMWT,\nauthor = {Felix Willnecker and Markus Dlugi and Andreas Brunnert and Simon Spinner and Samuel Kounev and Helmut Krcmar},\ntitle = {{Comparing the Accuracy of Resource Demand Measurement and Estimation Techniques}},\nbooktitle = {Computer Performance Engineering - Proceedings of the 12th European Workshop (EPEW 2015)},\nlocation = {Madrid, Spain},\nseries = {Lecture Notes in Computer Science},\nvolume = {9272},\npages = {115-129},\neditor = {Beltr\\\'{a}n, Marta and Knottenbelt, William and Bradley, Jeremy},\nyear = {2015},\nmonth = {{August}},\nisbn = {978-3-319-23266-9},\ndoi = {10.1007/978-3-319-23267-6_8},\npublisher = {Springer},\nlocation = {Madrid, Spain},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/887.pdf},\nabstract = {Resource demands are a core aspect of performance models. They describe how an operation utilizes a resource and therefore influence the systems performance metrics: response time, resource utilization and throughput. Such demands can be determined by two extraction classes: direct measurement or demand estimation. Selecting the best suited technique depends on available tools, acceptable measurement overhead and the level of granularity necessary for the performance model. This work compares two direct measurement techniques and an adaptive estimation technique based on multiple statistical approaches to evaluate strengths and weaknesses of each technique.We conduct a series of experiments using the SPECjEnterprise2010 industry benchmark and an automatic performance model generator for architecture-level performance models based on the Palladio Component Model. To compare the techniques we conduct two experiments with different levels of granularity on a standalone system, followed by one experiment using a distributed SPECjEnterprise2010 deployment combining both extraction classes for generating a full-stack performance model.}\n}\n
\n
\nResource demands are a core aspect of performance models. They describe how an operation utilizes a resource and therefore influence the systems performance metrics: response time, resource utilization and throughput. Such demands can be determined by two extraction classes: direct measurement or demand estimation. Selecting the best suited technique depends on available tools, acceptable measurement overhead and the level of granularity necessary for the performance model. This work compares two direct measurement techniques and an adaptive estimation technique based on multiple statistical approaches to evaluate strengths and weaknesses of each technique.We conduct a series of experiments using the SPECjEnterprise2010 industry benchmark and an automatic performance model generator for architecture-level performance models based on the Palladio Component Model. To compare the techniques we conduct two experiments with different levels of granularity on a standalone system, followed by one experiment using a distributed SPECjEnterprise2010 deployment combining both extraction classes for generating a full-stack performance model.\n
\n','
\n@inproceedings{WiDlBrSpKoKr2015-EPEW-LibredePMWT,\n  author = {Felix Willnecker and Markus Dlugi and Andreas Brunnert and Simon Spinner and Samuel Kounev and Helmut Krcmar},\n  title = {{Comparing the Accuracy of Resource Demand Measurement and Estimation Techniques}},\n  booktitle = {Computer Performance Engineering - Proceedings of the 12th European Workshop (EPEW 2015)},\n  location = {Madrid, Spain},\n  series = {Lecture Notes in Computer Science},\n  volume = {9272},\n  pages = {115-129},\n  editor = {Beltr\\\'{a}n, Marta and Knottenbelt, William and Bradley, Jeremy},\n  year = {2015},\n  month = {{August}},\n  isbn = {978-3-319-23266-9},\n  doi = {10.1007/978-3-319-23267-6_8},\n  publisher = {Springer},\n  location = {Madrid, Spain},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/887.pdf},\n  abstract = {Resource demands are a core aspect of performance models. They describe how an operation utilizes a resource and therefore influence the systems performance metrics: response time, resource utilization and throughput. Such demands can be determined by two extraction classes: direct measurement or demand estimation. Selecting the best suited technique depends on available tools, acceptable measurement overhead and the level of granularity necessary for the performance model. This work compares two direct measurement techniques and an adaptive estimation technique based on multiple statistical approaches to evaluate strengths and weaknesses of each technique.We conduct a series of experiments using the SPECjEnterprise2010 industry benchmark and an automatic performance model generator for architecture-level performance models based on the Palladio Component Model. To compare the techniques we conduct two experiments with different levels of granularity on a standalone system, followed by one experiment using a distributed SPECjEnterprise2010 deployment combining both extraction classes for generating a full-stack performance model.}\n}\n
\n\n','Resource demands are a core aspect of performance models. They describe how an operation utilizes a resource and therefore influence the systems performance metrics: response time, resource utilization and throughput. Such demands can be determined by two extraction classes: direct measurement or demand estimation. Selecting the best suited technique depends on available tools, acceptable measurement overhead and the level of granularity necessary for the performance model. This work compares two direct measurement techniques and an adaptive estimation technique based on multiple statistical approaches to evaluate strengths and weaknesses of each technique.We conduct a series of experiments using the SPECjEnterprise2010 industry benchmark and an automatic performance model generator for architecture-level performance models based on the Palladio Component Model. To compare the techniques we conduct two experiments with different levels of granularity on a standalone system, followed by one experiment using a distributed SPECjEnterprise2010 deployment combining both extraction classes for generating a full-stack performance model.','{Comparing the Accuracy of Resource Demand Measurement and Estimation Techniques}',0,8,2015,8,NULL,NULL,NULL,'2015-06-28 18:07:30','2016-06-01 09:41:05',0),(888,'paper','MiViKoAvPa2015-CSUR-IDSEval','article','@article{MiViKoAvPa2015-CSUR-IDSEval,\n author = {Aleksandar Milenkoski and Marco Vieira and Samuel Kounev and Alberto Avrtizer and Bryan D. Payne},\n title = {{Evaluating Computer Intrusion Detection Systems: A Survey of Common Practices}},\n journal = {{ACM Computing Surveys}},\n publisher = {ACM},\n address = {New York, NY, USA},\n year = {2015},\n month = {{September}},\n volume = {48},\n number = {1},\n pages = {12:1--12:41},\n url = {http://dl.acm.org/authorize?N06203},\n note = {{5-year Impact Factor (2014): 5.949}},\n abstract = {{The evaluation of computer intrusion detection systems (which we refer to as intrusion detection systems) is an active research area. In this paper, we survey and systematize common practices in the area of evaluation of intrusion detection systems. For this purpose, we define a design space structured into three parts: workload, metrics, and measurement methodology. We then provide an overview of the common practices in evaluation of intrusion detection systems by surveying evaluation approaches and methods related to each part of the design space. Finally, we discuss open issues and challenges focusing on evaluation methodologies for novel intrusion detection systems.}},\n}\n\n','\n\nAleksandar Milenkoski, Marco Vieira, Samuel Kounev, Alberto Avrtizer, and\nBryan D. Payne.\nEvaluating Computer Intrusion Detection Systems: A Survey of Common\nPractices.\nACM Computing Surveys, 48(1):12:1-12:41, September 2015,\nACM, New York, NY, USA.\n5-year Impact Factor (2014): 5.949.\n[ bib | http | Abstract  ] 
\n@article{MiViKoAvPa2015-CSUR-IDSEval,\nauthor = {Aleksandar Milenkoski and Marco Vieira and Samuel Kounev and Alberto Avrtizer and Bryan D. Payne},\ntitle = {{Evaluating Computer Intrusion Detection Systems: A Survey of Common Practices}},\njournal = {{ACM Computing Surveys}},\npublisher = {ACM},\naddress = {New York, NY, USA},\nyear = {2015},\nmonth = {{September}},\nvolume = {48},\nnumber = {1},\npages = {12:1--12:41},\nurl = {http://dl.acm.org/authorize?N06203},\nnote = {{5-year Impact Factor (2014): 5.949}},\nabstract = {{The evaluation of computer intrusion detection systems (which we refer to as intrusion detection systems) is an active research area. In this paper, we survey and systematize common practices in the area of evaluation of intrusion detection systems. For this purpose, we define a design space structured into three parts: workload, metrics, and measurement methodology. We then provide an overview of the common practices in evaluation of intrusion detection systems by surveying evaluation approaches and methods related to each part of the design space. Finally, we discuss open issues and challenges focusing on evaluation methodologies for novel intrusion detection systems.}}\n}\n
\n
\nThe evaluation of computer intrusion detection systems (which we refer to as intrusion detection systems) is an active research area. In this paper, we survey and systematize common practices in the area of evaluation of intrusion detection systems. For this purpose, we define a design space structured into three parts: workload, metrics, and measurement methodology. We then provide an overview of the common practices in evaluation of intrusion detection systems by surveying evaluation approaches and methods related to each part of the design space. Finally, we discuss open issues and challenges focusing on evaluation methodologies for novel intrusion detection systems.\n
\n','
\n@article{MiViKoAvPa2015-CSUR-IDSEval,\n  author = {Aleksandar Milenkoski and Marco Vieira and Samuel Kounev and Alberto Avrtizer and Bryan D. Payne},\n  title = {{Evaluating Computer Intrusion Detection Systems: A Survey of Common Practices}},\n  journal = {{ACM Computing Surveys}},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  year = {2015},\n  month = {{September}},\n  volume = {48},\n  number = {1},\n  pages = {12:1--12:41},\n  url = {http://dl.acm.org/authorize?N06203},\n  note = {{5-year Impact Factor (2014): 5.949}},\n  abstract = {{The evaluation of computer intrusion detection systems (which we refer to as intrusion detection systems) is an active research area. In this paper, we survey and systematize common practices in the area of evaluation of intrusion detection systems. For this purpose, we define a design space structured into three parts: workload, metrics, and measurement methodology. We then provide an overview of the common practices in evaluation of intrusion detection systems by surveying evaluation approaches and methods related to each part of the design space. Finally, we discuss open issues and challenges focusing on evaluation methodologies for novel intrusion detection systems.}}\n}\n
\n\n','{The evaluation of computer intrusion detection systems (which we refer to as intrusion detection systems) is an active research area. In this paper, we survey and systematize common practices in the area of evaluation of intrusion detection systems. For this purpose, we define a design space structured into three parts: workload, metrics, and measurement methodology. We then provide an overview of the common practices in evaluation of intrusion detection systems by surveying evaluation approaches and methods related to each part of the design space. Finally, we discuss open issues and challenges focusing on evaluation methodologies for novel intrusion detection systems.}','{Evaluating Computer Intrusion Detection Systems: A Survey of Common Practices}',0,9,2015,9,NULL,NULL,NULL,'2015-07-01 08:26:33','2016-06-01 09:41:06',0),(889,'paper','Gehring2015','mastersthesis','@mastersthesis{Gehring2015,\n author = {Andreas Gehring},\n address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n title = {{Metriken zur Bestimmung der Energieeffizienz von Servern}},\n type = {{Bachelor Thesis}},\n school = {University of W\\\"{u}rzburg},\n year = {2014},\n month = {October},\n}\n\n','\n\nAndreas Gehring.\nMetriken zur Bestimmung der Energieeffizienz von Servern.\nBachelor Thesis, University of Würzburg, Am Hubland,\nInformatikgebäude, 97074 Würzburg, Germany, October 2014.\n[ bib  ] 
\n@mastersthesis{Gehring2015,\nauthor = {Andreas Gehring},\naddress = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\ntitle = {{Metriken zur Bestimmung der Energieeffizienz von Servern}},\ntype = {{Bachelor Thesis}},\nschool = {University of W\\\"{u}rzburg},\nyear = {2014},\nmonth = {October}\n}\n
\n
\n','
\n@mastersthesis{Gehring2015,\n  author = {Andreas Gehring},\n  address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n  title = {{Metriken zur Bestimmung der Energieeffizienz von Servern}},\n  type = {{Bachelor Thesis}},\n  school = {University of W\\\"{u}rzburg},\n  year = {2014},\n  month = {October}\n}\n
\n\n',NULL,'{Metriken zur Bestimmung der Energieeffizienz von Servern}',0,10,2014,10,NULL,NULL,NULL,'2015-07-03 09:10:24','2016-06-01 09:41:06',0),(890,'paper','SpCaBrKo2015-PEVA-ResDemEstSurvey','article','@article{SpCaBrKo2015-PEVA-ResDemEstSurvey,\n author = {Spinner, Simon and Casale, Giuliano and Brosig, Fabian and Kounev, Samuel},\n title = {{Evaluating Approaches to Resource Demand Estimation}},\n journal = {Performance Evaluation},\n month = {October},\n year = {2015},\n volume = {92},\n number = {},\n pages = {51 -- 71},\n issn = {0166-5316},\n url = {http://www.sciencedirect.com/science/article/pii/S0166531615000711},\n publisher = {Elsevier B.V.},\n doi = {10.1016/j.peva.2015.07.005},\n abstract = {Resource demands are a key parameter of stochastic performance models that needs to be determined when performing a quantitative performance analysis of a system. However, the direct measurement of resource demands is not feasible in most realistic systems. Therefore, statistical approaches that estimate resource demands based on coarse-grained monitoring data (e.g., CPU utilization, and response times) have been proposed in the literature. These approaches have different assumptions and characteristics that need to be considered when estimating resource demands. This paper surveys the state-of-the-art in resource demand estimation and proposes a classification scheme for estimation approaches. Furthermore, it contains an experimental evaluation comparing the impact of different factors (monitoring window size, number of workload classes, load level, collinearity, and model mismatch) on the estimation accuracy of seven different approaches. The classification scheme and the experimental comparison helps performance engineers to select an approach to resource demand estimation that fulfills the requirements of a given analysis scenario.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/890.pdf},\n}\n\n','\n\nSimon Spinner, Giuliano Casale, Fabian Brosig, and Samuel Kounev.\nEvaluating Approaches to Resource Demand Estimation.\nPerformance Evaluation, 92:51 - 71, October 2015, Elsevier\nB.V.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@article{SpCaBrKo2015-PEVA-ResDemEstSurvey,\nauthor = {Spinner, Simon and Casale, Giuliano and Brosig, Fabian and Kounev, Samuel},\ntitle = {{Evaluating Approaches to Resource Demand Estimation}},\njournal = {Performance Evaluation},\nmonth = {October},\nyear = {2015},\nvolume = {92},\nnumber = {},\npages = {51 -- 71},\nissn = {0166-5316},\nurl = {http://www.sciencedirect.com/science/article/pii/S0166531615000711},\npublisher = {Elsevier B.V.},\ndoi = {10.1016/j.peva.2015.07.005},\nabstract = {Resource demands are a key parameter of stochastic performance models that needs to be determined when performing a quantitative performance analysis of a system. However, the direct measurement of resource demands is not feasible in most realistic systems. Therefore, statistical approaches that estimate resource demands based on coarse-grained monitoring data (e.g., CPU utilization, and response times) have been proposed in the literature. These approaches have different assumptions and characteristics that need to be considered when estimating resource demands. This paper surveys the state-of-the-art in resource demand estimation and proposes a classification scheme for estimation approaches. Furthermore, it contains an experimental evaluation comparing the impact of different factors (monitoring window size, number of workload classes, load level, collinearity, and model mismatch) on the estimation accuracy of seven different approaches. The classification scheme and the experimental comparison helps performance engineers to select an approach to resource demand estimation that fulfills the requirements of a given analysis scenario.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/890.pdf}\n}\n
\n
\nResource demands are a key parameter of stochastic performance models that needs to be determined when performing a quantitative performance analysis of a system. However, the direct measurement of resource demands is not feasible in most realistic systems. Therefore, statistical approaches that estimate resource demands based on coarse-grained monitoring data (e.g., CPU utilization, and response times) have been proposed in the literature. These approaches have different assumptions and characteristics that need to be considered when estimating resource demands. This paper surveys the state-of-the-art in resource demand estimation and proposes a classification scheme for estimation approaches. Furthermore, it contains an experimental evaluation comparing the impact of different factors (monitoring window size, number of workload classes, load level, collinearity, and model mismatch) on the estimation accuracy of seven different approaches. The classification scheme and the experimental comparison helps performance engineers to select an approach to resource demand estimation that fulfills the requirements of a given analysis scenario.\n
\n','
\n@article{SpCaBrKo2015-PEVA-ResDemEstSurvey,\n  author = {Spinner, Simon and Casale, Giuliano and Brosig, Fabian and Kounev, Samuel},\n  title = {{Evaluating Approaches to Resource Demand Estimation}},\n  journal = {Performance Evaluation},\n  month = {October},\n  year = {2015},\n  volume = {92},\n  number = {},\n  pages = {51 -- 71},\n  issn = {0166-5316},\n  url = {http://www.sciencedirect.com/science/article/pii/S0166531615000711},\n  publisher = {Elsevier B.V.},\n  doi = {10.1016/j.peva.2015.07.005},\n  abstract = {Resource demands are a key parameter of stochastic performance models that needs to be determined when performing a quantitative performance analysis of a system. However, the direct measurement of resource demands is not feasible in most realistic systems. Therefore, statistical approaches that estimate resource demands based on coarse-grained monitoring data (e.g., CPU utilization, and response times) have been proposed in the literature. These approaches have different assumptions and characteristics that need to be considered when estimating resource demands. This paper surveys the state-of-the-art in resource demand estimation and proposes a classification scheme for estimation approaches. Furthermore, it contains an experimental evaluation comparing the impact of different factors (monitoring window size, number of workload classes, load level, collinearity, and model mismatch) on the estimation accuracy of seven different approaches. The classification scheme and the experimental comparison helps performance engineers to select an approach to resource demand estimation that fulfills the requirements of a given analysis scenario.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/890.pdf}\n}\n
\n\n','Resource demands are a key parameter of stochastic performance models that needs to be determined when performing a quantitative performance analysis of a system. However, the direct measurement of resource demands is not feasible in most realistic systems. Therefore, statistical approaches that estimate resource demands based on coarse-grained monitoring data (e.g., CPU utilization, and response times) have been proposed in the literature. These approaches have different assumptions and characteristics that need to be considered when estimating resource demands. This paper surveys the state-of-the-art in resource demand estimation and proposes a classification scheme for estimation approaches. Furthermore, it contains an experimental evaluation comparing the impact of different factors (monitoring window size, number of workload classes, load level, collinearity, and model mismatch) on the estimation accuracy of seven different approaches. The classification scheme and the experimental comparison helps performance engineers to select an approach to resource demand estimation that fulfills the requirements of a given analysis scenario.','{Evaluating Approaches to Resource Demand Estimation}',0,10,2015,10,NULL,NULL,NULL,'2015-07-17 17:42:05','2016-06-01 09:41:06',0),(891,'paper','HuWaBaKo2015-ICCAC-BlueYonder','inproceedings','@inproceedings{HuWaBaKo2015-ICCAC-BlueYonder,\n author = {Nikolaus Huber and J\\\"{u}rgen Walter and Manuel B\\\"{a}hr and Samuel Kounev},\n title = {{Model-based Autonomic and Performance-aware System Adaptation in Heterogeneous Resource Environments: A Case Study}},\n year = {2015},\n month = {September},\n day = {21-24},\n publisher = {IEEE},\n booktitle = {Proceedings of the 2015 IEEE International Conference on Cloud and Autonomic Computing (ICCAC)},\n location = {Cambridge, MA, USA},\n abstract = {Recent trends like cloud computing show that service providers increasingly adopt to modern self-adaptive system architectures promising higher resource efficiency and lower operating costs. Blue Yonder is such a service provider in the field of predictive analytics, looking for novel approaches to automatically adapt their service infrastructure to changing customer workloads and service-level agreements. In this paper, we present a realistic case study in which we apply a holistic modelbased approach to build a self-adaptive system that automatically maintains performance requirements and resource efficiency in the heterogeneous resource environment of Blue Yonder. As modeling formalism, we employ the Descartes Modeling Language (DML), a domain-specific language for modeling the performance behavior and run-time adaptation processes of modern dynamic IT systems. This case study is an exemplar for applying a holistic model-based approach to engineering performance-aware system adaptation. More specifically, the results evaluate the applicability and effectiveness of our approach and demonstrate that DML provides suitable modeling abstractions that can be used as a basis for self-adaptive performance and resource management.},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/891},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/891.pdf},\n}\n\n','\n\nNikolaus Huber, Jürgen Walter, Manuel Bähr, and Samuel Kounev.\nModel-based Autonomic and Performance-aware System Adaptation in\nHeterogeneous Resource Environments: A Case Study.\nIn Proceedings of the 2015 IEEE International Conference on\nCloud and Autonomic Computing (ICCAC), Cambridge, MA, USA, September 21-24,\n2015. IEEE.\nSeptember 2015.\n[ bib | slides | .pdf | Abstract  ] 
\n@inproceedings{HuWaBaKo2015-ICCAC-BlueYonder,\nauthor = {Nikolaus Huber and J\\\"{u}rgen Walter and Manuel B\\\"{a}hr and Samuel Kounev},\ntitle = {{Model-based Autonomic and Performance-aware System Adaptation in Heterogeneous Resource Environments: A Case Study}},\nyear = {2015},\nmonth = {September},\nday = {21-24},\npublisher = {IEEE},\nbooktitle = {Proceedings of the 2015 IEEE International Conference on Cloud and Autonomic Computing (ICCAC)},\nlocation = {Cambridge, MA, USA},\nabstract = {Recent trends like cloud computing show that service providers increasingly adopt to modern self-adaptive system architectures promising higher resource efficiency and lower operating costs. Blue Yonder is such a service provider in the field of predictive analytics, looking for novel approaches to automatically adapt their service infrastructure to changing customer workloads and service-level agreements. In this paper, we present a realistic case study in which we apply a holistic modelbased approach to build a self-adaptive system that automatically maintains performance requirements and resource efficiency in the heterogeneous resource environment of Blue Yonder. As modeling formalism, we employ the Descartes Modeling Language (DML), a domain-specific language for modeling the performance behavior and run-time adaptation processes of modern dynamic IT systems. This case study is an exemplar for applying a holistic model-based approach to engineering performance-aware system adaptation. More specifically, the results evaluate the applicability and effectiveness of our approach and demonstrate that DML provides suitable modeling abstractions that can be used as a basis for self-adaptive performance and resource management.},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/891},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/891.pdf}\n}\n
\n
\nRecent trends like cloud computing show that service providers increasingly adopt to modern self-adaptive system architectures promising higher resource efficiency and lower operating costs. Blue Yonder is such a service provider in the field of predictive analytics, looking for novel approaches to automatically adapt their service infrastructure to changing customer workloads and service-level agreements. In this paper, we present a realistic case study in which we apply a holistic modelbased approach to build a self-adaptive system that automatically maintains performance requirements and resource efficiency in the heterogeneous resource environment of Blue Yonder. As modeling formalism, we employ the Descartes Modeling Language (DML), a domain-specific language for modeling the performance behavior and run-time adaptation processes of modern dynamic IT systems. This case study is an exemplar for applying a holistic model-based approach to engineering performance-aware system adaptation. More specifically, the results evaluate the applicability and effectiveness of our approach and demonstrate that DML provides suitable modeling abstractions that can be used as a basis for self-adaptive performance and resource management.\n
\n','
\n@inproceedings{HuWaBaKo2015-ICCAC-BlueYonder,\n  author = {Nikolaus Huber and J\\\"{u}rgen Walter and Manuel B\\\"{a}hr and Samuel Kounev},\n  title = {{Model-based Autonomic and Performance-aware System Adaptation in Heterogeneous Resource Environments: A Case Study}},\n  year = {2015},\n  month = {September},\n  day = {21-24},\n  publisher = {IEEE},\n  booktitle = {Proceedings of the 2015 IEEE International Conference on Cloud and Autonomic Computing (ICCAC)},\n  location = {Cambridge, MA, USA},\n  abstract = {Recent trends like cloud computing show that service providers increasingly adopt to modern self-adaptive system architectures promising higher resource efficiency and lower operating costs. Blue Yonder is such a service provider in the field of predictive analytics, looking for novel approaches to automatically adapt their service infrastructure to changing customer workloads and service-level agreements. In this paper, we present a realistic case study in which we apply a holistic modelbased approach to build a self-adaptive system that automatically maintains performance requirements and resource efficiency in the heterogeneous resource environment of Blue Yonder. As modeling formalism, we employ the Descartes Modeling Language (DML), a domain-specific language for modeling the performance behavior and run-time adaptation processes of modern dynamic IT systems. This case study is an exemplar for applying a holistic model-based approach to engineering performance-aware system adaptation. More specifically, the results evaluate the applicability and effectiveness of our approach and demonstrate that DML provides suitable modeling abstractions that can be used as a basis for self-adaptive performance and resource management.},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/891},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/891.pdf}\n}\n
\n\n','Recent trends like cloud computing show that service providers increasingly adopt to modern self-adaptive system architectures promising higher resource efficiency and lower operating costs. Blue Yonder is such a service provider in the field of predictive analytics, looking for novel approaches to automatically adapt their service infrastructure to changing customer workloads and service-level agreements. In this paper, we present a realistic case study in which we apply a holistic modelbased approach to build a self-adaptive system that automatically maintains performance requirements and resource efficiency in the heterogeneous resource environment of Blue Yonder. As modeling formalism, we employ the Descartes Modeling Language (DML), a domain-specific language for modeling the performance behavior and run-time adaptation processes of modern dynamic IT systems. This case study is an exemplar for applying a holistic model-based approach to engineering performance-aware system adaptation. More specifically, the results evaluate the applicability and effectiveness of our approach and demonstrate that DML provides suitable modeling abstractions that can be used as a basis for self-adaptive performance and resource management.','{Model-based Autonomic and Performance-aware System Adaptation in Heterogeneous Resource Environments: A Case Study}',0,9,2015,9,NULL,NULL,NULL,'2015-07-22 12:27:08','2016-06-01 09:41:06',0),(892,'paper','SPEC-RG-2015-001-DevOpsPerformanceResearchAgenda','techreport','@techreport{SPEC-RG-2015-001-DevOpsPerformanceResearchAgenda,\n title = {Performance-oriented {DevOps}: {A} Research Agenda},\n author = {Andreas Brunnert and Andre van Hoorn and Felix Willnecker and Alexandru Danciu and Wilhelm Hasselbring and Christoph Heger and Nikolas Herbst and Pooyan Jamshidi and Reiner Jung and Joakim von Kistowski and Anne Koziolek and Johannes Kro{\\ss} and Simon Spinner and Christian V{\\\"o}gele and J{\\\"u}rgen Walter and Alexander Wert},\n institution = {SPEC Research Group --- DevOps Performance Working Group, Standard Performance Evaluation Corporation (SPEC)},\n year = {2015},\n month = {August},\n number = {SPEC-RG-2015-01},\n url = {https://research.spec.org/fileadmin/user_upload/documents/wg_devops/endorsed_publications/SPEC-RG-2015-001-DevOpsPerformanceResearchAgenda.pdf},\n abstract = {DevOps is a trend towards a tighter integration between development (Dev) and operations (Ops) teams. The need for such an integration is driven by the requirement to continuously adapt enterprise applications (EAs) to changes in the business environment. As of today, DevOps concepts have been primarily introduced to ensure a constant flow of features and bug fixes into new releases from a functional perspective. In order to integrate a non-functional perspective into these DevOps concepts this report focuses on tools, activities, and processes to ensure one of the most important quality attributes of a software system, namely performance. Performance describes system properties concerning its timeliness and use of resources. Common metrics are response time, throughput, and resource utilization. Performance goals for EAs are typically defined by setting upper and/or lower bounds for these metrics and specific business transactions. In order to ensure that such performance goals can be met, several activities are required during development and operation of these systems as well as during the transition from Dev to Ops. Activities during development are typically summarized by the term Software Performance Engineering (SPE), whereas activities during operations are called Application Performance Management (APM). SPE and APM were historically tackled independently from each other, but the newly emerging DevOps concepts require and enable a tighter integration between both activity streams. This report presents existing solutions to support this integration as well as open research challenges in this area. The report starts by defining EAs and summarizes their characteristics that make performance evaluations for these systems particularly challenging. It continues by describing our understanding of DevOps and explaining the roots of this trend to set the context for the remaining parts of the report. Afterwards, performance management activities that are common in both life cycle phases are explained, until the particularities of SPE and APM are discussed in separate sections. Finally, the report concludes by outlining activities and challenges to support the rapid iteration between Dev and Ops.},\n}\n\n','\n\nAndreas Brunnert, Andre van Hoorn, Felix Willnecker, Alexandru Danciu, Wilhelm\nHasselbring, Christoph Heger, Nikolas Herbst, Pooyan Jamshidi, Reiner Jung,\nJoakim von Kistowski, Anne Koziolek, Johannes Kroß, Simon Spinner,\nChristian Vögele, Jürgen Walter, and Alexander Wert.\nPerformance-oriented DevOps: A research agenda.\nTechnical Report SPEC-RG-2015-01, SPEC Research Group - DevOps\nPerformance Working Group, Standard Performance Evaluation Corporation\n(SPEC), August 2015.\n[ bib | .pdf | Abstract  ] 
\n@techreport{SPEC-RG-2015-001-DevOpsPerformanceResearchAgenda,\ntitle = {Performance-oriented {DevOps}: {A} Research Agenda},\nauthor = {Andreas Brunnert and Andre van Hoorn and Felix Willnecker and Alexandru Danciu and Wilhelm Hasselbring and Christoph Heger and Nikolas Herbst and Pooyan Jamshidi and Reiner Jung and Joakim von Kistowski and Anne Koziolek and Johannes Kro{\\ss} and Simon Spinner and Christian V{\\\"o}gele and J{\\\"u}rgen Walter and Alexander Wert},\ninstitution = {SPEC Research Group --- DevOps Performance Working Group, Standard Performance Evaluation Corporation (SPEC)},\nyear = {2015},\nmonth = {August},\nnumber = {SPEC-RG-2015-01},\nurl = {https://research.spec.org/fileadmin/user_upload/documents/wg_devops/endorsed_publications/SPEC-RG-2015-001-DevOpsPerformanceResearchAgenda.pdf},\nabstract = {DevOps is a trend towards a tighter integration between development (Dev) and operations (Ops) teams. The need for such an integration is driven by the requirement to continuously adapt enterprise applications (EAs) to changes in the business environment. As of today, DevOps concepts have been primarily introduced to ensure a constant flow of features and bug fixes into new releases from a functional perspective. In order to integrate a non-functional perspective into these DevOps concepts this report focuses on tools, activities, and processes to ensure one of the most important quality attributes of a software system, namely performance. Performance describes system properties concerning its timeliness and use of resources. Common metrics are response time, throughput, and resource utilization. Performance goals for EAs are typically defined by setting upper and/or lower bounds for these metrics and specific business transactions. In order to ensure that such performance goals can be met, several activities are required during development and operation of these systems as well as during the transition from Dev to Ops. Activities during development are typically summarized by the term Software Performance Engineering (SPE), whereas activities during operations are called Application Performance Management (APM). SPE and APM were historically tackled independently from each other, but the newly emerging DevOps concepts require and enable a tighter integration between both activity streams. This report presents existing solutions to support this integration as well as open research challenges in this area. The report starts by defining EAs and summarizes their characteristics that make performance evaluations for these systems particularly challenging. It continues by describing our understanding of DevOps and explaining the roots of this trend to set the context for the remaining parts of the report. Afterwards, performance management activities that are common in both life cycle phases are explained, until the particularities of SPE and APM are discussed in separate sections. Finally, the report concludes by outlining activities and challenges to support the rapid iteration between Dev and Ops.}\n}\n
\n
\nDevOps is a trend towards a tighter integration between development (Dev) and operations (Ops) teams. The need for such an integration is driven by the requirement to continuously adapt enterprise applications (EAs) to changes in the business environment. As of today, DevOps concepts have been primarily introduced to ensure a constant flow of features and bug fixes into new releases from a functional perspective. In order to integrate a non-functional perspective into these DevOps concepts this report focuses on tools, activities, and processes to ensure one of the most important quality attributes of a software system, namely performance. Performance describes system properties concerning its timeliness and use of resources. Common metrics are response time, throughput, and resource utilization. Performance goals for EAs are typically defined by setting upper and/or lower bounds for these metrics and specific business transactions. In order to ensure that such performance goals can be met, several activities are required during development and operation of these systems as well as during the transition from Dev to Ops. Activities during development are typically summarized by the term Software Performance Engineering (SPE), whereas activities during operations are called Application Performance Management (APM). SPE and APM were historically tackled independently from each other, but the newly emerging DevOps concepts require and enable a tighter integration between both activity streams. This report presents existing solutions to support this integration as well as open research challenges in this area. The report starts by defining EAs and summarizes their characteristics that make performance evaluations for these systems particularly challenging. It continues by describing our understanding of DevOps and explaining the roots of this trend to set the context for the remaining parts of the report. Afterwards, performance management activities that are common in both life cycle phases are explained, until the particularities of SPE and APM are discussed in separate sections. Finally, the report concludes by outlining activities and challenges to support the rapid iteration between Dev and Ops.\n
\n','
\n@techreport{SPEC-RG-2015-001-DevOpsPerformanceResearchAgenda,\n  title = {Performance-oriented {DevOps}: {A} Research Agenda},\n  author = {Andreas Brunnert and Andre van Hoorn and Felix Willnecker and Alexandru Danciu and Wilhelm Hasselbring and Christoph Heger and Nikolas Herbst and Pooyan Jamshidi and Reiner Jung and Joakim von Kistowski and Anne Koziolek and Johannes Kro{\\ss} and Simon Spinner and Christian V{\\\"o}gele and J{\\\"u}rgen Walter and Alexander Wert},\n  institution = {SPEC Research Group --- DevOps Performance Working Group, Standard Performance Evaluation Corporation (SPEC)},\n  year = {2015},\n  month = {August},\n  number = {SPEC-RG-2015-01},\n  url = {https://research.spec.org/fileadmin/user_upload/documents/wg_devops/endorsed_publications/SPEC-RG-2015-001-DevOpsPerformanceResearchAgenda.pdf},\n  abstract = {DevOps is a trend towards a tighter integration between development (Dev) and operations (Ops) teams. The need for such an integration is driven by the requirement to continuously adapt enterprise applications (EAs) to changes in the business environment. As of today, DevOps concepts have been primarily introduced to ensure a constant flow of features and bug fixes into new releases from a functional perspective. In order to integrate a non-functional perspective into these DevOps concepts this report focuses on tools, activities, and processes to ensure one of the most important quality attributes of a software system, namely performance. Performance describes system properties concerning its timeliness and use of resources. Common metrics are response time, throughput, and resource utilization. Performance goals for EAs are typically defined by setting upper and/or lower bounds for these metrics and specific business transactions. In order to ensure that such performance goals can be met, several activities are required during development and operation of these systems as well as during the transition from Dev to Ops. Activities during development are typically summarized by the term Software Performance Engineering (SPE), whereas activities during operations are called Application Performance Management (APM). SPE and APM were historically tackled independently from each other, but the newly emerging DevOps concepts require and enable a tighter integration between both activity streams. This report presents existing solutions to support this integration as well as open research challenges in this area. The report starts by defining EAs and summarizes their characteristics that make performance evaluations for these systems particularly challenging. It continues by describing our understanding of DevOps and explaining the roots of this trend to set the context for the remaining parts of the report. Afterwards, performance management activities that are common in both life cycle phases are explained, until the particularities of SPE and APM are discussed in separate sections. Finally, the report concludes by outlining activities and challenges to support the rapid iteration between Dev and Ops.}\n}\n
\n\n','DevOps is a trend towards a tighter integration between development (Dev) and operations (Ops) teams. The need for such an integration is driven by the requirement to continuously adapt enterprise applications (EAs) to changes in the business environment. As of today, DevOps concepts have been primarily introduced to ensure a constant flow of features and bug fixes into new releases from a functional perspective. In order to integrate a non-functional perspective into these DevOps concepts this report focuses on tools, activities, and processes to ensure one of the most important quality attributes of a software system, namely performance. Performance describes system properties concerning its timeliness and use of resources. Common metrics are response time, throughput, and resource utilization. Performance goals for EAs are typically defined by setting upper and/or lower bounds for these metrics and specific business transactions. In order to ensure that such performance goals can be met, several activities are required during development and operation of these systems as well as during the transition from Dev to Ops. Activities during development are typically summarized by the term Software Performance Engineering (SPE), whereas activities during operations are called Application Performance Management (APM). SPE and APM were historically tackled independently from each other, but the newly emerging DevOps concepts require and enable a tighter integration between both activity streams. This report presents existing solutions to support this integration as well as open research challenges in this area. The report starts by defining EAs and summarizes their characteristics that make performance evaluations for these systems particularly challenging. It continues by describing our understanding of DevOps and explaining the roots of this trend to set the context for the remaining parts of the report. Afterwards, performance management activities that are common in both life cycle phases are explained, until the particularities of SPE and APM are discussed in separate sections. Finally, the report concludes by outlining activities and challenges to support the rapid iteration between Dev and Ops.','Performance-oriented {DevOps}: {A} Research Agenda',0,8,2015,8,NULL,NULL,NULL,'2015-08-14 11:10:07','2016-06-01 09:41:06',0),(893,'paper','MiPaAnViKoAvLu2015-RAID-Challenges','inproceedings','@inproceedings{MiPaAnViKoAvLu2015-RAID-Challenges,\n author = {Aleksandar Milenkoski and Bryan D. Payne and Nuno Antunes and Marco Vieira and Samuel Kounev and Alberto Avritzer and Matthias Luft},\n booktitle = {The 18th International Symposium on Research in Attacks, Intrusions, and Defenses (RAID 2015)},\n publisher = {{Springer}},\n location = {Kyoto, Japan},\n title = {{Evaluation of Intrusion Detection Systems in Virtualized Environments Using Attack Injection}},\n year = {2015},\n month = {{November}},\n url = {http://link.springer.com/chapter/10.1007/978-3-319-26362-5_22},\n abstract = {{The evaluation of intrusion detection systems (IDSes) is an active research area with many open challenges, one of which is the generation of representative workloads that contain attacks. In this paper, we propose a novel approach for the rigorous evaluation of IDSes in virtualized environments, with a focus on IDSes designed to detect attacks leveraging or targeting the hypervisor via its hypercall interface. We present hInjector, a tool for generating IDS evaluation workloads by injecting such attacks during regular operation of a virtualized environment. We demonstrate the application of our approach and show its practical usefulness by evaluating a representative IDS designed to operate in virtualized environments. The virtualized environment of the industry-standard benchmark SPECvirt_sc2013 is used as a testbed, whose drivers generate workloads representative of workloads seen in production environments. This work enables for the first time the injection of attacks in virtualized environments for the purpose of generating representative IDS evaluation workloads.}},\n note = {{Acceptance Rate: 23%.}},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/893.pdf},\n}\n\n','\n\nAleksandar Milenkoski, Bryan D. Payne, Nuno Antunes, Marco Vieira, Samuel\nKounev, Alberto Avritzer, and Matthias Luft.\nEvaluation of Intrusion Detection Systems in Virtualized\nEnvironments Using Attack Injection.\nIn The 18th International Symposium on Research in Attacks,\nIntrusions, and Defenses (RAID 2015), Kyoto, Japan, November 2015.\nSpringer.\nNovember 2015, Acceptance Rate: 23%.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{MiPaAnViKoAvLu2015-RAID-Challenges,\nauthor = {Aleksandar Milenkoski and Bryan D. Payne and Nuno Antunes and Marco Vieira and Samuel Kounev and Alberto Avritzer and Matthias Luft},\nbooktitle = {The 18th International Symposium on Research in Attacks, Intrusions, and Defenses (RAID 2015)},\npublisher = {{Springer}},\nlocation = {Kyoto, Japan},\ntitle = {{Evaluation of Intrusion Detection Systems in Virtualized Environments Using Attack Injection}},\nyear = {2015},\nmonth = {{November}},\nurl = {http://link.springer.com/chapter/10.1007/978-3-319-26362-5_22},\nabstract = {{The evaluation of intrusion detection systems (IDSes) is an active research area with many open challenges, one of which is the generation of representative workloads that contain attacks. In this paper, we propose a novel approach for the rigorous evaluation of IDSes in virtualized environments, with a focus on IDSes designed to detect attacks leveraging or targeting the hypervisor via its hypercall interface. We present hInjector, a tool for generating IDS evaluation workloads by injecting such attacks during regular operation of a virtualized environment. We demonstrate the application of our approach and show its practical usefulness by evaluating a representative IDS designed to operate in virtualized environments. The virtualized environment of the industry-standard benchmark SPECvirt_sc2013 is used as a testbed, whose drivers generate workloads representative of workloads seen in production environments. This work enables for the first time the injection of attacks in virtualized environments for the purpose of generating representative IDS evaluation workloads.}},\nnote = {{Acceptance Rate: 23%.}},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/893.pdf}\n}\n
\n
\nThe evaluation of intrusion detection systems (IDSes) is an active research area with many open challenges, one of which is the generation of representative workloads that contain attacks. In this paper, we propose a novel approach for the rigorous evaluation of IDSes in virtualized environments, with a focus on IDSes designed to detect attacks leveraging or targeting the hypervisor via its hypercall interface. We present hInjector, a tool for generating IDS evaluation workloads by injecting such attacks during regular operation of a virtualized environment. We demonstrate the application of our approach and show its practical usefulness by evaluating a representative IDS designed to operate in virtualized environments. The virtualized environment of the industry-standard benchmark SPECvirt_sc2013 is used as a testbed, whose drivers generate workloads representative of workloads seen in production environments. This work enables for the first time the injection of attacks in virtualized environments for the purpose of generating representative IDS evaluation workloads.\n
\n','
\n@inproceedings{MiPaAnViKoAvLu2015-RAID-Challenges,\n  author = {Aleksandar Milenkoski and Bryan D. Payne and Nuno Antunes and Marco Vieira and Samuel Kounev and Alberto Avritzer and Matthias Luft},\n  booktitle = {The 18th International Symposium on Research in Attacks, Intrusions, and Defenses (RAID 2015)},\n  publisher = {{Springer}},\n  location = {Kyoto, Japan},\n  title = {{Evaluation of Intrusion Detection Systems in Virtualized Environments Using Attack Injection}},\n  year = {2015},\n  month = {{November}},\n  url = {http://link.springer.com/chapter/10.1007/978-3-319-26362-5_22},\n  abstract = {{The evaluation of intrusion detection systems (IDSes) is an active research area with many open challenges, one of which is the generation of representative workloads that contain attacks. In this paper, we propose a novel approach for the rigorous evaluation of IDSes in virtualized environments, with a focus on IDSes designed to detect attacks leveraging or targeting the hypervisor via its hypercall interface. We present hInjector, a tool for generating IDS evaluation workloads by injecting such attacks during regular operation of a virtualized environment. We demonstrate the application of our approach and show its practical usefulness by evaluating a representative IDS designed to operate in virtualized environments. The virtualized environment of the industry-standard benchmark SPECvirt_sc2013 is used as a testbed, whose drivers generate workloads representative of workloads seen in production environments. This work enables for the first time the injection of attacks in virtualized environments for the purpose of generating representative IDS evaluation workloads.}},\n  note = {{Acceptance Rate: 23%.}},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/893.pdf}\n}\n
\n\n','{The evaluation of intrusion detection systems (IDSes) is an active research area with many open challenges, one of which is the generation of representative workloads that contain attacks. In this paper, we propose a novel approach for the rigorous evaluation of IDSes in virtualized environments, with a focus on IDSes designed to detect attacks leveraging or targeting the hypervisor via its hypercall interface. We present hInjector, a tool for generating IDS evaluation workloads by injecting such attacks during regular operation of a virtualized environment. We demonstrate the application of our approach and show its practical usefulness by evaluating a representative IDS designed to operate in virtualized environments. The virtualized environment of the industry-standard benchmark SPECvirt_sc2013 is used as a testbed, whose drivers generate workloads representative of workloads seen in production environments. This work enables for the first time the injection of attacks in virtualized environments for the purpose of generating representative IDS evaluation workloads.}','{Evaluation of Intrusion Detection Systems in Virtualized Environments Using Attack Injection}',0,11,2015,11,NULL,NULL,NULL,'2015-08-15 11:09:29','2016-06-01 09:41:06',0),(894,'paper','Krebs2015-phd','phdthesis','@phdthesis{Krebs2015-phd,\n author = {Rouven Krebs},\n title = {Performance Isolation in Multi-Tenant Applications},\n year = {2015},\n month = {August},\n school = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/894.pdf},\n}\n\n','\n\nRouven Krebs.\nPerformance Isolation in Multi-Tenant Applications.\nPhD thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, August 2015.\n[ bib | .pdf  ] 
\n@phdthesis{Krebs2015-phd,\nauthor = {Rouven Krebs},\ntitle = {Performance Isolation in Multi-Tenant Applications},\nyear = {2015},\nmonth = {August},\nschool = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/894.pdf}\n}\n
\n
\n','
\n@phdthesis{Krebs2015-phd,\n  author = {Rouven Krebs},\n  title = {Performance Isolation in Multi-Tenant Applications},\n  year = {2015},\n  month = {August},\n  school = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/894.pdf}\n}\n
\n\n',NULL,'Performance Isolation in Multi-Tenant Applications',0,8,2015,8,NULL,NULL,NULL,'2015-10-08 08:22:19','2016-06-01 09:41:06',0),(895,'paper','Noorshams2015-phd','phdthesis','@phdthesis{Noorshams2015-phd,\n author = {Qais Noorshams},\n title = {Modeling and Prediction of I/O Performance in Virtualized Environments},\n year = {2015},\n month = {February},\n url = {http://primo.bibliothek.kit.edu/primo_library/libweb/action/dlDisplay.do?vid=KIT&docId=KITSRCE1000046750&tab=kit_evastar&srt=date},\n school = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/895.pdf},\n}\n\n','\n\nQais Noorshams.\nModeling and Prediction of I/O Performance in Virtualized\nEnvironments.\nPhD thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, February 2015.\n[ bib | http | .pdf  ] 
\n@phdthesis{Noorshams2015-phd,\nauthor = {Qais Noorshams},\ntitle = {Modeling and Prediction of I/O Performance in Virtualized Environments},\nyear = {2015},\nmonth = {February},\nurl = {http://primo.bibliothek.kit.edu/primo_library/libweb/action/dlDisplay.do?vid=KIT&docId=KITSRCE1000046750&tab=kit_evastar&srt=date},\nschool = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/895.pdf}\n}\n
\n
\n','
\n@phdthesis{Noorshams2015-phd,\n  author = {Qais Noorshams},\n  title = {Modeling and Prediction of I/O Performance in Virtualized Environments},\n  year = {2015},\n  month = {February},\n  url = {http://primo.bibliothek.kit.edu/primo_library/libweb/action/dlDisplay.do?vid=KIT&docId=KITSRCE1000046750&tab=kit_evastar&srt=date},\n  school = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/895.pdf}\n}\n
\n\n',NULL,'Modeling and Prediction of I/O Performance in Virtualized Environments',0,2,2015,2,NULL,NULL,NULL,'2015-10-08 08:27:43','2016-06-01 09:41:06',0),(896,'paper','busch2013','mastersthesis','@mastersthesis{busch2013,\n address = {Karlsruhe, Germany},\n author = {Axel Busch},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Workload Characterization for I/O Performance Analysis on IBM System z}},\n year = {2013},\n}\n\n','\n\nAxel Busch.\nWorkload Characterization for I/O Performance Analysis on IBM System\nz.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, 2013.\n[ bib  ] 
\n@mastersthesis{busch2013,\naddress = {Karlsruhe, Germany},\nauthor = {Axel Busch},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Workload Characterization for I/O Performance Analysis on IBM System z}},\nyear = {2013}\n}\n
\n
\n','
\n@mastersthesis{busch2013,\n  address = {Karlsruhe, Germany},\n  author = {Axel Busch},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Workload Characterization for I/O Performance Analysis on IBM System z}},\n  year = {2013}\n}\n
\n\n',NULL,'{Workload Characterization for I/O Performance Analysis on IBM System z}',0,0,2013,0,NULL,NULL,NULL,'2015-10-08 08:46:40','2016-06-01 09:41:06',0),(897,'paper','rostami2013','mastersthesis','@mastersthesis{rostami2013,\n address = {Karlsruhe, Germany},\n author = {Kiana Rostami},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Performance-Vorhersage von virtualisiertem Storage mit Warteschlangennetzen}},\n year = {2013},\n}\n\n','\n\nKiana Rostami.\nPerformance-Vorhersage von virtualisiertem Storage mit\nWarteschlangennetzen.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, 2013.\n[ bib  ] 
\n@mastersthesis{rostami2013,\naddress = {Karlsruhe, Germany},\nauthor = {Kiana Rostami},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Performance-Vorhersage von virtualisiertem Storage mit Warteschlangennetzen}},\nyear = {2013}\n}\n
\n
\n','
\n@mastersthesis{rostami2013,\n  address = {Karlsruhe, Germany},\n  author = {Kiana Rostami},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Performance-Vorhersage von virtualisiertem Storage mit Warteschlangennetzen}},\n  year = {2013}\n}\n
\n\n',NULL,'{Performance-Vorhersage von virtualisiertem Storage mit Warteschlangennetzen}',0,0,2013,0,NULL,NULL,NULL,'2015-10-08 08:47:13','2016-06-01 09:41:06',0),(898,'paper','bruhn2012','mastersthesis','@mastersthesis{bruhn2012,\n address = {Karlsruhe, Germany},\n author = {Dominik Bruhn},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Modeling and Experimental Analysis of Virtualized Storage Performance using IBM System Z as Example}},\n year = {2012},\n}\n\n','\n\nDominik Bruhn.\nModeling and Experimental Analysis of Virtualized Storage\nPerformance using IBM System Z as Example.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, 2012.\n[ bib  ] 
\n@mastersthesis{bruhn2012,\naddress = {Karlsruhe, Germany},\nauthor = {Dominik Bruhn},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Modeling and Experimental Analysis of Virtualized Storage Performance using IBM System Z as Example}},\nyear = {2012}\n}\n
\n
\n','
\n@mastersthesis{bruhn2012,\n  address = {Karlsruhe, Germany},\n  author = {Dominik Bruhn},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Modeling and Experimental Analysis of Virtualized Storage Performance using IBM System Z as Example}},\n  year = {2012}\n}\n
\n\n',NULL,'{Modeling and Experimental Analysis of Virtualized Storage Performance using IBM System Z as Example}',0,0,2012,0,NULL,NULL,NULL,'2015-10-08 08:48:00','2016-06-01 09:41:06',0),(899,'paper','becker2012ma','mastersthesis','@mastersthesis{becker2012ma,\n address = {Karlsruhe, Germany},\n author = {Stefan Becker},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Performance-Modellierung des 1&1 Mail-Systems}},\n year = {2011},\n}\n\n','\n\nStefan Becker.\nPerformance-Modellierung des 1&1 Mail-Systems.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, 2011.\n[ bib  ] 
\n@mastersthesis{becker2012ma,\naddress = {Karlsruhe, Germany},\nauthor = {Stefan Becker},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Performance-Modellierung des 1&1 Mail-Systems}},\nyear = {2011}\n}\n
\n
\n','
\n@mastersthesis{becker2012ma,\n  address = {Karlsruhe, Germany},\n  author = {Stefan Becker},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Performance-Modellierung des 1&1 Mail-Systems}},\n  year = {2011}\n}\n
\n\n',NULL,'{Performance-Modellierung des 1&1 Mail-Systems}',0,0,2011,0,NULL,NULL,NULL,'2015-10-08 08:48:42','2016-06-01 09:41:06',0),(900,'paper','Kusnady2011','mastersthesis','@mastersthesis{Kusnady2011,\n author = {Enrico Kusnady},\n address = {Karlsruhe, Germany},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{QoS-aware Resource Allocation in Virtualized Environments}},\n year = {2011},\n}\n\n','\n\nEnrico Kusnady.\nQoS-aware Resource Allocation in Virtualized Environments.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, 2011.\n[ bib  ] 
\n@mastersthesis{Kusnady2011,\nauthor = {Enrico Kusnady},\naddress = {Karlsruhe, Germany},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{QoS-aware Resource Allocation in Virtualized Environments}},\nyear = {2011}\n}\n
\n
\n','
\n@mastersthesis{Kusnady2011,\n  author = {Enrico Kusnady},\n  address = {Karlsruhe, Germany},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{QoS-aware Resource Allocation in Virtualized Environments}},\n  year = {2011}\n}\n
\n\n',NULL,'{QoS-aware Resource Allocation in Virtualized Environments}',0,0,2011,0,NULL,NULL,NULL,'2015-10-08 08:49:14','2016-06-01 09:41:06',0),(901,'paper','Matershev2010','mastersthesis','@mastersthesis{Matershev2010,\n author = {Evgeny Matershev},\n address = {Karlsruhe, Germany},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Comparison of selected SOA middleware platforms focusing on provided facilities for online monitoring, instrumentation and dynamic reconfiguration}},\n year = {2010},\n type = {{Bachelor Thesis}},\n}\n\n','\n\nEvgeny Matershev.\nComparison of selected SOA middleware platforms focusing on provided\nfacilities for online monitoring, instrumentation and dynamic\nreconfiguration.\nBachelor Thesis, Karlsruhe Institute of Technology (KIT),\nKarlsruhe, Germany, 2010.\n[ bib  ] 
\n@mastersthesis{Matershev2010,\nauthor = {Evgeny Matershev},\naddress = {Karlsruhe, Germany},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Comparison of selected SOA middleware platforms focusing on provided facilities for online monitoring, instrumentation and dynamic reconfiguration}},\nyear = {2010},\ntype = {{Bachelor Thesis}}\n}\n
\n
\n','
\n@mastersthesis{Matershev2010,\n  author = {Evgeny Matershev},\n  address = {Karlsruhe, Germany},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Comparison of selected SOA middleware platforms focusing on provided facilities for online monitoring, instrumentation and dynamic reconfiguration}},\n  year = {2010},\n  type = {{Bachelor Thesis}}\n}\n
\n\n',NULL,'{Comparison of selected SOA middleware platforms focusing on provided facilities for online monitoring, instrumentation and dynamic reconfiguration}',0,0,2010,0,NULL,NULL,NULL,'2015-10-08 08:50:49','2016-06-01 09:41:06',0),(902,'paper','Quast2010','mastersthesis','@mastersthesis{Quast2010,\n author = {Marcel von Quast},\n address = {Karlsruhe, Germany},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Automatisierte Performance-Analyse von Virtualisierungsplattformen}},\n year = {2010},\n}\n\n','\n\nMarcel von Quast.\nAutomatisierte Performance-Analyse von Virtualisierungsplattformen.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, 2010.\n[ bib  ] 
\n@mastersthesis{Quast2010,\nauthor = {Marcel von Quast},\naddress = {Karlsruhe, Germany},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Automatisierte Performance-Analyse von Virtualisierungsplattformen}},\nyear = {2010}\n}\n
\n
\n','
\n@mastersthesis{Quast2010,\n  author = {Marcel von Quast},\n  address = {Karlsruhe, Germany},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Automatisierte Performance-Analyse von Virtualisierungsplattformen}},\n  year = {2010}\n}\n
\n\n',NULL,'{Automatisierte Performance-Analyse von Virtualisierungsplattformen}',0,0,2010,0,NULL,NULL,NULL,'2015-10-08 08:51:33','2016-06-01 09:41:06',0),(903,'paper','Zipp2009','mastersthesis','@mastersthesis{Zipp2009,\n author = {Frederik Zipp},\n address = {Karlsruhe, Germany},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Querying, Aggregating and Visualizing QPN Model Analysis Data}},\n year = {2009},\n type = {{Study Thesis}},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/903.pdf},\n}\n\n','\n\nFrederik Zipp.\nQuerying, Aggregating and Visualizing QPN Model Analysis Data.\nStudy Thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, 2009.\n[ bib | .pdf  ] 
\n@mastersthesis{Zipp2009,\nauthor = {Frederik Zipp},\naddress = {Karlsruhe, Germany},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Querying, Aggregating and Visualizing QPN Model Analysis Data}},\nyear = {2009},\ntype = {{Study Thesis}},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/903.pdf}\n}\n
\n
\n','
\n@mastersthesis{Zipp2009,\n  author = {Frederik Zipp},\n  address = {Karlsruhe, Germany},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Querying, Aggregating and Visualizing QPN Model Analysis Data}},\n  year = {2009},\n  type = {{Study Thesis}},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/903.pdf}\n}\n
\n\n',NULL,'{Querying, Aggregating and Visualizing QPN Model Analysis Data}',0,0,2009,0,NULL,NULL,NULL,'2015-10-08 08:52:26','2016-06-01 09:41:06',0),(904,'paper','Klatt2010','mastersthesis','@mastersthesis{Klatt2010,\n author = {Benjamin Klatt},\n address = {Karlsruhe, Germany},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Modelling and prediction of event-based communication in component-based architectures}},\n year = {2010},\n note = {{ObjektForum Thesis Award}},\n}\n\n','\n\nBenjamin Klatt.\nModelling and prediction of event-based communication in\ncomponent-based architectures.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, 2010.\nObjektForum Thesis Award.\n[ bib  ] 
\n@mastersthesis{Klatt2010,\nauthor = {Benjamin Klatt},\naddress = {Karlsruhe, Germany},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Modelling and prediction of event-based communication in component-based architectures}},\nyear = {2010},\nnote = {{ObjektForum Thesis Award}}\n}\n
\n
\n','
\n@mastersthesis{Klatt2010,\n  author = {Benjamin Klatt},\n  address = {Karlsruhe, Germany},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Modelling and prediction of event-based communication in component-based architectures}},\n  year = {2010},\n  note = {{ObjektForum Thesis Award}}\n}\n
\n\n',NULL,'{Modelling and prediction of event-based communication in component-based architectures}',0,0,2010,0,NULL,NULL,NULL,'2015-10-08 08:53:25','2016-06-01 09:41:06',0),(905,'paper','WaEiHi2015-SPP-DML2PCM','inproceedings','@inproceedings{WaEiHi2015-SPP-DML2PCM,\n author = {J\\\"{u}rgen Walter and Simon Eismann and Adrian Hildebrandt},\n title = {{Automated Transformation of Descartes Modeling Language to Palladio Component Model}},\n year = {2015},\n month = {November},\n day = {6},\n booktitle = {Proceedings of the 2015 Symposium on Software Performance (SSP)},\n location = {Munich, Germany},\n abstract = {Model-based performance predictions and reconfigurations enable optimizing resource efficiency while ensuring that Quality-of-Service demands are met in today\'s complex ITsystems. The Descartes Modeling Language (DML) and the Palladio Component Model (PCM) are two architectural performance modeling formalisms applied in this context. This paper compares DML to PCM concerning similarities, differences and semantic gaps. Based on this, we propose a mapping from DML to PCM for which we implemented a tool realizing an automated transformation.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/905.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/905},\n}\n\n','\n\nJürgen Walter, Simon Eismann, and Adrian Hildebrandt.\nAutomated Transformation of Descartes Modeling Language to Palladio\nComponent Model.\nIn Proceedings of the 2015 Symposium on Software Performance\n(SSP), Munich, Germany, November 6, 2015.\n[ bib | slides | .pdf | Abstract  ] 
\n@inproceedings{WaEiHi2015-SPP-DML2PCM,\nauthor = {J\\\"{u}rgen Walter and Simon Eismann and Adrian Hildebrandt},\ntitle = {{Automated Transformation of Descartes Modeling Language to Palladio Component Model}},\nyear = {2015},\nmonth = {November},\nday = {6},\nbooktitle = {Proceedings of the 2015 Symposium on Software Performance (SSP)},\nlocation = {Munich, Germany},\nabstract = {Model-based performance predictions and reconfigurations enable optimizing resource efficiency while ensuring that Quality-of-Service demands are met in today\'s complex ITsystems. The Descartes Modeling Language (DML) and the Palladio Component Model (PCM) are two architectural performance modeling formalisms applied in this context. This paper compares DML to PCM concerning similarities, differences and semantic gaps. Based on this, we propose a mapping from DML to PCM for which we implemented a tool realizing an automated transformation.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/905.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/905}\n}\n
\n
\nModel-based performance predictions and reconfigurations enable optimizing resource efficiency while ensuring that Quality-of-Service demands are met in today\'s complex ITsystems. The Descartes Modeling Language (DML) and the Palladio Component Model (PCM) are two architectural performance modeling formalisms applied in this context. This paper compares DML to PCM concerning similarities, differences and semantic gaps. Based on this, we propose a mapping from DML to PCM for which we implemented a tool realizing an automated transformation.\n
\n','
\n@inproceedings{WaEiHi2015-SPP-DML2PCM,\n  author = {J\\\"{u}rgen Walter and Simon Eismann and Adrian Hildebrandt},\n  title = {{Automated Transformation of Descartes Modeling Language to Palladio Component Model}},\n  year = {2015},\n  month = {November},\n  day = {6},\n  booktitle = {Proceedings of the 2015 Symposium on Software Performance (SSP)},\n  location = {Munich, Germany},\n  abstract = {Model-based performance predictions and reconfigurations enable optimizing resource efficiency while ensuring that Quality-of-Service demands are met in today\'s complex ITsystems. The Descartes Modeling Language (DML) and the Palladio Component Model (PCM) are two architectural performance modeling formalisms applied in this context. This paper compares DML to PCM concerning similarities, differences and semantic gaps. Based on this, we propose a mapping from DML to PCM for which we implemented a tool realizing an automated transformation.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/905.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/905}\n}\n
\n\n','Model-based performance predictions and reconfigurations enable optimizing resource efficiency while ensuring that Quality-of-Service demands are met in today\'s complex ITsystems. The Descartes Modeling Language (DML) and the Palladio Component Model (PCM) are two architectural performance modeling formalisms applied in this context. This paper compares DML to PCM concerning similarities, differences and semantic gaps. Based on this, we propose a mapping from DML to PCM for which we implemented a tool realizing an automated transformation.','{Automated Transformation of Descartes Modeling Language to Palladio Component Model}',0,11,2015,11,NULL,NULL,NULL,'2015-10-12 07:21:08','2016-06-01 09:41:06',0),(906,'paper','KiKo2015-VALUETOOLS','inproceedings','@inproceedings{KiKo2015-VALUETOOLS,\n author = {J\\\'{o}akim von Kistowski and Samuel Kounev},\n abstract = {{Performance and power scale non-linearly with device utilization, making characterization and prediction of energy efficiency at a given load level a challenging issue. A common approach to address this problem is the creation of power or performance state tables for a pre-measured subset of all possible system states. Approaches to determine performance and power for a state not included in the measured subset use simple interpolation, such as nearest neighbor interpolation, or define state switching rules. This leads to a loss in accuracy, as unmeasured system states are not considered. In this paper, we compare different interpolation functions and automatically configure and select functions for a given domain or measurement set. We evaluate our approach by comparing interpolation of measurement data subsets against power and performance measurements on a commodity server. We show that for non-extrapolating models interpolation is significantly more accurate than regression, with our automatically configured interpolation function improving modeling accuracy up to 43.6\\%.}},\n title = {{Univariate Interpolation-based Modeling of Power and Performance}},\n year = {2015},\n booktitle = {Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2015)},\n location = {Berlin, Germany},\n month = {December},\n day = {14--16},\n keywords = {Interpolation, Energy Efficiency, Power, Performance, Interpolation, Utilization, SERT},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/906},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/906.pdf},\n doi = {http://dx.doi.org/10.4108/eai.14-12-2015.2262579},\n}\n\n','\n\nJóakim von Kistowski and Samuel Kounev.\nUnivariate Interpolation-based Modeling of Power and Performance.\nIn Proceedings of the 9th EAI International Conference on\nPerformance Evaluation Methodologies and Tools (VALUETOOLS 2015), Berlin,\nGermany, December 14-16, 2015.\n[ bib | DOI | slides | .pdf | Abstract  ] 
\n@inproceedings{KiKo2015-VALUETOOLS,\nauthor = {J\\\'{o}akim von Kistowski and Samuel Kounev},\nabstract = {{Performance and power scale non-linearly with device utilization, making characterization and prediction of energy efficiency at a given load level a challenging issue. A common approach to address this problem is the creation of power or performance state tables for a pre-measured subset of all possible system states. Approaches to determine performance and power for a state not included in the measured subset use simple interpolation, such as nearest neighbor interpolation, or define state switching rules. This leads to a loss in accuracy, as unmeasured system states are not considered. In this paper, we compare different interpolation functions and automatically configure and select functions for a given domain or measurement set. We evaluate our approach by comparing interpolation of measurement data subsets against power and performance measurements on a commodity server. We show that for non-extrapolating models interpolation is significantly more accurate than regression, with our automatically configured interpolation function improving modeling accuracy up to 43.6\\%.}},\ntitle = {{Univariate Interpolation-based Modeling of Power and Performance}},\nyear = {2015},\nbooktitle = {Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2015)},\nlocation = {Berlin, Germany},\nmonth = {December},\nday = {14--16},\nkeywords = {Interpolation, Energy Efficiency, Power, Performance, Interpolation, Utilization, SERT},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/906},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/906.pdf},\ndoi = {http://dx.doi.org/10.4108/eai.14-12-2015.2262579}\n}\n
\n
\nPerformance and power scale non-linearly with device utilization, making characterization and prediction of energy efficiency at a given load level a challenging issue. A common approach to address this problem is the creation of power or performance state tables for a pre-measured subset of all possible system states. Approaches to determine performance and power for a state not included in the measured subset use simple interpolation, such as nearest neighbor interpolation, or define state switching rules. This leads to a loss in accuracy, as unmeasured system states are not considered. In this paper, we compare different interpolation functions and automatically configure and select functions for a given domain or measurement set. We evaluate our approach by comparing interpolation of measurement data subsets against power and performance measurements on a commodity server. We show that for non-extrapolating models interpolation is significantly more accurate than regression, with our automatically configured interpolation function improving modeling accuracy up to 43.6%.\n
\n','
\n@inproceedings{KiKo2015-VALUETOOLS,\n  author = {J\\\'{o}akim von Kistowski and Samuel Kounev},\n  abstract = {{Performance and power scale non-linearly with device utilization, making characterization and prediction of energy efficiency at a given load level a challenging issue. A common approach to address this problem is the creation of power or performance state tables for a pre-measured subset of all possible system states. Approaches to determine performance and power for a state not included in the measured subset use simple interpolation, such as nearest neighbor interpolation, or define state switching rules. This leads to a loss in accuracy, as unmeasured system states are not considered. In this paper, we compare different interpolation functions and automatically configure and select functions for a given domain or measurement set. We evaluate our approach by comparing interpolation of measurement data subsets against power and performance measurements on a commodity server. We show that for non-extrapolating models interpolation is significantly more accurate than regression, with our automatically configured interpolation function improving modeling accuracy up to 43.6\\%.}},\n  title = {{Univariate Interpolation-based Modeling of Power and Performance}},\n  year = {2015},\n  booktitle = {Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2015)},\n  location = {Berlin, Germany},\n  month = {December},\n  day = {14--16},\n  keywords = {Interpolation, Energy Efficiency, Power, Performance, Interpolation, Utilization, SERT},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/906},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/906.pdf},\n  doi = {http://dx.doi.org/10.4108/eai.14-12-2015.2262579}\n}\n
\n\n','{Performance and power scale non-linearly with device utilization, making characterization and prediction of energy efficiency at a given load level a challenging issue. A common approach to address this problem is the creation of power or performance state tables for a pre-measured subset of all possible system states. Approaches to determine performance and power for a state not included in the measured subset use simple interpolation, such as nearest neighbor interpolation, or define state switching rules. This leads to a loss in accuracy, as unmeasured system states are not considered. In this paper, we compare different interpolation functions and automatically configure and select functions for a given domain or measurement set. We evaluate our approach by comparing interpolation of measurement data subsets against power and performance measurements on a commodity server. We show that for non-extrapolating models interpolation is significantly more accurate than regression, with our automatically configured interpolation function improving modeling accuracy up to 43.6\\%.}','{Univariate Interpolation-based Modeling of Power and Performance}',0,12,2015,12,NULL,NULL,NULL,'2015-11-03 10:31:17','2016-06-01 09:41:06',0),(907,'talk','talk-Kistowski-SSP15','misc','@misc{talk-Kistowski-SSP15,\n author = {J\\\'{o}akim von Kistowski},\n title = {{Common Errors and Assumptions in Energy Measurement and Management}},\n howpublished = {Technical Talk at Symposium on Software Performance (SSP) 2015},\n days = {5--6},\n month = {November},\n year = {2015},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/907},\n}\n\n','\n\nJóakim von Kistowski.\nCommon Errors and Assumptions in Energy Measurement and Management.\nTechnical Talk at Symposium on Software Performance (SSP) 2015,\nNovember 2015.\n[ bib | slides  ] 
\n@misc{talk-Kistowski-SSP15,\nauthor = {J\\\'{o}akim von Kistowski},\ntitle = {{Common Errors and Assumptions in Energy Measurement and Management}},\nhowpublished = {Technical Talk at Symposium on Software Performance (SSP) 2015},\ndays = {5--6},\nmonth = {November},\nyear = {2015},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/907}\n}\n
\n
\n','
\n@misc{talk-Kistowski-SSP15,\n  author = {J\\\'{o}akim von Kistowski},\n  title = {{Common Errors and Assumptions in Energy Measurement and Management}},\n  howpublished = {Technical Talk at Symposium on Software Performance (SSP) 2015},\n  days = {5--6},\n  month = {November},\n  year = {2015},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/907}\n}\n
\n\n',NULL,'{Common Errors and Assumptions in Energy Measurement and Management}',0,11,2015,11,NULL,NULL,NULL,'2015-11-04 08:27:06','2016-06-01 09:41:06',0),(908,'talk','talk-Kistowski-SPECRG2014','misc','@misc{talk-Kistowski-SPECRG2014,\n author = {J\\\'{o}akim von Kistowski},\n title = {{LIMBO - A Load Intensity Modeling Platform}},\n howpublished = {Talk at SPEC RG Annual Meeting 2014},\n location = {Dublin, Ireland},\n days = {26},\n month = {March},\n year = {2014},\n}\n\n','\n\nJóakim von Kistowski.\nLIMBO - A Load Intensity Modeling Platform.\nTalk at SPEC RG Annual Meeting 2014, March 2014.\n[ bib  ] 
\n@misc{talk-Kistowski-SPECRG2014,\nauthor = {J\\\'{o}akim von Kistowski},\ntitle = {{LIMBO - A Load Intensity Modeling Platform}},\nhowpublished = {Talk at SPEC RG Annual Meeting 2014},\nlocation = {Dublin, Ireland},\ndays = {26},\nmonth = {March},\nyear = {2014}\n}\n
\n
\n','
\n@misc{talk-Kistowski-SPECRG2014,\n  author = {J\\\'{o}akim von Kistowski},\n  title = {{LIMBO - A Load Intensity Modeling Platform}},\n  howpublished = {Talk at SPEC RG Annual Meeting 2014},\n  location = {Dublin, Ireland},\n  days = {26},\n  month = {March},\n  year = {2014}\n}\n
\n\n',NULL,'{LIMBO - A Load Intensity Modeling Platform}',0,3,2014,3,NULL,NULL,NULL,'2015-11-04 10:07:43','2016-06-01 09:41:06',0),(909,'talk','talk-Spinner-SSP15','misc','@misc{talk-Spinner-SSP15,\n author = {Simon Spinner},\n title = {{Resource Demand Estimation in Distributed, Service-Oriented Applications using LibReDE}},\n howpublished = {Technical Talk at Symposion on Software Performance (SSP) 2015},\n days = {5},\n month = {November},\n year = {2015},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/909},\n}\n\n','\n\nSimon Spinner.\nResource Demand Estimation in Distributed, Service-Oriented\nApplications using LibReDE.\nTechnical Talk at Symposion on Software Performance (SSP) 2015,\nNovember 2015.\n[ bib | slides  ] 
\n@misc{talk-Spinner-SSP15,\nauthor = {Simon Spinner},\ntitle = {{Resource Demand Estimation in Distributed, Service-Oriented Applications using LibReDE}},\nhowpublished = {Technical Talk at Symposion on Software Performance (SSP) 2015},\ndays = {5},\nmonth = {November},\nyear = {2015},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/909}\n}\n
\n
\n','
\n@misc{talk-Spinner-SSP15,\n  author = {Simon Spinner},\n  title = {{Resource Demand Estimation in Distributed, Service-Oriented Applications using LibReDE}},\n  howpublished = {Technical Talk at Symposion on Software Performance (SSP) 2015},\n  days = {5},\n  month = {November},\n  year = {2015},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/909}\n}\n
\n\n',NULL,'{Resource Demand Estimation in Distributed, Service-Oriented Applications using LibReDE}',0,11,2015,11,NULL,NULL,NULL,'2015-11-16 10:39:31','2016-06-01 09:41:06',0),(911,'paper','KiBlBeSpLaKo2016-ICPE-PowerVariation','inproceedings','@inproceedings{KiBlBeSpLaKo2016-ICPE-PowerVariation,\n author = {J\\\'{o}akim von Kistowski and Hansfried Block and John Beckett and Cloyce Spradling and Klaus-Dieter Lange and Samuel Kounev},\n abstract = {{Experimental analysis of computer systems\' power consumption has become an integral part of system performance evaluation, efficiency management, and model-based analysis. As with all measurements, repeatability and reproducibility of power measurements is a major challenge. Nominally identical systems can have different power consumption running the same workload under otherwise identical conditions. This behavior can also be observed for individual system components. Specifically, CPU power consumption can vary amongst different samples of nominally identical CPUs. This in turn has a significant impact on the overall system power, considering that a system\'s processor is the largest and most dynamic power consumer of the overall system. The concrete impact of CPU sample power variations is unknown, as comprehensive studies about differences in power consumption for nominally identical systems are currently missing. We address this lack of studies by conducting measurements on four different processor types from two different architectures. For each of these types, we compare up to 30 physical processor samples with a total sum of 90 samples over all processor types. We analyze the variations in power consumption for the different samples using six different workloads over five load levels. Additionally, we analyze how these variations change for different processor core counts and architectures. The results of this paper show that selection of a processor sample can have a statistically significant impact on power consumption. With no correlation to performance, power consumption for nominally identical processors can differ as much as 29.6\\% in idle and 19.5\\% at full load. We also show that these variations change over different architectures and processor types.}},\n title = {{Variations in CPU Power Consumption}},\n year = {2016},\n booktitle = {Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)},\n location = {Delft, the Netherlands},\n month = {March},\n publisher = {ACM},\n address = {New York, NY, USA},\n keywords = {Benchmarking, CPU, Power, Variation, SPEC, SERT, Workloads, Energy Efficiency, Metrics, Load level, Utilization},\n doi = {http://dx.doi.org/10.1145/2851553.2851567},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/911},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/911.pdf},\n}\n\n','\n\nJóakim von Kistowski, Hansfried Block, John Beckett, Cloyce Spradling,\nKlaus-Dieter Lange, and Samuel Kounev.\nVariations in CPU Power Consumption.\nIn Proceedings of the 7th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2016), Delft, the Netherlands, March 2016.\nACM, New York, NY, USA.\nMarch 2016.\n[ bib | DOI | slides | .pdf | Abstract  ] 
\n@inproceedings{KiBlBeSpLaKo2016-ICPE-PowerVariation,\nauthor = {J\\\'{o}akim von Kistowski and Hansfried Block and John Beckett and Cloyce Spradling and Klaus-Dieter Lange and Samuel Kounev},\nabstract = {{Experimental analysis of computer systems\' power consumption has become an integral part of system performance evaluation, efficiency management, and model-based analysis. As with all measurements, repeatability and reproducibility of power measurements is a major challenge. Nominally identical systems can have different power consumption running the same workload under otherwise identical conditions. This behavior can also be observed for individual system components. Specifically, CPU power consumption can vary amongst different samples of nominally identical CPUs. This in turn has a significant impact on the overall system power, considering that a system\'s processor is the largest and most dynamic power consumer of the overall system. The concrete impact of CPU sample power variations is unknown, as comprehensive studies about differences in power consumption for nominally identical systems are currently missing. We address this lack of studies by conducting measurements on four different processor types from two different architectures. For each of these types, we compare up to 30 physical processor samples with a total sum of 90 samples over all processor types. We analyze the variations in power consumption for the different samples using six different workloads over five load levels. Additionally, we analyze how these variations change for different processor core counts and architectures. The results of this paper show that selection of a processor sample can have a statistically significant impact on power consumption. With no correlation to performance, power consumption for nominally identical processors can differ as much as 29.6\\% in idle and 19.5\\% at full load. We also show that these variations change over different architectures and processor types.}},\ntitle = {{Variations in CPU Power Consumption}},\nyear = {2016},\nbooktitle = {Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)},\nlocation = {Delft, the Netherlands},\nmonth = {March},\npublisher = {ACM},\naddress = {New York, NY, USA},\nkeywords = {Benchmarking, CPU, Power, Variation, SPEC, SERT, Workloads, Energy Efficiency, Metrics, Load level, Utilization},\ndoi = {http://dx.doi.org/10.1145/2851553.2851567},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/911},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/911.pdf}\n}\n
\n
\nExperimental analysis of computer systems\' power consumption has become an integral part of system performance evaluation, efficiency management, and model-based analysis. As with all measurements, repeatability and reproducibility of power measurements is a major challenge. Nominally identical systems can have different power consumption running the same workload under otherwise identical conditions. This behavior can also be observed for individual system components. Specifically, CPU power consumption can vary amongst different samples of nominally identical CPUs. This in turn has a significant impact on the overall system power, considering that a system\'s processor is the largest and most dynamic power consumer of the overall system. The concrete impact of CPU sample power variations is unknown, as comprehensive studies about differences in power consumption for nominally identical systems are currently missing. We address this lack of studies by conducting measurements on four different processor types from two different architectures. For each of these types, we compare up to 30 physical processor samples with a total sum of 90 samples over all processor types. We analyze the variations in power consumption for the different samples using six different workloads over five load levels. Additionally, we analyze how these variations change for different processor core counts and architectures. The results of this paper show that selection of a processor sample can have a statistically significant impact on power consumption. With no correlation to performance, power consumption for nominally identical processors can differ as much as 29.6% in idle and 19.5% at full load. We also show that these variations change over different architectures and processor types.\n
\n','
\n@inproceedings{KiBlBeSpLaKo2016-ICPE-PowerVariation,\n  author = {J\\\'{o}akim von Kistowski and Hansfried Block and John Beckett and Cloyce Spradling and Klaus-Dieter Lange and Samuel Kounev},\n  abstract = {{Experimental analysis of computer systems\' power consumption has become an integral part of system performance evaluation, efficiency management, and model-based analysis. As with all measurements, repeatability and reproducibility of power measurements is a major challenge. Nominally identical systems can have different power consumption running the same workload under otherwise identical conditions. This behavior can also be observed for individual system components. Specifically, CPU power consumption can vary amongst different samples of nominally identical CPUs. This in turn has a significant impact on the overall system power, considering that a system\'s processor is the largest and most dynamic power consumer of the overall system. The concrete impact of CPU sample power variations is unknown, as comprehensive studies about differences in power consumption for nominally identical systems are currently missing. We address this lack of studies by conducting measurements on four different processor types from two different architectures. For each of these types, we compare up to 30 physical processor samples with a total sum of 90 samples over all processor types. We analyze the variations in power consumption for the different samples using six different workloads over five load levels. Additionally, we analyze how these variations change for different processor core counts and architectures. The results of this paper show that selection of a processor sample can have a statistically significant impact on power consumption. With no correlation to performance, power consumption for nominally identical processors can differ as much as 29.6\\% in idle and 19.5\\% at full load. We also show that these variations change over different architectures and processor types.}},\n  title = {{Variations in CPU Power Consumption}},\n  year = {2016},\n  booktitle = {Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)},\n  location = {Delft, the Netherlands},\n  month = {March},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  keywords = {Benchmarking, CPU, Power, Variation, SPEC, SERT, Workloads, Energy Efficiency, Metrics, Load level, Utilization},\n  doi = {http://dx.doi.org/10.1145/2851553.2851567},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/911},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/911.pdf}\n}\n
\n\n','{Experimental analysis of computer systems\' power consumption has become an integral part of system performance evaluation, efficiency management, and model-based analysis. As with all measurements, repeatability and reproducibility of power measurements is a major challenge. Nominally identical systems can have different power consumption running the same workload under otherwise identical conditions. This behavior can also be observed for individual system components. Specifically, CPU power consumption can vary amongst different samples of nominally identical CPUs. This in turn has a significant impact on the overall system power, considering that a system\'s processor is the largest and most dynamic power consumer of the overall system. The concrete impact of CPU sample power variations is unknown, as comprehensive studies about differences in power consumption for nominally identical systems are currently missing. We address this lack of studies by conducting measurements on four different processor types from two different architectures. For each of these types, we compare up to 30 physical processor samples with a total sum of 90 samples over all processor types. We analyze the variations in power consumption for the different samples using six different workloads over five load levels. Additionally, we analyze how these variations change for different processor core counts and architectures. The results of this paper show that selection of a processor sample can have a statistically significant impact on power consumption. With no correlation to performance, power consumption for nominally identical processors can differ as much as 29.6\\% in idle and 19.5\\% at full load. We also show that these variations change over different architectures and processor types.}','{Variations in CPU Power Consumption}',0,3,2016,3,NULL,NULL,NULL,'2015-11-17 12:09:54','2016-06-01 09:41:06',0),(912,'talk','talk-Spinner-SPECdevops14','misc','@misc{talk-Spinner-SPECdevops14,\n author = {Simon Spinner},\n title = {{LibReDE - A library for Resource Demand Estimation}},\n howpublished = {Technical Talk at SPEC DevOps Performance Working Group},\n days = {25},\n month = {July},\n year = {2014},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/912},\n}\n\n','\n\nSimon Spinner.\nLibReDE - A library for Resource Demand Estimation.\nTechnical Talk at SPEC DevOps Performance Working Group, July 2014.\n[ bib | slides  ] 
\n@misc{talk-Spinner-SPECdevops14,\nauthor = {Simon Spinner},\ntitle = {{LibReDE - A library for Resource Demand Estimation}},\nhowpublished = {Technical Talk at SPEC DevOps Performance Working Group},\ndays = {25},\nmonth = {July},\nyear = {2014},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/912}\n}\n
\n
\n','
\n@misc{talk-Spinner-SPECdevops14,\n  author = {Simon Spinner},\n  title = {{LibReDE - A library for Resource Demand Estimation}},\n  howpublished = {Technical Talk at SPEC DevOps Performance Working Group},\n  days = {25},\n  month = {July},\n  year = {2014},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/912}\n}\n
\n\n',NULL,'{LibReDE - A library for Resource Demand Estimation}',0,7,2014,7,NULL,NULL,NULL,'2015-11-26 09:48:52','2016-06-01 09:41:06',0),(913,'paper','RySiSiAschKoSch2016-dni-traffic-extraction-icpe2016','inproceedings','@inproceedings{RySiSiAschKoSch2016-dni-traffic-extraction-icpe2016,\n author = {Piotr Rygielski and Viliam Simko and Felix Sittner and Doris Aschenbrenner and Samuel Kounev and Klaus Schilling},\n title = {{Automated Extraction of Network Traffic Models Suitable for Performance Simulation}},\n year = {2016},\n month = {March},\n day = {12--18},\n pages = {27--35},\n doi = {http://dx.doi.org/10.1145/2851553.2851570},\n booktitle = {Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)},\n location = {Delft, The Netherlands},\n publisher = {ACM},\n abstract = {{Data centers are increasingly becoming larger and dynamic due to virtualization. In order to leverage the performance modeling and prediction techniques, such as Palladio Component Model or Descartes Modeling Language, in such a dynamic environments, it is necessary to automate the model extraction. Building and maintaining such models manually is not feasible anymore due to their size and the level of details. This paper is focused on traffic models that are an essential part of network infrastructure. Our goal is to decompose real traffic dumps into models suitable for performance prediction using Descartes Network Infrastructure modeling approach. The main challenge was to efficiently encode an arbitrary signal in the form of simple traffic generators while maintaining the shape of the original signal. We show that a typical 15 minute long tcpdump trace can be compressed to 0.4--15% of its original size whereas the relative median of extraction error is 0% for the most of the 69 examined traces.}},\n note = {{Acceptance rate (Full Paper): 19/57 = 33\\%}},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/913},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/913.pdf},\n url = {http://dl.acm.org/citation.cfm?doid=2851553.2851570},\n}\n\n','\n\nPiotr Rygielski, Viliam Simko, Felix Sittner, Doris Aschenbrenner, Samuel\nKounev, and Klaus Schilling.\nAutomated Extraction of Network Traffic Models Suitable for\nPerformance Simulation.\nIn Proceedings of the 7th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2016), Delft, The Netherlands, March 12-18,\n2016, pages 27-35. ACM.\nMarch 2016, Acceptance rate (Full Paper): 19/57 = 33%.\n[ bib | DOI | slides | http | .pdf | Abstract  ] 
\n@inproceedings{RySiSiAschKoSch2016-dni-traffic-extraction-icpe2016,\nauthor = {Piotr Rygielski and Viliam Simko and Felix Sittner and Doris Aschenbrenner and Samuel Kounev and Klaus Schilling},\ntitle = {{Automated Extraction of Network Traffic Models Suitable for Performance Simulation}},\nyear = {2016},\nmonth = {March},\nday = {12--18},\npages = {27--35},\ndoi = {http://dx.doi.org/10.1145/2851553.2851570},\nbooktitle = {Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)},\nlocation = {Delft, The Netherlands},\npublisher = {ACM},\nabstract = {{Data centers are increasingly becoming larger and dynamic due to virtualization. In order to leverage the performance modeling and prediction techniques, such as Palladio Component Model or Descartes Modeling Language, in such a dynamic environments, it is necessary to automate the model extraction. Building and maintaining such models manually is not feasible anymore due to their size and the level of details. This paper is focused on traffic models that are an essential part of network infrastructure. Our goal is to decompose real traffic dumps into models suitable for performance prediction using Descartes Network Infrastructure modeling approach. The main challenge was to efficiently encode an arbitrary signal in the form of simple traffic generators while maintaining the shape of the original signal. We show that a typical 15 minute long tcpdump trace can be compressed to 0.4--15% of its original size whereas the relative median of extraction error is 0% for the most of the 69 examined traces.}},\nnote = {{Acceptance rate (Full Paper): 19/57 = 33\\%}},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/913},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/913.pdf},\nurl = {http://dl.acm.org/citation.cfm?doid=2851553.2851570}\n}\n
\n
\nData centers are increasingly becoming larger and dynamic due to virtualization. In order to leverage the performance modeling and prediction techniques, such as Palladio Component Model or Descartes Modeling Language, in such a dynamic environments, it is necessary to automate the model extraction. Building and maintaining such models manually is not feasible anymore due to their size and the level of details. This paper is focused on traffic models that are an essential part of network infrastructure. Our goal is to decompose real traffic dumps into models suitable for performance prediction using Descartes Network Infrastructure modeling approach. The main challenge was to efficiently encode an arbitrary signal in the form of simple traffic generators while maintaining the shape of the original signal. We show that a typical 15 minute long tcpdump trace can be compressed to 0.4-15% of its original size whereas the relative median of extraction error is 0% for the most of the 69 examined traces.\n
\n','
\n@inproceedings{RySiSiAschKoSch2016-dni-traffic-extraction-icpe2016,\n  author = {Piotr Rygielski and Viliam Simko and Felix Sittner and Doris Aschenbrenner and Samuel Kounev and Klaus Schilling},\n  title = {{Automated Extraction of Network Traffic Models Suitable for Performance Simulation}},\n  year = {2016},\n  month = {March},\n  day = {12--18},\n  pages = {27--35},\n  doi = {http://dx.doi.org/10.1145/2851553.2851570},\n  booktitle = {Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)},\n  location = {Delft, The Netherlands},\n  publisher = {ACM},\n  abstract = {{Data centers are increasingly becoming larger and dynamic due to virtualization. In order to leverage the performance modeling and prediction techniques, such as Palladio Component Model or Descartes Modeling Language, in such a dynamic environments, it is necessary to automate the model extraction. Building and maintaining such models manually is not feasible anymore due to their size and the level of details. This paper is focused on traffic models that are an essential part of network infrastructure. Our goal is to decompose real traffic dumps into models suitable for performance prediction using Descartes Network Infrastructure modeling approach. The main challenge was to efficiently encode an arbitrary signal in the form of simple traffic generators while maintaining the shape of the original signal. We show that a typical 15 minute long tcpdump trace can be compressed to 0.4--15% of its original size whereas the relative median of extraction error is 0% for the most of the 69 examined traces.}},\n  note = {{Acceptance rate (Full Paper): 19/57 = 33\\%}},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/913},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/913.pdf},\n  url = {http://dl.acm.org/citation.cfm?doid=2851553.2851570}\n}\n
\n\n','{Data centers are increasingly becoming larger and dynamic due to virtualization. In order to leverage the performance modeling and prediction techniques, such as Palladio Component Model or Descartes Modeling Language, in such a dynamic environments, it is necessary to automate the model extraction. Building and maintaining such models manually is not feasible anymore due to their size and the level of details. This paper is focused on traffic models that are an essential part of network infrastructure. Our goal is to decompose real traffic dumps into models suitable for performance prediction using Descartes Network Infrastructure modeling approach. The main challenge was to efficiently encode an arbitrary signal in the form of simple traffic generators while maintaining the shape of the original signal. We show that a typical 15 minute long tcpdump trace can be compressed to 0.4--15% of its original size whereas the relative median of extraction error is 0% for the most of the 69 examined traces.}','{Automated Extraction of Network Traffic Models Suitable for Performance Simulation}',0,3,2016,3,NULL,NULL,NULL,'2015-11-26 20:13:18','2016-06-01 09:41:06',0),(914,'paper','SpWaKo2015-WOSPC-ReferenceArchitecture','inproceedings','@inproceedings{SpWaKo2015-WOSPC-ReferenceArchitecture,\n author = {Simon Spinner and J\\\"{u}rgen Walter and Samuel Kounev},\n title = {{A Reference Architecture for Online Performance Model Extraction in Virtualized Environments}},\n booktitle = {{Proceedings of the 2016 Workshop on Challenges in Performance Methods for Software Development (WOSP-C\'16) co-located with 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\n year = {2016},\n location = {Delft, the Netherlands},\n month = {March},\n day = {12},\n note = {Accepted for publication},\n abstract = {Performance models can support decisions throughout the life-cycle of a software system. However, the manual construction of such performance models is a complex and time-consuming task requiring deep system knowledge. Therefore, automatic approaches for creating and updating performance models of a running system are necessary. Existing work focuses on single aspects of model extraction or proposes approaches specifically designed for a certain technology stack. In virtualized environments, we often see different applications based on diverse technology stacks sharing the same infrastructure. In order to enable online performance model extraction in such environments, we describe a new reference architecture for integrating different specialized model extraction solutions.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/914.pdf},\n}\n\n','\n\nSimon Spinner, Jürgen Walter, and Samuel Kounev.\nA Reference Architecture for Online Performance Model Extraction in\nVirtualized Environments.\nIn Proceedings of the 2016 Workshop on Challenges in\nPerformance Methods for Software Development (WOSP-C\'16) co-located with 7th\nACM/SPEC International Conference on Performance Engineering (ICPE 2016),\nDelft, the Netherlands, March 12, 2016.\nAccepted for publication.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{SpWaKo2015-WOSPC-ReferenceArchitecture,\nauthor = {Simon Spinner and J\\\"{u}rgen Walter and Samuel Kounev},\ntitle = {{A Reference Architecture for Online Performance Model Extraction in Virtualized Environments}},\nbooktitle = {{Proceedings of the 2016 Workshop on Challenges in Performance Methods for Software Development (WOSP-C\'16) co-located with 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\nyear = {2016},\nlocation = {Delft, the Netherlands},\nmonth = {March},\nday = {12},\nnote = {Accepted for publication},\nabstract = {Performance models can support decisions throughout the life-cycle of a software system. However, the manual construction of such performance models is a complex and time-consuming task requiring deep system knowledge. Therefore, automatic approaches for creating and updating performance models of a running system are necessary. Existing work focuses on single aspects of model extraction or proposes approaches specifically designed for a certain technology stack. In virtualized environments, we often see different applications based on diverse technology stacks sharing the same infrastructure. In order to enable online performance model extraction in such environments, we describe a new reference architecture for integrating different specialized model extraction solutions.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/914.pdf}\n}\n
\n
\nPerformance models can support decisions throughout the life-cycle of a software system. However, the manual construction of such performance models is a complex and time-consuming task requiring deep system knowledge. Therefore, automatic approaches for creating and updating performance models of a running system are necessary. Existing work focuses on single aspects of model extraction or proposes approaches specifically designed for a certain technology stack. In virtualized environments, we often see different applications based on diverse technology stacks sharing the same infrastructure. In order to enable online performance model extraction in such environments, we describe a new reference architecture for integrating different specialized model extraction solutions.\n
\n','
\n@inproceedings{SpWaKo2015-WOSPC-ReferenceArchitecture,\n  author = {Simon Spinner and J\\\"{u}rgen Walter and Samuel Kounev},\n  title = {{A Reference Architecture for Online Performance Model Extraction in Virtualized Environments}},\n  booktitle = {{Proceedings of the 2016 Workshop on Challenges in Performance Methods for Software Development (WOSP-C\'16) co-located with 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\n  year = {2016},\n  location = {Delft, the Netherlands},\n  month = {March},\n  day = {12},\n  note = {Accepted for publication},\n  abstract = {Performance models can support decisions throughout the life-cycle of a software system. However, the manual construction of such performance models is a complex and time-consuming task requiring deep system knowledge. Therefore, automatic approaches for creating and updating performance models of a running system are necessary. Existing work focuses on single aspects of model extraction or proposes approaches specifically designed for a certain technology stack. In virtualized environments, we often see different applications based on diverse technology stacks sharing the same infrastructure. In order to enable online performance model extraction in such environments, we describe a new reference architecture for integrating different specialized model extraction solutions.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/914.pdf}\n}\n
\n\n','Performance models can support decisions throughout the life-cycle of a software system. However, the manual construction of such performance models is a complex and time-consuming task requiring deep system knowledge. Therefore, automatic approaches for creating and updating performance models of a running system are necessary. Existing work focuses on single aspects of model extraction or proposes approaches specifically designed for a certain technology stack. In virtualized environments, we often see different applications based on diverse technology stacks sharing the same infrastructure. In order to enable online performance model extraction in such environments, we describe a new reference architecture for integrating different specialized model extraction solutions.','{A Reference Architecture for Online Performance Model Extraction in Virtualized Environments}',0,3,2016,3,NULL,NULL,NULL,'2015-12-16 14:24:04','2016-06-01 09:41:06',0),(915,'paper','WaHoKoOkKo2016-ICPE-DPE_Vision','inproceedings','@inproceedings{WaHoKoOkKo2016-ICPE-DPE_Vision,\n author = {J\\\"{u}rgen Walter and Andre van Hoorn and Heiko Koziolek and Dusan Okanovic and Samuel Kounev},\n title = {{Asking ``What?\'\', Automating the ``How?\'\': The Vision of Declarative Performance Engineering}},\n booktitle = {{Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\n year = {2016},\n location = {Delft, the Netherlands},\n month = {March},\n day = {12},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/915.pdf},\n abstract = {Over the past decades, various methods, techniques, and tools for modeling and evaluating performance properties of software systems have been proposed covering the entire software life cycle. However, the application of performance engineering approaches to solve a given user concern is still rather challenging and requires expert knowledge and experience. There are no recipes on how to select, configure, and execute suitable methods, tools, and techniques allowing to address the user concerns. In this paper, we describe our vision of Declarative Performance Engineering (DPE), which aims to decouple the description of the user concerns to be solved (performance questions and goals) from the task of selecting and applying a specific solution approach. The strict separation of ``what\'\' versus ``how\'\' enables the development of different techniques and algorithms to automatically select and apply a suitable approach for a given scenario. The goal is to hide complexity from the user by allowing users to express their concerns and goals without requiring any knowledge about performance engineering techniques. Towards realizing the DPE vision, we discuss the different requirements and propose a reference architecture for implementing and integrating respective methods, algorithms, and tooling.},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/915},\n}\n\n','\n\nJürgen Walter, Andre van Hoorn, Heiko Koziolek, Dusan Okanovic, and Samuel\nKounev.\nAsking “What?”, Automating the “How?”: The Vision of Declarative\nPerformance Engineering.\nIn Proceedings of the 7th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2016), Delft, the Netherlands, March 12,\n2016.\n[ bib | slides | .pdf | Abstract  ] 
\n@inproceedings{WaHoKoOkKo2016-ICPE-DPE_Vision,\nauthor = {J\\\"{u}rgen Walter and Andre van Hoorn and Heiko Koziolek and Dusan Okanovic and Samuel Kounev},\ntitle = {{Asking ``What?\'\', Automating the ``How?\'\': The Vision of Declarative Performance Engineering}},\nbooktitle = {{Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\nyear = {2016},\nlocation = {Delft, the Netherlands},\nmonth = {March},\nday = {12},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/915.pdf},\nabstract = {Over the past decades, various methods, techniques, and tools for modeling and evaluating performance properties of software systems have been proposed covering the entire software life cycle. However, the application of performance engineering approaches to solve a given user concern is still rather challenging and requires expert knowledge and experience. There are no recipes on how to select, configure, and execute suitable methods, tools, and techniques allowing to address the user concerns. In this paper, we describe our vision of Declarative Performance Engineering (DPE), which aims to decouple the description of the user concerns to be solved (performance questions and goals) from the task of selecting and applying a specific solution approach. The strict separation of ``what\'\' versus ``how\'\' enables the development of different techniques and algorithms to automatically select and apply a suitable approach for a given scenario. The goal is to hide complexity from the user by allowing users to express their concerns and goals without requiring any knowledge about performance engineering techniques. Towards realizing the DPE vision, we discuss the different requirements and propose a reference architecture for implementing and integrating respective methods, algorithms, and tooling.},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/915}\n}\n
\n
\nOver the past decades, various methods, techniques, and tools for modeling and evaluating performance properties of software systems have been proposed covering the entire software life cycle. However, the application of performance engineering approaches to solve a given user concern is still rather challenging and requires expert knowledge and experience. There are no recipes on how to select, configure, and execute suitable methods, tools, and techniques allowing to address the user concerns. In this paper, we describe our vision of Declarative Performance Engineering (DPE), which aims to decouple the description of the user concerns to be solved (performance questions and goals) from the task of selecting and applying a specific solution approach. The strict separation of “what” versus “how” enables the development of different techniques and algorithms to automatically select and apply a suitable approach for a given scenario. The goal is to hide complexity from the user by allowing users to express their concerns and goals without requiring any knowledge about performance engineering techniques. Towards realizing the DPE vision, we discuss the different requirements and propose a reference architecture for implementing and integrating respective methods, algorithms, and tooling.\n
\n','
\n@inproceedings{WaHoKoOkKo2016-ICPE-DPE_Vision,\n  author = {J\\\"{u}rgen Walter and Andre van Hoorn and Heiko Koziolek and Dusan Okanovic and Samuel Kounev},\n  title = {{Asking ``What?\'\', Automating the ``How?\'\': The Vision of Declarative Performance Engineering}},\n  booktitle = {{Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\n  year = {2016},\n  location = {Delft, the Netherlands},\n  month = {March},\n  day = {12},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/915.pdf},\n  abstract = {Over the past decades, various methods, techniques, and tools for modeling and evaluating performance properties of software systems have been proposed covering the entire software life cycle. However, the application of performance engineering approaches to solve a given user concern is still rather challenging and requires expert knowledge and experience. There are no recipes on how to select, configure, and execute suitable methods, tools, and techniques allowing to address the user concerns. In this paper, we describe our vision of Declarative Performance Engineering (DPE), which aims to decouple the description of the user concerns to be solved (performance questions and goals) from the task of selecting and applying a specific solution approach. The strict separation of ``what\'\' versus ``how\'\' enables the development of different techniques and algorithms to automatically select and apply a suitable approach for a given scenario. The goal is to hide complexity from the user by allowing users to express their concerns and goals without requiring any knowledge about performance engineering techniques. Towards realizing the DPE vision, we discuss the different requirements and propose a reference architecture for implementing and integrating respective methods, algorithms, and tooling.},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/915}\n}\n
\n\n','Over the past decades, various methods, techniques, and tools for modeling and evaluating performance properties of software systems have been proposed covering the entire software life cycle. However, the application of performance engineering approaches to solve a given user concern is still rather challenging and requires expert knowledge and experience. There are no recipes on how to select, configure, and execute suitable methods, tools, and techniques allowing to address the user concerns. In this paper, we describe our vision of Declarative Performance Engineering (DPE), which aims to decouple the description of the user concerns to be solved (performance questions and goals) from the task of selecting and applying a specific solution approach. The strict separation of ``what\'\' versus ``how\'\' enables the development of different techniques and algorithms to automatically select and apply a suitable approach for a given scenario. The goal is to hide complexity from the user by allowing users to express their concerns and goals without requiring any knowledge about performance engineering techniques. Towards realizing the DPE vision, we discuss the different requirements and propose a reference architecture for implementing and integrating respective methods, algorithms, and tooling.','{Asking ``What?\'\', Automating the ``How?\'\': The Vision of Declarative Performance Engineering}',0,3,2016,3,NULL,NULL,NULL,'2016-01-11 15:32:13','2016-06-01 09:41:06',0),(916,'paper','PMX2015','article','@article{PMX2015,\n author = {einBLICK (Robert Emmerich)},\n title = {{Leistung von IT-Systemen vorhersagen}},\n year = {2015},\n month = {December},\n day = {23},\n pages = {1-2},\n url = {http://www.presse.uni-wuerzburg.de/einblick/single_special/artikel/leistung-von-it-systemen-vorhersagen/},\n comment = {Samuel Kounev and J\\\"{u}rgen Walter},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/916.pdf},\n}\n\n','\n\neinBLICK (Robert Emmerich).\nLeistung von IT-Systemen vorhersagen.\npages 1-2, December 2015.\n[ bib | http | .pdf  ] 
\n@article{PMX2015,\nauthor = {einBLICK (Robert Emmerich)},\ntitle = {{Leistung von IT-Systemen vorhersagen}},\nyear = {2015},\nmonth = {December},\nday = {23},\npages = {1-2},\nurl = {http://www.presse.uni-wuerzburg.de/einblick/single_special/artikel/leistung-von-it-systemen-vorhersagen/},\ncomment = {Samuel Kounev and J\\\"{u}rgen Walter},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/916.pdf}\n}\n
\n
\n','
\n@article{PMX2015,\n  author = {einBLICK (Robert Emmerich)},\n  title = {{Leistung von IT-Systemen vorhersagen}},\n  year = {2015},\n  month = {December},\n  day = {23},\n  pages = {1-2},\n  url = {http://www.presse.uni-wuerzburg.de/einblick/single_special/artikel/leistung-von-it-systemen-vorhersagen/},\n  comment = {Samuel Kounev and J\\\"{u}rgen Walter},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/916.pdf}\n}\n
\n\n',NULL,'{Leistung von IT-Systemen vorhersagen}',0,12,2015,12,NULL,NULL,NULL,'2016-01-11 17:17:27','2016-06-01 09:41:06',0),(919,'paper','Demler2015','mastersthesis','@mastersthesis{Demler2015,\n author = {Jakob Demler},\n address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n title = {{Compiling Handlebars to C#}},\n type = {{Bachelor Thesis}},\n school = {University of W\\\"{u}rzburg},\n year = {2015},\n month = {December},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/919},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/919.pdf},\n}\n\n','\n\nJakob Demler.\nCompiling Handlebars to C#.\nBachelor Thesis, University of Würzburg, Am Hubland,\nInformatikgebäude, 97074 Würzburg, Germany, December 2015.\n[ bib | slides | .pdf  ] 
\n@mastersthesis{Demler2015,\nauthor = {Jakob Demler},\naddress = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\ntitle = {{Compiling Handlebars to C#}},\ntype = {{Bachelor Thesis}},\nschool = {University of W\\\"{u}rzburg},\nyear = {2015},\nmonth = {December},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/919},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/919.pdf}\n}\n
\n
\n','
\n@mastersthesis{Demler2015,\n  author = {Jakob Demler},\n  address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n  title = {{Compiling Handlebars to C#}},\n  type = {{Bachelor Thesis}},\n  school = {University of W\\\"{u}rzburg},\n  year = {2015},\n  month = {December},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/919},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/919.pdf}\n}\n
\n\n',NULL,'{Compiling Handlebars to C#}',0,12,2015,12,NULL,NULL,NULL,'2016-01-13 15:36:27','2016-06-01 09:41:06',0),(920,'talk','talk-Kounev-DATEV_TrendScout2015b','misc','@misc{talk-Kounev-DATEV_TrendScout2015b,\n author = {Samuel Kounev},\n title = {{Industrie 4.1: So wird die Produktion wirklich smart!}},\n howpublished = {Invited Talk, DATEV Trendscout, N\\\"urnberg, Germany},\n days = {19},\n month = {Nov},\n year = {2015},\n}\n\n','\n\nSamuel Kounev.\nIndustrie 4.1: So wird die Produktion wirklich smart!\nInvited Talk, DATEV Trendscout, Nürnberg, Germany, Nov 2015.\n[ bib  ] 
\n@misc{talk-Kounev-DATEV_TrendScout2015b,\nauthor = {Samuel Kounev},\ntitle = {{Industrie 4.1: So wird die Produktion wirklich smart!}},\nhowpublished = {Invited Talk, DATEV Trendscout, N\\\"urnberg, Germany},\ndays = {19},\nmonth = {Nov},\nyear = {2015}\n}\n
\n
\n','
\n@misc{talk-Kounev-DATEV_TrendScout2015b,\n  author = {Samuel Kounev},\n  title = {{Industrie 4.1: So wird die Produktion wirklich smart!}},\n  howpublished = {Invited Talk, DATEV Trendscout, N\\\"urnberg, Germany},\n  days = {19},\n  month = {Nov},\n  year = {2015}\n}\n
\n\n',NULL,'{Industrie 4.1: So wird die Produktion wirklich smart!}',0,11,2015,11,NULL,NULL,NULL,'2016-01-16 18:15:19','2016-06-01 09:41:06',0),(921,'talk','talk-Kounev-InvStutt15','misc','@misc{talk-Kounev-InvStutt15,\n author = {Samuel Kounev},\n title = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\n howpublished = {Invited Talk, Faculty of Computer Science, Electrical Engineering and Information Technology, University of Stuttgart, Stuttgart, Germany},\n days = {23},\n month = {July},\n year = {2015},\n}\n\n','\n\nSamuel Kounev.\nIngenieurmässige Entwicklung verlässlicher und effizienter\nSoftware-Systeme.\nInvited Talk, Faculty of Computer Science, Electrical Engineering and\nInformation Technology, University of Stuttgart, Stuttgart, Germany, July\n2015.\n[ bib  ] 
\n@misc{talk-Kounev-InvStutt15,\nauthor = {Samuel Kounev},\ntitle = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\nhowpublished = {Invited Talk, Faculty of Computer Science, Electrical Engineering and Information Technology, University of Stuttgart, Stuttgart, Germany},\ndays = {23},\nmonth = {July},\nyear = {2015}\n}\n
\n
\n','
\n@misc{talk-Kounev-InvStutt15,\n  author = {Samuel Kounev},\n  title = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\n  howpublished = {Invited Talk, Faculty of Computer Science, Electrical Engineering and Information Technology, University of Stuttgart, Stuttgart, Germany},\n  days = {23},\n  month = {July},\n  year = {2015}\n}\n
\n\n',NULL,'{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}',0,7,2015,7,NULL,NULL,NULL,'2016-01-16 18:23:14','2016-06-01 09:41:06',0),(922,'talk','talk-Kounev-InvFAU16','misc','@misc{talk-Kounev-InvFAU16,\n author = {Samuel Kounev},\n title = {{Model-Based Approach to Designing Self-Aware IT Systems and Infrastructures}},\n howpublished = {Invited Talk (Kolloquiumsvortrag), Department Informatik, Friedrich-Alexander-Universit\\\"{a}t Erlangen-N\\\"{u}rnberg, Erlangen, Germany},\n days = {25},\n month = {Jan},\n year = {2016},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/922},\n}\n\n','\n\nSamuel Kounev.\nModel-Based Approach to Designing Self-Aware IT Systems and\nInfrastructures.\nInvited Talk (Kolloquiumsvortrag), Department Informatik,\nFriedrich-Alexander-Universität Erlangen-Nürnberg, Erlangen, Germany,\nJan 2016.\n[ bib | slides  ] 
\n@misc{talk-Kounev-InvFAU16,\nauthor = {Samuel Kounev},\ntitle = {{Model-Based Approach to Designing Self-Aware IT Systems and Infrastructures}},\nhowpublished = {Invited Talk (Kolloquiumsvortrag), Department Informatik, Friedrich-Alexander-Universit\\\"{a}t Erlangen-N\\\"{u}rnberg, Erlangen, Germany},\ndays = {25},\nmonth = {Jan},\nyear = {2016},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/922}\n}\n
\n
\n','
\n@misc{talk-Kounev-InvFAU16,\n  author = {Samuel Kounev},\n  title = {{Model-Based Approach to Designing Self-Aware IT Systems and Infrastructures}},\n  howpublished = {Invited Talk (Kolloquiumsvortrag), Department Informatik, Friedrich-Alexander-Universit\\\"{a}t Erlangen-N\\\"{u}rnberg, Erlangen, Germany},\n  days = {25},\n  month = {Jan},\n  year = {2016},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/922}\n}\n
\n\n',NULL,'{Model-Based Approach to Designing Self-Aware IT Systems and Infrastructures}',0,1,2016,1,NULL,NULL,NULL,'2016-01-16 18:27:35','2016-06-01 09:41:06',0),(923,'talk','Talk-vanHoKo-SPP1593-2016','misc','@misc{Talk-vanHoKo-SPP1593-2016,\n address = {Hannover, Germany},\n author = {Andr\\\'{e} van Hoorn and Samuel Kounev and Dusan Okanovi\\\'{c} and J\\\"{u}rgen Walter},\n howpublished = {Renewal Kickoff Workshop of the DFG Priority Programme 1593, Hannover, January 14-15, 2016},\n title = {{DECLARE: Declarative Performance Engineering}},\n year = {2016},\n month = {January},\n days = {14},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/923},\n}\n\n','\n\nAndré van Hoorn, Samuel Kounev, Dusan Okanović, and Jürgen Walter.\nDECLARE: Declarative Performance Engineering.\nRenewal Kickoff Workshop of the DFG Priority Programme 1593,\nHannover, January 14-15, 2016, January 2016.\n[ bib | slides  ] 
\n@misc{Talk-vanHoKo-SPP1593-2016,\naddress = {Hannover, Germany},\nauthor = {Andr\\\'{e} van Hoorn and Samuel Kounev and Dusan Okanovi\\\'{c} and J\\\"{u}rgen Walter},\nhowpublished = {Renewal Kickoff Workshop of the DFG Priority Programme 1593, Hannover, January 14-15, 2016},\ntitle = {{DECLARE: Declarative Performance Engineering}},\nyear = {2016},\nmonth = {January},\ndays = {14},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/923}\n}\n
\n
\n','
\n@misc{Talk-vanHoKo-SPP1593-2016,\n  address = {Hannover, Germany},\n  author = {Andr\\\'{e} van Hoorn and Samuel Kounev and Dusan Okanovi\\\'{c} and J\\\"{u}rgen Walter},\n  howpublished = {Renewal Kickoff Workshop of the DFG Priority Programme 1593, Hannover, January 14-15, 2016},\n  title = {{DECLARE: Declarative Performance Engineering}},\n  year = {2016},\n  month = {January},\n  days = {14},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/923}\n}\n
\n\n',NULL,'{DECLARE: Declarative Performance Engineering}',0,1,2016,1,NULL,NULL,NULL,'2016-01-16 18:40:08','2016-06-01 09:41:06',0),(924,'paper','CaSpWa2016-ICPE-AutomatedParameterizationTutorial','inproceedings','@inproceedings{CaSpWa2016-ICPE-AutomatedParameterizationTutorial,\n author = {Giuliano Casale and Simon Spinner and Weikun Wang},\n title = {{Automated Parameterization of Performance Models from Measurements}},\n titleaddon = {{(Tutorial Paper)}},\n year = {2016},\n month = {March},\n day = {12},\n location = {Delft, the Netherlands},\n booktitle = {{Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\n abstract = {Estimating parameters of performance models from empirical measurements is a critical task, which often has a major influence on the predictive accuracy of a model. This tutorial presents the problem of parameter estimation in queueing systems and queueing networks. The focus is on reliable estimation of the {\\em arrival rates} of the requests and of the {\\em service demands} they place at the servers. The tutorial covers common estimation techniques such as regression methods, maximum-likelihood estimation, and moment-matching, discussing their sensitivity with respect to data and model characteristics. The tutorial also demonstrates the automated estimation of model parameters using new open source tools.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/924.pdf},\n}\n\n','\n\nGiuliano Casale, Simon Spinner, and Weikun Wang.\nAutomated Parameterization of Performance Models from Measurements\n(Tutorial Paper).\nIn Proceedings of the 7th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2016), Delft, the Netherlands, March 12,\n2016.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{CaSpWa2016-ICPE-AutomatedParameterizationTutorial,\nauthor = {Giuliano Casale and Simon Spinner and Weikun Wang},\ntitle = {{Automated Parameterization of Performance Models from Measurements}},\ntitleaddon = {{(Tutorial Paper)}},\nyear = {2016},\nmonth = {March},\nday = {12},\nlocation = {Delft, the Netherlands},\nbooktitle = {{Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\nabstract = {Estimating parameters of performance models from empirical measurements is a critical task, which often has a major influence on the predictive accuracy of a model. This tutorial presents the problem of parameter estimation in queueing systems and queueing networks. The focus is on reliable estimation of the {\\em arrival rates} of the requests and of the {\\em service demands} they place at the servers. The tutorial covers common estimation techniques such as regression methods, maximum-likelihood estimation, and moment-matching, discussing their sensitivity with respect to data and model characteristics. The tutorial also demonstrates the automated estimation of model parameters using new open source tools.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/924.pdf}\n}\n
\n
\nEstimating parameters of performance models from empirical measurements is a critical task, which often has a major influence on the predictive accuracy of a model. This tutorial presents the problem of parameter estimation in queueing systems and queueing networks. The focus is on reliable estimation of the arrival rates of the requests and of the service demands they place at the servers. The tutorial covers common estimation techniques such as regression methods, maximum-likelihood estimation, and moment-matching, discussing their sensitivity with respect to data and model characteristics. The tutorial also demonstrates the automated estimation of model parameters using new open source tools.\n
\n','
\n@inproceedings{CaSpWa2016-ICPE-AutomatedParameterizationTutorial,\n  author = {Giuliano Casale and Simon Spinner and Weikun Wang},\n  title = {{Automated Parameterization of Performance Models from Measurements}},\n  titleaddon = {{(Tutorial Paper)}},\n  year = {2016},\n  month = {March},\n  day = {12},\n  location = {Delft, the Netherlands},\n  booktitle = {{Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\n  abstract = {Estimating parameters of performance models from empirical measurements is a critical task, which often has a major influence on the predictive accuracy of a model. This tutorial presents the problem of parameter estimation in queueing systems and queueing networks. The focus is on reliable estimation of the {\\em arrival rates} of the requests and of the {\\em service demands} they place at the servers. The tutorial covers common estimation techniques such as regression methods, maximum-likelihood estimation, and moment-matching, discussing their sensitivity with respect to data and model characteristics. The tutorial also demonstrates the automated estimation of model parameters using new open source tools.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/924.pdf}\n}\n
\n\n','Estimating parameters of performance models from empirical measurements is a critical task, which often has a major influence on the predictive accuracy of a model. This tutorial presents the problem of parameter estimation in queueing systems and queueing networks. The focus is on reliable estimation of the {\\em arrival rates} of the requests and of the {\\em service demands} they place at the servers. The tutorial covers common estimation techniques such as regression methods, maximum-likelihood estimation, and moment-matching, discussing their sensitivity with respect to data and model characteristics. The tutorial also demonstrates the automated estimation of model parameters using new open source tools.','{Automated Parameterization of Performance Models from Measurements}',0,3,2016,3,NULL,NULL,NULL,'2016-01-17 15:28:38','2016-06-01 09:41:06',0),(925,'paper','Schreck2015','mastersthesis','@mastersthesis{Schreck2015,\n author = {Marco Schreck},\n address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n title = {{Benchmarking Energy Efficiency of Servers in Virtualized Environments}},\n type = {{Master Thesis}},\n school = {University of W\\\"{u}rzburg},\n year = {2015},\n month = {December},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/925.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/925},\n}\n\n','\n\nMarco Schreck.\nBenchmarking Energy Efficiency of Servers in Virtualized\nEnvironments.\nMaster Thesis, University of Würzburg, Am Hubland,\nInformatikgebäude, 97074 Würzburg, Germany, December 2015.\n[ bib | slides | .pdf  ] 
\n@mastersthesis{Schreck2015,\nauthor = {Marco Schreck},\naddress = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\ntitle = {{Benchmarking Energy Efficiency of Servers in Virtualized Environments}},\ntype = {{Master Thesis}},\nschool = {University of W\\\"{u}rzburg},\nyear = {2015},\nmonth = {December},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/925.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/925}\n}\n
\n
\n','
\n@mastersthesis{Schreck2015,\n  author = {Marco Schreck},\n  address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n  title = {{Benchmarking Energy Efficiency of Servers in Virtualized Environments}},\n  type = {{Master Thesis}},\n  school = {University of W\\\"{u}rzburg},\n  year = {2015},\n  month = {December},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/925.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/925}\n}\n
\n\n',NULL,'{Benchmarking Energy Efficiency of Servers in Virtualized Environments}',0,12,2015,12,NULL,NULL,NULL,'2016-01-21 13:35:05','2016-06-01 09:41:06',0),(926,'paper','KoHuBrZh2016-IEEEComputer-Descartes','article','@article{KoHuBrZh2016-IEEEComputer-Descartes,\n author = {Samuel Kounev and Nikolaus Huber and Fabian Brosig and Xiaoyun Zhu},\n journal = {IEEE Computer Magazine},\n title = {{Model-Based Approach to Designing Self-Aware IT Systems and Infrastructures}},\n year = {2016},\n publisher = {IEEE},\n note = {Accepted for Publication, To appear in 2016},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/926.pdf},\n}\n\n','\n\nSamuel Kounev, Nikolaus Huber, Fabian Brosig, and Xiaoyun Zhu.\nModel-Based Approach to Designing Self-Aware IT Systems and\nInfrastructures.\nIEEE Computer Magazine, 2016, IEEE.\nAccepted for Publication, To appear in 2016.\n[ bib | .pdf  ] 
\n@article{KoHuBrZh2016-IEEEComputer-Descartes,\nauthor = {Samuel Kounev and Nikolaus Huber and Fabian Brosig and Xiaoyun Zhu},\njournal = {IEEE Computer Magazine},\ntitle = {{Model-Based Approach to Designing Self-Aware IT Systems and Infrastructures}},\nyear = {2016},\npublisher = {IEEE},\nnote = {Accepted for Publication, To appear in 2016},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/926.pdf}\n}\n
\n
\n','
\n@article{KoHuBrZh2016-IEEEComputer-Descartes,\n  author = {Samuel Kounev and Nikolaus Huber and Fabian Brosig and Xiaoyun Zhu},\n  journal = {IEEE Computer Magazine},\n  title = {{Model-Based Approach to Designing Self-Aware IT Systems and Infrastructures}},\n  year = {2016},\n  publisher = {IEEE},\n  note = {Accepted for Publication, To appear in 2016},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/926.pdf}\n}\n
\n\n',NULL,'{Model-Based Approach to Designing Self-Aware IT Systems and Infrastructures}',0,0,2016,0,NULL,NULL,NULL,'2016-01-23 10:35:14','2016-06-01 09:41:06',0),(927,'paper','Leonhardt2015','mastersthesis','@mastersthesis{Leonhardt2015,\n author = {Alexander Leonhardt},\n address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n school = {University of W\\\"urzburg},\n title = {{Quantification of the Impact of Transient Behaviors of Intrusion Detection Systems on Evaluation Metrics}},\n year = {2015},\n type = {{Bachelor Thesis}},\n}\n\n','\n\nAlexander Leonhardt.\nQuantification of the Impact of Transient Behaviors of Intrusion\nDetection Systems on Evaluation Metrics.\nBachelor Thesis, University of Würzburg, Am Hubland,\nInformatikgebäude, 97074 Würzburg, Germany, 2015.\n[ bib  ] 
\n@mastersthesis{Leonhardt2015,\nauthor = {Alexander Leonhardt},\naddress = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\nschool = {University of W\\\"urzburg},\ntitle = {{Quantification of the Impact of Transient Behaviors of Intrusion Detection Systems on Evaluation Metrics}},\nyear = {2015},\ntype = {{Bachelor Thesis}}\n}\n
\n
\n','
\n@mastersthesis{Leonhardt2015,\n  author = {Alexander Leonhardt},\n  address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n  school = {University of W\\\"urzburg},\n  title = {{Quantification of the Impact of Transient Behaviors of Intrusion Detection Systems on Evaluation Metrics}},\n  year = {2015},\n  type = {{Bachelor Thesis}}\n}\n
\n\n',NULL,'{Quantification of the Impact of Transient Behaviors of Intrusion Detection Systems on Evaluation Metrics}',0,0,2015,0,NULL,NULL,NULL,'2016-01-28 11:31:03','2016-06-01 09:41:06',0),(928,'paper','WvGb','article','@article{WvGb,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Computing zy with Maximum Accuracy},\n journal = {Computing 31, p. 185-189, 1983},\n year = {1983},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nComputing zy with maximum accuracy.\nComputing 31, p. 185-189, 1983, 1983.\n[ bib  ] 
\n@article{WvGb,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Computing zy with Maximum Accuracy},\njournal = {Computing 31, p. 185-189, 1983},\nyear = {1983},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGb,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Computing zy with Maximum Accuracy},\n  journal = {Computing 31, p. 185-189, 1983},\n  year = {1983},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Computing zy with Maximum Accuracy',0,0,1983,0,NULL,NULL,NULL,'2016-02-20 23:18:58','2016-06-01 09:41:06',0),(929,'paper','WvGc','article','@article{WvGc,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {An Introduction to MATRIX PASCAL: A PASCAL Extension for Scientific Computation},\n journal = {in Kulisch/Miranker (Hrsg): A New Approach to Scientific Computation, Academic Press, 1983},\n year = {1983},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nAn introduction to matrix pascal: A pascal extension for scientific\ncomputation.\nin Kulisch/Miranker (Hrsg): A New Approach to Scientific\nComputation, Academic Press, 1983, 1983.\n[ bib  ] 
\n@article{WvGc,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {An Introduction to MATRIX PASCAL: A PASCAL Extension for Scientific Computation},\njournal = {in Kulisch/Miranker (Hrsg): A New Approach to Scientific Computation, Academic Press, 1983},\nyear = {1983},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGc,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {An Introduction to MATRIX PASCAL: A PASCAL Extension for Scientific Computation},\n  journal = {in Kulisch/Miranker (Hrsg): A New Approach to Scientific Computation, Academic Press, 1983},\n  year = {1983},\n  tags = {Reliability}\n}\n
\n\n',NULL,'An Introduction to MATRIX PASCAL: A PASCAL Extension for Scientific Computation',0,0,1983,0,NULL,NULL,NULL,'2016-02-20 23:18:58','2016-06-01 09:41:06',0),(930,'paper','WvGd','article','@article{WvGd,\n author = {G. Bohlender and K. Gr\"{u}ner and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Realisierung einer optimalen Arithmetik},\n journal = {Elektron. Rechenanlagen 24, H.2, p. 68-72, 1982},\n year = {1982},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, K. Gr\"uner, and Jürgen Wolff von Gudenberg.\nRealisierung einer optimalen arithmetik.\nElektron. Rechenanlagen 24, H.2, p. 68-72, 1982, 1982.\n[ bib  ] 
\n@article{WvGd,\nauthor = {G. Bohlender and K. Gr\"{u}ner and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Realisierung einer optimalen Arithmetik},\njournal = {Elektron. Rechenanlagen 24, H.2, p. 68-72, 1982},\nyear = {1982},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGd,\n  author = {G. Bohlender and K. Gr\"{u}ner and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Realisierung einer optimalen Arithmetik},\n  journal = {Elektron. Rechenanlagen 24, H.2, p. 68-72, 1982},\n  year = {1982},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Realisierung einer optimalen Arithmetik',0,0,1982,0,NULL,NULL,NULL,'2016-02-20 23:18:58','2016-06-01 09:41:06',0),(931,'paper','WvGe','article','@article{WvGe,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Berechnung maximal genauer Standardfunktionen mit einfacher Mantissenl\\\"{a}nge},\n journal = {Elektron. Rechenanlagen 26, H.5, p. 230 - 238, 1984},\n year = {1984},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nBerechnung maximal genauer standardfunktionen mit einfacher\nmantissenlänge.\nElektron. Rechenanlagen 26, H.5, p. 230 - 238, 1984, 1984.\n[ bib  ] 
\n@article{WvGe,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Berechnung maximal genauer Standardfunktionen mit einfacher Mantissenl\\\"{a}nge},\njournal = {Elektron. Rechenanlagen 26, H.5, p. 230 - 238, 1984},\nyear = {1984},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGe,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Berechnung maximal genauer Standardfunktionen mit einfacher Mantissenl\\\"{a}nge},\n  journal = {Elektron. Rechenanlagen 26, H.5, p. 230 - 238, 1984},\n  year = {1984},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Berechnung maximal genauer Standardfunktionen mit einfacher Mantissenl\\\"{a}nge',0,0,1984,0,NULL,NULL,NULL,'2016-02-20 23:18:58','2016-06-01 09:41:06',0),(932,'paper','WvGf','techreport','@techreport{WvGf,\n author = {G. Bohlender and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {PASCAL-SC: A PASCAL for Contemporary Scientific Computation},\n institution = {IBM Research Report, RC 9009, 1981},\n year = {1981},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, K. Gr\"uner, E. Kaucher, R. Klatte, W. Krämer, U. Kulisch,\nW. L. Miranker, S. M. Rump, Ch. Ullrich, and Jürgen Wolff von Gudenberg.\nPascal-sc: A pascal for contemporary scientific computation.\nTechnical report, IBM Research Report, RC 9009, 1981, 1981.\n[ bib  ] 
\n@techreport{WvGf,\nauthor = {G. Bohlender and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {PASCAL-SC: A PASCAL for Contemporary Scientific Computation},\ninstitution = {IBM Research Report, RC 9009, 1981},\nyear = {1981},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGf,\n  author = {G. Bohlender and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {PASCAL-SC: A PASCAL for Contemporary Scientific Computation},\n  institution = {IBM Research Report, RC 9009, 1981},\n  year = {1981},\n  tags = {Reliability}\n}\n
\n\n',NULL,'PASCAL-SC: A PASCAL for Contemporary Scientific Computation',0,0,1981,0,NULL,NULL,NULL,'2016-02-20 23:18:58','2016-06-01 09:41:06',0),(933,'paper','WvGg','article','@article{WvGg,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Standard functions with maximum accuracy computed in single precision arithmetic},\n journal = {IMACS 1985 Trans. on Scientific Computation, Vol. 2, Computer Systems: Performance and Simulation, North-Holland, 1986},\n year = {1986},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nStandard functions with maximum accuracy computed in single precision\narithmetic.\nIMACS 1985 Trans. on Scientific Computation, Vol. 2, Computer\nSystems: Performance and Simulation, North-Holland, 1986, 1986.\n[ bib  ] 
\n@article{WvGg,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Standard functions with maximum accuracy computed in single precision arithmetic},\njournal = {IMACS 1985 Trans. on Scientific Computation, Vol. 2, Computer Systems: Performance and Simulation, North-Holland, 1986},\nyear = {1986},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGg,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Standard functions with maximum accuracy computed in single precision arithmetic},\n  journal = {IMACS 1985 Trans. on Scientific Computation, Vol. 2, Computer Systems: Performance and Simulation, North-Holland, 1986},\n  year = {1986},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Standard functions with maximum accuracy computed in single precision arithmetic',0,0,1986,0,NULL,NULL,NULL,'2016-02-20 23:18:58','2016-06-01 09:41:06',0),(934,'paper','WvGh','article','@article{WvGh,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Standard functions with maximum accuracy computed in single precision arithmetic},\n journal = {Proceedings of the 11th IMACS World Congress, Vol. 1, Oslo, p. 171-183, 1985},\n year = {1985},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nStandard functions with maximum accuracy computed in single precision\narithmetic.\nProceedings of the 11th IMACS World Congress, Vol. 1, Oslo, p.\n171-183, 1985, 1985.\n[ bib  ] 
\n@article{WvGh,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Standard functions with maximum accuracy computed in single precision arithmetic},\njournal = {Proceedings of the 11th IMACS World Congress, Vol. 1, Oslo, p. 171-183, 1985},\nyear = {1985},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGh,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Standard functions with maximum accuracy computed in single precision arithmetic},\n  journal = {Proceedings of the 11th IMACS World Congress, Vol. 1, Oslo, p. 171-183, 1985},\n  year = {1985},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Standard functions with maximum accuracy computed in single precision arithmetic',0,0,1985,0,NULL,NULL,NULL,'2016-02-20 23:18:58','2016-06-01 09:41:06',0),(935,'paper','WvGi','article','@article{WvGi,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Floating-point Computation in PASCAL-SC with Verified Results},\n journal = {Lecture Notes in Computer Science 204, Eurocal \'85, p. 322 - 324, Springer 1985},\n year = {1985},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nFloating-point computation in pascal-sc with verified results.\nLecture Notes in Computer Science 204, Eurocal \'85, p. 322 -\n324, Springer 1985, 1985.\n[ bib  ] 
\n@article{WvGi,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Floating-point Computation in PASCAL-SC with Verified Results},\njournal = {Lecture Notes in Computer Science 204, Eurocal \'85, p. 322 - 324, Springer 1985},\nyear = {1985},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGi,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Floating-point Computation in PASCAL-SC with Verified Results},\n  journal = {Lecture Notes in Computer Science 204, Eurocal \'85, p. 322 - 324, Springer 1985},\n  year = {1985},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Floating-point Computation in PASCAL-SC with Verified Results',0,0,1985,0,NULL,NULL,NULL,'2016-02-20 23:18:58','2016-06-01 09:41:06',0),(936,'paper','WvGj','article','@article{WvGj,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {PASCAL-SC Demonstration. Accurate Arithmetic for Verified Results},\n journal = {Lecture Notes in Computer Science 204, Eurocal \'85, p. 325-326, Springer 1985},\n year = {1985},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nPascal-sc demonstration. accurate arithmetic for verified results.\nLecture Notes in Computer Science 204, Eurocal \'85, p. 325-326,\nSpringer 1985, 1985.\n[ bib  ] 
\n@article{WvGj,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {PASCAL-SC Demonstration. Accurate Arithmetic for Verified Results},\njournal = {Lecture Notes in Computer Science 204, Eurocal \'85, p. 325-326, Springer 1985},\nyear = {1985},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGj,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {PASCAL-SC Demonstration. Accurate Arithmetic for Verified Results},\n  journal = {Lecture Notes in Computer Science 204, Eurocal \'85, p. 325-326, Springer 1985},\n  year = {1985},\n  tags = {Reliability}\n}\n
\n\n',NULL,'PASCAL-SC Demonstration. Accurate Arithmetic for Verified Results',0,0,1985,0,NULL,NULL,NULL,'2016-02-20 23:18:58','2016-06-01 09:41:06',0),(937,'paper','WvGk','article','@article{WvGk,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Rechnerarithmetik f\\\"{u}r wissenschaftliches Rechnen},\n journal = {PASCAL-SC, Computer Theoretikum und Praktikum f\\\"{u}r Physiker, Fachinformationszentrum Karlsruhe, p. 43-50, 1985},\n year = {1985},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nRechnerarithmetik für wissenschaftliches rechnen.\nPASCAL-SC, Computer Theoretikum und Praktikum für Physiker,\nFachinformationszentrum Karlsruhe, p. 43-50, 1985, 1985.\n[ bib  ] 
\n@article{WvGk,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Rechnerarithmetik f\\\"{u}r wissenschaftliches Rechnen},\njournal = {PASCAL-SC, Computer Theoretikum und Praktikum f\\\"{u}r Physiker, Fachinformationszentrum Karlsruhe, p. 43-50, 1985},\nyear = {1985},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGk,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Rechnerarithmetik f\\\"{u}r wissenschaftliches Rechnen},\n  journal = {PASCAL-SC, Computer Theoretikum und Praktikum f\\\"{u}r Physiker, Fachinformationszentrum Karlsruhe, p. 43-50, 1985},\n  year = {1985},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Rechnerarithmetik f\\\"{u}r wissenschaftliches Rechnen',0,0,1985,0,NULL,NULL,NULL,'2016-02-20 23:18:59','2016-06-01 09:41:07',0),(938,'paper','WvGl','techreport','@techreport{WvGl,\n author = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {MATRIX PASCAL},\n institution = {IBM Research Report, RC 9577, 1982},\n year = {1982},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, H. Böhm, K. Gr\"uner, E. Kaucher, R. Klatte, W. Krämer,\nU. Kulisch, W. L. Miranker, S. M. Rump, Ch. Ullrich, and Jürgen Wolff von\nGudenberg.\nMatrix pascal.\nTechnical report, IBM Research Report, RC 9577, 1982, 1982.\n[ bib  ] 
\n@techreport{WvGl,\nauthor = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {MATRIX PASCAL},\ninstitution = {IBM Research Report, RC 9577, 1982},\nyear = {1982},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGl,\n  author = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {MATRIX PASCAL},\n  institution = {IBM Research Report, RC 9577, 1982},\n  year = {1982},\n  tags = {Reliability}\n}\n
\n\n',NULL,'MATRIX PASCAL',0,0,1982,0,NULL,NULL,NULL,'2016-02-20 23:18:59','2016-06-01 09:41:07',0),(939,'paper','WvGm','article','@article{WvGm,\n author = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {MATRIX PASCAL},\n journal = {in Kulisch/Miranker (Hrsg): A New Approach to Scientific Computation. Academic Press, p. 312-384, 1983},\n year = {1983},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, H. Böhm, K. Gr\"uner, E. Kaucher, R. Klatte, W. Krämer,\nU. Kulisch, W. L. Miranker, S. M. Rump, Ch. Ullrich, and Jürgen Wolff von\nGudenberg.\nMatrix pascal.\nin Kulisch/Miranker (Hrsg): A New Approach to Scientific\nComputation. Academic Press, p. 312-384, 1983, 1983.\n[ bib  ] 
\n@article{WvGm,\nauthor = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {MATRIX PASCAL},\njournal = {in Kulisch/Miranker (Hrsg): A New Approach to Scientific Computation. Academic Press, p. 312-384, 1983},\nyear = {1983},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGm,\n  author = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {MATRIX PASCAL},\n  journal = {in Kulisch/Miranker (Hrsg): A New Approach to Scientific Computation. Academic Press, p. 312-384, 1983},\n  year = {1983},\n  tags = {Reliability}\n}\n
\n\n',NULL,'MATRIX PASCAL',0,0,1983,0,NULL,NULL,NULL,'2016-02-20 23:18:59','2016-06-01 09:41:07',0); -INSERT INTO `Entry` VALUES (940,'paper','WvGn','article','@article{WvGn,\n author = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Proposal for Arithmetic Specification in FORTRAN 8x},\n journal = {in B. Ford, J.C. Rault, F. Thomasset (Eds.): Tools Methods and Languages for Scientific and Engineering Computation, North-Holland, INRIA, 1984},\n year = {1984},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, H. Böhm, K. Gr\"uner, E. Kaucher, R. Klatte, W. Krämer,\nU. Kulisch, W. L. Miranker, S. M. Rump, Ch. Ullrich, and Jürgen Wolff von\nGudenberg.\nProposal for arithmetic specification in fortran 8x.\nin B. Ford, J.C. Rault, F. Thomasset (Eds.): Tools Methods and\nLanguages for Scientific and Engineering Computation, North-Holland, INRIA,\n1984, 1984.\n[ bib  ] 
\n@article{WvGn,\nauthor = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Proposal for Arithmetic Specification in FORTRAN 8x},\njournal = {in B. Ford, J.C. Rault, F. Thomasset (Eds.): Tools Methods and Languages for Scientific and Engineering Computation, North-Holland, INRIA, 1984},\nyear = {1984},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGn,\n  author = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Proposal for Arithmetic Specification in FORTRAN 8x},\n  journal = {in B. Ford, J.C. Rault, F. Thomasset (Eds.): Tools Methods and Languages for Scientific and Engineering Computation, North-Holland, INRIA, 1984},\n  year = {1984},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Proposal for Arithmetic Specification in FORTRAN 8x',0,0,1984,0,NULL,NULL,NULL,'2016-02-20 23:18:59','2016-06-01 09:41:07',0),(941,'paper','WvGo','article','@article{WvGo,\n author = {T. Urlaub and J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n title = {XOMT},\n journal = {Informatik Forschung und Entwicklung 11, p.218, 1996},\n year = {1996},\n tags = {Reliability},\n}\n\n','\n\nT. Urlaub, J. Seemann, and Jürgen Wolff von Gudenberg.\nXomt.\nInformatik Forschung und Entwicklung 11, p.218, 1996, 1996.\n[ bib  ] 
\n@article{WvGo,\nauthor = {T. Urlaub and J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {XOMT},\njournal = {Informatik Forschung und Entwicklung 11, p.218, 1996},\nyear = {1996},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGo,\n  author = {T. Urlaub and J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {XOMT},\n  journal = {Informatik Forschung und Entwicklung 11, p.218, 1996},\n  year = {1996},\n  tags = {Reliability}\n}\n
\n\n',NULL,'XOMT',0,0,1996,0,NULL,NULL,NULL,'2016-02-20 23:18:59','2016-06-01 09:41:07',0),(942,'paper','WvGp','techreport','@techreport{WvGp,\n author = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Proposal for Arithmetic Specification in FORTRAN 8x},\n institution = {Bericht des Instituts f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1982},\n year = {1982},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, H. Böhm, K. Gr\"uner, E. Kaucher, R. Klatte, W. Krämer,\nU. Kulisch, W. L. Miranker, S. M. Rump, Ch. Ullrich, and Jürgen Wolff von\nGudenberg.\nProposal for arithmetic specification in fortran 8x.\nTechnical report, Bericht des Instituts für Angewandte\nMathematik, Universität Karlsruhe, 1982, 1982.\n[ bib  ] 
\n@techreport{WvGp,\nauthor = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Proposal for Arithmetic Specification in FORTRAN 8x},\ninstitution = {Bericht des Instituts f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1982},\nyear = {1982},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGp,\n  author = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Proposal for Arithmetic Specification in FORTRAN 8x},\n  institution = {Bericht des Instituts f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1982},\n  year = {1982},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Proposal for Arithmetic Specification in FORTRAN 8x',0,0,1982,0,NULL,NULL,NULL,'2016-02-20 23:18:59','2016-06-01 09:41:07',0),(943,'paper','WvGq','misc','@misc{WvGq,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Mathematics on Computers. A commented list of references},\n howpublished = {ESPRIT DIAMOND consortium, No. 03/2a-6/3/K2, 1987},\n year = {1987},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nMathematics on computers. a commented list of references.\nESPRIT DIAMOND consortium, No. 03/2a-6/3/K2, 1987, 1987.\n[ bib  ] 
\n@misc{WvGq,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Mathematics on Computers. A commented list of references},\nhowpublished = {ESPRIT DIAMOND consortium, No. 03/2a-6/3/K2, 1987},\nyear = {1987},\ntags = {Reliability}\n}\n
\n
\n','
\n@misc{WvGq,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Mathematics on Computers. A commented list of references},\n  howpublished = {ESPRIT DIAMOND consortium, No. 03/2a-6/3/K2, 1987},\n  year = {1987},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Mathematics on Computers. A commented list of references',0,0,1987,0,NULL,NULL,NULL,'2016-02-20 23:18:59','2016-06-01 09:41:07',0),(944,'paper','WvGr','article','@article{WvGr,\n author = {J. Seemann and T. Urlaub and J\\\"{u}rgen Wolff von Gudenberg},\n title = {XOMT - ein graphischer Editor f\\\"{u}r OMT-Objektmodelle},\n journal = {in Beitr\\\"{a}ge der GI-Fachtagung Softwaretechnik 95, Braunschweig, 1995, p.162},\n year = {1995},\n tags = {Reliability},\n}\n\n','\n\nJ. Seemann, T. Urlaub, and Jürgen Wolff von Gudenberg.\nXomt - ein graphischer editor für omt-objektmodelle.\nin Beiträge der GI-Fachtagung Softwaretechnik 95,\nBraunschweig, 1995, p.162, 1995.\n[ bib  ] 
\n@article{WvGr,\nauthor = {J. Seemann and T. Urlaub and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {XOMT - ein graphischer Editor f\\\"{u}r OMT-Objektmodelle},\njournal = {in Beitr\\\"{a}ge der GI-Fachtagung Softwaretechnik 95, Braunschweig, 1995, p.162},\nyear = {1995},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGr,\n  author = {J. Seemann and T. Urlaub and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {XOMT - ein graphischer Editor f\\\"{u}r OMT-Objektmodelle},\n  journal = {in Beitr\\\"{a}ge der GI-Fachtagung Softwaretechnik 95, Braunschweig, 1995, p.162},\n  year = {1995},\n  tags = {Reliability}\n}\n
\n\n',NULL,'XOMT - ein graphischer Editor f\\\"{u}r OMT-Objektmodelle',0,0,1995,0,NULL,NULL,NULL,'2016-02-20 23:18:59','2016-06-01 09:41:07',0),(945,'paper','WvGs','misc','@misc{WvGs,\n author = {M. Klingspor and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Modula-2O},\n howpublished = {An object-oriented extension of Modula-2, ISO Document ISO/IEC JTC1/SC22/WG13/D199, 1994},\n year = {1994},\n tags = {Reliability},\n}\n\n','\n\nM. Klingspor and Jürgen Wolff von Gudenberg.\nModula-2o.\nAn object-oriented extension of Modula-2, ISO Document ISO/IEC\nJTC1/SC22/WG13/D199, 1994, 1994.\n[ bib  ] 
\n@misc{WvGs,\nauthor = {M. Klingspor and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Modula-2O},\nhowpublished = {An object-oriented extension of Modula-2, ISO Document ISO/IEC JTC1/SC22/WG13/D199, 1994},\nyear = {1994},\ntags = {Reliability}\n}\n
\n
\n','
\n@misc{WvGs,\n  author = {M. Klingspor and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Modula-2O},\n  howpublished = {An object-oriented extension of Modula-2, ISO Document ISO/IEC JTC1/SC22/WG13/D199, 1994},\n  year = {1994},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Modula-2O',0,0,1994,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(946,'paper','WvGt','techreport','@techreport{WvGt,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Transformation of dotproduct expressions in PASCAL-SC},\n institution = {DIAMOND consortium, No. 03/2a-6/3/K2, 1987},\n year = {1987},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nTransformation of dotproduct expressions in pascal-sc.\nTechnical report, DIAMOND consortium, No. 03/2a-6/3/K2, 1987, 1987.\n[ bib  ] 
\n@techreport{WvGt,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Transformation of dotproduct expressions in PASCAL-SC},\ninstitution = {DIAMOND consortium, No. 03/2a-6/3/K2, 1987},\nyear = {1987},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGt,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Transformation of dotproduct expressions in PASCAL-SC},\n  institution = {DIAMOND consortium, No. 03/2a-6/3/K2, 1987},\n  year = {1987},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Transformation of dotproduct expressions in PASCAL-SC',0,0,1987,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(947,'paper','WvGu','article','@article{WvGu,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Reliable Expression Evaluation in PASCAL-SC},\n journal = {in R. E. Moore (Ed) Reliability in Computing Academic Press, p. 81-98, 1988},\n year = {1988},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nReliable expression evaluation in pascal-sc.\nin R. E. Moore (Ed) Reliability in Computing Academic Press, p.\n81-98, 1988, 1988.\n[ bib  ] 
\n@article{WvGu,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Reliable Expression Evaluation in PASCAL-SC},\njournal = {in R. E. Moore (Ed) Reliability in Computing Academic Press, p. 81-98, 1988},\nyear = {1988},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGu,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Reliable Expression Evaluation in PASCAL-SC},\n  journal = {in R. E. Moore (Ed) Reliability in Computing Academic Press, p. 81-98, 1988},\n  year = {1988},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Reliable Expression Evaluation in PASCAL-SC',0,0,1988,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(948,'paper','WvGv','article','@article{WvGv,\n author = {A. Yakovlev and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Multiaspect Data Types in Scientific Computation},\n journal = {in S. Markov (ed.) : Mathematical Modelling and Scientific Computation, Datecs Publishing, Sofia, 1993},\n year = {1993},\n tags = {Reliability},\n}\n\n','\n\nA. Yakovlev and Jürgen Wolff von Gudenberg.\nMultiaspect data types in scientific computation.\nin S. Markov (ed.) : Mathematical Modelling and Scientific\nComputation, Datecs Publishing, Sofia, 1993, 1993.\n[ bib  ] 
\n@article{WvGv,\nauthor = {A. Yakovlev and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Multiaspect Data Types in Scientific Computation},\njournal = {in S. Markov (ed.) : Mathematical Modelling and Scientific Computation, Datecs Publishing, Sofia, 1993},\nyear = {1993},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGv,\n  author = {A. Yakovlev and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Multiaspect Data Types in Scientific Computation},\n  journal = {in S. Markov (ed.) : Mathematical Modelling and Scientific Computation, Datecs Publishing, Sofia, 1993},\n  year = {1993},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Multiaspect Data Types in Scientific Computation',0,0,1993,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(949,'paper','WvGw','article','@article{WvGw,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {PASCAL-SC (Level 2) Language Extension},\n journal = {ESPRIT \'88, Putting the Technology to Use, p. 460-466, North-Holland, 1988},\n year = {1988},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nPascal-sc (level 2) language extension.\nESPRIT \'88, Putting the Technology to Use, p. 460-466,\nNorth-Holland, 1988, 1988.\n[ bib  ] 
\n@article{WvGw,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {PASCAL-SC (Level 2) Language Extension},\njournal = {ESPRIT \'88, Putting the Technology to Use, p. 460-466, North-Holland, 1988},\nyear = {1988},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGw,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {PASCAL-SC (Level 2) Language Extension},\n  journal = {ESPRIT \'88, Putting the Technology to Use, p. 460-466, North-Holland, 1988},\n  year = {1988},\n  tags = {Reliability}\n}\n
\n\n',NULL,'PASCAL-SC (Level 2) Language Extension',0,0,1988,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(950,'paper','WvGx','article','@article{WvGx,\n author = {A. Yakovlev and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Enhanced Evaluation of Mathematical Expressions},\n journal = {Interval\'94 Abstracts, Reliable Computing, p.248, 1994},\n year = {1994},\n tags = {Reliability},\n}\n\n','\n\nA. Yakovlev and Jürgen Wolff von Gudenberg.\nEnhanced evaluation of mathematical expressions.\nInterval\'94 Abstracts, Reliable Computing, p.248, 1994, 1994.\n[ bib  ] 
\n@article{WvGx,\nauthor = {A. Yakovlev and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Enhanced Evaluation of Mathematical Expressions},\njournal = {Interval\'94 Abstracts, Reliable Computing, p.248, 1994},\nyear = {1994},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGx,\n  author = {A. Yakovlev and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Enhanced Evaluation of Mathematical Expressions},\n  journal = {Interval\'94 Abstracts, Reliable Computing, p.248, 1994},\n  year = {1994},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Enhanced Evaluation of Mathematical Expressions',0,0,1994,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(951,'paper','WvGy','techreport','@techreport{WvGy,\n author = {B. Menzel and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Kommentierte Syntaxdiagramme f\\\"{u}r C++},\n institution = {Inst. f\\\"{u}r Informatik, Universit\\\"{a}t W\"{u}rzburg, Bericht Nr. 47, 1992},\n year = {1992},\n tags = {Reliability},\n}\n\n','\n\nB. Menzel and Jürgen Wolff von Gudenberg.\nKommentierte syntaxdiagramme für c++.\nTechnical report, Inst. für Informatik, Universität\nW\"urzburg, Bericht Nr. 47, 1992, 1992.\n[ bib  ] 
\n@techreport{WvGy,\nauthor = {B. Menzel and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Kommentierte Syntaxdiagramme f\\\"{u}r C++},\ninstitution = {Inst. f\\\"{u}r Informatik, Universit\\\"{a}t W\"{u}rzburg, Bericht Nr. 47, 1992},\nyear = {1992},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGy,\n  author = {B. Menzel and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Kommentierte Syntaxdiagramme f\\\"{u}r C++},\n  institution = {Inst. f\\\"{u}r Informatik, Universit\\\"{a}t W\"{u}rzburg, Bericht Nr. 47, 1992},\n  year = {1992},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Kommentierte Syntaxdiagramme f\\\"{u}r C++',0,0,1992,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(952,'paper','WvGz','article','@article{WvGz,\n author = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Introduction to Tools and Languages for Scientific Computation},\n journal = {Applied Mathematics I -- Algorithms and Theory, North Holland, 1992},\n year = {1992},\n tags = {Reliability},\n}\n\n','\n\nCh. Ullrich and Jürgen Wolff von Gudenberg.\nIntroduction to tools and languages for scientific computation.\nApplied Mathematics I - Algorithms and Theory, North Holland,\n1992, 1992.\n[ bib  ] 
\n@article{WvGz,\nauthor = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Introduction to Tools and Languages for Scientific Computation},\njournal = {Applied Mathematics I -- Algorithms and Theory, North Holland, 1992},\nyear = {1992},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGz,\n  author = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Introduction to Tools and Languages for Scientific Computation},\n  journal = {Applied Mathematics I -- Algorithms and Theory, North Holland, 1992},\n  year = {1992},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Introduction to Tools and Languages for Scientific Computation',0,0,1992,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(953,'paper','WvGaa','conference','@conference{WvGaa,\n author = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Introduction to Tools and Languages for Scientific Computation},\n booktitle = {Proceedings zum IMACS World Congress Dublin, p.37-39, 1991 und C. Brezinski, U. Kulisch (eds) Computational},\n year = {1991},\n tags = {Reliability},\n}\n\n','\n\nCh. Ullrich and Jürgen Wolff von Gudenberg.\nIntroduction to tools and languages for scientific computation.\nIn Proceedings zum IMACS World Congress Dublin, p.37-39, 1991\nund C. Brezinski, U. Kulisch (eds) Computational, 1991.\n[ bib  ] 
\n@conference{WvGaa,\nauthor = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Introduction to Tools and Languages for Scientific Computation},\nbooktitle = {Proceedings zum IMACS World Congress Dublin, p.37-39, 1991 und C. Brezinski, U. Kulisch (eds) Computational},\nyear = {1991},\ntags = {Reliability}\n}\n
\n
\n','
\n@conference{WvGaa,\n  author = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Introduction to Tools and Languages for Scientific Computation},\n  booktitle = {Proceedings zum IMACS World Congress Dublin, p.37-39, 1991 und C. Brezinski, U. Kulisch (eds) Computational},\n  year = {1991},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Introduction to Tools and Languages for Scientific Computation',0,0,1991,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(954,'paper','WvGab','techreport','@techreport{WvGab,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Esprit-Projekt DIAMOND},\n institution = {in U. Kulisch (Ed.) Wissenschaftliches Rechnen mit Ergebnisverifikation, Akademie und Vieweg, p. 251-259, 1989},\n year = {1989},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nEsprit-projekt diamond.\nTechnical report, in U. Kulisch (Ed.) Wissenschaftliches Rechnen mit\nErgebnisverifikation, Akademie und Vieweg, p. 251-259, 1989, 1989.\n[ bib  ] 
\n@techreport{WvGab,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Esprit-Projekt DIAMOND},\ninstitution = {in U. Kulisch (Ed.) Wissenschaftliches Rechnen mit Ergebnisverifikation, Akademie und Vieweg, p. 251-259, 1989},\nyear = {1989},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGab,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Esprit-Projekt DIAMOND},\n  institution = {in U. Kulisch (Ed.) Wissenschaftliches Rechnen mit Ergebnisverifikation, Akademie und Vieweg, p. 251-259, 1989},\n  year = {1989},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Esprit-Projekt DIAMOND',0,0,1989,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(955,'paper','WvGac','techreport','@techreport{WvGac,\n author = {G. Bohlender and W.L. Miranker and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Floating-Point Systems for Theorem Proving},\n institution = {IBM Research Report RC 15 101, 1989},\n year = {1989},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, W.L. Miranker, and Jürgen Wolff von Gudenberg.\nFloating-point systems for theorem proving.\nTechnical report, IBM Research Report RC 15 101, 1989, 1989.\n[ bib  ] 
\n@techreport{WvGac,\nauthor = {G. Bohlender and W.L. Miranker and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Floating-Point Systems for Theorem Proving},\ninstitution = {IBM Research Report RC 15 101, 1989},\nyear = {1989},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGac,\n  author = {G. Bohlender and W.L. Miranker and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Floating-Point Systems for Theorem Proving},\n  institution = {IBM Research Report RC 15 101, 1989},\n  year = {1989},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Floating-Point Systems for Theorem Proving',0,0,1989,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(956,'paper','WvGad','techreport','@techreport{WvGad,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Project No 1072 - DIAMOND},\n institution = {ESPRIT, Information Processing Systems, Results and Progress of Esprit Projects 1989, p. 51-56, 1989},\n year = {1989},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nProject no 1072 - diamond.\nTechnical report, ESPRIT, Information Processing Systems, Results and\nProgress of Esprit Projects 1989, p. 51-56, 1989, 1989.\n[ bib  ] 
\n@techreport{WvGad,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Project No 1072 - DIAMOND},\ninstitution = {ESPRIT, Information Processing Systems, Results and Progress of Esprit Projects 1989, p. 51-56, 1989},\nyear = {1989},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGad,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Project No 1072 - DIAMOND},\n  institution = {ESPRIT, Information Processing Systems, Results and Progress of Esprit Projects 1989, p. 51-56, 1989},\n  year = {1989},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Project No 1072 - DIAMOND',0,0,1989,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(957,'paper','WvGae','article','@article{WvGae,\n author = {G. Bohlender and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Accurate Matrix Multiplication on the Array Processor AMT-DAP},\n journal = {in Kaucher/Markov/Mayer (Eds.), Computer Arithmetic, Scientific Computation and Mathematical Modelling, J.C. Baltzer, p.133-150, 1991},\n year = {1991},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender and Jürgen Wolff von Gudenberg.\nAccurate matrix multiplication on the array processor amt-dap.\nin Kaucher/Markov/Mayer (Eds.), Computer Arithmetic, Scientific\nComputation and Mathematical Modelling, J.C. Baltzer, p.133-150, 1991, 1991.\n[ bib  ] 
\n@article{WvGae,\nauthor = {G. Bohlender and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Accurate Matrix Multiplication on the Array Processor AMT-DAP},\njournal = {in Kaucher/Markov/Mayer (Eds.), Computer Arithmetic, Scientific Computation and Mathematical Modelling, J.C. Baltzer, p.133-150, 1991},\nyear = {1991},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGae,\n  author = {G. Bohlender and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Accurate Matrix Multiplication on the Array Processor AMT-DAP},\n  journal = {in Kaucher/Markov/Mayer (Eds.), Computer Arithmetic, Scientific Computation and Mathematical Modelling, J.C. Baltzer, p.133-150, 1991},\n  year = {1991},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Accurate Matrix Multiplication on the Array Processor AMT-DAP',0,0,1991,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(958,'paper','WvGaf','article','@article{WvGaf,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {The Karlsruhe Accurate Arithmetic Approach},\n journal = {in P.J.L. Wallis (Ed), Improving Floating Point Programming, Wiley, 1990},\n year = {1990},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nThe karlsruhe accurate arithmetic approach.\nin P.J.L. Wallis (Ed), Improving Floating Point Programming,\nWiley, 1990, 1990.\n[ bib  ] 
\n@article{WvGaf,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {The Karlsruhe Accurate Arithmetic Approach},\njournal = {in P.J.L. Wallis (Ed), Improving Floating Point Programming, Wiley, 1990},\nyear = {1990},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGaf,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {The Karlsruhe Accurate Arithmetic Approach},\n  journal = {in P.J.L. Wallis (Ed), Improving Floating Point Programming, Wiley, 1990},\n  year = {1990},\n  tags = {Reliability}\n}\n
\n\n',NULL,'The Karlsruhe Accurate Arithmetic Approach',0,0,1990,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(959,'paper','WvGag','article','@article{WvGag,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {The Embedding of Accurate Arithmetic in PASCAL-SC},\n journal = {in P.J.L. Wallis (Ed), Improving Floating Point Programming, Wiley, 1990},\n year = {1990},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nThe embedding of accurate arithmetic in pascal-sc.\nin P.J.L. Wallis (Ed), Improving Floating Point Programming,\nWiley, 1990, 1990.\n[ bib  ] 
\n@article{WvGag,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {The Embedding of Accurate Arithmetic in PASCAL-SC},\njournal = {in P.J.L. Wallis (Ed), Improving Floating Point Programming, Wiley, 1990},\nyear = {1990},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGag,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {The Embedding of Accurate Arithmetic in PASCAL-SC},\n  journal = {in P.J.L. Wallis (Ed), Improving Floating Point Programming, Wiley, 1990},\n  year = {1990},\n  tags = {Reliability}\n}\n
\n\n',NULL,'The Embedding of Accurate Arithmetic in PASCAL-SC',0,0,1990,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(960,'paper','WvGah','article','@article{WvGah,\n author = {G. Bohlender and W.L. Miranker and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Floating-Point Systems for Theorem Proving},\n journal = {in K.Meyer, D. Schmidt (Eds.) Computer Aided Proofs in Analysis, Springer, p. 22-32, 1991},\n year = {1991},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, W.L. Miranker, and Jürgen Wolff von Gudenberg.\nFloating-point systems for theorem proving.\nin K.Meyer, D. Schmidt (Eds.) Computer Aided Proofs in Analysis,\nSpringer, p. 22-32, 1991, 1991.\n[ bib  ] 
\n@article{WvGah,\nauthor = {G. Bohlender and W.L. Miranker and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Floating-Point Systems for Theorem Proving},\njournal = {in K.Meyer, D. Schmidt (Eds.) Computer Aided Proofs in Analysis, Springer, p. 22-32, 1991},\nyear = {1991},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGah,\n  author = {G. Bohlender and W.L. Miranker and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Floating-Point Systems for Theorem Proving},\n  journal = {in K.Meyer, D. Schmidt (Eds.) Computer Aided Proofs in Analysis, Springer, p. 22-32, 1991},\n  year = {1991},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Floating-Point Systems for Theorem Proving',0,0,1991,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(961,'paper','WvGai','article','@article{WvGai,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Arithmetische und programmiersprachliche Werkzeuge f\\\"{u}r die Numerik (Teil 1)},\n journal = {Computer Theoretikum und Praktikum f\\\"{u}r Physiker,p. 15-42, 1990},\n year = {1990},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nArithmetische und programmiersprachliche werkzeuge für die\nnumerik (teil 1).\nComputer Theoretikum und Praktikum für Physiker,p. 15-42,\n1990, 1990.\n[ bib  ] 
\n@article{WvGai,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Arithmetische und programmiersprachliche Werkzeuge f\\\"{u}r die Numerik (Teil 1)},\njournal = {Computer Theoretikum und Praktikum f\\\"{u}r Physiker,p. 15-42, 1990},\nyear = {1990},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGai,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Arithmetische und programmiersprachliche Werkzeuge f\\\"{u}r die Numerik (Teil 1)},\n  journal = {Computer Theoretikum und Praktikum f\\\"{u}r Physiker,p. 15-42, 1990},\n  year = {1990},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Arithmetische und programmiersprachliche Werkzeuge f\\\"{u}r die Numerik (Teil 1)',0,0,1990,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(962,'paper','WvGaj','article','@article{WvGaj,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {A Symbolic Generic Expression Concept},\n journal = {in C. Ullrich (Ed.), Contributions to Computer Arithmetic and Self-Validating numerical methods, IMACS, p. 459-464, 1990},\n year = {1990},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nA symbolic generic expression concept.\nin C. Ullrich (Ed.), Contributions to Computer Arithmetic and\nSelf-Validating numerical methods, IMACS, p. 459-464, 1990, 1990.\n[ bib  ] 
\n@article{WvGaj,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {A Symbolic Generic Expression Concept},\njournal = {in C. Ullrich (Ed.), Contributions to Computer Arithmetic and Self-Validating numerical methods, IMACS, p. 459-464, 1990},\nyear = {1990},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGaj,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {A Symbolic Generic Expression Concept},\n  journal = {in C. Ullrich (Ed.), Contributions to Computer Arithmetic and Self-Validating numerical methods, IMACS, p. 459-464, 1990},\n  year = {1990},\n  tags = {Reliability}\n}\n
\n\n',NULL,'A Symbolic Generic Expression Concept',0,0,1990,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(963,'paper','WvGak','article','@article{WvGak,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Einsatz genauer Nullstellenverfahren bei der Berechnung zweiseitig gek\\\"{u}hlter Halbleiterbauelemente},\n journal = {ZAMM 70,p. T549-T551, 1990},\n year = {1990},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nEinsatz genauer nullstellenverfahren bei der berechnung zweiseitig\ngekühlter halbleiterbauelemente.\nZAMM 70,p. T549-T551, 1990, 1990.\n[ bib  ] 
\n@article{WvGak,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Einsatz genauer Nullstellenverfahren bei der Berechnung zweiseitig gek\\\"{u}hlter Halbleiterbauelemente},\njournal = {ZAMM 70,p. T549-T551, 1990},\nyear = {1990},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGak,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Einsatz genauer Nullstellenverfahren bei der Berechnung zweiseitig gek\\\"{u}hlter Halbleiterbauelemente},\n  journal = {ZAMM 70,p. T549-T551, 1990},\n  year = {1990},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Einsatz genauer Nullstellenverfahren bei der Berechnung zweiseitig gek\\\"{u}hlter Halbleiterbauelemente',0,0,1990,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 10:17:18',0),(964,'paper','WvGal','techreport','@techreport{WvGal,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Typvererbung in objektorienten Datenbanken},\n institution = {Kolloquium Angewandte Informatik Karlsruhe 1989, Universit\\\"{a}t Karlsruhe, 1990},\n year = {1990},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nTypvererbung in objektorienten datenbanken.\nTechnical report, Kolloquium Angewandte Informatik Karlsruhe 1989,\nUniversität Karlsruhe, 1990, 1990.\n[ bib  ] 
\n@techreport{WvGal,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Typvererbung in objektorienten Datenbanken},\ninstitution = {Kolloquium Angewandte Informatik Karlsruhe 1989, Universit\\\"{a}t Karlsruhe, 1990},\nyear = {1990},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGal,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Typvererbung in objektorienten Datenbanken},\n  institution = {Kolloquium Angewandte Informatik Karlsruhe 1989, Universit\\\"{a}t Karlsruhe, 1990},\n  year = {1990},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Typvererbung in objektorienten Datenbanken',0,0,1990,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(965,'paper','WvGam','article','@article{WvGam,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Arithmetic for Vector and Parallel Computers},\n journal = {Decision Support Systems 7, p. 285-292, 1991 (Abstract in Methods of Operations Research 62, 1990)},\n year = {1990},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nArithmetic for vector and parallel computers.\nDecision Support Systems 7, p. 285-292, 1991 (Abstract in\nMethods of Operations Research 62, 1990), 1990.\n[ bib  ] 
\n@article{WvGam,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Arithmetic for Vector and Parallel Computers},\njournal = {Decision Support Systems 7, p. 285-292, 1991 (Abstract in Methods of Operations Research 62, 1990)},\nyear = {1990},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGam,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Arithmetic for Vector and Parallel Computers},\n  journal = {Decision Support Systems 7, p. 285-292, 1991 (Abstract in Methods of Operations Research 62, 1990)},\n  year = {1990},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Arithmetic for Vector and Parallel Computers',0,0,1990,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(966,'paper','WvGan','article','@article{WvGan,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Object-oriented Concepts for Scientific Computation},\n journal = {in Kaucher/Markov/Mayer(Eds.), Computer Arithmetic, Scientific Computation and Mathematical Modelling, J.C. Baltzer, p.181-192, 1991},\n year = {1991},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nObject-oriented concepts for scientific computation.\nin Kaucher/Markov/Mayer(Eds.), Computer Arithmetic, Scientific\nComputation and Mathematical Modelling, J.C. Baltzer, p.181-192, 1991, 1991.\n[ bib  ] 
\n@article{WvGan,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Object-oriented Concepts for Scientific Computation},\njournal = {in Kaucher/Markov/Mayer(Eds.), Computer Arithmetic, Scientific Computation and Mathematical Modelling, J.C. Baltzer, p.181-192, 1991},\nyear = {1991},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGan,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Object-oriented Concepts for Scientific Computation},\n  journal = {in Kaucher/Markov/Mayer(Eds.), Computer Arithmetic, Scientific Computation and Mathematical Modelling, J.C. Baltzer, p.181-192, 1991},\n  year = {1991},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Object-oriented Concepts for Scientific Computation',0,0,1991,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(967,'paper','WvGao','article','@article{WvGao,\n author = {G. Schumacher and J\\\"{u}rgen Wolff von Gudenberg},\n title = {E-Methods for Improving Accuracy},\n journal = {in P.J.L. Wallis (Ed.) Improving Floating Point Programming, Wiley 1990},\n year = {1990},\n tags = {Reliability},\n}\n\n','\n\nG. Schumacher and Jürgen Wolff von Gudenberg.\nE-methods for improving accuracy.\nin P.J.L. Wallis (Ed.) Improving Floating Point Programming,\nWiley 1990, 1990.\n[ bib  ] 
\n@article{WvGao,\nauthor = {G. Schumacher and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {E-Methods for Improving Accuracy},\njournal = {in P.J.L. Wallis (Ed.) Improving Floating Point Programming, Wiley 1990},\nyear = {1990},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGao,\n  author = {G. Schumacher and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {E-Methods for Improving Accuracy},\n  journal = {in P.J.L. Wallis (Ed.) Improving Floating Point Programming, Wiley 1990},\n  year = {1990},\n  tags = {Reliability}\n}\n
\n\n',NULL,'E-Methods for Improving Accuracy',0,0,1990,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(968,'paper','WvGap','article','@article{WvGap,\n author = {G. Bohlender and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {The Module Concepts in PASCAL-SC, ADA, MODULA-2 and FORTRAN 8x,},\n journal = {Journal for Pascal, Ada & C},\n year = {1990},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, Ch. Ullrich, and Jürgen Wolff von Gudenberg.\nThe module concepts in pascal-sc, ada, modula-2 and fortran 8x,.\nJournal for Pascal, Ada & C, 1990.\n[ bib  ] 
\n@article{WvGap,\nauthor = {G. Bohlender and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {The Module Concepts in PASCAL-SC, ADA, MODULA-2 and FORTRAN 8x,},\njournal = {Journal for Pascal, Ada & C},\nyear = {1990},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGap,\n  author = {G. Bohlender and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {The Module Concepts in PASCAL-SC, ADA, MODULA-2 and FORTRAN 8x,},\n  journal = {Journal for Pascal, Ada & C},\n  year = {1990},\n  tags = {Reliability}\n}\n
\n\n',NULL,'The Module Concepts in PASCAL-SC, ADA, MODULA-2 and FORTRAN 8x,',0,0,1990,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(969,'paper','WvGaq','article','@article{WvGaq,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Modelling SIMD - Type Parallel Arithmetic Operations in Ada},\n journal = {in D. Christodoulakis (Ed.): Ada: The Choice for \'92, LNCS 499, Springer Berlin 1991},\n year = {1991},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nModelling simd - type parallel arithmetic operations in ada.\nin D. Christodoulakis (Ed.): Ada: The Choice for \'92, LNCS 499,\nSpringer Berlin 1991, 1991.\n[ bib  ] 
\n@article{WvGaq,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Modelling SIMD - Type Parallel Arithmetic Operations in Ada},\njournal = {in D. Christodoulakis (Ed.): Ada: The Choice for \'92, LNCS 499, Springer Berlin 1991},\nyear = {1991},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGaq,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Modelling SIMD - Type Parallel Arithmetic Operations in Ada},\n  journal = {in D. Christodoulakis (Ed.): Ada: The Choice for \'92, LNCS 499, Springer Berlin 1991},\n  year = {1991},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Modelling SIMD - Type Parallel Arithmetic Operations in Ada',0,0,1991,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(970,'paper','WvGar','article','@article{WvGar,\n author = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Implementation of Arithmetic for Scientific Computation in ADA},\n journal = {\"Journal for Pascal, Ada & C},\n year = {1989},\n tags = {Reliability},\n}\n\n','\n\nR. Klatte, Ch. Ullrich, and Jürgen Wolff von Gudenberg.\nImplementation of arithmetic for scientific computation in ada.\n\"Journal for Pascal, Ada & C, 1989.\n[ bib  ] 
\n@article{WvGar,\nauthor = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Implementation of Arithmetic for Scientific Computation in ADA},\njournal = {\"Journal for Pascal, Ada & C},\nyear = {1989},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGar,\n  author = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Implementation of Arithmetic for Scientific Computation in ADA},\n  journal = {\"Journal for Pascal, Ada & C},\n  year = {1989},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Implementation of Arithmetic for Scientific Computation in ADA',0,0,1989,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(971,'paper','WvGas','techreport','@techreport{WvGas,\n author = {L. Bamberger and H.C. Fischer and G. Schumacher and D. Winter and A. Z\\\"{o}llner and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Local Transformations to obtain Accuracy ESPRIT-DIAMOND consortium},\n institution = {Deliverable D2a-5, 1988},\n year = {1988},\n tags = {Reliability},\n}\n\n','\n\nL. Bamberger, H.C. Fischer, G. Schumacher, D. Winter, A. Zöllner, and\nJürgen Wolff von Gudenberg.\nLocal transformations to obtain accuracy esprit-diamond consortium.\nTechnical report, Deliverable D2a-5, 1988, 1988.\n[ bib  ] 
\n@techreport{WvGas,\nauthor = {L. Bamberger and H.C. Fischer and G. Schumacher and D. Winter and A. Z\\\"{o}llner and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Local Transformations to obtain Accuracy ESPRIT-DIAMOND consortium},\ninstitution = {Deliverable D2a-5, 1988},\nyear = {1988},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGas,\n  author = {L. Bamberger and H.C. Fischer and G. Schumacher and D. Winter and A. Z\\\"{o}llner and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Local Transformations to obtain Accuracy ESPRIT-DIAMOND consortium},\n  institution = {Deliverable D2a-5, 1988},\n  year = {1988},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Local Transformations to obtain Accuracy ESPRIT-DIAMOND consortium',0,0,1988,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(972,'paper','WvGat','techreport','@techreport{WvGat,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Grundroutinen f\\\"{u}r sichere, numerische Algorithmen auf Parallelrechnern},\n institution = {Wiss. Zeitschrift der TH Leipzig 15, p.421-426, 1991},\n year = {1991},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nGrundroutinen für sichere, numerische algorithmen auf\nparallelrechnern.\nTechnical report, Wiss. Zeitschrift der TH Leipzig 15, p.421-426,\n1991, 1991.\n[ bib  ] 
\n@techreport{WvGat,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Grundroutinen f\\\"{u}r sichere, numerische Algorithmen auf Parallelrechnern},\ninstitution = {Wiss. Zeitschrift der TH Leipzig 15, p.421-426, 1991},\nyear = {1991},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGat,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Grundroutinen f\\\"{u}r sichere, numerische Algorithmen auf Parallelrechnern},\n  institution = {Wiss. Zeitschrift der TH Leipzig 15, p.421-426, 1991},\n  year = {1991},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Grundroutinen f\\\"{u}r sichere, numerische Algorithmen auf Parallelrechnern',0,0,1991,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(973,'paper','WvGau','techreport','@techreport{WvGau,\n author = {W. Klein and M. Erl and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Verified Results for Linear Systems with Sparse Matrices. ESPRIT DIAMOND consortium},\n institution = {Deliverable D3-3, 1988},\n year = {1988},\n tags = {Reliability},\n}\n\n','\n\nW. Klein, M. Erl, and Jürgen Wolff von Gudenberg.\nVerified results for linear systems with sparse matrices. esprit\ndiamond consortium.\nTechnical report, Deliverable D3-3, 1988, 1988.\n[ bib  ] 
\n@techreport{WvGau,\nauthor = {W. Klein and M. Erl and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Verified Results for Linear Systems with Sparse Matrices. ESPRIT DIAMOND consortium},\ninstitution = {Deliverable D3-3, 1988},\nyear = {1988},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGau,\n  author = {W. Klein and M. Erl and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Verified Results for Linear Systems with Sparse Matrices. ESPRIT DIAMOND consortium},\n  institution = {Deliverable D3-3, 1988},\n  year = {1988},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Verified Results for Linear Systems with Sparse Matrices. ESPRIT DIAMOND consortium',0,0,1988,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(974,'paper','WvGav','article','@article{WvGav,\n author = {G. Schumacher and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Highly Accurate Numerical Algorithms},\n journal = {in Ullrich/ Wolff von Gudenberg (Eds.), Accurate Numerical Algorithms, Springer, p. 1-58, 1989},\n year = {1989},\n tags = {Reliability},\n}\n\n','\n\nG. Schumacher and Jürgen Wolff von Gudenberg.\nHighly accurate numerical algorithms.\nin Ullrich/ Wolff von Gudenberg (Eds.), Accurate Numerical\nAlgorithms, Springer, p. 1-58, 1989, 1989.\n[ bib  ] 
\n@article{WvGav,\nauthor = {G. Schumacher and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Highly Accurate Numerical Algorithms},\njournal = {in Ullrich/ Wolff von Gudenberg (Eds.), Accurate Numerical Algorithms, Springer, p. 1-58, 1989},\nyear = {1989},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGav,\n  author = {G. Schumacher and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Highly Accurate Numerical Algorithms},\n  journal = {in Ullrich/ Wolff von Gudenberg (Eds.), Accurate Numerical Algorithms, Springer, p. 1-58, 1989},\n  year = {1989},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Highly Accurate Numerical Algorithms',0,0,1989,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(975,'paper','WvGaw','article','@article{WvGaw,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Accurate Matrix Operations on Hypercube Computers},\n journal = {in J. Herzberger, L. Atanassova (eds): Computer Arithmetic and Closure Methods, North Holland, p. 167-176, 1992},\n year = {1992},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nAccurate matrix operations on hypercube computers.\nin J. Herzberger, L. Atanassova (eds): Computer Arithmetic and\nClosure Methods, North Holland, p. 167-176, 1992, 1992.\n[ bib  ] 
\n@article{WvGaw,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Accurate Matrix Operations on Hypercube Computers},\njournal = {in J. Herzberger, L. Atanassova (eds): Computer Arithmetic and Closure Methods, North Holland, p. 167-176, 1992},\nyear = {1992},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGaw,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Accurate Matrix Operations on Hypercube Computers},\n  journal = {in J. Herzberger, L. Atanassova (eds): Computer Arithmetic and Closure Methods, North Holland, p. 167-176, 1992},\n  year = {1992},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Accurate Matrix Operations on Hypercube Computers',0,0,1992,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(976,'paper','WvGax','article','@article{WvGax,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Programming Language Support for Scientific Computation},\n journal = {Proceedings of INTERVAL-92, Moskau, 1992 und Interval ComputationsNo. 4(6), p.116-126, 1992},\n year = {1992},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nProgramming language support for scientific computation.\nProceedings of INTERVAL-92, Moskau, 1992 und Interval\nComputationsNo. 4(6), p.116-126, 1992, 1992.\n[ bib  ] 
\n@article{WvGax,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Programming Language Support for Scientific Computation},\njournal = {Proceedings of INTERVAL-92, Moskau, 1992 und Interval ComputationsNo. 4(6), p.116-126, 1992},\nyear = {1992},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGax,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Programming Language Support for Scientific Computation},\n  journal = {Proceedings of INTERVAL-92, Moskau, 1992 und Interval ComputationsNo. 4(6), p.116-126, 1992},\n  year = {1992},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Programming Language Support for Scientific Computation',0,0,1992,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(977,'paper','WvGay','article','@article{WvGay,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Arithmetische und programmiersprachliche Werkzeuge f\\\"{u}r die Numerik (Teil 2)},\n journal = {Computer Theoretikum und Praktikum f\\\"{u}r Physiker, No. 6, 1993},\n year = {1993},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nArithmetische und programmiersprachliche werkzeuge für die\nnumerik (teil 2).\nComputer Theoretikum und Praktikum für Physiker, No. 6,\n1993, 1993.\n[ bib  ] 
\n@article{WvGay,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Arithmetische und programmiersprachliche Werkzeuge f\\\"{u}r die Numerik (Teil 2)},\njournal = {Computer Theoretikum und Praktikum f\\\"{u}r Physiker, No. 6, 1993},\nyear = {1993},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGay,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Arithmetische und programmiersprachliche Werkzeuge f\\\"{u}r die Numerik (Teil 2)},\n  journal = {Computer Theoretikum und Praktikum f\\\"{u}r Physiker, No. 6, 1993},\n  year = {1993},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Arithmetische und programmiersprachliche Werkzeuge f\\\"{u}r die Numerik (Teil 2)',0,0,1993,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(978,'paper','WvGaz','article','@article{WvGaz,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Implementation of Accurate Matrix Multiplication on the CM-2},\n journal = {Computing Suppl. 9, p.287-291, 1993},\n year = {1993},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nImplementation of accurate matrix multiplication on the cm-2.\nComputing Suppl. 9, p.287-291, 1993, 1993.\n[ bib  ] 
\n@article{WvGaz,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Implementation of Accurate Matrix Multiplication on the CM-2},\njournal = {Computing Suppl. 9, p.287-291, 1993},\nyear = {1993},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGaz,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Implementation of Accurate Matrix Multiplication on the CM-2},\n  journal = {Computing Suppl. 9, p.287-291, 1993},\n  year = {1993},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Implementation of Accurate Matrix Multiplication on the CM-2',0,0,1993,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(979,'paper','WvGba','article','@article{WvGba,\n author = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {PASCAL-SC and Numerical and Non Numerical Applications},\n journal = {in B. Krause, A. Schreiner (Eds) HECTOR Vol. 1, New Ways in Education and Research, Springer, Berlin 1988},\n year = {1988},\n tags = {Reliability},\n}\n\n','\n\nR. Klatte, Ch. Ullrich, and Jürgen Wolff von Gudenberg.\nPascal-sc and numerical and non numerical applications.\nin B. Krause, A. Schreiner (Eds) HECTOR Vol. 1, New Ways in\nEducation and Research, Springer, Berlin 1988, 1988.\n[ bib  ] 
\n@article{WvGba,\nauthor = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {PASCAL-SC and Numerical and Non Numerical Applications},\njournal = {in B. Krause, A. Schreiner (Eds) HECTOR Vol. 1, New Ways in Education and Research, Springer, Berlin 1988},\nyear = {1988},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGba,\n  author = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {PASCAL-SC and Numerical and Non Numerical Applications},\n  journal = {in B. Krause, A. Schreiner (Eds) HECTOR Vol. 1, New Ways in Education and Research, Springer, Berlin 1988},\n  year = {1988},\n  tags = {Reliability}\n}\n
\n\n',NULL,'PASCAL-SC and Numerical and Non Numerical Applications',0,0,1988,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(980,'paper','WvGbb','techreport','@techreport{WvGbb,\n author = {M. Neaga and J\\\"{u}rgen Wolff von Gudenberg},\n title = {The PASCAL-SC level 2 Compiler},\n institution = {Architecture and Implementation Description, ESPRIT DIAMOND consotium, Deliverable D1-1, 1988},\n year = {1988},\n tags = {Reliability},\n}\n\n','\n\nM. Neaga and Jürgen Wolff von Gudenberg.\nThe pascal-sc level 2 compiler.\nTechnical report, Architecture and Implementation Description, ESPRIT\nDIAMOND consotium, Deliverable D1-1, 1988, 1988.\n[ bib  ] 
\n@techreport{WvGbb,\nauthor = {M. Neaga and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {The PASCAL-SC level 2 Compiler},\ninstitution = {Architecture and Implementation Description, ESPRIT DIAMOND consotium, Deliverable D1-1, 1988},\nyear = {1988},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGbb,\n  author = {M. Neaga and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {The PASCAL-SC level 2 Compiler},\n  institution = {Architecture and Implementation Description, ESPRIT DIAMOND consotium, Deliverable D1-1, 1988},\n  year = {1988},\n  tags = {Reliability}\n}\n
\n\n',NULL,'The PASCAL-SC level 2 Compiler',0,0,1988,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(981,'paper','WvGbc','article','@article{WvGbc,\n author = {G. Bohlender and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {New Developments in PASCAL-SC},\n journal = {SIGPLAN Notices, Vol 23, No 8, p. 83-92, 1988},\n year = {1988},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, Ch. Ullrich, and Jürgen Wolff von Gudenberg.\nNew developments in pascal-sc.\nSIGPLAN Notices, Vol 23, No 8, p. 83-92, 1988, 1988.\n[ bib  ] 
\n@article{WvGbc,\nauthor = {G. Bohlender and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {New Developments in PASCAL-SC},\njournal = {SIGPLAN Notices, Vol 23, No 8, p. 83-92, 1988},\nyear = {1988},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbc,\n  author = {G. Bohlender and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {New Developments in PASCAL-SC},\n  journal = {SIGPLAN Notices, Vol 23, No 8, p. 83-92, 1988},\n  year = {1988},\n  tags = {Reliability}\n}\n
\n\n',NULL,'New Developments in PASCAL-SC',0,0,1988,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(982,'paper','WvGbd','techreport','@techreport{WvGbd,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Comparison of Accurate Dot Product Algorithms},\n institution = {Research report 881IRISA, Rennes 1994},\n year = {1994},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nComparison of accurate dot product algorithms.\nTechnical report, Research report 881IRISA, Rennes 1994, 1994.\n[ bib  ] 
\n@techreport{WvGbd,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Comparison of Accurate Dot Product Algorithms},\ninstitution = {Research report 881IRISA, Rennes 1994},\nyear = {1994},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGbd,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Comparison of Accurate Dot Product Algorithms},\n  institution = {Research report 881IRISA, Rennes 1994},\n  year = {1994},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Comparison of Accurate Dot Product Algorithms',0,0,1994,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(983,'paper','WvGbe','techreport','@techreport{WvGbe,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Parallelisierung mittels einer Klassenbibliothek},\n institution = {Tagungsberichte GI FG 2.1.4 Alternative Sprachen und Konzepte, Universit\\\"{a}t Koblenz, 1995},\n year = {1995},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nParallelisierung mittels einer klassenbibliothek.\nTechnical report, Tagungsberichte GI FG 2.1.4 Alternative Sprachen\nund Konzepte, Universität Koblenz, 1995, 1995.\n[ bib  ] 
\n@techreport{WvGbe,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Parallelisierung mittels einer Klassenbibliothek},\ninstitution = {Tagungsberichte GI FG 2.1.4 Alternative Sprachen und Konzepte, Universit\\\"{a}t Koblenz, 1995},\nyear = {1995},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGbe,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Parallelisierung mittels einer Klassenbibliothek},\n  institution = {Tagungsberichte GI FG 2.1.4 Alternative Sprachen und Konzepte, Universit\\\"{a}t Koblenz, 1995},\n  year = {1995},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Parallelisierung mittels einer Klassenbibliothek',0,0,1995,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(984,'paper','WvGbf','techreport','@techreport{WvGbf,\n author = {M. Neaga and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Implementation of Dynamic Arrays in PASCAL-SC},\n institution = {ESPRIT DIAMOND consortium, No. 03/1-1/2/K2, 1987},\n year = {1987},\n tags = {Reliability},\n}\n\n','\n\nM. Neaga and Jürgen Wolff von Gudenberg.\nImplementation of dynamic arrays in pascal-sc.\nTechnical report, ESPRIT DIAMOND consortium, No. 03/1-1/2/K2, 1987,\n1987.\n[ bib  ] 
\n@techreport{WvGbf,\nauthor = {M. Neaga and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Implementation of Dynamic Arrays in PASCAL-SC},\ninstitution = {ESPRIT DIAMOND consortium, No. 03/1-1/2/K2, 1987},\nyear = {1987},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGbf,\n  author = {M. Neaga and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Implementation of Dynamic Arrays in PASCAL-SC},\n  institution = {ESPRIT DIAMOND consortium, No. 03/1-1/2/K2, 1987},\n  year = {1987},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Implementation of Dynamic Arrays in PASCAL-SC',0,0,1987,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(985,'paper','WvGbg','article','@article{WvGbg,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Hardware Support for Interval Arithmetic - Extended Version},\n journal = {Inst. f\\\"{u}r Informatik, Universit\\\"{a}t W\"{u}rzburg, Bericht Nr. 125, 1995},\n year = {1995},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nHardware support for interval arithmetic - extended version.\nInst. für Informatik, Universität W\"urzburg, Bericht\nNr. 125, 1995, 1995.\n[ bib  ] 
\n@article{WvGbg,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Hardware Support for Interval Arithmetic - Extended Version},\njournal = {Inst. f\\\"{u}r Informatik, Universit\\\"{a}t W\"{u}rzburg, Bericht Nr. 125, 1995},\nyear = {1995},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbg,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Hardware Support for Interval Arithmetic - Extended Version},\n  journal = {Inst. f\\\"{u}r Informatik, Universit\\\"{a}t W\"{u}rzburg, Bericht Nr. 125, 1995},\n  year = {1995},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Hardware Support for Interval Arithmetic - Extended Version',0,0,1995,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(986,'paper','WvGbh','article','@article{WvGbh,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Design of a Parallel Linear Algebra Library for Verified Computation},\n journal = {Reliable Computing, 1 (4), p.411-420, 1995},\n year = {1995},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nDesign of a parallel linear algebra library for verified computation.\nReliable Computing, 1 (4), p.411-420, 1995, 1995.\n[ bib  ] 
\n@article{WvGbh,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Design of a Parallel Linear Algebra Library for Verified Computation},\njournal = {Reliable Computing, 1 (4), p.411-420, 1995},\nyear = {1995},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbh,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Design of a Parallel Linear Algebra Library for Verified Computation},\n  journal = {Reliable Computing, 1 (4), p.411-420, 1995},\n  year = {1995},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Design of a Parallel Linear Algebra Library for Verified Computation',0,0,1995,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(987,'paper','WvGbi','article','@article{WvGbi,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Parallel Accurate Linear Algebra Subroutines},\n journal = {Reliable Computing, 1 (2), p.189-199, 1995},\n year = {1995},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nParallel accurate linear algebra subroutines.\nReliable Computing, 1 (2), p.189-199, 1995, 1995.\n[ bib  ] 
\n@article{WvGbi,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Parallel Accurate Linear Algebra Subroutines},\njournal = {Reliable Computing, 1 (2), p.189-199, 1995},\nyear = {1995},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbi,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Parallel Accurate Linear Algebra Subroutines},\n  journal = {Reliable Computing, 1 (2), p.189-199, 1995},\n  year = {1995},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Parallel Accurate Linear Algebra Subroutines',0,0,1995,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(988,'paper','WvGbj','techreport','@techreport{WvGbj,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Structure of a C++ Library for Parallel Accurate Linear Algebra},\n institution = {in Alefeld/ Mahrenholtz/ Mennicken(eds.) Numerical Analysis, Scientific Computing, Computer Science ICIAM 95 Proceedings, Akademie Verlag ISBN 3-05-501744-7, 1996},\n year = {1996},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nStructure of a c++ library for parallel accurate linear algebra.\nTechnical report, in Alefeld/ Mahrenholtz/ Mennicken(eds.) Numerical\nAnalysis, Scientific Computing, Computer Science ICIAM 95 Proceedings,\nAkademie Verlag ISBN 3-05-501744-7, 1996, 1996.\n[ bib  ] 
\n@techreport{WvGbj,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Structure of a C++ Library for Parallel Accurate Linear Algebra},\ninstitution = {in Alefeld/ Mahrenholtz/ Mennicken(eds.) Numerical Analysis, Scientific Computing, Computer Science ICIAM 95 Proceedings, Akademie Verlag ISBN 3-05-501744-7, 1996},\nyear = {1996},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGbj,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Structure of a C++ Library for Parallel Accurate Linear Algebra},\n  institution = {in Alefeld/ Mahrenholtz/ Mennicken(eds.) Numerical Analysis, Scientific Computing, Computer Science ICIAM 95 Proceedings, Akademie Verlag ISBN 3-05-501744-7, 1996},\n  year = {1996},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Structure of a C++ Library for Parallel Accurate Linear Algebra',0,0,1996,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(989,'paper','WvGbk','article','@article{WvGbk,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Hardware Support for Interval Arithmetic},\n journal = {in Alefeld/ Frommer/ Lang (eds.) Scientific Computing and Validated Numerics, Akademie Verlag, p. 32-37, 1996},\n year = {1996},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nHardware support for interval arithmetic.\nin Alefeld/ Frommer/ Lang (eds.) Scientific Computing and\nValidated Numerics, Akademie Verlag, p. 32-37, 1996, 1996.\n[ bib  ] 
\n@article{WvGbk,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Hardware Support for Interval Arithmetic},\njournal = {in Alefeld/ Frommer/ Lang (eds.) Scientific Computing and Validated Numerics, Akademie Verlag, p. 32-37, 1996},\nyear = {1996},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbk,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Hardware Support for Interval Arithmetic},\n  journal = {in Alefeld/ Frommer/ Lang (eds.) Scientific Computing and Validated Numerics, Akademie Verlag, p. 32-37, 1996},\n  year = {1996},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Hardware Support for Interval Arithmetic',0,0,1996,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(990,'paper','WvGbl','article','@article{WvGbl,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Objektorientierter Entwurf im wissenschaftlichen Rechnen},\n journal = {in Mackens/ Rump (eds.) Software Engineering im Scientific Computing, Vieweg, p. 31-37, 1996},\n year = {1996},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nObjektorientierter entwurf im wissenschaftlichen rechnen.\nin Mackens/ Rump (eds.) Software Engineering im Scientific\nComputing, Vieweg, p. 31-37, 1996, 1996.\n[ bib  ] 
\n@article{WvGbl,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Objektorientierter Entwurf im wissenschaftlichen Rechnen},\njournal = {in Mackens/ Rump (eds.) Software Engineering im Scientific Computing, Vieweg, p. 31-37, 1996},\nyear = {1996},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbl,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Objektorientierter Entwurf im wissenschaftlichen Rechnen},\n  journal = {in Mackens/ Rump (eds.) Software Engineering im Scientific Computing, Vieweg, p. 31-37, 1996},\n  year = {1996},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Objektorientierter Entwurf im wissenschaftlichen Rechnen',0,0,1996,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(991,'paper','WvGbm','article','@article{WvGbm,\n author = {M. Lerch and W. Wiechert and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Objektorientierte Entwurfsmuster f\\\"{u}r die Wiederverwendung numerischer Softwarekomponenten},\n journal = {in Mackens/ Rump (eds.) Software Engineering im Scientific Computing, Vieweg, p. 51-62, 1996},\n year = {1996},\n tags = {Reliability},\n}\n\n','\n\nM. Lerch, W. Wiechert, and Jürgen Wolff von Gudenberg.\nObjektorientierte entwurfsmuster für die wiederverwendung\nnumerischer softwarekomponenten.\nin Mackens/ Rump (eds.) Software Engineering im Scientific\nComputing, Vieweg, p. 51-62, 1996, 1996.\n[ bib  ] 
\n@article{WvGbm,\nauthor = {M. Lerch and W. Wiechert and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Objektorientierte Entwurfsmuster f\\\"{u}r die Wiederverwendung numerischer Softwarekomponenten},\njournal = {in Mackens/ Rump (eds.) Software Engineering im Scientific Computing, Vieweg, p. 51-62, 1996},\nyear = {1996},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbm,\n  author = {M. Lerch and W. Wiechert and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Objektorientierte Entwurfsmuster f\\\"{u}r die Wiederverwendung numerischer Softwarekomponenten},\n  journal = {in Mackens/ Rump (eds.) Software Engineering im Scientific Computing, Vieweg, p. 51-62, 1996},\n  year = {1996},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Objektorientierte Entwurfsmuster f\\\"{u}r die Wiederverwendung numerischer Softwarekomponenten',0,0,1996,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(992,'paper','WvGbn','techreport','@techreport{WvGbn,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Objektorientiertes Programmieren im wissenschaftlichen Rechnen},\n institution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 181, Sept. 1997},\n year = {1997},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nObjektorientiertes programmieren im wissenschaftlichen rechnen.\nTechnical report, Inst. f. Informatik, Universität W\"urzburg,\nTR 181, Sept. 1997, 1997.\n[ bib  ] 
\n@techreport{WvGbn,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Objektorientiertes Programmieren im wissenschaftlichen Rechnen},\ninstitution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 181, Sept. 1997},\nyear = {1997},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGbn,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Objektorientiertes Programmieren im wissenschaftlichen Rechnen},\n  institution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 181, Sept. 1997},\n  year = {1997},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Objektorientiertes Programmieren im wissenschaftlichen Rechnen',0,0,1997,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(993,'paper','WvGbo','techreport','@techreport{WvGbo,\n author = {M. Neaga and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Functional and Design Specification of the PASCAL-SC Compiler: Pass 1},\n institution = {ESPRIT DIAMOND consortium, No. 03/1/1/K1, 1986},\n year = {1986},\n tags = {Reliability},\n}\n\n','\n\nM. Neaga and Jürgen Wolff von Gudenberg.\nFunctional and design specification of the pascal-sc compiler: Pass\n1.\nTechnical report, ESPRIT DIAMOND consortium, No. 03/1/1/K1, 1986,\n1986.\n[ bib  ] 
\n@techreport{WvGbo,\nauthor = {M. Neaga and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Functional and Design Specification of the PASCAL-SC Compiler: Pass 1},\ninstitution = {ESPRIT DIAMOND consortium, No. 03/1/1/K1, 1986},\nyear = {1986},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGbo,\n  author = {M. Neaga and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Functional and Design Specification of the PASCAL-SC Compiler: Pass 1},\n  institution = {ESPRIT DIAMOND consortium, No. 03/1/1/K1, 1986},\n  year = {1986},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Functional and Design Specification of the PASCAL-SC Compiler: Pass 1',0,0,1986,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(994,'paper','WvGbp','article','@article{WvGbp,\n author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Eine OMT-Beschreibung durch attributierte Grammatiken und Hornklauseln},\n journal = {(Abstract), Softwaretechnik-Trends, 1997},\n year = {1997},\n tags = {Reliability},\n}\n\n','\n\nJ. Seemann and Jürgen Wolff von Gudenberg.\nEine omt-beschreibung durch attributierte grammatiken und\nhornklauseln.\n(Abstract), Softwaretechnik-Trends, 1997, 1997.\n[ bib  ] 
\n@article{WvGbp,\nauthor = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Eine OMT-Beschreibung durch attributierte Grammatiken und Hornklauseln},\njournal = {(Abstract), Softwaretechnik-Trends, 1997},\nyear = {1997},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbp,\n  author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Eine OMT-Beschreibung durch attributierte Grammatiken und Hornklauseln},\n  journal = {(Abstract), Softwaretechnik-Trends, 1997},\n  year = {1997},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Eine OMT-Beschreibung durch attributierte Grammatiken und Hornklauseln',0,0,1997,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(995,'paper','WvGbq','techreport','@techreport{WvGbq,\n author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n title = {OMT-Script eine Programmiersprache f\\\"{u}r objektorientierten Entwurf},\n institution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 187, Okt. 1997},\n year = {1997},\n tags = {Reliability},\n}\n\n','\n\nJ. Seemann and Jürgen Wolff von Gudenberg.\nOmt-script eine programmiersprache für objektorientierten\nentwurf.\nTechnical report, Inst. f. Informatik, Universität W\"urzburg,\nTR 187, Okt. 1997, 1997.\n[ bib  ] 
\n@techreport{WvGbq,\nauthor = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {OMT-Script eine Programmiersprache f\\\"{u}r objektorientierten Entwurf},\ninstitution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 187, Okt. 1997},\nyear = {1997},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGbq,\n  author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {OMT-Script eine Programmiersprache f\\\"{u}r objektorientierten Entwurf},\n  institution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 187, Okt. 1997},\n  year = {1997},\n  tags = {Reliability}\n}\n
\n\n',NULL,'OMT-Script eine Programmiersprache f\\\"{u}r objektorientierten Entwurf',0,0,1997,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:08',0),(996,'paper','WvGbr','article','@article{WvGbr,\n author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n title = {UMLscript A Programming Language for Object-Oriented Design},\n journal = {Proceedings of the UML-Workshop 97, Physika-Verlag, p.160-169, 1998},\n year = {1998},\n tags = {Reliability},\n}\n\n','\n\nJ. Seemann and Jürgen Wolff von Gudenberg.\nUmlscript a programming language for object-oriented design.\nProceedings of the UML-Workshop 97, Physika-Verlag, p.160-169,\n1998, 1998.\n[ bib  ] 
\n@article{WvGbr,\nauthor = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {UMLscript A Programming Language for Object-Oriented Design},\njournal = {Proceedings of the UML-Workshop 97, Physika-Verlag, p.160-169, 1998},\nyear = {1998},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbr,\n  author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {UMLscript A Programming Language for Object-Oriented Design},\n  journal = {Proceedings of the UML-Workshop 97, Physika-Verlag, p.160-169, 1998},\n  year = {1998},\n  tags = {Reliability}\n}\n
\n\n',NULL,'UMLscript A Programming Language for Object-Oriented Design',0,0,1998,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:08',0),(997,'paper','WvGbs','article','@article{WvGbs,\n author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Visualization of Differences between Versions of Object-Oriented Sofware},\n journal = {Proc. of 2nd Euromicro Working Conference on Software Maintenance and Reengineering, IEEE, p.~201-204, 1998},\n year = {1998},\n tags = {Reliability},\n}\n\n','\n\nJ. Seemann and Jürgen Wolff von Gudenberg.\nVisualization of differences between versions of object-oriented\nsofware.\nProc. of 2nd Euromicro Working Conference on Software\nMaintenance and Reengineering, IEEE, p. 201-204, 1998, 1998.\n[ bib  ] 
\n@article{WvGbs,\nauthor = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Visualization of Differences between Versions of Object-Oriented Sofware},\njournal = {Proc. of 2nd Euromicro Working Conference on Software Maintenance and Reengineering, IEEE, p.~201-204, 1998},\nyear = {1998},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbs,\n  author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Visualization of Differences between Versions of Object-Oriented Sofware},\n  journal = {Proc. of 2nd Euromicro Working Conference on Software Maintenance and Reengineering, IEEE, p.~201-204, 1998},\n  year = {1998},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Visualization of Differences between Versions of Object-Oriented Sofware',0,0,1998,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:08',0),(998,'paper','WvGbt','article','@article{WvGbt,\n author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Aktuelles Schlagwort UML Unified Modeling Language},\n journal = {Informatik Spekrum 21, p.89-90, 1998},\n year = {1998},\n tags = {Reliability},\n}\n\n','\n\nJ. Seemann and Jürgen Wolff von Gudenberg.\nAktuelles schlagwort uml unified modeling language.\nInformatik Spekrum 21, p.89-90, 1998, 1998.\n[ bib  ] 
\n@article{WvGbt,\nauthor = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Aktuelles Schlagwort UML Unified Modeling Language},\njournal = {Informatik Spekrum 21, p.89-90, 1998},\nyear = {1998},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbt,\n  author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Aktuelles Schlagwort UML Unified Modeling Language},\n  journal = {Informatik Spekrum 21, p.89-90, 1998},\n  year = {1998},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Aktuelles Schlagwort UML Unified Modeling Language',0,0,1998,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:08',0),(999,'paper','WvGbu','article','@article{WvGbu,\n author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Extension of UML Sequence Diagrams for Real-Time Systems},\n journal = {International UML Workshop, Mulhouse, June 1998, und LNCS 1618, Springer, 1999},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nJ. Seemann and Jürgen Wolff von Gudenberg.\nExtension of uml sequence diagrams for real-time systems.\nInternational UML Workshop, Mulhouse, June 1998, und LNCS 1618,\nSpringer, 1999, 1999.\n[ bib  ] 
\n@article{WvGbu,\nauthor = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Extension of UML Sequence Diagrams for Real-Time Systems},\njournal = {International UML Workshop, Mulhouse, June 1998, und LNCS 1618, Springer, 1999},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbu,\n  author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Extension of UML Sequence Diagrams for Real-Time Systems},\n  journal = {International UML Workshop, Mulhouse, June 1998, und LNCS 1618, Springer, 1999},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Extension of UML Sequence Diagrams for Real-Time Systems',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:08',0),(1000,'paper','WvGbv','article','@article{WvGbv,\n author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Pattern-Based Design Recovery of Java Software},\n journal = {Symposium on Foundations of Software Engineering, FSE-6, p. 10-16, ACM, 1998},\n year = {1998},\n tags = {Reliability},\n}\n\n','\n\nJ. Seemann and Jürgen Wolff von Gudenberg.\nPattern-based design recovery of java software.\nSymposium on Foundations of Software Engineering, FSE-6, p.\n10-16, ACM, 1998, 1998.\n[ bib  ] 
\n@article{WvGbv,\nauthor = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Pattern-Based Design Recovery of Java Software},\njournal = {Symposium on Foundations of Software Engineering, FSE-6, p. 10-16, ACM, 1998},\nyear = {1998},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbv,\n  author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Pattern-Based Design Recovery of Java Software},\n  journal = {Symposium on Foundations of Software Engineering, FSE-6, p. 10-16, ACM, 1998},\n  year = {1998},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Pattern-Based Design Recovery of Java Software',0,0,1998,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:08',0),(1001,'paper','WvGbw','article','@article{WvGbw,\n author = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Parallel Accurate Linear Algebra in Java},\n journal = {(Abstract) Reliable Computing 5 (1), p. 99, 1999},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nM. Lerch and Jürgen Wolff von Gudenberg.\nParallel accurate linear algebra in java.\n(Abstract) Reliable Computing 5 (1), p. 99, 1999, 1999.\n[ bib  ] 
\n@article{WvGbw,\nauthor = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Parallel Accurate Linear Algebra in Java},\njournal = {(Abstract) Reliable Computing 5 (1), p. 99, 1999},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbw,\n  author = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Parallel Accurate Linear Algebra in Java},\n  journal = {(Abstract) Reliable Computing 5 (1), p. 99, 1999},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Parallel Accurate Linear Algebra in Java',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:08',0),(1002,'paper','WvGbx','article','@article{WvGbx,\n author = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Expression Templates for Dotproduct Expressions},\n journal = {Interval 98, Reliable Computing 5 (1), p. 69-80, 1999},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nM. Lerch and Jürgen Wolff von Gudenberg.\nExpression templates for dotproduct expressions.\nInterval 98, Reliable Computing 5 (1), p. 69-80, 1999, 1999.\n[ bib  ] 
\n@article{WvGbx,\nauthor = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Expression Templates for Dotproduct Expressions},\njournal = {Interval 98, Reliable Computing 5 (1), p. 69-80, 1999},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbx,\n  author = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Expression Templates for Dotproduct Expressions},\n  journal = {Interval 98, Reliable Computing 5 (1), p. 69-80, 1999},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Expression Templates for Dotproduct Expressions',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:08',0),(1003,'paper','WvGby','article','@article{WvGby,\n author = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Multiaspect Interval Types},\n journal = {in Developments in Reliable Computing, T. Csendes (ed.), Kluwer, p. 365-372, 1999},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nM. Lerch and Jürgen Wolff von Gudenberg.\nMultiaspect interval types.\nin Developments in Reliable Computing, T. Csendes (ed.), Kluwer,\np. 365-372, 1999, 1999.\n[ bib  ] 
\n@article{WvGby,\nauthor = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Multiaspect Interval Types},\njournal = {in Developments in Reliable Computing, T. Csendes (ed.), Kluwer, p. 365-372, 1999},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGby,\n  author = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Multiaspect Interval Types},\n  journal = {in Developments in Reliable Computing, T. Csendes (ed.), Kluwer, p. 365-372, 1999},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Multiaspect Interval Types',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1004,'paper','WvGbz','techreport','@techreport{WvGbz,\n author = {G. Corliss and C. Hu and B. Kearfott and B. Walster and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Interval BLAS},\n institution = {chapter 5 of Document for the Basic Linear Algebra Subprograms, University of Tennessee, Knoxville, 1999},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nG. Corliss, C. Hu, B. Kearfott, B. Walster, and Jürgen Wolff von Gudenberg.\nInterval blas.\nTechnical report, chapter 5 of Document for the Basic Linear Algebra\nSubprograms, University of Tennessee, Knoxville, 1999, 1999.\n[ bib  ] 
\n@techreport{WvGbz,\nauthor = {G. Corliss and C. Hu and B. Kearfott and B. Walster and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Interval BLAS},\ninstitution = {chapter 5 of Document for the Basic Linear Algebra Subprograms, University of Tennessee, Knoxville, 1999},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGbz,\n  author = {G. Corliss and C. Hu and B. Kearfott and B. Walster and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Interval BLAS},\n  institution = {chapter 5 of Document for the Basic Linear Algebra Subprograms, University of Tennessee, Knoxville, 1999},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Interval BLAS',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1005,'paper','WvGca','article','@article{WvGca,\n author = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Arithmetic of Complex Sets},\n journal = {Nickel\'s Classical Paper Revisited from a Geometric Viewpoint\"},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nV. Kreinovich and Jürgen Wolff von Gudenberg.\nArithmetic of complex sets.\nNickel\'s Classical Paper Revisited from a Geometric Viewpoint\",\n1999.\n[ bib  ] 
\n@article{WvGca,\nauthor = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Arithmetic of Complex Sets},\njournal = {Nickel\'s Classical Paper Revisited from a Geometric Viewpoint\"},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGca,\n  author = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Arithmetic of Complex Sets},\n  journal = {Nickel\'s Classical Paper Revisited from a Geometric Viewpoint\"},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Arithmetic of Complex Sets',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1006,'paper','WvGcb','techreport','@techreport{WvGcb,\n author = {R. Kolla and A. Vodopivec and J\\\"{u}rgen Wolff von Gudenberg},\n title = {The IAX,Interval Arithmetic Extension Architecture},\n institution = {University of W\"{u}rzburg},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nR. Kolla, A. Vodopivec, and Jürgen Wolff von Gudenberg.\nThe iax,interval arithmetic extension architecture.\nTechnical report, University of W\"urzburg, 1999.\n[ bib  ] 
\n@techreport{WvGcb,\nauthor = {R. Kolla and A. Vodopivec and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {The IAX,Interval Arithmetic Extension Architecture},\ninstitution = {University of W\"{u}rzburg},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGcb,\n  author = {R. Kolla and A. Vodopivec and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {The IAX,Interval Arithmetic Extension Architecture},\n  institution = {University of W\"{u}rzburg},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'The IAX,Interval Arithmetic Extension Architecture',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1007,'paper','WvGcc','article','@article{WvGcc,\n author = {R. Kolla and A. Vodopivec and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Splitting Double Precision FPUs for Single Precision Interval Arithmetic},\n journal = {in W. Erhard et al. (Hrsg.) ARCS\'99 Workshops zur Architektur von Rechensystemen, Uni Jena, 1999, p.~5-16,1999},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nR. Kolla, A. Vodopivec, and Jürgen Wolff von Gudenberg.\nSplitting double precision fpus for single precision interval\narithmetic.\nin W. Erhard et al. (Hrsg.) ARCS\'99 Workshops zur Architektur\nvon Rechensystemen, Uni Jena, 1999, p. 5-16,1999, 1999.\n[ bib  ] 
\n@article{WvGcc,\nauthor = {R. Kolla and A. Vodopivec and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Splitting Double Precision FPUs for Single Precision Interval Arithmetic},\njournal = {in W. Erhard et al. (Hrsg.) ARCS\'99 Workshops zur Architektur von Rechensystemen, Uni Jena, 1999, p.~5-16,1999},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcc,\n  author = {R. Kolla and A. Vodopivec and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Splitting Double Precision FPUs for Single Precision Interval Arithmetic},\n  journal = {in W. Erhard et al. (Hrsg.) ARCS\'99 Workshops zur Architektur von Rechensystemen, Uni Jena, 1999, p.~5-16,1999},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Splitting Double Precision FPUs for Single Precision Interval Arithmetic',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1008,'paper','WvGcd','article','@article{WvGcd,\n author = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Candidate Sets for Complex Interval Arithmetic},\n journal = {in H. Mohanty, C. Baral: CIT 99 Trends in Information Technology, Tata McGraw-Hill, New Delhi, p. 230-233, 1999},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nV. Kreinovich and Jürgen Wolff von Gudenberg.\nCandidate sets for complex interval arithmetic.\nin H. Mohanty, C. Baral: CIT 99 Trends in Information\nTechnology, Tata McGraw-Hill, New Delhi, p. 230-233, 1999, 1999.\n[ bib  ] 
\n@article{WvGcd,\nauthor = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Candidate Sets for Complex Interval Arithmetic},\njournal = {in H. Mohanty, C. Baral: CIT 99 Trends in Information Technology, Tata McGraw-Hill, New Delhi, p. 230-233, 1999},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcd,\n  author = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Candidate Sets for Complex Interval Arithmetic},\n  journal = {in H. Mohanty, C. Baral: CIT 99 Trends in Information Technology, Tata McGraw-Hill, New Delhi, p. 230-233, 1999},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Candidate Sets for Complex Interval Arithmetic',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1009,'paper','WvGce','article','@article{WvGce,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Cheap Extension of Floating-Point Units for Interval Arithmetic},\n journal = {in Electronics \'99, Proceedings Vol. 1, TU Sofia, ISBN954-438-260-7, p.~96-101, 1999},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nCheap extension of floating-point units for interval arithmetic.\nin Electronics \'99, Proceedings Vol. 1, TU Sofia,\nISBN954-438-260-7, p. 96-101, 1999, 1999.\n[ bib  ] 
\n@article{WvGce,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Cheap Extension of Floating-Point Units for Interval Arithmetic},\njournal = {in Electronics \'99, Proceedings Vol. 1, TU Sofia, ISBN954-438-260-7, p.~96-101, 1999},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGce,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Cheap Extension of Floating-Point Units for Interval Arithmetic},\n  journal = {in Electronics \'99, Proceedings Vol. 1, TU Sofia, ISBN954-438-260-7, p.~96-101, 1999},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Cheap Extension of Floating-Point Units for Interval Arithmetic',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1010,'paper','WvGcf','article','@article{WvGcf,\n author = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\n title = {fi_lib++ Specification},\n journal = {Implementation and Test of a Library for Extended Interval Arithmetic, in P. Kornerup (ed.) RNC4 Fourth Real Numbers and Computers, p.~111-124, 2000, Online Proceedings RNC 4,},\n year = {2000},\n tags = {Reliability},\n}\n\n','\n\nM. Lerch and Jürgen Wolff von Gudenberg.\nfi_lib++ specification.\nImplementation and Test of a Library for Extended Interval\nArithmetic, in P. Kornerup (ed.) RNC4 Fourth Real Numbers and Computers,\np. 111-124, 2000, Online Proceedings RNC 4,, 2000.\n[ bib  ] 
\n@article{WvGcf,\nauthor = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {fi_lib++ Specification},\njournal = {Implementation and Test of a Library for Extended Interval Arithmetic, in P. Kornerup (ed.) RNC4 Fourth Real Numbers and Computers, p.~111-124, 2000, Online Proceedings RNC 4,},\nyear = {2000},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcf,\n  author = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {fi_lib++ Specification},\n  journal = {Implementation and Test of a Library for Extended Interval Arithmetic, in P. Kornerup (ed.) RNC4 Fourth Real Numbers and Computers, p.~111-124, 2000, Online Proceedings RNC 4,},\n  year = {2000},\n  tags = {Reliability}\n}\n
\n\n',NULL,'fi_lib++ Specification',0,0,2000,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1011,'paper','Wvcg','article','@article{Wvcg,\n author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n title = {UML Description of the STL},\n journal = {First Workshop on C++ Template Programming, Erfurt, Okt. 2000,},\n year = {2000},\n tags = {Reliability},\n}\n\n','\n\nH. Eichelberger and Jürgen Wolff von Gudenberg.\nUml description of the stl.\nFirst Workshop on C++ Template Programming, Erfurt, Okt. 2000,,\n2000.\n[ bib  ] 
\n@article{Wvcg,\nauthor = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {UML Description of the STL},\njournal = {First Workshop on C++ Template Programming, Erfurt, Okt. 2000,},\nyear = {2000},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{Wvcg,\n  author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {UML Description of the STL},\n  journal = {First Workshop on C++ Template Programming, Erfurt, Okt. 2000,},\n  year = {2000},\n  tags = {Reliability}\n}\n
\n\n',NULL,'UML Description of the STL',0,0,2000,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1012,'paper','WvGch','article','@article{WvGch,\n author = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {An Optimality Criterion for Arithmetic on Complex Sets},\n journal = {Geombinatorics (ISSN 1065-7371), Vol X, 1, p.~31-37, 2000},\n year = {2000},\n tags = {Reliability},\n}\n\n','\n\nV. Kreinovich and Jürgen Wolff von Gudenberg.\nAn optimality criterion for arithmetic on complex sets.\nGeombinatorics (ISSN 1065-7371), Vol X, 1, p. 31-37, 2000,\n2000.\n[ bib  ] 
\n@article{WvGch,\nauthor = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {An Optimality Criterion for Arithmetic on Complex Sets},\njournal = {Geombinatorics (ISSN 1065-7371), Vol X, 1, p.~31-37, 2000},\nyear = {2000},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGch,\n  author = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {An Optimality Criterion for Arithmetic on Complex Sets},\n  journal = {Geombinatorics (ISSN 1065-7371), Vol X, 1, p.~31-37, 2000},\n  year = {2000},\n  tags = {Reliability}\n}\n
\n\n',NULL,'An Optimality Criterion for Arithmetic on Complex Sets',0,0,2000,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1013,'paper','WvGci','techreport','@techreport{WvGci,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Software Engineering -- 30 Jahre Softwarekrise ?},\n institution = {Lehrerfortbildung,Inst. f. Informatik, Universit\\\"{a}tW\"{u}rzburg, Okt. 2000},\n year = {2000},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nSoftware engineering - 30 jahre softwarekrise ?\nTechnical report, Lehrerfortbildung,Inst. f. Informatik,\nUniversitätW\"urzburg, Okt. 2000, 2000.\n[ bib  ] 
\n@techreport{WvGci,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Software Engineering -- 30 Jahre Softwarekrise ?},\ninstitution = {Lehrerfortbildung,Inst. f. Informatik, Universit\\\"{a}tW\"{u}rzburg, Okt. 2000},\nyear = {2000},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGci,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Software Engineering -- 30 Jahre Softwarekrise ?},\n  institution = {Lehrerfortbildung,Inst. f. Informatik, Universit\\\"{a}tW\"{u}rzburg, Okt. 2000},\n  year = {2000},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Software Engineering -- 30 Jahre Softwarekrise ?',0,0,2000,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1014,'paper','WvGcj','techreport','@techreport{WvGcj,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Multimedia Architectures and Interval Arithmetic},\n institution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 265, Okt. 2000},\n year = {2000},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nMultimedia architectures and interval arithmetic.\nTechnical report, Inst. f. Informatik, Universität W\"urzburg,\nTR 265, Okt. 2000, 2000.\n[ bib  ] 
\n@techreport{WvGcj,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Multimedia Architectures and Interval Arithmetic},\ninstitution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 265, Okt. 2000},\nyear = {2000},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGcj,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Multimedia Architectures and Interval Arithmetic},\n  institution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 265, Okt. 2000},\n  year = {2000},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Multimedia Architectures and Interval Arithmetic',0,0,2000,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1015,'paper','WvGck','techreport','@techreport{WvGck,\n author = {H. Eichelberger and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Comprehensive Graphical Description of the STL},\n institution = {Inst. f. Informatik, Universit\\\"{a}tW\"{u}rzburg, TR 270, Feb. 2001},\n year = {2001},\n tags = {Reliability},\n}\n\n','\n\nH. Eichelberger, G. Tischler, and Jürgen Wolff von Gudenberg.\nComprehensive graphical description of the stl.\nTechnical report, Inst. f. Informatik, UniversitätW\"urzburg, TR\n270, Feb. 2001, 2001.\n[ bib  ] 
\n@techreport{WvGck,\nauthor = {H. Eichelberger and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Comprehensive Graphical Description of the STL},\ninstitution = {Inst. f. Informatik, Universit\\\"{a}tW\"{u}rzburg, TR 270, Feb. 2001},\nyear = {2001},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGck,\n  author = {H. Eichelberger and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Comprehensive Graphical Description of the STL},\n  institution = {Inst. f. Informatik, Universit\\\"{a}tW\"{u}rzburg, TR 270, Feb. 2001},\n  year = {2001},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Comprehensive Graphical Description of the STL',0,0,2001,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1016,'paper','WvGcl','article','@article{WvGcl,\n author = {G. Mayer and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Stichw\\\"{o}rter zur Intervallrechnung},\n journal = {Lexikon der Mathematik, Spektrum, 1999-2001},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nG. Mayer and Jürgen Wolff von Gudenberg.\nStichwörter zur intervallrechnung.\nLexikon der Mathematik, Spektrum, 1999-2001, 1999.\n[ bib  ] 
\n@article{WvGcl,\nauthor = {G. Mayer and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Stichw\\\"{o}rter zur Intervallrechnung},\njournal = {Lexikon der Mathematik, Spektrum, 1999-2001},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcl,\n  author = {G. Mayer and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Stichw\\\"{o}rter zur Intervallrechnung},\n  journal = {Lexikon der Mathematik, Spektrum, 1999-2001},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Stichw\\\"{o}rter zur Intervallrechnung',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1017,'paper','WvGcm','techreport','@techreport{WvGcm,\n author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n title = {UMLscript Sprachspezifikation},\n institution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 272, Feb. 2001},\n year = {2001},\n tags = {Reliability},\n}\n\n','\n\nH. Eichelberger and Jürgen Wolff von Gudenberg.\nUmlscript sprachspezifikation.\nTechnical report, Inst. f. Informatik, Universität W\"urzburg,\nTR 272, Feb. 2001, 2001.\n[ bib  ] 
\n@techreport{WvGcm,\nauthor = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {UMLscript Sprachspezifikation},\ninstitution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 272, Feb. 2001},\nyear = {2001},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGcm,\n  author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {UMLscript Sprachspezifikation},\n  institution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 272, Feb. 2001},\n  year = {2001},\n  tags = {Reliability}\n}\n
\n\n',NULL,'UMLscript Sprachspezifikation',0,0,2001,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1018,'paper','WvGcn','techreport','@techreport{WvGcn,\n author = {M. Lerch and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\n title = {fi_lib++ Interval Library},\n institution = {Specification and Reference Manual, Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 279, Aug. 2001},\n year = {2001},\n tags = {Reliability},\n}\n\n','\n\nM. Lerch, G. Tischler, and Jürgen Wolff von Gudenberg.\nfi_lib++ interval library.\nTechnical report, Specification and Reference Manual, Inst. f.\nInformatik, Universität W\"urzburg, TR 279, Aug. 2001, 2001.\n[ bib  ] 
\n@techreport{WvGcn,\nauthor = {M. Lerch and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {fi_lib++ Interval Library},\ninstitution = {Specification and Reference Manual, Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 279, Aug. 2001},\nyear = {2001},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGcn,\n  author = {M. Lerch and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {fi_lib++ Interval Library},\n  institution = {Specification and Reference Manual, Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 279, Aug. 2001},\n  year = {2001},\n  tags = {Reliability}\n}\n
\n\n',NULL,'fi_lib++ Interval Library',0,0,2001,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1019,'paper','WvGco','article','@article{WvGco,\n author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n title = {On the Visualization of Java Programs},\n journal = {in S. Diehl (ed.) Software Visualization, LNCS 2269, p.295-306, 2002},\n year = {2002},\n tags = {Reliability},\n}\n\n','\n\nH. Eichelberger and Jürgen Wolff von Gudenberg.\nOn the visualization of java programs.\nin S. Diehl (ed.) Software Visualization, LNCS 2269, p.295-306,\n2002, 2002.\n[ bib  ] 
\n@article{WvGco,\nauthor = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {On the Visualization of Java Programs},\njournal = {in S. Diehl (ed.) Software Visualization, LNCS 2269, p.295-306, 2002},\nyear = {2002},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGco,\n  author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {On the Visualization of Java Programs},\n  journal = {in S. Diehl (ed.) Software Visualization, LNCS 2269, p.295-306, 2002},\n  year = {2002},\n  tags = {Reliability}\n}\n
\n\n',NULL,'On the Visualization of Java Programs',0,0,2002,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1020,'paper','WvGcp','techreport','@techreport{WvGcp,\n author = {W. Hofschuster and W. Kr\\\"{a}mer and M. Lerch and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\n title = {The Interval Library fi_lib++ 2.0},\n institution = {Design, Features and Sample Programs, Preprint 2001/4,Universit\\\"{a}t Wuppertal, Dec 2001},\n year = {2001},\n tags = {Reliability},\n}\n\n','\n\nW. Hofschuster, W. Krämer, M. Lerch, G. Tischler, and Jürgen Wolff von\nGudenberg.\nThe interval library fi_lib++ 2.0.\nTechnical report, Design, Features and Sample Programs, Preprint\n2001/4,Universität Wuppertal, Dec 2001, 2001.\n[ bib  ] 
\n@techreport{WvGcp,\nauthor = {W. Hofschuster and W. Kr\\\"{a}mer and M. Lerch and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {The Interval Library fi_lib++ 2.0},\ninstitution = {Design, Features and Sample Programs, Preprint 2001/4,Universit\\\"{a}t Wuppertal, Dec 2001},\nyear = {2001},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGcp,\n  author = {W. Hofschuster and W. Kr\\\"{a}mer and M. Lerch and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {The Interval Library fi_lib++ 2.0},\n  institution = {Design, Features and Sample Programs, Preprint 2001/4,Universit\\\"{a}t Wuppertal, Dec 2001},\n  year = {2001},\n  tags = {Reliability}\n}\n
\n\n',NULL,'The Interval Library fi_lib++ 2.0',0,0,2001,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1021,'paper','WvGcq','article','@article{WvGcq,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Interval Arithmetic on Multimedia Architectures},\n journal = {Reliable Computing, Reliable Computing 8 (4), 2002},\n year = {2002},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nInterval arithmetic on multimedia architectures.\nReliable Computing, Reliable Computing 8 (4), 2002, 2002.\n[ bib  ] 
\n@article{WvGcq,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Interval Arithmetic on Multimedia Architectures},\njournal = {Reliable Computing, Reliable Computing 8 (4), 2002},\nyear = {2002},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcq,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Interval Arithmetic on Multimedia Architectures},\n  journal = {Reliable Computing, Reliable Computing 8 (4), 2002},\n  year = {2002},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Interval Arithmetic on Multimedia Architectures',0,0,2002,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1022,'paper','WvGcr','article','@article{WvGcr,\n author = {W. Hofschuster and W. Kr\\\"{a}mer and M. Lerch and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\n title = {filib++ a Fast Interval Library Supporting Containment Computations},\n journal = {TOMS Vol 32 No 2, pp.299 - 324, 2006},\n year = {2005},\n tags = {Reliability},\n}\n\n','\n\nW. Hofschuster, W. Krämer, M. Lerch, G. Tischler, and Jürgen Wolff von\nGudenberg.\nfilib++ a fast interval library supporting containment computations.\nTOMS Vol 32 No 2, pp.299 - 324, 2006, 2005.\n[ bib  ] 
\n@article{WvGcr,\nauthor = {W. Hofschuster and W. Kr\\\"{a}mer and M. Lerch and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {filib++ a Fast Interval Library Supporting Containment Computations},\njournal = {TOMS Vol 32 No 2, pp.299 - 324, 2006},\nyear = {2005},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcr,\n  author = {W. Hofschuster and W. Kr\\\"{a}mer and M. Lerch and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {filib++ a Fast Interval Library Supporting Containment Computations},\n  journal = {TOMS Vol 32 No 2, pp.299 - 324, 2006},\n  year = {2005},\n  tags = {Reliability}\n}\n
\n\n',NULL,'filib++ a Fast Interval Library Supporting Containment Computations',0,0,2005,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1023,'paper','WvGcs','article','@article{WvGcs,\n author = {W. Kr\\\"{a}mer and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Extended Interval Power Function},\n journal = {Proceedings of Validated Computing, Reliable Computing, 2003},\n year = {2003},\n tags = {Reliability},\n}\n\n','\n\nW. Krämer and Jürgen Wolff von Gudenberg.\nExtended interval power function.\nProceedings of Validated Computing, Reliable Computing, 2003,\n2003.\n[ bib  ] 
\n@article{WvGcs,\nauthor = {W. Kr\\\"{a}mer and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Extended Interval Power Function},\njournal = {Proceedings of Validated Computing, Reliable Computing, 2003},\nyear = {2003},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcs,\n  author = {W. Kr\\\"{a}mer and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Extended Interval Power Function},\n  journal = {Proceedings of Validated Computing, Reliable Computing, 2003},\n  year = {2003},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Extended Interval Power Function',0,0,2003,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1024,'paper','WvGct','article','@article{WvGct,\n author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Software-Entwurf mit UML Objektorientierte Modellierung mit Beispielen in Java},\n journal = {Springer, Heidelberg},\n year = {2000},\n tags = {Reliability},\n}\n\n','\n\nJ. Seemann and Jürgen Wolff von Gudenberg.\nSoftware-entwurf mit uml objektorientierte modellierung mit\nbeispielen in java.\nSpringer, Heidelberg, 2000.\n[ bib  ] 
\n@article{WvGct,\nauthor = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Software-Entwurf mit UML Objektorientierte Modellierung mit Beispielen in Java},\njournal = {Springer, Heidelberg},\nyear = {2000},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGct,\n  author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Software-Entwurf mit UML Objektorientierte Modellierung mit Beispielen in Java},\n  journal = {Springer, Heidelberg},\n  year = {2000},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Software-Entwurf mit UML Objektorientierte Modellierung mit Beispielen in Java',0,0,2000,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1025,'paper','WvGcu','article','@article{WvGcu,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Objektorientiert programmieren von Anfang an Eine Einf\\\"{u}hrung mit C++},\n journal = {BI Wissenschaftsverlag, Mannheim},\n year = {1993},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nObjektorientiert programmieren von anfang an eine einführung mit\nc++.\nBI Wissenschaftsverlag, Mannheim, 1993.\n[ bib  ] 
\n@article{WvGcu,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Objektorientiert programmieren von Anfang an Eine Einf\\\"{u}hrung mit C++},\njournal = {BI Wissenschaftsverlag, Mannheim},\nyear = {1993},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcu,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Objektorientiert programmieren von Anfang an Eine Einf\\\"{u}hrung mit C++},\n  journal = {BI Wissenschaftsverlag, Mannheim},\n  year = {1993},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Objektorientiert programmieren von Anfang an Eine Einf\\\"{u}hrung mit C++',0,0,1993,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 10:16:55',0),(1026,'paper','WvGcv','article','@article{WvGcv,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Objektorientiert programmieren von Anfang an Eine Einf\\\"{u}hrung mit C++},\n journal = {2. Auflage :Spektrum AkademischerVerlag, Heidelberg},\n year = {1996},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nObjektorientiert programmieren von anfang an eine einführung mit\nc++.\n2. Auflage :Spektrum AkademischerVerlag, Heidelberg, 1996.\n[ bib  ] 
\n@article{WvGcv,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Objektorientiert programmieren von Anfang an Eine Einf\\\"{u}hrung mit C++},\njournal = {2. Auflage :Spektrum AkademischerVerlag, Heidelberg},\nyear = {1996},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcv,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Objektorientiert programmieren von Anfang an Eine Einf\\\"{u}hrung mit C++},\n  journal = {2. Auflage :Spektrum AkademischerVerlag, Heidelberg},\n  year = {1996},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Objektorientiert programmieren von Anfang an Eine Einf\\\"{u}hrung mit C++',0,0,1996,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 10:15:58',0),(1027,'paper','WvGcw','article','@article{WvGcw,\n author = {J. Puchan and W. Stucky and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Programmieren mit Modula-2},\n journal = {BG Teubner, Stuttgart, 2. Auflage},\n year = {1993},\n tags = {Reliability},\n}\n\n','\n\nJ. Puchan, W. Stucky, and Jürgen Wolff von Gudenberg.\nProgrammieren mit modula-2.\nBG Teubner, Stuttgart, 2. Auflage, 1993.\n[ bib  ] 
\n@article{WvGcw,\nauthor = {J. Puchan and W. Stucky and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Programmieren mit Modula-2},\njournal = {BG Teubner, Stuttgart, 2. Auflage},\nyear = {1993},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcw,\n  author = {J. Puchan and W. Stucky and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Programmieren mit Modula-2},\n  journal = {BG Teubner, Stuttgart, 2. Auflage},\n  year = {1993},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Programmieren mit Modula-2',0,0,1993,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1028,'paper','WvGcx','article','@article{WvGcx,\n author = {E. Kaucher and R. Klatte and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Programmiersprachen im Griff, Band 4: ADA},\n journal = {BI Wissenschaftsverlag, Mannheim},\n year = {1983},\n tags = {Reliability},\n}\n\n','\n\nE. Kaucher, R. Klatte, C. Ullrich, and Jürgen Wolff von Gudenberg.\nProgrammiersprachen im griff, band 4: Ada.\nBI Wissenschaftsverlag, Mannheim, 1983.\n[ bib  ] 
\n@article{WvGcx,\nauthor = {E. Kaucher and R. Klatte and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Programmiersprachen im Griff, Band 4: ADA},\njournal = {BI Wissenschaftsverlag, Mannheim},\nyear = {1983},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcx,\n  author = {E. Kaucher and R. Klatte and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Programmiersprachen im Griff, Band 4: ADA},\n  journal = {BI Wissenschaftsverlag, Mannheim},\n  year = {1983},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Programmiersprachen im Griff, Band 4: ADA',0,0,1983,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1029,'paper','WvGcy','book','@book{WvGcy,\n author = {W. Kr\\\"{a}mer and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Scientific Computing, Validated Numerics, Interval Methods, Proceedings of the conference Scan-2000/Interval-2000},\n publisher = {Kluwer/Plenum, New York},\n year = {2001},\n tags = {Reliability},\n}\n\n','\n\nW. Krämer and Jürgen Wolff von Gudenberg.\nScientific Computing, Validated Numerics, Interval Methods,\nProceedings of the conference Scan-2000/Interval-2000.\nKluwer/Plenum, New York, 2001.\n[ bib  ] 
\n@book{WvGcy,\nauthor = {W. Kr\\\"{a}mer and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Scientific Computing, Validated Numerics, Interval Methods, Proceedings of the conference Scan-2000/Interval-2000},\npublisher = {Kluwer/Plenum, New York},\nyear = {2001},\ntags = {Reliability}\n}\n
\n
\n','
\n@book{WvGcy,\n  author = {W. Kr\\\"{a}mer and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Scientific Computing, Validated Numerics, Interval Methods, Proceedings of the conference Scan-2000/Interval-2000},\n  publisher = {Kluwer/Plenum, New York},\n  year = {2001},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Scientific Computing, Validated Numerics, Interval Methods, Proceedings of the conference Scan-2000/Interval-2000',0,0,2001,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1030,'paper','WvGcz','article','@article{WvGcz,\n author = {E. Kaucher and R. Klatte and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {{Programmiersprachen im Griff, Band 6: \\\"{U}bungen und Tests in Pascal}},\n journal = {BI Wissenschaftsverlag, Mannheim},\n year = {1984},\n tags = {Reliability},\n}\n\n','\n\nE. Kaucher, R. Klatte, C. Ullrich, and Jürgen Wolff von Gudenberg.\nProgrammiersprachen im Griff, Band 6: Übungen und Tests in\nPascal.\nBI Wissenschaftsverlag, Mannheim, 1984.\n[ bib  ] 
\n@article{WvGcz,\nauthor = {E. Kaucher and R. Klatte and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {{Programmiersprachen im Griff, Band 6: \\\"{U}bungen und Tests in Pascal}},\njournal = {BI Wissenschaftsverlag, Mannheim},\nyear = {1984},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcz,\n  author = {E. Kaucher and R. Klatte and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {{Programmiersprachen im Griff, Band 6: \\\"{U}bungen und Tests in Pascal}},\n  journal = {BI Wissenschaftsverlag, Mannheim},\n  year = {1984},\n  tags = {Reliability}\n}\n
\n\n',NULL,'{Programmiersprachen im Griff, Band 6: \\\"{U}bungen und Tests in Pascal}',0,0,1984,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 10:17:48',0),(1031,'paper','WvGda','article','@article{WvGda,\n author = {G. Bohlender and L.B. Rall and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {PASCAL-SC, A Computer Language for Scientific Computation},\n journal = {Academic Press, Boston},\n year = {1987},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, L.B. Rall, C. Ullrich, and Jürgen Wolff von Gudenberg.\nPascal-sc, a computer language for scientific computation.\nAcademic Press, Boston, 1987.\n[ bib  ] 
\n@article{WvGda,\nauthor = {G. Bohlender and L.B. Rall and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {PASCAL-SC, A Computer Language for Scientific Computation},\njournal = {Academic Press, Boston},\nyear = {1987},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGda,\n  author = {G. Bohlender and L.B. Rall and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {PASCAL-SC, A Computer Language for Scientific Computation},\n  journal = {Academic Press, Boston},\n  year = {1987},\n  tags = {Reliability}\n}\n
\n\n',NULL,'PASCAL-SC, A Computer Language for Scientific Computation',0,0,1987,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1032,'paper','WvGdb','article','@article{WvGdb,\n author = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Accurate Numerical Algorithms},\n journal = {Springer Research Reports ESPRIT},\n year = {1989},\n tags = {Reliability},\n}\n\n','\n\nCh. Ullrich and Jürgen Wolff von Gudenberg.\nAccurate numerical algorithms.\nSpringer Research Reports ESPRIT, 1989.\n[ bib  ] 
\n@article{WvGdb,\nauthor = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Accurate Numerical Algorithms},\njournal = {Springer Research Reports ESPRIT},\nyear = {1989},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdb,\n  author = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Accurate Numerical Algorithms},\n  journal = {Springer Research Reports ESPRIT},\n  year = {1989},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Accurate Numerical Algorithms',0,0,1989,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1033,'paper','WvGdc','article','@article{WvGdc,\n author = {A.P. Voshchinin and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Proceedings of the Conference \'Interval-92\'},\n journal = {Interval Computations No. 3(5) und No. 4(6), St. Petersburg--Moskau},\n year = {1992},\n tags = {Reliability},\n}\n\n','\n\nA.P. Voshchinin and Jürgen Wolff von Gudenberg.\nProceedings of the conference \'interval-92\'.\nInterval Computations No. 3(5) und No. 4(6), St.\nPetersburg-Moskau, 1992.\n[ bib  ] 
\n@article{WvGdc,\nauthor = {A.P. Voshchinin and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Proceedings of the Conference \'Interval-92\'},\njournal = {Interval Computations No. 3(5) und No. 4(6), St. Petersburg--Moskau},\nyear = {1992},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdc,\n  author = {A.P. Voshchinin and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Proceedings of the Conference \'Interval-92\'},\n  journal = {Interval Computations No. 3(5) und No. 4(6), St. Petersburg--Moskau},\n  year = {1992},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Proceedings of the Conference \'Interval-92\'',0,0,1992,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1034,'paper','WvGdd','article','@article{WvGdd,\n author = {G. Bohlender and L.B. Rall and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {PASCAL-SC, Wirkungsvoll programmieren, kontrolliert rechnen},\n journal = {BI Wissenschaftsverlag, Mannheim},\n year = {1986},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, L.B. Rall, C. Ullrich, and Jürgen Wolff von Gudenberg.\nPascal-sc, wirkungsvoll programmieren, kontrolliert rechnen.\nBI Wissenschaftsverlag, Mannheim, 1986.\n[ bib  ] 
\n@article{WvGdd,\nauthor = {G. Bohlender and L.B. Rall and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {PASCAL-SC, Wirkungsvoll programmieren, kontrolliert rechnen},\njournal = {BI Wissenschaftsverlag, Mannheim},\nyear = {1986},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdd,\n  author = {G. Bohlender and L.B. Rall and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {PASCAL-SC, Wirkungsvoll programmieren, kontrolliert rechnen},\n  journal = {BI Wissenschaftsverlag, Mannheim},\n  year = {1986},\n  tags = {Reliability}\n}\n
\n\n',NULL,'PASCAL-SC, Wirkungsvoll programmieren, kontrolliert rechnen',0,0,1986,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1035,'paper','WvGde','article','@article{WvGde,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {{Algorithmen Datenstrukturen Funktionale Programmierung Eine praktische Einf\\\"{u}hrung mit Caml Light}},\n journal = {Addison-Wesley, Bonn},\n year = {1996},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nAlgorithmen Datenstrukturen Funktionale Programmierung Eine\npraktische Einführung mit Caml Light.\nAddison-Wesley, Bonn, 1996.\n[ bib  ] 
\n@article{WvGde,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {{Algorithmen Datenstrukturen Funktionale Programmierung Eine praktische Einf\\\"{u}hrung mit Caml Light}},\njournal = {Addison-Wesley, Bonn},\nyear = {1996},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGde,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {{Algorithmen Datenstrukturen Funktionale Programmierung Eine praktische Einf\\\"{u}hrung mit Caml Light}},\n  journal = {Addison-Wesley, Bonn},\n  year = {1996},\n  tags = {Reliability}\n}\n
\n\n',NULL,'{Algorithmen Datenstrukturen Funktionale Programmierung Eine praktische Einf\\\"{u}hrung mit Caml Light}',0,0,1996,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 10:16:22',0),(1036,'paper','WvGdf','article','@article{WvGdf,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Proceedings of the Conference Interval-96},\n journal = {Reliable Computing 3 (3)},\n year = {1997},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nProceedings of the conference interval-96.\nReliable Computing 3 (3), 1997.\n[ bib  ] 
\n@article{WvGdf,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Proceedings of the Conference Interval-96},\njournal = {Reliable Computing 3 (3)},\nyear = {1997},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdf,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Proceedings of the Conference Interval-96},\n  journal = {Reliable Computing 3 (3)},\n  year = {1997},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Proceedings of the Conference Interval-96',0,0,1997,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1037,'paper','WvGdg','article','@article{WvGdg,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Java for Scientific Computation Pros and Cons},\n journal = {J. Universal Computer Science 4, 1, p.~11-15, 1998},\n year = {1998},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nJava for scientific computation pros and cons.\nJ. Universal Computer Science 4, 1, p. 11-15, 1998, 1998.\n[ bib  ] 
\n@article{WvGdg,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Java for Scientific Computation Pros and Cons},\njournal = {J. Universal Computer Science 4, 1, p.~11-15, 1998},\nyear = {1998},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdg,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Java for Scientific Computation Pros and Cons},\n  journal = {J. Universal Computer Science 4, 1, p.~11-15, 1998},\n  year = {1998},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Java for Scientific Computation Pros and Cons',0,0,1998,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1038,'paper','WvGdh','article','@article{WvGdh,\n author = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Different Approaches to Interval Arithmetic},\n journal = {ESPRIT DIAMOND consortium, No. 03/4/1/K2, 1986, in P.J.L. Wallis (Ed.), Improving Floating Point Programming, Wiley, p.61-72, 1990},\n year = {1990},\n tags = {Reliability},\n}\n\n','\n\nCh. Ullrich and Jürgen Wolff von Gudenberg.\nDifferent approaches to interval arithmetic.\nESPRIT DIAMOND consortium, No. 03/4/1/K2, 1986, in P.J.L. Wallis\n(Ed.), Improving Floating Point Programming, Wiley, p.61-72, 1990, 1990.\n[ bib  ] 
\n@article{WvGdh,\nauthor = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Different Approaches to Interval Arithmetic},\njournal = {ESPRIT DIAMOND consortium, No. 03/4/1/K2, 1986, in P.J.L. Wallis (Ed.), Improving Floating Point Programming, Wiley, p.61-72, 1990},\nyear = {1990},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdh,\n  author = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Different Approaches to Interval Arithmetic},\n  journal = {ESPRIT DIAMOND consortium, No. 03/4/1/K2, 1986, in P.J.L. Wallis (Ed.), Improving Floating Point Programming, Wiley, p.61-72, 1990},\n  year = {1990},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Different Approaches to Interval Arithmetic',0,0,1990,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1039,'paper','WvGdi','techreport','@techreport{WvGdi,\n author = {R. Klatte and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Forschungsschwerpunkt Computerarithmetik und Programmiersysteme f\\\"{u}r ingenieurwissenschaftliche Anwendungen},\n institution = {Institut f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1986},\n year = {1986},\n tags = {Reliability},\n}\n\n','\n\nR. Klatte and Jürgen Wolff von Gudenberg.\nForschungsschwerpunkt computerarithmetik und programmiersysteme\nfür ingenieurwissenschaftliche anwendungen.\nTechnical report, Institut für Angewandte Mathematik,\nUniversität Karlsruhe, 1986, 1986.\n[ bib  ] 
\n@techreport{WvGdi,\nauthor = {R. Klatte and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Forschungsschwerpunkt Computerarithmetik und Programmiersysteme f\\\"{u}r ingenieurwissenschaftliche Anwendungen},\ninstitution = {Institut f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1986},\nyear = {1986},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGdi,\n  author = {R. Klatte and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Forschungsschwerpunkt Computerarithmetik und Programmiersysteme f\\\"{u}r ingenieurwissenschaftliche Anwendungen},\n  institution = {Institut f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1986},\n  year = {1986},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Forschungsschwerpunkt Computerarithmetik und Programmiersysteme f\\\"{u}r ingenieurwissenschaftliche Anwendungen',0,0,1986,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1040,'paper','WvGdj','article','@article{WvGdj,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Syntax und Semantik der vorliegenden Implementierung der PASCAL Spracherweiterung},\n journal = {in Kulisch/Ullrich (Hrsg): Wissenschaftliches Rechnen und Programmiersprachen, German Chapter of the ACM, Berichte 10, Teubner, p. 207-231,1982},\n year = {1982},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nSyntax und semantik der vorliegenden implementierung der pascal\nspracherweiterung.\nin Kulisch/Ullrich (Hrsg): Wissenschaftliches Rechnen und\nProgrammiersprachen, German Chapter of the ACM, Berichte 10, Teubner, p.\n207-231,1982, 1982.\n[ bib  ] 
\n@article{WvGdj,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Syntax und Semantik der vorliegenden Implementierung der PASCAL Spracherweiterung},\njournal = {in Kulisch/Ullrich (Hrsg): Wissenschaftliches Rechnen und Programmiersprachen, German Chapter of the ACM, Berichte 10, Teubner, p. 207-231,1982},\nyear = {1982},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdj,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Syntax und Semantik der vorliegenden Implementierung der PASCAL Spracherweiterung},\n  journal = {in Kulisch/Ullrich (Hrsg): Wissenschaftliches Rechnen und Programmiersprachen, German Chapter of the ACM, Berichte 10, Teubner, p. 207-231,1982},\n  year = {1982},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Syntax und Semantik der vorliegenden Implementierung der PASCAL Spracherweiterung',0,0,1982,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1041,'paper','WvGdk','article','@article{WvGdk,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {PASCAL-Erweiterung f\\\"{u}r wissenschaftliches Rechnen},\n journal = {in Kulisch/Ullrich (Hrsg): Wissenschaftliches Rechnen und Programmiersprachen, German Chapter of the ACM, Berichte 10, Teubner, p. 71-95, 1982},\n year = {1982},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nPascal-erweiterung für wissenschaftliches rechnen.\nin Kulisch/Ullrich (Hrsg): Wissenschaftliches Rechnen und\nProgrammiersprachen, German Chapter of the ACM, Berichte 10, Teubner, p.\n71-95, 1982, 1982.\n[ bib  ] 
\n@article{WvGdk,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {PASCAL-Erweiterung f\\\"{u}r wissenschaftliches Rechnen},\njournal = {in Kulisch/Ullrich (Hrsg): Wissenschaftliches Rechnen und Programmiersprachen, German Chapter of the ACM, Berichte 10, Teubner, p. 71-95, 1982},\nyear = {1982},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdk,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {PASCAL-Erweiterung f\\\"{u}r wissenschaftliches Rechnen},\n  journal = {in Kulisch/Ullrich (Hrsg): Wissenschaftliches Rechnen und Programmiersprachen, German Chapter of the ACM, Berichte 10, Teubner, p. 71-95, 1982},\n  year = {1982},\n  tags = {Reliability}\n}\n
\n\n',NULL,'PASCAL-Erweiterung f\\\"{u}r wissenschaftliches Rechnen',0,0,1982,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1042,'paper','WvGdl','article','@article{WvGdl,\n author = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Optimal Arithmetic and ADA},\n journal = {Proceedings of the 11th IMACS World Congress, Vol. 1, Oslo, p. 179-181, 1985},\n year = {1985},\n tags = {Reliability},\n}\n\n','\n\nR. Klatte, Ch. Ullrich, and Jürgen Wolff von Gudenberg.\nOptimal arithmetic and ada.\nProceedings of the 11th IMACS World Congress, Vol. 1, Oslo, p.\n179-181, 1985, 1985.\n[ bib  ] 
\n@article{WvGdl,\nauthor = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Optimal Arithmetic and ADA},\njournal = {Proceedings of the 11th IMACS World Congress, Vol. 1, Oslo, p. 179-181, 1985},\nyear = {1985},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdl,\n  author = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Optimal Arithmetic and ADA},\n  journal = {Proceedings of the 11th IMACS World Congress, Vol. 1, Oslo, p. 179-181, 1985},\n  year = {1985},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Optimal Arithmetic and ADA',0,0,1985,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1043,'paper','WvGdm','article','@article{WvGdm,\n author = {G. Schumacher and J\\\"{u}rgen Wolff von Gudenberg},\n title = {A Set of Highly Accurate Numerical Algorithms},\n journal = {ESPRIT DIAMOND consortium, Deliverable D 3-6, 1989},\n year = {1989},\n tags = {Reliability},\n}\n\n','\n\nG. Schumacher and Jürgen Wolff von Gudenberg.\nA set of highly accurate numerical algorithms.\nESPRIT DIAMOND consortium, Deliverable D 3-6, 1989, 1989.\n[ bib  ] 
\n@article{WvGdm,\nauthor = {G. Schumacher and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {A Set of Highly Accurate Numerical Algorithms},\njournal = {ESPRIT DIAMOND consortium, Deliverable D 3-6, 1989},\nyear = {1989},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdm,\n  author = {G. Schumacher and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {A Set of Highly Accurate Numerical Algorithms},\n  journal = {ESPRIT DIAMOND consortium, Deliverable D 3-6, 1989},\n  year = {1989},\n  tags = {Reliability}\n}\n
\n\n',NULL,'A Set of Highly Accurate Numerical Algorithms',0,0,1989,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1044,'paper','WvGdn','article','@article{WvGdn,\n author = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Optimal Arithmetic and ADA},\n journal = {IMACS 1985 Trans. on Scientific Computation, Vol. 2, Computer Systems: Perfomance and Simulation, North-Holland, 1986},\n year = {1986},\n tags = {Reliability},\n}\n\n','\n\nR. Klatte, Ch. Ullrich, and Jürgen Wolff von Gudenberg.\nOptimal arithmetic and ada.\nIMACS 1985 Trans. on Scientific Computation, Vol. 2, Computer\nSystems: Perfomance and Simulation, North-Holland, 1986, 1986.\n[ bib  ] 
\n@article{WvGdn,\nauthor = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Optimal Arithmetic and ADA},\njournal = {IMACS 1985 Trans. on Scientific Computation, Vol. 2, Computer Systems: Perfomance and Simulation, North-Holland, 1986},\nyear = {1986},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdn,\n  author = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Optimal Arithmetic and ADA},\n  journal = {IMACS 1985 Trans. on Scientific Computation, Vol. 2, Computer Systems: Perfomance and Simulation, North-Holland, 1986},\n  year = {1986},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Optimal Arithmetic and ADA',0,0,1986,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1045,'paper','WvGdo','techreport','@techreport{WvGdo,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Gesamte Arithmetik des PASCAL-SC Rechners, Benutzerhandbuch},\n institution = {Universit\\\"{a}t Karlsruhe, 1982},\n year = {1982},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nGesamte arithmetik des pascal-sc rechners, benutzerhandbuch.\nTechnical report, Universität Karlsruhe, 1982, 1982.\n[ bib  ] 
\n@techreport{WvGdo,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Gesamte Arithmetik des PASCAL-SC Rechners, Benutzerhandbuch},\ninstitution = {Universit\\\"{a}t Karlsruhe, 1982},\nyear = {1982},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGdo,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Gesamte Arithmetik des PASCAL-SC Rechners, Benutzerhandbuch},\n  institution = {Universit\\\"{a}t Karlsruhe, 1982},\n  year = {1982},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Gesamte Arithmetik des PASCAL-SC Rechners, Benutzerhandbuch',0,0,1982,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1046,'paper','WvGdp','article','@article{WvGdp,\n author = {R. Lohner and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Complex Interval Division with Maximum Accuracy},\n journal = {Proceedings of the 7 Symposium on Computer Arithmetic, IEEE, p. 332-336, 1985},\n year = {1985},\n tags = {Reliability},\n}\n\n','\n\nR. Lohner and Jürgen Wolff von Gudenberg.\nComplex interval division with maximum accuracy.\nProceedings of the 7 Symposium on Computer Arithmetic, IEEE, p.\n332-336, 1985, 1985.\n[ bib  ] 
\n@article{WvGdp,\nauthor = {R. Lohner and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Complex Interval Division with Maximum Accuracy},\njournal = {Proceedings of the 7 Symposium on Computer Arithmetic, IEEE, p. 332-336, 1985},\nyear = {1985},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdp,\n  author = {R. Lohner and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Complex Interval Division with Maximum Accuracy},\n  journal = {Proceedings of the 7 Symposium on Computer Arithmetic, IEEE, p. 332-336, 1985},\n  year = {1985},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Complex Interval Division with Maximum Accuracy',0,0,1985,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1047,'paper','WvGdq','techreport','@techreport{WvGdq,\n author = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Arithmetic for Scientific Computation in ADA},\n institution = {Bericht des Instituts f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1983, IEEE Transactions on Computers, Vol. C -34, No. 11, p. 996-1006, 1985},\n year = {1985},\n tags = {Reliability},\n}\n\n','\n\nR. Klatte, Ch. Ullrich, and Jürgen Wolff von Gudenberg.\nArithmetic for scientific computation in ada.\nTechnical report, Bericht des Instituts für Angewandte\nMathematik, Universität Karlsruhe, 1983, IEEE Transactions on Computers,\nVol. C -34, No. 11, p. 996-1006, 1985, 1985.\n[ bib  ] 
\n@techreport{WvGdq,\nauthor = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Arithmetic for Scientific Computation in ADA},\ninstitution = {Bericht des Instituts f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1983, IEEE Transactions on Computers, Vol. C -34, No. 11, p. 996-1006, 1985},\nyear = {1985},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGdq,\n  author = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Arithmetic for Scientific Computation in ADA},\n  institution = {Bericht des Instituts f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1983, IEEE Transactions on Computers, Vol. C -34, No. 11, p. 996-1006, 1985},\n  year = {1985},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Arithmetic for Scientific Computation in ADA',0,0,1985,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1048,'paper','WvGdr','techreport','@techreport{WvGdr,\n author = {G. Bohlender and H. B\\\"{o}hm and K. Braune and W. Gr\"{u}ner and E. Kaucher and R. Kirchner and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Modified Proposal for Arithmetic Specification According to Guidelines of the X3J3 Meetings in Tulsa and Chapel Hill},\n institution = {Bericht des Instituts f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1983},\n year = {1983},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, H. Böhm, K. Braune, W. Gr\"uner, E. Kaucher, R. Kirchner,\nR. Klatte, W. Krämer, U. Kulisch, W. L. Miranker, Ch. Ullrich, and\nJürgen Wolff von Gudenberg.\nModified proposal for arithmetic specification according to\nguidelines of the x3j3 meetings in tulsa and chapel hill.\nTechnical report, Bericht des Instituts für Angewandte\nMathematik, Universität Karlsruhe, 1983, 1983.\n[ bib  ] 
\n@techreport{WvGdr,\nauthor = {G. Bohlender and H. B\\\"{o}hm and K. Braune and W. Gr\"{u}ner and E. Kaucher and R. Kirchner and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Modified Proposal for Arithmetic Specification According to Guidelines of the X3J3 Meetings in Tulsa and Chapel Hill},\ninstitution = {Bericht des Instituts f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1983},\nyear = {1983},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGdr,\n  author = {G. Bohlender and H. B\\\"{o}hm and K. Braune and W. Gr\"{u}ner and E. Kaucher and R. Kirchner and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Modified Proposal for Arithmetic Specification According to Guidelines of the X3J3 Meetings in Tulsa and Chapel Hill},\n  institution = {Bericht des Instituts f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1983},\n  year = {1983},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Modified Proposal for Arithmetic Specification According to Guidelines of the X3J3 Meetings in Tulsa and Chapel Hill',0,0,1983,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1049,'paper','WvGds','phdthesis','@phdthesis{WvGds,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Einbettung allgemeiner Rechnerarithmetik in PASCAL mittels eines Operatorkonzeptes und Implementierung der Standardfunktionen mit optimaler Genauigkeit},\n school = {University of Karlsruhe, 1980},\n year = {1980},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nEinbettung allgemeiner Rechnerarithmetik in PASCAL mittels eines\nOperatorkonzeptes und Implementierung der Standardfunktionen mit optimaler\nGenauigkeit.\nPhD thesis, University of Karlsruhe, 1980, 1980.\n[ bib  ] 
\n@phdthesis{WvGds,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Einbettung allgemeiner Rechnerarithmetik in PASCAL mittels eines Operatorkonzeptes und Implementierung der Standardfunktionen mit optimaler Genauigkeit},\nschool = {University of Karlsruhe, 1980},\nyear = {1980},\ntags = {Reliability}\n}\n
\n
\n','
\n@phdthesis{WvGds,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Einbettung allgemeiner Rechnerarithmetik in PASCAL mittels eines Operatorkonzeptes und Implementierung der Standardfunktionen mit optimaler Genauigkeit},\n  school = {University of Karlsruhe, 1980},\n  year = {1980},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Einbettung allgemeiner Rechnerarithmetik in PASCAL mittels eines Operatorkonzeptes und Implementierung der Standardfunktionen mit optimaler Genauigkeit',0,0,1980,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1050,'paper','WvGdt','article','@article{WvGdt,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Determination of Minimum Sets of the Set of Zeros of a Function},\n journal = {Computing 24, p. 203-212, 1980},\n year = {1980},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nDetermination of minimum sets of the set of zeros of a function.\nComputing 24, p. 203-212, 1980, 1980.\n[ bib  ] 
\n@article{WvGdt,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Determination of Minimum Sets of the Set of Zeros of a Function},\njournal = {Computing 24, p. 203-212, 1980},\nyear = {1980},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdt,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Determination of Minimum Sets of the Set of Zeros of a Function},\n  journal = {Computing 24, p. 203-212, 1980},\n  year = {1980},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Determination of Minimum Sets of the Set of Zeros of a Function',0,0,1980,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1051,'paper','WvGdu','article','@article{WvGdu,\n author = {G. Bohlender and E. Kaucher and R. Klatte and U. Kulisch and W. L. Miranker and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {FORTRAN for Contemporary Numerical Computation},\n journal = {Computing 26, p. 277-314, 1981},\n year = {1981},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, E. Kaucher, R. Klatte, U. Kulisch, W. L. Miranker, Ch. Ullrich,\nand Jürgen Wolff von Gudenberg.\nFortran for contemporary numerical computation.\nComputing 26, p. 277-314, 1981, 1981.\n[ bib  ] 
\n@article{WvGdu,\nauthor = {G. Bohlender and E. Kaucher and R. Klatte and U. Kulisch and W. L. Miranker and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {FORTRAN for Contemporary Numerical Computation},\njournal = {Computing 26, p. 277-314, 1981},\nyear = {1981},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdu,\n  author = {G. Bohlender and E. Kaucher and R. Klatte and U. Kulisch and W. L. Miranker and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {FORTRAN for Contemporary Numerical Computation},\n  journal = {Computing 26, p. 277-314, 1981},\n  year = {1981},\n  tags = {Reliability}\n}\n
\n\n',NULL,'FORTRAN for Contemporary Numerical Computation',0,0,1981,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1052,'paper','WvGdv','article','@article{WvGdv,\n author = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n title = {JOP ein Java Online Praktikum der vhb},\n journal = {Softwaretechnik-Trends 22(4) pp.15-18, 2002},\n year = {2002},\n tags = {Reliability},\n}\n\n','\n\nG. Fischer and Jürgen Wolff von Gudenberg.\nJop ein java online praktikum der vhb.\nSoftwaretechnik-Trends 22(4) pp.15-18, 2002, 2002.\n[ bib  ] 
\n@article{WvGdv,\nauthor = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {JOP ein Java Online Praktikum der vhb},\njournal = {Softwaretechnik-Trends 22(4) pp.15-18, 2002},\nyear = {2002},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdv,\n  author = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {JOP ein Java Online Praktikum der vhb},\n  journal = {Softwaretechnik-Trends 22(4) pp.15-18, 2002},\n  year = {2002},\n  tags = {Reliability}\n}\n
\n\n',NULL,'JOP ein Java Online Praktikum der vhb',0,0,2002,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1053,'paper','WvGdw','article','@article{WvGdw,\n author = {M. Hopfner and D. Seipel and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Comprehending and Visualizing Software based on XML-Representations and Call Graphs},\n journal = {11th Int. Workshop on Program Comprehension, pp 290-291, IEEE 2003},\n year = {2003},\n tags = {Reliability},\n}\n\n','\n\nM. Hopfner, D. Seipel, and Jürgen Wolff von Gudenberg.\nComprehending and visualizing software based on xml-representations\nand call graphs.\n11th Int. Workshop on Program Comprehension, pp 290-291, IEEE\n2003, 2003.\n[ bib  ] 
\n@article{WvGdw,\nauthor = {M. Hopfner and D. Seipel and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Comprehending and Visualizing Software based on XML-Representations and Call Graphs},\njournal = {11th Int. Workshop on Program Comprehension, pp 290-291, IEEE 2003},\nyear = {2003},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdw,\n  author = {M. Hopfner and D. Seipel and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Comprehending and Visualizing Software based on XML-Representations and Call Graphs},\n  journal = {11th Int. Workshop on Program Comprehension, pp 290-291, IEEE 2003},\n  year = {2003},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Comprehending and Visualizing Software based on XML-Representations and Call Graphs',0,0,2003,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1054,'paper','WvGdx','article','@article{WvGdx,\n author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Object-oriented Processing of Java Source Code},\n journal = {Software Practice and Experience, 34, 2004},\n year = {2004},\n tags = {Reliability},\n}\n\n','\n\nH. Eichelberger and Jürgen Wolff von Gudenberg.\nObject-oriented processing of java source code.\nSoftware Practice and Experience, 34, 2004, 2004.\n[ bib  ] 
\n@article{WvGdx,\nauthor = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Object-oriented Processing of Java Source Code},\njournal = {Software Practice and Experience, 34, 2004},\nyear = {2004},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdx,\n  author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Object-oriented Processing of Java Source Code},\n  journal = {Software Practice and Experience, 34, 2004},\n  year = {2004},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Object-oriented Processing of Java Source Code',0,0,2004,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1055,'paper','WvGdy','article','@article{WvGdy,\n author = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Simplifying Source Code Analysis by an XML Representation},\n journal = {Softwaretechnik Trends 23(2), pp.49-50, 2003},\n year = {2003},\n tags = {Reliability},\n}\n\n','\n\nG. Fischer and Jürgen Wolff von Gudenberg.\nSimplifying source code analysis by an xml representation.\nSoftwaretechnik Trends 23(2), pp.49-50, 2003, 2003.\n[ bib  ] 
\n@article{WvGdy,\nauthor = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Simplifying Source Code Analysis by an XML Representation},\njournal = {Softwaretechnik Trends 23(2), pp.49-50, 2003},\nyear = {2003},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdy,\n  author = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Simplifying Source Code Analysis by an XML Representation},\n  journal = {Softwaretechnik Trends 23(2), pp.49-50, 2003},\n  year = {2003},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Simplifying Source Code Analysis by an XML Representation',0,0,2003,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:09',0),(1056,'paper','WvGdz','article','@article{WvGdz,\n author = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Java Online Pedagogy},\n journal = {ECOOP\'03 Workshop on Pedagogies and Tools for Learning Object-Oriented Concepts.},\n year = {2003},\n tags = {Reliability},\n}\n\n','\n\nG. Fischer and Jürgen Wolff von Gudenberg.\nJava online pedagogy.\nECOOP\'03 Workshop on Pedagogies and Tools for Learning\nObject-Oriented Concepts., 2003.\n[ bib  ] 
\n@article{WvGdz,\nauthor = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Java Online Pedagogy},\njournal = {ECOOP\'03 Workshop on Pedagogies and Tools for Learning Object-Oriented Concepts.},\nyear = {2003},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdz,\n  author = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Java Online Pedagogy},\n  journal = {ECOOP\'03 Workshop on Pedagogies and Tools for Learning Object-Oriented Concepts.},\n  year = {2003},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Java Online Pedagogy',0,0,2003,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:09',0),(1057,'paper','WvGea','article','@article{WvGea,\n author = {G. Fischer and M. Hopfner and D. Seipel and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Reasoning about Source Code in XML-Representation},\n journal = {Softwaretechnik Trends 23(2), pp.51-52, 2003},\n year = {2003},\n tags = {Reliability},\n}\n\n','\n\nG. Fischer, M. Hopfner, D. Seipel, and Jürgen Wolff von Gudenberg.\nReasoning about source code in xml-representation.\nSoftwaretechnik Trends 23(2), pp.51-52, 2003, 2003.\n[ bib  ] 
\n@article{WvGea,\nauthor = {G. Fischer and M. Hopfner and D. Seipel and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Reasoning about Source Code in XML-Representation},\njournal = {Softwaretechnik Trends 23(2), pp.51-52, 2003},\nyear = {2003},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGea,\n  author = {G. Fischer and M. Hopfner and D. Seipel and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Reasoning about Source Code in XML-Representation},\n  journal = {Softwaretechnik Trends 23(2), pp.51-52, 2003},\n  year = {2003},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Reasoning about Source Code in XML-Representation',0,0,2003,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1058,'paper','WvGeb','article','@article{WvGeb,\n author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n title = {UML Class Diagrams - State of the Art in Layout Techniques},\n journal = {Vissoft 2003, Amsterdam, p. 30-34},\n year = {2003},\n tags = {Reliability},\n}\n\n','\n\nH. Eichelberger and Jürgen Wolff von Gudenberg.\nUml class diagrams - state of the art in layout techniques.\nVissoft 2003, Amsterdam, p. 30-34, 2003.\n[ bib  ] 
\n@article{WvGeb,\nauthor = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {UML Class Diagrams - State of the Art in Layout Techniques},\njournal = {Vissoft 2003, Amsterdam, p. 30-34},\nyear = {2003},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGeb,\n  author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {UML Class Diagrams - State of the Art in Layout Techniques},\n  journal = {Vissoft 2003, Amsterdam, p. 30-34},\n  year = {2003},\n  tags = {Reliability}\n}\n
\n\n',NULL,'UML Class Diagrams - State of the Art in Layout Techniques',0,0,2003,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1059,'paper','WvGec','article','@article{WvGec,\n author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Demonstration of Advanced Layout of UML Class Diagrams by SugiBib},\n journal = {Vissoft 2003, Amsterdam, p.53-54},\n year = {2003},\n tags = {Reliability},\n}\n\n','\n\nH. Eichelberger and Jürgen Wolff von Gudenberg.\nDemonstration of advanced layout of uml class diagrams by sugibib.\nVissoft 2003, Amsterdam, p.53-54, 2003.\n[ bib  ] 
\n@article{WvGec,\nauthor = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Demonstration of Advanced Layout of UML Class Diagrams by SugiBib},\njournal = {Vissoft 2003, Amsterdam, p.53-54},\nyear = {2003},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGec,\n  author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Demonstration of Advanced Layout of UML Class Diagrams by SugiBib},\n  journal = {Vissoft 2003, Amsterdam, p.53-54},\n  year = {2003},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Demonstration of Advanced Layout of UML Class Diagrams by SugiBib',0,0,2003,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1060,'paper','WvGed','article','@article{WvGed,\n author = {H. Eichelberger and G. Fischer and F. Grupp and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Programmierausbildung Online},\n journal = {DeLFI 2003, A.Bode,J.Desel,S.Rathmayer,M.Wessner (eds), Lecture Notes in Informatics, GI, p.134-143},\n year = {2003},\n tags = {Reliability},\n}\n\n','\n\nH. Eichelberger, G. Fischer, F. Grupp, and Jürgen Wolff von Gudenberg.\nProgrammierausbildung online.\nDeLFI 2003, A.Bode,J.Desel,S.Rathmayer,M.Wessner (eds), Lecture\nNotes in Informatics, GI, p.134-143, 2003.\n[ bib  ] 
\n@article{WvGed,\nauthor = {H. Eichelberger and G. Fischer and F. Grupp and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Programmierausbildung Online},\njournal = {DeLFI 2003, A.Bode,J.Desel,S.Rathmayer,M.Wessner (eds), Lecture Notes in Informatics, GI, p.134-143},\nyear = {2003},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGed,\n  author = {H. Eichelberger and G. Fischer and F. Grupp and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Programmierausbildung Online},\n  journal = {DeLFI 2003, A.Bode,J.Desel,S.Rathmayer,M.Wessner (eds), Lecture Notes in Informatics, GI, p.134-143},\n  year = {2003},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Programmierausbildung Online',0,0,2003,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1061,'paper','WvGee','article','@article{WvGee,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {OOP and Interval Arithmetic - Language Support and Libraries},\n journal = {Numerical Software with Result Verification, R. Alt, A. Frommer, B. Kearfott, W. Luther (eds), Springer Lecture Notes in Computer Science.},\n year = {2003},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nOop and interval arithmetic - language support and libraries.\nNumerical Software with Result Verification, R. Alt, A. Frommer,\nB. Kearfott, W. Luther (eds), Springer Lecture Notes in Computer Science.,\n2003.\n[ bib  ] 
\n@article{WvGee,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {OOP and Interval Arithmetic - Language Support and Libraries},\njournal = {Numerical Software with Result Verification, R. Alt, A. Frommer, B. Kearfott, W. Luther (eds), Springer Lecture Notes in Computer Science.},\nyear = {2003},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGee,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {OOP and Interval Arithmetic - Language Support and Libraries},\n  journal = {Numerical Software with Result Verification, R. Alt, A. Frommer, B. Kearfott, W. Luther (eds), Springer Lecture Notes in Computer Science.},\n  year = {2003},\n  tags = {Reliability}\n}\n
\n\n',NULL,'OOP and Interval Arithmetic - Language Support and Libraries',0,0,2003,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1062,'paper','WvGef','article','@article{WvGef,\n author = {V. Wahler and D. Seipel and J\\\"{u}rgen Wolff von Gudenberg and G. Fischer},\n title = {Clone Detection in Source Code by Frequent Itemset Techniques},\n journal = {4th IEEE Workshop on Source Code Analysis and Manipulation, 2004 pp 128-135},\n year = {2004},\n tags = {Reliability},\n}\n\n','\n\nV. Wahler, D. Seipel, Jürgen Wolff von Gudenberg, and G. Fischer.\nClone detection in source code by frequent itemset techniques.\n4th IEEE Workshop on Source Code Analysis and Manipulation, 2004\npp 128-135, 2004.\n[ bib  ] 
\n@article{WvGef,\nauthor = {V. Wahler and D. Seipel and J\\\"{u}rgen Wolff von Gudenberg and G. Fischer},\ntitle = {Clone Detection in Source Code by Frequent Itemset Techniques},\njournal = {4th IEEE Workshop on Source Code Analysis and Manipulation, 2004 pp 128-135},\nyear = {2004},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGef,\n  author = {V. Wahler and D. Seipel and J\\\"{u}rgen Wolff von Gudenberg and G. Fischer},\n  title = {Clone Detection in Source Code by Frequent Itemset Techniques},\n  journal = {4th IEEE Workshop on Source Code Analysis and Manipulation, 2004 pp 128-135},\n  year = {2004},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Clone Detection in Source Code by Frequent Itemset Techniques',0,0,2004,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1063,'paper','WvGeg','article','@article{WvGeg,\n author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n title = {JTransform, a Tool for Source code Analysis},\n journal = {Softwaretechnik Trends, 24 (2), pp 65-66},\n year = {2004},\n tags = {Reliability},\n}\n\n','\n\nH. Eichelberger and Jürgen Wolff von Gudenberg.\nJtransform, a tool for source code analysis.\nSoftwaretechnik Trends, 24 (2), pp 65-66, 2004.\n[ bib  ] 
\n@article{WvGeg,\nauthor = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {JTransform, a Tool for Source code Analysis},\njournal = {Softwaretechnik Trends, 24 (2), pp 65-66},\nyear = {2004},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGeg,\n  author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {JTransform, a Tool for Source code Analysis},\n  journal = {Softwaretechnik Trends, 24 (2), pp 65-66},\n  year = {2004},\n  tags = {Reliability}\n}\n
\n\n',NULL,'JTransform, a Tool for Source code Analysis',0,0,2004,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1064,'paper','WvGeh','article','@article{WvGeh,\n author = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {A Full Function-Based Calculus of Directed and Undirected Intervals: Markov\'S Interval Arithmetic Revisited},\n journal = {Numerical Algorithms, 37 (1-4): 417-428, 2004},\n year = {2004},\n tags = {Reliability},\n}\n\n','\n\nV. Kreinovich and Jürgen Wolff von Gudenberg.\nA full function-based calculus of directed and undirected intervals:\nMarkov\'s interval arithmetic revisited.\nNumerical Algorithms, 37 (1-4): 417-428, 2004, 2004.\n[ bib  ] 
\n@article{WvGeh,\nauthor = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {A Full Function-Based Calculus of Directed and Undirected Intervals: Markov\'S Interval Arithmetic Revisited},\njournal = {Numerical Algorithms, 37 (1-4): 417-428, 2004},\nyear = {2004},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGeh,\n  author = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {A Full Function-Based Calculus of Directed and Undirected Intervals: Markov\'S Interval Arithmetic Revisited},\n  journal = {Numerical Algorithms, 37 (1-4): 417-428, 2004},\n  year = {2004},\n  tags = {Reliability}\n}\n
\n\n',NULL,'A Full Function-Based Calculus of Directed and Undirected Intervals: Markov\'S Interval Arithmetic Revisited',0,0,2004,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1065,'paper','WvGei','article','@article{WvGei,\n author = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Online Assessment of Programming Exercises},\n journal = {ECOOP 2004 Eighth Workshop on Pedagogies and Tools for the Teaching and Learning of Object Oriented Concepts},\n url = {http://www.cs.umu.se/~jubo/Meetings/ECOOP04/Submissions/FischerWolffvGudenberg.pdf},\n year = {2004},\n tags = {Reliability},\n}\n\n','\n\nG. Fischer and Jürgen Wolff von Gudenberg.\nOnline assessment of programming exercises.\nECOOP 2004 Eighth Workshop on Pedagogies and Tools for the\nTeaching and Learning of Object Oriented Concepts, 2004.\n[ bib | .pdf  ] 
\n@article{WvGei,\nauthor = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Online Assessment of Programming Exercises},\njournal = {ECOOP 2004 Eighth Workshop on Pedagogies and Tools for the Teaching and Learning of Object Oriented Concepts},\nurl = {http://www.cs.umu.se/~jubo/Meetings/ECOOP04/Submissions/FischerWolffvGudenberg.pdf},\nyear = {2004},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGei,\n  author = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Online Assessment of Programming Exercises},\n  journal = {ECOOP 2004 Eighth Workshop on Pedagogies and Tools for the Teaching and Learning of Object Oriented Concepts},\n  url = {http://www.cs.umu.se/~jubo/Meetings/ECOOP04/Submissions/FischerWolffvGudenberg.pdf},\n  year = {2004},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Online Assessment of Programming Exercises',0,0,2004,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1066,'paper','WvGej','article','@article{WvGej,\n author = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Improving the Quality of Programming Education by Online Assessment},\n journal = {Proceedings of PPPJ-06, Mannheim 2006, p. 208-212},\n year = {2006},\n tags = {Reliability},\n}\n\n','\n\nG. Fischer and Jürgen Wolff von Gudenberg.\nImproving the quality of programming education by online assessment.\nProceedings of PPPJ-06, Mannheim 2006, p. 208-212, 2006.\n[ bib  ] 
\n@article{WvGej,\nauthor = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Improving the Quality of Programming Education by Online Assessment},\njournal = {Proceedings of PPPJ-06, Mannheim 2006, p. 208-212},\nyear = {2006},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGej,\n  author = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Improving the Quality of Programming Education by Online Assessment},\n  journal = {Proceedings of PPPJ-06, Mannheim 2006, p. 208-212},\n  year = {2006},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Improving the Quality of Programming Education by Online Assessment',0,0,2006,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1067,'paper','WvGek','article','@article{WvGek,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Interval Arithmetic and Standardization},\n journal = {Dagstuhl Seminar Proceedings 08021},\n year = {2008},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nInterval arithmetic and standardization.\nDagstuhl Seminar Proceedings 08021, 2008.\n[ bib  ] 
\n@article{WvGek,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Interval Arithmetic and Standardization},\njournal = {Dagstuhl Seminar Proceedings 08021},\nyear = {2008},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGek,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Interval Arithmetic and Standardization},\n  journal = {Dagstuhl Seminar Proceedings 08021},\n  year = {2008},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Interval Arithmetic and Standardization',0,0,2008,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1068,'paper','WvGel','article','@article{WvGel,\n author = {J\\\"{u}rgen Wolff von Gudenberg and A. Niederle and M. Ebner and H. Eichelberger},\n title = {Evolutionary Layout of UML Class Diagrams},\n journal = {SoftVis06, ACM Symposium on Software Visualization, Brighton 2006, p. 163-164},\n year = {2006},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg, A. Niederle, M. Ebner, and H. Eichelberger.\nEvolutionary layout of uml class diagrams.\nSoftVis06, ACM Symposium on Software Visualization, Brighton\n2006, p. 163-164, 2006.\n[ bib  ] 
\n@article{WvGel,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg and A. Niederle and M. Ebner and H. Eichelberger},\ntitle = {Evolutionary Layout of UML Class Diagrams},\njournal = {SoftVis06, ACM Symposium on Software Visualization, Brighton 2006, p. 163-164},\nyear = {2006},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGel,\n  author = {J\\\"{u}rgen Wolff von Gudenberg and A. Niederle and M. Ebner and H. Eichelberger},\n  title = {Evolutionary Layout of UML Class Diagrams},\n  journal = {SoftVis06, ACM Symposium on Software Visualization, Brighton 2006, p. 163-164},\n  year = {2006},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Evolutionary Layout of UML Class Diagrams',0,0,2006,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1069,'paper','WvGem','article','@article{WvGem,\n author = {D. Glaser and G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Automated Component Bridge Generator},\n journal = {Proceedings of the 11th Workshop on Component Oriented Programming, R. Reussner, C. Szypersky, W. Weck (Eds), Interner Bericht 2006-11, Informatik Uni Karlsruhe},\n year = {2006},\n tags = {Reliability},\n}\n\n','\n\nD. Glaser, G. Fischer, and Jürgen Wolff von Gudenberg.\nAutomated component bridge generator.\nProceedings of the 11th Workshop on Component Oriented\nProgramming, R. Reussner, C. Szypersky, W. Weck (Eds), Interner Bericht\n2006-11, Informatik Uni Karlsruhe, 2006.\n[ bib  ] 
\n@article{WvGem,\nauthor = {D. Glaser and G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Automated Component Bridge Generator},\njournal = {Proceedings of the 11th Workshop on Component Oriented Programming, R. Reussner, C. Szypersky, W. Weck (Eds), Interner Bericht 2006-11, Informatik Uni Karlsruhe},\nyear = {2006},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGem,\n  author = {D. Glaser and G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Automated Component Bridge Generator},\n  journal = {Proceedings of the 11th Workshop on Component Oriented Programming, R. Reussner, C. Szypersky, W. Weck (Eds), Interner Bericht 2006-11, Informatik Uni Karlsruhe},\n  year = {2006},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Automated Component Bridge Generator',0,0,2006,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1070,'paper','WvGen','techreport','@techreport{WvGen,\n author = {J\\\"{u}rgen Wolff von Gudenberg and A. Niederle and M. Ebner and H. Eichelberger},\n title = {An Evolutionary Algorithm for the Layout of UML Class Diagrams},\n institution = {Informatik. TR 391, Uni W\"{u}rzburg},\n year = {2006},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg, A. Niederle, M. Ebner, and H. Eichelberger.\nAn evolutionary algorithm for the layout of uml class diagrams.\nTechnical report, Informatik. TR 391, Uni W\"urzburg, 2006.\n[ bib  ] 
\n@techreport{WvGen,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg and A. Niederle and M. Ebner and H. Eichelberger},\ntitle = {An Evolutionary Algorithm for the Layout of UML Class Diagrams},\ninstitution = {Informatik. TR 391, Uni W\"{u}rzburg},\nyear = {2006},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGen,\n  author = {J\\\"{u}rgen Wolff von Gudenberg and A. Niederle and M. Ebner and H. Eichelberger},\n  title = {An Evolutionary Algorithm for the Layout of UML Class Diagrams},\n  institution = {Informatik. TR 391, Uni W\"{u}rzburg},\n  year = {2006},\n  tags = {Reliability}\n}\n
\n\n',NULL,'An Evolutionary Algorithm for the Layout of UML Class Diagrams',0,0,2006,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1071,'paper','WvGeo','techreport','@techreport{WvGeo,\n author = {G. Fischer and J. Lusiardi and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Source Code Model Hierarchies},\n institution = {TR 444, Institut f. Informatik, Uni W\"{u}rzburg},\n year = {2008},\n tags = {Reliability},\n}\n\n','\n\nG. Fischer, J. Lusiardi, and Jürgen Wolff von Gudenberg.\nSource code model hierarchies.\nTechnical report, TR 444, Institut f. Informatik, Uni W\"urzburg,\n2008.\n[ bib  ] 
\n@techreport{WvGeo,\nauthor = {G. Fischer and J. Lusiardi and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Source Code Model Hierarchies},\ninstitution = {TR 444, Institut f. Informatik, Uni W\"{u}rzburg},\nyear = {2008},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGeo,\n  author = {G. Fischer and J. Lusiardi and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Source Code Model Hierarchies},\n  institution = {TR 444, Institut f. Informatik, Uni W\"{u}rzburg},\n  year = {2008},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Source Code Model Hierarchies',0,0,2008,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1072,'paper','WvGep','article','@article{WvGep,\n author = {G. Fischer and J. Lusiardi and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Modeling Source Code with Orthogonal Hierarchies},\n journal = {Workshop MMSS bei ECMDA 2008, Berlin},\n year = {2008},\n tags = {Reliability},\n}\n\n','\n\nG. Fischer, J. Lusiardi, and Jürgen Wolff von Gudenberg.\nModeling source code with orthogonal hierarchies.\nWorkshop MMSS bei ECMDA 2008, Berlin, 2008.\n[ bib  ] 
\n@article{WvGep,\nauthor = {G. Fischer and J. Lusiardi and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Modeling Source Code with Orthogonal Hierarchies},\njournal = {Workshop MMSS bei ECMDA 2008, Berlin},\nyear = {2008},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGep,\n  author = {G. Fischer and J. Lusiardi and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Modeling Source Code with Orthogonal Hierarchies},\n  journal = {Workshop MMSS bei ECMDA 2008, Berlin},\n  year = {2008},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Modeling Source Code with Orthogonal Hierarchies',0,0,2008,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1073,'paper','WvGeq','article','@article{WvGeq,\n author = {G. Fischer and J. Lusiardi and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Abstract Syntax Trees and their Role in Model Driven Software Development},\n journal = {ICSEA 2007 Online proceedings},\n year = {2007},\n tags = {Reliability},\n}\n\n','\n\nG. Fischer, J. Lusiardi, and Jürgen Wolff von Gudenberg.\nAbstract syntax trees and their role in model driven software\ndevelopment.\nICSEA 2007 Online proceedings, 2007.\n[ bib  ] 
\n@article{WvGeq,\nauthor = {G. Fischer and J. Lusiardi and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Abstract Syntax Trees and their Role in Model Driven Software Development},\njournal = {ICSEA 2007 Online proceedings},\nyear = {2007},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGeq,\n  author = {G. Fischer and J. Lusiardi and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Abstract Syntax Trees and their Role in Model Driven Software Development},\n  journal = {ICSEA 2007 Online proceedings},\n  year = {2007},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Abstract Syntax Trees and their Role in Model Driven Software Development',0,0,2007,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1074,'paper','HaKlKuBrWeSpStKo-2016-MITPress-Palladio','incollection','@incollection{HaKlKuBrWeSpStKo-2016-MITPress-Palladio,\n author = {Jens Happe and Benjamin Klatt and Martin K\\\"{u}ster and Fabian Brosig and Alexander Wert and Simon Spinner and Christian Stier and Heiko Koziolek},\n editor = {Reussner, Ralf H. and Becker, Steffen and Happe, Jens and Heinrich, Robert and Koziolek, Anne and Koziolek, Heiko and Kramer, Max and Krogmann, Klaus},\n title = {{Getting the Data}},\n booktitle = {{Modeling and Simulating Software Architectures - The Palladio Approach}},\n publisher = {MIT Press},\n year = {2016},\n address = {Cambridge, MA},\n note = {In Press},\n isbn = {9780262034760},\n}\n\n','\n\nJens Happe, Benjamin Klatt, Martin Küster, Fabian Brosig, Alexander Wert,\nSimon Spinner, Christian Stier, and Heiko Koziolek.\nGetting the Data.\nIn Modeling and Simulating Software Architectures - The\nPalladio Approach, Ralf H. Reussner, Steffen Becker, Jens Happe, Robert\nHeinrich, Anne Koziolek, Heiko Koziolek, Max Kramer, and Klaus Krogmann,\neditors. MIT Press, Cambridge, MA, 2016.\nIn Press.\n[ bib  ] 
\n@incollection{HaKlKuBrWeSpStKo-2016-MITPress-Palladio,\nauthor = {Jens Happe and Benjamin Klatt and Martin K\\\"{u}ster and Fabian Brosig and Alexander Wert and Simon Spinner and Christian Stier and Heiko Koziolek},\neditor = {Reussner, Ralf H. and Becker, Steffen and Happe, Jens and Heinrich, Robert and Koziolek, Anne and Koziolek, Heiko and Kramer, Max and Krogmann, Klaus},\ntitle = {{Getting the Data}},\nbooktitle = {{Modeling and Simulating Software Architectures - The Palladio Approach}},\npublisher = {MIT Press},\nyear = {2016},\naddress = {Cambridge, MA},\nnote = {In Press},\nisbn = {9780262034760}\n}\n
\n
\n','
\n@incollection{HaKlKuBrWeSpStKo-2016-MITPress-Palladio,\n  author = {Jens Happe and Benjamin Klatt and Martin K\\\"{u}ster and Fabian Brosig and Alexander Wert and Simon Spinner and Christian Stier and Heiko Koziolek},\n  editor = {Reussner, Ralf H. and Becker, Steffen and Happe, Jens and Heinrich, Robert and Koziolek, Anne and Koziolek, Heiko and Kramer, Max and Krogmann, Klaus},\n  title = {{Getting the Data}},\n  booktitle = {{Modeling and Simulating Software Architectures - The Palladio Approach}},\n  publisher = {MIT Press},\n  year = {2016},\n  address = {Cambridge, MA},\n  note = {In Press},\n  isbn = {9780262034760}\n}\n
\n\n',NULL,'{Getting the Data}',0,1,2016,1,NULL,NULL,NULL,'2016-02-22 08:52:19','2016-06-01 09:41:09',0),(1075,'paper','MuRySpKo2016-PASM-QPN-LQN-Transformation','inproceedings','@inproceedings{MuRySpKo2016-PASM-QPN-LQN-Transformation,\n author = {Christoph M\\\"{u}ller and Piotr Rygielski and Simon Spinner and Samuel Kounev},\n title = {{Enabling Fluid Analysis for Queueing Petri Nets via Model Transformation}},\n booktitle = {Proceedings of the Eighth International Workshop on Practical Applications of Stochastic Modelling (PASM 2016)},\n year = {2016},\n month = {April},\n day = {5},\n location = {M\\\"{u}nster, Germany},\n series = {{Electronic Notes in Theoretical Computer Science (ENTCS)}},\n publisher = {Elsevier},\n abstract = {{Due to the growing size of modern IT systems, their performance analysis becomes an even more challenging task. Existing simulators are unable to analyze the behavior of large systems in a reasonable time, whereas analytical methods suffer from the state space explosion problem. Fluid analysis techniques can be used to approximate the solution of high-order Markov chain models enabling time efficient analysis of large performance models. In this paper, we describe a model-to-model transformation from queueing Petri nets (QPN) into layered queueing networks (LQN). Obtained LQN models can benefit from three existing solvers: LINE, LQNS, LQSIM. LINE internally utilize fluid limits approximation to speed up the solving process for large models. We present the incentives for developing the automated model-to-model transformation and present a systematic approach that we followed in its design. We demonstrate the transformations using representative examples. Finally, we evaluate and compare the performance predictions of existing analytical, simulation and fluid analysis solvers. We analyze solver\'s limitations, solving time, and memory consumption.}},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1075.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1075},\n}\n\n','\n\nChristoph Müller, Piotr Rygielski, Simon Spinner, and Samuel Kounev.\nEnabling Fluid Analysis for Queueing Petri Nets via Model\nTransformation.\nIn Proceedings of the Eighth International Workshop on Practical\nApplications of Stochastic Modelling (PASM 2016), Münster, Germany,\nApril 5, 2016, Electronic Notes in Theoretical Computer Science (ENTCS).\nElsevier.\nApril 2016.\n[ bib | slides | .pdf | Abstract  ] 
\n@inproceedings{MuRySpKo2016-PASM-QPN-LQN-Transformation,\nauthor = {Christoph M\\\"{u}ller and Piotr Rygielski and Simon Spinner and Samuel Kounev},\ntitle = {{Enabling Fluid Analysis for Queueing Petri Nets via Model Transformation}},\nbooktitle = {Proceedings of the Eighth International Workshop on Practical Applications of Stochastic Modelling (PASM 2016)},\nyear = {2016},\nmonth = {April},\nday = {5},\nlocation = {M\\\"{u}nster, Germany},\nseries = {{Electronic Notes in Theoretical Computer Science (ENTCS)}},\npublisher = {Elsevier},\nabstract = {{Due to the growing size of modern IT systems, their performance analysis becomes an even more challenging task. Existing simulators are unable to analyze the behavior of large systems in a reasonable time, whereas analytical methods suffer from the state space explosion problem. Fluid analysis techniques can be used to approximate the solution of high-order Markov chain models enabling time efficient analysis of large performance models. In this paper, we describe a model-to-model transformation from queueing Petri nets (QPN) into layered queueing networks (LQN). Obtained LQN models can benefit from three existing solvers: LINE, LQNS, LQSIM. LINE internally utilize fluid limits approximation to speed up the solving process for large models. We present the incentives for developing the automated model-to-model transformation and present a systematic approach that we followed in its design. We demonstrate the transformations using representative examples. Finally, we evaluate and compare the performance predictions of existing analytical, simulation and fluid analysis solvers. We analyze solver\'s limitations, solving time, and memory consumption.}},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1075.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1075}\n}\n
\n
\nDue to the growing size of modern IT systems, their performance analysis becomes an even more challenging task. Existing simulators are unable to analyze the behavior of large systems in a reasonable time, whereas analytical methods suffer from the state space explosion problem. Fluid analysis techniques can be used to approximate the solution of high-order Markov chain models enabling time efficient analysis of large performance models. In this paper, we describe a model-to-model transformation from queueing Petri nets (QPN) into layered queueing networks (LQN). Obtained LQN models can benefit from three existing solvers: LINE, LQNS, LQSIM. LINE internally utilize fluid limits approximation to speed up the solving process for large models. We present the incentives for developing the automated model-to-model transformation and present a systematic approach that we followed in its design. We demonstrate the transformations using representative examples. Finally, we evaluate and compare the performance predictions of existing analytical, simulation and fluid analysis solvers. We analyze solver\'s limitations, solving time, and memory consumption.\n
\n','
\n@inproceedings{MuRySpKo2016-PASM-QPN-LQN-Transformation,\n  author = {Christoph M\\\"{u}ller and Piotr Rygielski and Simon Spinner and Samuel Kounev},\n  title = {{Enabling Fluid Analysis for Queueing Petri Nets via Model Transformation}},\n  booktitle = {Proceedings of the Eighth International Workshop on Practical Applications of Stochastic Modelling (PASM 2016)},\n  year = {2016},\n  month = {April},\n  day = {5},\n  location = {M\\\"{u}nster, Germany},\n  series = {{Electronic Notes in Theoretical Computer Science (ENTCS)}},\n  publisher = {Elsevier},\n  abstract = {{Due to the growing size of modern IT systems, their performance analysis becomes an even more challenging task. Existing simulators are unable to analyze the behavior of large systems in a reasonable time, whereas analytical methods suffer from the state space explosion problem. Fluid analysis techniques can be used to approximate the solution of high-order Markov chain models enabling time efficient analysis of large performance models. In this paper, we describe a model-to-model transformation from queueing Petri nets (QPN) into layered queueing networks (LQN). Obtained LQN models can benefit from three existing solvers: LINE, LQNS, LQSIM. LINE internally utilize fluid limits approximation to speed up the solving process for large models. We present the incentives for developing the automated model-to-model transformation and present a systematic approach that we followed in its design. We demonstrate the transformations using representative examples. Finally, we evaluate and compare the performance predictions of existing analytical, simulation and fluid analysis solvers. We analyze solver\'s limitations, solving time, and memory consumption.}},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1075.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1075}\n}\n
\n\n','{Due to the growing size of modern IT systems, their performance analysis becomes an even more challenging task. Existing simulators are unable to analyze the behavior of large systems in a reasonable time, whereas analytical methods suffer from the state space explosion problem. Fluid analysis techniques can be used to approximate the solution of high-order Markov chain models enabling time efficient analysis of large performance models. In this paper, we describe a model-to-model transformation from queueing Petri nets (QPN) into layered queueing networks (LQN). Obtained LQN models can benefit from three existing solvers: LINE, LQNS, LQSIM. LINE internally utilize fluid limits approximation to speed up the solving process for large models. We present the incentives for developing the automated model-to-model transformation and present a systematic approach that we followed in its design. We demonstrate the transformations using representative examples. Finally, we evaluate and compare the performance predictions of existing analytical, simulation and fluid analysis solvers. We analyze solver\'s limitations, solving time, and memory consumption.}','{Enabling Fluid Analysis for Queueing Petri Nets via Model Transformation}',0,4,2016,4,NULL,NULL,NULL,'2016-02-23 08:48:38','2016-06-01 09:41:09',0),(1077,'paper','KoBrMeBeKoKoRy2016-SE-tradeoffs_perf_prediction_approaches','inproceedings','@inproceedings{KoBrMeBeKoKoRy2016-SE-tradeoffs_perf_prediction_approaches,\n author = {Samuel Kounev and Fabian Brosig and Philipp Meier and Steffen Becker and Anne Koziolek and Heiko Koziolek and Piotr Rygielski},\n title = {{Analysis of the Trade-offs in Different Modeling Approaches for Performance Prediction of Software Systems}},\n booktitle = {Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. M\\\"{a}rz 2016, Vienna, Austria},\n publisher = {GI},\n series = {Lecture Notes in Informatics (LNI)},\n address = {Vienna, Austria},\n days = {23-26},\n month = {February},\n year = {2016},\n pages = {47--48},\n titleaddon = {{(Talk Extended Abstract)}},\n http = {http://subs.emis.de/LNI/Proceedings/Proceedings252/article3.html},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1077.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1077},\n}\n\n','\n\nSamuel Kounev, Fabian Brosig, Philipp Meier, Steffen Becker, Anne Koziolek,\nHeiko Koziolek, and Piotr Rygielski.\nAnalysis of the Trade-offs in Different Modeling Approaches for\nPerformance Prediction of Software Systems (Talk Extended Abstract).\nIn Software Engineering 2016 (SE 2016), Fachtagung des\nGI-Fachbereichs Softwaretechnik, 23.-26. März 2016, Vienna, Austria,\nFebruary 2016, Lecture Notes in Informatics (LNI), pages 47-48. GI, Vienna,\nAustria.\nFebruary 2016.\n[ bib | slides | .html | .pdf  ] 
\n@inproceedings{KoBrMeBeKoKoRy2016-SE-tradeoffs_perf_prediction_approaches,\nauthor = {Samuel Kounev and Fabian Brosig and Philipp Meier and Steffen Becker and Anne Koziolek and Heiko Koziolek and Piotr Rygielski},\ntitle = {{Analysis of the Trade-offs in Different Modeling Approaches for Performance Prediction of Software Systems}},\nbooktitle = {Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. M\\\"{a}rz 2016, Vienna, Austria},\npublisher = {GI},\nseries = {Lecture Notes in Informatics (LNI)},\naddress = {Vienna, Austria},\ndays = {23-26},\nmonth = {February},\nyear = {2016},\npages = {47--48},\ntitleaddon = {{(Talk Extended Abstract)}},\nhttp = {http://subs.emis.de/LNI/Proceedings/Proceedings252/article3.html},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1077.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1077}\n}\n
\n
\n','
\n@inproceedings{KoBrMeBeKoKoRy2016-SE-tradeoffs_perf_prediction_approaches,\n  author = {Samuel Kounev and Fabian Brosig and Philipp Meier and Steffen Becker and Anne Koziolek and Heiko Koziolek and Piotr Rygielski},\n  title = {{Analysis of the Trade-offs in Different Modeling Approaches for Performance Prediction of Software Systems}},\n  booktitle = {Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. M\\\"{a}rz 2016, Vienna, Austria},\n  publisher = {GI},\n  series = {Lecture Notes in Informatics (LNI)},\n  address = {Vienna, Austria},\n  days = {23-26},\n  month = {February},\n  year = {2016},\n  pages = {47--48},\n  titleaddon = {{(Talk Extended Abstract)}},\n  http = {http://subs.emis.de/LNI/Proceedings/Proceedings252/article3.html},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1077.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1077}\n}\n
\n\n',NULL,'{Analysis of the Trade-offs in Different Modeling Approaches for Performance Prediction of Software Systems}',0,2,2016,2,NULL,NULL,NULL,'2016-02-24 17:09:58','2016-06-01 09:41:09',0),(1080,'paper','LibredePressIdw2016','article','@article{LibredePressIdw2016,\n author = {Informationsdienst Wissenschaft (Idw) (Robert Emmerich)},\n title = {{Informatiker erh\\\"{a}lt Google Research Award}},\n year = {2016},\n month = {February},\n day = {29},\n url = {https://idw-online.de/de/news646849},\n comment = {Samuel Kounev and Simon Spinner},\n}\n\n','\n\nInformationsdienst Wissenschaft (Idw) (Robert Emmerich).\nInformatiker erhält Google Research Award.\nFebruary 2016.\n[ bib | http  ] 
\n@article{LibredePressIdw2016,\nauthor = {Informationsdienst Wissenschaft (Idw) (Robert Emmerich)},\ntitle = {{Informatiker erh\\\"{a}lt Google Research Award}},\nyear = {2016},\nmonth = {February},\nday = {29},\nurl = {https://idw-online.de/de/news646849},\ncomment = {Samuel Kounev and Simon Spinner}\n}\n
\n
\n','
\n@article{LibredePressIdw2016,\n  author = {Informationsdienst Wissenschaft (Idw) (Robert Emmerich)},\n  title = {{Informatiker erh\\\"{a}lt Google Research Award}},\n  year = {2016},\n  month = {February},\n  day = {29},\n  url = {https://idw-online.de/de/news646849},\n  comment = {Samuel Kounev and Simon Spinner}\n}\n
\n\n',NULL,'{Informatiker erh\\\"{a}lt Google Research Award}',0,2,2016,2,NULL,NULL,NULL,'2016-03-02 15:19:53','2016-06-01 09:41:09',0),(1081,'paper','LibredePressEinblick2016','article','@article{LibredePressEinblick2016,\n author = {einBLICK (Vera Katzenberger)},\n title = {{Informatiker erh\\\"{a}lt Google Research Award}},\n year = {2016},\n month = {March},\n day = {1},\n url = {http://www.presse.uni-wuerzburg.de/einblick/single/artikel/informatiker-erhaelt-google-research-award/},\n comment = {Samuel Kounev and Simon Spinner},\n publisher = {Universit\\\"{a}t W\\\"{u}rzburg},\n volume = {Ausgabe 8, 2016},\n}\n\n','\n\neinBLICK (Vera Katzenberger).\nInformatiker erhält Google Research Award.\nAusgabe 8, 2016, March 2016, Universität Würzburg.\n[ bib | http  ] 
\n@article{LibredePressEinblick2016,\nauthor = {einBLICK (Vera Katzenberger)},\ntitle = {{Informatiker erh\\\"{a}lt Google Research Award}},\nyear = {2016},\nmonth = {March},\nday = {1},\nurl = {http://www.presse.uni-wuerzburg.de/einblick/single/artikel/informatiker-erhaelt-google-research-award/},\ncomment = {Samuel Kounev and Simon Spinner},\npublisher = {Universit\\\"{a}t W\\\"{u}rzburg},\nvolume = {Ausgabe 8, 2016}\n}\n
\n
\n','
\n@article{LibredePressEinblick2016,\n  author = {einBLICK (Vera Katzenberger)},\n  title = {{Informatiker erh\\\"{a}lt Google Research Award}},\n  year = {2016},\n  month = {March},\n  day = {1},\n  url = {http://www.presse.uni-wuerzburg.de/einblick/single/artikel/informatiker-erhaelt-google-research-award/},\n  comment = {Samuel Kounev and Simon Spinner},\n  publisher = {Universit\\\"{a}t W\\\"{u}rzburg},\n  volume = {Ausgabe 8, 2016}\n}\n
\n\n',NULL,'{Informatiker erh\\\"{a}lt Google Research Award}',0,3,2016,3,NULL,NULL,NULL,'2016-03-02 15:57:42','2016-06-01 09:41:09',0),(1082,'paper','KounevPressWiWO2014','article','@article{KounevPressWiWO2014,\n author = {(Dieter D\\\"{u}rand), Wirtschaftswoche},\n title = {{Intelligente Computer - Die Menschwerdung der Maschine}},\n year = {2014},\n month = {August},\n day = {2},\n url = {http://www.wiwo.de/technologie/digitale-welt/intelligente-computer-die-menschwerdung-der-maschine/10278182.html},\n comment = {Samuel Kounev},\n publisher = {Verlagsgruppe Handelsblatt},\n volume = {Ausgabe 32/2014},\n}\n\n','\n\nWirtschaftswoche (Dieter Dürand).\nIntelligente Computer - Die Menschwerdung der Maschine.\nAusgabe 32/2014, August 2014, Verlagsgruppe Handelsblatt.\n[ bib | .html  ] 
\n@article{KounevPressWiWO2014,\nauthor = {(Dieter D\\\"{u}rand), Wirtschaftswoche},\ntitle = {{Intelligente Computer - Die Menschwerdung der Maschine}},\nyear = {2014},\nmonth = {August},\nday = {2},\nurl = {http://www.wiwo.de/technologie/digitale-welt/intelligente-computer-die-menschwerdung-der-maschine/10278182.html},\ncomment = {Samuel Kounev},\npublisher = {Verlagsgruppe Handelsblatt},\nvolume = {Ausgabe 32/2014}\n}\n
\n
\n','
\n@article{KounevPressWiWO2014,\n  author = {(Dieter D\\\"{u}rand), Wirtschaftswoche},\n  title = {{Intelligente Computer - Die Menschwerdung der Maschine}},\n  year = {2014},\n  month = {August},\n  day = {2},\n  url = {http://www.wiwo.de/technologie/digitale-welt/intelligente-computer-die-menschwerdung-der-maschine/10278182.html},\n  comment = {Samuel Kounev},\n  publisher = {Verlagsgruppe Handelsblatt},\n  volume = {Ausgabe 32/2014}\n}\n
\n\n',NULL,'{Intelligente Computer - Die Menschwerdung der Maschine}',0,8,2014,8,NULL,NULL,NULL,'2016-03-07 12:50:46','2016-06-01 09:41:09',0),(1083,'paper','SPEC-RG-2016-01-CloudMetrics','techreport','@techreport{SPEC-RG-2016-01-CloudMetrics,\n title = {{Ready for Rain? A View from SPEC Research on the Future of Cloud Metrics}},\n author = {Nikolas Herbst and Rouven Krebs and Giorgos Oikonomou and George Kousiouris and Athanasia Evangelinou and Alexandru Iosup and Samuel Kounev},\n institution = {SPEC Research Group --- Cloud Working Group, Standard Performance Evaluation Corporation (SPEC)},\n year = {2016},\n month = {},\n number = {SPEC-RG-2016-01},\n url = {https://research.spec.org/fileadmin/user_upload/documents/rg_cloud/endorsed_publications/SPEC-RG-2016-01_CloudMetrics.pdf},\n}\n\n','\n\nNikolas Herbst, Rouven Krebs, Giorgos Oikonomou, George Kousiouris, Athanasia\nEvangelinou, Alexandru Iosup, and Samuel Kounev.\nReady for Rain? A View from SPEC Research on the Future of Cloud\nMetrics.\nTechnical Report SPEC-RG-2016-01, SPEC Research Group - Cloud\nWorking Group, Standard Performance Evaluation Corporation (SPEC), 2016.\n[ bib | .pdf  ] 
\n@techreport{SPEC-RG-2016-01-CloudMetrics,\ntitle = {{Ready for Rain? A View from SPEC Research on the Future of Cloud Metrics}},\nauthor = {Nikolas Herbst and Rouven Krebs and Giorgos Oikonomou and George Kousiouris and Athanasia Evangelinou and Alexandru Iosup and Samuel Kounev},\ninstitution = {SPEC Research Group --- Cloud Working Group, Standard Performance Evaluation Corporation (SPEC)},\nyear = {2016},\nmonth = {},\nnumber = {SPEC-RG-2016-01},\nurl = {https://research.spec.org/fileadmin/user_upload/documents/rg_cloud/endorsed_publications/SPEC-RG-2016-01_CloudMetrics.pdf}\n}\n
\n
\n','
\n@techreport{SPEC-RG-2016-01-CloudMetrics,\n  title = {{Ready for Rain? A View from SPEC Research on the Future of Cloud Metrics}},\n  author = {Nikolas Herbst and Rouven Krebs and Giorgos Oikonomou and George Kousiouris and Athanasia Evangelinou and Alexandru Iosup and Samuel Kounev},\n  institution = {SPEC Research Group --- Cloud Working Group, Standard Performance Evaluation Corporation (SPEC)},\n  year = {2016},\n  month = {},\n  number = {SPEC-RG-2016-01},\n  url = {https://research.spec.org/fileadmin/user_upload/documents/rg_cloud/endorsed_publications/SPEC-RG-2016-01_CloudMetrics.pdf}\n}\n
\n\n',NULL,'{Ready for Rain? A View from SPEC Research on the Future of Cloud Metrics}',0,0,2016,0,NULL,NULL,NULL,'2016-03-09 09:55:01','2016-06-01 09:41:09',0),(1084,'paper','pressLibredeMainEcho2016','article','@article{pressLibredeMainEcho2016,\n author = {Main-Echo},\n title = {{Internet ist so klimasch\\\"{a}dlich wie Flugzeuge}},\n location = {{W\\\"{u}rzburg}},\n year = {2016},\n month = {March},\n day = {2},\n url = {http://www.main-echo.de/regional/franken-bayern/art4006,4009504},\n}\n\n','\n\nMain-Echo.\nInternet ist so klimaschädlich wie Flugzeuge.\nMarch 2016.\n[ bib | http  ] 
\n@article{pressLibredeMainEcho2016,\nauthor = {Main-Echo},\ntitle = {{Internet ist so klimasch\\\"{a}dlich wie Flugzeuge}},\nlocation = {{W\\\"{u}rzburg}},\nyear = {2016},\nmonth = {March},\nday = {2},\nurl = {http://www.main-echo.de/regional/franken-bayern/art4006,4009504}\n}\n
\n
\n','
\n@article{pressLibredeMainEcho2016,\n  author = {Main-Echo},\n  title = {{Internet ist so klimasch\\\"{a}dlich wie Flugzeuge}},\n  location = {{W\\\"{u}rzburg}},\n  year = {2016},\n  month = {March},\n  day = {2},\n  url = {http://www.main-echo.de/regional/franken-bayern/art4006,4009504}\n}\n
\n\n',NULL,'{Internet ist so klimasch\\\"{a}dlich wie Flugzeuge}',0,3,2016,3,NULL,NULL,NULL,'2016-03-09 12:41:35','2016-06-01 09:41:09',0),(1085,'paper','pressLibredeMainPost2016','article','@article{pressLibredeMainPost2016,\n author = {Main-Post},\n title = {{CO2-Aussto\\ss{} von Rechnern verringern}},\n location = {{W\\\"{u}rzburg}},\n year = {2016},\n month = {March},\n day = {4},\n url = {http://m.mainpost.de/97070-W%FCrzburg~artikel/Rechenzentren-Treibhausgase;art735,9139925},\n}\n\n','\n\nMain-Post.\nCO2-Ausstoß von Rechnern verringern.\nMarch 2016.\n[ bib | http  ] 
\n@article{pressLibredeMainPost2016,\nauthor = {Main-Post},\ntitle = {{CO2-Aussto\\ss{} von Rechnern verringern}},\nlocation = {{W\\\"{u}rzburg}},\nyear = {2016},\nmonth = {March},\nday = {4},\nurl = {http://m.mainpost.de/97070-W%FCrzburg~artikel/Rechenzentren-Treibhausgase;art735,9139925}\n}\n
\n
\n','
\n@article{pressLibredeMainPost2016,\n  author = {Main-Post},\n  title = {{CO2-Aussto\\ss{} von Rechnern verringern}},\n  location = {{W\\\"{u}rzburg}},\n  year = {2016},\n  month = {March},\n  day = {4},\n  url = {http://m.mainpost.de/97070-W%FCrzburg~artikel/Rechenzentren-Treibhausgase;art735,9139925}\n}\n
\n\n',NULL,'{CO2-Aussto\\ss{} von Rechnern verringern}',0,3,2016,3,NULL,NULL,NULL,'2016-03-09 12:48:36','2016-06-01 09:41:09',0),(1086,'paper','SPEC-RG-NEWSLETTER-5','misc','@misc{SPEC-RG-NEWSLETTER-5,\n author = {Samuel Kounev and Andre van Hoorn and Piotr Rygielski},\n month = {March},\n note = {Published by Standard Performance Evaluation Corporation (SPEC)},\n title = {{SPEC Research Group Newsletter, vol. 2 no. 1}},\n url = {http://research.spec.org/en/newsletter.html},\n year = {2016},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1086.pdf},\n}\n\n','\n\nSamuel Kounev, Andre van Hoorn, and Piotr Rygielski.\nSPEC Research Group Newsletter, vol. 2 no. 1, March 2016.\nPublished by Standard Performance Evaluation Corporation (SPEC).\n[ bib | .html | .pdf  ] 
\n@misc{SPEC-RG-NEWSLETTER-5,\nauthor = {Samuel Kounev and Andre van Hoorn and Piotr Rygielski},\nmonth = {March},\nnote = {Published by Standard Performance Evaluation Corporation (SPEC)},\ntitle = {{SPEC Research Group Newsletter, vol. 2 no. 1}},\nurl = {http://research.spec.org/en/newsletter.html},\nyear = {2016},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1086.pdf}\n}\n
\n
\n','
\n@misc{SPEC-RG-NEWSLETTER-5,\n  author = {Samuel Kounev and Andre van Hoorn and Piotr Rygielski},\n  month = {March},\n  note = {Published by Standard Performance Evaluation Corporation (SPEC)},\n  title = {{SPEC Research Group Newsletter, vol. 2 no. 1}},\n  url = {http://research.spec.org/en/newsletter.html},\n  year = {2016},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1086.pdf}\n}\n
\n\n',NULL,'{SPEC Research Group Newsletter, vol. 2 no. 1}',0,3,2016,3,NULL,NULL,NULL,'2016-03-12 15:34:10','2016-06-01 09:41:09',0),(1087,'paper','Stoll2016','mastersthesis','@mastersthesis{Stoll2016,\n author = {Jonathan Stoll},\n address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n title = {{SDN-basierte Lastverteilung f\\\"ur Schicht-7 Anfragen (SDN Rechenzentrum Fallstudie)}},\n type = {{Bachelor Thesis}},\n school = {University of W\\\"{u}rzburg},\n year = {2016},\n month = {March},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1087.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1087},\n}\n\n','\n\nJonathan Stoll.\nSDN-basierte Lastverteilung für Schicht-7 Anfragen (SDN\nRechenzentrum Fallstudie).\nBachelor Thesis, University of Würzburg, Am Hubland,\nInformatikgebäude, 97074 Würzburg, Germany, March 2016.\n[ bib | slides | .pdf  ] 
\n@mastersthesis{Stoll2016,\nauthor = {Jonathan Stoll},\naddress = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\ntitle = {{SDN-basierte Lastverteilung f\\\"ur Schicht-7 Anfragen (SDN Rechenzentrum Fallstudie)}},\ntype = {{Bachelor Thesis}},\nschool = {University of W\\\"{u}rzburg},\nyear = {2016},\nmonth = {March},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1087.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1087}\n}\n
\n
\n','
\n@mastersthesis{Stoll2016,\n  author = {Jonathan Stoll},\n  address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n  title = {{SDN-basierte Lastverteilung f\\\"ur Schicht-7 Anfragen (SDN Rechenzentrum Fallstudie)}},\n  type = {{Bachelor Thesis}},\n  school = {University of W\\\"{u}rzburg},\n  year = {2016},\n  month = {March},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1087.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1087}\n}\n
\n\n',NULL,'{SDN-basierte Lastverteilung f\\\"ur Schicht-7 Anfragen (SDN Rechenzentrum Fallstudie)}',0,3,2016,3,NULL,NULL,NULL,'2016-03-12 15:41:54','2016-06-01 09:41:09',0),(1088,'paper','Mi-CSA-SecPos','misc','@misc{Mi-CSA-SecPos,\n author = {Aleksandar Milenkoski and Bernd Jaeger and Kapil Raina and Mason Harris and Saif Chaudhry and Sivadon Chasiri and Veronica David and Wenmao Liu},\n month = {March},\n note = {Published by Cloud Security Alliance (CSA) - Virtualization Working Group},\n title = {{Security Position Paper: Network Function Virtualization}},\n url = {https://cloudsecurityalliance.org/download/security-position-paper-network-function-virtualization/},\n year = {2016},\n pdf = {https://downloads.cloudsecurityalliance.org/assets/research/virtualization/Security_Position_Paper-Network_Function_Virtualization.pdf},\n}\n\n','\n\nAleksandar Milenkoski, Bernd Jaeger, Kapil Raina, Mason Harris, Saif Chaudhry,\nSivadon Chasiri, Veronica David, and Wenmao Liu.\nSecurity Position Paper: Network Function Virtualization, March\n2016.\nPublished by Cloud Security Alliance (CSA) - Virtualization Working\nGroup.\n[ bib | http | .pdf  ] 
\n@misc{Mi-CSA-SecPos,\nauthor = {Aleksandar Milenkoski and Bernd Jaeger and Kapil Raina and Mason Harris and Saif Chaudhry and Sivadon Chasiri and Veronica David and Wenmao Liu},\nmonth = {March},\nnote = {Published by Cloud Security Alliance (CSA) - Virtualization Working Group},\ntitle = {{Security Position Paper: Network Function Virtualization}},\nurl = {https://cloudsecurityalliance.org/download/security-position-paper-network-function-virtualization/},\nyear = {2016},\npdf = {https://downloads.cloudsecurityalliance.org/assets/research/virtualization/Security_Position_Paper-Network_Function_Virtualization.pdf}\n}\n
\n
\n','
\n@misc{Mi-CSA-SecPos,\n  author = {Aleksandar Milenkoski and Bernd Jaeger and Kapil Raina and Mason Harris and Saif Chaudhry and Sivadon Chasiri and Veronica David and Wenmao Liu},\n  month = {March},\n  note = {Published by Cloud Security Alliance (CSA) - Virtualization Working Group},\n  title = {{Security Position Paper: Network Function Virtualization}},\n  url = {https://cloudsecurityalliance.org/download/security-position-paper-network-function-virtualization/},\n  year = {2016},\n  pdf = {https://downloads.cloudsecurityalliance.org/assets/research/virtualization/Security_Position_Paper-Network_Function_Virtualization.pdf}\n}\n
\n\n',NULL,'{Security Position Paper: Network Function Virtualization}',0,3,2016,3,NULL,NULL,NULL,'2016-03-29 11:48:51','2016-06-01 09:41:09',0),(1089,'paper','Mi-CSA-BestPr','misc','@misc{Mi-CSA-BestPr,\n author = {Abhik Chaudhuri and Heberto Ferrer and Hemma Prafullchandra and J.D. Sherry and Kelvin Ng and Xiaoyu Ge and Yao Sing and Yiak Por and Aleksandar Milenkoski (Minor Contributor)},\n month = {April},\n note = {Published by Cloud Security Alliance (CSA) - Virtualization Working Group},\n title = {{Best Practices for Mitigating Risks in Virtualized Environments}},\n year = {2015},\n pdf = {https://downloads.cloudsecurityalliance.org/whitepapers/Best_Practices_for%20_Mitigating_Risks_Virtual_Environments_April2015_4-1-15_GLM5.pdf},\n}\n\n','\n\nAbhik Chaudhuri, Heberto Ferrer, Hemma Prafullchandra, J.D. Sherry, Kelvin Ng,\nXiaoyu Ge, Yao Sing, Yiak Por, and Aleksandar Milenkoski (Minor Contributor).\nBest Practices for Mitigating Risks in Virtualized Environments,\nApril 2015.\nPublished by Cloud Security Alliance (CSA) - Virtualization Working\nGroup.\n[ bib | .pdf  ] 
\n@misc{Mi-CSA-BestPr,\nauthor = {Abhik Chaudhuri and Heberto Ferrer and Hemma Prafullchandra and J.D. Sherry and Kelvin Ng and Xiaoyu Ge and Yao Sing and Yiak Por and Aleksandar Milenkoski (Minor Contributor)},\nmonth = {April},\nnote = {Published by Cloud Security Alliance (CSA) - Virtualization Working Group},\ntitle = {{Best Practices for Mitigating Risks in Virtualized Environments}},\nyear = {2015},\npdf = {https://downloads.cloudsecurityalliance.org/whitepapers/Best_Practices_for%20_Mitigating_Risks_Virtual_Environments_April2015_4-1-15_GLM5.pdf}\n}\n
\n
\n','
\n@misc{Mi-CSA-BestPr,\n  author = {Abhik Chaudhuri and Heberto Ferrer and Hemma Prafullchandra and J.D. Sherry and Kelvin Ng and Xiaoyu Ge and Yao Sing and Yiak Por and Aleksandar Milenkoski (Minor Contributor)},\n  month = {April},\n  note = {Published by Cloud Security Alliance (CSA) - Virtualization Working Group},\n  title = {{Best Practices for Mitigating Risks in Virtualized Environments}},\n  year = {2015},\n  pdf = {https://downloads.cloudsecurityalliance.org/whitepapers/Best_Practices_for%20_Mitigating_Risks_Virtual_Environments_April2015_4-1-15_GLM5.pdf}\n}\n
\n\n',NULL,'{Best Practices for Mitigating Risks in Virtualized Environments}',0,4,2015,4,NULL,NULL,NULL,'2016-03-29 11:53:11','2016-06-01 09:41:09',0),(1090,'paper','pressLibredeBR2016','misc','@misc{pressLibredeBR2016,\n author = {Bayern 2 (Radio)},\n title = {{ Prof. Samuel Kounev zu Klimakiller Internet}},\n location = {{W\\\"{u}rzburg}},\n year = {2016},\n month = {March},\n day = {10},\n url = {http://www.br.de/radio/bayern2/politik/radiowelt/prof-samuel-kounev-zu-klimakiller-internet-100.html},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1090.pdf},\n}\n\n','\n\nBayern 2 (Radio).\nProf. Samuel Kounev zu Klimakiller Internet, March 2016.\n[ bib | .html | .pdf  ] 
\n@misc{pressLibredeBR2016,\nauthor = {Bayern 2 (Radio)},\ntitle = {{ Prof. Samuel Kounev zu Klimakiller Internet}},\nlocation = {{W\\\"{u}rzburg}},\nyear = {2016},\nmonth = {March},\nday = {10},\nurl = {http://www.br.de/radio/bayern2/politik/radiowelt/prof-samuel-kounev-zu-klimakiller-internet-100.html},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1090.pdf}\n}\n
\n
\n','
\n@misc{pressLibredeBR2016,\n  author = {Bayern 2 (Radio)},\n  title = {{ Prof. Samuel Kounev zu Klimakiller Internet}},\n  location = {{W\\\"{u}rzburg}},\n  year = {2016},\n  month = {March},\n  day = {10},\n  url = {http://www.br.de/radio/bayern2/politik/radiowelt/prof-samuel-kounev-zu-klimakiller-internet-100.html},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1090.pdf}\n}\n
\n\n',NULL,'{ Prof. Samuel Kounev zu Klimakiller Internet}',0,3,2016,3,NULL,NULL,NULL,'2016-03-30 11:58:03','2016-06-01 09:41:09',0),(1091,'paper','Thiele2016','mastersthesis','@mastersthesis{Thiele2016,\n author = {Christoph Thiele},\n address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n title = {{A Capability Model for Solution Approaches in Performance Engineering}},\n type = {{Bachelor Thesis}},\n school = {University of W\\\"{u}rzburg},\n year = {2016},\n month = {March},\n day = {21},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1091.pdf},\n}\n\n','\n\nChristoph Thiele.\nA Capability Model for Solution Approaches in Performance\nEngineering.\nBachelor Thesis, University of Würzburg, Am Hubland,\nInformatikgebäude, 97074 Würzburg, Germany, March 2016.\n[ bib | .pdf  ] 
\n@mastersthesis{Thiele2016,\nauthor = {Christoph Thiele},\naddress = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\ntitle = {{A Capability Model for Solution Approaches in Performance Engineering}},\ntype = {{Bachelor Thesis}},\nschool = {University of W\\\"{u}rzburg},\nyear = {2016},\nmonth = {March},\nday = {21},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1091.pdf}\n}\n
\n
\n','
\n@mastersthesis{Thiele2016,\n  author = {Christoph Thiele},\n  address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n  title = {{A Capability Model for Solution Approaches in Performance Engineering}},\n  type = {{Bachelor Thesis}},\n  school = {University of W\\\"{u}rzburg},\n  year = {2016},\n  month = {March},\n  day = {21},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1091.pdf}\n}\n
\n\n',NULL,'{A Capability Model for Solution Approaches in Performance Engineering}',1,3,2016,3,NULL,NULL,NULL,'2016-03-30 15:29:17','2016-06-01 09:41:09',0),(1092,'paper','DML_IEEESoftwareblog2016','misc','@misc{DML_IEEESoftwareblog2016,\n author = {Samuel Kounev},\n editor = {Zhen Ming (Jack) Jiang},\n url = {http://blog.ieeesoftware.org/2016/04/the-descartes-modeling-language-for.html},\n title = {{The Descartes Modeling Language for Self-Aware Performance and Resource Management}},\n note = {IEEE Software Blog},\n year = {2016},\n month = {April},\n day = {3},\n}\n\n','\n\nSamuel Kounev.\nThe Descartes Modeling Language for Self-Aware Performance and\nResource Management, April 2016.\nIEEE Software Blog.\n[ bib | .html  ] 
\n@misc{DML_IEEESoftwareblog2016,\nauthor = {Samuel Kounev},\neditor = {Zhen Ming (Jack) Jiang},\nurl = {http://blog.ieeesoftware.org/2016/04/the-descartes-modeling-language-for.html},\ntitle = {{The Descartes Modeling Language for Self-Aware Performance and Resource Management}},\nnote = {IEEE Software Blog},\nyear = {2016},\nmonth = {April},\nday = {3}\n}\n
\n
\n','
\n@misc{DML_IEEESoftwareblog2016,\n  author = {Samuel Kounev},\n  editor = {Zhen Ming (Jack) Jiang},\n  url = {http://blog.ieeesoftware.org/2016/04/the-descartes-modeling-language-for.html},\n  title = {{The Descartes Modeling Language for Self-Aware Performance and Resource Management}},\n  note = {IEEE Software Blog},\n  year = {2016},\n  month = {April},\n  day = {3}\n}\n
\n\n',NULL,'{The Descartes Modeling Language for Self-Aware Performance and Resource Management}',0,4,2016,4,NULL,NULL,NULL,'2016-04-09 15:24:44','2016-06-01 09:41:09',0),(1097,'paper','WaHoKoOkKo2016-ICPE-DPE_Poster','misc','@misc{WaHoKoOkKo2016-ICPE-DPE_Poster,\n author = {J\\\"{u}rgen Walter and Andre van Hoorn and Heiko Koziolek and Dusan Okanovic and Samuel Kounev},\n title = {{The Vision of Declarative Performance Engineering}},\n booktitle = {{Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\n year = {2016},\n location = {Delft, the Netherlands},\n month = {March},\n day = {12},\n abstract = {Over the past decades, various methods, techniques, and tools for modeling and evaluating performance properties of software systems have been proposed covering the entire software life cycle. However, the application of performance engineering approaches to solve a given user concern is still rather challenging and requires expert knowledge and experience. There are no recipes on how to select, configure, and execute suitable methods, tools, and techniques allowing to address the user concerns. In this paper, we describe our vision of Declarative Performance Engineering (DPE), which aims to decouple the description of the user concerns to be solved (performance questions and goals) from the task of selecting and applying a specific solution approach. The strict separation of ``what\'\' versus ``how\'\' enables the development of different techniques and algorithms to automatically select and apply a suitable approach for a given scenario. The goal is to hide complexity from the user by allowing users to express their concerns and goals without requiring any knowledge about performance engineering techniques. Towards realizing the DPE vision, we discuss the different requirements and propose a reference architecture for implementing and integrating respective methods, algorithms, and tooling.},\n note = {Poster},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1097},\n}\n\n','\n\nJürgen Walter, Andre van Hoorn, Heiko Koziolek, Dusan Okanovic, and Samuel\nKounev.\nThe Vision of Declarative Performance Engineering, March 2016.\nPoster.\n[ bib | slides | Abstract  ] 
\n@misc{WaHoKoOkKo2016-ICPE-DPE_Poster,\nauthor = {J\\\"{u}rgen Walter and Andre van Hoorn and Heiko Koziolek and Dusan Okanovic and Samuel Kounev},\ntitle = {{The Vision of Declarative Performance Engineering}},\nbooktitle = {{Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\nyear = {2016},\nlocation = {Delft, the Netherlands},\nmonth = {March},\nday = {12},\nabstract = {Over the past decades, various methods, techniques, and tools for modeling and evaluating performance properties of software systems have been proposed covering the entire software life cycle. However, the application of performance engineering approaches to solve a given user concern is still rather challenging and requires expert knowledge and experience. There are no recipes on how to select, configure, and execute suitable methods, tools, and techniques allowing to address the user concerns. In this paper, we describe our vision of Declarative Performance Engineering (DPE), which aims to decouple the description of the user concerns to be solved (performance questions and goals) from the task of selecting and applying a specific solution approach. The strict separation of ``what\'\' versus ``how\'\' enables the development of different techniques and algorithms to automatically select and apply a suitable approach for a given scenario. The goal is to hide complexity from the user by allowing users to express their concerns and goals without requiring any knowledge about performance engineering techniques. Towards realizing the DPE vision, we discuss the different requirements and propose a reference architecture for implementing and integrating respective methods, algorithms, and tooling.},\nnote = {Poster},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1097}\n}\n
\n
\nOver the past decades, various methods, techniques, and tools for modeling and evaluating performance properties of software systems have been proposed covering the entire software life cycle. However, the application of performance engineering approaches to solve a given user concern is still rather challenging and requires expert knowledge and experience. There are no recipes on how to select, configure, and execute suitable methods, tools, and techniques allowing to address the user concerns. In this paper, we describe our vision of Declarative Performance Engineering (DPE), which aims to decouple the description of the user concerns to be solved (performance questions and goals) from the task of selecting and applying a specific solution approach. The strict separation of “what” versus “how” enables the development of different techniques and algorithms to automatically select and apply a suitable approach for a given scenario. The goal is to hide complexity from the user by allowing users to express their concerns and goals without requiring any knowledge about performance engineering techniques. Towards realizing the DPE vision, we discuss the different requirements and propose a reference architecture for implementing and integrating respective methods, algorithms, and tooling.\n
\n','
\n@misc{WaHoKoOkKo2016-ICPE-DPE_Poster,\n  author = {J\\\"{u}rgen Walter and Andre van Hoorn and Heiko Koziolek and Dusan Okanovic and Samuel Kounev},\n  title = {{The Vision of Declarative Performance Engineering}},\n  booktitle = {{Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\n  year = {2016},\n  location = {Delft, the Netherlands},\n  month = {March},\n  day = {12},\n  abstract = {Over the past decades, various methods, techniques, and tools for modeling and evaluating performance properties of software systems have been proposed covering the entire software life cycle. However, the application of performance engineering approaches to solve a given user concern is still rather challenging and requires expert knowledge and experience. There are no recipes on how to select, configure, and execute suitable methods, tools, and techniques allowing to address the user concerns. In this paper, we describe our vision of Declarative Performance Engineering (DPE), which aims to decouple the description of the user concerns to be solved (performance questions and goals) from the task of selecting and applying a specific solution approach. The strict separation of ``what\'\' versus ``how\'\' enables the development of different techniques and algorithms to automatically select and apply a suitable approach for a given scenario. The goal is to hide complexity from the user by allowing users to express their concerns and goals without requiring any knowledge about performance engineering techniques. Towards realizing the DPE vision, we discuss the different requirements and propose a reference architecture for implementing and integrating respective methods, algorithms, and tooling.},\n  note = {Poster},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1097}\n}\n
\n\n','Over the past decades, various methods, techniques, and tools for modeling and evaluating performance properties of software systems have been proposed covering the entire software life cycle. However, the application of performance engineering approaches to solve a given user concern is still rather challenging and requires expert knowledge and experience. There are no recipes on how to select, configure, and execute suitable methods, tools, and techniques allowing to address the user concerns. In this paper, we describe our vision of Declarative Performance Engineering (DPE), which aims to decouple the description of the user concerns to be solved (performance questions and goals) from the task of selecting and applying a specific solution approach. The strict separation of ``what\'\' versus ``how\'\' enables the development of different techniques and algorithms to automatically select and apply a suitable approach for a given scenario. The goal is to hide complexity from the user by allowing users to express their concerns and goals without requiring any knowledge about performance engineering techniques. Towards realizing the DPE vision, we discuss the different requirements and propose a reference architecture for implementing and integrating respective methods, algorithms, and tooling.','{The Vision of Declarative Performance Engineering}',0,3,2016,3,NULL,NULL,NULL,'2016-04-13 12:54:28','2016-06-01 09:41:09',0),(1098,'paper','Mueller2016','mastersthesis','@mastersthesis{Mueller2016,\n author = {Christoph M\\\"{u}ller},\n address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n title = {{Fluid Analysis of Queueing Petri Nets Models using Model-to-Model Transformations}},\n type = {{Master Thesis}},\n school = {University of W\\\"{u}rzburg},\n year = {2016},\n month = {April},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1098.pdf},\n}\n\n','\n\nChristoph Müller.\nFluid Analysis of Queueing Petri Nets Models using Model-to-Model\nTransformations.\nMaster Thesis, University of Würzburg, Am Hubland,\nInformatikgebäude, 97074 Würzburg, Germany, April 2016.\n[ bib | .pdf  ] 
\n@mastersthesis{Mueller2016,\nauthor = {Christoph M\\\"{u}ller},\naddress = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\ntitle = {{Fluid Analysis of Queueing Petri Nets Models using Model-to-Model Transformations}},\ntype = {{Master Thesis}},\nschool = {University of W\\\"{u}rzburg},\nyear = {2016},\nmonth = {April},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1098.pdf}\n}\n
\n
\n','
\n@mastersthesis{Mueller2016,\n  author = {Christoph M\\\"{u}ller},\n  address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n  title = {{Fluid Analysis of Queueing Petri Nets Models using Model-to-Model Transformations}},\n  type = {{Master Thesis}},\n  school = {University of W\\\"{u}rzburg},\n  year = {2016},\n  month = {April},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1098.pdf}\n}\n
\n\n',NULL,'{Fluid Analysis of Queueing Petri Nets Models using Model-to-Model Transformations}',1,4,2016,4,NULL,NULL,NULL,'2016-04-18 07:06:53','2016-06-01 09:41:09',0),(1099,'paper','SpinnerZLUGHK-2015-RADIO-MemoryScaling','inproceedings','@inproceedings{SpinnerZLUGHK-2015-RADIO-MemoryScaling,\n author = {Simon Spinner and Xiaoyun Zhu and Lei Lu and Mustafa Uysal and Rean Griffith and Nikolas Herbst and Samuel Kounev},\n title = {{Proactive Memory Scaling of Virtualized Applications}},\n booktitle = {VMware R&D Innovation Offsite (RADIO)},\n year = {2015},\n month = {July},\n}\n\n','\n\nSimon Spinner, Xiaoyun Zhu, Lei Lu, Mustafa Uysal, Rean Griffith, Nikolas\nHerbst, and Samuel Kounev.\nProactive Memory Scaling of Virtualized Applications.\nIn VMware R&D Innovation Offsite (RADIO), July 2015.\n[ bib  ] 
\n@inproceedings{SpinnerZLUGHK-2015-RADIO-MemoryScaling,\nauthor = {Simon Spinner and Xiaoyun Zhu and Lei Lu and Mustafa Uysal and Rean Griffith and Nikolas Herbst and Samuel Kounev},\ntitle = {{Proactive Memory Scaling of Virtualized Applications}},\nbooktitle = {VMware R&D Innovation Offsite (RADIO)},\nyear = {2015},\nmonth = {July}\n}\n
\n
\n','
\n@inproceedings{SpinnerZLUGHK-2015-RADIO-MemoryScaling,\n  author = {Simon Spinner and Xiaoyun Zhu and Lei Lu and Mustafa Uysal and Rean Griffith and Nikolas Herbst and Samuel Kounev},\n  title = {{Proactive Memory Scaling of Virtualized Applications}},\n  booktitle = {VMware R&D Innovation Offsite (RADIO)},\n  year = {2015},\n  month = {July}\n}\n
\n\n',NULL,'{Proactive Memory Scaling of Virtualized Applications}',1,7,2015,7,NULL,NULL,NULL,'2016-04-20 15:12:15','2016-06-01 09:41:09',0),(1100,'paper','SpinnerKZLUHGP-2014-RADIO-ModelBasedScaling','inproceedings','@inproceedings{SpinnerKZLUHGP-2014-RADIO-ModelBasedScaling,\n author = {Simon Spinner and Samuel Kounev and Xiaoyun Zhu and Lei Lu and Mustafa Uysal and Anne Holler and Rean Griffith and Pradeep Padala},\n title = {{Model-Based Runtime Performance Management for Virtualized Applications}},\n booktitle = {VMware R&D Innovation Offsite (RADIO)},\n year = {2014},\n month = {July},\n}\n\n','\n\nSimon Spinner, Samuel Kounev, Xiaoyun Zhu, Lei Lu, Mustafa Uysal, Anne Holler,\nRean Griffith, and Pradeep Padala.\nModel-Based Runtime Performance Management for Virtualized\nApplications.\nIn VMware R&D Innovation Offsite (RADIO), July 2014.\n[ bib  ] 
\n@inproceedings{SpinnerKZLUHGP-2014-RADIO-ModelBasedScaling,\nauthor = {Simon Spinner and Samuel Kounev and Xiaoyun Zhu and Lei Lu and Mustafa Uysal and Anne Holler and Rean Griffith and Pradeep Padala},\ntitle = {{Model-Based Runtime Performance Management for Virtualized Applications}},\nbooktitle = {VMware R&D Innovation Offsite (RADIO)},\nyear = {2014},\nmonth = {July}\n}\n
\n
\n','
\n@inproceedings{SpinnerKZLUHGP-2014-RADIO-ModelBasedScaling,\n  author = {Simon Spinner and Samuel Kounev and Xiaoyun Zhu and Lei Lu and Mustafa Uysal and Anne Holler and Rean Griffith and Pradeep Padala},\n  title = {{Model-Based Runtime Performance Management for Virtualized Applications}},\n  booktitle = {VMware R&D Innovation Offsite (RADIO)},\n  year = {2014},\n  month = {July}\n}\n
\n\n',NULL,'{Model-Based Runtime Performance Management for Virtualized Applications}',1,7,2014,7,NULL,NULL,NULL,'2016-04-20 15:19:21','2016-06-01 09:41:09',0),(1101,'paper','pressLibredeRundschau2016','misc','@misc{pressLibredeRundschau2016,\n author = {Bayrischer Rundfunk (BR) - Rundschau},\n title = {{Stromverbrauch: Preis f\\\"{u}r W\\\"{u}rzburger Uni}},\n location = {{W\\\"{u}rzburg}},\n year = {2016},\n month = {April},\n day = {26},\n url = {http://www.br.de/mediathek/video/sendungen/nachrichten/sendung-vom-26042016_x-100.html},\n note = {Report starts at 10:18},\n}\n\n','\n\nBayrischer Rundfunk (BR) Rundschau.\nStromverbrauch: Preis für Würzburger Uni, April 2016.\nReport starts at 10:18.\n[ bib | .html  ] 
\n@misc{pressLibredeRundschau2016,\nauthor = {Bayrischer Rundfunk (BR) - Rundschau},\ntitle = {{Stromverbrauch: Preis f\\\"{u}r W\\\"{u}rzburger Uni}},\nlocation = {{W\\\"{u}rzburg}},\nyear = {2016},\nmonth = {April},\nday = {26},\nurl = {http://www.br.de/mediathek/video/sendungen/nachrichten/sendung-vom-26042016_x-100.html},\nnote = {Report starts at 10:18}\n}\n
\n
\n','
\n@misc{pressLibredeRundschau2016,\n  author = {Bayrischer Rundfunk (BR) - Rundschau},\n  title = {{Stromverbrauch: Preis f\\\"{u}r W\\\"{u}rzburger Uni}},\n  location = {{W\\\"{u}rzburg}},\n  year = {2016},\n  month = {April},\n  day = {26},\n  url = {http://www.br.de/mediathek/video/sendungen/nachrichten/sendung-vom-26042016_x-100.html},\n  note = {Report starts at 10:18}\n}\n
\n\n',NULL,'{Stromverbrauch: Preis f\\\"{u}r W\\\"{u}rzburger Uni}',0,4,2016,4,NULL,NULL,NULL,'2016-04-27 07:17:22','2016-06-01 09:41:09',0),(1103,'talk','Talk-KoBrMeBeKoKoRy2016-SE-tradeoffs_perf_prediction_approaches','misc','@misc{Talk-KoBrMeBeKoKoRy2016-SE-tradeoffs_perf_prediction_approaches,\n address = {Vienna, Austria},\n author = {Samuel Kounev and Fabian Brosig and Philipp Meier and Steffen Becker and Anne Koziolek and Heiko Koziolek and Piotr Rygielski},\n howpublished = {Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. M\\\"{a}rz 2016, Vienna, Austria},\n title = {{Analysis of the Trade-offs in Different Modeling Approaches for Performance Prediction of Software Systems}},\n days = {23-26},\n month = {February},\n year = {2016},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1077},\n}\n\n','\n\nSamuel Kounev, Fabian Brosig, Philipp Meier, Steffen Becker, Anne Koziolek,\nHeiko Koziolek, and Piotr Rygielski.\nAnalysis of the Trade-offs in Different Modeling Approaches for\nPerformance Prediction of Software Systems.\nSoftware Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs\nSoftwaretechnik, 23.-26. März 2016, Vienna, Austria, February 2016.\n[ bib | slides  ] 
\n@misc{Talk-KoBrMeBeKoKoRy2016-SE-tradeoffs_perf_prediction_approaches,\naddress = {Vienna, Austria},\nauthor = {Samuel Kounev and Fabian Brosig and Philipp Meier and Steffen Becker and Anne Koziolek and Heiko Koziolek and Piotr Rygielski},\nhowpublished = {Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. M\\\"{a}rz 2016, Vienna, Austria},\ntitle = {{Analysis of the Trade-offs in Different Modeling Approaches for Performance Prediction of Software Systems}},\ndays = {23-26},\nmonth = {February},\nyear = {2016},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1077}\n}\n
\n
\n','
\n@misc{Talk-KoBrMeBeKoKoRy2016-SE-tradeoffs_perf_prediction_approaches,\n  address = {Vienna, Austria},\n  author = {Samuel Kounev and Fabian Brosig and Philipp Meier and Steffen Becker and Anne Koziolek and Heiko Koziolek and Piotr Rygielski},\n  howpublished = {Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. M\\\"{a}rz 2016, Vienna, Austria},\n  title = {{Analysis of the Trade-offs in Different Modeling Approaches for Performance Prediction of Software Systems}},\n  days = {23-26},\n  month = {February},\n  year = {2016},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1077}\n}\n
\n\n',NULL,'{Analysis of the Trade-offs in Different Modeling Approaches for Performance Prediction of Software Systems}',0,2,2016,2,NULL,NULL,NULL,'2016-04-30 11:08:00','2016-06-01 09:41:09',0),(1104,'paper','BuNoKoKoReAm-SE-IO_Workload_Characterization','inproceedings','@inproceedings{BuNoKoKoReAm-SE-IO_Workload_Characterization,\n author = {Axel Busch and Qais Noorshams and Samuel Kounev and Anne Koziolek and Ralf Reussner and Erich Amrehn},\n title = {{Automated Workload Characterization for I/O Performance Analysis in Virtualized Environments}},\n booktitle = {Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. M\\\"{a}rz 2016, Vienna, Austria},\n publisher = {GI},\n series = {Lecture Notes in Informatics (LNI)},\n address = {Vienna, Austria},\n days = {23-26},\n month = {February},\n pages = {27--28},\n year = {2016},\n titleaddon = {{(Talk Extended Abstract)}},\n http = {http://subs.emis.de/LNI/Proceedings/Proceedings252/article48.html},\n pdf = {http://subs.emis.de/LNI/Proceedings/Proceedings252/27.pdf},\n}\n\n','\n\nAxel Busch, Qais Noorshams, Samuel Kounev, Anne Koziolek, Ralf Reussner, and\nErich Amrehn.\nAutomated Workload Characterization for I/O Performance Analysis in\nVirtualized Environments (Talk Extended Abstract).\nIn Software Engineering 2016 (SE 2016), Fachtagung des\nGI-Fachbereichs Softwaretechnik, 23.-26. März 2016, Vienna, Austria,\nFebruary 2016, Lecture Notes in Informatics (LNI), pages 27-28. GI, Vienna,\nAustria.\nFebruary 2016.\n[ bib | .html | .pdf  ] 
\n@inproceedings{BuNoKoKoReAm-SE-IO_Workload_Characterization,\nauthor = {Axel Busch and Qais Noorshams and Samuel Kounev and Anne Koziolek and Ralf Reussner and Erich Amrehn},\ntitle = {{Automated Workload Characterization for I/O Performance Analysis in Virtualized Environments}},\nbooktitle = {Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. M\\\"{a}rz 2016, Vienna, Austria},\npublisher = {GI},\nseries = {Lecture Notes in Informatics (LNI)},\naddress = {Vienna, Austria},\ndays = {23-26},\nmonth = {February},\npages = {27--28},\nyear = {2016},\ntitleaddon = {{(Talk Extended Abstract)}},\nhttp = {http://subs.emis.de/LNI/Proceedings/Proceedings252/article48.html},\npdf = {http://subs.emis.de/LNI/Proceedings/Proceedings252/27.pdf}\n}\n
\n
\n','
\n@inproceedings{BuNoKoKoReAm-SE-IO_Workload_Characterization,\n  author = {Axel Busch and Qais Noorshams and Samuel Kounev and Anne Koziolek and Ralf Reussner and Erich Amrehn},\n  title = {{Automated Workload Characterization for I/O Performance Analysis in Virtualized Environments}},\n  booktitle = {Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. M\\\"{a}rz 2016, Vienna, Austria},\n  publisher = {GI},\n  series = {Lecture Notes in Informatics (LNI)},\n  address = {Vienna, Austria},\n  days = {23-26},\n  month = {February},\n  pages = {27--28},\n  year = {2016},\n  titleaddon = {{(Talk Extended Abstract)}},\n  http = {http://subs.emis.de/LNI/Proceedings/Proceedings252/article48.html},\n  pdf = {http://subs.emis.de/LNI/Proceedings/Proceedings252/27.pdf}\n}\n
\n\n',NULL,'{Automated Workload Characterization for I/O Performance Analysis in Virtualized Environments}',0,2,2016,2,NULL,NULL,NULL,'2016-04-30 11:20:46','2016-06-01 09:41:09',0),(1105,'paper','MiIoKoSaMuCuDiRoRy2016-IEEECC-cup','article','@article{MiIoKoSaMuCuDiRoRy2016-IEEECC-cup,\n author = {Aleksandar Milenkoski and Alexandru Iosup and Samuel Kounev and Kai Sachs and Diane E. Mularz and Jonathan A. Curtiss and Jason J. Ding and Florian Rosenberg and Piotr Rygielski},\n title = {{CUP: A Formalism for Expressing Cloud Usage Patterns for Experts and Non-Experts}},\n journal = {IEEE Cloud Computing},\n year = {2016},\n note = {To Appear},\n}\n\n','\n\nAleksandar Milenkoski, Alexandru Iosup, Samuel Kounev, Kai Sachs, Diane E.\nMularz, Jonathan A. Curtiss, Jason J. Ding, Florian Rosenberg, and Piotr\nRygielski.\nCUP: A Formalism for Expressing Cloud Usage Patterns for Experts and\nNon-Experts.\nIEEE Cloud Computing, 2016.\nTo Appear.\n[ bib  ] 
\n@article{MiIoKoSaMuCuDiRoRy2016-IEEECC-cup,\nauthor = {Aleksandar Milenkoski and Alexandru Iosup and Samuel Kounev and Kai Sachs and Diane E. Mularz and Jonathan A. Curtiss and Jason J. Ding and Florian Rosenberg and Piotr Rygielski},\ntitle = {{CUP: A Formalism for Expressing Cloud Usage Patterns for Experts and Non-Experts}},\njournal = {IEEE Cloud Computing},\nyear = {2016},\nnote = {To Appear}\n}\n
\n
\n','
\n@article{MiIoKoSaMuCuDiRoRy2016-IEEECC-cup,\n  author = {Aleksandar Milenkoski and Alexandru Iosup and Samuel Kounev and Kai Sachs and Diane E. Mularz and Jonathan A. Curtiss and Jason J. Ding and Florian Rosenberg and Piotr Rygielski},\n  title = {{CUP: A Formalism for Expressing Cloud Usage Patterns for Experts and Non-Experts}},\n  journal = {IEEE Cloud Computing},\n  year = {2016},\n  note = {To Appear}\n}\n
\n\n',NULL,'{CUP: A Formalism for Expressing Cloud Usage Patterns for Experts and Non-Experts}',0,0,2016,0,NULL,NULL,NULL,'2016-05-09 09:05:03','2016-06-01 09:41:09',0),(1106,'paper','KoKeZhMi2016-self','book','@book{KoKeZhMi2016-self,\n editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n title = {{Self-Aware Computing Systems}},\n publisher = {{Springer Verlag}},\n address = {{Berlin Heidelberg, Germany}},\n year = {2016},\n note = {To Appear},\n}\n\n','\n\nSamuel Kounev, Jeffrey O. Kephart, Xiaoyun Zhu, and Aleksandar Milenkoski,\neditors.\nSelf-Aware Computing Systems.\nSpringer Verlag, Berlin Heidelberg, Germany, 2016.\nTo Appear.\n[ bib  ] 
\n@book{KoKeZhMi2016-self,\neditor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\ntitle = {{Self-Aware Computing Systems}},\npublisher = {{Springer Verlag}},\naddress = {{Berlin Heidelberg, Germany}},\nyear = {2016},\nnote = {To Appear}\n}\n
\n
\n','
\n@book{KoKeZhMi2016-self,\n  editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n  title = {{Self-Aware Computing Systems}},\n  publisher = {{Springer Verlag}},\n  address = {{Berlin Heidelberg, Germany}},\n  year = {2016},\n  note = {To Appear}\n}\n
\n\n',NULL,'{Self-Aware Computing Systems}',0,0,2016,0,NULL,NULL,NULL,'2016-05-09 09:31:33','2016-06-01 09:41:09',0),(1107,'paper','ZhKoKeMi2016-self','incollection','@incollection{ZhKoKeMi2016-self,\n title = {{Open Challenges and Future Research Directions}},\n editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n author = {Xiaoyun Zhu and Samuel Kounev and Jeffrey O. Kephart and Aleksandar Milenkoski},\n booktitle = {{Self-Aware Computing Systems}},\n publisher = {{Springer Verlag}},\n address = {{Berlin Heidelberg, Germany}},\n year = {2016},\n note = {{To Appear}},\n}\n\n','\n\nXiaoyun Zhu, Samuel Kounev, Jeffrey O. Kephart, and Aleksandar Milenkoski.\nOpen Challenges and Future Research Directions.\nIn Self-Aware Computing Systems, Samuel Kounev, Jeffrey O.\nKephart, Xiaoyun Zhu, and Aleksandar Milenkoski, editors. Springer Verlag,\nBerlin Heidelberg, Germany, 2016.\nTo Appear.\n[ bib  ] 
\n@incollection{ZhKoKeMi2016-self,\ntitle = {{Open Challenges and Future Research Directions}},\neditor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\nauthor = {Xiaoyun Zhu and Samuel Kounev and Jeffrey O. Kephart and Aleksandar Milenkoski},\nbooktitle = {{Self-Aware Computing Systems}},\npublisher = {{Springer Verlag}},\naddress = {{Berlin Heidelberg, Germany}},\nyear = {2016},\nnote = {{To Appear}}\n}\n
\n
\n','
\n@incollection{ZhKoKeMi2016-self,\n  title = {{Open Challenges and Future Research Directions}},\n  editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n  author = {Xiaoyun Zhu and Samuel Kounev and Jeffrey O. Kephart and Aleksandar Milenkoski},\n  booktitle = {{Self-Aware Computing Systems}},\n  publisher = {{Springer Verlag}},\n  address = {{Berlin Heidelberg, Germany}},\n  year = {2016},\n  note = {{To Appear}}\n}\n
\n\n',NULL,'{Open Challenges and Future Research Directions}',0,0,2016,0,NULL,NULL,NULL,'2016-05-09 09:41:59','2016-06-01 09:41:09',0),(1108,'paper','JaMiKo2016-self','incollection','@incollection{JaMiKo2016-self,\n title = {{Software Architectures for Self-Protection in IaaS Clouds}},\n editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n author = {K. R. Jayaram and Aleksandar Milenkoski and Samuel Kounev},\n booktitle = {{Self-Aware Computing Systems}},\n publisher = {{Springer Verlag}},\n address = {{Berlin Heidelberg, Germany}},\n year = {2016},\n note = {{To Appear}},\n}\n\n','\n\nK. R. Jayaram, Aleksandar Milenkoski, and Samuel Kounev.\nSoftware Architectures for Self-Protection in IaaS Clouds.\nIn Self-Aware Computing Systems, Samuel Kounev, Jeffrey O.\nKephart, Xiaoyun Zhu, and Aleksandar Milenkoski, editors. Springer Verlag,\nBerlin Heidelberg, Germany, 2016.\nTo Appear.\n[ bib  ] 
\n@incollection{JaMiKo2016-self,\ntitle = {{Software Architectures for Self-Protection in IaaS Clouds}},\neditor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\nauthor = {K. R. Jayaram and Aleksandar Milenkoski and Samuel Kounev},\nbooktitle = {{Self-Aware Computing Systems}},\npublisher = {{Springer Verlag}},\naddress = {{Berlin Heidelberg, Germany}},\nyear = {2016},\nnote = {{To Appear}}\n}\n
\n
\n','
\n@incollection{JaMiKo2016-self,\n  title = {{Software Architectures for Self-Protection in IaaS Clouds}},\n  editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n  author = {K. R. Jayaram and Aleksandar Milenkoski and Samuel Kounev},\n  booktitle = {{Self-Aware Computing Systems}},\n  publisher = {{Springer Verlag}},\n  address = {{Berlin Heidelberg, Germany}},\n  year = {2016},\n  note = {{To Appear}}\n}\n
\n\n',NULL,'{Software Architectures for Self-Protection in IaaS Clouds}',0,0,2016,0,NULL,NULL,NULL,'2016-05-09 09:45:10','2016-06-01 09:41:09',0),(1109,'paper','HeBeKoMaMiSmKo2016-self','incollection','@incollection{HeBeKoMaMiSmKo2016-self,\n title = {{Metrics and Benchmarks for Self-Aware Computing Systems}},\n editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n author = {Nikolas Herbst and Steffen Becker and Heiko Koziolek and Martina Maggio and Aleksandar Milenkoski and Evgenia Smirni and Samuel Kounev},\n booktitle = {{Self-Aware Computing Systems}},\n publisher = {{Springer Verlag}},\n address = {{Berlin Heidelberg, Germany}},\n year = {2016},\n note = {{To Appear}},\n}\n\n','\n\nNikolas Herbst, Steffen Becker, Heiko Koziolek, Martina Maggio, Aleksandar\nMilenkoski, Evgenia Smirni, and Samuel Kounev.\nMetrics and Benchmarks for Self-Aware Computing Systems.\nIn Self-Aware Computing Systems, Samuel Kounev, Jeffrey O.\nKephart, Xiaoyun Zhu, and Aleksandar Milenkoski, editors. Springer Verlag,\nBerlin Heidelberg, Germany, 2016.\nTo Appear.\n[ bib  ] 
\n@incollection{HeBeKoMaMiSmKo2016-self,\ntitle = {{Metrics and Benchmarks for Self-Aware Computing Systems}},\neditor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\nauthor = {Nikolas Herbst and Steffen Becker and Heiko Koziolek and Martina Maggio and Aleksandar Milenkoski and Evgenia Smirni and Samuel Kounev},\nbooktitle = {{Self-Aware Computing Systems}},\npublisher = {{Springer Verlag}},\naddress = {{Berlin Heidelberg, Germany}},\nyear = {2016},\nnote = {{To Appear}}\n}\n
\n
\n','
\n@incollection{HeBeKoMaMiSmKo2016-self,\n  title = {{Metrics and Benchmarks for Self-Aware Computing Systems}},\n  editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n  author = {Nikolas Herbst and Steffen Becker and Heiko Koziolek and Martina Maggio and Aleksandar Milenkoski and Evgenia Smirni and Samuel Kounev},\n  booktitle = {{Self-Aware Computing Systems}},\n  publisher = {{Springer Verlag}},\n  address = {{Berlin Heidelberg, Germany}},\n  year = {2016},\n  note = {{To Appear}}\n}\n
\n\n',NULL,'{Metrics and Benchmarks for Self-Aware Computing Systems}',0,0,2016,0,NULL,NULL,NULL,'2016-05-09 09:46:29','2016-06-01 09:41:09',0),(1110,'paper','MiJaKo2016-self','incollection','@incollection{MiJaKo2016-self,\n title = {{Intrusion Detection Systems and Adaptive Provisioning of Virtualized Resources}},\n editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n author = {Aleksandar Milenkoski and K. R. Jayaram and Samuel Kounev},\n booktitle = {{Self-Aware Computing Systems}},\n publisher = {{Springer Verlag}},\n address = {{Berlin Heidelberg, Germany}},\n year = {2016},\n note = {{To Appear}},\n}\n\n','\n\nAleksandar Milenkoski, K. R. Jayaram, and Samuel Kounev.\nIntrusion Detection Systems and Adaptive Provisioning of Virtualized\nResources.\nIn Self-Aware Computing Systems, Samuel Kounev, Jeffrey O.\nKephart, Xiaoyun Zhu, and Aleksandar Milenkoski, editors. Springer Verlag,\nBerlin Heidelberg, Germany, 2016.\nTo Appear.\n[ bib  ] 
\n@incollection{MiJaKo2016-self,\ntitle = {{Intrusion Detection Systems and Adaptive Provisioning of Virtualized Resources}},\neditor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\nauthor = {Aleksandar Milenkoski and K. R. Jayaram and Samuel Kounev},\nbooktitle = {{Self-Aware Computing Systems}},\npublisher = {{Springer Verlag}},\naddress = {{Berlin Heidelberg, Germany}},\nyear = {2016},\nnote = {{To Appear}}\n}\n
\n
\n','
\n@incollection{MiJaKo2016-self,\n  title = {{Intrusion Detection Systems and Adaptive Provisioning of Virtualized Resources}},\n  editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n  author = {Aleksandar Milenkoski and K. R. Jayaram and Samuel Kounev},\n  booktitle = {{Self-Aware Computing Systems}},\n  publisher = {{Springer Verlag}},\n  address = {{Berlin Heidelberg, Germany}},\n  year = {2016},\n  note = {{To Appear}}\n}\n
\n\n',NULL,'{Intrusion Detection Systems and Adaptive Provisioning of Virtualized Resources}',0,0,2016,0,NULL,NULL,NULL,'2016-05-09 09:47:36','2016-06-01 09:41:09',0),(1111,'paper','HeAmAnGrMeSuKo2016-self','incollection','@incollection{HeAmAnGrMeSuKo2016-self,\n title = {{Online Workload Forecasting}},\n editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n author = {Nikolas Herbst and Ayman Amin and Artur Andrzejak and Lars Grunske and Ole J. Mengshoel and Priya Sundararajan and Samuel Kounev},\n booktitle = {{Self-Aware Computing Systems}},\n publisher = {{Springer Verlag}},\n address = {{Berlin Heidelberg, Germany}},\n year = {2016},\n note = {{To Appear}},\n}\n\n','\n\nNikolas Herbst, Ayman Amin, Artur Andrzejak, Lars Grunske, Ole J. Mengshoel,\nPriya Sundararajan, and Samuel Kounev.\nOnline Workload Forecasting.\nIn Self-Aware Computing Systems, Samuel Kounev, Jeffrey O.\nKephart, Xiaoyun Zhu, and Aleksandar Milenkoski, editors. Springer Verlag,\nBerlin Heidelberg, Germany, 2016.\nTo Appear.\n[ bib  ] 
\n@incollection{HeAmAnGrMeSuKo2016-self,\ntitle = {{Online Workload Forecasting}},\neditor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\nauthor = {Nikolas Herbst and Ayman Amin and Artur Andrzejak and Lars Grunske and Ole J. Mengshoel and Priya Sundararajan and Samuel Kounev},\nbooktitle = {{Self-Aware Computing Systems}},\npublisher = {{Springer Verlag}},\naddress = {{Berlin Heidelberg, Germany}},\nyear = {2016},\nnote = {{To Appear}}\n}\n
\n
\n','
\n@incollection{HeAmAnGrMeSuKo2016-self,\n  title = {{Online Workload Forecasting}},\n  editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n  author = {Nikolas Herbst and Ayman Amin and Artur Andrzejak and Lars Grunske and Ole J. Mengshoel and Priya Sundararajan and Samuel Kounev},\n  booktitle = {{Self-Aware Computing Systems}},\n  publisher = {{Springer Verlag}},\n  address = {{Berlin Heidelberg, Germany}},\n  year = {2016},\n  note = {{To Appear}}\n}\n
\n\n',NULL,'{Online Workload Forecasting}',0,0,2016,0,NULL,NULL,NULL,'2016-05-10 13:48:15','2016-06-01 09:41:09',0),(1112,'talk','talk-Kounev-InvPrague16','misc','@misc{talk-Kounev-InvPrague16,\n author = {Samuel Kounev},\n title = {{Benchmarking Dependability of Virtual and Cloud Environments}},\n howpublished = {Invited Talk, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic},\n days = {4},\n month = {May},\n year = {2016},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1112},\n}\n\n','\n\nSamuel Kounev.\nBenchmarking Dependability of Virtual and Cloud Environments.\nInvited Talk, Faculty of Mathematics and Physics, Charles University,\nPrague, Czech Republic, May 2016.\n[ bib | slides  ] 
\n@misc{talk-Kounev-InvPrague16,\nauthor = {Samuel Kounev},\ntitle = {{Benchmarking Dependability of Virtual and Cloud Environments}},\nhowpublished = {Invited Talk, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic},\ndays = {4},\nmonth = {May},\nyear = {2016},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1112}\n}\n
\n
\n','
\n@misc{talk-Kounev-InvPrague16,\n  author = {Samuel Kounev},\n  title = {{Benchmarking Dependability of Virtual and Cloud Environments}},\n  howpublished = {Invited Talk, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic},\n  days = {4},\n  month = {May},\n  year = {2016},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1112}\n}\n
\n\n',NULL,'{Benchmarking Dependability of Virtual and Cloud Environments}',0,5,2016,5,NULL,NULL,NULL,'2016-05-16 19:35:13','2016-06-01 09:41:09',0),(1113,'paper','pressDetektorFM2016','misc','@misc{pressDetektorFM2016,\n author = {DetektorFM - Forschungsquartett},\n title = {{Heizen mit der Cloud}},\n location = {{Leipzig}},\n year = {2016},\n month = {April},\n day = {24},\n url = {http://detektor.fm/wissen/forschungsquartett-stromsparende-rechenzentren},\n}\n\n','\n\nDetektorFM Forschungsquartett.\nHeizen mit der Cloud, April 2016.\n[ bib | http  ] 
\n@misc{pressDetektorFM2016,\nauthor = {DetektorFM - Forschungsquartett},\ntitle = {{Heizen mit der Cloud}},\nlocation = {{Leipzig}},\nyear = {2016},\nmonth = {April},\nday = {24},\nurl = {http://detektor.fm/wissen/forschungsquartett-stromsparende-rechenzentren}\n}\n
\n
\n','
\n@misc{pressDetektorFM2016,\n  author = {DetektorFM - Forschungsquartett},\n  title = {{Heizen mit der Cloud}},\n  location = {{Leipzig}},\n  year = {2016},\n  month = {April},\n  day = {24},\n  url = {http://detektor.fm/wissen/forschungsquartett-stromsparende-rechenzentren}\n}\n
\n\n',NULL,'{Heizen mit der Cloud}',0,4,2016,4,NULL,NULL,NULL,'2016-05-24 07:03:11','2016-06-01 09:41:09',0),(1114,'paper','pressUniserve2015','misc','@misc{pressUniserve2015,\n author = {Uniserv},\n title = {{Uniserv, Experte f\\\"{u}r Datenmanagement-Software, stiftet Forschungspreis am KIT}},\n location = {{Pforzheim}},\n year = {2015},\n month = {July},\n day = {21},\n url = {http://www.uniserv.com/unternehmen/blog/detail/article/uniserv-experte-fuer-datenmanagement-software-stiftet-forschungspreis-am-kit/},\n}\n\n','\n\nUniserv.\nUniserv, Experte für Datenmanagement-Software, stiftet\nForschungspreis am KIT, July 2015.\n[ bib | http  ] 
\n@misc{pressUniserve2015,\nauthor = {Uniserv},\ntitle = {{Uniserv, Experte f\\\"{u}r Datenmanagement-Software, stiftet Forschungspreis am KIT}},\nlocation = {{Pforzheim}},\nyear = {2015},\nmonth = {July},\nday = {21},\nurl = {http://www.uniserv.com/unternehmen/blog/detail/article/uniserv-experte-fuer-datenmanagement-software-stiftet-forschungspreis-am-kit/}\n}\n
\n
\n','
\n@misc{pressUniserve2015,\n  author = {Uniserv},\n  title = {{Uniserv, Experte f\\\"{u}r Datenmanagement-Software, stiftet Forschungspreis am KIT}},\n  location = {{Pforzheim}},\n  year = {2015},\n  month = {July},\n  day = {21},\n  url = {http://www.uniserv.com/unternehmen/blog/detail/article/uniserv-experte-fuer-datenmanagement-software-stiftet-forschungspreis-am-kit/}\n}\n
\n\n',NULL,'{Uniserv, Experte f\\\"{u}r Datenmanagement-Software, stiftet Forschungspreis am KIT}',0,7,2015,7,NULL,NULL,NULL,'2016-05-25 07:50:45','2016-06-01 09:41:09',0),(1115,'paper','pressIBMFellowshipAward2014','misc','@misc{pressIBMFellowshipAward2014,\n author = {einBLICK},\n title = {{IBM-Preis f\\\"{u}r herausragenden Doktoranden}},\n location = {W\\\"{u}rzburg},\n year = {2014},\n month = {May},\n day = {13},\n url = {http://www.presse.uni-wuerzburg.de/fileadmin/uniwue/Presse/EinBLICK/2014/PDFs/ar201419-2.pdf},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1115.pdf},\n}\n\n','\n\neinBLICK.\nIBM-Preis für herausragenden Doktoranden, May 2014.\n[ bib | .pdf | .pdf  ] 
\n@misc{pressIBMFellowshipAward2014,\nauthor = {einBLICK},\ntitle = {{IBM-Preis f\\\"{u}r herausragenden Doktoranden}},\nlocation = {W\\\"{u}rzburg},\nyear = {2014},\nmonth = {May},\nday = {13},\nurl = {http://www.presse.uni-wuerzburg.de/fileadmin/uniwue/Presse/EinBLICK/2014/PDFs/ar201419-2.pdf},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1115.pdf}\n}\n
\n
\n','
\n@misc{pressIBMFellowshipAward2014,\n  author = {einBLICK},\n  title = {{IBM-Preis f\\\"{u}r herausragenden Doktoranden}},\n  location = {W\\\"{u}rzburg},\n  year = {2014},\n  month = {May},\n  day = {13},\n  url = {http://www.presse.uni-wuerzburg.de/fileadmin/uniwue/Presse/EinBLICK/2014/PDFs/ar201419-2.pdf},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1115.pdf}\n}\n
\n\n',NULL,'{IBM-Preis f\\\"{u}r herausragenden Doktoranden}',0,5,2014,5,NULL,NULL,NULL,'2016-05-25 07:56:48','2016-06-01 09:41:10',0),(1116,'paper','pressEinblickAntrittsvorlesung2014','misc','@misc{pressEinblickAntrittsvorlesung2014,\n author = {einBLICK},\n title = {{Der Traum vom selbst-bewussten Computer}},\n location = {W\\\"{u}rzburg},\n year = {2014},\n month = {May},\n day = {13},\n url = {http://www.presse.uni-wuerzburg.de/fileadmin/uniwue/Presse/EinBLICK/2014/PDFs/ar201419-2.pdf},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/uploads/papers/paper-1115.pdf},\n}\n\n','\n\neinBLICK.\nDer Traum vom selbst-bewussten Computer, May 2014.\n[ bib | .pdf | .pdf  ] 
\n@misc{pressEinblickAntrittsvorlesung2014,\nauthor = {einBLICK},\ntitle = {{Der Traum vom selbst-bewussten Computer}},\nlocation = {W\\\"{u}rzburg},\nyear = {2014},\nmonth = {May},\nday = {13},\nurl = {http://www.presse.uni-wuerzburg.de/fileadmin/uniwue/Presse/EinBLICK/2014/PDFs/ar201419-2.pdf},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/uploads/papers/paper-1115.pdf}\n}\n
\n
\n','
\n@misc{pressEinblickAntrittsvorlesung2014,\n  author = {einBLICK},\n  title = {{Der Traum vom selbst-bewussten Computer}},\n  location = {W\\\"{u}rzburg},\n  year = {2014},\n  month = {May},\n  day = {13},\n  url = {http://www.presse.uni-wuerzburg.de/fileadmin/uniwue/Presse/EinBLICK/2014/PDFs/ar201419-2.pdf},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/uploads/papers/paper-1115.pdf}\n}\n
\n\n',NULL,'{Der Traum vom selbst-bewussten Computer}',0,5,2014,5,NULL,NULL,NULL,'2016-05-25 08:17:14','2016-06-01 09:41:10',0),(1117,'paper','pressRZ2014','misc','@misc{pressRZ2014,\n author = {Rechenzentrum Universit\\\"{a}t W\\\"{u}rzbug (Tscherner)},\n title = {{Dreharbeiten des bayerischen Rundfunks in den Maschinenr\\\"{a}umen des RZs}},\n location = {W\\\"{u}rzburg},\n year = {2016},\n month = {March},\n day = {9},\n url = {https://www.rz.uni-wuerzburg.de/aktuelles/mitteilungen/single/artikel/dreharbeiten-des-bayerischen-rundfunks-in-den-maschinenraeumen-des-rzs/},\n}\n\n','\n\nRechenzentrum Universität Würzbug (Tscherner).\nDreharbeiten des bayerischen Rundfunks in den Maschinenräumen\ndes RZs, March 2016.\n[ bib | http  ] 
\n@misc{pressRZ2014,\nauthor = {Rechenzentrum Universit\\\"{a}t W\\\"{u}rzbug (Tscherner)},\ntitle = {{Dreharbeiten des bayerischen Rundfunks in den Maschinenr\\\"{a}umen des RZs}},\nlocation = {W\\\"{u}rzburg},\nyear = {2016},\nmonth = {March},\nday = {9},\nurl = {https://www.rz.uni-wuerzburg.de/aktuelles/mitteilungen/single/artikel/dreharbeiten-des-bayerischen-rundfunks-in-den-maschinenraeumen-des-rzs/}\n}\n
\n
\n','
\n@misc{pressRZ2014,\n  author = {Rechenzentrum Universit\\\"{a}t W\\\"{u}rzbug (Tscherner)},\n  title = {{Dreharbeiten des bayerischen Rundfunks in den Maschinenr\\\"{a}umen des RZs}},\n  location = {W\\\"{u}rzburg},\n  year = {2016},\n  month = {March},\n  day = {9},\n  url = {https://www.rz.uni-wuerzburg.de/aktuelles/mitteilungen/single/artikel/dreharbeiten-des-bayerischen-rundfunks-in-den-maschinenraeumen-des-rzs/}\n}\n
\n\n',NULL,'{Dreharbeiten des bayerischen Rundfunks in den Maschinenr\\\"{a}umen des RZs}',0,3,2016,3,NULL,NULL,NULL,'2016-05-25 08:25:16','2016-06-01 09:41:10',0); -/*!40000 ALTER TABLE `Entry` ENABLE KEYS */; -UNLOCK TABLES; - --- --- Table structure for table `Entry_to_Author` --- - -DROP TABLE IF EXISTS `Entry_to_Author`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `Entry_to_Author` ( - `entry_id` int(11) NOT NULL, - `author_id` int(11) NOT NULL, - PRIMARY KEY (`entry_id`,`author_id`), - KEY `idx_e2a_entry` (`entry_id`), - KEY `idx_e2a_author` (`author_id`), - CONSTRAINT `Entry_to_Author_ibfk_1` FOREIGN KEY (`entry_id`) REFERENCES `Entry` (`id`) ON DELETE CASCADE ON UPDATE CASCADE, - CONSTRAINT `Entry_to_Author_ibfk_2` FOREIGN KEY (`author_id`) REFERENCES `Author` (`master_id`) ON DELETE CASCADE ON UPDATE CASCADE -) ENGINE=InnoDB DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - --- --- Dumping data for table `Entry_to_Author` --- - -LOCK TABLES `Entry_to_Author` WRITE; -/*!40000 ALTER TABLE `Entry_to_Author` DISABLE KEYS */; -INSERT INTO `Entry_to_Author` VALUES (1,83),(1,84),(1,85),(1,86),(61,218),(65,244),(65,245),(65,246),(65,247),(65,248),(65,249),(65,250),(65,251),(65,252),(65,253),(65,254),(65,255),(76,87),(76,133),(76,166),(76,276),(76,279),(76,280),(76,1107),(76,1141),(76,1188),(76,1189),(81,245),(82,245),(83,84),(83,245),(83,283),(84,84),(84,245),(84,283),(85,84),(85,133),(85,245),(86,84),(86,245),(86,284),(101,279),(101,296),(101,297),(101,298),(101,299),(101,300),(103,1091),(103,1097),(103,1143),(125,327),(126,327),(126,1091),(133,245),(133,327),(133,339),(137,84),(137,245),(137,351),(137,352),(137,353),(163,87),(163,279),(163,378),(171,279),(171,381),(171,1091),(171,1125),(171,1141),(179,383),(179,1091),(179,1097),(179,1188),(186,84),(186,88),(186,90),(186,205),(186,389),(186,390),(186,391),(186,1141),(187,166),(187,205),(187,283),(187,1141),(188,166),(188,205),(188,283),(188,1141),(201,1121),(202,1121),(203,84),(203,283),(203,400),(203,1121),(208,84),(208,283),(208,400),(208,1121),(209,84),(209,1121),(209,1141),(210,84),(210,1121),(210,1137),(211,84),(211,1121),(211,1137),(212,84),(212,87),(212,402),(212,1121),(219,283),(220,279),(220,283),(220,418),(220,1125),(220,1141),(221,84),(221,245),(221,283),(221,419),(221,420),(222,84),(222,245),(222,283),(223,84),(223,245),(223,283),(224,84),(224,245),(224,283),(224,421),(224,1109),(225,84),(225,205),(225,245),(225,283),(225,422),(226,84),(226,245),(226,283),(226,422),(227,84),(227,205),(227,283),(227,422),(231,84),(231,428),(231,429),(243,443),(243,444),(243,445),(243,446),(243,447),(243,448),(243,449),(261,186),(261,276),(261,279),(261,312),(273,84),(273,186),(273,279),(278,84),(279,84),(280,84),(281,84),(282,84),(283,84),(284,84),(285,84),(286,84),(287,84),(288,84),(289,84),(290,84),(291,84),(292,84),(293,84),(294,84),(294,218),(294,245),(294,283),(294,463),(295,84),(295,245),(295,283),(296,84),(296,245),(296,283),(297,84),(297,245),(297,283),(297,1141),(298,84),(298,429),(299,84),(299,429),(300,84),(300,429),(301,84),(301,429),(302,84),(302,429),(303,84),(303,429),(304,84),(304,464),(305,84),(305,464),(306,84),(306,429),(306,464),(307,83),(307,84),(307,245),(307,283),(308,84),(308,465),(309,84),(309,352),(309,466),(310,84),(310,352),(310,466),(311,84),(311,186),(311,279),(312,84),(312,245),(312,467),(312,469),(312,470),(312,471),(312,472),(312,598),(313,84),(313,137),(313,416),(313,458),(313,473),(313,474),(313,475),(313,476),(315,84),(315,383),(316,84),(316,383),(316,429),(316,477),(317,83),(317,84),(317,1115),(318,83),(318,84),(318,478),(319,83),(319,84),(319,478),(320,84),(320,429),(320,479),(329,482),(329,1109),(329,1141),(367,1143),(368,1143),(369,492),(369,1143),(370,84),(370,1085),(370,1143),(371,84),(371,1085),(371,1143),(372,84),(372,493),(372,1143),(390,166),(390,1121),(390,1137),(390,1141),(405,503),(405,1143),(406,84),(406,504),(406,505),(406,506),(406,507),(417,176),(417,482),(417,485),(417,508),(417,509),(417,510),(417,1141),(420,478),(421,84),(421,478),(421,1127),(432,84),(432,383),(432,526),(432,527),(432,528),(432,529),(432,530),(432,1389),(433,84),(433,117),(433,531),(433,532),(433,1389),(434,84),(434,1389),(435,84),(435,531),(435,532),(435,533),(435,1389),(436,138),(436,534),(440,1085),(440,1143),(442,279),(442,513),(442,516),(442,1085),(443,279),(443,1085),(444,279),(444,516),(444,1085),(445,279),(445,516),(445,1085),(447,84),(447,539),(447,540),(449,84),(449,482),(449,543),(449,1141),(450,84),(450,176),(450,482),(450,544),(450,1141),(451,84),(451,176),(451,482),(451,485),(451,543),(451,545),(451,1141),(452,84),(452,482),(452,485),(452,546),(452,1141),(453,84),(453,482),(453,545),(453,1141),(454,84),(454,176),(454,482),(454,1141),(455,84),(455,482),(455,1141),(456,482),(457,482),(457,1141),(457,1189),(458,84),(458,352),(459,84),(459,352),(459,466),(459,547),(460,84),(460,352),(460,466),(481,84),(481,554),(481,555),(481,556),(487,279),(488,279),(489,279),(490,133),(490,279),(490,562),(490,1141),(491,84),(491,279),(491,563),(492,87),(492,279),(493,87),(493,279),(494,87),(494,279),(495,87),(495,279),(496,87),(496,279),(496,1141),(497,186),(497,279),(498,84),(498,186),(498,276),(498,279),(499,186),(499,279),(499,564),(500,84),(500,186),(500,279),(500,563),(501,84),(501,186),(501,279),(501,383),(502,84),(502,279),(503,84),(503,279),(504,84),(504,279),(504,563),(508,176),(508,482),(508,1099),(508,1141),(510,176),(510,482),(510,567),(510,1099),(510,1141),(559,84),(559,527),(560,84),(560,137),(560,527),(563,383),(564,84),(564,383),(564,429),(564,583),(565,84),(565,383),(566,84),(566,383),(567,84),(567,383),(568,84),(568,383),(568,429),(568,583),(569,84),(569,383),(569,429),(569,583),(570,84),(570,383),(570,429),(570,477),(571,84),(571,383),(571,429),(571,477),(572,84),(572,383),(572,429),(573,84),(573,383),(573,429),(573,584),(579,84),(579,504),(579,505),(579,506),(579,507),(580,279),(580,585),(580,586),(580,587),(584,591),(585,591),(586,591),(587,591),(588,591),(589,83),(590,83),(590,84),(590,478),(596,279),(596,298),(596,300),(596,593),(596,594),(596,595),(596,596),(597,84),(597,245),(597,283),(597,597),(597,598),(597,1151),(606,84),(606,261),(606,482),(606,1141),(615,84),(615,383),(615,532),(615,604),(629,393),(629,1091),(629,1097),(629,1143),(639,84),(639,189),(639,301),(639,620),(640,84),(640,156),(640,383),(641,84),(641,137),(641,383),(642,84),(642,621),(646,84),(646,1085),(646,1143),(649,84),(649,245),(649,283),(651,84),(651,245),(651,283),(651,628),(663,84),(663,245),(663,283),(663,421),(663,1109),(664,527),(664,640),(665,527),(665,640),(666,527),(666,640),(666,641),(667,527),(667,640),(667,641),(668,527),(668,640),(668,641),(669,527),(669,640),(669,641),(670,527),(670,640),(670,641),(671,527),(671,640),(671,641),(672,527),(672,640),(672,641),(672,642),(673,527),(673,643),(674,527),(674,640),(674,641),(675,527),(675,640),(675,641),(676,527),(676,640),(676,641),(677,527),(677,640),(678,527),(678,644),(679,527),(679,641),(680,527),(680,640),(681,527),(681,640),(681,641),(682,527),(682,640),(682,641),(682,642),(683,527),(684,84),(684,383),(684,527),(685,84),(685,383),(685,527),(686,84),(686,137),(686,527),(688,1143),(688,1204),(689,84),(689,646),(690,628),(691,1115),(697,84),(697,245),(697,628),(702,84),(702,245),(702,628),(703,83),(703,84),(703,85),(703,651),(705,84),(705,527),(706,652),(706,1121),(706,1143),(707,83),(707,84),(707,653),(707,1143),(708,503),(708,1143),(709,84),(709,383),(709,527),(710,1148),(710,1149),(710,1151),(711,1148),(711,1149),(711,1151),(712,470),(714,470),(714,485),(714,1152),(714,1153),(714,1154),(714,1155),(714,1156),(715,470),(715,485),(716,470),(716,485),(716,1152),(717,84),(717,383),(718,1157),(718,1158),(720,1159),(721,464),(722,1160),(722,1161),(723,1162),(723,1163),(724,1164),(724,1165),(724,1166),(725,1162),(725,1167),(726,1162),(726,1167),(726,1168),(727,1162),(727,1167),(727,1168),(728,1162),(728,1167),(728,1168),(729,1162),(730,1162),(738,654),(738,655),(738,1181),(739,655),(739,1183),(740,654),(740,655),(740,1183),(741,655),(741,1184),(742,654),(742,655),(742,1183),(743,654),(743,655),(744,654),(744,655),(745,84),(745,482),(745,546),(745,1141),(746,83),(746,84),(746,85),(746,86),(746,1201),(746,1202),(746,1203),(747,84),(748,1137),(749,1137),(750,84),(750,531),(750,532),(750,533),(750,1389),(751,84),(751,503),(751,1143),(752,503),(752,1143),(754,84),(754,245),(754,478),(754,1109),(754,1125),(754,1127),(755,1143),(755,1204),(756,1143),(756,1204),(757,1143),(757,1204),(758,84),(758,531),(758,532),(758,533),(758,1389),(759,283),(760,654),(761,654),(761,1209),(762,654),(762,1210),(763,654),(764,654),(765,654),(766,654),(766,655),(767,654),(768,245),(769,84),(769,527),(770,402),(771,84),(771,1121),(771,1137),(772,84),(772,1137),(772,1211),(772,1212),(772,1213),(772,1214),(773,1137),(773,1213),(773,1214),(773,1215),(773,1216),(773,1217),(774,655),(774,1222),(774,1223),(774,1224),(774,1225),(774,1226),(774,1227),(775,84),(776,84),(776,245),(776,283),(777,527),(777,1232),(778,84),(778,400),(778,482),(778,543),(778,1109),(778,1141),(779,176),(779,482),(779,567),(779,1099),(779,1141),(780,84),(780,1121),(780,1137),(780,1233),(780,1234),(781,84),(781,383),(781,527),(782,84),(782,87),(782,402),(782,1121),(783,1235),(784,84),(785,527),(786,1237),(787,1236),(788,1238),(789,84),(789,527),(789,1240),(790,84),(791,83),(791,84),(791,85),(791,86),(791,1121),(791,1201),(791,1203),(792,83),(792,84),(792,1115),(793,84),(793,531),(793,532),(793,1241),(793,1389),(798,1236),(799,1258),(802,84),(802,85),(802,1261),(802,1262),(802,1389),(803,84),(803,527),(803,1240),(803,1263),(803,1264),(803,1265),(803,1266),(804,84),(805,84),(806,84),(807,84),(808,84),(809,84),(810,84),(811,84),(812,84),(813,84),(814,84),(815,84),(816,84),(817,84),(818,84),(819,84),(820,84),(821,84),(822,84),(823,84),(824,84),(825,84),(826,84),(827,84),(828,84),(829,84),(830,84),(831,84),(832,84),(833,84),(834,84),(835,84),(836,84),(837,84),(838,84),(839,84),(840,84),(841,84),(842,84),(843,84),(844,84),(845,84),(846,84),(847,84),(848,84),(849,84),(850,84),(851,84),(852,84),(853,84),(854,84),(855,84),(856,84),(857,84),(858,84),(859,84),(860,84),(861,84),(862,84),(864,1235),(865,543),(867,546),(868,545),(870,1236),(871,562),(872,1267),(873,422),(875,218),(876,186),(877,1269),(878,84),(878,1137),(878,1211),(878,1212),(878,1213),(878,1214),(879,84),(879,245),(879,283),(881,83),(881,84),(881,1115),(882,83),(882,1115),(883,654),(883,655),(883,1271),(884,84),(885,84),(886,84),(887,83),(887,84),(887,1273),(887,1274),(887,1275),(887,1276),(888,84),(888,532),(888,533),(888,1277),(888,1389),(889,1278),(890,83),(890,84),(890,245),(890,651),(891,84),(891,283),(891,1115),(891,1280),(892,83),(892,421),(892,493),(892,1109),(892,1115),(892,1121),(892,1137),(892,1274),(892,1276),(892,1281),(892,1282),(892,1283),(892,1284),(892,1285),(892,1286),(892,1287),(893,84),(893,117),(893,531),(893,532),(893,533),(893,1288),(893,1389),(894,1143),(895,482),(896,543),(897,546),(898,545),(899,562),(900,1267),(901,1268),(902,422),(903,1269),(904,186),(905,1115),(905,1238),(905,1258),(906,84),(906,1137),(907,1137),(908,1137),(909,83),(911,84),(911,1137),(911,1211),(911,1212),(911,1213),(911,1301),(912,83),(913,84),(913,527),(913,1297),(913,1298),(913,1299),(913,1300),(914,83),(914,84),(914,1115),(915,84),(915,421),(915,1115),(915,1127),(915,1302),(916,1399),(919,1304),(920,84),(921,84),(922,84),(923,84),(923,421),(923,1115),(923,1302),(924,83),(924,651),(924,1305),(925,1306),(926,84),(926,85),(926,245),(926,283),(927,1307),(928,655),(929,655),(930,655),(930,1222),(930,1309),(931,655),(932,655),(932,1222),(932,1223),(932,1224),(932,1225),(932,1226),(932,1227),(932,1309),(932,1310),(932,1311),(933,655),(934,655),(935,655),(936,655),(937,655),(938,655),(938,1222),(938,1223),(938,1224),(938,1225),(938,1226),(938,1227),(938,1309),(938,1310),(938,1311),(938,1312),(939,655),(939,1222),(939,1223),(939,1224),(939,1225),(939,1226),(939,1227),(939,1309),(939,1310),(939,1311),(939,1312),(940,655),(940,1222),(940,1223),(940,1224),(940,1225),(940,1226),(940,1227),(940,1309),(940,1310),(940,1311),(940,1312),(941,655),(941,1313),(941,1314),(942,655),(942,1222),(942,1223),(942,1224),(942,1225),(942,1226),(942,1227),(942,1309),(942,1310),(942,1311),(942,1312),(943,655),(944,655),(944,1313),(944,1314),(945,655),(945,1315),(946,655),(947,655),(948,655),(948,1316),(949,655),(950,655),(950,1316),(951,655),(951,1317),(952,655),(952,1227),(953,655),(953,1227),(954,655),(955,655),(955,1222),(955,1318),(956,655),(957,655),(957,1222),(958,655),(959,655),(960,655),(960,1222),(960,1318),(961,655),(962,655),(963,655),(964,655),(965,655),(966,655),(967,655),(967,1319),(968,655),(968,1222),(968,1227),(969,655),(970,655),(970,1224),(970,1227),(971,655),(971,1319),(971,1320),(971,1321),(971,1322),(971,1323),(972,655),(973,655),(973,1324),(973,1325),(974,655),(974,1319),(975,655),(976,655),(977,655),(978,655),(979,655),(979,1224),(979,1227),(980,655),(980,1326),(981,655),(981,1222),(981,1227),(982,655),(983,655),(984,655),(984,1326),(985,655),(986,655),(987,655),(988,655),(989,655),(990,655),(991,655),(991,1327),(991,1328),(992,655),(993,655),(993,1326),(994,655),(994,1314),(995,655),(995,1314),(996,655),(996,1314),(997,655),(997,1314),(998,655),(998,1314),(999,655),(999,1314),(1000,655),(1000,1314),(1001,655),(1001,1327),(1002,655),(1002,1327),(1003,655),(1003,1327),(1004,655),(1004,1329),(1004,1330),(1004,1331),(1004,1332),(1005,655),(1005,1333),(1006,655),(1006,1334),(1006,1335),(1007,655),(1007,1334),(1007,1335),(1008,655),(1008,1333),(1009,655),(1010,655),(1010,1327),(1011,655),(1011,1336),(1012,655),(1012,1333),(1013,655),(1014,655),(1015,655),(1015,1336),(1015,1337),(1016,655),(1016,1338),(1017,655),(1017,1336),(1018,655),(1018,1327),(1018,1337),(1019,655),(1019,1336),(1020,655),(1020,1310),(1020,1327),(1020,1337),(1020,1339),(1021,655),(1022,655),(1022,1310),(1022,1327),(1022,1337),(1022,1339),(1023,655),(1023,1310),(1024,655),(1024,1314),(1025,655),(1026,655),(1027,655),(1027,1340),(1027,1341),(1028,655),(1028,1223),(1028,1224),(1028,1342),(1029,655),(1029,1310),(1030,655),(1030,1223),(1030,1224),(1030,1342),(1031,655),(1031,1222),(1031,1342),(1031,1343),(1032,655),(1032,1227),(1033,655),(1033,1344),(1034,655),(1034,1222),(1034,1342),(1034,1343),(1035,655),(1036,655),(1037,655),(1038,655),(1038,1227),(1039,655),(1039,1224),(1040,655),(1041,655),(1042,655),(1042,1224),(1042,1227),(1043,655),(1043,1319),(1044,655),(1044,1224),(1044,1227),(1045,655),(1046,655),(1046,1345),(1047,655),(1047,1224),(1047,1227),(1048,655),(1048,1222),(1048,1223),(1048,1224),(1048,1225),(1048,1226),(1048,1227),(1048,1310),(1048,1312),(1048,1346),(1048,1347),(1048,1348),(1049,655),(1050,655),(1051,655),(1051,1222),(1051,1223),(1051,1224),(1051,1225),(1051,1226),(1051,1227),(1052,655),(1052,1349),(1053,655),(1053,1350),(1053,1351),(1054,655),(1054,1336),(1055,655),(1055,1349),(1056,655),(1056,1349),(1057,655),(1057,1349),(1057,1350),(1057,1351),(1058,655),(1058,1336),(1059,655),(1059,1336),(1060,655),(1060,1336),(1060,1349),(1060,1352),(1061,655),(1062,655),(1062,1349),(1062,1351),(1062,1353),(1063,655),(1063,1336),(1064,655),(1064,1333),(1065,655),(1065,1349),(1066,655),(1066,1349),(1067,655),(1068,655),(1068,1336),(1068,1354),(1068,1355),(1069,655),(1069,1349),(1069,1356),(1070,655),(1070,1336),(1070,1354),(1070,1355),(1071,655),(1071,1349),(1071,1357),(1072,655),(1072,1349),(1072,1357),(1073,655),(1073,1349),(1073,1357),(1074,83),(1074,186),(1074,245),(1074,493),(1074,1091),(1074,1127),(1074,1359),(1074,1360),(1075,83),(1075,84),(1075,527),(1075,1361),(1077,84),(1077,245),(1077,478),(1077,527),(1077,1109),(1077,1125),(1077,1127),(1080,1400),(1081,1391),(1082,1398),(1083,84),(1083,526),(1083,1121),(1083,1143),(1083,1366),(1083,1367),(1083,1368),(1084,1369),(1085,1370),(1086,84),(1086,421),(1086,527),(1087,1371),(1088,1372),(1088,1373),(1088,1374),(1088,1375),(1088,1376),(1088,1377),(1088,1378),(1088,1389),(1089,1379),(1089,1380),(1089,1381),(1089,1382),(1089,1383),(1089,1384),(1089,1385),(1089,1386),(1089,1389),(1090,1402),(1091,1403),(1092,84),(1097,84),(1097,421),(1097,1115),(1097,1127),(1097,1302),(1098,1361),(1099,83),(1099,84),(1099,85),(1099,86),(1099,1121),(1099,1201),(1099,1203),(1100,83),(1100,84),(1100,85),(1100,86),(1100,1201),(1100,1202),(1100,1203),(1100,1405),(1101,1406),(1103,84),(1103,245),(1103,478),(1103,527),(1103,1109),(1103,1125),(1103,1127),(1104,84),(1104,400),(1104,482),(1104,543),(1104,1109),(1104,1141),(1105,84),(1105,383),(1105,526),(1105,527),(1105,530),(1105,1389),(1105,1408),(1105,1409),(1105,1410),(1106,84),(1106,85),(1106,1261),(1106,1389),(1107,84),(1107,85),(1107,1261),(1107,1389),(1108,84),(1108,1389),(1108,1414),(1109,84),(1109,1121),(1109,1125),(1109,1127),(1109,1389),(1109,1415),(1109,1416),(1110,84),(1110,1389),(1110,1414),(1111,84),(1111,1121),(1111,1417),(1111,1418),(1111,1419),(1111,1420),(1111,1421),(1112,84),(1113,1422),(1114,1423),(1115,1424),(1116,1424),(1117,1426); -/*!40000 ALTER TABLE `Entry_to_Author` ENABLE KEYS */; -UNLOCK TABLES; - --- --- Table structure for table `Entry_to_Tag` --- - -DROP TABLE IF EXISTS `Entry_to_Tag`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `Entry_to_Tag` ( - `entry_id` int(8) NOT NULL, - `tag_id` int(8) NOT NULL, - PRIMARY KEY (`entry_id`,`tag_id`), - KEY `tag_id` (`tag_id`), - CONSTRAINT `Entry_to_Tag_ibfk_1` FOREIGN KEY (`entry_id`) REFERENCES `Entry` (`id`) ON DELETE CASCADE ON UPDATE CASCADE, - CONSTRAINT `Entry_to_Tag_ibfk_2` FOREIGN KEY (`tag_id`) REFERENCES `Tag` (`id`) ON DELETE CASCADE ON UPDATE CASCADE -) ENGINE=InnoDB DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - --- --- Dumping data for table `Entry_to_Tag` --- - -LOCK TABLES `Entry_to_Tag` WRITE; -/*!40000 ALTER TABLE `Entry_to_Tag` DISABLE KEYS */; -INSERT INTO `Entry_to_Tag` VALUES (311,4),(481,4),(559,4),(560,4),(665,4),(667,4),(668,4),(671,4),(672,4),(673,4),(674,4),(675,4),(680,4),(681,4),(682,4),(683,4),(686,4),(705,4),(769,4),(789,4),(803,4),(913,4),(1087,4),(1,6),(187,6),(188,6),(202,6),(222,6),(223,6),(225,6),(226,6),(227,6),(296,6),(312,6),(313,6),(372,6),(432,6),(433,6),(434,6),(435,6),(449,6),(451,6),(452,6),(453,6),(454,6),(455,6),(559,6),(646,6),(651,6),(678,6),(680,6),(681,6),(689,6),(706,6),(745,6),(746,6),(747,6),(750,6),(758,6),(759,6),(770,6),(782,6),(791,6),(793,6),(888,6),(893,6),(914,6),(925,6),(1088,6),(1089,6),(1105,6),(186,7),(209,7),(278,7),(282,7),(288,7),(307,7),(311,7),(312,7),(319,7),(432,7),(433,7),(481,7),(559,7),(615,7),(642,7),(651,7),(750,7),(758,7),(790,7),(888,7),(890,7),(1111,7),(273,8),(278,8),(282,8),(283,8),(288,8),(294,8),(299,8),(301,8),(304,8),(305,8),(306,8),(307,8),(309,8),(310,8),(311,8),(316,8),(317,8),(318,8),(319,8),(421,8),(450,8),(458,8),(459,8),(460,8),(491,8),(498,8),(500,8),(502,8),(503,8),(504,8),(560,8),(572,8),(590,8),(597,8),(639,8),(640,8),(665,8),(669,8),(670,8),(671,8),(672,8),(686,8),(691,8),(697,8),(705,8),(745,8),(754,8),(769,8),(789,8),(790,8),(792,8),(802,8),(913,8),(926,8),(1077,8),(83,9),(84,9),(85,9),(210,9),(211,9),(222,9),(223,9),(224,9),(273,9),(278,9),(295,9),(307,9),(311,9),(421,9),(491,9),(498,9),(500,9),(501,9),(502,9),(503,9),(504,9),(560,9),(639,9),(640,9),(649,9),(663,9),(686,9),(705,9),(749,9),(754,9),(759,9),(769,9),(771,9),(780,9),(789,9),(798,9),(891,9),(908,9),(913,9),(926,9),(1092,9),(1,10),(81,10),(82,10),(83,10),(84,10),(85,10),(86,10),(137,10),(187,10),(188,10),(203,10),(208,10),(209,10),(210,10),(211,10),(212,10),(219,10),(220,10),(221,10),(222,10),(223,10),(224,10),(225,10),(226,10),(227,10),(231,10),(273,10),(278,10),(279,10),(280,10),(281,10),(282,10),(283,10),(286,10),(287,10),(288,10),(289,10),(290,10),(291,10),(292,10),(294,10),(295,10),(296,10),(297,10),(298,10),(299,10),(300,10),(301,10),(302,10),(303,10),(304,10),(305,10),(306,10),(307,10),(309,10),(310,10),(311,10),(312,10),(315,10),(316,10),(317,10),(318,10),(319,10),(320,10),(370,10),(371,10),(372,10),(406,10),(421,10),(433,10),(435,10),(449,10),(450,10),(451,10),(452,10),(453,10),(454,10),(455,10),(458,10),(459,10),(460,10),(491,10),(498,10),(500,10),(501,10),(502,10),(503,10),(504,10),(559,10),(560,10),(564,10),(565,10),(566,10),(567,10),(568,10),(569,10),(570,10),(571,10),(572,10),(573,10),(579,10),(589,10),(590,10),(597,10),(606,10),(615,10),(639,10),(640,10),(646,10),(649,10),(651,10),(663,10),(668,10),(683,10),(684,10),(685,10),(686,10),(689,10),(690,10),(691,10),(697,10),(702,10),(703,10),(705,10),(706,10),(707,10),(709,10),(717,10),(745,10),(746,10),(747,10),(751,10),(754,10),(759,10),(768,10),(769,10),(770,10),(771,10),(772,10),(773,10),(775,10),(780,10),(789,10),(790,10),(791,10),(792,10),(802,10),(803,10),(878,10),(887,10),(889,10),(890,10),(891,10),(892,10),(905,10),(906,10),(908,10),(911,10),(913,10),(914,10),(915,10),(924,10),(925,10),(926,10),(1075,10),(1077,10),(1092,10),(1,11),(82,11),(83,11),(84,11),(85,11),(86,11),(137,11),(201,11),(203,11),(208,11),(223,11),(225,11),(227,11),(273,11),(278,11),(279,11),(280,11),(281,11),(282,11),(283,11),(286,11),(288,11),(291,11),(292,11),(294,11),(295,11),(296,11),(297,11),(298,11),(299,11),(300,11),(301,11),(304,11),(305,11),(306,11),(307,11),(309,11),(310,11),(311,11),(312,11),(316,11),(317,11),(318,11),(319,11),(406,11),(421,11),(449,11),(450,11),(451,11),(452,11),(453,11),(454,11),(455,11),(458,11),(459,11),(460,11),(491,11),(498,11),(500,11),(501,11),(502,11),(503,11),(504,11),(560,11),(572,11),(579,11),(590,11),(597,11),(606,11),(639,11),(640,11),(649,11),(651,11),(672,11),(674,11),(682,11),(686,11),(689,11),(690,11),(697,11),(702,11),(705,11),(717,11),(745,11),(746,11),(754,11),(768,11),(769,11),(789,11),(790,11),(792,11),(891,11),(925,11),(926,11),(1077,11),(1092,11),(1111,11),(231,12),(297,12),(309,12),(310,12),(313,12),(432,12),(458,12),(459,12),(460,12),(498,12),(503,12),(641,12),(663,12),(664,12),(666,12),(669,12),(670,12),(673,12),(676,12),(677,12),(678,12),(679,12),(680,12),(777,12),(283,15),(284,15),(285,15),(288,15),(294,15),(298,15),(299,15),(301,15),(304,15),(305,15),(306,15),(309,15),(310,15),(316,15),(317,15),(318,15),(319,15),(421,15),(458,15),(459,15),(460,15),(563,15),(572,15),(589,15),(590,15),(691,15),(705,15),(710,15),(711,15),(712,15),(714,15),(715,15),(716,15),(717,15),(718,15),(720,15),(721,15),(722,15),(723,15),(724,15),(725,15),(726,15),(727,15),(728,15),(729,15),(730,15),(754,15),(769,15),(792,15),(133,19),(186,19),(201,19),(202,19),(209,19),(212,19),(221,19),(227,19),(312,19),(313,19),(370,19),(371,19),(372,19),(390,19),(432,19),(433,19),(434,19),(435,19),(559,19),(641,19),(646,19),(678,19),(689,19),(706,19),(707,19),(747,19),(748,19),(749,19),(751,19),(770,19),(775,19),(791,19),(793,19),(802,19),(891,19),(893,19),(1083,19),(1088,19),(1089,19),(1105,19),(283,20),(288,20),(294,20),(298,20),(299,20),(301,20),(304,20),(305,20),(306,20),(309,20),(310,20),(316,20),(317,20),(318,20),(319,20),(421,20),(458,20),(459,20),(460,20),(572,20),(590,20),(691,20),(705,20),(717,20),(745,20),(754,20),(769,20),(789,20),(790,20),(792,20),(799,20),(881,20),(1075,20),(209,21),(212,21),(747,21),(770,21),(775,21),(782,21),(1083,21),(83,22),(222,22),(224,22),(295,22),(649,22),(663,22),(759,22),(768,22),(769,22),(776,22),(788,22),(891,22),(905,22),(914,22),(926,22),(1092,22),(690,23),(697,23),(702,23),(799,23),(915,23),(1097,23),(210,24),(211,24),(212,24),(749,24),(770,24),(771,24),(780,24),(782,24),(908,24),(589,25),(703,25),(882,25),(887,25),(890,25),(914,25),(924,25),(559,28),(803,28),(1087,28),(449,29),(450,29),(451,29),(452,29),(453,29),(455,29),(745,29),(287,30),(288,30),(289,30),(315,30),(320,30),(432,30),(433,30),(564,30),(565,30),(566,30),(567,30),(568,30),(569,30),(570,30),(571,30),(573,30),(584,30),(585,30),(586,30),(587,30),(588,30),(615,30),(639,30),(640,30),(684,30),(685,30),(709,30),(758,30),(772,30),(773,30),(780,30),(781,30),(790,30),(805,30),(878,30),(887,30),(892,30),(907,30),(908,30),(911,30),(1083,30),(1086,30),(82,31),(201,31),(219,31),(227,31),(288,31),(294,31),(300,31),(301,31),(303,31),(316,31),(584,31),(585,31),(586,31),(664,31),(668,31),(749,31),(750,31),(771,31),(790,31),(202,33),(203,33),(208,33),(209,33),(210,33),(211,33),(212,33),(221,33),(223,33),(312,33),(390,33),(433,33),(615,33),(663,33),(689,33),(746,33),(747,33),(748,33),(770,33),(775,33),(780,33),(782,33),(908,33),(1083,33),(273,34),(289,34),(303,34),(311,34),(315,34),(316,34),(406,34),(481,34),(491,34),(500,34),(501,34),(502,34),(503,34),(504,34),(564,34),(565,34),(566,34),(567,34),(568,34),(569,34),(570,34),(571,34),(572,34),(573,34),(579,34),(717,34),(309,35),(310,35),(458,35),(459,35),(460,35),(370,36),(371,36),(434,36),(451,36),(615,36),(646,36),(668,36),(706,36),(707,36),(745,36),(747,36),(750,36),(751,36),(758,36),(775,36),(1083,36),(370,38),(371,38),(372,38),(646,38),(707,38),(747,38),(751,38),(1083,38),(312,41),(639,41),(640,41),(772,41),(773,41),(878,41),(889,41),(906,41),(907,41),(911,41),(925,41),(137,43),(221,43),(279,43),(280,43),(281,43),(296,43),(312,43),(433,43),(435,43),(459,43),(597,43),(615,43),(738,43),(739,43),(740,43),(741,43),(742,43),(743,43),(744,43),(750,43),(758,43),(760,43),(761,43),(762,43),(763,43),(764,43),(765,43),(766,43),(767,43),(793,43),(888,43),(928,43),(929,43),(930,43),(931,43),(932,43),(933,43),(934,43),(935,43),(936,43),(937,43),(938,43),(939,43),(940,43),(941,43),(942,43),(943,43),(944,43),(945,43),(946,43),(947,43),(948,43),(949,43),(950,43),(951,43),(952,43),(953,43),(954,43),(955,43),(956,43),(957,43),(958,43),(959,43),(960,43),(961,43),(962,43),(963,43),(964,43),(965,43),(966,43),(967,43),(968,43),(969,43),(970,43),(971,43),(972,43),(973,43),(974,43),(975,43),(976,43),(977,43),(978,43),(979,43),(980,43),(981,43),(982,43),(983,43),(984,43),(985,43),(986,43),(987,43),(988,43),(989,43),(990,43),(991,43),(992,43),(993,43),(994,43),(995,43),(996,43),(997,43),(998,43),(999,43),(1000,43),(1001,43),(1002,43),(1003,43),(1004,43),(1005,43),(1006,43),(1007,43),(1008,43),(1009,43),(1010,43),(1011,43),(1012,43),(1013,43),(1014,43),(1015,43),(1016,43),(1017,43),(1018,43),(1019,43),(1020,43),(1021,43),(1022,43),(1023,43),(1024,43),(1025,43),(1026,43),(1027,43),(1028,43),(1029,43),(1030,43),(1031,43),(1032,43),(1033,43),(1034,43),(1035,43),(1036,43),(1037,43),(1038,43),(1039,43),(1040,43),(1041,43),(1042,43),(1043,43),(1044,43),(1045,43),(1046,43),(1047,43),(1048,43),(1049,43),(1050,43),(1051,43),(1052,43),(1053,43),(1054,43),(1055,43),(1056,43),(1057,43),(1058,43),(1059,43),(1060,43),(1061,43),(1062,43),(1063,43),(1064,43),(1065,43),(1066,43),(1067,43),(1068,43),(1069,43),(1070,43),(1071,43),(1072,43),(1073,43),(1083,43),(312,44),(433,44),(434,44),(435,44),(615,44),(747,44),(750,44),(758,44),(793,44),(802,44),(888,44),(893,44),(1088,44),(1089,44),(290,47),(294,47),(302,47),(303,47),(449,47),(450,47),(451,47),(452,47),(453,47),(454,47),(455,47),(745,47),(86,49),(201,49),(203,49),(208,49),(211,49),(212,49),(231,49),(283,49),(287,49),(289,49),(299,49),(304,49),(305,49),(306,49),(315,49),(317,49),(318,49),(319,49),(372,49),(435,49),(447,49),(449,49),(564,49),(565,49),(566,49),(567,49),(568,49),(569,49),(570,49),(571,49),(573,49),(590,49),(691,49),(697,49),(703,49),(749,49),(770,49),(771,49),(773,49),(782,49),(906,49),(916,49),(1087,49),(283,51),(288,51),(299,51),(304,51),(305,51),(306,51),(317,51),(318,51),(319,51),(421,51),(590,51),(691,51),(705,51),(745,51),(754,51),(790,51),(792,51),(799,51),(881,51),(1075,51),(133,52),(221,52),(224,52),(231,52),(289,52),(290,52),(302,52),(303,52),(320,52),(406,52),(449,52),(453,52),(504,52),(579,52),(639,52),(640,52),(663,52),(664,52),(665,52),(677,52),(678,52),(689,52),(697,52),(706,52),(803,52),(878,52),(926,52),(1111,52),(273,53),(279,53),(280,53),(281,53),(289,53),(290,53),(293,53),(295,53),(296,53),(297,53),(302,53),(303,53),(308,53),(310,53),(312,53),(313,53),(320,53),(371,53),(447,53),(459,53),(460,53),(481,53),(491,53),(500,53),(502,53),(503,53),(504,53),(663,53),(751,53),(914,53),(926,53),(1074,53),(1105,53),(1106,53),(83,54),(84,54),(85,54),(86,54),(222,54),(224,54),(273,54),(278,54),(279,54),(280,54),(281,54),(282,54),(283,54),(286,54),(288,54),(294,54),(295,54),(296,54),(297,54),(298,54),(299,54),(300,54),(301,54),(304,54),(305,54),(306,54),(307,54),(309,54),(310,54),(311,54),(316,54),(317,54),(318,54),(319,54),(406,54),(421,54),(432,54),(450,54),(454,54),(458,54),(459,54),(460,54),(491,54),(498,54),(500,54),(501,54),(502,54),(503,54),(504,54),(560,54),(572,54),(579,54),(590,54),(597,54),(639,54),(640,54),(649,54),(663,54),(686,54),(697,54),(702,54),(705,54),(717,54),(754,54),(769,54),(790,54),(802,54),(803,54),(891,54),(905,54),(926,54),(1077,54),(1,55),(81,55),(83,55),(84,55),(85,55),(86,55),(137,55),(220,55),(221,55),(273,55),(278,55),(282,55),(283,55),(286,55),(288,55),(291,55),(292,55),(294,55),(295,55),(298,55),(299,55),(300,55),(301,55),(304,55),(305,55),(306,55),(307,55),(309,55),(310,55),(311,55),(312,55),(316,55),(317,55),(318,55),(319,55),(406,55),(421,55),(449,55),(450,55),(451,55),(452,55),(454,55),(458,55),(459,55),(460,55),(491,55),(498,55),(500,55),(501,55),(502,55),(503,55),(504,55),(560,55),(572,55),(579,55),(590,55),(597,55),(606,55),(639,55),(640,55),(649,55),(651,55),(683,55),(686,55),(691,55),(697,55),(702,55),(703,55),(705,55),(706,55),(717,55),(745,55),(746,55),(754,55),(769,55),(789,55),(790,55),(792,55),(799,55),(802,55),(881,55),(890,55),(915,55),(926,55),(1075,55),(1077,55),(1097,55),(1,56),(82,56),(84,56),(85,56),(86,56),(187,56),(188,56),(203,56),(208,56),(210,56),(211,56),(219,56),(220,56),(225,56),(226,56),(227,56),(278,56),(279,56),(280,56),(281,56),(294,56),(296,56),(297,56),(307,56),(449,56),(450,56),(451,56),(452,56),(453,56),(454,56),(455,56),(459,56),(589,56),(606,56),(639,56),(640,56),(651,56),(703,56),(745,56),(746,56),(749,56),(771,56),(780,56),(798,56),(887,56),(890,56),(892,56),(906,56),(908,56),(913,56),(914,56),(915,56),(916,56),(924,56),(187,57),(188,57),(202,57),(209,57),(210,57),(211,57),(212,57),(225,57),(226,57),(227,57),(231,57),(282,57),(287,57),(288,57),(289,57),(290,57),(302,57),(315,57),(320,57),(370,57),(372,57),(390,57),(433,57),(434,57),(435,57),(564,57),(565,57),(566,57),(567,57),(568,57),(569,57),(570,57),(571,57),(573,57),(615,57),(639,57),(640,57),(646,57),(684,57),(685,57),(709,57),(717,57),(747,57),(748,57),(750,57),(758,57),(770,57),(771,57),(772,57),(773,57),(775,57),(780,57),(782,57),(790,57),(802,57),(878,57),(889,57),(893,57),(907,57),(908,57),(911,57),(925,57),(1083,57),(1106,57),(1,58),(82,58),(84,58),(85,58),(86,58),(203,58),(208,58),(210,58),(211,58),(225,58),(226,58),(227,58),(231,58),(278,58),(282,58),(288,58),(291,58),(292,58),(294,58),(300,58),(302,58),(303,58),(307,58),(320,58),(433,58),(435,58),(449,58),(450,58),(451,58),(452,58),(453,58),(454,58),(455,58),(459,58),(566,58),(567,58),(570,58),(571,58),(573,58),(606,58),(639,58),(640,58),(651,58),(684,58),(703,58),(707,58),(709,58),(746,58),(749,58),(750,58),(758,58),(771,58),(772,58),(780,58),(790,58),(791,58),(878,58),(890,58),(892,58),(893,58),(908,58),(911,58),(913,58),(914,58),(1074,58),(1106,58),(84,59),(85,59),(201,59),(203,59),(208,59),(449,59),(450,59),(451,59),(453,59),(455,59),(589,59),(651,59),(703,59),(707,59),(746,59),(887,59),(890,59),(892,59),(924,59),(1,60),(201,60),(203,60),(208,60),(278,60),(279,60),(280,60),(281,60),(296,60),(297,60),(307,60),(639,60),(640,60),(689,60),(791,60),(887,60),(892,60),(926,60),(1111,60),(1,61),(84,61),(85,61),(86,61),(133,61),(137,61),(201,61),(203,61),(208,61),(209,61),(210,61),(211,61),(212,61),(221,61),(222,61),(223,61),(224,61),(225,61),(226,61),(227,61),(278,61),(279,61),(280,61),(281,61),(282,61),(288,61),(291,61),(292,61),(294,61),(295,61),(296,61),(297,61),(307,61),(309,61),(310,61),(312,61),(313,61),(370,61),(371,61),(372,61),(451,61),(452,61),(453,61),(454,61),(455,61),(458,61),(459,61),(460,61),(504,61),(559,61),(560,61),(639,61),(640,61),(646,61),(651,61),(663,61),(668,61),(681,61),(686,61),(689,61),(697,61),(702,61),(703,61),(705,61),(706,61),(707,61),(745,61),(746,61),(751,61),(759,61),(769,61),(771,61),(780,61),(782,61),(789,61),(790,61),(791,61),(798,61),(802,61),(803,61),(891,61),(908,61),(926,61),(1092,61),(1106,61),(1,62),(83,62),(84,62),(85,62),(86,62),(137,62),(203,62),(208,62),(209,62),(221,62),(222,62),(223,62),(224,62),(273,62),(278,62),(279,62),(280,62),(281,62),(282,62),(288,62),(291,62),(292,62),(294,62),(295,62),(296,62),(297,62),(300,62),(301,62),(307,62),(309,62),(310,62),(311,62),(312,62),(313,62),(316,62),(370,62),(371,62),(406,62),(458,62),(459,62),(460,62),(491,62),(498,62),(500,62),(501,62),(502,62),(503,62),(504,62),(559,62),(572,62),(579,62),(606,62),(639,62),(640,62),(646,62),(649,62),(663,62),(689,62),(690,62),(697,62),(702,62),(706,62),(707,62),(717,62),(746,62),(751,62),(759,62),(790,62),(791,62),(891,62),(905,62),(915,62),(926,62),(1092,62),(1097,62),(312,63),(639,63),(640,63),(759,63),(772,63),(773,63),(878,63),(889,63),(906,63),(907,63),(911,63),(925,63),(221,64),(223,64),(224,64),(312,64),(313,64),(663,64),(706,64),(803,64),(203,65),(208,65),(209,65),(221,65),(222,65),(223,65),(224,65),(279,65),(280,65),(281,65),(295,65),(296,65),(297,65),(309,65),(310,65),(312,65),(459,65),(460,65),(663,65),(707,65),(746,65),(759,65),(770,65),(791,65),(891,65),(926,65),(1092,65),(1106,65),(83,66),(203,66),(208,66),(222,66),(224,66),(279,66),(280,66),(281,66),(295,66),(296,66),(297,66),(312,66),(459,66),(649,66),(663,66),(746,66),(776,66),(782,66),(791,66),(891,66),(914,66),(915,66),(926,66),(1092,66),(1106,66),(1111,66),(560,67),(686,67),(705,67),(769,67),(789,67),(913,67),(434,68),(435,68),(750,68),(758,68),(893,68),(749,69),(770,69),(61,70),(82,70),(201,70),(219,70),(420,70),(589,70),(690,70),(691,70),(749,70),(770,70),(783,70),(786,70),(787,70),(788,70),(798,70),(799,70),(889,70),(896,70),(897,70),(898,70),(899,70),(900,70),(901,70),(902,70),(903,70),(919,70),(927,70),(1087,70),(1091,70),(1098,70),(691,71),(783,71),(784,72),(785,72),(804,72),(805,72),(806,72),(807,72),(808,72),(809,72),(810,72),(811,72),(812,72),(813,72),(814,72),(815,72),(816,72),(817,72),(818,72),(819,72),(820,72),(821,72),(822,72),(823,72),(824,72),(825,72),(826,72),(827,72),(828,72),(829,72),(830,72),(831,72),(832,72),(833,72),(834,72),(835,72),(836,72),(837,72),(838,72),(839,72),(840,72),(841,72),(842,72),(843,72),(844,72),(845,72),(846,72),(847,72),(848,72),(849,72),(850,72),(851,72),(852,72),(853,72),(854,72),(855,72),(856,72),(857,72),(858,72),(859,72),(860,72),(861,72),(862,72),(879,72),(881,72),(882,72),(884,72),(885,72),(886,72),(907,72),(908,72),(920,72),(921,72),(922,72),(923,72),(201,73),(786,73),(787,73),(798,73),(589,74),(690,74),(788,75),(799,75),(919,75),(1091,75),(889,76),(925,76),(487,77),(563,77),(759,77),(768,77),(894,77),(895,77),(906,78),(201,79),(203,79),(208,79),(1111,79),(916,80),(927,81),(916,230),(1080,230),(1081,230),(1082,230),(1084,230),(1085,230),(1090,230),(1113,230),(1114,230),(1115,230),(1116,230),(1117,230),(1087,231),(1098,231); -/*!40000 ALTER TABLE `Entry_to_Tag` ENABLE KEYS */; -UNLOCK TABLES; - --- --- Table structure for table `Exceptions_Entry_to_Team` --- - -DROP TABLE IF EXISTS `Exceptions_Entry_to_Team`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `Exceptions_Entry_to_Team` ( - `entry_id` int(11) NOT NULL DEFAULT '0', - `team_id` int(11) NOT NULL DEFAULT '0', - PRIMARY KEY (`entry_id`,`team_id`), - KEY `team_id` (`team_id`), - CONSTRAINT `Exceptions_Entry_to_Team_ibfk_1` FOREIGN KEY (`entry_id`) REFERENCES `Entry` (`id`) ON DELETE CASCADE, - CONSTRAINT `Exceptions_Entry_to_Team_ibfk_2` FOREIGN KEY (`team_id`) REFERENCES `Team` (`id`) ON DELETE CASCADE -) ENGINE=InnoDB DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - --- --- Dumping data for table `Exceptions_Entry_to_Team` --- - -LOCK TABLES `Exceptions_Entry_to_Team` WRITE; -/*!40000 ALTER TABLE `Exceptions_Entry_to_Team` DISABLE KEYS */; -INSERT INTO `Exceptions_Entry_to_Team` VALUES (417,1),(584,1),(585,1),(586,1),(587,1),(588,1),(785,1),(584,6),(585,6),(586,6),(587,6),(588,6); -/*!40000 ALTER TABLE `Exceptions_Entry_to_Team` ENABLE KEYS */; -UNLOCK TABLES; - --- --- Table structure for table `OurType_to_Type` --- - -DROP TABLE IF EXISTS `OurType_to_Type`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `OurType_to_Type` ( - `bibtex_type` varchar(250) NOT NULL DEFAULT '', - `our_type` varchar(250) NOT NULL DEFAULT '', - `description` text, - `landing` int(11) DEFAULT '0', - PRIMARY KEY (`bibtex_type`,`our_type`) -) ENGINE=InnoDB DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - --- --- Dumping data for table `OurType_to_Type` --- - -LOCK TABLES `OurType_to_Type` WRITE; -/*!40000 ALTER TABLE `OurType_to_Type` DISABLE KEYS */; -INSERT INTO `OurType_to_Type` VALUES ('article','article','Peer-Reviewed Journal and Magazine Articles',1),('book','book','Authored and Edited Books',1),('book','volumes','Books, Volumes and Theses',0),('inbook','book','Authored and Edited Books',1),('inbook','inbook',NULL,0),('incollection','bibtex-incollection',NULL,0),('incollection','incollection',NULL,0),('incollection','inproceedings','Peer-Reviewed International Conference, Workshop Papers, and Book Chapters',1),('inproceedings','bibtex-inproceedings',NULL,0),('inproceedings','inproceedings','Peer-Reviewed International Conference, Workshop Papers, and Book Chapters',1),('manual','manual','Manuals',1),('mastersthesis','mastersthesis',NULL,0),('mastersthesis','supervised_theses','Supervised Theses',0),('mastersthesis','theses','Theses',1),('misc','misc','Other',1),('phdthesis','phdthesis',NULL,0),('phdthesis','supervised_theses','Supervised Theses',0),('phdthesis','theses','Theses',1),('phdthesis','volumes','Books, Volumes and Theses',0),('proceedings','book','Authored and Edited Books',0),('proceedings','proceedings',NULL,0),('proceedings','volumes','Books, Volumes and Theses',0),('techreport','techreport','Technical Reports',1),('unpublished','unpublished',NULL,0); -/*!40000 ALTER TABLE `OurType_to_Type` ENABLE KEYS */; -UNLOCK TABLES; - --- --- Table structure for table `Tag` --- - -DROP TABLE IF EXISTS `Tag`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `Tag` ( - `name` varchar(250) NOT NULL, - `id` int(11) NOT NULL AUTO_INCREMENT, - `type` int(11) DEFAULT '1', - `permalink` text, - PRIMARY KEY (`id`), - UNIQUE KEY `name` (`name`), - KEY `type` (`type`), - CONSTRAINT `Tag_ibfk_1` FOREIGN KEY (`type`) REFERENCES `TagType` (`id`) -) ENGINE=InnoDB AUTO_INCREMENT=232 DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - --- --- Dumping data for table `Tag` --- - -LOCK TABLES `Tag` WRITE; -/*!40000 ALTER TABLE `Tag` DISABLE KEYS */; -INSERT INTO `Tag` VALUES ('Networking',4,1,'N'),('Virtualization',6,1,NULL),('Survey',7,1,NULL),('Simulation',8,1,NULL),('Meta-models',9,1,NULL),('Performance',10,1,NULL),('Prediction',11,1,NULL),('SOA',12,1,NULL),('QPME_Bibliography',15,3,NULL),('Cloud',19,1,NULL),('QPN',20,1,NULL),('BUNGEE',21,1,NULL),('DML',22,1,NULL),('DQL',23,1,NULL),('LIMBO',24,1,NULL),('LibReDE',25,1,NULL),('SDN',28,1,NULL),('SPA',29,1,NULL),('SPEC',30,1,NULL),('Award',31,1,NULL),('Elasticity',33,1,NULL),('Event-based',34,1,NULL),('Grid',35,1,NULL),('Isolation',36,1,NULL),('Multi-tenancy',38,1,NULL),('Power',41,1,NULL),('Reliability',43,1,NULL),('Security',44,1,NULL),('Storage',47,1,NULL),('Tool',49,1,NULL),('QPME',51,1,NULL),('Optimization',52,1,NULL),('Design_of_enterprise_system_architectures',53,2,'A1'),('Formal_architecture_modeling',54,2,'A2'),('Analytical_and_simulation-based_analysis',55,2,'A3'),('Model_extraction,_calibration_and_maintenance',56,2,'A4'),('Metrics_and_benchmarking_methodologies',57,2,'B1'),('Instrumentation_profiling_and_workload_characterization',58,2,'B2'),('Statistical_estimation_and_machine_learning',59,2,'B3'),('Online_monitoring_and_forecasting',60,2,'B4'),('Data_center_resource_management',61,2,'C1'),('Application_quality_of_service_management',62,2,'C2'),('Power-energy_efficient_computing',63,2,'C3'),('Multi-criteria_optimization',64,2,'C4'),('Self-adaptive-systems',65,1,NULL),('Self-aware-computing',66,1,NULL),('DNI',67,3,'DNI'),('HInjector',68,1,NULL),('Supervised_by_Nikolas_Herbst',69,3,NULL),('Thesis_supervised_by_SE_member',70,3,NULL),('Thesis_supervised_by_Simon_Spinner',71,3,NULL),('Talks',72,3,'talks'),('Thesis_supervised_by_Nikolaus_Huber',73,3,NULL),('Thesis_supervised_by_Fabian_Brosig',74,3,NULL),('Thesis_supervised_by_Juergen_Walter',75,3,NULL),('Thesis_supervised_by_Joakim_vonKistowski',76,3,NULL),('Supervised_PhD_Thesis',77,3,NULL),('Interpolation',78,3,NULL),('WCF',79,1,NULL),('PMX',80,1,NULL),('Thesis_supervised_by_Aleksandar_Milenkoski',81,3,NULL),('Media-coverage',230,3,NULL),('Thesis_supervised_by_Piotr_Rygielski',231,3,NULL); -/*!40000 ALTER TABLE `Tag` ENABLE KEYS */; -UNLOCK TABLES; - --- --- Table structure for table `TagType` --- - -DROP TABLE IF EXISTS `TagType`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `TagType` ( - `name` text, - `comment` text, - `id` int(8) NOT NULL AUTO_INCREMENT, - PRIMARY KEY (`id`) -) ENGINE=InnoDB AUTO_INCREMENT=5 DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - --- --- Dumping data for table `TagType` --- - -LOCK TABLES `TagType` WRITE; -/*!40000 ALTER TABLE `TagType` DISABLE KEYS */; -INSERT INTO `TagType` VALUES ('Tag','keyword',1),('Category','12 categories defined as in research agenda',2),('Other','Reserved for other grouppings of papers (e.g., QPME_Bibliography)',3),('Imported','Tags Imported from Bibtex',4); -/*!40000 ALTER TABLE `TagType` ENABLE KEYS */; -UNLOCK TABLES; - --- --- Table structure for table `Team` --- - -DROP TABLE IF EXISTS `Team`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `Team` ( - `id` int(8) NOT NULL AUTO_INCREMENT, - `name` varchar(250) NOT NULL, - `parent` varchar(250) DEFAULT NULL, - PRIMARY KEY (`id`), - UNIQUE KEY `team_name_unique` (`name`) -) ENGINE=InnoDB AUTO_INCREMENT=7 DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - --- --- Dumping data for table `Team` --- - -LOCK TABLES `Team` WRITE; -/*!40000 ALTER TABLE `Team` DISABLE KEYS */; -INSERT INTO `Team` VALUES (1,'SE-WUERZBURG',NULL),(3,'PiotrPL',NULL),(4,'DESCARTES_ALUMNI',NULL),(6,'DESCARTES',NULL); -/*!40000 ALTER TABLE `Team` ENABLE KEYS */; -UNLOCK TABLES; -/*!40103 SET TIME_ZONE=@OLD_TIME_ZONE */; - -/*!40101 SET SQL_MODE=@OLD_SQL_MODE */; -/*!40014 SET FOREIGN_KEY_CHECKS=@OLD_FOREIGN_KEY_CHECKS */; -/*!40014 SET UNIQUE_CHECKS=@OLD_UNIQUE_CHECKS */; -/*!40101 SET CHARACTER_SET_CLIENT=@OLD_CHARACTER_SET_CLIENT */; -/*!40101 SET CHARACTER_SET_RESULTS=@OLD_CHARACTER_SET_RESULTS */; -/*!40101 SET COLLATION_CONNECTION=@OLD_COLLATION_CONNECTION */; -/*!40111 SET SQL_NOTES=@OLD_SQL_NOTES */; - --- Dump completed on 2016-06-12 20:26:00 diff --git a/fixture/db_new.sql b/fixture/db_new.sql deleted file mode 100644 index c584659..0000000 --- a/fixture/db_new.sql +++ /dev/null @@ -1,347 +0,0 @@ --- MySQL dump 10.13 Distrib 5.5.49, for debian-linux-gnu (x86_64) --- --- Host: localhost Database: publiste --- ------------------------------------------------------ --- Server version 5.5.49-0+deb7u1 - -/*!40101 SET @OLD_CHARACTER_SET_CLIENT=@@CHARACTER_SET_CLIENT */; -/*!40101 SET @OLD_CHARACTER_SET_RESULTS=@@CHARACTER_SET_RESULTS */; -/*!40101 SET @OLD_COLLATION_CONNECTION=@@COLLATION_CONNECTION */; -/*!40101 SET NAMES utf8 */; -/*!40103 SET @OLD_TIME_ZONE=@@TIME_ZONE */; -/*!40103 SET TIME_ZONE='+00:00' */; -/*!40014 SET @OLD_UNIQUE_CHECKS=@@UNIQUE_CHECKS, UNIQUE_CHECKS=0 */; -/*!40014 SET @OLD_FOREIGN_KEY_CHECKS=@@FOREIGN_KEY_CHECKS, FOREIGN_KEY_CHECKS=0 */; -/*!40101 SET @OLD_SQL_MODE=@@SQL_MODE, SQL_MODE='NO_AUTO_VALUE_ON_ZERO' */; -/*!40111 SET @OLD_SQL_NOTES=@@SQL_NOTES, SQL_NOTES=0 */; - -BEGIN; --- --- Table structure for table `Author` --- -SET FOREIGN_KEY_CHECKS=0; -- to disable them - -DROP TABLE IF EXISTS `Author`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `Author` ( - `id` int(5) NOT NULL, - `uid` varchar(250) DEFAULT NULL, - `display` int(1) DEFAULT '0', - `master` tinytext, - `master_id` int(8) DEFAULT NULL, - PRIMARY KEY (`id`), - UNIQUE KEY `author_uid_unique` (`uid`), - KEY `master_id` (`master_id`), - CONSTRAINT `Author_ibfk_1` FOREIGN KEY (`master_id`) REFERENCES `Author` (`id`) ON DELETE CASCADE ON UPDATE CASCADE -) ENGINE=InnoDB DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - - --- --- Dumping data for table `Author` --- - --- LOCK TABLES `Author` WRITE; -/*!40000 ALTER TABLE `Author` DISABLE KEYS */; -INSERT INTO `Author` VALUES (83,'SpinnerSimon',1,'SpinnerSimon',83),(84,'KounevSamuel',1,'KounevSamuel',84),(85,'ZhuXiaoyun',0,'ZhuXiaoyun',85),(86,'UysalMustafa',0,'UysalMustafa',86),(87,'GroendaHenning',0,'GroendaHenning',87),(88,'HuberMatthias',0,'HuberMatthias',88),(90,'Mueller-QuadeJoern',0,'Mueller-QuadeJoern',90),(117,'AvritzerAlberto',0,'AvritzerAlberto',117),(133,'KrogmannKlaus',0,'KrogmannKlaus',133),(137,'ZschalerSteffen',0,'ZschalerSteffen',137),(138,'BauerMarkus',0,'BauerMarkus',138),(156,'GortonIan',0,'GortonIan',156),(166,'KuperbergMichael',0,'KuperbergMichael',166),(176,'RentschlerAndreas',0,'RentschlerAndreas',176),(186,'KlattBenjamin',0,'KlattBenjamin',186),(189,'MirandolaRaffaela',0,'MirandolaRaffaela',189),(205,'HauckMichael',0,'HauckMichael',205),(218,'BenderKonstantin',0,'BenderKonstantin',218),(244,'BlomerJakob',0,'BlomerJakob',244),(245,'BrosigFabian',0,'BrosigFabian',245),(246,'KreidlerAndreas',0,'KreidlerAndreas',246),(247,'KuettelJens',0,'KuettelJens',247),(248,'KuwertzAchim',0,'KuwertzAchim',248),(249,'LiebelGrischa',0,'LiebelGrischa',249),(250,'PopovicDaniel',0,'PopovicDaniel',250),(251,'StuebsMichael',0,'StuebsMichael',251),(252,'TurekAlexander M.',0,'TurekAlexander M.',252),(253,'VogelChristian',0,'VogelChristian',253),(254,'WeinsteinThomas',0,'WeinsteinThomas',254),(255,'WurthThomas',0,'WurthThomas',255),(261,'VaupelRobert',0,'VaupelRobert',261),(276,'BroschFranz',0,'BroschFranz',276),(279,'RathfelderChristoph',0,'RathfelderChristoph',279),(280,'StammelJohannes',0,'StammelJohannes',280),(283,'HuberNikolaus',0,'HuberNikolaus',283),(284,'PaclatCharles',0,'PaclatCharles',284),(296,'ComuzziMarco',0,'ComuzziMarco',296),(297,'KotsokalisConstantinos',0,'KotsokalisConstantinos',297),(298,'TheilmannWolfgang',0,'TheilmannWolfgang',298),(299,'WinklerUlrich',0,'WinklerUlrich',299),(300,'ZaccoGabriele',0,'ZaccoGabriele',300),(301,'CortellessaVittorio',0,'CortellessaVittorio',301),(312,'DurdikZoya',0,'DurdikZoya',312),(327,'FaberMichael',0,'FaberMichael',327),(339,'FunkeDaniel',0,'FunkeDaniel',339),(351,'GillyKatja',0,'GillyKatja',351),(352,'NouRamon',0,'NouRamon',352),(353,'JuizCarlos',0,'JuizCarlos',353),(378,'MuellerRalph',0,'MuellerRalph',378),(381,'FriedrichHolger',0,'FriedrichHolger',381),(383,'SachsKai',0,'SachsKai',383),(389,'KlemsMarkus',0,'KlemsMarkus',389),(390,'PretschnerAlexander',0,'PretschnerAlexander',390),(391,'TaiStefan',0,'TaiStefan',391),(393,'FarahbodRoozbeh',0,'FarahbodRoozbeh',393),(400,'AmrehnErich',0,'AmrehnErich',400),(401,'HinkelGeorg',0,'HinkelGeorg',401),(402,'WeberAndreas',0,'WeberAndreas',402),(416,'BuresTomas',0,'BuresTomas',416),(418,'SchweflinghausJochen',0,'SchweflinghausJochen',418),(419,'DingleN.',0,'DingleN.',419),(420,'JoshiK.',0,'JoshiK.',420),(421,'vanHoornAndre',0,'vanHoornAndre',421),(422,'vonQuastMarcel',0,'vonQuastMarcel',422),(428,'JuseKai S.',0,'JuseKai S.',428),(429,'BuchmannAlejandro',0,'BuchmannAlejandro',429),(443,'KapitzaRuediger',0,'KapitzaRuediger',443),(444,'BehlJohannes',0,'BehlJohannes',444),(445,'CachinChristian',0,'CachinChristian',445),(446,'DistlerTobias',0,'DistlerTobias',446),(447,'KuhnleSimon',0,'KuhnleSimon',447),(448,'Schroeder-PreikschatWolfgang',0,'Schroeder-PreikschatWolfgang',448),(449,'StengelKlaus',0,'StengelKlaus',449),(458,'JezequelJean-Marc',0,'JezequelJean-Marc',458),(463,'OkamotoRussell',0,'OkamotoRussell',463),(464,'DutzChristofer',0,'DutzChristofer',464),(465,'NikolovKiril',0,'NikolovKiril',465),(466,'TorresJordi',0,'TorresJordi',466),(467,'ReineckePhilipp',0,'ReineckePhilipp',467),(469,'JoshiKaustubh',0,'JoshiKaustubh',469),(470,'BabkaVlastimil',0,'BabkaVlastimil',470),(471,'StefanekAnton',0,'StefanekAnton',471),(472,'GilmoreStephen',0,'GilmoreStephen',472),(473,'RizouStamatia',0,'RizouStamatia',473),(474,'AlexakisSpiros',0,'AlexakisSpiros',474),(475,'KourtesisDimitrios',0,'KourtesisDimitrios',475),(476,'PantelopoulosStelios',0,'PantelopoulosStelios',476),(477,'BaconJean',0,'BaconJean',477),(478,'MeierPhilipp',0,'MeierPhilipp',478),(479,'WeisBoern',0,'WeisBoern',479),(482,'NoorshamsQais',0,'NoorshamsQais',482),(485,'TumaPetr',0,'TumaPetr',485),(492,'HochwarthChristian',0,'HochwarthChristian',492),(493,'WertAlexander',0,'WertAlexander',493),(503,'LoeschManuel',0,'LoeschManuel',503),(504,'MuehlGero',0,'MuehlGero',504),(505,'SchroeterArnd',0,'SchroeterArnd',505),(506,'ParzyjeglaHelge',0,'ParzyjeglaHelge',506),(507,'RichlingJan',0,'RichlingJan',507),(508,'MartinecTomacs',0,'MartinecTomacs',508),(509,'MarekLukacs',0,'MarekLukacs',509),(510,'SteinhauserAntonin',0,'SteinhauserAntonin',510),(513,'MayerlChristian',0,'MayerlChristian',513),(516,'AbeckSebastian',0,'AbeckSebastian',516),(526,'IosupAlexandru',0,'IosupAlexandru',526),(527,'RygielskiPiotr',1,'RygielskiPiotr',527),(528,'DingJason',0,'DingJason',528),(529,'CirneWalfredo',0,'CirneWalfredo',529),(530,'RosenbergFlorian',0,'RosenbergFlorian',530),(531,'AntunesNuno',0,'AntunesNuno',531),(532,'VieiraMarco',0,'VieiraMarco',532),(533,'PayneBryan D.',0,'PayneBryan D.',533),(534,'VerdejoAdrian Juan',0,'VerdejoAdrian Juan',534),(538,'HallerbachIgnacio Perez',0,'HallerbachIgnacio Perez',538),(539,'NenovPlamen',0,'NenovPlamen',539),(540,'MihailovDimiter',0,'MihailovDimiter',540),(543,'BuschAxel',0,'BuschAxel',543),(544,'ReebRoland',0,'ReebRoland',544),(545,'BruhnDominik',0,'BruhnDominik',545),(546,'RostamiKiana',0,'RostamiKiana',546),(547,'JuliaFerran',0,'JuliaFerran',547),(554,'PietzuchPeter',0,'PietzuchPeter',554),(555,'EyersDavid',0,'EyersDavid',555),(556,'ShandBrian',0,'ShandBrian',556),(562,'BeckerStefan',0,'BeckerStefan',562),(563,'EvansDavid',0,'EvansDavid',563),(564,'FalconeGiovanni',0,'FalconeGiovanni',564),(567,'WerleDominik',0,'WerleDominik',567),(583,'AppelStefan',0,'AppelStefan',583),(584,'CarterMarc',0,'CarterMarc',584),(585,'SchusterThomas',0,'SchusterThomas',585),(586,'SchusterNelly',0,'SchusterNelly',586),(587,'NimisJens',0,'NimisJens',587),(591,'SPEC',1,'SPEC',591),(593,'GomezSergio Garcia',0,'GomezSergio Garcia',593),(594,'KennedyJohn',0,'KennedyJohn',594),(595,'LorenzoliDavide',0,'LorenzoliDavide',595),(596,'RoeblitzThomas',0,'RoeblitzThomas',596),(597,'ThomasNigel',0,'ThomasNigel',597),(598,'BradleyJeremy',0,'BradleyJeremy',598),(604,'MadeiraHenrique',0,'MadeiraHenrique',604),(620,'LiljaDavid J.',0,'LiljaDavid J.',620),(621,'PankratiusVictor',0,'PankratiusVictor',621),(628,'GorslerFabian',0,'GorslerFabian',628),(640,'SwiatekPawel',0,'SwiatekPawel',640),(641,'GrzechAdam',0,'GrzechAdam',641),(642,'JuszczyszynKrzysztof',0,'JuszczyszynKrzysztof',642),(643,'TomczakJakub',0,'TomczakJakub',643),(644,'GonczarekAdam',0,'GonczarekAdam',644),(645,'Juan-VerdejoAdrian',0,'Juan-VerdejoAdrian',645),(646,'SurajbaliBholanathsingh',0,'SurajbaliBholanathsingh',646),(651,'CasaleGiuliano',0,'CasaleGiuliano',651),(652,'SchneiderPhilipp',0,'SchneiderPhilipp',652),(653,'AhmedNadia',0,'AhmedNadia',653),(654,'NehmeierMarco',0,'NehmeierMarco',654),(655,'WolffvonGudenbergJuergen',0,'WolffvonGudenbergJuergen',655),(1085,'MommChristof',0,'MommChristof',1085),(1091,'HappeJens',0,'HappeJens',1091),(1097,'WestermannDennis',0,'WestermannDennis',1097),(1099,'HappeLucia',0,'HappeLucia',1099),(1107,'GoldschmidtThomas',0,'GoldschmidtThomas',1107),(1109,'KoziolekAnne',0,'KoziolekAnne',1109),(1115,'WalterJuergen',1,'WalterJuergen',1115),(1121,'HerbstNikolas',1,'HerbstNikolas',1121),(1125,'BeckerSteffen',0,'BeckerSteffen',1125),(1127,'KoziolekHeiko',0,'KoziolekHeiko',1127),(1137,'vonKistowskiJoakim',1,'vonKistowskiJoakim',1137),(1141,'ReussnerRalf',0,'ReussnerRalf',1141),(1143,'KrebsRouven',0,'KrebsRouven',1143),(1148,'OsmanRasha',0,'OsmanRasha',1148),(1149,'CouldenDavid',0,'CouldenDavid',1149),(1151,'KnottenbeltWilliam',0,'KnottenbeltWilliam',1151),(1152,'BulejLubomir',0,'BulejLubomir',1152),(1153,'LibicPeter',0,'LibicPeter',1153),(1154,'MarekLukas',0,'MarekLukas',1154),(1155,'MartinecTomas',0,'MartinecTomas',1155),(1156,'PodzimekAndrej',0,'PodzimekAndrej',1156),(1157,'AitArezki',0,'AitArezki',1157),(1158,'LallementPatrick',0,'LallementPatrick',1158),(1159,'HeimburgerFrank',0,'HeimburgerFrank',1159),(1160,'BellurUmesh',0,'BellurUmesh',1160),(1161,'ShirabateAkhilesh',0,'ShirabateAkhilesh',1161),(1162,'BauseFalko',0,'BauseFalko',1162),(1163,'KritzingerPieter S.',0,'KritzingerPieter S.',1163),(1164,'WenHung-We',0,'WenHung-We',1164),(1165,'FuLi-Chen',0,'FuLi-Chen',1165),(1166,'HuangShih-Shinh',0,'HuangShih-Shinh',1166),(1167,'BuchholzPeter',0,'BuchholzPeter',1167),(1168,'KemperPeter',0,'KemperPeter',1168),(1181,'HeimlichOliver',0,'HeimlichOliver',1181),(1183,'SiegelStefan',0,'SiegelStefan',1183),(1184,'TischlerGerman',0,'TischlerGerman',1184),(1185,'KnottenbeltWilliamJ.',0,'KnottenbeltWilliam',1151),(1186,'KnottenbeltWilliam J.',0,'KnottenbeltWilliam',1151),(1187,'WolffJuergen',0,'WolffvonGudenbergJuergen',655),(1188,'KapovaLucia',0,'KapovaLucia',1188),(1189,'MartensAnne',0,'MartensAnne',1189),(1190,'DennisWestermann',0,'DennisWestermann',1190),(1191,'RouvenKrebs',0,'RouvenKrebs',1191),(1192,'JensHappe',0,'JensHappe',1192),(1197,'ReussnerRalf H.',0,'ReussnerRalf',1141),(1198,'vonKistowskiJoakim Gunnarson',0,'vonKistowskiJoakim',1137),(1199,'HerbstNikolas Roman',0,'HerbstNikolas',1121),(1201,'LuLei',0,'LuLei',1201),(1202,'HollerAnne',0,'HollerAnne',1202),(1203,'GriffithRean',0,'GriffithRean',1203),(1204,'MehtaArpit',0,'MehtaArpit',1204),(1205,'ManuelRouven Krebs',0,'ManuelRouven Krebs',1205),(1208,'SiegelS.',0,'SiegelS.',1208),(1209,'BeckPhilip-Daniel',0,'BeckPhilip-Daniel',1209),(1210,'BawidamannUwe',0,'BawidamannUwe',1210),(1211,'BlockHansfried',0,'BlockHansfried',1211),(1212,'BeckettJohn',0,'BeckettJohn',1212),(1213,'LangeKlaus-Dieter',0,'LangeKlaus-Dieter',1213),(1214,'ArnoldJeremy A.',0,'ArnoldJeremy A.',1214),(1215,'HupplerKarl',0,'HupplerKarl',1215),(1216,'HenningJohn L.',0,'HenningJohn L.',1216),(1217,'CaoPaul',0,'CaoPaul',1217),(1220,'vonKistowskiJoakim Gunnarsson',0,'vonKistowskiJoakim',1137),(1222,'BohlenderG.',0,'BohlenderG.',1222),(1223,'KaucherE.',0,'KaucherE.',1223),(1224,'KlatteR.',0,'KlatteR.',1224),(1225,'KulischU.',0,'KulischU.',1225),(1226,'MirankerW. L.',0,'MirankerW. L.',1226),(1227,'UllrichCh.',0,'UllrichCh.',1227),(1229,'v.GudenbergJ. Wolff',0,'WolffvonGudenbergJuergen',655),(1230,'v.Gudenberg J. Wolff',0,'WolffvonGudenbergJuergen',655),(1231,'SamuelNikolaus HuberFabian',0,'SamuelNikolaus HuberFabian',1231),(1232,'BrzostowskiKrzysztof',0,'BrzostowskiKrzysztof',1232),(1233,'ZollerDaniel',0,'ZollerDaniel',1233),(1234,'HothoAndreas',0,'HothoAndreas',1234),(1235,'YavuzCan Alexander',0,'YavuzCan Alexander',1235),(1236,'SchottWaldemar',0,'SchottWaldemar',1236),(1237,'RattuDharminder',0,'RattuDharminder',1237),(1238,'HildebrandtAdrian',0,'HildebrandtAdrian',1238),(1240,'Tran-GiaPhuoc',0,'Tran-GiaPhuoc',1240),(1241,'CarvalhoDiogo',0,'CarvalhoDiogo',1241),(1246,'\'SwikatekPawel',0,'SwiatekPawel',640),(1247,'\'SwiatekPawel',0,'SwiatekPawel',640),(1248,'SwikatekPawel',0,'SwiatekPawel',640),(1249,'NehmeierM.',0,'NehmeierMarco',654),(1250,'BradleyJeremy T.',0,'BradleyJeremy',598),(1257,'MarekLukaecs',0,'MarekLukaecs',1257),(1258,'EismannSimon',0,'EismannSimon',1258),(1259,'Aleksandar Milenkoski',0,'Aleksandar Milenkoski',1259),(1261,'KephartJeffrey O.',0,'KephartJeffrey O.',1261),(1262,'KwiatkowskaMarta',0,'KwiatkowskaMarta',1262),(1263,'LangeStanislav',0,'LangeStanislav',1263),(1264,'GebertSteffen',0,'GebertSteffen',1264),(1265,'SpoerhaseJoachim',0,'SpoerhaseJoachim',1265),(1266,'ZinnerThomas',0,'ZinnerThomas',1266),(1267,'KusnadyEnrico',0,'KusnadyEnrico',1267),(1268,'MatershevEvgeny',0,'MatershevEvgeny',1268),(1269,'ZippFrederik',0,'ZippFrederik',1269),(1271,'KiesnerMaximilian',0,'KiesnerMaximilian',1271),(1273,'KrcmarHelmut',0,'KrcmarHelmut',1273),(1274,'WillneckerFelix',0,'WillneckerFelix',1274),(1275,'DlugiMarkus',0,'DlugiMarkus',1275),(1276,'BrunnertAndreas',0,'BrunnertAndreas',1276),(1277,'AvrtizerAlberto',0,'AvrtizerAlberto',1277),(1278,'GehringAndreas',0,'GehringAndreas',1278),(1280,'BaehrManuel',0,'BaehrManuel',1280),(1281,'DanciuAlexandru',0,'DanciuAlexandru',1281),(1282,'HasselbringWilhelm',0,'HasselbringWilhelm',1282),(1283,'HegerChristoph',0,'HegerChristoph',1283),(1284,'JamshidiPooyan',0,'JamshidiPooyan',1284),(1285,'JungReiner',0,'JungReiner',1285),(1286,'KrossJohannes',0,'KrossJohannes',1286),(1287,'VoegeleChristian',0,'VoegeleChristian',1287),(1288,'LuftMatthias',0,'LuftMatthias',1288),(1289,'JuergenAndrian HildebrandtSimon',0,'JuergenAndrian HildebrandtSimon',1289),(1292,'IfflaenderLukas',1,'IfflaenderLukas',1292),(1293,'IfflanderLukas',0,'IfflaenderLukas',1292),(1295,'IflaenderLukas',0,'IfflaenderLukas',1292),(1296,'IflanderLukas',0,'IfflaenderLukas',1292),(1297,'SimkoViliam',0,'SimkoViliam',1297),(1298,'SittnerFelix',0,'SittnerFelix',1298),(1299,'AschenbrennerDoris',0,'AschenbrennerDoris',1299),(1300,'SchillingKlaus',0,'SchillingKlaus',1300),(1301,'SpradlingCloyce',0,'SpradlingCloyce',1301),(1302,'OkanovicDusan',0,'OkanovicDusan',1302),(1303,'EmmerichRobert',0,'EmmerichRobert',1303),(1304,'DemlerJakob',0,'DemlerJakob',1304),(1305,'WangWeikun',0,'WangWeikun',1305),(1306,'SchreckMarco',0,'SchreckMarco',1306),(1307,'LeonhardtAlexander',0,'LeonhardtAlexander',1307),(1309,'GruenerK.',0,'GruenerK.',1309),(1310,'KraemerW.',0,'KraemerW.',1310),(1311,'RumpS. M.',0,'RumpS. M.',1311),(1312,'BoehmH.',0,'BoehmH.',1312),(1313,'UrlaubT.',0,'UrlaubT.',1313),(1314,'SeemannJ.',0,'SeemannJ.',1314),(1315,'KlingsporM.',0,'KlingsporM.',1315),(1316,'YakovlevA.',0,'YakovlevA.',1316),(1317,'MenzelB.',0,'MenzelB.',1317),(1318,'MirankerW.L.',0,'MirankerW.L.',1318),(1319,'SchumacherG.',0,'SchumacherG.',1319),(1320,'BambergerL.',0,'BambergerL.',1320),(1321,'FischerH.C.',0,'FischerH.C.',1321),(1322,'WinterD.',0,'WinterD.',1322),(1323,'ZoellnerA.',0,'ZoellnerA.',1323),(1324,'KleinW.',0,'KleinW.',1324),(1325,'ErlM.',0,'ErlM.',1325),(1326,'NeagaM.',0,'NeagaM.',1326),(1327,'LerchM.',0,'LerchM.',1327),(1328,'WiechertW.',0,'WiechertW.',1328),(1329,'CorlissG.',0,'CorlissG.',1329),(1330,'HuC.',0,'HuC.',1330),(1331,'KearfottB.',0,'KearfottB.',1331),(1332,'WalsterB.',0,'WalsterB.',1332),(1333,'KreinovichV.',0,'KreinovichV.',1333),(1334,'KollaR.',0,'KollaR.',1334),(1335,'VodopivecA.',0,'VodopivecA.',1335),(1336,'EichelbergerH.',0,'EichelbergerH.',1336),(1337,'TischlerG.',0,'TischlerG.',1337),(1338,'MayerG.',0,'MayerG.',1338),(1339,'HofschusterW.',0,'HofschusterW.',1339),(1340,'PuchanJ.',0,'PuchanJ.',1340),(1341,'StuckyW.',0,'StuckyW.',1341),(1342,'UllrichC.',0,'UllrichC.',1342),(1343,'RallL.B.',0,'RallL.B.',1343),(1344,'VoshchininA.P.',0,'VoshchininA.P.',1344),(1345,'LohnerR.',0,'LohnerR.',1345),(1346,'BrauneK.',0,'BrauneK.',1346),(1347,'GruenerW.',0,'GruenerW.',1347),(1348,'KirchnerR.',0,'KirchnerR.',1348),(1349,'FischerG.',0,'FischerG.',1349),(1350,'HopfnerM.',0,'HopfnerM.',1350),(1351,'SeipelD.',0,'SeipelD.',1351),(1352,'GruppF.',0,'GruppF.',1352),(1353,'WahlerV.',0,'WahlerV.',1353),(1354,'NiederleA.',0,'NiederleA.',1354),(1355,'EbnerM.',0,'EbnerM.',1355),(1356,'GlaserD.',0,'GlaserD.',1356),(1357,'LusiardiJ.',0,'LusiardiJ.',1357),(1358,'vonGudenbergJuergen Wolff',0,'WolffvonGudenbergJuergen',655),(1359,'KuesterMartin',0,'KuesterMartin',1359),(1360,'StierChristian',0,'StierChristian',1360),(1361,'MuellerChristoph',0,'MuellerChristoph',1361),(1362,'ExampleJohny',0,'ExampleJohny',1362),(1363,'KatzenbergerVera',0,'KatzenbergerVera',1363),(1364,'DürandDieter',0,'DürandDieter',1364),(1365,'DuerandDieter',0,'DuerandDieter',1365),(1366,'OikonomouGiorgos',0,'OikonomouGiorgos',1366),(1367,'KousiourisGeorge',0,'KousiourisGeorge',1367),(1368,'EvangelinouAthanasia',0,'EvangelinouAthanasia',1368),(1369,'Main-Echo',0,'Main-Echo',1369),(1370,'Main-Post',0,'Main-Post',1370),(1371,'StollJonathan',0,'StollJonathan',1371),(1372,'JaegerBernd',0,'JaegerBernd',1372),(1373,'RainaKapil',0,'RainaKapil',1373),(1374,'HarrisMason',0,'HarrisMason',1374),(1375,'ChaudhrySaif',0,'ChaudhrySaif',1375),(1376,'ChasiriSivadon',0,'ChasiriSivadon',1376),(1377,'DavidVeronica',0,'DavidVeronica',1377),(1378,'LiuWenmao',0,'LiuWenmao',1378),(1379,'ChaudhuriAbhik',0,'ChaudhuriAbhik',1379),(1380,'FerrerHeberto',0,'FerrerHeberto',1380),(1381,'PrafullchandraHemma',0,'PrafullchandraHemma',1381),(1382,'SherryJ.D.',0,'SherryJ.D.',1382),(1383,'NgKelvin',0,'NgKelvin',1383),(1384,'GeXiaoyu',0,'GeXiaoyu',1384),(1385,'SingYao',0,'SingYao',1385),(1386,'PorYiak',0,'PorYiak',1386),(1389,'MilenkoskiAleksandar',1,'MilenkoskiAleksandar',1389),(1390,'Contributor)Aleksandar Milenkoski (Minor',0,'MilenkoskiAleksandar',1389),(1391,'einBLICK(Vera',0,'einBLICK(Vera',1391),(1392,'InformationsdienstRobert Emmerich',0,'InformationsdienstRobert Emmerich',1392),(1393,'DuerandWirtschaftswoche (Dieter',0,'DuerandWirtschaftswoche (Dieter',1393),(1394,'WirtschaftswocheDieter Duerand',0,'WirtschaftswocheDieter Duerand',1394),(1395,'Wirtschaftswoche(Dieter Duerand',0,'Wirtschaftswoche(Dieter Duerand',1395),(1396,'DuerandWirtschaftswoche Dieter',0,'DuerandWirtschaftswoche Dieter',1396),(1397,'DieterWirtschaftswoche',0,'DieterWirtschaftswoche',1397),(1398,'(DieterWirtschaftswoche',0,'(DieterWirtschaftswoche',1398),(1399,'einBLICK(Robert',0,'einBLICK(Robert',1399),(1400,'Emmerich)Informationsdienst Wissenschaft (Robert',0,'Emmerich)Informationsdienst Wissenschaft (Robert',1400),(1401,'RadioBayern 2',0,'RadioBayern 2',1401),(1402,'Bayern 2',0,'Bayern 2',1402),(1403,'ThieleChristoph',0,'ThieleChristoph',1403),(1404,'SimonXiaoyun Zhu Lei Lu Mustafa Uysal Anne Holler Rean Griffith Pradeep PadalaSamuel',0,'SimonXiaoyun Zhu Lei Lu Mustafa Uysal Anne Holler Rean Griffith Pradeep PadalaSamuel',1404),(1405,'PadalaPradeep',0,'PadalaPradeep',1405),(1406,'RundschauBayrischer Rundfunk -',0,'RundschauBayrischer Rundfunk -',1406),(1407,'SamuelPhilipp Meier Steffen Becker Anne Koziolek Heiko KoziolekFabian',0,'SamuelPhilipp Meier Steffen Becker Anne Koziolek Heiko KoziolekFabian',1407),(1408,'MularzDiane E.',0,'MularzDiane E.',1408),(1409,'CurtissJonathan A.',0,'CurtissJonathan A.',1409),(1410,'DingJason J.',0,'DingJason J.',1410),(1412,'Editor)Aleksandar Milenkoski (Assistant',0,'MilenkoskiAleksandar',1389),(1413,'Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski',0,'Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski',1413),(1414,'JayaramK. R.',0,'JayaramK. R.',1414),(1415,'MaggioMartina',0,'MaggioMartina',1415),(1416,'SmirniEvgenia',0,'SmirniEvgenia',1416),(1417,'AminAyman',0,'AminAyman',1417),(1418,'AndrzejakArtur',0,'AndrzejakArtur',1418),(1419,'GrunskeLars',0,'GrunskeLars',1419),(1420,'MengshoelOle J.',0,'MengshoelOle J.',1420),(1421,'SundararajanPriya',0,'SundararajanPriya',1421),(1422,'ForschungsquartettDetektorFM -',0,'ForschungsquartettDetektorFM -',1422),(1423,'Uniserv',0,'Uniserv',1423),(1424,'EinBLICK',0,'EinBLICK',1424),(1425,'Rechenzentrum Universität Würzbugr',0,'Rechenzentrum Universität Würzbugr',1425),(1426,'Rechenzentrum Universitaet Wuerzbug',0,'Rechenzentrum Universitaet Wuerzbug',1426); -/*!40000 ALTER TABLE `Author` ENABLE KEYS */; --- UNLOCK TABLES; - --- --- Table structure for table `Author_to_Team` --- - -DROP TABLE IF EXISTS `Author_to_Team`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `Author_to_Team` ( - `author_id` int(11) NOT NULL DEFAULT '0', - `team_id` int(11) NOT NULL DEFAULT '0', - `start` int(11) DEFAULT '0', - `stop` int(11) DEFAULT '0', - PRIMARY KEY (`author_id`,`team_id`), - KEY `team_id` (`team_id`), - CONSTRAINT `Author_to_Team_ibfk_1` FOREIGN KEY (`author_id`) REFERENCES `Author` (`master_id`) ON DELETE CASCADE ON UPDATE CASCADE, - CONSTRAINT `Author_to_Team_ibfk_2` FOREIGN KEY (`team_id`) REFERENCES `Team` (`id`) ON DELETE CASCADE ON UPDATE CASCADE -) ENGINE=InnoDB DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - --- --- Dumping data for table `Author_to_Team` --- -SET FOREIGN_KEY_CHECKS=0; --- LOCK TABLES `Author_to_Team` WRITE; -/*!40000 ALTER TABLE `Author_to_Team` DISABLE KEYS */; -INSERT INTO `Author_to_Team` VALUES (58,4,2013,0),(58,6,2011,2013),(72,6,0,0),(83,1,0,0),(83,6,0,0),(84,1,0,0),(84,6,0,0),(218,4,0,0),(218,6,0,0),(245,1,0,2015),(245,6,0,0),(279,1,0,2014),(279,6,0,2013),(283,1,0,2015),(283,6,0,0),(327,4,2013,0),(327,6,2011,2012),(383,4,2012,0),(383,6,0,2011),(478,6,0,0),(482,6,0,2015),(527,1,2013,0),(527,3,0,2012),(527,6,2013,0),(628,6,0,0),(654,1,0,0),(1115,1,2013,0),(1115,6,2013,0),(1121,1,0,0),(1121,6,0,0),(1137,1,0,0),(1137,6,0,0),(1143,1,0,2015),(1143,6,0,2015),(1292,1,2015,0),(1389,1,0,0),(1389,6,0,0); -/*!40000 ALTER TABLE `Author_to_Team` ENABLE KEYS */; --- UNLOCK TABLES; - --- --- Table structure for table `Cron` --- - -DROP TABLE IF EXISTS `Cron`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `Cron` ( - `type` int(11) NOT NULL, - `last_run_time` timestamp NOT NULL DEFAULT CURRENT_TIMESTAMP, - PRIMARY KEY (`type`) -) ENGINE=InnoDB DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - --- --- Dumping data for table `Cron` --- - --- LOCK TABLES `Cron` WRITE; -/*!40000 ALTER TABLE `Cron` DISABLE KEYS */; -INSERT INTO `Cron` VALUES (0,'2016-06-12 18:00:01'),(1,'2016-06-12 00:00:02'),(2,'2016-06-12 00:05:01'),(3,'2016-05-31 09:09:00'); -/*!40000 ALTER TABLE `Cron` ENABLE KEYS */; --- UNLOCK TABLES; - --- --- Table structure for table `Entry` --- - -DROP TABLE IF EXISTS `Entry`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `Entry` ( - `id` int(8) NOT NULL, - `entry_type` enum('paper','talk') NOT NULL, - `bibtex_key` varchar(250) DEFAULT NULL, - `bibtex_type` varchar(50) DEFAULT NULL, - `bib` text, - `html` text, - `html_bib` text, - `abstract` text, - `title` text, - `hidden` tinyint(3) unsigned DEFAULT '0', - `month` tinyint(3) unsigned DEFAULT '0', - `year` int(4) DEFAULT NULL, - `sort_month` smallint(5) unsigned DEFAULT '0', - `teams_str` text, - `people_str` text, - `tags_str` text, - `creation_time` timestamp NOT NULL DEFAULT '0000-00-00 00:00:00', - `modified_time` timestamp NOT NULL DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP, - `need_html_regen` int(11) DEFAULT '1', - PRIMARY KEY (`id`), - UNIQUE KEY `bibtex_key` (`bibtex_key`), - KEY `idx_bibtex_key` (`bibtex_key`) -) ENGINE=InnoDB DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - --- --- Dumping data for table `Entry` --- - --- LOCK TABLES `Entry` WRITE; -/*!40000 ALTER TABLE `Entry` DISABLE KEYS */; -INSERT INTO `Entry` VALUES (1,'paper','SpKoZhUy2013-mrt-TowardsModelExtraction','inproceedings','@inproceedings{SpKoZhUy2013-mrt-TowardsModelExtraction,\n author = {Simon Spinner and Samuel Kounev and Xiaoyun Zhu and Mustafa Uysal},\n title = {{Towards Online Performance Model Extraction in Virtualized Environments}},\n editor = {Nelly Bencomo and Robert France and Sebastian G\\\"{o}tz and Bernhard Rumpe},\n pages = {89--95},\n publisher = {CEUR-WS},\n titleaddon = {(Position Paper)},\n booktitle = {Proceedings of the 8th Workshop on Models @ Run.time (MRT 2013) co-located with ACM/IEEE 16th International Conference on Model Driven Engineering Languages and Systems (MODELS 2013)},\n location = {Miami, Florida, USA},\n url = {http://ceur-ws.org/Vol-1079/mrt13_submission_4.pdf},\n day = {29},\n month = {Sept},\n year = {2013},\n abstract = {Virtualization increases the complexity and dynamics of modern software architectures making it a major challenge to manage the end-to-end performance of applications. Architecture-level performance models can help here as they provide the modeling power and analysis fexibility to predict the performance behavior of applications under varying workloads and configurations. However, the construction of such models is a complex and time-consuming task. In this position paper, we discuss how the existing concept of virtual appliances can be extended to automate the extraction of architecture-level performance models during system operation.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1.pdf},\n}\n\n','\n\nSimon Spinner, Samuel Kounev, Xiaoyun Zhu, and Mustafa Uysal.\nTowards Online Performance Model Extraction in Virtualized\nEnvironments (position paper).\nIn Proceedings of the 8th Workshop on Models @ Run.time (MRT\n2013) co-located with ACM/IEEE 16th International Conference on Model Driven\nEngineering Languages and Systems (MODELS 2013), Nelly Bencomo, Robert\nFrance, Sebastian Götz, and Bernhard Rumpe, editors, Miami, Florida, USA,\nSept 29, 2013, pages 89-95. CEUR-WS.\nSept 2013.\n[ bib | .pdf | .pdf | Abstract  ] 
\n@inproceedings{SpKoZhUy2013-mrt-TowardsModelExtraction,\nauthor = {Simon Spinner and Samuel Kounev and Xiaoyun Zhu and Mustafa Uysal},\ntitle = {{Towards Online Performance Model Extraction in Virtualized Environments}},\neditor = {Nelly Bencomo and Robert France and Sebastian G\\\"{o}tz and Bernhard Rumpe},\npages = {89--95},\npublisher = {CEUR-WS},\ntitleaddon = {(Position Paper)},\nbooktitle = {Proceedings of the 8th Workshop on Models @ Run.time (MRT 2013) co-located with ACM/IEEE 16th International Conference on Model Driven Engineering Languages and Systems (MODELS 2013)},\nlocation = {Miami, Florida, USA},\nurl = {http://ceur-ws.org/Vol-1079/mrt13_submission_4.pdf},\nday = {29},\nmonth = {Sept},\nyear = {2013},\nabstract = {Virtualization increases the complexity and dynamics of modern software architectures making it a major challenge to manage the end-to-end performance of applications. Architecture-level performance models can help here as they provide the modeling power and analysis fexibility to predict the performance behavior of applications under varying workloads and configurations. However, the construction of such models is a complex and time-consuming task. In this position paper, we discuss how the existing concept of virtual appliances can be extended to automate the extraction of architecture-level performance models during system operation.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1.pdf}\n}\n
\n
\nVirtualization increases the complexity and dynamics of modern software architectures making it a major challenge to manage the end-to-end performance of applications. Architecture-level performance models can help here as they provide the modeling power and analysis fexibility to predict the performance behavior of applications under varying workloads and configurations. However, the construction of such models is a complex and time-consuming task. In this position paper, we discuss how the existing concept of virtual appliances can be extended to automate the extraction of architecture-level performance models during system operation.\n
\n','
\n@inproceedings{SpKoZhUy2013-mrt-TowardsModelExtraction,\n  author = {Simon Spinner and Samuel Kounev and Xiaoyun Zhu and Mustafa Uysal},\n  title = {{Towards Online Performance Model Extraction in Virtualized Environments}},\n  editor = {Nelly Bencomo and Robert France and Sebastian G\\\"{o}tz and Bernhard Rumpe},\n  pages = {89--95},\n  publisher = {CEUR-WS},\n  titleaddon = {(Position Paper)},\n  booktitle = {Proceedings of the 8th Workshop on Models @ Run.time (MRT 2013) co-located with ACM/IEEE 16th International Conference on Model Driven Engineering Languages and Systems (MODELS 2013)},\n  location = {Miami, Florida, USA},\n  url = {http://ceur-ws.org/Vol-1079/mrt13_submission_4.pdf},\n  day = {29},\n  month = {Sept},\n  year = {2013},\n  abstract = {Virtualization increases the complexity and dynamics of modern software architectures making it a major challenge to manage the end-to-end performance of applications. Architecture-level performance models can help here as they provide the modeling power and analysis fexibility to predict the performance behavior of applications under varying workloads and configurations. However, the construction of such models is a complex and time-consuming task. In this position paper, we discuss how the existing concept of virtual appliances can be extended to automate the extraction of architecture-level performance models during system operation.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1.pdf}\n}\n
\n\n','Virtualization increases the complexity and dynamics of modern software architectures making it a major challenge to manage the end-to-end performance of applications. Architecture-level performance models can help here as they provide the modeling power and analysis fexibility to predict the performance behavior of applications under varying workloads and configurations. However, the construction of such models is a complex and time-consuming task. In this position paper, we discuss how the existing concept of virtual appliances can be extended to automate the extraction of architecture-level performance models during system operation.','{Towards Online Performance Model Extraction in Virtualized Environments}',0,9,2013,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(61,'paper','bender2010','mastersthesis','@mastersthesis{bender2010,\n address = {Karlsruhe, Germany},\n author = {Konstantin Bender},\n month = {May},\n school = {Karlsruhe Institute of Technology, Karlsruhe, Germany},\n title = {{Automated Performance Model Extraction of Enterprise Data Fabrics}},\n year = {2010},\n}\n\n','\n\nKonstantin Bender.\nAutomated Performance Model Extraction of Enterprise Data Fabrics.\nMaster\'s thesis, Karlsruhe Institute of Technology, Karlsruhe,\nGermany, Karlsruhe, Germany, May 2010.\n[ bib  ] 
\n@mastersthesis{bender2010,\naddress = {Karlsruhe, Germany},\nauthor = {Konstantin Bender},\nmonth = {May},\nschool = {Karlsruhe Institute of Technology, Karlsruhe, Germany},\ntitle = {{Automated Performance Model Extraction of Enterprise Data Fabrics}},\nyear = {2010}\n}\n
\n
\n','
\n@mastersthesis{bender2010,\n  address = {Karlsruhe, Germany},\n  author = {Konstantin Bender},\n  month = {May},\n  school = {Karlsruhe Institute of Technology, Karlsruhe, Germany},\n  title = {{Automated Performance Model Extraction of Enterprise Data Fabrics}},\n  year = {2010}\n}\n
\n\n',NULL,'{Automated Performance Model Extraction of Enterprise Data Fabrics}',0,5,2010,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(65,'paper','groenda2008c','techreport','@techreport{groenda2008c,\n abstract = {Systematische Qualit\\\"{a}tssicherung gewinnt im Rahmen des globalenWettbewerbs auch in der Software-Entwicklungsbranche zunehmend an Bedeutung. Vor allem auf dem Weg zur Software-Industrialisierung bzw. zu einer ingenieurm\\\"{a}ss{}igen Software-Entwicklung ist eine durchg\\\"{a}ngige Qualit\\\"{a}tssicherung unabdingbar. Zertifizierungen bieten hierbei die M\\\"{o}glichkeit, die Einhaltung bestimmter Standards und Kriterien durch unabh\\\"{a}ngige Dritte \\\"{u}berpr\\\"{u}fen und bescheinigen zu lassen, um die Qualit\\\"{a}t eines Produktes oder Entwicklungsprozesses zu belegen. Zertifizierungen k\\\"{o}nnen sich sowohl auf Produkte und Prozesse als auch auf die Ausbildung und das Wissen von Einzelpersonen beziehen. Da Zertifikate durch unabh\\\"{a}ngige Pr\\\"{u}finstanzen ausgestellt werden, wird Zertifikaten und deren \\\"{u}berpr\\\"{u}fbaren Aussagen im Allgemeinen ein deutlich h\\\"{o}heres Vertrauen entgegengebracht als Qualit\\\"{a}tsversprechen von Software-Herstellern selbst. Unternehmen, die ihre Prozesse beispielsweise nach CMMI zertifizieren lassen, k\\\"{o}nnen damit ihre F\\\"{a}higkeiten unter Beweis stellen, Projekte erfolgreich und mit vorhersagbarer Qualit\\\"{a}t abschlie{ss}en zu k\\\"{o}nnen. Neben dem Nachweis entsprechender Zertifikate als Diversifikationsmerkmal gegen\\\"{u}ber Mitbewerbern k\\\"{o}nnen Zertifikate \\\"{u}ber die Einhaltung von Standards auch durch den Gesetzgeber vorgeschrieben werden. Ein Beispiel hierf\\\"{u}r sind Zertifikate aus Hochsicherheitsbereichen wie Atomkraftwerken. Das Seminar wurde wie eine wissenschaftliche Konferenz organisiert: Die Einreichungen wurden in einem zweistufigen Peer-Review-Verfahren begutachtet. In der ersten Stufe wurde eine Begutachtung der studentischen Arbeiten durch Kommilitonen durchgef\\\"{u}hrt, in der zweiten Stufe eine Begutachtung durch die Betreuer. In verschiedenen Sessions wurden die Artikel an zwei Konferenztagen pr\\\"{a}sentiert. Die besten Beitr\\\"{a}ge wurden durch best paper awards ausgezeichnet. Diese gingen an Fabian Brosig f\\\"{u}r seine Arbeit Cost Benefit Analysis Method (CBAM), an Jakob Blomer f\\\"{u}r die Arbeit Zertifizierung von Softwarebenchmarks und an Grischa Liebel f\\\"{u}r die Arbeit SWT - Das Standard Widget Toolkit, denen hiermit noch einmal herzlich zu dieser herausragenden Leistung gratuliert wird. Erg\\\"{a}nzend zu den Vortr\\\"{a}gen der Seminarteilnehmer wurde ein eingeladener Vortrag gehalten. Herr Dr. Dirk Feuerhelm von der 1&1 Internet AG gab dabei dankenswerterweise in seinem Vortrag mit dem Thema Softskills -- Ist das objektorientiert oder modellgetrieben? einen Einblick in die Aufgaben als Leiter der Software-Entwicklung},\n author = {Jakob Blomer and Fabian Brosig and Andreas Kreidler and Jens K{\"u}ttel and Achim Kuwertz and Grischa Liebel and Daniel Popovic and Michael St{\"u}bs and Alexander M. Turek and Christian Vogel and Thomas Weinstein and Thomas Wurth},\n editor = {Thomas Goldschmidt and Henning Groenda and Klaus Krogmann and Michael Kuperberg and Anne Martens and Christoph Rathfelder and Ralf Reussner and Johannes Stammel},\n institution = {Universit\\\"{a}t Karlsruhe, Fakult\\\"{a}t f\\\"{u}r Informatik},\n language = {ger},\n location = {Karlsruhe},\n number = {4/2008},\n title = {{S}oftware {Z}ertifizierung},\n year = {2008},\n}\n\n','\n\nJakob Blomer, Fabian Brosig, Andreas Kreidler, Jens K\"uttel, Achim Kuwertz,\nGrischa Liebel, Daniel Popovic, Michael St\"ubs, Alexander M. Turek,\nChristian Vogel, Thomas Weinstein, and Thomas Wurth.\nSoftware Zertifizierung.\nTechnical Report 4/2008, Universität Karlsruhe, Fakultät\nfür Informatik, 2008.\n[ bib | Abstract  ] 
\n@techreport{groenda2008c,\nabstract = {Systematische Qualit\\\"{a}tssicherung gewinnt im Rahmen des globalenWettbewerbs auch in der Software-Entwicklungsbranche zunehmend an Bedeutung. Vor allem auf dem Weg zur Software-Industrialisierung bzw. zu einer ingenieurm\\\"{a}ss{}igen Software-Entwicklung ist eine durchg\\\"{a}ngige Qualit\\\"{a}tssicherung unabdingbar. Zertifizierungen bieten hierbei die M\\\"{o}glichkeit, die Einhaltung bestimmter Standards und Kriterien durch unabh\\\"{a}ngige Dritte \\\"{u}berpr\\\"{u}fen und bescheinigen zu lassen, um die Qualit\\\"{a}t eines Produktes oder Entwicklungsprozesses zu belegen. Zertifizierungen k\\\"{o}nnen sich sowohl auf Produkte und Prozesse als auch auf die Ausbildung und das Wissen von Einzelpersonen beziehen. Da Zertifikate durch unabh\\\"{a}ngige Pr\\\"{u}finstanzen ausgestellt werden, wird Zertifikaten und deren \\\"{u}berpr\\\"{u}fbaren Aussagen im Allgemeinen ein deutlich h\\\"{o}heres Vertrauen entgegengebracht als Qualit\\\"{a}tsversprechen von Software-Herstellern selbst. Unternehmen, die ihre Prozesse beispielsweise nach CMMI zertifizieren lassen, k\\\"{o}nnen damit ihre F\\\"{a}higkeiten unter Beweis stellen, Projekte erfolgreich und mit vorhersagbarer Qualit\\\"{a}t abschlie{ss}en zu k\\\"{o}nnen. Neben dem Nachweis entsprechender Zertifikate als Diversifikationsmerkmal gegen\\\"{u}ber Mitbewerbern k\\\"{o}nnen Zertifikate \\\"{u}ber die Einhaltung von Standards auch durch den Gesetzgeber vorgeschrieben werden. Ein Beispiel hierf\\\"{u}r sind Zertifikate aus Hochsicherheitsbereichen wie Atomkraftwerken. Das Seminar wurde wie eine wissenschaftliche Konferenz organisiert: Die Einreichungen wurden in einem zweistufigen Peer-Review-Verfahren begutachtet. In der ersten Stufe wurde eine Begutachtung der studentischen Arbeiten durch Kommilitonen durchgef\\\"{u}hrt, in der zweiten Stufe eine Begutachtung durch die Betreuer. In verschiedenen Sessions wurden die Artikel an zwei Konferenztagen pr\\\"{a}sentiert. Die besten Beitr\\\"{a}ge wurden durch best paper awards ausgezeichnet. Diese gingen an Fabian Brosig f\\\"{u}r seine Arbeit Cost Benefit Analysis Method (CBAM), an Jakob Blomer f\\\"{u}r die Arbeit Zertifizierung von Softwarebenchmarks und an Grischa Liebel f\\\"{u}r die Arbeit SWT - Das Standard Widget Toolkit, denen hiermit noch einmal herzlich zu dieser herausragenden Leistung gratuliert wird. Erg\\\"{a}nzend zu den Vortr\\\"{a}gen der Seminarteilnehmer wurde ein eingeladener Vortrag gehalten. Herr Dr. Dirk Feuerhelm von der 1&1 Internet AG gab dabei dankenswerterweise in seinem Vortrag mit dem Thema Softskills -- Ist das objektorientiert oder modellgetrieben? einen Einblick in die Aufgaben als Leiter der Software-Entwicklung},\nauthor = {Jakob Blomer and Fabian Brosig and Andreas Kreidler and Jens K{\"u}ttel and Achim Kuwertz and Grischa Liebel and Daniel Popovic and Michael St{\"u}bs and Alexander M. Turek and Christian Vogel and Thomas Weinstein and Thomas Wurth},\neditor = {Thomas Goldschmidt and Henning Groenda and Klaus Krogmann and Michael Kuperberg and Anne Martens and Christoph Rathfelder and Ralf Reussner and Johannes Stammel},\ninstitution = {Universit\\\"{a}t Karlsruhe, Fakult\\\"{a}t f\\\"{u}r Informatik},\nlanguage = {ger},\nlocation = {Karlsruhe},\nnumber = {4/2008},\ntitle = {{S}oftware {Z}ertifizierung},\nyear = {2008}\n}\n
\n
\nSystematische Qualitätssicherung gewinnt im Rahmen des globalenWettbewerbs auch in der Software-Entwicklungsbranche zunehmend an Bedeutung. Vor allem auf dem Weg zur Software-Industrialisierung bzw. zu einer ingenieurmässigen Software-Entwicklung ist eine durchgängige Qualitätssicherung unabdingbar. Zertifizierungen bieten hierbei die Möglichkeit, die Einhaltung bestimmter Standards und Kriterien durch unabhängige Dritte überprüfen und bescheinigen zu lassen, um die Qualität eines Produktes oder Entwicklungsprozesses zu belegen. Zertifizierungen können sich sowohl auf Produkte und Prozesse als auch auf die Ausbildung und das Wissen von Einzelpersonen beziehen. Da Zertifikate durch unabhängige Prüfinstanzen ausgestellt werden, wird Zertifikaten und deren überprüfbaren Aussagen im Allgemeinen ein deutlich höheres Vertrauen entgegengebracht als Qualitätsversprechen von Software-Herstellern selbst. Unternehmen, die ihre Prozesse beispielsweise nach CMMI zertifizieren lassen, können damit ihre Fähigkeiten unter Beweis stellen, Projekte erfolgreich und mit vorhersagbarer Qualität abschliessen zu können. Neben dem Nachweis entsprechender Zertifikate als Diversifikationsmerkmal gegenüber Mitbewerbern können Zertifikate über die Einhaltung von Standards auch durch den Gesetzgeber vorgeschrieben werden. Ein Beispiel hierfür sind Zertifikate aus Hochsicherheitsbereichen wie Atomkraftwerken. Das Seminar wurde wie eine wissenschaftliche Konferenz organisiert: Die Einreichungen wurden in einem zweistufigen Peer-Review-Verfahren begutachtet. In der ersten Stufe wurde eine Begutachtung der studentischen Arbeiten durch Kommilitonen durchgeführt, in der zweiten Stufe eine Begutachtung durch die Betreuer. In verschiedenen Sessions wurden die Artikel an zwei Konferenztagen präsentiert. Die besten Beiträge wurden durch best paper awards ausgezeichnet. Diese gingen an Fabian Brosig für seine Arbeit Cost Benefit Analysis Method (CBAM), an Jakob Blomer für die Arbeit Zertifizierung von Softwarebenchmarks und an Grischa Liebel für die Arbeit SWT - Das Standard Widget Toolkit, denen hiermit noch einmal herzlich zu dieser herausragenden Leistung gratuliert wird. Ergänzend zu den Vorträgen der Seminarteilnehmer wurde ein eingeladener Vortrag gehalten. Herr Dr. Dirk Feuerhelm von der 1&1 Internet AG gab dabei dankenswerterweise in seinem Vortrag mit dem Thema Softskills - Ist das objektorientiert oder modellgetrieben? einen Einblick in die Aufgaben als Leiter der Software-Entwicklung\n
\n','
\n@techreport{groenda2008c,\n  abstract = {Systematische Qualit\\\"{a}tssicherung gewinnt im Rahmen des globalenWettbewerbs auch in der Software-Entwicklungsbranche zunehmend an Bedeutung. Vor allem auf dem Weg zur Software-Industrialisierung bzw. zu einer ingenieurm\\\"{a}ss{}igen Software-Entwicklung ist eine durchg\\\"{a}ngige Qualit\\\"{a}tssicherung unabdingbar. Zertifizierungen bieten hierbei die M\\\"{o}glichkeit, die Einhaltung bestimmter Standards und Kriterien durch unabh\\\"{a}ngige Dritte \\\"{u}berpr\\\"{u}fen und bescheinigen zu lassen, um die Qualit\\\"{a}t eines Produktes oder Entwicklungsprozesses zu belegen. Zertifizierungen k\\\"{o}nnen sich sowohl auf Produkte und Prozesse als auch auf die Ausbildung und das Wissen von Einzelpersonen beziehen. Da Zertifikate durch unabh\\\"{a}ngige Pr\\\"{u}finstanzen ausgestellt werden, wird Zertifikaten und deren \\\"{u}berpr\\\"{u}fbaren Aussagen im Allgemeinen ein deutlich h\\\"{o}heres Vertrauen entgegengebracht als Qualit\\\"{a}tsversprechen von Software-Herstellern selbst. Unternehmen, die ihre Prozesse beispielsweise nach CMMI zertifizieren lassen, k\\\"{o}nnen damit ihre F\\\"{a}higkeiten unter Beweis stellen, Projekte erfolgreich und mit vorhersagbarer Qualit\\\"{a}t abschlie{ss}en zu k\\\"{o}nnen. Neben dem Nachweis entsprechender Zertifikate als Diversifikationsmerkmal gegen\\\"{u}ber Mitbewerbern k\\\"{o}nnen Zertifikate \\\"{u}ber die Einhaltung von Standards auch durch den Gesetzgeber vorgeschrieben werden. Ein Beispiel hierf\\\"{u}r sind Zertifikate aus Hochsicherheitsbereichen wie Atomkraftwerken. Das Seminar wurde wie eine wissenschaftliche Konferenz organisiert: Die Einreichungen wurden in einem zweistufigen Peer-Review-Verfahren begutachtet. In der ersten Stufe wurde eine Begutachtung der studentischen Arbeiten durch Kommilitonen durchgef\\\"{u}hrt, in der zweiten Stufe eine Begutachtung durch die Betreuer. In verschiedenen Sessions wurden die Artikel an zwei Konferenztagen pr\\\"{a}sentiert. Die besten Beitr\\\"{a}ge wurden durch best paper awards ausgezeichnet. Diese gingen an Fabian Brosig f\\\"{u}r seine Arbeit Cost Benefit Analysis Method (CBAM), an Jakob Blomer f\\\"{u}r die Arbeit Zertifizierung von Softwarebenchmarks und an Grischa Liebel f\\\"{u}r die Arbeit SWT - Das Standard Widget Toolkit, denen hiermit noch einmal herzlich zu dieser herausragenden Leistung gratuliert wird. Erg\\\"{a}nzend zu den Vortr\\\"{a}gen der Seminarteilnehmer wurde ein eingeladener Vortrag gehalten. Herr Dr. Dirk Feuerhelm von der 1&1 Internet AG gab dabei dankenswerterweise in seinem Vortrag mit dem Thema Softskills -- Ist das objektorientiert oder modellgetrieben? einen Einblick in die Aufgaben als Leiter der Software-Entwicklung},\n  author = {Jakob Blomer and Fabian Brosig and Andreas Kreidler and Jens K{\"u}ttel and Achim Kuwertz and Grischa Liebel and Daniel Popovic and Michael St{\"u}bs and Alexander M. Turek and Christian Vogel and Thomas Weinstein and Thomas Wurth},\n  editor = {Thomas Goldschmidt and Henning Groenda and Klaus Krogmann and Michael Kuperberg and Anne Martens and Christoph Rathfelder and Ralf Reussner and Johannes Stammel},\n  institution = {Universit\\\"{a}t Karlsruhe, Fakult\\\"{a}t f\\\"{u}r Informatik},\n  language = {ger},\n  location = {Karlsruhe},\n  number = {4/2008},\n  title = {{S}oftware {Z}ertifizierung},\n  year = {2008}\n}\n
\n\n','Systematische Qualit\\\"{a}tssicherung gewinnt im Rahmen des globalenWettbewerbs auch in der Software-Entwicklungsbranche zunehmend an Bedeutung. Vor allem auf dem Weg zur Software-Industrialisierung bzw. zu einer ingenieurm\\\"{a}ss{}igen Software-Entwicklung ist eine durchg\\\"{a}ngige Qualit\\\"{a}tssicherung unabdingbar. Zertifizierungen bieten hierbei die M\\\"{o}glichkeit, die Einhaltung bestimmter Standards und Kriterien durch unabh\\\"{a}ngige Dritte \\\"{u}berpr\\\"{u}fen und bescheinigen zu lassen, um die Qualit\\\"{a}t eines Produktes oder Entwicklungsprozesses zu belegen. Zertifizierungen k\\\"{o}nnen sich sowohl auf Produkte und Prozesse als auch auf die Ausbildung und das Wissen von Einzelpersonen beziehen. Da Zertifikate durch unabh\\\"{a}ngige Pr\\\"{u}finstanzen ausgestellt werden, wird Zertifikaten und deren \\\"{u}berpr\\\"{u}fbaren Aussagen im Allgemeinen ein deutlich h\\\"{o}heres Vertrauen entgegengebracht als Qualit\\\"{a}tsversprechen von Software-Herstellern selbst. Unternehmen, die ihre Prozesse beispielsweise nach CMMI zertifizieren lassen, k\\\"{o}nnen damit ihre F\\\"{a}higkeiten unter Beweis stellen, Projekte erfolgreich und mit vorhersagbarer Qualit\\\"{a}t abschlie{ss}en zu k\\\"{o}nnen. Neben dem Nachweis entsprechender Zertifikate als Diversifikationsmerkmal gegen\\\"{u}ber Mitbewerbern k\\\"{o}nnen Zertifikate \\\"{u}ber die Einhaltung von Standards auch durch den Gesetzgeber vorgeschrieben werden. Ein Beispiel hierf\\\"{u}r sind Zertifikate aus Hochsicherheitsbereichen wie Atomkraftwerken. Das Seminar wurde wie eine wissenschaftliche Konferenz organisiert: Die Einreichungen wurden in einem zweistufigen Peer-Review-Verfahren begutachtet. In der ersten Stufe wurde eine Begutachtung der studentischen Arbeiten durch Kommilitonen durchgef\\\"{u}hrt, in der zweiten Stufe eine Begutachtung durch die Betreuer. In verschiedenen Sessions wurden die Artikel an zwei Konferenztagen pr\\\"{a}sentiert. Die besten Beitr\\\"{a}ge wurden durch best paper awards ausgezeichnet. Diese gingen an Fabian Brosig f\\\"{u}r seine Arbeit Cost Benefit Analysis Method (CBAM), an Jakob Blomer f\\\"{u}r die Arbeit Zertifizierung von Softwarebenchmarks und an Grischa Liebel f\\\"{u}r die Arbeit SWT - Das Standard Widget Toolkit, denen hiermit noch einmal herzlich zu dieser herausragenden Leistung gratuliert wird. Erg\\\"{a}nzend zu den Vortr\\\"{a}gen der Seminarteilnehmer wurde ein eingeladener Vortrag gehalten. Herr Dr. Dirk Feuerhelm von der 1&1 Internet AG gab dabei dankenswerterweise in seinem Vortrag mit dem Thema Softskills -- Ist das objektorientiert oder modellgetrieben? einen Einblick in die Aufgaben als Leiter der Software-Entwicklung','{S}oftware {Z}ertifizierung',0,0,2008,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(76,'paper','indust2008','techreport','@techreport{indust2008,\n abstract = {Die Industrialisierung der Software-Entwicklung ist ein zurzeit sehr stark diskutiertes Thema. Es geht dabei vor allem um die Efizienzsteigerung durch die Steigerung des Standardisierungsgrades, des Automatisierungsgrades sowie eine Erh\\\"{o}hung der Arbeitsteilung. Dies wirkt sich einerseits auf die den Software- Systemen zu Grunde liegenden Architekturen aber auch auf die Entwicklungsprozesse aus. So sind service-orientierte Architekturen ein Beispiel f\\\"{u}r eine gesteigerte Standardisierung innerhalb von Software-Systemen. Es ist zu ber\\\"{u}cksichtigen, dass sich die Software-Branche von den klassischen produzierenden Industriezweigen dadurch unterscheidet, dass Software ein immaterielles Produkt ist und so ohne hohe Produktionskosten beliebig oft vervielf\\\"{a}ltigt werden kann. Trotzdem lassen sich viele Erkenntnisse aus den klassischen Industriezweigen auf die Software-Technik \\\"{u}bertragen. Die Inhalte dieses Berichts stammen haupts\\\"{a}chlich aus dem Seminar \"Software- Industrialisierung, welches sich mit der Professionalisierung der Software- Entwicklung und des Software-Entwurfs besch\\\"{a}ftigte. W\\\"{a}hrend die klassische Software-Entwicklung wenig strukturiert ist und weder im Bezug auf Reproduzierbarkeit oder Qualit\\\"{a}tssicherung erh\\\"{o}hten Anforderungen gen\\\"{u}gt, befindet sich die Software-Entwicklung im Rahmen der Industrialisierung in einem Wandel. Dazu z\\\"{a}hlen arbeitsteiliges Arbeiten, die Einf\\\"{u}hrung von Entwicklungsprozessen mit vorhersagbaren Eigenschaften (Kosten, Zeitbedarf, ...) und in der Folge die Erstellung von Produkten mit garantierbaren Eigenschaften. Das Themenspektrum des Seminars umfasste dabei unter anderem: * Software-Architekturen * Komponentenbasierte Software-Entwicklung * Modellgetriebene Entwicklung * Ber\\\"{u}cksichtigung von Qualit\\\"{a}tseigenschaften in Entwicklungsprozessen Das Seminar wurde wie eine wissenschaftliche Konferenz organisiert: Die Einreichungen wurden in einem zweistufigen Peer-Review-Verfahren begutachtet. In der ersten Stufe wurde eine Begutachtung der studentischen Arbeiten durch Kommilitonen durchgef\\\"{u}hrt, in der zweiten Stufe eine Begutachtung durch die Betreuer. In verschiedenen Sessions wurden die Artikel an zwei Konferenztagen pr\\\"{a}sentiert. Der beste Beitrag wurde durch einen Best Paper Award ausgezeichnet. Dieser ging an Benjamin Klatt f\\\"{u}r seine Arbeit Software Extension Mechanisms, dem hiermit noch einmal herzlich zu dieser herausragenden Leistung gratuliert wird. Erg\\\"{a}nzend zu den Vortr\\\"{a}gen der Seminarteilnehmer wurde ein eingeladener Vortrag gehalten. Herr Florian Kaltner und Herr Tobias Pohl vom IBM-Entwicklungslabor gaben dabei dankenswerterweise in ihrem Vortrag Einblicke in die Entwicklung von Plugins f\\\"{u}r Eclipse sowie in die Build-Umgebung der Firmware f\\\"{u}r die zSeries Mainframe-Server.},\n address = {Karlsruhe},\n author = {Brosch, Franz and Goldschmidt, Thomas and Groenda, Henning and Kapova, Lucia and Krogmann, Klaus and Kuperberg, Michael and Martens, Anne and Rathfelder, Christoph and Reussner, Ralf and Stammel, Johannes},\n edition = {ISSN 1432-7864},\n institution = {Universit{\"a}t Karlsruhe, Fakult{\"a}t f{\"u}r Informatik, Institut f{\"u}r Programmstrukturen und Datenorganisation},\n timestamp = {2009.06.29},\n title = {Software-Industrialisierung},\n type = {Interner Bericht},\n url = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000009113},\n volume = {8},\n year = {2008},\n}\n\n','\n\nFranz Brosch, Thomas Goldschmidt, Henning Groenda, Lucia Kapova, Klaus\nKrogmann, Michael Kuperberg, Anne Martens, Christoph Rathfelder, Ralf\nReussner, and Johannes Stammel.\nSoftware-industrialisierung.\nInterner bericht, Universit\"at Karlsruhe, Fakult\"at f\"ur\nInformatik, Institut f\"ur Programmstrukturen und Datenorganisation,\nKarlsruhe, 2008.\n[ bib | http | Abstract  ] 
\n@techreport{indust2008,\nabstract = {Die Industrialisierung der Software-Entwicklung ist ein zurzeit sehr stark diskutiertes Thema. Es geht dabei vor allem um die Efizienzsteigerung durch die Steigerung des Standardisierungsgrades, des Automatisierungsgrades sowie eine Erh\\\"{o}hung der Arbeitsteilung. Dies wirkt sich einerseits auf die den Software- Systemen zu Grunde liegenden Architekturen aber auch auf die Entwicklungsprozesse aus. So sind service-orientierte Architekturen ein Beispiel f\\\"{u}r eine gesteigerte Standardisierung innerhalb von Software-Systemen. Es ist zu ber\\\"{u}cksichtigen, dass sich die Software-Branche von den klassischen produzierenden Industriezweigen dadurch unterscheidet, dass Software ein immaterielles Produkt ist und so ohne hohe Produktionskosten beliebig oft vervielf\\\"{a}ltigt werden kann. Trotzdem lassen sich viele Erkenntnisse aus den klassischen Industriezweigen auf die Software-Technik \\\"{u}bertragen. Die Inhalte dieses Berichts stammen haupts\\\"{a}chlich aus dem Seminar \"Software- Industrialisierung, welches sich mit der Professionalisierung der Software- Entwicklung und des Software-Entwurfs besch\\\"{a}ftigte. W\\\"{a}hrend die klassische Software-Entwicklung wenig strukturiert ist und weder im Bezug auf Reproduzierbarkeit oder Qualit\\\"{a}tssicherung erh\\\"{o}hten Anforderungen gen\\\"{u}gt, befindet sich die Software-Entwicklung im Rahmen der Industrialisierung in einem Wandel. Dazu z\\\"{a}hlen arbeitsteiliges Arbeiten, die Einf\\\"{u}hrung von Entwicklungsprozessen mit vorhersagbaren Eigenschaften (Kosten, Zeitbedarf, ...) und in der Folge die Erstellung von Produkten mit garantierbaren Eigenschaften. Das Themenspektrum des Seminars umfasste dabei unter anderem: * Software-Architekturen * Komponentenbasierte Software-Entwicklung * Modellgetriebene Entwicklung * Ber\\\"{u}cksichtigung von Qualit\\\"{a}tseigenschaften in Entwicklungsprozessen Das Seminar wurde wie eine wissenschaftliche Konferenz organisiert: Die Einreichungen wurden in einem zweistufigen Peer-Review-Verfahren begutachtet. In der ersten Stufe wurde eine Begutachtung der studentischen Arbeiten durch Kommilitonen durchgef\\\"{u}hrt, in der zweiten Stufe eine Begutachtung durch die Betreuer. In verschiedenen Sessions wurden die Artikel an zwei Konferenztagen pr\\\"{a}sentiert. Der beste Beitrag wurde durch einen Best Paper Award ausgezeichnet. Dieser ging an Benjamin Klatt f\\\"{u}r seine Arbeit Software Extension Mechanisms, dem hiermit noch einmal herzlich zu dieser herausragenden Leistung gratuliert wird. Erg\\\"{a}nzend zu den Vortr\\\"{a}gen der Seminarteilnehmer wurde ein eingeladener Vortrag gehalten. Herr Florian Kaltner und Herr Tobias Pohl vom IBM-Entwicklungslabor gaben dabei dankenswerterweise in ihrem Vortrag Einblicke in die Entwicklung von Plugins f\\\"{u}r Eclipse sowie in die Build-Umgebung der Firmware f\\\"{u}r die zSeries Mainframe-Server.},\naddress = {Karlsruhe},\nauthor = {Brosch, Franz and Goldschmidt, Thomas and Groenda, Henning and Kapova, Lucia and Krogmann, Klaus and Kuperberg, Michael and Martens, Anne and Rathfelder, Christoph and Reussner, Ralf and Stammel, Johannes},\nedition = {ISSN 1432-7864},\ninstitution = {Universit{\"a}t Karlsruhe, Fakult{\"a}t f{\"u}r Informatik, Institut f{\"u}r Programmstrukturen und Datenorganisation},\ntimestamp = {2009.06.29},\ntitle = {Software-Industrialisierung},\ntype = {Interner Bericht},\nurl = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000009113},\nvolume = {8},\nyear = {2008}\n}\n
\n
\nDie Industrialisierung der Software-Entwicklung ist ein zurzeit sehr stark diskutiertes Thema. Es geht dabei vor allem um die Efizienzsteigerung durch die Steigerung des Standardisierungsgrades, des Automatisierungsgrades sowie eine Erhöhung der Arbeitsteilung. Dies wirkt sich einerseits auf die den Software- Systemen zu Grunde liegenden Architekturen aber auch auf die Entwicklungsprozesse aus. So sind service-orientierte Architekturen ein Beispiel für eine gesteigerte Standardisierung innerhalb von Software-Systemen. Es ist zu berücksichtigen, dass sich die Software-Branche von den klassischen produzierenden Industriezweigen dadurch unterscheidet, dass Software ein immaterielles Produkt ist und so ohne hohe Produktionskosten beliebig oft vervielfältigt werden kann. Trotzdem lassen sich viele Erkenntnisse aus den klassischen Industriezweigen auf die Software-Technik übertragen. Die Inhalte dieses Berichts stammen hauptsächlich aus dem Seminar \"Software- Industrialisierung, welches sich mit der Professionalisierung der Software- Entwicklung und des Software-Entwurfs beschäftigte. Während die klassische Software-Entwicklung wenig strukturiert ist und weder im Bezug auf Reproduzierbarkeit oder Qualitätssicherung erhöhten Anforderungen genügt, befindet sich die Software-Entwicklung im Rahmen der Industrialisierung in einem Wandel. Dazu zählen arbeitsteiliges Arbeiten, die Einführung von Entwicklungsprozessen mit vorhersagbaren Eigenschaften (Kosten, Zeitbedarf, ...) und in der Folge die Erstellung von Produkten mit garantierbaren Eigenschaften. Das Themenspektrum des Seminars umfasste dabei unter anderem: * Software-Architekturen * Komponentenbasierte Software-Entwicklung * Modellgetriebene Entwicklung * Berücksichtigung von Qualitätseigenschaften in Entwicklungsprozessen Das Seminar wurde wie eine wissenschaftliche Konferenz organisiert: Die Einreichungen wurden in einem zweistufigen Peer-Review-Verfahren begutachtet. In der ersten Stufe wurde eine Begutachtung der studentischen Arbeiten durch Kommilitonen durchgeführt, in der zweiten Stufe eine Begutachtung durch die Betreuer. In verschiedenen Sessions wurden die Artikel an zwei Konferenztagen präsentiert. Der beste Beitrag wurde durch einen Best Paper Award ausgezeichnet. Dieser ging an Benjamin Klatt für seine Arbeit Software Extension Mechanisms, dem hiermit noch einmal herzlich zu dieser herausragenden Leistung gratuliert wird. Ergänzend zu den Vorträgen der Seminarteilnehmer wurde ein eingeladener Vortrag gehalten. Herr Florian Kaltner und Herr Tobias Pohl vom IBM-Entwicklungslabor gaben dabei dankenswerterweise in ihrem Vortrag Einblicke in die Entwicklung von Plugins für Eclipse sowie in die Build-Umgebung der Firmware für die zSeries Mainframe-Server.\n
\n','
\n@techreport{indust2008,\n  abstract = {Die Industrialisierung der Software-Entwicklung ist ein zurzeit sehr stark diskutiertes Thema. Es geht dabei vor allem um die Efizienzsteigerung durch die Steigerung des Standardisierungsgrades, des Automatisierungsgrades sowie eine Erh\\\"{o}hung der Arbeitsteilung. Dies wirkt sich einerseits auf die den Software- Systemen zu Grunde liegenden Architekturen aber auch auf die Entwicklungsprozesse aus. So sind service-orientierte Architekturen ein Beispiel f\\\"{u}r eine gesteigerte Standardisierung innerhalb von Software-Systemen. Es ist zu ber\\\"{u}cksichtigen, dass sich die Software-Branche von den klassischen produzierenden Industriezweigen dadurch unterscheidet, dass Software ein immaterielles Produkt ist und so ohne hohe Produktionskosten beliebig oft vervielf\\\"{a}ltigt werden kann. Trotzdem lassen sich viele Erkenntnisse aus den klassischen Industriezweigen auf die Software-Technik \\\"{u}bertragen. Die Inhalte dieses Berichts stammen haupts\\\"{a}chlich aus dem Seminar \"Software- Industrialisierung, welches sich mit der Professionalisierung der Software- Entwicklung und des Software-Entwurfs besch\\\"{a}ftigte. W\\\"{a}hrend die klassische Software-Entwicklung wenig strukturiert ist und weder im Bezug auf Reproduzierbarkeit oder Qualit\\\"{a}tssicherung erh\\\"{o}hten Anforderungen gen\\\"{u}gt, befindet sich die Software-Entwicklung im Rahmen der Industrialisierung in einem Wandel. Dazu z\\\"{a}hlen arbeitsteiliges Arbeiten, die Einf\\\"{u}hrung von Entwicklungsprozessen mit vorhersagbaren Eigenschaften (Kosten, Zeitbedarf, ...) und in der Folge die Erstellung von Produkten mit garantierbaren Eigenschaften. Das Themenspektrum des Seminars umfasste dabei unter anderem: * Software-Architekturen * Komponentenbasierte Software-Entwicklung * Modellgetriebene Entwicklung * Ber\\\"{u}cksichtigung von Qualit\\\"{a}tseigenschaften in Entwicklungsprozessen Das Seminar wurde wie eine wissenschaftliche Konferenz organisiert: Die Einreichungen wurden in einem zweistufigen Peer-Review-Verfahren begutachtet. In der ersten Stufe wurde eine Begutachtung der studentischen Arbeiten durch Kommilitonen durchgef\\\"{u}hrt, in der zweiten Stufe eine Begutachtung durch die Betreuer. In verschiedenen Sessions wurden die Artikel an zwei Konferenztagen pr\\\"{a}sentiert. Der beste Beitrag wurde durch einen Best Paper Award ausgezeichnet. Dieser ging an Benjamin Klatt f\\\"{u}r seine Arbeit Software Extension Mechanisms, dem hiermit noch einmal herzlich zu dieser herausragenden Leistung gratuliert wird. Erg\\\"{a}nzend zu den Vortr\\\"{a}gen der Seminarteilnehmer wurde ein eingeladener Vortrag gehalten. Herr Florian Kaltner und Herr Tobias Pohl vom IBM-Entwicklungslabor gaben dabei dankenswerterweise in ihrem Vortrag Einblicke in die Entwicklung von Plugins f\\\"{u}r Eclipse sowie in die Build-Umgebung der Firmware f\\\"{u}r die zSeries Mainframe-Server.},\n  address = {Karlsruhe},\n  author = {Brosch, Franz and Goldschmidt, Thomas and Groenda, Henning and Kapova, Lucia and Krogmann, Klaus and Kuperberg, Michael and Martens, Anne and Rathfelder, Christoph and Reussner, Ralf and Stammel, Johannes},\n  edition = {ISSN 1432-7864},\n  institution = {Universit{\"a}t Karlsruhe, Fakult{\"a}t f{\"u}r Informatik, Institut f{\"u}r Programmstrukturen und Datenorganisation},\n  timestamp = {2009.06.29},\n  title = {Software-Industrialisierung},\n  type = {Interner Bericht},\n  url = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000009113},\n  volume = {8},\n  year = {2008}\n}\n
\n\n','Die Industrialisierung der Software-Entwicklung ist ein zurzeit sehr stark diskutiertes Thema. Es geht dabei vor allem um die Efizienzsteigerung durch die Steigerung des Standardisierungsgrades, des Automatisierungsgrades sowie eine Erh\"{o}hung der Arbeitsteilung. Dies wirkt sich einerseits auf die den Software- Systemen zu Grunde liegenden Architekturen aber auch auf die Entwicklungsprozesse aus. So sind service-orientierte Architekturen ein Beispiel f\"{u}r eine gesteigerte Standardisierung innerhalb von Software-Systemen. Es ist zu ber\"{u}cksichtigen, dass sich die Software-Branche von den klassischen produzierenden Industriezweigen dadurch unterscheidet, dass Software ein immaterielles Produkt ist und so ohne hohe Produktionskosten beliebig oft vervielf\"{a}ltigt werden kann. Trotzdem lassen sich viele Erkenntnisse aus den klassischen Industriezweigen auf die Software-Technik \"{u}bertragen. Die Inhalte dieses Berichts stammen haupts\"{a}chlich aus dem Seminar \"Software- Industrialisierung, welches sich mit der Professionalisierung der Software- Entwicklung und des Software-Entwurfs besch\"{a}ftigte. W\"{a}hrend die klassische Software-Entwicklung wenig strukturiert ist und weder im Bezug auf Reproduzierbarkeit oder Qualit\"{a}tssicherung erh\"{o}hten Anforderungen gen\"{u}gt, befindet sich die Software-Entwicklung im Rahmen der Industrialisierung in einem Wandel. Dazu z\"{a}hlen arbeitsteiliges Arbeiten, die Einf\"{u}hrung von Entwicklungsprozessen mit vorhersagbaren Eigenschaften (Kosten, Zeitbedarf, ...) und in der Folge die Erstellung von Produkten mit garantierbaren Eigenschaften. Das Themenspektrum des Seminars umfasste dabei unter anderem: * Software-Architekturen * Komponentenbasierte Software-Entwicklung * Modellgetriebene Entwicklung * Ber\"{u}cksichtigung von Qualit\"{a}tseigenschaften in Entwicklungsprozessen Das Seminar wurde wie eine wissenschaftliche Konferenz organisiert: Die Einreichungen wurden in einem zweistufigen Peer-Review-Verfahren begutachtet. In der ersten Stufe wurde eine Begutachtung der studentischen Arbeiten durch Kommilitonen durchgef\"{u}hrt, in der zweiten Stufe eine Begutachtung durch die Betreuer. In verschiedenen Sessions wurden die Artikel an zwei Konferenztagen pr\"{a}sentiert. Der beste Beitrag wurde durch einen Best Paper Award ausgezeichnet. Dieser ging an Benjamin Klatt f\"{u}r seine Arbeit Software Extension Mechanisms, dem hiermit noch einmal herzlich zu dieser herausragenden Leistung gratuliert wird. Erg\"{a}nzend zu den Vortr\"{a}gen der Seminarteilnehmer wurde ein eingeladener Vortrag gehalten. Herr Florian Kaltner und Herr Tobias Pohl vom IBM-Entwicklungslabor gaben dabei dankenswerterweise in ihrem Vortrag Einblicke in die Entwicklung von Plugins f\"{u}r Eclipse sowie in die Build-Umgebung der Firmware f\"{u}r die zSeries Mainframe-Server.','Software-Industrialisierung',0,0,2008,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(81,'paper','Br2011-SEDoktoranden-Symposium','inproceedings','@inproceedings{Br2011-SEDoktoranden-Symposium,\n abstract = {{Today\'s enterprise systems based on increasingly complex software architectures often exhibit poor performance and resource efficiency thus having high operating costs. This is due to the inability to predict at run-time the effect of changes in the system environment and adapt the system accordingly. We propose a new performance modeling approach that allows the prediction of performance and system resource utilization online during system operation. We use architecture-level performance models that capture the performance-relevant information of the software architecture, deployment, execution environment and workload. The models will be automatically maintained during operation. To derive performance predictions, we propose a tailorable model solving approach to provide flexibility in view of prediction accuracy and analysis overhead.}},\n address = {Bonn, Germany},\n author = {Fabian Brosig},\n bibsource = {DBLP, http://dblp.uni-trier.de},\n booktitle = {Software Engineering (Workshops) - Doctoral Symposium, February 21--25, 2011},\n editor = {Ralf Reussner and Alexander Pretschner and Stefan J{\\\"a}hnichen},\n ee = {http://subs.emis.de/LNI/Proceedings/Proceedings184/article6310.html},\n month = {February},\n pages = {279--284},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/81.pdf},\n publisher = {GI},\n series = {Lecture Notes in Informatics (LNI)},\n title = {Online Performance Prediction with Architecture-Level Performance Models},\n volume = {184},\n year = {2011},\n}\n\n','\n\nFabian Brosig.\nOnline performance prediction with architecture-level performance\nmodels.\nIn Software Engineering (Workshops) - Doctoral Symposium,\nFebruary 21-25, 2011, Ralf Reussner, Alexander Pretschner, and Stefan\nJähnichen, editors, February 2011, volume 184 of Lecture Notes in\nInformatics (LNI), pages 279-284. GI, Bonn, Germany.\nFebruary 2011.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{Br2011-SEDoktoranden-Symposium,\nabstract = {{Today\'s enterprise systems based on increasingly complex software architectures often exhibit poor performance and resource efficiency thus having high operating costs. This is due to the inability to predict at run-time the effect of changes in the system environment and adapt the system accordingly. We propose a new performance modeling approach that allows the prediction of performance and system resource utilization online during system operation. We use architecture-level performance models that capture the performance-relevant information of the software architecture, deployment, execution environment and workload. The models will be automatically maintained during operation. To derive performance predictions, we propose a tailorable model solving approach to provide flexibility in view of prediction accuracy and analysis overhead.}},\naddress = {Bonn, Germany},\nauthor = {Fabian Brosig},\nbibsource = {DBLP, http://dblp.uni-trier.de},\nbooktitle = {Software Engineering (Workshops) - Doctoral Symposium, February 21--25, 2011},\neditor = {Ralf Reussner and Alexander Pretschner and Stefan J{\\\"a}hnichen},\nee = {http://subs.emis.de/LNI/Proceedings/Proceedings184/article6310.html},\nmonth = {February},\npages = {279--284},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/81.pdf},\npublisher = {GI},\nseries = {Lecture Notes in Informatics (LNI)},\ntitle = {Online Performance Prediction with Architecture-Level Performance Models},\nvolume = {184},\nyear = {2011}\n}\n
\n
\nToday\'s enterprise systems based on increasingly complex software architectures often exhibit poor performance and resource efficiency thus having high operating costs. This is due to the inability to predict at run-time the effect of changes in the system environment and adapt the system accordingly. We propose a new performance modeling approach that allows the prediction of performance and system resource utilization online during system operation. We use architecture-level performance models that capture the performance-relevant information of the software architecture, deployment, execution environment and workload. The models will be automatically maintained during operation. To derive performance predictions, we propose a tailorable model solving approach to provide flexibility in view of prediction accuracy and analysis overhead.\n
\n','
\n@inproceedings{Br2011-SEDoktoranden-Symposium,\n  abstract = {{Today\'s enterprise systems based on increasingly complex software architectures often exhibit poor performance and resource efficiency thus having high operating costs. This is due to the inability to predict at run-time the effect of changes in the system environment and adapt the system accordingly. We propose a new performance modeling approach that allows the prediction of performance and system resource utilization online during system operation. We use architecture-level performance models that capture the performance-relevant information of the software architecture, deployment, execution environment and workload. The models will be automatically maintained during operation. To derive performance predictions, we propose a tailorable model solving approach to provide flexibility in view of prediction accuracy and analysis overhead.}},\n  address = {Bonn, Germany},\n  author = {Fabian Brosig},\n  bibsource = {DBLP, http://dblp.uni-trier.de},\n  booktitle = {Software Engineering (Workshops) - Doctoral Symposium, February 21--25, 2011},\n  editor = {Ralf Reussner and Alexander Pretschner and Stefan J{\\\"a}hnichen},\n  ee = {http://subs.emis.de/LNI/Proceedings/Proceedings184/article6310.html},\n  month = {February},\n  pages = {279--284},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/81.pdf},\n  publisher = {GI},\n  series = {Lecture Notes in Informatics (LNI)},\n  title = {Online Performance Prediction with Architecture-Level Performance Models},\n  volume = {184},\n  year = {2011}\n}\n
\n\n','{Today\'s enterprise systems based on increasingly complex software architectures often exhibit poor performance and resource efficiency thus having high operating costs. This is due to the inability to predict at run-time the effect of changes in the system environment and adapt the system accordingly. We propose a new performance modeling approach that allows the prediction of performance and system resource utilization online during system operation. We use architecture-level performance models that capture the performance-relevant information of the software architecture, deployment, execution environment and workload. The models will be automatically maintained during operation. To derive performance predictions, we propose a tailorable model solving approach to provide flexibility in view of prediction accuracy and analysis overhead.}','Online Performance Prediction with Architecture-Level Performance Models',0,2,2011,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(82,'paper','brosig2009a','mastersthesis','@mastersthesis{brosig2009a,\n address = {Karlsruhe, Germany},\n author = {Fabian Brosig},\n month = {June},\n note = {FZI Prize \"Best Diploma Thesis\"},\n school = {Universit{\\\"{a}}t Karlsruhe (TH)},\n title = {{Automated Extraction of Palladio Component Models from Running Enterprise Java Applications}},\n year = {2009},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/82.pdf},\n}\n\n','\n\nFabian Brosig.\nAutomated Extraction of Palladio Component Models from Running\nEnterprise Java Applications.\nMaster\'s thesis, Universität Karlsruhe (TH), Karlsruhe,\nGermany, June 2009.\nFZI Prize \"Best Diploma Thesis\".\n[ bib | .pdf  ] 
\n@mastersthesis{brosig2009a,\naddress = {Karlsruhe, Germany},\nauthor = {Fabian Brosig},\nmonth = {June},\nnote = {FZI Prize \"Best Diploma Thesis\"},\nschool = {Universit{\\\"{a}}t Karlsruhe (TH)},\ntitle = {{Automated Extraction of Palladio Component Models from Running Enterprise Java Applications}},\nyear = {2009},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/82.pdf}\n}\n
\n
\n','
\n@mastersthesis{brosig2009a,\n  address = {Karlsruhe, Germany},\n  author = {Fabian Brosig},\n  month = {June},\n  note = {FZI Prize \"Best Diploma Thesis\"},\n  school = {Universit{\\\"{a}}t Karlsruhe (TH)},\n  title = {{Automated Extraction of Palladio Component Models from Running Enterprise Java Applications}},\n  year = {2009},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/82.pdf}\n}\n
\n\n',NULL,'{Automated Extraction of Palladio Component Models from Running Enterprise Java Applications}',0,6,2009,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(83,'paper','BrHuKo2012-CBSE-ParamAndContextDep','inproceedings','@inproceedings{BrHuKo2012-CBSE-ParamAndContextDep,\n abstract = {Modern enterprise applications have to satisfy increasingly stringent Quality-of-Service requirements. To ensure that a system meets its performance requirements, the ability to predict its performance under different configurations and workloads is essential. Architecture-level performance models describe performance-relevant aspects of software architectures and execution environments allowing to evaluate different usage profiles as well as system deployment and configuration options. However, building performance models manually requires a lot of time and effort. In this paper, we present a novel automated method for the extraction of architecture-level performance models of distributed component-based systems, based on monitoring data collected at run-time. The method is validated in a case study with the industry-standard SPECjEnterprise2010 Enterprise Java benchmark, a representative software system executed in a realistic environment. The obtained performance predictions match the measurements on the real system within an error margin of mostly 10-20 percent.},\n author = {Fabian Brosig and Nikolaus Huber and Samuel Kounev},\n booktitle = {Proceedings of the 15th ACM SIGSOFT International Symposium on Component Based Software Engineering (CBSE 2012), June 26--28, 2012, Bertinoro, Italy},\n month = {June},\n note = {Acceptance Rate (Full Paper): 28.5\\%.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/83.pdf},\n title = {{Modeling Parameter and Context Dependencies in Online Architecture-Level Performance Models}},\n url = {http://cbse-conferences.org/2012/},\n year = {2012},\n}\n\n','\n\nFabian Brosig, Nikolaus Huber, and Samuel Kounev.\nModeling Parameter and Context Dependencies in Online\nArchitecture-Level Performance Models.\nIn Proceedings of the 15th ACM SIGSOFT International Symposium\non Component Based Software Engineering (CBSE 2012), June 26-28, 2012,\nBertinoro, Italy, June 2012.\nAcceptance Rate (Full Paper): 28.5%.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{BrHuKo2012-CBSE-ParamAndContextDep,\nabstract = {Modern enterprise applications have to satisfy increasingly stringent Quality-of-Service requirements. To ensure that a system meets its performance requirements, the ability to predict its performance under different configurations and workloads is essential. Architecture-level performance models describe performance-relevant aspects of software architectures and execution environments allowing to evaluate different usage profiles as well as system deployment and configuration options. However, building performance models manually requires a lot of time and effort. In this paper, we present a novel automated method for the extraction of architecture-level performance models of distributed component-based systems, based on monitoring data collected at run-time. The method is validated in a case study with the industry-standard SPECjEnterprise2010 Enterprise Java benchmark, a representative software system executed in a realistic environment. The obtained performance predictions match the measurements on the real system within an error margin of mostly 10-20 percent.},\nauthor = {Fabian Brosig and Nikolaus Huber and Samuel Kounev},\nbooktitle = {Proceedings of the 15th ACM SIGSOFT International Symposium on Component Based Software Engineering (CBSE 2012), June 26--28, 2012, Bertinoro, Italy},\nmonth = {June},\nnote = {Acceptance Rate (Full Paper): 28.5\\%.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/83.pdf},\ntitle = {{Modeling Parameter and Context Dependencies in Online Architecture-Level Performance Models}},\nurl = {http://cbse-conferences.org/2012/},\nyear = {2012}\n}\n
\n
\nModern enterprise applications have to satisfy increasingly stringent Quality-of-Service requirements. To ensure that a system meets its performance requirements, the ability to predict its performance under different configurations and workloads is essential. Architecture-level performance models describe performance-relevant aspects of software architectures and execution environments allowing to evaluate different usage profiles as well as system deployment and configuration options. However, building performance models manually requires a lot of time and effort. In this paper, we present a novel automated method for the extraction of architecture-level performance models of distributed component-based systems, based on monitoring data collected at run-time. The method is validated in a case study with the industry-standard SPECjEnterprise2010 Enterprise Java benchmark, a representative software system executed in a realistic environment. The obtained performance predictions match the measurements on the real system within an error margin of mostly 10-20 percent.\n
\n','
\n@inproceedings{BrHuKo2012-CBSE-ParamAndContextDep,\n  abstract = {Modern enterprise applications have to satisfy increasingly stringent Quality-of-Service requirements. To ensure that a system meets its performance requirements, the ability to predict its performance under different configurations and workloads is essential. Architecture-level performance models describe performance-relevant aspects of software architectures and execution environments allowing to evaluate different usage profiles as well as system deployment and configuration options. However, building performance models manually requires a lot of time and effort. In this paper, we present a novel automated method for the extraction of architecture-level performance models of distributed component-based systems, based on monitoring data collected at run-time. The method is validated in a case study with the industry-standard SPECjEnterprise2010 Enterprise Java benchmark, a representative software system executed in a realistic environment. The obtained performance predictions match the measurements on the real system within an error margin of mostly 10-20 percent.},\n  author = {Fabian Brosig and Nikolaus Huber and Samuel Kounev},\n  booktitle = {Proceedings of the 15th ACM SIGSOFT International Symposium on Component Based Software Engineering (CBSE 2012), June 26--28, 2012, Bertinoro, Italy},\n  month = {June},\n  note = {Acceptance Rate (Full Paper): 28.5\\%.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/83.pdf},\n  title = {{Modeling Parameter and Context Dependencies in Online Architecture-Level Performance Models}},\n  url = {http://cbse-conferences.org/2012/},\n  year = {2012}\n}\n
\n\n','Modern enterprise applications have to satisfy increasingly stringent Quality-of-Service requirements. To ensure that a system meets its performance requirements, the ability to predict its performance under different configurations and workloads is essential. Architecture-level performance models describe performance-relevant aspects of software architectures and execution environments allowing to evaluate different usage profiles as well as system deployment and configuration options. However, building performance models manually requires a lot of time and effort. In this paper, we present a novel automated method for the extraction of architecture-level performance models of distributed component-based systems, based on monitoring data collected at run-time. The method is validated in a case study with the industry-standard SPECjEnterprise2010 Enterprise Java benchmark, a representative software system executed in a realistic environment. The obtained performance predictions match the measurements on the real system within an error margin of mostly 10-20 percent.','{Modeling Parameter and Context Dependencies in Online Architecture-Level Performance Models}',0,6,2012,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(84,'paper','BrHuKo2011-ASE-AutomExtraction','inproceedings','@inproceedings{BrHuKo2011-ASE-AutomExtraction,\n abstract = {Modern service-oriented enterprise systems have increasingly complex and dynamic loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operating costs. This is due to the inability to predict at run-time the effect of dynamic changes in the system environment and adapt the system configuration accordingly. Architecture-level performance models provide a powerful tool for performance prediction, however, current approaches to modeling the execution context of software components are not suitable for use at run-time. In this paper, we analyze the typical online performance prediction scenarios and propose a novel performance meta-model for expressing and resolving parameter and context dependencies, specifically designed for use in online scenarios. We motivate and validate our approach in the context of a realistic and representative online performance prediction scenario based on the SPECjEnterprise2010 standard benchmark.},\n address = {Oread, Lawrence, Kansas},\n author = {Fabian Brosig and Nikolaus Huber and Samuel Kounev},\n booktitle = {26th IEEE/ACM International Conference On Automated Software Engineering (ASE 2011)},\n month = {November},\n note = {Acceptance Rate (Full Paper): 14.7\\% (37/252)},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/84.pdf},\n title = {{A}utomated {E}xtraction of {A}rchitecture-{L}evel {P}erformance {M}odels of {D}istributed {C}omponent-{B}ased {S}ystems},\n year = {2011},\n}\n\n','\n\nFabian Brosig, Nikolaus Huber, and Samuel Kounev.\nAutomated Extraction of Architecture-Level Performance\nModels of Distributed Component-Based Systems.\nIn 26th IEEE/ACM International Conference On Automated Software\nEngineering (ASE 2011), November 2011. Oread, Lawrence, Kansas.\nAcceptance Rate (Full Paper): 14.7% (37/252).\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{BrHuKo2011-ASE-AutomExtraction,\nabstract = {Modern service-oriented enterprise systems have increasingly complex and dynamic loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operating costs. This is due to the inability to predict at run-time the effect of dynamic changes in the system environment and adapt the system configuration accordingly. Architecture-level performance models provide a powerful tool for performance prediction, however, current approaches to modeling the execution context of software components are not suitable for use at run-time. In this paper, we analyze the typical online performance prediction scenarios and propose a novel performance meta-model for expressing and resolving parameter and context dependencies, specifically designed for use in online scenarios. We motivate and validate our approach in the context of a realistic and representative online performance prediction scenario based on the SPECjEnterprise2010 standard benchmark.},\naddress = {Oread, Lawrence, Kansas},\nauthor = {Fabian Brosig and Nikolaus Huber and Samuel Kounev},\nbooktitle = {26th IEEE/ACM International Conference On Automated Software Engineering (ASE 2011)},\nmonth = {November},\nnote = {Acceptance Rate (Full Paper): 14.7\\% (37/252)},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/84.pdf},\ntitle = {{A}utomated {E}xtraction of {A}rchitecture-{L}evel {P}erformance {M}odels of {D}istributed {C}omponent-{B}ased {S}ystems},\nyear = {2011}\n}\n
\n
\nModern service-oriented enterprise systems have increasingly complex and dynamic loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operating costs. This is due to the inability to predict at run-time the effect of dynamic changes in the system environment and adapt the system configuration accordingly. Architecture-level performance models provide a powerful tool for performance prediction, however, current approaches to modeling the execution context of software components are not suitable for use at run-time. In this paper, we analyze the typical online performance prediction scenarios and propose a novel performance meta-model for expressing and resolving parameter and context dependencies, specifically designed for use in online scenarios. We motivate and validate our approach in the context of a realistic and representative online performance prediction scenario based on the SPECjEnterprise2010 standard benchmark.\n
\n','
\n@inproceedings{BrHuKo2011-ASE-AutomExtraction,\n  abstract = {Modern service-oriented enterprise systems have increasingly complex and dynamic loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operating costs. This is due to the inability to predict at run-time the effect of dynamic changes in the system environment and adapt the system configuration accordingly. Architecture-level performance models provide a powerful tool for performance prediction, however, current approaches to modeling the execution context of software components are not suitable for use at run-time. In this paper, we analyze the typical online performance prediction scenarios and propose a novel performance meta-model for expressing and resolving parameter and context dependencies, specifically designed for use in online scenarios. We motivate and validate our approach in the context of a realistic and representative online performance prediction scenario based on the SPECjEnterprise2010 standard benchmark.},\n  address = {Oread, Lawrence, Kansas},\n  author = {Fabian Brosig and Nikolaus Huber and Samuel Kounev},\n  booktitle = {26th IEEE/ACM International Conference On Automated Software Engineering (ASE 2011)},\n  month = {November},\n  note = {Acceptance Rate (Full Paper): 14.7\\% (37/252)},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/84.pdf},\n  title = {{A}utomated {E}xtraction of {A}rchitecture-{L}evel {P}erformance {M}odels of {D}istributed {C}omponent-{B}ased {S}ystems},\n  year = {2011}\n}\n
\n\n','Modern service-oriented enterprise systems have increasingly complex and dynamic loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operating costs. This is due to the inability to predict at run-time the effect of dynamic changes in the system environment and adapt the system configuration accordingly. Architecture-level performance models provide a powerful tool for performance prediction, however, current approaches to modeling the execution context of software components are not suitable for use at run-time. In this paper, we analyze the typical online performance prediction scenarios and propose a novel performance meta-model for expressing and resolving parameter and context dependencies, specifically designed for use in online scenarios. We motivate and validate our approach in the context of a realistic and representative online performance prediction scenario based on the SPECjEnterprise2010 standard benchmark.','{A}utomated {E}xtraction of {A}rchitecture-{L}evel {P}erformance {M}odels of {D}istributed {C}omponent-{B}ased {S}ystems',0,11,2011,11,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(85,'paper','BrKoKr2009-ROSSA-Extracting_PCM_JavaEE','inproceedings','@inproceedings{BrKoKr2009-ROSSA-Extracting_PCM_JavaEE,\n abstract = {Nowadays, software systems have to fulfill increasingly stringent requirements for performance and scalability. To ensure that a system meets its performance requirements during operation, the ability to predict its performance under different configurations and workloads is essential. Most performance analysis tools currently used in industry focus on monitoring the current system state. They provide low-level monitoring data without any performance prediction capabilities. For performance prediction, performance models are normally required. However, building predictive performance models manually requires a lot of time and effort. In this paper, we present a method for automated extraction of performance models of Java EE applications, based on monitoring data collected during operation. We extract instances of the Palladio Component Model (PCM) - a performance meta-model targeted at component-based systems. We evaluate the model extraction method in the context of a case study with a real-world enterprise application. Even though the extraction requires some manual intervention, the case study demonstrates that the existing gap between low-level monitoring data and high-level performance models can be closed.},\n author = {Fabian Brosig and Samuel Kounev and Klaus Krogmann},\n booktitle = {Proceedings of the 1st International Workshop on Run-time mOdels for Self-managing Systems and Applications (ROSSA 2009). In conjunction with Fourth International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2009), Pisa, Italy, October 19, 2009.},\n month = {October},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/85.pdf},\n publisher = {ACM, New York, NY, USA},\n title = {{Automated Extraction of Palladio Component Models from Running Enterprise Java Applications}},\n year = {2009},\n}\n\n','\n\nFabian Brosig, Samuel Kounev, and Klaus Krogmann.\nAutomated Extraction of Palladio Component Models from Running\nEnterprise Java Applications.\nIn Proceedings of the 1st International Workshop on Run-time\nmOdels for Self-managing Systems and Applications (ROSSA 2009). In\nconjunction with Fourth International Conference on Performance Evaluation\nMethodologies and Tools (VALUETOOLS 2009), Pisa, Italy, October 19, 2009.,\nOctober 2009. ACM, New York, NY, USA.\nOctober 2009.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{BrKoKr2009-ROSSA-Extracting_PCM_JavaEE,\nabstract = {Nowadays, software systems have to fulfill increasingly stringent requirements for performance and scalability. To ensure that a system meets its performance requirements during operation, the ability to predict its performance under different configurations and workloads is essential. Most performance analysis tools currently used in industry focus on monitoring the current system state. They provide low-level monitoring data without any performance prediction capabilities. For performance prediction, performance models are normally required. However, building predictive performance models manually requires a lot of time and effort. In this paper, we present a method for automated extraction of performance models of Java EE applications, based on monitoring data collected during operation. We extract instances of the Palladio Component Model (PCM) - a performance meta-model targeted at component-based systems. We evaluate the model extraction method in the context of a case study with a real-world enterprise application. Even though the extraction requires some manual intervention, the case study demonstrates that the existing gap between low-level monitoring data and high-level performance models can be closed.},\nauthor = {Fabian Brosig and Samuel Kounev and Klaus Krogmann},\nbooktitle = {Proceedings of the 1st International Workshop on Run-time mOdels for Self-managing Systems and Applications (ROSSA 2009). In conjunction with Fourth International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2009), Pisa, Italy, October 19, 2009.},\nmonth = {October},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/85.pdf},\npublisher = {ACM, New York, NY, USA},\ntitle = {{Automated Extraction of Palladio Component Models from Running Enterprise Java Applications}},\nyear = {2009}\n}\n
\n
\nNowadays, software systems have to fulfill increasingly stringent requirements for performance and scalability. To ensure that a system meets its performance requirements during operation, the ability to predict its performance under different configurations and workloads is essential. Most performance analysis tools currently used in industry focus on monitoring the current system state. They provide low-level monitoring data without any performance prediction capabilities. For performance prediction, performance models are normally required. However, building predictive performance models manually requires a lot of time and effort. In this paper, we present a method for automated extraction of performance models of Java EE applications, based on monitoring data collected during operation. We extract instances of the Palladio Component Model (PCM) - a performance meta-model targeted at component-based systems. We evaluate the model extraction method in the context of a case study with a real-world enterprise application. Even though the extraction requires some manual intervention, the case study demonstrates that the existing gap between low-level monitoring data and high-level performance models can be closed.\n
\n','
\n@inproceedings{BrKoKr2009-ROSSA-Extracting_PCM_JavaEE,\n  abstract = {Nowadays, software systems have to fulfill increasingly stringent requirements for performance and scalability. To ensure that a system meets its performance requirements during operation, the ability to predict its performance under different configurations and workloads is essential. Most performance analysis tools currently used in industry focus on monitoring the current system state. They provide low-level monitoring data without any performance prediction capabilities. For performance prediction, performance models are normally required. However, building predictive performance models manually requires a lot of time and effort. In this paper, we present a method for automated extraction of performance models of Java EE applications, based on monitoring data collected during operation. We extract instances of the Palladio Component Model (PCM) - a performance meta-model targeted at component-based systems. We evaluate the model extraction method in the context of a case study with a real-world enterprise application. Even though the extraction requires some manual intervention, the case study demonstrates that the existing gap between low-level monitoring data and high-level performance models can be closed.},\n  author = {Fabian Brosig and Samuel Kounev and Klaus Krogmann},\n  booktitle = {Proceedings of the 1st International Workshop on Run-time mOdels for Self-managing Systems and Applications (ROSSA 2009). In conjunction with Fourth International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2009), Pisa, Italy, October 19, 2009.},\n  month = {October},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/85.pdf},\n  publisher = {ACM, New York, NY, USA},\n  title = {{Automated Extraction of Palladio Component Models from Running Enterprise Java Applications}},\n  year = {2009}\n}\n
\n\n','Nowadays, software systems have to fulfill increasingly stringent requirements for performance and scalability. To ensure that a system meets its performance requirements during operation, the ability to predict its performance under different configurations and workloads is essential. Most performance analysis tools currently used in industry focus on monitoring the current system state. They provide low-level monitoring data without any performance prediction capabilities. For performance prediction, performance models are normally required. However, building predictive performance models manually requires a lot of time and effort. In this paper, we present a method for automated extraction of performance models of Java EE applications, based on monitoring data collected during operation. We extract instances of the Palladio Component Model (PCM) - a performance meta-model targeted at component-based systems. We evaluate the model extraction method in the context of a case study with a real-world enterprise application. Even though the extraction requires some manual intervention, the case study demonstrates that the existing gap between low-level monitoring data and high-level performance models can be closed.','{Automated Extraction of Palladio Component Models from Running Enterprise Java Applications}',0,10,2009,10,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(86,'paper','BrKoPa2009-OTN-WLDF2PCM','misc','@misc{BrKoPa2009-OTN-WLDF2PCM,\n abstract = {Throughout the system life cycle, the ability to predict a software system\'s performance under different configurations and workloads is highly valuable to ensure that the system meets its performance requirements. During the design phase, performance prediction helps to evaluate different design alternatives. At deployment time, it facilitates system sizing and capacity planning. During operation, predicting the effect of changes in the workload or in the system configuration is beneficial for run-time performance management. The alternative to performance prediction is to deploy the system in an environment reflecting the configuration of interest and conduct experiments measuring the system performance under the respective workloads. Such experiments, however, are normally very expensive and time-consuming and therefore often considered not to be economically viable. To enable performance prediction we need an abstraction of the real system that incorporates performance-relevant data, i.e., a performance model. Based on such a model, performance analysis can be carried out. Unfortunately, building predictive performance models manually requires a lot of time and effort. The model must be designed to reflect the abstract system structure and capture its performance-relevant aspects. In addition, model parameters like resource demands or system configuration parameters have to be determined. Given the costs of building performance models, techniques for automatic extraction of models based on observation of the system at run-time are highly desirable. During system development, such models can be exploited to evaluate the performance of system prototypes. During operation, an automatically extracted performance model can be applied for efficient and performance-aware resource management. For example, if one observes an increased user workload and assumes a steady workload growth rate, performance predictions help to determine when the system would reach its saturation point. This way, system operators can react to the changing workload before the system has failed to meet its performance objectives thus avoiding a violation of service level agreements (SLAs). Current performance analysis tools used in industry mostly focus on profiling and monitoring transaction response times and resource consumption. The tools often provide large amounts of low level data while important information needed for building performance models is missing, e.g., the resource demands of individual components. In this article, we present a method for automated extraction of performance models for Java EE applications during operation. We implemented the method in a tool prototype and evaluated its effectiveness in the context of a case study with an early prototype of the SPECjEnterprise2009 benchmark application which in the following we will refer to as SPECjEnterprise2009_pre. (SPECjEnterprise2009 is the successor benchmark of the SPECjAppServer2004 benchmark developed by the Standard Performance Evaluation Corp. [SPEC]; SPECjEnterprise is a trademark of SPEC. The SPECjEnterprise2009 results or findings in this publication have not been reviewed or accepted by SPEC, therefore no comparison nor performance inference can be made against any published SPEC result.) The target Java EE platform we consider is Oracle WebLogic Server (WLS). The extraction is based on monitoring data that is collected during operation using the WebLogic Diagnostics Framework (WLDF). As a performance model, we selected the Palladio Component Model (PCM). PCM is a sophisticated performance modeling framework with mature tool support. In contrast to low level mathematical models like, e.g., queueing networks, PCM is a high-level UML-like design-oriented model that captures the performance-relevant aspects of the system architecture. This makes PCM models easy to understand and use by software developers. We begin by providing some background on the technologies we use, focusing on the WLDF monitoring framework and the PCM models. We then describe the model extraction method in more detail. Finally, we present the case study we conducted and conclude with a summary.},\n author = {Fabian Brosig and Samuel Kounev and Charles Paclat},\n howpublished = {Oracle Technology Network (OTN) Article},\n month = {September},\n title = {{Using WebLogic Diagnostics Framework to Enable Performance Prediction for Java EE Applications}},\n url = {http://www.oracle.com/technetwork/articles/brosig-wldf-086367.html},\n year = {2009},\n}\n\n','\n\nFabian Brosig, Samuel Kounev, and Charles Paclat.\nUsing WebLogic Diagnostics Framework to Enable Performance\nPrediction for Java EE Applications.\nOracle Technology Network (OTN) Article, September 2009.\n[ bib | .html | Abstract  ] 
\n@misc{BrKoPa2009-OTN-WLDF2PCM,\nabstract = {Throughout the system life cycle, the ability to predict a software system\'s performance under different configurations and workloads is highly valuable to ensure that the system meets its performance requirements. During the design phase, performance prediction helps to evaluate different design alternatives. At deployment time, it facilitates system sizing and capacity planning. During operation, predicting the effect of changes in the workload or in the system configuration is beneficial for run-time performance management. The alternative to performance prediction is to deploy the system in an environment reflecting the configuration of interest and conduct experiments measuring the system performance under the respective workloads. Such experiments, however, are normally very expensive and time-consuming and therefore often considered not to be economically viable. To enable performance prediction we need an abstraction of the real system that incorporates performance-relevant data, i.e., a performance model. Based on such a model, performance analysis can be carried out. Unfortunately, building predictive performance models manually requires a lot of time and effort. The model must be designed to reflect the abstract system structure and capture its performance-relevant aspects. In addition, model parameters like resource demands or system configuration parameters have to be determined. Given the costs of building performance models, techniques for automatic extraction of models based on observation of the system at run-time are highly desirable. During system development, such models can be exploited to evaluate the performance of system prototypes. During operation, an automatically extracted performance model can be applied for efficient and performance-aware resource management. For example, if one observes an increased user workload and assumes a steady workload growth rate, performance predictions help to determine when the system would reach its saturation point. This way, system operators can react to the changing workload before the system has failed to meet its performance objectives thus avoiding a violation of service level agreements (SLAs). Current performance analysis tools used in industry mostly focus on profiling and monitoring transaction response times and resource consumption. The tools often provide large amounts of low level data while important information needed for building performance models is missing, e.g., the resource demands of individual components. In this article, we present a method for automated extraction of performance models for Java EE applications during operation. We implemented the method in a tool prototype and evaluated its effectiveness in the context of a case study with an early prototype of the SPECjEnterprise2009 benchmark application which in the following we will refer to as SPECjEnterprise2009_pre. (SPECjEnterprise2009 is the successor benchmark of the SPECjAppServer2004 benchmark developed by the Standard Performance Evaluation Corp. [SPEC]; SPECjEnterprise is a trademark of SPEC. The SPECjEnterprise2009 results or findings in this publication have not been reviewed or accepted by SPEC, therefore no comparison nor performance inference can be made against any published SPEC result.) The target Java EE platform we consider is Oracle WebLogic Server (WLS). The extraction is based on monitoring data that is collected during operation using the WebLogic Diagnostics Framework (WLDF). As a performance model, we selected the Palladio Component Model (PCM). PCM is a sophisticated performance modeling framework with mature tool support. In contrast to low level mathematical models like, e.g., queueing networks, PCM is a high-level UML-like design-oriented model that captures the performance-relevant aspects of the system architecture. This makes PCM models easy to understand and use by software developers. We begin by providing some background on the technologies we use, focusing on the WLDF monitoring framework and the PCM models. We then describe the model extraction method in more detail. Finally, we present the case study we conducted and conclude with a summary.},\nauthor = {Fabian Brosig and Samuel Kounev and Charles Paclat},\nhowpublished = {Oracle Technology Network (OTN) Article},\nmonth = {September},\ntitle = {{Using WebLogic Diagnostics Framework to Enable Performance Prediction for Java EE Applications}},\nurl = {http://www.oracle.com/technetwork/articles/brosig-wldf-086367.html},\nyear = {2009}\n}\n
\n
\nThroughout the system life cycle, the ability to predict a software system\'s performance under different configurations and workloads is highly valuable to ensure that the system meets its performance requirements. During the design phase, performance prediction helps to evaluate different design alternatives. At deployment time, it facilitates system sizing and capacity planning. During operation, predicting the effect of changes in the workload or in the system configuration is beneficial for run-time performance management. The alternative to performance prediction is to deploy the system in an environment reflecting the configuration of interest and conduct experiments measuring the system performance under the respective workloads. Such experiments, however, are normally very expensive and time-consuming and therefore often considered not to be economically viable. To enable performance prediction we need an abstraction of the real system that incorporates performance-relevant data, i.e., a performance model. Based on such a model, performance analysis can be carried out. Unfortunately, building predictive performance models manually requires a lot of time and effort. The model must be designed to reflect the abstract system structure and capture its performance-relevant aspects. In addition, model parameters like resource demands or system configuration parameters have to be determined. Given the costs of building performance models, techniques for automatic extraction of models based on observation of the system at run-time are highly desirable. During system development, such models can be exploited to evaluate the performance of system prototypes. During operation, an automatically extracted performance model can be applied for efficient and performance-aware resource management. For example, if one observes an increased user workload and assumes a steady workload growth rate, performance predictions help to determine when the system would reach its saturation point. This way, system operators can react to the changing workload before the system has failed to meet its performance objectives thus avoiding a violation of service level agreements (SLAs). Current performance analysis tools used in industry mostly focus on profiling and monitoring transaction response times and resource consumption. The tools often provide large amounts of low level data while important information needed for building performance models is missing, e.g., the resource demands of individual components. In this article, we present a method for automated extraction of performance models for Java EE applications during operation. We implemented the method in a tool prototype and evaluated its effectiveness in the context of a case study with an early prototype of the SPECjEnterprise2009 benchmark application which in the following we will refer to as SPECjEnterprise2009_pre. (SPECjEnterprise2009 is the successor benchmark of the SPECjAppServer2004 benchmark developed by the Standard Performance Evaluation Corp. [SPEC]; SPECjEnterprise is a trademark of SPEC. The SPECjEnterprise2009 results or findings in this publication have not been reviewed or accepted by SPEC, therefore no comparison nor performance inference can be made against any published SPEC result.) The target Java EE platform we consider is Oracle WebLogic Server (WLS). The extraction is based on monitoring data that is collected during operation using the WebLogic Diagnostics Framework (WLDF). As a performance model, we selected the Palladio Component Model (PCM). PCM is a sophisticated performance modeling framework with mature tool support. In contrast to low level mathematical models like, e.g., queueing networks, PCM is a high-level UML-like design-oriented model that captures the performance-relevant aspects of the system architecture. This makes PCM models easy to understand and use by software developers. We begin by providing some background on the technologies we use, focusing on the WLDF monitoring framework and the PCM models. We then describe the model extraction method in more detail. Finally, we present the case study we conducted and conclude with a summary.\n
\n','
\n@misc{BrKoPa2009-OTN-WLDF2PCM,\n  abstract = {Throughout the system life cycle, the ability to predict a software system\'s performance under different configurations and workloads is highly valuable to ensure that the system meets its performance requirements. During the design phase, performance prediction helps to evaluate different design alternatives. At deployment time, it facilitates system sizing and capacity planning. During operation, predicting the effect of changes in the workload or in the system configuration is beneficial for run-time performance management. The alternative to performance prediction is to deploy the system in an environment reflecting the configuration of interest and conduct experiments measuring the system performance under the respective workloads. Such experiments, however, are normally very expensive and time-consuming and therefore often considered not to be economically viable. To enable performance prediction we need an abstraction of the real system that incorporates performance-relevant data, i.e., a performance model. Based on such a model, performance analysis can be carried out. Unfortunately, building predictive performance models manually requires a lot of time and effort. The model must be designed to reflect the abstract system structure and capture its performance-relevant aspects. In addition, model parameters like resource demands or system configuration parameters have to be determined. Given the costs of building performance models, techniques for automatic extraction of models based on observation of the system at run-time are highly desirable. During system development, such models can be exploited to evaluate the performance of system prototypes. During operation, an automatically extracted performance model can be applied for efficient and performance-aware resource management. For example, if one observes an increased user workload and assumes a steady workload growth rate, performance predictions help to determine when the system would reach its saturation point. This way, system operators can react to the changing workload before the system has failed to meet its performance objectives thus avoiding a violation of service level agreements (SLAs). Current performance analysis tools used in industry mostly focus on profiling and monitoring transaction response times and resource consumption. The tools often provide large amounts of low level data while important information needed for building performance models is missing, e.g., the resource demands of individual components. In this article, we present a method for automated extraction of performance models for Java EE applications during operation. We implemented the method in a tool prototype and evaluated its effectiveness in the context of a case study with an early prototype of the SPECjEnterprise2009 benchmark application which in the following we will refer to as SPECjEnterprise2009_pre. (SPECjEnterprise2009 is the successor benchmark of the SPECjAppServer2004 benchmark developed by the Standard Performance Evaluation Corp. [SPEC]; SPECjEnterprise is a trademark of SPEC. The SPECjEnterprise2009 results or findings in this publication have not been reviewed or accepted by SPEC, therefore no comparison nor performance inference can be made against any published SPEC result.) The target Java EE platform we consider is Oracle WebLogic Server (WLS). The extraction is based on monitoring data that is collected during operation using the WebLogic Diagnostics Framework (WLDF). As a performance model, we selected the Palladio Component Model (PCM). PCM is a sophisticated performance modeling framework with mature tool support. In contrast to low level mathematical models like, e.g., queueing networks, PCM is a high-level UML-like design-oriented model that captures the performance-relevant aspects of the system architecture. This makes PCM models easy to understand and use by software developers. We begin by providing some background on the technologies we use, focusing on the WLDF monitoring framework and the PCM models. We then describe the model extraction method in more detail. Finally, we present the case study we conducted and conclude with a summary.},\n  author = {Fabian Brosig and Samuel Kounev and Charles Paclat},\n  howpublished = {Oracle Technology Network (OTN) Article},\n  month = {September},\n  title = {{Using WebLogic Diagnostics Framework to Enable Performance Prediction for Java EE Applications}},\n  url = {http://www.oracle.com/technetwork/articles/brosig-wldf-086367.html},\n  year = {2009}\n}\n
\n\n','Throughout the system life cycle, the ability to predict a software system\'s performance under different configurations and workloads is highly valuable to ensure that the system meets its performance requirements. During the design phase, performance prediction helps to evaluate different design alternatives. At deployment time, it facilitates system sizing and capacity planning. During operation, predicting the effect of changes in the workload or in the system configuration is beneficial for run-time performance management. The alternative to performance prediction is to deploy the system in an environment reflecting the configuration of interest and conduct experiments measuring the system performance under the respective workloads. Such experiments, however, are normally very expensive and time-consuming and therefore often considered not to be economically viable. To enable performance prediction we need an abstraction of the real system that incorporates performance-relevant data, i.e., a performance model. Based on such a model, performance analysis can be carried out. Unfortunately, building predictive performance models manually requires a lot of time and effort. The model must be designed to reflect the abstract system structure and capture its performance-relevant aspects. In addition, model parameters like resource demands or system configuration parameters have to be determined. Given the costs of building performance models, techniques for automatic extraction of models based on observation of the system at run-time are highly desirable. During system development, such models can be exploited to evaluate the performance of system prototypes. During operation, an automatically extracted performance model can be applied for efficient and performance-aware resource management. For example, if one observes an increased user workload and assumes a steady workload growth rate, performance predictions help to determine when the system would reach its saturation point. This way, system operators can react to the changing workload before the system has failed to meet its performance objectives thus avoiding a violation of service level agreements (SLAs). Current performance analysis tools used in industry mostly focus on profiling and monitoring transaction response times and resource consumption. The tools often provide large amounts of low level data while important information needed for building performance models is missing, e.g., the resource demands of individual components. In this article, we present a method for automated extraction of performance models for Java EE applications during operation. We implemented the method in a tool prototype and evaluated its effectiveness in the context of a case study with an early prototype of the SPECjEnterprise2009 benchmark application which in the following we will refer to as SPECjEnterprise2009_pre. (SPECjEnterprise2009 is the successor benchmark of the SPECjAppServer2004 benchmark developed by the Standard Performance Evaluation Corp. [SPEC]; SPECjEnterprise is a trademark of SPEC. The SPECjEnterprise2009 results or findings in this publication have not been reviewed or accepted by SPEC, therefore no comparison nor performance inference can be made against any published SPEC result.) The target Java EE platform we consider is Oracle WebLogic Server (WLS). The extraction is based on monitoring data that is collected during operation using the WebLogic Diagnostics Framework (WLDF). As a performance model, we selected the Palladio Component Model (PCM). PCM is a sophisticated performance modeling framework with mature tool support. In contrast to low level mathematical models like, e.g., queueing networks, PCM is a high-level UML-like design-oriented model that captures the performance-relevant aspects of the system architecture. This makes PCM models easy to understand and use by software developers. We begin by providing some background on the technologies we use, focusing on the WLDF monitoring framework and the PCM models. We then describe the model extraction method in more detail. Finally, we present the case study we conducted and conclude with a summary.','{Using WebLogic Diagnostics Framework to Enable Performance Prediction for Java EE Applications}',0,9,2009,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(101,'paper','comuzzi2009','inproceedings','@inproceedings{comuzzi2009,\n abstract = {Service-Oriented Architectures (SOA) represent an architectural shift for building business applications based on loosely-coupled services. In a multi-layered SOA environment the exact conditions under which services are to be delivered can be formally specified by Service Level Agreements (SLAs). However, typical SLAs are just specified at the customer-level and do not allow service providers to manage their IT stack accordingly as they have no insight on how customer-level SLAs translate to metrics or parameters at the various layers of the IT stack. In this paper we present a technical architecture for a multi-level SLA management framework. We discuss the fundamental components and in- terfaces in this architecture and explain the developed integrated framework. Furthermore, we show results from a qualitative evaluation of the framework in the context of an open reference case.},\n address = {Berlin, Heidelberg},\n author = {Comuzzi, Marco and Kotsokalis, Constantinos and Rathfelder, Christoph and Theilmann, Wolfgang and Winkler, Ulrich and Zacco, Gabriele},\n booktitle = {Service-Oriented Computing. ICSOC/ServiceWave 2009 Workshops},\n day = {23--27},\n doi = {10.1007/978-3-642-16132-2_18},\n editor = {Dan, Asit and Gittler, Fr{\\\'e}d{\\\'e}ric and Toumani, Farouk},\n isbn = {978-3-642-16131-5},\n keyword = {Computer Science},\n location = {Stockholm, Sweden},\n month = {November},\n pages = {187--196},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/101.pdf},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n title = {A Framework for Multi-level SLA Management},\n url = {http://dx.doi.org/10.1007/978-3-642-16132-2_18},\n volume = {6275},\n year = {2010},\n}\n\n','\n\nMarco Comuzzi, Constantinos Kotsokalis, Christoph Rathfelder, Wolfgang\nTheilmann, Ulrich Winkler, and Gabriele Zacco.\nA framework for multi-level sla management.\nIn Service-Oriented Computing. ICSOC/ServiceWave 2009\nWorkshops, Asit Dan, Frédéric Gittler, and Farouk Toumani, editors,\nStockholm, Sweden, November 23-27, 2010, volume 6275 of Lecture Notes\nin Computer Science, pages 187-196. Springer, Berlin, Heidelberg.\nNovember 2010.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{comuzzi2009,\nabstract = {Service-Oriented Architectures (SOA) represent an architectural shift for building business applications based on loosely-coupled services. In a multi-layered SOA environment the exact conditions under which services are to be delivered can be formally specified by Service Level Agreements (SLAs). However, typical SLAs are just specified at the customer-level and do not allow service providers to manage their IT stack accordingly as they have no insight on how customer-level SLAs translate to metrics or parameters at the various layers of the IT stack. In this paper we present a technical architecture for a multi-level SLA management framework. We discuss the fundamental components and in- terfaces in this architecture and explain the developed integrated framework. Furthermore, we show results from a qualitative evaluation of the framework in the context of an open reference case.},\naddress = {Berlin, Heidelberg},\nauthor = {Comuzzi, Marco and Kotsokalis, Constantinos and Rathfelder, Christoph and Theilmann, Wolfgang and Winkler, Ulrich and Zacco, Gabriele},\nbooktitle = {Service-Oriented Computing. ICSOC/ServiceWave 2009 Workshops},\nday = {23--27},\ndoi = {10.1007/978-3-642-16132-2_18},\neditor = {Dan, Asit and Gittler, Fr{\\\'e}d{\\\'e}ric and Toumani, Farouk},\nisbn = {978-3-642-16131-5},\nkeyword = {Computer Science},\nlocation = {Stockholm, Sweden},\nmonth = {November},\npages = {187--196},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/101.pdf},\npublisher = {Springer},\nseries = {Lecture Notes in Computer Science},\ntitle = {A Framework for Multi-level SLA Management},\nurl = {http://dx.doi.org/10.1007/978-3-642-16132-2_18},\nvolume = {6275},\nyear = {2010}\n}\n
\n
\nService-Oriented Architectures (SOA) represent an architectural shift for building business applications based on loosely-coupled services. In a multi-layered SOA environment the exact conditions under which services are to be delivered can be formally specified by Service Level Agreements (SLAs). However, typical SLAs are just specified at the customer-level and do not allow service providers to manage their IT stack accordingly as they have no insight on how customer-level SLAs translate to metrics or parameters at the various layers of the IT stack. In this paper we present a technical architecture for a multi-level SLA management framework. We discuss the fundamental components and in- terfaces in this architecture and explain the developed integrated framework. Furthermore, we show results from a qualitative evaluation of the framework in the context of an open reference case.\n
\n','
\n@inproceedings{comuzzi2009,\n  abstract = {Service-Oriented Architectures (SOA) represent an architectural shift for building business applications based on loosely-coupled services. In a multi-layered SOA environment the exact conditions under which services are to be delivered can be formally specified by Service Level Agreements (SLAs). However, typical SLAs are just specified at the customer-level and do not allow service providers to manage their IT stack accordingly as they have no insight on how customer-level SLAs translate to metrics or parameters at the various layers of the IT stack. In this paper we present a technical architecture for a multi-level SLA management framework. We discuss the fundamental components and in- terfaces in this architecture and explain the developed integrated framework. Furthermore, we show results from a qualitative evaluation of the framework in the context of an open reference case.},\n  address = {Berlin, Heidelberg},\n  author = {Comuzzi, Marco and Kotsokalis, Constantinos and Rathfelder, Christoph and Theilmann, Wolfgang and Winkler, Ulrich and Zacco, Gabriele},\n  booktitle = {Service-Oriented Computing. ICSOC/ServiceWave 2009 Workshops},\n  day = {23--27},\n  doi = {10.1007/978-3-642-16132-2_18},\n  editor = {Dan, Asit and Gittler, Fr{\\\'e}d{\\\'e}ric and Toumani, Farouk},\n  isbn = {978-3-642-16131-5},\n  keyword = {Computer Science},\n  location = {Stockholm, Sweden},\n  month = {November},\n  pages = {187--196},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/101.pdf},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  title = {A Framework for Multi-level SLA Management},\n  url = {http://dx.doi.org/10.1007/978-3-642-16132-2_18},\n  volume = {6275},\n  year = {2010}\n}\n
\n\n','Service-Oriented Architectures (SOA) represent an architectural shift for building business applications based on loosely-coupled services. In a multi-layered SOA environment the exact conditions under which services are to be delivered can be formally specified by Service Level Agreements (SLAs). However, typical SLAs are just specified at the customer-level and do not allow service providers to manage their IT stack accordingly as they have no insight on how customer-level SLAs translate to metrics or parameters at the various layers of the IT stack. In this paper we present a technical architecture for a multi-level SLA management framework. We discuss the fundamental components and in- terfaces in this architecture and explain the developed integrated framework. Furthermore, we show results from a qualitative evaluation of the framework in the context of an open reference case.','A Framework for Multi-level SLA Management',0,11,2010,11,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(103,'paper','Westermann2011b','inproceedings','@inproceedings{Westermann2011b,\n author = {Dennis Westermann and Rouven Krebs and Jens Happe},\n booktitle = {Proceedings of the Computer Performance Engineering - 8th European Performance Engineering Workshop (EPEW 2011)},\n day = {12--13},\n location = {Borrowdale, UK},\n month = {October},\n pages = {325-339},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/103.pdf},\n publisher = {Springer},\n title = {{E}fficient {E}xperiment {S}election in {A}utomated {S}oftware {P}erformance {E}valuations},\n year = {2011},\n}\n\n','\n\nDennis Westermann, Rouven Krebs, and Jens Happe.\nEfficient Experiment Selection in Automated Software\nPerformance Evaluations.\nIn Proceedings of the Computer Performance Engineering - 8th\nEuropean Performance Engineering Workshop (EPEW 2011), Borrowdale, UK,\nOctober 12-13, 2011, pages 325-339. Springer.\nOctober 2011.\n[ bib | .pdf  ] 
\n@inproceedings{Westermann2011b,\nauthor = {Dennis Westermann and Rouven Krebs and Jens Happe},\nbooktitle = {Proceedings of the Computer Performance Engineering - 8th European Performance Engineering Workshop (EPEW 2011)},\nday = {12--13},\nlocation = {Borrowdale, UK},\nmonth = {October},\npages = {325-339},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/103.pdf},\npublisher = {Springer},\ntitle = {{E}fficient {E}xperiment {S}election in {A}utomated {S}oftware {P}erformance {E}valuations},\nyear = {2011}\n}\n
\n
\n','
\n@inproceedings{Westermann2011b,\n  author = {Dennis Westermann and Rouven Krebs and Jens Happe},\n  booktitle = {Proceedings of the Computer Performance Engineering - 8th European Performance Engineering Workshop (EPEW 2011)},\n  day = {12--13},\n  location = {Borrowdale, UK},\n  month = {October},\n  pages = {325-339},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/103.pdf},\n  publisher = {Springer},\n  title = {{E}fficient {E}xperiment {S}election in {A}utomated {S}oftware {P}erformance {E}valuations},\n  year = {2011}\n}\n
\n\n',NULL,'{E}fficient {E}xperiment {S}election in {A}utomated {S}oftware {P}erformance {E}valuations',0,10,2011,10,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(125,'paper','Fa2011-KIT-SPAusingML','mastersthesis','@mastersthesis{Fa2011-KIT-SPAusingML,\n address = {Karlsruhe, Germany},\n author = {Michael Faber},\n month = {March},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Software Performance Analysis using Machine Learning Techniques}},\n year = {2011},\n}\n\n','\n\nMichael Faber.\nSoftware Performance Analysis using Machine Learning Techniques.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, March 2011.\n[ bib  ] 
\n@mastersthesis{Fa2011-KIT-SPAusingML,\naddress = {Karlsruhe, Germany},\nauthor = {Michael Faber},\nmonth = {March},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Software Performance Analysis using Machine Learning Techniques}},\nyear = {2011}\n}\n
\n
\n','
\n@mastersthesis{Fa2011-KIT-SPAusingML,\n  address = {Karlsruhe, Germany},\n  author = {Michael Faber},\n  month = {March},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Software Performance Analysis using Machine Learning Techniques}},\n  year = {2011}\n}\n
\n\n',NULL,'{Software Performance Analysis using Machine Learning Techniques}',0,3,2011,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(126,'paper','FaHa2012-ICPE','inproceedings','@inproceedings{FaHa2012-ICPE,\n address = {New York, NY, USA},\n author = {Michael Faber and Jens Happe},\n booktitle = {Proceedings of 3rd ACM/SPEC Internatioanl Conference on Performance Engineering (ICPE 2012)},\n day = {22--25},\n isbn = {978-1-4503-1202-8},\n location = {Boston, USA},\n month = {April},\n pages = {33--44},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/126.pdf},\n publisher = {ACM},\n title = {Systematic adoption of genetic programming for deriving software performance curves},\n url = {http://doi.acm.org/10.1145/2188286.2188295},\n year = {2012},\n}\n\n','\n\nMichael Faber and Jens Happe.\nSystematic adoption of genetic programming for deriving software\nperformance curves.\nIn Proceedings of 3rd ACM/SPEC Internatioanl Conference on\nPerformance Engineering (ICPE 2012), Boston, USA, April 22-25, 2012, pages\n33-44. ACM, New York, NY, USA.\nApril 2012.\n[ bib | http | .pdf  ] 
\n@inproceedings{FaHa2012-ICPE,\naddress = {New York, NY, USA},\nauthor = {Michael Faber and Jens Happe},\nbooktitle = {Proceedings of 3rd ACM/SPEC Internatioanl Conference on Performance Engineering (ICPE 2012)},\nday = {22--25},\nisbn = {978-1-4503-1202-8},\nlocation = {Boston, USA},\nmonth = {April},\npages = {33--44},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/126.pdf},\npublisher = {ACM},\ntitle = {Systematic adoption of genetic programming for deriving software performance curves},\nurl = {http://doi.acm.org/10.1145/2188286.2188295},\nyear = {2012}\n}\n
\n
\n','
\n@inproceedings{FaHa2012-ICPE,\n  address = {New York, NY, USA},\n  author = {Michael Faber and Jens Happe},\n  booktitle = {Proceedings of 3rd ACM/SPEC Internatioanl Conference on Performance Engineering (ICPE 2012)},\n  day = {22--25},\n  isbn = {978-1-4503-1202-8},\n  location = {Boston, USA},\n  month = {April},\n  pages = {33--44},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/126.pdf},\n  publisher = {ACM},\n  title = {Systematic adoption of genetic programming for deriving software performance curves},\n  url = {http://doi.acm.org/10.1145/2188286.2188295},\n  year = {2012}\n}\n
\n\n',NULL,'Systematic adoption of genetic programming for deriving software performance curves',0,4,2012,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(133,'paper','FuBrFa2012-VALUETOOLS-TruthfulResourceReservation','inproceedings','@inproceedings{FuBrFa2012-VALUETOOLS-TruthfulResourceReservation,\n abstract = {{Prudent capacity planning to meet their clients future computational needs is one of the major issues cloud computing providers face today. By offering resource reservations in advance, providers gain insight into the projected demand of their customers and can act accordingly. However, customers need to be given an incentive, e.g. discounts granted, to commit early to a provider and to honestly, i.e., truthfully reserve their predicted future resource requirements. Customers may reserve capacity deviating from their truly predicted demand, in order to exploit the mechanism for their own benefit, thereby causing futile costs for the provider. In this paper we prove, using a game theoretic approach, that truthful reservation is the best, i.e., dominant strategy for customers if they are capable to make precise forecasts of their demands and that deviations from truth-telling can be profitable for customers if their demand forecasts are uncertain.}},\n author = {Funke, Daniel and Brosig, Fabian and Faber, Michael},\n booktitle = {{Proceedings of the 6th International ICST Conference on Performance Evaluation Methodologies and Tools (ValueTools 2012), Carg{`e}se, France}},\n month = {October},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/133.pdf},\n title = {{Towards Truthful Resource Reservation in Cloud Computing}},\n year = {2012},\n}\n\n','\n\nDaniel Funke, Fabian Brosig, and Michael Faber.\nTowards Truthful Resource Reservation in Cloud Computing.\nIn Proceedings of the 6th International ICST Conference on\nPerformance Evaluation Methodologies and Tools (ValueTools 2012), Carg`ese,\nFrance, October 2012.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{FuBrFa2012-VALUETOOLS-TruthfulResourceReservation,\nabstract = {{Prudent capacity planning to meet their clients future computational needs is one of the major issues cloud computing providers face today. By offering resource reservations in advance, providers gain insight into the projected demand of their customers and can act accordingly. However, customers need to be given an incentive, e.g. discounts granted, to commit early to a provider and to honestly, i.e., truthfully reserve their predicted future resource requirements. Customers may reserve capacity deviating from their truly predicted demand, in order to exploit the mechanism for their own benefit, thereby causing futile costs for the provider. In this paper we prove, using a game theoretic approach, that truthful reservation is the best, i.e., dominant strategy for customers if they are capable to make precise forecasts of their demands and that deviations from truth-telling can be profitable for customers if their demand forecasts are uncertain.}},\nauthor = {Funke, Daniel and Brosig, Fabian and Faber, Michael},\nbooktitle = {{Proceedings of the 6th International ICST Conference on Performance Evaluation Methodologies and Tools (ValueTools 2012), Carg{`e}se, France}},\nmonth = {October},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/133.pdf},\ntitle = {{Towards Truthful Resource Reservation in Cloud Computing}},\nyear = {2012}\n}\n
\n
\nPrudent capacity planning to meet their clients future computational needs is one of the major issues cloud computing providers face today. By offering resource reservations in advance, providers gain insight into the projected demand of their customers and can act accordingly. However, customers need to be given an incentive, e.g. discounts granted, to commit early to a provider and to honestly, i.e., truthfully reserve their predicted future resource requirements. Customers may reserve capacity deviating from their truly predicted demand, in order to exploit the mechanism for their own benefit, thereby causing futile costs for the provider. In this paper we prove, using a game theoretic approach, that truthful reservation is the best, i.e., dominant strategy for customers if they are capable to make precise forecasts of their demands and that deviations from truth-telling can be profitable for customers if their demand forecasts are uncertain.\n
\n','
\n@inproceedings{FuBrFa2012-VALUETOOLS-TruthfulResourceReservation,\n  abstract = {{Prudent capacity planning to meet their clients future computational needs is one of the major issues cloud computing providers face today. By offering resource reservations in advance, providers gain insight into the projected demand of their customers and can act accordingly. However, customers need to be given an incentive, e.g. discounts granted, to commit early to a provider and to honestly, i.e., truthfully reserve their predicted future resource requirements. Customers may reserve capacity deviating from their truly predicted demand, in order to exploit the mechanism for their own benefit, thereby causing futile costs for the provider. In this paper we prove, using a game theoretic approach, that truthful reservation is the best, i.e., dominant strategy for customers if they are capable to make precise forecasts of their demands and that deviations from truth-telling can be profitable for customers if their demand forecasts are uncertain.}},\n  author = {Funke, Daniel and Brosig, Fabian and Faber, Michael},\n  booktitle = {{Proceedings of the 6th International ICST Conference on Performance Evaluation Methodologies and Tools (ValueTools 2012), Carg{`e}se, France}},\n  month = {October},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/133.pdf},\n  title = {{Towards Truthful Resource Reservation in Cloud Computing}},\n  year = {2012}\n}\n
\n\n','{Prudent capacity planning to meet their clients future computational needs is one of the major issues cloud computing providers face today. By offering resource reservations in advance, providers gain insight into the projected demand of their customers and can act accordingly. However, customers need to be given an incentive, e.g. discounts granted, to commit early to a provider and to honestly, i.e., truthfully reserve their predicted future resource requirements. Customers may reserve capacity deviating from their truly predicted demand, in order to exploit the mechanism for their own benefit, thereby causing futile costs for the provider. In this paper we prove, using a game theoretic approach, that truthful reservation is the best, i.e., dominant strategy for customers if they are capable to make precise forecasts of their demands and that deviations from truth-telling can be profitable for customers if their demand forecasts are uncertain.}','{Towards Truthful Resource Reservation in Cloud Computing}',0,10,2012,10,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(137,'paper','GiBrNoKoJu2012-ResBook-OnlinePrediction','incollection','@incollection{GiBrNoKoJu2012-ResBook-OnlinePrediction,\n abstract = {{Current computing systems are becoming increasingly complex in nature and exhibit large variations in workloads. These changing environments create challenges to the design of systems that can adapt themselves while maintaining desired Quality of Service (QoS), security, dependability, availability and other non-functional requirements. The next generation of resilient systems will be highly distributed, component-based and service-oriented. They will need to operate in unattended mode and possibly in hostile environments, will be composed of a large number of interchangeable components discoverable at run-time, and will have to run on a multitude of unknown and heterogeneous hardware and network platforms. These computer systems will adapt themselves to cope with changes in the operating conditions and to meet the service-level agreements with a minimum of resources. Changes in operating conditions include hardware and software failures, load variation and variations in user interaction with the system, including security attacks and overwhelming situations. This self adaptation of next resilient systems can be achieved by first online predicting how these situations would be by observation of the current environment. This chapter focuses on the use of online predicting methods, techniques and tools for resilient systems. Thus, we survey online QoS adaptive models in several environments as grid environments, service-oriented architectures and ambient intelligence using different approaches based on queueing networks, model checking, ontology engineering among others.}},\n address = {Berlin, Heidelberg},\n author = {Katja Gilly and Fabian Brosig and Ramon Nou and Samuel Kounev and Carlos Juiz},\n booktitle = {Resilience Assessment and Evaluation of Computing Systems},\n editor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\n isbn = {978-3-642-29031-2},\n note = {ISBN: 978-3-642-29031-2},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/137.pdf},\n publisher = {Springer-Verlag},\n series = {XVIII},\n title = {Online prediction: Four case studies},\n url = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\n year = {2012},\n}\n\n','\n\nKatja Gilly, Fabian Brosig, Ramon Nou, Samuel Kounev, and Carlos Juiz.\nOnline prediction: Four case studies.\nIn Resilience Assessment and Evaluation of Computing Systems,\nK. Wolter, A. Avritzer, M. Vieira, and A. van Moorsel, editors, XVIII.\nSpringer-Verlag, Berlin, Heidelberg, 2012.\nISBN: 978-3-642-29031-2.\n[ bib | http | .pdf | Abstract  ] 
\n@incollection{GiBrNoKoJu2012-ResBook-OnlinePrediction,\nabstract = {{Current computing systems are becoming increasingly complex in nature and exhibit large variations in workloads. These changing environments create challenges to the design of systems that can adapt themselves while maintaining desired Quality of Service (QoS), security, dependability, availability and other non-functional requirements. The next generation of resilient systems will be highly distributed, component-based and service-oriented. They will need to operate in unattended mode and possibly in hostile environments, will be composed of a large number of interchangeable components discoverable at run-time, and will have to run on a multitude of unknown and heterogeneous hardware and network platforms. These computer systems will adapt themselves to cope with changes in the operating conditions and to meet the service-level agreements with a minimum of resources. Changes in operating conditions include hardware and software failures, load variation and variations in user interaction with the system, including security attacks and overwhelming situations. This self adaptation of next resilient systems can be achieved by first online predicting how these situations would be by observation of the current environment. This chapter focuses on the use of online predicting methods, techniques and tools for resilient systems. Thus, we survey online QoS adaptive models in several environments as grid environments, service-oriented architectures and ambient intelligence using different approaches based on queueing networks, model checking, ontology engineering among others.}},\naddress = {Berlin, Heidelberg},\nauthor = {Katja Gilly and Fabian Brosig and Ramon Nou and Samuel Kounev and Carlos Juiz},\nbooktitle = {Resilience Assessment and Evaluation of Computing Systems},\neditor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\nisbn = {978-3-642-29031-2},\nnote = {ISBN: 978-3-642-29031-2},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/137.pdf},\npublisher = {Springer-Verlag},\nseries = {XVIII},\ntitle = {Online prediction: Four case studies},\nurl = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\nyear = {2012}\n}\n
\n
\nCurrent computing systems are becoming increasingly complex in nature and exhibit large variations in workloads. These changing environments create challenges to the design of systems that can adapt themselves while maintaining desired Quality of Service (QoS), security, dependability, availability and other non-functional requirements. The next generation of resilient systems will be highly distributed, component-based and service-oriented. They will need to operate in unattended mode and possibly in hostile environments, will be composed of a large number of interchangeable components discoverable at run-time, and will have to run on a multitude of unknown and heterogeneous hardware and network platforms. These computer systems will adapt themselves to cope with changes in the operating conditions and to meet the service-level agreements with a minimum of resources. Changes in operating conditions include hardware and software failures, load variation and variations in user interaction with the system, including security attacks and overwhelming situations. This self adaptation of next resilient systems can be achieved by first online predicting how these situations would be by observation of the current environment. This chapter focuses on the use of online predicting methods, techniques and tools for resilient systems. Thus, we survey online QoS adaptive models in several environments as grid environments, service-oriented architectures and ambient intelligence using different approaches based on queueing networks, model checking, ontology engineering among others.\n
\n','
\n@incollection{GiBrNoKoJu2012-ResBook-OnlinePrediction,\n  abstract = {{Current computing systems are becoming increasingly complex in nature and exhibit large variations in workloads. These changing environments create challenges to the design of systems that can adapt themselves while maintaining desired Quality of Service (QoS), security, dependability, availability and other non-functional requirements. The next generation of resilient systems will be highly distributed, component-based and service-oriented. They will need to operate in unattended mode and possibly in hostile environments, will be composed of a large number of interchangeable components discoverable at run-time, and will have to run on a multitude of unknown and heterogeneous hardware and network platforms. These computer systems will adapt themselves to cope with changes in the operating conditions and to meet the service-level agreements with a minimum of resources. Changes in operating conditions include hardware and software failures, load variation and variations in user interaction with the system, including security attacks and overwhelming situations. This self adaptation of next resilient systems can be achieved by first online predicting how these situations would be by observation of the current environment. This chapter focuses on the use of online predicting methods, techniques and tools for resilient systems. Thus, we survey online QoS adaptive models in several environments as grid environments, service-oriented architectures and ambient intelligence using different approaches based on queueing networks, model checking, ontology engineering among others.}},\n  address = {Berlin, Heidelberg},\n  author = {Katja Gilly and Fabian Brosig and Ramon Nou and Samuel Kounev and Carlos Juiz},\n  booktitle = {Resilience Assessment and Evaluation of Computing Systems},\n  editor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\n  isbn = {978-3-642-29031-2},\n  note = {ISBN: 978-3-642-29031-2},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/137.pdf},\n  publisher = {Springer-Verlag},\n  series = {XVIII},\n  title = {Online prediction: Four case studies},\n  url = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\n  year = {2012}\n}\n
\n\n','{Current computing systems are becoming increasingly complex in nature and exhibit large variations in workloads. These changing environments create challenges to the design of systems that can adapt themselves while maintaining desired Quality of Service (QoS), security, dependability, availability and other non-functional requirements. The next generation of resilient systems will be highly distributed, component-based and service-oriented. They will need to operate in unattended mode and possibly in hostile environments, will be composed of a large number of interchangeable components discoverable at run-time, and will have to run on a multitude of unknown and heterogeneous hardware and network platforms. These computer systems will adapt themselves to cope with changes in the operating conditions and to meet the service-level agreements with a minimum of resources. Changes in operating conditions include hardware and software failures, load variation and variations in user interaction with the system, including security attacks and overwhelming situations. This self adaptation of next resilient systems can be achieved by first online predicting how these situations would be by observation of the current environment. This chapter focuses on the use of online predicting methods, techniques and tools for resilient systems. Thus, we survey online QoS adaptive models in several environments as grid environments, service-oriented architectures and ambient intelligence using different approaches based on queueing networks, model checking, ontology engineering among others.}','Online prediction: Four case studies',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(163,'paper','groenda2009','article','@article{groenda2009,\n author = {Henning Groenda and Christoph Rathfelder and Ralph Mueller},\n journal = {Eclipse Magazine},\n month = {March},\n pages = {8--10},\n timestamp = {2009-04-02},\n title = {{Best of Eclipse DemoCamps - Ein Erfahrungsbericht vom dritten Karlsruher Eclipse DemoCamp}},\n volume = {3},\n year = {2009},\n}\n\n','\n\nHenning Groenda, Christoph Rathfelder, and Ralph Mueller.\nBest of Eclipse DemoCamps - Ein Erfahrungsbericht vom dritten\nKarlsruher Eclipse DemoCamp.\nEclipse Magazine, 3:8-10, March 2009.\n[ bib  ] 
\n@article{groenda2009,\nauthor = {Henning Groenda and Christoph Rathfelder and Ralph Mueller},\njournal = {Eclipse Magazine},\nmonth = {March},\npages = {8--10},\ntimestamp = {2009-04-02},\ntitle = {{Best of Eclipse DemoCamps - Ein Erfahrungsbericht vom dritten Karlsruher Eclipse DemoCamp}},\nvolume = {3},\nyear = {2009}\n}\n
\n
\n','
\n@article{groenda2009,\n  author = {Henning Groenda and Christoph Rathfelder and Ralph Mueller},\n  journal = {Eclipse Magazine},\n  month = {March},\n  pages = {8--10},\n  timestamp = {2009-04-02},\n  title = {{Best of Eclipse DemoCamps - Ein Erfahrungsbericht vom dritten Karlsruher Eclipse DemoCamp}},\n  volume = {3},\n  year = {2009}\n}\n
\n\n',NULL,'{Best of Eclipse DemoCamps - Ein Erfahrungsbericht vom dritten Karlsruher Eclipse DemoCamp}',0,3,2009,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(171,'paper','happe2009a','article','@article{happe2009a,\n abstract = {Performance prediction methods can help software architects to identify potential performance problems, such as bottlenecks, in their software systems during the design phase. In such early stages of the software life-cycle, only a little information is available about the system?s implementation and execution environment. However, these details are crucial for accurate performance predictions. Performance completions close the gap between available high-level models and required low-level details. Using model-driven technologies, transformations can include details of the implementation and execution environment into abstract performance models. However, existing approaches do not consider the relation of actual implementations and performance models used for prediction. Furthermore, they neglect the broad variety of possible implementations and middleware platforms, possible configurations, and possible usage scenarios. In this paper, we (i) establish a formal relation between generated performance models and generated code, (ii) introduce a design and application process for parametric performance completions, and (iii) develop a parametric performance completion for Message-oriented Middleware according to our method. Parametric performance completions are independent of a specific platform, reflect performance-relevant software configurations, and capture the influence of different usage scenarios. To evaluate the prediction accuracy of the completion for Message-oriented Middleware, we conducted a real-world case study with the SPECjms2007 Benchmark [http://www.spec.org/jms2007/]. The observed deviation of measurements and predictions was below 10% to 15%},\n author = {Jens Happe and Steffen Becker and Christoph Rathfelder and Holger Friedrich and Ralf H. Reussner},\n doi = {10.1016/j.peva.2009.07.006},\n journal = {Performance Evaluation (PE)},\n month = {August},\n number = {8},\n pages = {694--716},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/171.pdf},\n publisher = {Elsevier},\n title = {{P}arametric {P}erformance {C}ompletions for {M}odel-{D}riven {P}erformance {P}rediction},\n url = {http://dx.doi.org/10.1016/j.peva.2009.07.006},\n volume = {67},\n year = {2010},\n}\n\n','\n\nJens Happe, Steffen Becker, Christoph Rathfelder, Holger Friedrich, and Ralf H.\nReussner.\nParametric Performance Completions for Model-Driven\nPerformance Prediction.\nPerformance Evaluation (PE), 67(8):694-716, August 2010,\nElsevier.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@article{happe2009a,\nabstract = {Performance prediction methods can help software architects to identify potential performance problems, such as bottlenecks, in their software systems during the design phase. In such early stages of the software life-cycle, only a little information is available about the system?s implementation and execution environment. However, these details are crucial for accurate performance predictions. Performance completions close the gap between available high-level models and required low-level details. Using model-driven technologies, transformations can include details of the implementation and execution environment into abstract performance models. However, existing approaches do not consider the relation of actual implementations and performance models used for prediction. Furthermore, they neglect the broad variety of possible implementations and middleware platforms, possible configurations, and possible usage scenarios. In this paper, we (i) establish a formal relation between generated performance models and generated code, (ii) introduce a design and application process for parametric performance completions, and (iii) develop a parametric performance completion for Message-oriented Middleware according to our method. Parametric performance completions are independent of a specific platform, reflect performance-relevant software configurations, and capture the influence of different usage scenarios. To evaluate the prediction accuracy of the completion for Message-oriented Middleware, we conducted a real-world case study with the SPECjms2007 Benchmark [http://www.spec.org/jms2007/]. The observed deviation of measurements and predictions was below 10% to 15%},\nauthor = {Jens Happe and Steffen Becker and Christoph Rathfelder and Holger Friedrich and Ralf H. Reussner},\ndoi = {10.1016/j.peva.2009.07.006},\njournal = {Performance Evaluation (PE)},\nmonth = {August},\nnumber = {8},\npages = {694--716},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/171.pdf},\npublisher = {Elsevier},\ntitle = {{P}arametric {P}erformance {C}ompletions for {M}odel-{D}riven {P}erformance {P}rediction},\nurl = {http://dx.doi.org/10.1016/j.peva.2009.07.006},\nvolume = {67},\nyear = {2010}\n}\n
\n
\nPerformance prediction methods can help software architects to identify potential performance problems, such as bottlenecks, in their software systems during the design phase. In such early stages of the software life-cycle, only a little information is available about the system?s implementation and execution environment. However, these details are crucial for accurate performance predictions. Performance completions close the gap between available high-level models and required low-level details. Using model-driven technologies, transformations can include details of the implementation and execution environment into abstract performance models. However, existing approaches do not consider the relation of actual implementations and performance models used for prediction. Furthermore, they neglect the broad variety of possible implementations and middleware platforms, possible configurations, and possible usage scenarios. In this paper, we (i) establish a formal relation between generated performance models and generated code, (ii) introduce a design and application process for parametric performance completions, and (iii) develop a parametric performance completion for Message-oriented Middleware according to our method. Parametric performance completions are independent of a specific platform, reflect performance-relevant software configurations, and capture the influence of different usage scenarios. To evaluate the prediction accuracy of the completion for Message-oriented Middleware, we conducted a real-world case study with the SPECjms2007 Benchmark [http://www.spec.org/jms2007/]. The observed deviation of measurements and predictions was below 10% to 15%\n
\n','
\n@article{happe2009a,\n  abstract = {Performance prediction methods can help software architects to identify potential performance problems, such as bottlenecks, in their software systems during the design phase. In such early stages of the software life-cycle, only a little information is available about the system?s implementation and execution environment. However, these details are crucial for accurate performance predictions. Performance completions close the gap between available high-level models and required low-level details. Using model-driven technologies, transformations can include details of the implementation and execution environment into abstract performance models. However, existing approaches do not consider the relation of actual implementations and performance models used for prediction. Furthermore, they neglect the broad variety of possible implementations and middleware platforms, possible configurations, and possible usage scenarios. In this paper, we (i) establish a formal relation between generated performance models and generated code, (ii) introduce a design and application process for parametric performance completions, and (iii) develop a parametric performance completion for Message-oriented Middleware according to our method. Parametric performance completions are independent of a specific platform, reflect performance-relevant software configurations, and capture the influence of different usage scenarios. To evaluate the prediction accuracy of the completion for Message-oriented Middleware, we conducted a real-world case study with the SPECjms2007 Benchmark [http://www.spec.org/jms2007/]. The observed deviation of measurements and predictions was below 10% to 15%},\n  author = {Jens Happe and Steffen Becker and Christoph Rathfelder and Holger Friedrich and Ralf H. Reussner},\n  doi = {10.1016/j.peva.2009.07.006},\n  journal = {Performance Evaluation (PE)},\n  month = {August},\n  number = {8},\n  pages = {694--716},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/171.pdf},\n  publisher = {Elsevier},\n  title = {{P}arametric {P}erformance {C}ompletions for {M}odel-{D}riven {P}erformance {P}rediction},\n  url = {http://dx.doi.org/10.1016/j.peva.2009.07.006},\n  volume = {67},\n  year = {2010}\n}\n
\n\n','Performance prediction methods can help software architects to identify potential performance problems, such as bottlenecks, in their software systems during the design phase. In such early stages of the software life-cycle, only a little information is available about the system?s implementation and execution environment. However, these details are crucial for accurate performance predictions. Performance completions close the gap between available high-level models and required low-level details. Using model-driven technologies, transformations can include details of the implementation and execution environment into abstract performance models. However, existing approaches do not consider the relation of actual implementations and performance models used for prediction. Furthermore, they neglect the broad variety of possible implementations and middleware platforms, possible configurations, and possible usage scenarios. In this paper, we (i) establish a formal relation between generated performance models and generated code, (ii) introduce a design and application process for parametric performance completions, and (iii) develop a parametric performance completion for Message-oriented Middleware according to our method. Parametric performance completions are independent of a specific platform, reflect performance-relevant software configurations, and capture the influence of different usage scenarios. To evaluate the prediction accuracy of the completion for Message-oriented Middleware, we conducted a real-world case study with the SPECjms2007 Benchmark [http://www.spec.org/jms2007/]. The observed deviation of measurements and predictions was below 10% to 15%','{P}arametric {P}erformance {C}ompletions for {M}odel-{D}riven {P}erformance {P}rediction',0,8,2010,8,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(179,'paper','happe2010a','inproceedings','@inproceedings{happe2010a,\n abstract = {Software performance engineering (SPE) enables software architects to ensure high performance standards for their applications. However, applying SPE in practice is still challenging. Most enterprise applications include a large software basis, such as middleware and legacy systems. In many cases, the software basis is the determining factor of the system\'s overall timing behavior, throughput, and resource utilization. To capture these influences on the overall system\'s performance, established performance prediction methods (modelbased and analytical) rely on models that describe the performance-relevant aspects of the system under study. Creating such models requires detailed knowledge on the system\'s structure and behavior that, in most cases, is not available. In this paper, we abstract from the internal structure of the system under study. We focus our efforts on message-oriented middleware and analyze the dependency between the MOM\'s usage and its performance. We use statistical inference to conclude these dependencies from observations. For ActiveMQ 5.3, the resulting functions predict the performance with an relative mean square error 0.1.},\n author = {Jens Happe and Dennis Westermann and Kai Sachs and Lucia Kapova},\n booktitle = {{Research into Practice - Reality and Gaps (Proceedings of QoSA 2010)}},\n editor = {George Heineman and Jan Kofron and Frantisek Plasil},\n pages = {20--35},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/179.pdf},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science (LNCS)},\n title = {{Statistical Inference of Software Performance Models for Parametric Performance Completions}},\n volume = {6093},\n year = {2010},\n}\n\n','\n\nJens Happe, Dennis Westermann, Kai Sachs, and Lucia Kapova.\nStatistical Inference of Software Performance Models for Parametric\nPerformance Completions.\nIn Research into Practice - Reality and Gaps (Proceedings of\nQoSA 2010), George Heineman, Jan Kofron, and Frantisek Plasil, editors,\n2010, volume 6093 of Lecture Notes in Computer Science (LNCS), pages\n20-35. Springer.\n2010.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{happe2010a,\nabstract = {Software performance engineering (SPE) enables software architects to ensure high performance standards for their applications. However, applying SPE in practice is still challenging. Most enterprise applications include a large software basis, such as middleware and legacy systems. In many cases, the software basis is the determining factor of the system\'s overall timing behavior, throughput, and resource utilization. To capture these influences on the overall system\'s performance, established performance prediction methods (modelbased and analytical) rely on models that describe the performance-relevant aspects of the system under study. Creating such models requires detailed knowledge on the system\'s structure and behavior that, in most cases, is not available. In this paper, we abstract from the internal structure of the system under study. We focus our efforts on message-oriented middleware and analyze the dependency between the MOM\'s usage and its performance. We use statistical inference to conclude these dependencies from observations. For ActiveMQ 5.3, the resulting functions predict the performance with an relative mean square error 0.1.},\nauthor = {Jens Happe and Dennis Westermann and Kai Sachs and Lucia Kapova},\nbooktitle = {{Research into Practice - Reality and Gaps (Proceedings of QoSA 2010)}},\neditor = {George Heineman and Jan Kofron and Frantisek Plasil},\npages = {20--35},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/179.pdf},\npublisher = {Springer},\nseries = {Lecture Notes in Computer Science (LNCS)},\ntitle = {{Statistical Inference of Software Performance Models for Parametric Performance Completions}},\nvolume = {6093},\nyear = {2010}\n}\n
\n
\nSoftware performance engineering (SPE) enables software architects to ensure high performance standards for their applications. However, applying SPE in practice is still challenging. Most enterprise applications include a large software basis, such as middleware and legacy systems. In many cases, the software basis is the determining factor of the system\'s overall timing behavior, throughput, and resource utilization. To capture these influences on the overall system\'s performance, established performance prediction methods (modelbased and analytical) rely on models that describe the performance-relevant aspects of the system under study. Creating such models requires detailed knowledge on the system\'s structure and behavior that, in most cases, is not available. In this paper, we abstract from the internal structure of the system under study. We focus our efforts on message-oriented middleware and analyze the dependency between the MOM\'s usage and its performance. We use statistical inference to conclude these dependencies from observations. For ActiveMQ 5.3, the resulting functions predict the performance with an relative mean square error 0.1.\n
\n','
\n@inproceedings{happe2010a,\n  abstract = {Software performance engineering (SPE) enables software architects to ensure high performance standards for their applications. However, applying SPE in practice is still challenging. Most enterprise applications include a large software basis, such as middleware and legacy systems. In many cases, the software basis is the determining factor of the system\'s overall timing behavior, throughput, and resource utilization. To capture these influences on the overall system\'s performance, established performance prediction methods (modelbased and analytical) rely on models that describe the performance-relevant aspects of the system under study. Creating such models requires detailed knowledge on the system\'s structure and behavior that, in most cases, is not available. In this paper, we abstract from the internal structure of the system under study. We focus our efforts on message-oriented middleware and analyze the dependency between the MOM\'s usage and its performance. We use statistical inference to conclude these dependencies from observations. For ActiveMQ 5.3, the resulting functions predict the performance with an relative mean square error 0.1.},\n  author = {Jens Happe and Dennis Westermann and Kai Sachs and Lucia Kapova},\n  booktitle = {{Research into Practice - Reality and Gaps (Proceedings of QoSA 2010)}},\n  editor = {George Heineman and Jan Kofron and Frantisek Plasil},\n  pages = {20--35},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/179.pdf},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science (LNCS)},\n  title = {{Statistical Inference of Software Performance Models for Parametric Performance Completions}},\n  volume = {6093},\n  year = {2010}\n}\n
\n\n','Software performance engineering (SPE) enables software architects to ensure high performance standards for their applications. However, applying SPE in practice is still challenging. Most enterprise applications include a large software basis, such as middleware and legacy systems. In many cases, the software basis is the determining factor of the system\'s overall timing behavior, throughput, and resource utilization. To capture these influences on the overall system\'s performance, established performance prediction methods (modelbased and analytical) rely on models that describe the performance-relevant aspects of the system under study. Creating such models requires detailed knowledge on the system\'s structure and behavior that, in most cases, is not available. In this paper, we abstract from the internal structure of the system under study. We focus our efforts on message-oriented middleware and analyze the dependency between the MOM\'s usage and its performance. We use statistical inference to conclude these dependencies from observations. For ActiveMQ 5.3, the resulting functions predict the performance with an relative mean square error 0.1.','{Statistical Inference of Software Performance Models for Parametric Performance Completions}',0,0,2010,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:55',0),(186,'paper','hauck2010b','techreport','@techreport{hauck2010b,\n author = {Michael Hauck and Matthias Huber and Markus Klems and Samuel Kounev and J{\\\"o}rn M{\\\"u}ller-Quade and Alexander Pretschner and Ralf Reussner and Stefan Tai},\n institution = {Karlsruhe Institue of Technology, Faculty of Informatics},\n number = {2010-19},\n title = {{Challenges and Opportunities of Cloud Computing -- Trade-off Decisions in Cloud Computing Architecture}},\n url = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000020328},\n year = {2010},\n}\n\n','\n\nMichael Hauck, Matthias Huber, Markus Klems, Samuel Kounev, Jörn\nMüller-Quade, Alexander Pretschner, Ralf Reussner, and Stefan Tai.\nChallenges and Opportunities of Cloud Computing - Trade-off\nDecisions in Cloud Computing Architecture.\nTechnical Report 2010-19, Karlsruhe Institue of Technology, Faculty\nof Informatics, 2010.\n[ bib | http  ] 
\n@techreport{hauck2010b,\nauthor = {Michael Hauck and Matthias Huber and Markus Klems and Samuel Kounev and J{\\\"o}rn M{\\\"u}ller-Quade and Alexander Pretschner and Ralf Reussner and Stefan Tai},\ninstitution = {Karlsruhe Institue of Technology, Faculty of Informatics},\nnumber = {2010-19},\ntitle = {{Challenges and Opportunities of Cloud Computing -- Trade-off Decisions in Cloud Computing Architecture}},\nurl = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000020328},\nyear = {2010}\n}\n
\n
\n','
\n@techreport{hauck2010b,\n  author = {Michael Hauck and Matthias Huber and Markus Klems and Samuel Kounev and J{\\\"o}rn M{\\\"u}ller-Quade and Alexander Pretschner and Ralf Reussner and Stefan Tai},\n  institution = {Karlsruhe Institue of Technology, Faculty of Informatics},\n  number = {2010-19},\n  title = {{Challenges and Opportunities of Cloud Computing -- Trade-off Decisions in Cloud Computing Architecture}},\n  url = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000020328},\n  year = {2010}\n}\n
\n\n',NULL,'{Challenges and Opportunities of Cloud Computing -- Trade-off Decisions in Cloud Computing Architecture}',0,0,2010,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(187,'paper','hauck2013a','article','@article{hauck2013a,\n abstract = {To predict the performance of an application, it is crucial to consider the performance of the underlying infrastructure. Thus, to yield accurate prediction results, performance-relevant properties and behaviour of the infrastructure have to be integrated into performance models. However, capturing these properties is a cumbersome and error-prone task, as it requires carefully engineered measurements and experiments. Existing approaches for creating infrastructure performance models require manual coding of these experiments, or ignore the detailed properties in the models. The contribution of this paper is the Ginpex approach, which introduces goal-oriented and model-based specification and generation of executable performance experiments for automatically detecting and quantifying performance-relevant infrastructure properties. Ginpex provides a metamodel for experiment specification and comes with predefined experiment templates that provide automated experiment execution on the target platform and also automate the evaluation of the experiment results. We evaluate Ginpex using three case studies, where experiments are executed to quantify various infrastructure properties.},\n author = {Michael Hauck and Michael Kuperberg and Nikolaus Huber and Ralf Reussner},\n doi = {10.1007/s10270-013-0335-7},\n issn = {1619-1366},\n journal = {Software & Systems Modeling},\n pages = {1-21},\n publisher = {Springer-Verlag},\n title = {Deriving performance-relevant infrastructure properties through model-based experiments with Ginpex},\n url = {http://dx.doi.org/10.1007/s10270-013-0335-7},\n year = {2013},\n}\n\n','\n\nMichael Hauck, Michael Kuperberg, Nikolaus Huber, and Ralf Reussner.\nDeriving performance-relevant infrastructure properties through\nmodel-based experiments with ginpex.\nSoftware & Systems Modeling, pages 1-21, 2013,\nSpringer-Verlag.\n[ bib | DOI | http | Abstract  ] 
\n@article{hauck2013a,\nabstract = {To predict the performance of an application, it is crucial to consider the performance of the underlying infrastructure. Thus, to yield accurate prediction results, performance-relevant properties and behaviour of the infrastructure have to be integrated into performance models. However, capturing these properties is a cumbersome and error-prone task, as it requires carefully engineered measurements and experiments. Existing approaches for creating infrastructure performance models require manual coding of these experiments, or ignore the detailed properties in the models. The contribution of this paper is the Ginpex approach, which introduces goal-oriented and model-based specification and generation of executable performance experiments for automatically detecting and quantifying performance-relevant infrastructure properties. Ginpex provides a metamodel for experiment specification and comes with predefined experiment templates that provide automated experiment execution on the target platform and also automate the evaluation of the experiment results. We evaluate Ginpex using three case studies, where experiments are executed to quantify various infrastructure properties.},\nauthor = {Michael Hauck and Michael Kuperberg and Nikolaus Huber and Ralf Reussner},\ndoi = {10.1007/s10270-013-0335-7},\nissn = {1619-1366},\njournal = {Software & Systems Modeling},\npages = {1-21},\npublisher = {Springer-Verlag},\ntitle = {Deriving performance-relevant infrastructure properties through model-based experiments with Ginpex},\nurl = {http://dx.doi.org/10.1007/s10270-013-0335-7},\nyear = {2013}\n}\n
\n
\nTo predict the performance of an application, it is crucial to consider the performance of the underlying infrastructure. Thus, to yield accurate prediction results, performance-relevant properties and behaviour of the infrastructure have to be integrated into performance models. However, capturing these properties is a cumbersome and error-prone task, as it requires carefully engineered measurements and experiments. Existing approaches for creating infrastructure performance models require manual coding of these experiments, or ignore the detailed properties in the models. The contribution of this paper is the Ginpex approach, which introduces goal-oriented and model-based specification and generation of executable performance experiments for automatically detecting and quantifying performance-relevant infrastructure properties. Ginpex provides a metamodel for experiment specification and comes with predefined experiment templates that provide automated experiment execution on the target platform and also automate the evaluation of the experiment results. We evaluate Ginpex using three case studies, where experiments are executed to quantify various infrastructure properties.\n
\n','
\n@article{hauck2013a,\n  abstract = {To predict the performance of an application, it is crucial to consider the performance of the underlying infrastructure. Thus, to yield accurate prediction results, performance-relevant properties and behaviour of the infrastructure have to be integrated into performance models. However, capturing these properties is a cumbersome and error-prone task, as it requires carefully engineered measurements and experiments. Existing approaches for creating infrastructure performance models require manual coding of these experiments, or ignore the detailed properties in the models. The contribution of this paper is the Ginpex approach, which introduces goal-oriented and model-based specification and generation of executable performance experiments for automatically detecting and quantifying performance-relevant infrastructure properties. Ginpex provides a metamodel for experiment specification and comes with predefined experiment templates that provide automated experiment execution on the target platform and also automate the evaluation of the experiment results. We evaluate Ginpex using three case studies, where experiments are executed to quantify various infrastructure properties.},\n  author = {Michael Hauck and Michael Kuperberg and Nikolaus Huber and Ralf Reussner},\n  doi = {10.1007/s10270-013-0335-7},\n  issn = {1619-1366},\n  journal = {Software & Systems Modeling},\n  pages = {1-21},\n  publisher = {Springer-Verlag},\n  title = {Deriving performance-relevant infrastructure properties through model-based experiments with Ginpex},\n  url = {http://dx.doi.org/10.1007/s10270-013-0335-7},\n  year = {2013}\n}\n
\n\n','To predict the performance of an application, it is crucial to consider the performance of the underlying infrastructure. Thus, to yield accurate prediction results, performance-relevant properties and behaviour of the infrastructure have to be integrated into performance models. However, capturing these properties is a cumbersome and error-prone task, as it requires carefully engineered measurements and experiments. Existing approaches for creating infrastructure performance models require manual coding of these experiments, or ignore the detailed properties in the models. The contribution of this paper is the Ginpex approach, which introduces goal-oriented and model-based specification and generation of executable performance experiments for automatically detecting and quantifying performance-relevant infrastructure properties. Ginpex provides a metamodel for experiment specification and comes with predefined experiment templates that provide automated experiment execution on the target platform and also automate the evaluation of the experiment results. We evaluate Ginpex using three case studies, where experiments are executed to quantify various infrastructure properties.','Deriving performance-relevant infrastructure properties through model-based experiments with Ginpex',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(188,'paper','hauck2011b','inproceedings','@inproceedings{hauck2011b,\n address = {New York, NY, USA},\n author = {Michael Hauck and Michael Kuperberg and Nikolaus Huber and Ralf Reussner},\n booktitle = {Proceedings of the 7th ACM SIGSOFT International Conference on the Quality of Software Architectures (QoSA 2011)},\n day = {20--24},\n doi = {http://doi.acm.org/10.1145/2000259.2000269},\n isbn = {978-1-4503-0724-6},\n month = {June},\n numpages = {10},\n pages = {53--62},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/188.pdf},\n publisher = {ACM},\n title = {{Ginpex: Deriving Performance-relevant Infrastructure Properties Through Goal-oriented Experiments}},\n year = {2011},\n}\n\n','\n\nMichael Hauck, Michael Kuperberg, Nikolaus Huber, and Ralf Reussner.\nGinpex: Deriving Performance-relevant Infrastructure Properties\nThrough Goal-oriented Experiments.\nIn Proceedings of the 7th ACM SIGSOFT International Conference\non the Quality of Software Architectures (QoSA 2011), June 20-24, 2011,\npages 53-62. ACM, New York, NY, USA.\nJune 2011.\n[ bib | DOI | .pdf  ] 
\n@inproceedings{hauck2011b,\naddress = {New York, NY, USA},\nauthor = {Michael Hauck and Michael Kuperberg and Nikolaus Huber and Ralf Reussner},\nbooktitle = {Proceedings of the 7th ACM SIGSOFT International Conference on the Quality of Software Architectures (QoSA 2011)},\nday = {20--24},\ndoi = {http://doi.acm.org/10.1145/2000259.2000269},\nisbn = {978-1-4503-0724-6},\nmonth = {June},\nnumpages = {10},\npages = {53--62},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/188.pdf},\npublisher = {ACM},\ntitle = {{Ginpex: Deriving Performance-relevant Infrastructure Properties Through Goal-oriented Experiments}},\nyear = {2011}\n}\n
\n
\n','
\n@inproceedings{hauck2011b,\n  address = {New York, NY, USA},\n  author = {Michael Hauck and Michael Kuperberg and Nikolaus Huber and Ralf Reussner},\n  booktitle = {Proceedings of the 7th ACM SIGSOFT International Conference on the Quality of Software Architectures (QoSA 2011)},\n  day = {20--24},\n  doi = {http://doi.acm.org/10.1145/2000259.2000269},\n  isbn = {978-1-4503-0724-6},\n  month = {June},\n  numpages = {10},\n  pages = {53--62},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/188.pdf},\n  publisher = {ACM},\n  title = {{Ginpex: Deriving Performance-relevant Infrastructure Properties Through Goal-oriented Experiments}},\n  year = {2011}\n}\n
\n\n',NULL,'{Ginpex: Deriving Performance-relevant Infrastructure Properties Through Goal-oriented Experiments}',0,6,2011,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(201,'paper','Herbst2012a','mastersthesis','@mastersthesis{Herbst2012a,\n abstract = {{Virtualization technologies enable dynamic allocation of computing resources to execution environments at run-time. To exploit optimisation potential that comes with these degrees of freedom, forecasts of the arriving work\'s intensity are valuable information, to continuously ensure a defined quality of service (QoS) definition and at the same time to improve the efficiency of the resource utilisation. Time series analysis offers a broad spectrum of methods for calculation of forecasts based on periodically monitored values. Related work in the field of proactive resource provisioning mostly concentrate on single methods of the time series analysis and their individual optimisation potential. This way, usable forecast results are achieved only in certain situations. In this thesis, established methods of the time series analysis are surveyed and grouped concerning their strengths and weaknesses. A dynamic approach is presented that selects based on a decision tree and direct feedback cycles, capturing the forecast accuracy, the suitable method for a given situation. The user needs to provide only his general forecast objectives. An implementation of the introduced theoretical approach is presented that continuously provides forecasts of the arriving work\'s intensity in configurable intervals and with controllable computational overhead during run-time. Based on real-world intensity traces, a number of different experiments and a case study is conducted. The results show, that by use of the implementation the relative error of the forecast points in relation to the arriving observations is reduced by 63% in average compared to the results of a statically selected, sophisticated method. In a case study, between 52% and 70% of the violations of a given service level agreement are prevented by applying proactive resource provisioning based on the forecast results of the introduced implementation.}},\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n author = {Nikolas Roman Herbst},\n keywords = {Cloud, Resource Elasticity, Workload, Forecasting, Time Series},\n note = {Forschungszentrum Informatik (FZI) Prize \"Best Diploma Thesis\"},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/201.pdf},\n school = {{Karlsruhe Institute of Technology (KIT)}},\n title = {{Workload Classification and Forecasting}},\n type = {{Diploma Thesis}},\n year = {2012},\n}\n\n','\n\nNikolas Roman Herbst.\nWorkload Classification and Forecasting.\nDiploma Thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, 2012.\nForschungszentrum Informatik (FZI) Prize \"Best Diploma\nThesis\".\n[ bib | .pdf | Abstract  ] 
\n@mastersthesis{Herbst2012a,\nabstract = {{Virtualization technologies enable dynamic allocation of computing resources to execution environments at run-time. To exploit optimisation potential that comes with these degrees of freedom, forecasts of the arriving work\'s intensity are valuable information, to continuously ensure a defined quality of service (QoS) definition and at the same time to improve the efficiency of the resource utilisation. Time series analysis offers a broad spectrum of methods for calculation of forecasts based on periodically monitored values. Related work in the field of proactive resource provisioning mostly concentrate on single methods of the time series analysis and their individual optimisation potential. This way, usable forecast results are achieved only in certain situations. In this thesis, established methods of the time series analysis are surveyed and grouped concerning their strengths and weaknesses. A dynamic approach is presented that selects based on a decision tree and direct feedback cycles, capturing the forecast accuracy, the suitable method for a given situation. The user needs to provide only his general forecast objectives. An implementation of the introduced theoretical approach is presented that continuously provides forecasts of the arriving work\'s intensity in configurable intervals and with controllable computational overhead during run-time. Based on real-world intensity traces, a number of different experiments and a case study is conducted. The results show, that by use of the implementation the relative error of the forecast points in relation to the arriving observations is reduced by 63% in average compared to the results of a statically selected, sophisticated method. In a case study, between 52% and 70% of the violations of a given service level agreement are prevented by applying proactive resource provisioning based on the forecast results of the introduced implementation.}},\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nauthor = {Nikolas Roman Herbst},\nkeywords = {Cloud, Resource Elasticity, Workload, Forecasting, Time Series},\nnote = {Forschungszentrum Informatik (FZI) Prize \"Best Diploma Thesis\"},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/201.pdf},\nschool = {{Karlsruhe Institute of Technology (KIT)}},\ntitle = {{Workload Classification and Forecasting}},\ntype = {{Diploma Thesis}},\nyear = {2012}\n}\n
\n
\nVirtualization technologies enable dynamic allocation of computing resources to execution environments at run-time. To exploit optimisation potential that comes with these degrees of freedom, forecasts of the arriving work\'s intensity are valuable information, to continuously ensure a defined quality of service (QoS) definition and at the same time to improve the efficiency of the resource utilisation. Time series analysis offers a broad spectrum of methods for calculation of forecasts based on periodically monitored values. Related work in the field of proactive resource provisioning mostly concentrate on single methods of the time series analysis and their individual optimisation potential. This way, usable forecast results are achieved only in certain situations. In this thesis, established methods of the time series analysis are surveyed and grouped concerning their strengths and weaknesses. A dynamic approach is presented that selects based on a decision tree and direct feedback cycles, capturing the forecast accuracy, the suitable method for a given situation. The user needs to provide only his general forecast objectives. An implementation of the introduced theoretical approach is presented that continuously provides forecasts of the arriving work\'s intensity in configurable intervals and with controllable computational overhead during run-time. Based on real-world intensity traces, a number of different experiments and a case study is conducted. The results show, that by use of the implementation the relative error of the forecast points in relation to the arriving observations is reduced by 63% in average compared to the results of a statically selected, sophisticated method. In a case study, between 52% and 70% of the violations of a given service level agreement are prevented by applying proactive resource provisioning based on the forecast results of the introduced implementation.\n
\n','
\n@mastersthesis{Herbst2012a,\n  abstract = {{Virtualization technologies enable dynamic allocation of computing resources to execution environments at run-time. To exploit optimisation potential that comes with these degrees of freedom, forecasts of the arriving work\'s intensity are valuable information, to continuously ensure a defined quality of service (QoS) definition and at the same time to improve the efficiency of the resource utilisation. Time series analysis offers a broad spectrum of methods for calculation of forecasts based on periodically monitored values. Related work in the field of proactive resource provisioning mostly concentrate on single methods of the time series analysis and their individual optimisation potential. This way, usable forecast results are achieved only in certain situations. In this thesis, established methods of the time series analysis are surveyed and grouped concerning their strengths and weaknesses. A dynamic approach is presented that selects based on a decision tree and direct feedback cycles, capturing the forecast accuracy, the suitable method for a given situation. The user needs to provide only his general forecast objectives. An implementation of the introduced theoretical approach is presented that continuously provides forecasts of the arriving work\'s intensity in configurable intervals and with controllable computational overhead during run-time. Based on real-world intensity traces, a number of different experiments and a case study is conducted. The results show, that by use of the implementation the relative error of the forecast points in relation to the arriving observations is reduced by 63% in average compared to the results of a statically selected, sophisticated method. In a case study, between 52% and 70% of the violations of a given service level agreement are prevented by applying proactive resource provisioning based on the forecast results of the introduced implementation.}},\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  author = {Nikolas Roman Herbst},\n  keywords = {Cloud, Resource Elasticity, Workload, Forecasting, Time Series},\n  note = {Forschungszentrum Informatik (FZI) Prize \"Best Diploma Thesis\"},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/201.pdf},\n  school = {{Karlsruhe Institute of Technology (KIT)}},\n  title = {{Workload Classification and Forecasting}},\n  type = {{Diploma Thesis}},\n  year = {2012}\n}\n
\n\n','{Virtualization technologies enable dynamic allocation of computing resources to execution environments at run-time. To exploit optimisation potential that comes with these degrees of freedom, forecasts of the arriving work\'s intensity are valuable information, to continuously ensure a defined quality of service (QoS) definition and at the same time to improve the efficiency of the resource utilisation. Time series analysis offers a broad spectrum of methods for calculation of forecasts based on periodically monitored values. Related work in the field of proactive resource provisioning mostly concentrate on single methods of the time series analysis and their individual optimisation potential. This way, usable forecast results are achieved only in certain situations. In this thesis, established methods of the time series analysis are surveyed and grouped concerning their strengths and weaknesses. A dynamic approach is presented that selects based on a decision tree and direct feedback cycles, capturing the forecast accuracy, the suitable method for a given situation. The user needs to provide only his general forecast objectives. An implementation of the introduced theoretical approach is presented that continuously provides forecasts of the arriving work\'s intensity in configurable intervals and with controllable computational overhead during run-time. Based on real-world intensity traces, a number of different experiments and a case study is conducted. The results show, that by use of the implementation the relative error of the forecast points in relation to the arriving observations is reduced by 63% in average compared to the results of a statically selected, sophisticated method. In a case study, between 52% and 70% of the violations of a given service level agreement are prevented by applying proactive resource provisioning based on the forecast results of the introduced implementation.}','{Workload Classification and Forecasting}',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(202,'paper','Herbst2011a','mastersthesis','@mastersthesis{Herbst2011a,\n abstract = {{Elasticity is the ability of a software system to dynamically adapt the amount of the resources it provides to clients as their workloads increase or decrease. In the context of cloud computing, automated resizing of a virtual machine\'s resources can be considered as a key step towards optimisation of a system\'s cost and energy efficiency. Existing work on cloud computing is limited to the technical view of implementing elastic systems, and definitions of scalability have not been extended to cover elasticity. This study thesis presents a detailed discussion of elasticity, proposes metrics as well as measurement techniques, and outlines next steps for enabling comparisons between cloud computing offerings on the basis of elasticity. I discuss results of our work on measuring elasticity of thread pools provided by the Java virtual machine, as well as an experiment setup for elastic CPU time slice resizing in a virtualized environment. An experiment setup is presented as future work for dynamically adding and removing z/VM Linux virtual machine instances to a performance relevant group of virtualized servers.}},\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n author = {Nikolas Roman Herbst},\n keywords = {Cloud, Resource Elasticity},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/202.pdf},\n school = {{Karlsruhe Institute of Technology (KIT)}},\n title = {{Quantifying the Impact of Configuration Space for Elasticity Benchmarking}},\n type = {{Study Thesis}},\n year = {2011},\n}\n\n','\n\nNikolas Roman Herbst.\nQuantifying the Impact of Configuration Space for Elasticity\nBenchmarking.\nStudy Thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, 2011.\n[ bib | .pdf | Abstract  ] 
\n@mastersthesis{Herbst2011a,\nabstract = {{Elasticity is the ability of a software system to dynamically adapt the amount of the resources it provides to clients as their workloads increase or decrease. In the context of cloud computing, automated resizing of a virtual machine\'s resources can be considered as a key step towards optimisation of a system\'s cost and energy efficiency. Existing work on cloud computing is limited to the technical view of implementing elastic systems, and definitions of scalability have not been extended to cover elasticity. This study thesis presents a detailed discussion of elasticity, proposes metrics as well as measurement techniques, and outlines next steps for enabling comparisons between cloud computing offerings on the basis of elasticity. I discuss results of our work on measuring elasticity of thread pools provided by the Java virtual machine, as well as an experiment setup for elastic CPU time slice resizing in a virtualized environment. An experiment setup is presented as future work for dynamically adding and removing z/VM Linux virtual machine instances to a performance relevant group of virtualized servers.}},\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nauthor = {Nikolas Roman Herbst},\nkeywords = {Cloud, Resource Elasticity},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/202.pdf},\nschool = {{Karlsruhe Institute of Technology (KIT)}},\ntitle = {{Quantifying the Impact of Configuration Space for Elasticity Benchmarking}},\ntype = {{Study Thesis}},\nyear = {2011}\n}\n
\n
\nElasticity is the ability of a software system to dynamically adapt the amount of the resources it provides to clients as their workloads increase or decrease. In the context of cloud computing, automated resizing of a virtual machine\'s resources can be considered as a key step towards optimisation of a system\'s cost and energy efficiency. Existing work on cloud computing is limited to the technical view of implementing elastic systems, and definitions of scalability have not been extended to cover elasticity. This study thesis presents a detailed discussion of elasticity, proposes metrics as well as measurement techniques, and outlines next steps for enabling comparisons between cloud computing offerings on the basis of elasticity. I discuss results of our work on measuring elasticity of thread pools provided by the Java virtual machine, as well as an experiment setup for elastic CPU time slice resizing in a virtualized environment. An experiment setup is presented as future work for dynamically adding and removing z/VM Linux virtual machine instances to a performance relevant group of virtualized servers.\n
\n','
\n@mastersthesis{Herbst2011a,\n  abstract = {{Elasticity is the ability of a software system to dynamically adapt the amount of the resources it provides to clients as their workloads increase or decrease. In the context of cloud computing, automated resizing of a virtual machine\'s resources can be considered as a key step towards optimisation of a system\'s cost and energy efficiency. Existing work on cloud computing is limited to the technical view of implementing elastic systems, and definitions of scalability have not been extended to cover elasticity. This study thesis presents a detailed discussion of elasticity, proposes metrics as well as measurement techniques, and outlines next steps for enabling comparisons between cloud computing offerings on the basis of elasticity. I discuss results of our work on measuring elasticity of thread pools provided by the Java virtual machine, as well as an experiment setup for elastic CPU time slice resizing in a virtualized environment. An experiment setup is presented as future work for dynamically adding and removing z/VM Linux virtual machine instances to a performance relevant group of virtualized servers.}},\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  author = {Nikolas Roman Herbst},\n  keywords = {Cloud, Resource Elasticity},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/202.pdf},\n  school = {{Karlsruhe Institute of Technology (KIT)}},\n  title = {{Quantifying the Impact of Configuration Space for Elasticity Benchmarking}},\n  type = {{Study Thesis}},\n  year = {2011}\n}\n
\n\n','{Elasticity is the ability of a software system to dynamically adapt the amount of the resources it provides to clients as their workloads increase or decrease. In the context of cloud computing, automated resizing of a virtual machine\'s resources can be considered as a key step towards optimisation of a system\'s cost and energy efficiency. Existing work on cloud computing is limited to the technical view of implementing elastic systems, and definitions of scalability have not been extended to cover elasticity. This study thesis presents a detailed discussion of elasticity, proposes metrics as well as measurement techniques, and outlines next steps for enabling comparisons between cloud computing offerings on the basis of elasticity. I discuss results of our work on measuring elasticity of thread pools provided by the Java virtual machine, as well as an experiment setup for elastic CPU time slice resizing in a virtualized environment. An experiment setup is presented as future work for dynamically adding and removing z/VM Linux virtual machine instances to a performance relevant group of virtualized servers.}','{Quantifying the Impact of Configuration Space for Elasticity Benchmarking}',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(203,'paper','HeHuKoAm2013-ICPE-WorkloadClassificationAndForecasting','inproceedings','@inproceedings{HeHuKoAm2013-ICPE-WorkloadClassificationAndForecasting,\n abstract = {{As modern enterprise software systems become increasingly dynamic, workload forecasting techniques are gaining in importance as a foundation for online capacity planning and resource management. Time series analysis covers a broad spectrum of methods to calculate workload forecasts based on history monitoring data. Related work in the field of workload forecasting mostly concentrates on evaluating specific methods and their individual optimisation potential or on predicting Quality-of-Service (QoS) metrics directly. As a basis, we present a survey on established forecasting methods of the time series analysis concerning their benefits and drawbacks and group them according to their computational overheads. In this paper, we propose a novel self-adaptive approach that selects suitable forecasting methods for a given context based on a decision tree and direct feedback cycles together with a corresponding implementation. The user needs to provide only his general forecasting objectives. In several experiments and case studies based on real world workload traces, we show that our implementation of the approach provides continuous and reliable forecast results at run-time. The results of this extensive evaluation show that the relative error of the individual forecast points is significantly reduced compared to statically applied forecasting methods, e.g. in an exemplary scenario on average by 37%. In a case study, between 55% and 75% of the violations of a given service level agreement can be prevented by applying proactive resource provisioning based on the forecast results of our implementation.}},\n acmid = {2479899},\n address = {New York, NY, USA},\n author = {Nikolas Roman Herbst and Nikolaus Huber and Samuel Kounev and Erich Amrehn},\n booktitle = {Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013)},\n day = {21--24},\n doi = {10.1145/2479871.2479899},\n isbn = {978-1-4503-1636-1},\n keywords = {arrival rate, proactive resource provisioning, time series analysis, workload forecasting},\n location = {Prague, Czech Republic},\n month = {April},\n numpages = {12},\n pages = {187--198},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/203.pdf},\n publisher = {ACM},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/203},\n title = {{Self-Adaptive Workload Classification and Forecasting for Proactive Resource Provisioning}},\n url = {http://doi.acm.org/10.1145/2479871.2479899},\n year = {2013},\n}\n\n','\n\nNikolas Roman Herbst, Nikolaus Huber, Samuel Kounev, and Erich Amrehn.\nSelf-Adaptive Workload Classification and Forecasting for Proactive\nResource Provisioning.\nIn Proceedings of the 4th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2013), Prague, Czech Republic, April 21-24,\n2013, pages 187-198. ACM, New York, NY, USA.\nApril 2013.\n[ bib | DOI | slides | http | .pdf | Abstract  ] 
\n@inproceedings{HeHuKoAm2013-ICPE-WorkloadClassificationAndForecasting,\nabstract = {{As modern enterprise software systems become increasingly dynamic, workload forecasting techniques are gaining in importance as a foundation for online capacity planning and resource management. Time series analysis covers a broad spectrum of methods to calculate workload forecasts based on history monitoring data. Related work in the field of workload forecasting mostly concentrates on evaluating specific methods and their individual optimisation potential or on predicting Quality-of-Service (QoS) metrics directly. As a basis, we present a survey on established forecasting methods of the time series analysis concerning their benefits and drawbacks and group them according to their computational overheads. In this paper, we propose a novel self-adaptive approach that selects suitable forecasting methods for a given context based on a decision tree and direct feedback cycles together with a corresponding implementation. The user needs to provide only his general forecasting objectives. In several experiments and case studies based on real world workload traces, we show that our implementation of the approach provides continuous and reliable forecast results at run-time. The results of this extensive evaluation show that the relative error of the individual forecast points is significantly reduced compared to statically applied forecasting methods, e.g. in an exemplary scenario on average by 37%. In a case study, between 55% and 75% of the violations of a given service level agreement can be prevented by applying proactive resource provisioning based on the forecast results of our implementation.}},\nacmid = {2479899},\naddress = {New York, NY, USA},\nauthor = {Nikolas Roman Herbst and Nikolaus Huber and Samuel Kounev and Erich Amrehn},\nbooktitle = {Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013)},\nday = {21--24},\ndoi = {10.1145/2479871.2479899},\nisbn = {978-1-4503-1636-1},\nkeywords = {arrival rate, proactive resource provisioning, time series analysis, workload forecasting},\nlocation = {Prague, Czech Republic},\nmonth = {April},\nnumpages = {12},\npages = {187--198},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/203.pdf},\npublisher = {ACM},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/203},\ntitle = {{Self-Adaptive Workload Classification and Forecasting for Proactive Resource Provisioning}},\nurl = {http://doi.acm.org/10.1145/2479871.2479899},\nyear = {2013}\n}\n
\n
\nAs modern enterprise software systems become increasingly dynamic, workload forecasting techniques are gaining in importance as a foundation for online capacity planning and resource management. Time series analysis covers a broad spectrum of methods to calculate workload forecasts based on history monitoring data. Related work in the field of workload forecasting mostly concentrates on evaluating specific methods and their individual optimisation potential or on predicting Quality-of-Service (QoS) metrics directly. As a basis, we present a survey on established forecasting methods of the time series analysis concerning their benefits and drawbacks and group them according to their computational overheads. In this paper, we propose a novel self-adaptive approach that selects suitable forecasting methods for a given context based on a decision tree and direct feedback cycles together with a corresponding implementation. The user needs to provide only his general forecasting objectives. In several experiments and case studies based on real world workload traces, we show that our implementation of the approach provides continuous and reliable forecast results at run-time. The results of this extensive evaluation show that the relative error of the individual forecast points is significantly reduced compared to statically applied forecasting methods, e.g. in an exemplary scenario on average by 37%. In a case study, between 55% and 75% of the violations of a given service level agreement can be prevented by applying proactive resource provisioning based on the forecast results of our implementation.\n
\n','
\n@inproceedings{HeHuKoAm2013-ICPE-WorkloadClassificationAndForecasting,\n  abstract = {{As modern enterprise software systems become increasingly dynamic, workload forecasting techniques are gaining in importance as a foundation for online capacity planning and resource management. Time series analysis covers a broad spectrum of methods to calculate workload forecasts based on history monitoring data. Related work in the field of workload forecasting mostly concentrates on evaluating specific methods and their individual optimisation potential or on predicting Quality-of-Service (QoS) metrics directly. As a basis, we present a survey on established forecasting methods of the time series analysis concerning their benefits and drawbacks and group them according to their computational overheads. In this paper, we propose a novel self-adaptive approach that selects suitable forecasting methods for a given context based on a decision tree and direct feedback cycles together with a corresponding implementation. The user needs to provide only his general forecasting objectives. In several experiments and case studies based on real world workload traces, we show that our implementation of the approach provides continuous and reliable forecast results at run-time. The results of this extensive evaluation show that the relative error of the individual forecast points is significantly reduced compared to statically applied forecasting methods, e.g. in an exemplary scenario on average by 37%. In a case study, between 55% and 75% of the violations of a given service level agreement can be prevented by applying proactive resource provisioning based on the forecast results of our implementation.}},\n  acmid = {2479899},\n  address = {New York, NY, USA},\n  author = {Nikolas Roman Herbst and Nikolaus Huber and Samuel Kounev and Erich Amrehn},\n  booktitle = {Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013)},\n  day = {21--24},\n  doi = {10.1145/2479871.2479899},\n  isbn = {978-1-4503-1636-1},\n  keywords = {arrival rate, proactive resource provisioning, time series analysis, workload forecasting},\n  location = {Prague, Czech Republic},\n  month = {April},\n  numpages = {12},\n  pages = {187--198},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/203.pdf},\n  publisher = {ACM},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/203},\n  title = {{Self-Adaptive Workload Classification and Forecasting for Proactive Resource Provisioning}},\n  url = {http://doi.acm.org/10.1145/2479871.2479899},\n  year = {2013}\n}\n
\n\n','{As modern enterprise software systems become increasingly dynamic, workload forecasting techniques are gaining in importance as a foundation for online capacity planning and resource management. Time series analysis covers a broad spectrum of methods to calculate workload forecasts based on history monitoring data. Related work in the field of workload forecasting mostly concentrates on evaluating specific methods and their individual optimisation potential or on predicting Quality-of-Service (QoS) metrics directly. As a basis, we present a survey on established forecasting methods of the time series analysis concerning their benefits and drawbacks and group them according to their computational overheads. In this paper, we propose a novel self-adaptive approach that selects suitable forecasting methods for a given context based on a decision tree and direct feedback cycles together with a corresponding implementation. The user needs to provide only his general forecasting objectives. In several experiments and case studies based on real world workload traces, we show that our implementation of the approach provides continuous and reliable forecast results at run-time. The results of this extensive evaluation show that the relative error of the individual forecast points is significantly reduced compared to statically applied forecasting methods, e.g. in an exemplary scenario on average by 37%. In a case study, between 55% and 75% of the violations of a given service level agreement can be prevented by applying proactive resource provisioning based on the forecast results of our implementation.}','{Self-Adaptive Workload Classification and Forecasting for Proactive Resource Provisioning}',0,4,2013,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(208,'paper','HuKoAm2013-CCPE-WorkloadClassificationAndForecasting','article','@article{HuKoAm2013-CCPE-WorkloadClassificationAndForecasting,\n author = {Nikolas Roman Herbst and Nikolaus Huber and Samuel Kounev and Erich Amrehn},\n title = {{Self-Adaptive Workload Classification and Forecasting for Proactive Resource Provisioning}},\n journal = {Concurrency and Computation - Practice and Experience, John Wiley and Sons, Ltd.},\n year = {2014},\n month = {March},\n issn = {1532-0634},\n volume = {26},\n number = {12},\n pages = {2053--2078},\n url = {http://dx.doi.org/10.1002/cpe.3224},\n doi = {10.1002/cpe.3224},\n keywords = {workload forecasting, arrival rate, time series analysis, proactive resource provisioning, assurance of service level objectives},\n abstract = {As modern enterprise software systems become increasingly dynamic, workload forecasting techniques are gaining in importance as a foundation for online capacity planning and resource management. Time series analysis covers a broad spectrum of methods to calculate workload forecasts based on history monitoring data. Related work in the field of workload forecasting mostly concentrates on evaluating specific methods and their individual optimisation potential or on predicting Quality-of-Service (QoS) metrics directly. As a basis, we present a survey on established forecasting methods of the time series analysis concerning their benefits and drawbacks and group them according to their computational overheads. In this paper, we propose a novel self-adaptive approach that selects suitable forecasting methods for a given context based on a decision tree and direct feedback cycles together with a corresponding implementation. The user needs to provide only his general forecasting objectives. In several experiments and case studies based on real world workload traces, we show that our implementation of the approach provides continuous and reliable forecast results at run-time. The results of this extensive evaluation show that the relative error of the individual forecast points is significantly reduced compared to statically applied forecasting methods, e.g. in an exemplary scenario on average by 37%. In a case study, between 55% and 75% of the violations of a given service level agreement can be prevented by applying proactive resource provisioning based on the forecast results of our implementation.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/208.pdf},\n}\n\n','\n\nNikolas Roman Herbst, Nikolaus Huber, Samuel Kounev, and Erich Amrehn.\nSelf-Adaptive Workload Classification and Forecasting for Proactive\nResource Provisioning.\nConcurrency and Computation - Practice and Experience, John\nWiley and Sons, Ltd., 26(12):2053-2078, March 2014.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@article{HuKoAm2013-CCPE-WorkloadClassificationAndForecasting,\nauthor = {Nikolas Roman Herbst and Nikolaus Huber and Samuel Kounev and Erich Amrehn},\ntitle = {{Self-Adaptive Workload Classification and Forecasting for Proactive Resource Provisioning}},\njournal = {Concurrency and Computation - Practice and Experience, John Wiley and Sons, Ltd.},\nyear = {2014},\nmonth = {March},\nissn = {1532-0634},\nvolume = {26},\nnumber = {12},\npages = {2053--2078},\nurl = {http://dx.doi.org/10.1002/cpe.3224},\ndoi = {10.1002/cpe.3224},\nkeywords = {workload forecasting, arrival rate, time series analysis, proactive resource provisioning, assurance of service level objectives},\nabstract = {As modern enterprise software systems become increasingly dynamic, workload forecasting techniques are gaining in importance as a foundation for online capacity planning and resource management. Time series analysis covers a broad spectrum of methods to calculate workload forecasts based on history monitoring data. Related work in the field of workload forecasting mostly concentrates on evaluating specific methods and their individual optimisation potential or on predicting Quality-of-Service (QoS) metrics directly. As a basis, we present a survey on established forecasting methods of the time series analysis concerning their benefits and drawbacks and group them according to their computational overheads. In this paper, we propose a novel self-adaptive approach that selects suitable forecasting methods for a given context based on a decision tree and direct feedback cycles together with a corresponding implementation. The user needs to provide only his general forecasting objectives. In several experiments and case studies based on real world workload traces, we show that our implementation of the approach provides continuous and reliable forecast results at run-time. The results of this extensive evaluation show that the relative error of the individual forecast points is significantly reduced compared to statically applied forecasting methods, e.g. in an exemplary scenario on average by 37%. In a case study, between 55% and 75% of the violations of a given service level agreement can be prevented by applying proactive resource provisioning based on the forecast results of our implementation.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/208.pdf}\n}\n
\n
\nAs modern enterprise software systems become increasingly dynamic, workload forecasting techniques are gaining in importance as a foundation for online capacity planning and resource management. Time series analysis covers a broad spectrum of methods to calculate workload forecasts based on history monitoring data. Related work in the field of workload forecasting mostly concentrates on evaluating specific methods and their individual optimisation potential or on predicting Quality-of-Service (QoS) metrics directly. As a basis, we present a survey on established forecasting methods of the time series analysis concerning their benefits and drawbacks and group them according to their computational overheads. In this paper, we propose a novel self-adaptive approach that selects suitable forecasting methods for a given context based on a decision tree and direct feedback cycles together with a corresponding implementation. The user needs to provide only his general forecasting objectives. In several experiments and case studies based on real world workload traces, we show that our implementation of the approach provides continuous and reliable forecast results at run-time. The results of this extensive evaluation show that the relative error of the individual forecast points is significantly reduced compared to statically applied forecasting methods, e.g. in an exemplary scenario on average by 37%. In a case study, between 55% and 75% of the violations of a given service level agreement can be prevented by applying proactive resource provisioning based on the forecast results of our implementation.\n
\n','
\n@article{HuKoAm2013-CCPE-WorkloadClassificationAndForecasting,\n  author = {Nikolas Roman Herbst and Nikolaus Huber and Samuel Kounev and Erich Amrehn},\n  title = {{Self-Adaptive Workload Classification and Forecasting for Proactive Resource Provisioning}},\n  journal = {Concurrency and Computation - Practice and Experience, John Wiley and Sons, Ltd.},\n  year = {2014},\n  month = {March},\n  issn = {1532-0634},\n  volume = {26},\n  number = {12},\n  pages = {2053--2078},\n  url = {http://dx.doi.org/10.1002/cpe.3224},\n  doi = {10.1002/cpe.3224},\n  keywords = {workload forecasting, arrival rate, time series analysis, proactive resource provisioning, assurance of service level objectives},\n  abstract = {As modern enterprise software systems become increasingly dynamic, workload forecasting techniques are gaining in importance as a foundation for online capacity planning and resource management. Time series analysis covers a broad spectrum of methods to calculate workload forecasts based on history monitoring data. Related work in the field of workload forecasting mostly concentrates on evaluating specific methods and their individual optimisation potential or on predicting Quality-of-Service (QoS) metrics directly. As a basis, we present a survey on established forecasting methods of the time series analysis concerning their benefits and drawbacks and group them according to their computational overheads. In this paper, we propose a novel self-adaptive approach that selects suitable forecasting methods for a given context based on a decision tree and direct feedback cycles together with a corresponding implementation. The user needs to provide only his general forecasting objectives. In several experiments and case studies based on real world workload traces, we show that our implementation of the approach provides continuous and reliable forecast results at run-time. The results of this extensive evaluation show that the relative error of the individual forecast points is significantly reduced compared to statically applied forecasting methods, e.g. in an exemplary scenario on average by 37%. In a case study, between 55% and 75% of the violations of a given service level agreement can be prevented by applying proactive resource provisioning based on the forecast results of our implementation.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/208.pdf}\n}\n
\n\n','As modern enterprise software systems become increasingly dynamic, workload forecasting techniques are gaining in importance as a foundation for online capacity planning and resource management. Time series analysis covers a broad spectrum of methods to calculate workload forecasts based on history monitoring data. Related work in the field of workload forecasting mostly concentrates on evaluating specific methods and their individual optimisation potential or on predicting Quality-of-Service (QoS) metrics directly. As a basis, we present a survey on established forecasting methods of the time series analysis concerning their benefits and drawbacks and group them according to their computational overheads. In this paper, we propose a novel self-adaptive approach that selects suitable forecasting methods for a given context based on a decision tree and direct feedback cycles together with a corresponding implementation. The user needs to provide only his general forecasting objectives. In several experiments and case studies based on real world workload traces, we show that our implementation of the approach provides continuous and reliable forecast results at run-time. The results of this extensive evaluation show that the relative error of the individual forecast points is significantly reduced compared to statically applied forecasting methods, e.g. in an exemplary scenario on average by 37%. In a case study, between 55% and 75% of the violations of a given service level agreement can be prevented by applying proactive resource provisioning based on the forecast results of our implementation.','{Self-Adaptive Workload Classification and Forecasting for Proactive Resource Provisioning}',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(209,'paper','HeKoRe2013-ICAC-Elasticity','inproceedings','@inproceedings{HeKoRe2013-ICAC-Elasticity,\n abstract = {{Originating from the field of physics and economics, the term elasticity is nowadays heavily used in the context of cloud computing. In this context, elasticity is commonly understood as the ability of a system to automatically provision and de-provision computing resources on demand as workloads change. However, elasticity still lacks a precise definition as well as representative metrics coupled with a benchmarking methodology to enable comparability of systems. Existing definitions of elasticity are largely inconsistent and unspecific leading to confusion in the use of the term and its differentiation from related terms such as scalability and efficiency; the proposed measurement methodologies do not provide means to quantify elasticity without mixing it with efficiency or scalability aspects. In this short paper, we propose a precise definition of elasticity and analyze its core properties and requirements explicitly distinguishing from related terms such as scalability, efficiency, and agility. Furthermore, we present a set of appropriate elasticity metrics and sketch a new elasticity tailored benchmarking methodology addressing the special requirements on workload design and calibration.}},\n author = {Nikolas Roman Herbst and Samuel Kounev and Ralf Reussner},\n booktitle = {Proceedings of the 10th International Conference on Autonomic Computing (ICAC 2013)},\n day = {24--28},\n location = {San Jose, CA},\n month = {June},\n note = {Acceptance Rate (Short Paper): 36.9\\%},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/209.pdf},\n publisher = {USENIX},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/209},\n title = {{Elasticity in Cloud Computing: What it is, and What it is Not}},\n titleaddon = {{(Short Paper)}},\n url = {https://www.usenix.org/conference/icac13/elasticity-cloud-computing-what-it-and-what-it-not},\n year = {2013},\n}\n\n','\n\nNikolas Roman Herbst, Samuel Kounev, and Ralf Reussner.\nElasticity in Cloud Computing: What it is, and What it is Not\n(Short Paper).\nIn Proceedings of the 10th International Conference on Autonomic\nComputing (ICAC 2013), San Jose, CA, June 24-28, 2013. USENIX.\nJune 2013, Acceptance Rate (Short Paper): 36.9%.\n[ bib | slides | http | .pdf | Abstract  ] 
\n@inproceedings{HeKoRe2013-ICAC-Elasticity,\nabstract = {{Originating from the field of physics and economics, the term elasticity is nowadays heavily used in the context of cloud computing. In this context, elasticity is commonly understood as the ability of a system to automatically provision and de-provision computing resources on demand as workloads change. However, elasticity still lacks a precise definition as well as representative metrics coupled with a benchmarking methodology to enable comparability of systems. Existing definitions of elasticity are largely inconsistent and unspecific leading to confusion in the use of the term and its differentiation from related terms such as scalability and efficiency; the proposed measurement methodologies do not provide means to quantify elasticity without mixing it with efficiency or scalability aspects. In this short paper, we propose a precise definition of elasticity and analyze its core properties and requirements explicitly distinguishing from related terms such as scalability, efficiency, and agility. Furthermore, we present a set of appropriate elasticity metrics and sketch a new elasticity tailored benchmarking methodology addressing the special requirements on workload design and calibration.}},\nauthor = {Nikolas Roman Herbst and Samuel Kounev and Ralf Reussner},\nbooktitle = {Proceedings of the 10th International Conference on Autonomic Computing (ICAC 2013)},\nday = {24--28},\nlocation = {San Jose, CA},\nmonth = {June},\nnote = {Acceptance Rate (Short Paper): 36.9\\%},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/209.pdf},\npublisher = {USENIX},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/209},\ntitle = {{Elasticity in Cloud Computing: What it is, and What it is Not}},\ntitleaddon = {{(Short Paper)}},\nurl = {https://www.usenix.org/conference/icac13/elasticity-cloud-computing-what-it-and-what-it-not},\nyear = {2013}\n}\n
\n
\nOriginating from the field of physics and economics, the term elasticity is nowadays heavily used in the context of cloud computing. In this context, elasticity is commonly understood as the ability of a system to automatically provision and de-provision computing resources on demand as workloads change. However, elasticity still lacks a precise definition as well as representative metrics coupled with a benchmarking methodology to enable comparability of systems. Existing definitions of elasticity are largely inconsistent and unspecific leading to confusion in the use of the term and its differentiation from related terms such as scalability and efficiency; the proposed measurement methodologies do not provide means to quantify elasticity without mixing it with efficiency or scalability aspects. In this short paper, we propose a precise definition of elasticity and analyze its core properties and requirements explicitly distinguishing from related terms such as scalability, efficiency, and agility. Furthermore, we present a set of appropriate elasticity metrics and sketch a new elasticity tailored benchmarking methodology addressing the special requirements on workload design and calibration.\n
\n','
\n@inproceedings{HeKoRe2013-ICAC-Elasticity,\n  abstract = {{Originating from the field of physics and economics, the term elasticity is nowadays heavily used in the context of cloud computing. In this context, elasticity is commonly understood as the ability of a system to automatically provision and de-provision computing resources on demand as workloads change. However, elasticity still lacks a precise definition as well as representative metrics coupled with a benchmarking methodology to enable comparability of systems. Existing definitions of elasticity are largely inconsistent and unspecific leading to confusion in the use of the term and its differentiation from related terms such as scalability and efficiency; the proposed measurement methodologies do not provide means to quantify elasticity without mixing it with efficiency or scalability aspects. In this short paper, we propose a precise definition of elasticity and analyze its core properties and requirements explicitly distinguishing from related terms such as scalability, efficiency, and agility. Furthermore, we present a set of appropriate elasticity metrics and sketch a new elasticity tailored benchmarking methodology addressing the special requirements on workload design and calibration.}},\n  author = {Nikolas Roman Herbst and Samuel Kounev and Ralf Reussner},\n  booktitle = {Proceedings of the 10th International Conference on Autonomic Computing (ICAC 2013)},\n  day = {24--28},\n  location = {San Jose, CA},\n  month = {June},\n  note = {Acceptance Rate (Short Paper): 36.9\\%},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/209.pdf},\n  publisher = {USENIX},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/209},\n  title = {{Elasticity in Cloud Computing: What it is, and What it is Not}},\n  titleaddon = {{(Short Paper)}},\n  url = {https://www.usenix.org/conference/icac13/elasticity-cloud-computing-what-it-and-what-it-not},\n  year = {2013}\n}\n
\n\n','{Originating from the field of physics and economics, the term elasticity is nowadays heavily used in the context of cloud computing. In this context, elasticity is commonly understood as the ability of a system to automatically provision and de-provision computing resources on demand as workloads change. However, elasticity still lacks a precise definition as well as representative metrics coupled with a benchmarking methodology to enable comparability of systems. Existing definitions of elasticity are largely inconsistent and unspecific leading to confusion in the use of the term and its differentiation from related terms such as scalability and efficiency; the proposed measurement methodologies do not provide means to quantify elasticity without mixing it with efficiency or scalability aspects. In this short paper, we propose a precise definition of elasticity and analyze its core properties and requirements explicitly distinguishing from related terms such as scalability, efficiency, and agility. Furthermore, we present a set of appropriate elasticity metrics and sketch a new elasticity tailored benchmarking methodology addressing the special requirements on workload design and calibration.}','{Elasticity in Cloud Computing: What it is, and What it is Not}',0,6,2013,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(210,'paper','KiHeKo2014-LT-DLIM','inproceedings','@inproceedings{KiHeKo2014-LT-DLIM,\n abstract = {{Today\'s software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. Based on this observation, we identify the need for means allowing flexible definition of load profiles and address this by introducing two meta-models at different abstraction levels. At the lower abstraction level, the Descartes Load Intensity Meta-Model (DLIM) offers a structured and accessible way of describing the load intensity over time by editing and combining mathematical functions. The High-Level Descartes Load Intensity Meta-Model (HLDLIM) allows the description of load variations using few defined parameters that characterize the seasonal patterns, trends, bursts and noise parts. We demonstrate that both meta-models are capable of capturing real-world load profiles with acceptable accuracy through comparison with a real life trace.}},\n author = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Samuel Kounev},\n booktitle = {Proceedings of the 3rd International Workshop on Large-Scale Testing (LT 2014), co-located with the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n day = {22},\n location = {Dublin, Ireland},\n month = {March},\n publisher = {ACM},\n title = {{Modeling Variations in Load Intensity over Time}},\n slides = {http://lt2014.eecs.yorku.ca/talks/Joakim_LTslides.pdf},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/210.pdf},\n isbn = {978-1-4503-2762-6},\n pages = {1--4},\n numpages = {4},\n url = {http://doi.acm.org/10.1145/2577036.2577037},\n doi = {10.1145/2577036.2577037},\n acmid = {2577037},\n address = {New York, NY, USA},\n keywords = {benchmarking, modeling, workload},\n year = {2014},\n}\n\n','\n\nJóakim von Kistowski, Nikolas Roman Herbst, and Samuel Kounev.\nModeling Variations in Load Intensity over Time.\nIn Proceedings of the 3rd International Workshop on Large-Scale\nTesting (LT 2014), co-located with the 5th ACM/SPEC International Conference\non Performance Engineering (ICPE 2014), Dublin, Ireland, March 22, 2014,\npages 1-4. ACM, New York, NY, USA.\nMarch 2014.\n[ bib | DOI | slides | http | .pdf | Abstract  ] 
\n@inproceedings{KiHeKo2014-LT-DLIM,\nabstract = {{Today\'s software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. Based on this observation, we identify the need for means allowing flexible definition of load profiles and address this by introducing two meta-models at different abstraction levels. At the lower abstraction level, the Descartes Load Intensity Meta-Model (DLIM) offers a structured and accessible way of describing the load intensity over time by editing and combining mathematical functions. The High-Level Descartes Load Intensity Meta-Model (HLDLIM) allows the description of load variations using few defined parameters that characterize the seasonal patterns, trends, bursts and noise parts. We demonstrate that both meta-models are capable of capturing real-world load profiles with acceptable accuracy through comparison with a real life trace.}},\nauthor = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Samuel Kounev},\nbooktitle = {Proceedings of the 3rd International Workshop on Large-Scale Testing (LT 2014), co-located with the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\nday = {22},\nlocation = {Dublin, Ireland},\nmonth = {March},\npublisher = {ACM},\ntitle = {{Modeling Variations in Load Intensity over Time}},\nslides = {http://lt2014.eecs.yorku.ca/talks/Joakim_LTslides.pdf},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/210.pdf},\nisbn = {978-1-4503-2762-6},\npages = {1--4},\nnumpages = {4},\nurl = {http://doi.acm.org/10.1145/2577036.2577037},\ndoi = {10.1145/2577036.2577037},\nacmid = {2577037},\naddress = {New York, NY, USA},\nkeywords = {benchmarking, modeling, workload},\nyear = {2014}\n}\n
\n
\nToday\'s software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. Based on this observation, we identify the need for means allowing flexible definition of load profiles and address this by introducing two meta-models at different abstraction levels. At the lower abstraction level, the Descartes Load Intensity Meta-Model (DLIM) offers a structured and accessible way of describing the load intensity over time by editing and combining mathematical functions. The High-Level Descartes Load Intensity Meta-Model (HLDLIM) allows the description of load variations using few defined parameters that characterize the seasonal patterns, trends, bursts and noise parts. We demonstrate that both meta-models are capable of capturing real-world load profiles with acceptable accuracy through comparison with a real life trace.\n
\n','
\n@inproceedings{KiHeKo2014-LT-DLIM,\n  abstract = {{Today\'s software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. Based on this observation, we identify the need for means allowing flexible definition of load profiles and address this by introducing two meta-models at different abstraction levels. At the lower abstraction level, the Descartes Load Intensity Meta-Model (DLIM) offers a structured and accessible way of describing the load intensity over time by editing and combining mathematical functions. The High-Level Descartes Load Intensity Meta-Model (HLDLIM) allows the description of load variations using few defined parameters that characterize the seasonal patterns, trends, bursts and noise parts. We demonstrate that both meta-models are capable of capturing real-world load profiles with acceptable accuracy through comparison with a real life trace.}},\n  author = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Samuel Kounev},\n  booktitle = {Proceedings of the 3rd International Workshop on Large-Scale Testing (LT 2014), co-located with the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n  day = {22},\n  location = {Dublin, Ireland},\n  month = {March},\n  publisher = {ACM},\n  title = {{Modeling Variations in Load Intensity over Time}},\n  slides = {http://lt2014.eecs.yorku.ca/talks/Joakim_LTslides.pdf},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/210.pdf},\n  isbn = {978-1-4503-2762-6},\n  pages = {1--4},\n  numpages = {4},\n  url = {http://doi.acm.org/10.1145/2577036.2577037},\n  doi = {10.1145/2577036.2577037},\n  acmid = {2577037},\n  address = {New York, NY, USA},\n  keywords = {benchmarking, modeling, workload},\n  year = {2014}\n}\n
\n\n','{Today\'s software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. Based on this observation, we identify the need for means allowing flexible definition of load profiles and address this by introducing two meta-models at different abstraction levels. At the lower abstraction level, the Descartes Load Intensity Meta-Model (DLIM) offers a structured and accessible way of describing the load intensity over time by editing and combining mathematical functions. The High-Level Descartes Load Intensity Meta-Model (HLDLIM) allows the description of load variations using few defined parameters that characterize the seasonal patterns, trends, bursts and noise parts. We demonstrate that both meta-models are capable of capturing real-world load profiles with acceptable accuracy through comparison with a real life trace.}','{Modeling Variations in Load Intensity over Time}',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(211,'paper','KiHeKo2014-ICPEDemo-LIMBO','inproceedings','@inproceedings{KiHeKo2014-ICPEDemo-LIMBO,\n abstract = {{Modern software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. In this paper, we present LIMBO - an Eclipse-based tool for modeling variable load intensity profiles based on the Descartes Load Intensity Model as an underlying modeling formalism.}},\n author = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Samuel Kounev},\n titleaddon = {{(Demo Paper)}},\n booktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n day = {22--26},\n location = {Dublin, Ireland},\n month = {March},\n publisher = {ACM},\n title = {{LIMBO: A Tool For Modeling Variable Load Intensities}},\n series = {ICPE \'14},\n year = {2014},\n isbn = {978-1-4503-2733-6},\n pages = {225--226},\n numpages = {2},\n url = {http://doi.acm.org/10.1145/2568088.2576092},\n doi = {10.1145/2568088.2576092},\n acmid = {2576092},\n publisher = {ACM},\n address = {New York, NY, USA},\n keywords = {load intensity variation, load profile, meta-modeling, model extraction, open workloads, transformation},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/211},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/211.pdf},\n year = {2014},\n}\n\n','\n\nJóakim von Kistowski, Nikolas Roman Herbst, and Samuel Kounev.\nLIMBO: A Tool For Modeling Variable Load Intensities (Demo\nPaper).\nIn Proceedings of the 5th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2014), Dublin, Ireland, March 22-26, 2014,\nICPE \'14, pages 225-226. ACM, New York, NY, USA.\nMarch 2014.\n[ bib | DOI | slides | http | .pdf | Abstract  ] 
\n@inproceedings{KiHeKo2014-ICPEDemo-LIMBO,\nabstract = {{Modern software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. In this paper, we present LIMBO - an Eclipse-based tool for modeling variable load intensity profiles based on the Descartes Load Intensity Model as an underlying modeling formalism.}},\nauthor = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Samuel Kounev},\ntitleaddon = {{(Demo Paper)}},\nbooktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\nday = {22--26},\nlocation = {Dublin, Ireland},\nmonth = {March},\npublisher = {ACM},\ntitle = {{LIMBO: A Tool For Modeling Variable Load Intensities}},\nseries = {ICPE \'14},\nyear = {2014},\nisbn = {978-1-4503-2733-6},\npages = {225--226},\nnumpages = {2},\nurl = {http://doi.acm.org/10.1145/2568088.2576092},\ndoi = {10.1145/2568088.2576092},\nacmid = {2576092},\npublisher = {ACM},\naddress = {New York, NY, USA},\nkeywords = {load intensity variation, load profile, meta-modeling, model extraction, open workloads, transformation},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/211},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/211.pdf},\nyear = {2014}\n}\n
\n
\nModern software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. In this paper, we present LIMBO - an Eclipse-based tool for modeling variable load intensity profiles based on the Descartes Load Intensity Model as an underlying modeling formalism.\n
\n','
\n@inproceedings{KiHeKo2014-ICPEDemo-LIMBO,\n  abstract = {{Modern software systems are expected to deliver reliable performance under highly variable load   intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. In this paper, we present LIMBO - an Eclipse-based tool for modeling variable load intensity profiles based on the Descartes Load Intensity Model as an underlying modeling formalism.}},\n  author = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Samuel Kounev},\n  titleaddon = {{(Demo Paper)}},\n  booktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n  day = {22--26},\n  location = {Dublin, Ireland},\n  month = {March},\n  publisher = {ACM},\n  title = {{LIMBO: A Tool For Modeling Variable Load Intensities}},\n  series = {ICPE \'14},\n  year = {2014},\n  isbn = {978-1-4503-2733-6},\n  pages = {225--226},\n  numpages = {2},\n  url = {http://doi.acm.org/10.1145/2568088.2576092},\n  doi = {10.1145/2568088.2576092},\n  acmid = {2576092},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  keywords = {load intensity variation, load profile, meta-modeling, model extraction, open workloads, transformation},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/211},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/211.pdf},\n  year = {2014}\n}\n
\n\n','{Modern software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. In this paper, we present LIMBO - an Eclipse-based tool for modeling variable load intensity profiles based on the Descartes Load Intensity Model as an underlying modeling formalism.}','{LIMBO: A Tool For Modeling Variable Load Intensities}',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(212,'paper','WeHeGrKo2014-HotTopicsWS-ElaBench','inproceedings','@inproceedings{WeHeGrKo2014-HotTopicsWS-ElaBench,\n abstract = {{Auto-scaling features offered by today\'s cloud infrastructures provide increased flexibility especially for customers that experience high variations in the load intensity over time. However, auto-scaling features introduce new system quality attributes when considering their accuracy, timing, and boundaries. Therefore, distinguishing between different offerings has become a complex task, as it is not yet supported by reliable metrics and measurement approaches. In this paper, we discuss shortcomings of existing approaches for measuring and evaluating elastic behavior and propose a novel benchmark methodology specifically designed for evaluating the elasticity aspects of modern cloud platforms. The benchmark is based on open workloads with realistic load variation profiles that are calibrated to induce identical resource demand variations independent of the underlying hardware performance. Furthermore, we propose new metrics that capture the accuracy of resource allocations and de-allocations, as well as the timing aspects of an auto-scaling mechanism explicitly.}},\n author = {Andreas Weber and Nikolas Roman Herbst and Henning Groenda and Samuel Kounev},\n booktitle = {Proceedings of the 2nd International Workshop on Hot Topics in Cloud Service Scalability (HotTopiCS 2014), co-located with the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n day = {22},\n location = {Dublin, Ireland},\n month = {March},\n publisher = {ACM},\n keywords = {Demand, Elasticity, Load Profile, Resource, Supply},\n title = {{Towards a Resource Elasticity Benchmark for Cloud Environments}},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/212},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/212.pdf},\n series = {HotTopiCS \'14},\n year = {2014},\n isbn = {978-1-4503-3059-6},\n location = {Dublin, Ireland},\n pages = {5:1--5:8},\n articleno = {5},\n numpages = {8},\n url = {http://doi.acm.org/10.1145/2649563.2649571},\n doi = {10.1145/2649563.2649571},\n acmid = {2649571},\n publisher = {ACM},\n address = {New York, NY, USA},\n keywords = {Demand, Elasticity, Load Profile, Resource, Supply},\n}\n\n','\n\nAndreas Weber, Nikolas Roman Herbst, Henning Groenda, and Samuel Kounev.\nTowards a Resource Elasticity Benchmark for Cloud Environments.\nIn Proceedings of the 2nd International Workshop on Hot Topics\nin Cloud Service Scalability (HotTopiCS 2014), co-located with the 5th\nACM/SPEC International Conference on Performance Engineering (ICPE 2014),\nDublin, Ireland, March 22, 2014, HotTopiCS \'14, pages 5:1-5:8. ACM, New\nYork, NY, USA.\nMarch 2014.\n[ bib | DOI | slides | http | .pdf | Abstract  ] 
\n@inproceedings{WeHeGrKo2014-HotTopicsWS-ElaBench,\nabstract = {{Auto-scaling features offered by today\'s cloud infrastructures provide increased flexibility especially for customers that experience high variations in the load intensity over time. However, auto-scaling features introduce new system quality attributes when considering their accuracy, timing, and boundaries. Therefore, distinguishing between different offerings has become a complex task, as it is not yet supported by reliable metrics and measurement approaches. In this paper, we discuss shortcomings of existing approaches for measuring and evaluating elastic behavior and propose a novel benchmark methodology specifically designed for evaluating the elasticity aspects of modern cloud platforms. The benchmark is based on open workloads with realistic load variation profiles that are calibrated to induce identical resource demand variations independent of the underlying hardware performance. Furthermore, we propose new metrics that capture the accuracy of resource allocations and de-allocations, as well as the timing aspects of an auto-scaling mechanism explicitly.}},\nauthor = {Andreas Weber and Nikolas Roman Herbst and Henning Groenda and Samuel Kounev},\nbooktitle = {Proceedings of the 2nd International Workshop on Hot Topics in Cloud Service Scalability (HotTopiCS 2014), co-located with the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\nday = {22},\nlocation = {Dublin, Ireland},\nmonth = {March},\npublisher = {ACM},\nkeywords = {Demand, Elasticity, Load Profile, Resource, Supply},\ntitle = {{Towards a Resource Elasticity Benchmark for Cloud Environments}},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/212},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/212.pdf},\nseries = {HotTopiCS \'14},\nyear = {2014},\nisbn = {978-1-4503-3059-6},\nlocation = {Dublin, Ireland},\npages = {5:1--5:8},\narticleno = {5},\nnumpages = {8},\nurl = {http://doi.acm.org/10.1145/2649563.2649571},\ndoi = {10.1145/2649563.2649571},\nacmid = {2649571},\npublisher = {ACM},\naddress = {New York, NY, USA},\nkeywords = {Demand, Elasticity, Load Profile, Resource, Supply}\n}\n
\n
\nAuto-scaling features offered by today\'s cloud infrastructures provide increased flexibility especially for customers that experience high variations in the load intensity over time. However, auto-scaling features introduce new system quality attributes when considering their accuracy, timing, and boundaries. Therefore, distinguishing between different offerings has become a complex task, as it is not yet supported by reliable metrics and measurement approaches. In this paper, we discuss shortcomings of existing approaches for measuring and evaluating elastic behavior and propose a novel benchmark methodology specifically designed for evaluating the elasticity aspects of modern cloud platforms. The benchmark is based on open workloads with realistic load variation profiles that are calibrated to induce identical resource demand variations independent of the underlying hardware performance. Furthermore, we propose new metrics that capture the accuracy of resource allocations and de-allocations, as well as the timing aspects of an auto-scaling mechanism explicitly.\n
\n','
\n@inproceedings{WeHeGrKo2014-HotTopicsWS-ElaBench,\n  abstract = {{Auto-scaling features offered by today\'s cloud infrastructures provide increased flexibility especially for customers that experience high variations in the load intensity over time. However, auto-scaling features introduce new system quality attributes when considering their accuracy, timing, and boundaries. Therefore, distinguishing between different offerings has become a complex task, as it is not yet supported by reliable metrics and measurement approaches. In this paper, we discuss shortcomings of existing approaches for measuring and evaluating elastic behavior and propose a novel benchmark methodology specifically designed for evaluating the elasticity aspects of modern cloud platforms. The benchmark is based on open workloads with realistic load variation profiles that are calibrated to induce identical resource demand variations independent of the underlying hardware performance. Furthermore, we propose new metrics that capture the accuracy of resource allocations and de-allocations, as well as the timing aspects of an auto-scaling mechanism explicitly.}},\n  author = {Andreas Weber and Nikolas Roman Herbst and Henning Groenda and Samuel Kounev},\n  booktitle = {Proceedings of the 2nd International Workshop on Hot Topics in Cloud Service Scalability (HotTopiCS 2014), co-located with the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n  day = {22},\n  location = {Dublin, Ireland},\n  month = {March},\n  publisher = {ACM},\n  keywords = {Demand, Elasticity, Load Profile, Resource, Supply},\n  title = {{Towards a Resource Elasticity Benchmark for Cloud Environments}},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/212},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/212.pdf},\n  series = {HotTopiCS \'14},\n  year = {2014},\n  isbn = {978-1-4503-3059-6},\n  location = {Dublin, Ireland},\n  pages = {5:1--5:8},\n  articleno = {5},\n  numpages = {8},\n  url = {http://doi.acm.org/10.1145/2649563.2649571},\n  doi = {10.1145/2649563.2649571},\n  acmid = {2649571},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  keywords = {Demand, Elasticity, Load Profile, Resource, Supply}\n}\n
\n\n','{Auto-scaling features offered by today\'s cloud infrastructures provide increased flexibility especially for customers that experience high variations in the load intensity over time. However, auto-scaling features introduce new system quality attributes when considering their accuracy, timing, and boundaries. Therefore, distinguishing between different offerings has become a complex task, as it is not yet supported by reliable metrics and measurement approaches. In this paper, we discuss shortcomings of existing approaches for measuring and evaluating elastic behavior and propose a novel benchmark methodology specifically designed for evaluating the elasticity aspects of modern cloud platforms. The benchmark is based on open workloads with realistic load variation profiles that are calibrated to induce identical resource demand variations independent of the underlying hardware performance. Furthermore, we propose new metrics that capture the accuracy of resource allocations and de-allocations, as well as the timing aspects of an auto-scaling mechanism explicitly.}','{Towards a Resource Elasticity Benchmark for Cloud Environments}',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(219,'paper','Hu2009-UKA-PerfMod','mastersthesis','@mastersthesis{Hu2009-UKA-PerfMod,\n address = {Karlsruhe, Germany},\n author = {Nikolaus Huber},\n month = {April},\n note = {GFFT Prize},\n school = {Universit{\\\"{a}}t Karlsruhe (TH)},\n title = {{Performance Modeling of Storage Virtualization}},\n year = {2009},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/219.pdf},\n}\n\n','\n\nNikolaus Huber.\nPerformance Modeling of Storage Virtualization.\nMaster\'s thesis, Universität Karlsruhe (TH), Karlsruhe,\nGermany, April 2009.\nGFFT Prize.\n[ bib | .pdf  ] 
\n@mastersthesis{Hu2009-UKA-PerfMod,\naddress = {Karlsruhe, Germany},\nauthor = {Nikolaus Huber},\nmonth = {April},\nnote = {GFFT Prize},\nschool = {Universit{\\\"{a}}t Karlsruhe (TH)},\ntitle = {{Performance Modeling of Storage Virtualization}},\nyear = {2009},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/219.pdf}\n}\n
\n
\n','
\n@mastersthesis{Hu2009-UKA-PerfMod,\n  address = {Karlsruhe, Germany},\n  author = {Nikolaus Huber},\n  month = {April},\n  note = {GFFT Prize},\n  school = {Universit{\\\"{a}}t Karlsruhe (TH)},\n  title = {{Performance Modeling of Storage Virtualization}},\n  year = {2009},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/219.pdf}\n}\n
\n\n',NULL,'{Performance Modeling of Storage Virtualization}',0,4,2009,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(220,'paper','HuBeRaScRe2010-ICSE-PerfMod','inproceedings','@inproceedings{HuBeRaScRe2010-ICSE-PerfMod,\n abstract = {In software engineering, performance and the integration of performance analysis methodologies gain increasing importance, especially for complex systems. Well-developed methods and tools can predict non-functional performance properties like response time or resource utilization in early design stages, thus promising time and cost savings. However, as performance modeling and performance prediction is still a young research area, the methods are not yet well-established and in wide-spread industrial use. This work is a case study of the applicability of the Palladio Component Model as a performance prediction method in an industrial environment. We model and analyze different design alternatives for storage virtualization on an IBM (Trademark of IBM in USA and/or other countries) system. The model calibration, validation and evaluation is based on data measured on a System z9 (Trademark of IBM in USA and/or other countries) as a proof of concept. The results show that performance predictions can identify performance bottlenecks and evaluate design alternatives in early stages of system development. The experiences gained were that performance modeling helps to understand and analyze a system. Hence, this case study substantiates that performance modeling is applicable in industry and a valuable method for evaluating design decisions.},\n address = {New York, NY, USA},\n author = {Nikolaus Huber and Steffen Becker and Christoph Rathfelder and Jochen Schweflinghaus and Ralf Reussner},\n booktitle = {ACM/IEEE 32nd International Conference on Software Engineering (ICSE 2010), Software Engineering in Practice Track},\n day = {2--8},\n doi = {10.1145/1810295.1810297},\n isbn = {978-1-60558-719-6},\n location = {Cape Town, South Africa},\n month = {May},\n note = {Acceptance Rate (Full Paper): 23\\% (16/71)},\n pages = {1--10},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/220.pdf},\n publisher = {ACM},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/220},\n title = {{Performance Modeling in Industry: A Case Study on Storage Virtualization}},\n year = {2010},\n}\n\n','\n\nNikolaus Huber, Steffen Becker, Christoph Rathfelder, Jochen Schweflinghaus,\nand Ralf Reussner.\nPerformance Modeling in Industry: A Case Study on Storage\nVirtualization.\nIn ACM/IEEE 32nd International Conference on Software\nEngineering (ICSE 2010), Software Engineering in Practice Track, Cape Town,\nSouth Africa, May 2-8, 2010, pages 1-10. ACM, New York, NY, USA.\nMay 2010, Acceptance Rate (Full Paper): 23% (16/71).\n[ bib | DOI | slides | .pdf | Abstract  ] 
\n@inproceedings{HuBeRaScRe2010-ICSE-PerfMod,\nabstract = {In software engineering, performance and the integration of performance analysis methodologies gain increasing importance, especially for complex systems. Well-developed methods and tools can predict non-functional performance properties like response time or resource utilization in early design stages, thus promising time and cost savings. However, as performance modeling and performance prediction is still a young research area, the methods are not yet well-established and in wide-spread industrial use. This work is a case study of the applicability of the Palladio Component Model as a performance prediction method in an industrial environment. We model and analyze different design alternatives for storage virtualization on an IBM (Trademark of IBM in USA and/or other countries) system. The model calibration, validation and evaluation is based on data measured on a System z9 (Trademark of IBM in USA and/or other countries) as a proof of concept. The results show that performance predictions can identify performance bottlenecks and evaluate design alternatives in early stages of system development. The experiences gained were that performance modeling helps to understand and analyze a system. Hence, this case study substantiates that performance modeling is applicable in industry and a valuable method for evaluating design decisions.},\naddress = {New York, NY, USA},\nauthor = {Nikolaus Huber and Steffen Becker and Christoph Rathfelder and Jochen Schweflinghaus and Ralf Reussner},\nbooktitle = {ACM/IEEE 32nd International Conference on Software Engineering (ICSE 2010), Software Engineering in Practice Track},\nday = {2--8},\ndoi = {10.1145/1810295.1810297},\nisbn = {978-1-60558-719-6},\nlocation = {Cape Town, South Africa},\nmonth = {May},\nnote = {Acceptance Rate (Full Paper): 23\\% (16/71)},\npages = {1--10},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/220.pdf},\npublisher = {ACM},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/220},\ntitle = {{Performance Modeling in Industry: A Case Study on Storage Virtualization}},\nyear = {2010}\n}\n
\n
\nIn software engineering, performance and the integration of performance analysis methodologies gain increasing importance, especially for complex systems. Well-developed methods and tools can predict non-functional performance properties like response time or resource utilization in early design stages, thus promising time and cost savings. However, as performance modeling and performance prediction is still a young research area, the methods are not yet well-established and in wide-spread industrial use. This work is a case study of the applicability of the Palladio Component Model as a performance prediction method in an industrial environment. We model and analyze different design alternatives for storage virtualization on an IBM (Trademark of IBM in USA and/or other countries) system. The model calibration, validation and evaluation is based on data measured on a System z9 (Trademark of IBM in USA and/or other countries) as a proof of concept. The results show that performance predictions can identify performance bottlenecks and evaluate design alternatives in early stages of system development. The experiences gained were that performance modeling helps to understand and analyze a system. Hence, this case study substantiates that performance modeling is applicable in industry and a valuable method for evaluating design decisions.\n
\n','
\n@inproceedings{HuBeRaScRe2010-ICSE-PerfMod,\n  abstract = {In software engineering, performance and the integration of performance analysis methodologies gain increasing importance, especially for complex systems. Well-developed methods and tools can predict non-functional performance properties like response time or resource utilization in early design stages, thus promising time and cost savings. However, as performance modeling and performance prediction is still a young research area, the methods are not yet well-established and in wide-spread industrial use. This work is a case study of the applicability of the Palladio Component Model as a performance prediction method in an industrial environment. We model and analyze different design alternatives for storage virtualization on an IBM (Trademark of IBM in USA and/or other countries) system. The model calibration, validation and evaluation is based on data measured on a System z9 (Trademark of IBM in USA and/or other countries) as a proof of concept. The results show that performance predictions can identify performance bottlenecks and evaluate design alternatives in early stages of system development. The experiences gained were that performance modeling helps to understand and analyze a system. Hence, this case study substantiates that performance modeling is applicable in industry and a valuable method for evaluating design decisions.},\n  address = {New York, NY, USA},\n  author = {Nikolaus Huber and Steffen Becker and Christoph Rathfelder and Jochen Schweflinghaus and Ralf Reussner},\n  booktitle = {ACM/IEEE 32nd International Conference on Software Engineering (ICSE 2010), Software Engineering in Practice Track},\n  day = {2--8},\n  doi = {10.1145/1810295.1810297},\n  isbn = {978-1-60558-719-6},\n  location = {Cape Town, South Africa},\n  month = {May},\n  note = {Acceptance Rate (Full Paper): 23\\% (16/71)},\n  pages = {1--10},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/220.pdf},\n  publisher = {ACM},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/220},\n  title = {{Performance Modeling in Industry: A Case Study on Storage Virtualization}},\n  year = {2010}\n}\n
\n\n','In software engineering, performance and the integration of performance analysis methodologies gain increasing importance, especially for complex systems. Well-developed methods and tools can predict non-functional performance properties like response time or resource utilization in early design stages, thus promising time and cost savings. However, as performance modeling and performance prediction is still a young research area, the methods are not yet well-established and in wide-spread industrial use. This work is a case study of the applicability of the Palladio Component Model as a performance prediction method in an industrial environment. We model and analyze different design alternatives for storage virtualization on an IBM (Trademark of IBM in USA and/or other countries) system. The model calibration, validation and evaluation is based on data measured on a System z9 (Trademark of IBM in USA and/or other countries) as a proof of concept. The results show that performance predictions can identify performance bottlenecks and evaluate design alternatives in early stages of system development. The experiences gained were that performance modeling helps to understand and analyze a system. Hence, this case study substantiates that performance modeling is applicable in industry and a valuable method for evaluating design decisions.','{Performance Modeling in Industry: A Case Study on Storage Virtualization}',0,5,2010,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(221,'paper','HuBrDiJoKo2012-ResBook-CloudCaseStudies','incollection','@incollection{HuBrDiJoKo2012-ResBook-CloudCaseStudies,\n address = {Berlin, Heidelberg},\n author = {Nikolaus Huber and Fabian Brosig and N. Dingle and K. Joshi and Samuel Kounev},\n booktitle = {{Resilience Assessment and Evaluation of Computing Systems}},\n editor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\n isbn = {978-3-642-29031-2},\n note = {ISBN: 978-3-642-29031-2},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/221.pdf},\n publisher = {Springer-Verlag},\n series = {XVIII},\n title = {{Providing Dependability and Performance in the Cloud: Case Studies}},\n url = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\n year = {2012},\n}\n\n','\n\nNikolaus Huber, Fabian Brosig, N. Dingle, K. Joshi, and Samuel Kounev.\nProviding Dependability and Performance in the Cloud: Case Studies.\nIn Resilience Assessment and Evaluation of Computing Systems,\nK. Wolter, A. Avritzer, M. Vieira, and A. van Moorsel, editors, XVIII.\nSpringer-Verlag, Berlin, Heidelberg, 2012.\nISBN: 978-3-642-29031-2.\n[ bib | http | .pdf  ] 
\n@incollection{HuBrDiJoKo2012-ResBook-CloudCaseStudies,\naddress = {Berlin, Heidelberg},\nauthor = {Nikolaus Huber and Fabian Brosig and N. Dingle and K. Joshi and Samuel Kounev},\nbooktitle = {{Resilience Assessment and Evaluation of Computing Systems}},\neditor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\nisbn = {978-3-642-29031-2},\nnote = {ISBN: 978-3-642-29031-2},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/221.pdf},\npublisher = {Springer-Verlag},\nseries = {XVIII},\ntitle = {{Providing Dependability and Performance in the Cloud: Case Studies}},\nurl = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\nyear = {2012}\n}\n
\n
\n','
\n@incollection{HuBrDiJoKo2012-ResBook-CloudCaseStudies,\n  address = {Berlin, Heidelberg},\n  author = {Nikolaus Huber and Fabian Brosig and N. Dingle and K. Joshi and Samuel Kounev},\n  booktitle = {{Resilience Assessment and Evaluation of Computing Systems}},\n  editor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\n  isbn = {978-3-642-29031-2},\n  note = {ISBN: 978-3-642-29031-2},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/221.pdf},\n  publisher = {Springer-Verlag},\n  series = {XVIII},\n  title = {{Providing Dependability and Performance in the Cloud: Case Studies}},\n  url = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\n  year = {2012}\n}\n
\n\n',NULL,'{Providing Dependability and Performance in the Cloud: Case Studies}',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(222,'paper','HuBrKo2012-QoSA-ModelingVirtResLandscapes','inproceedings','@inproceedings{HuBrKo2012-QoSA-ModelingVirtResLandscapes,\n abstract = {Modern data centers are subject to an increasing demand for flexibility. Increased flexibility and dynamics, however, also result in a higher system complexity. This complexity carries on to run-time resource management for Quality-of-Service (QoS) enforcement, rendering design-time approaches for QoS assurance inadequate. In this paper, we present a set of novel meta-models that can be used to describe the resource landscape, the architecture and resource layers of dynamic virtualized data center infrastructures, as well as their run-time adaptation and resource management aspects. With these meta-models we introduce new modeling concepts to improve model-based run-time QoS assurance. We evaluate our meta-models by modeling a representative virtualized service infrastructure and using these model instances for run-time resource allocation. The results demonstrate the benefits of the new meta-models and show how they can be used to improve model-based system adaptation and run-time resource management in dynamic virtualized data centers.},\n address = {New York, NY, USA},\n author = {Nikolaus Huber and Fabian Brosig and Samuel Kounev},\n booktitle = {Proceedings of the 8th ACM SIGSOFT International Conference on the Quality of Software Architectures (QoSA 2012)},\n day = {25--28},\n doi = {10.1145/2304696.2304711},\n isbn = {978-1-4503-1346-9},\n location = {Bertinoro, Italy},\n month = {June},\n note = {Acceptance Rate (Full Paper): 25.6\\%},\n pages = {81--90},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/222.pdf},\n publisher = {ACM},\n title = {{Modeling Dynamic Virtualized Resource Landscapes}},\n url = {http://qosa.ipd.kit.edu/qosa_2012/},\n year = {2012},\n}\n\n','\n\nNikolaus Huber, Fabian Brosig, and Samuel Kounev.\nModeling Dynamic Virtualized Resource Landscapes.\nIn Proceedings of the 8th ACM SIGSOFT International Conference\non the Quality of Software Architectures (QoSA 2012), Bertinoro, Italy, June\n25-28, 2012, pages 81-90. ACM, New York, NY, USA.\nJune 2012, Acceptance Rate (Full Paper): 25.6%.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{HuBrKo2012-QoSA-ModelingVirtResLandscapes,\nabstract = {Modern data centers are subject to an increasing demand for flexibility. Increased flexibility and dynamics, however, also result in a higher system complexity. This complexity carries on to run-time resource management for Quality-of-Service (QoS) enforcement, rendering design-time approaches for QoS assurance inadequate. In this paper, we present a set of novel meta-models that can be used to describe the resource landscape, the architecture and resource layers of dynamic virtualized data center infrastructures, as well as their run-time adaptation and resource management aspects. With these meta-models we introduce new modeling concepts to improve model-based run-time QoS assurance. We evaluate our meta-models by modeling a representative virtualized service infrastructure and using these model instances for run-time resource allocation. The results demonstrate the benefits of the new meta-models and show how they can be used to improve model-based system adaptation and run-time resource management in dynamic virtualized data centers.},\naddress = {New York, NY, USA},\nauthor = {Nikolaus Huber and Fabian Brosig and Samuel Kounev},\nbooktitle = {Proceedings of the 8th ACM SIGSOFT International Conference on the Quality of Software Architectures (QoSA 2012)},\nday = {25--28},\ndoi = {10.1145/2304696.2304711},\nisbn = {978-1-4503-1346-9},\nlocation = {Bertinoro, Italy},\nmonth = {June},\nnote = {Acceptance Rate (Full Paper): 25.6\\%},\npages = {81--90},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/222.pdf},\npublisher = {ACM},\ntitle = {{Modeling Dynamic Virtualized Resource Landscapes}},\nurl = {http://qosa.ipd.kit.edu/qosa_2012/},\nyear = {2012}\n}\n
\n
\nModern data centers are subject to an increasing demand for flexibility. Increased flexibility and dynamics, however, also result in a higher system complexity. This complexity carries on to run-time resource management for Quality-of-Service (QoS) enforcement, rendering design-time approaches for QoS assurance inadequate. In this paper, we present a set of novel meta-models that can be used to describe the resource landscape, the architecture and resource layers of dynamic virtualized data center infrastructures, as well as their run-time adaptation and resource management aspects. With these meta-models we introduce new modeling concepts to improve model-based run-time QoS assurance. We evaluate our meta-models by modeling a representative virtualized service infrastructure and using these model instances for run-time resource allocation. The results demonstrate the benefits of the new meta-models and show how they can be used to improve model-based system adaptation and run-time resource management in dynamic virtualized data centers.\n
\n','
\n@inproceedings{HuBrKo2012-QoSA-ModelingVirtResLandscapes,\n  abstract = {Modern data centers are subject to an increasing demand for flexibility. Increased flexibility and dynamics, however, also result in a higher system complexity. This complexity carries on to run-time resource management for Quality-of-Service (QoS) enforcement, rendering design-time approaches for QoS assurance inadequate. In this paper, we present a set of novel meta-models that can be used to describe the resource landscape, the architecture and resource layers of dynamic virtualized data center infrastructures, as well as their run-time adaptation and resource management aspects. With these meta-models we introduce new modeling concepts to improve model-based run-time QoS assurance. We evaluate our meta-models by modeling a representative virtualized service infrastructure and using these model instances for run-time resource allocation. The results demonstrate the benefits of the new meta-models and show how they can be used to improve model-based system adaptation and run-time resource management in dynamic virtualized data centers.},\n  address = {New York, NY, USA},\n  author = {Nikolaus Huber and Fabian Brosig and Samuel Kounev},\n  booktitle = {Proceedings of the 8th ACM SIGSOFT International Conference on the Quality of Software Architectures (QoSA 2012)},\n  day = {25--28},\n  doi = {10.1145/2304696.2304711},\n  isbn = {978-1-4503-1346-9},\n  location = {Bertinoro, Italy},\n  month = {June},\n  note = {Acceptance Rate (Full Paper): 25.6\\%},\n  pages = {81--90},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/222.pdf},\n  publisher = {ACM},\n  title = {{Modeling Dynamic Virtualized Resource Landscapes}},\n  url = {http://qosa.ipd.kit.edu/qosa_2012/},\n  year = {2012}\n}\n
\n\n','Modern data centers are subject to an increasing demand for flexibility. Increased flexibility and dynamics, however, also result in a higher system complexity. This complexity carries on to run-time resource management for Quality-of-Service (QoS) enforcement, rendering design-time approaches for QoS assurance inadequate. In this paper, we present a set of novel meta-models that can be used to describe the resource landscape, the architecture and resource layers of dynamic virtualized data center infrastructures, as well as their run-time adaptation and resource management aspects. With these meta-models we introduce new modeling concepts to improve model-based run-time QoS assurance. We evaluate our meta-models by modeling a representative virtualized service infrastructure and using these model instances for run-time resource allocation. The results demonstrate the benefits of the new meta-models and show how they can be used to improve model-based system adaptation and run-time resource management in dynamic virtualized data centers.','{Modeling Dynamic Virtualized Resource Landscapes}',0,6,2012,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(223,'paper','HuBrKo2011-SEAMS-ResAlloc','inproceedings','@inproceedings{HuBrKo2011-SEAMS-ResAlloc,\n abstract = {The adoption of virtualization and Cloud Computing technologies promises a number of benefits such as increased flexibility, better energy efficiency and lower operating costs for IT systems. However, highly variable workloads make it challenging to provide quality-of-service guarantees while at the same time ensuring efficient resource utilization. To avoid violations of service-level agreements (SLAs) or inefficient resource usage, resource allocations have to be adapted continuously during operation to reflect changes in application workloads. In this paper, we present a novel approach to self-adaptive resource allocation in virtualized environments based on online architecture-level performance models. We present a detailed case study of a representative enterprise application, the new SPECjEnterprise2010 benchmark, deployed in a virtualized cluster environment. The case study serves as a proof-of-concept demonstrating the effectiveness and practical applicability of our approach.},\n address = {New York, NY, USA},\n author = {Nikolaus Huber and Fabian Brosig and Samuel Kounev},\n booktitle = {6th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2011)},\n day = {23--24},\n doi = {10.1145/1988008.1988021},\n isbn = {978-1-4503-0575-4},\n location = {Waikiki, Honolulu, HI, USA},\n month = {May},\n note = {Acceptance Rate (Full Paper): 27\\% (21/76)},\n pages = {90--99},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/223.pdf},\n publisher = {ACM},\n title = {{Model-based Self-Adaptive Resource Allocation in Virtualized Environments}},\n url = {http://dl.acm.org/authorize?425581},\n year = {2011},\n}\n\n','\n\nNikolaus Huber, Fabian Brosig, and Samuel Kounev.\nModel-based Self-Adaptive Resource Allocation in Virtualized\nEnvironments.\nIn 6th International Symposium on Software Engineering for\nAdaptive and Self-Managing Systems (SEAMS 2011), Waikiki, Honolulu, HI, USA,\nMay 23-24, 2011, pages 90-99. ACM, New York, NY, USA.\nMay 2011, Acceptance Rate (Full Paper): 27% (21/76).\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{HuBrKo2011-SEAMS-ResAlloc,\nabstract = {The adoption of virtualization and Cloud Computing technologies promises a number of benefits such as increased flexibility, better energy efficiency and lower operating costs for IT systems. However, highly variable workloads make it challenging to provide quality-of-service guarantees while at the same time ensuring efficient resource utilization. To avoid violations of service-level agreements (SLAs) or inefficient resource usage, resource allocations have to be adapted continuously during operation to reflect changes in application workloads. In this paper, we present a novel approach to self-adaptive resource allocation in virtualized environments based on online architecture-level performance models. We present a detailed case study of a representative enterprise application, the new SPECjEnterprise2010 benchmark, deployed in a virtualized cluster environment. The case study serves as a proof-of-concept demonstrating the effectiveness and practical applicability of our approach.},\naddress = {New York, NY, USA},\nauthor = {Nikolaus Huber and Fabian Brosig and Samuel Kounev},\nbooktitle = {6th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2011)},\nday = {23--24},\ndoi = {10.1145/1988008.1988021},\nisbn = {978-1-4503-0575-4},\nlocation = {Waikiki, Honolulu, HI, USA},\nmonth = {May},\nnote = {Acceptance Rate (Full Paper): 27\\% (21/76)},\npages = {90--99},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/223.pdf},\npublisher = {ACM},\ntitle = {{Model-based Self-Adaptive Resource Allocation in Virtualized Environments}},\nurl = {http://dl.acm.org/authorize?425581},\nyear = {2011}\n}\n
\n
\nThe adoption of virtualization and Cloud Computing technologies promises a number of benefits such as increased flexibility, better energy efficiency and lower operating costs for IT systems. However, highly variable workloads make it challenging to provide quality-of-service guarantees while at the same time ensuring efficient resource utilization. To avoid violations of service-level agreements (SLAs) or inefficient resource usage, resource allocations have to be adapted continuously during operation to reflect changes in application workloads. In this paper, we present a novel approach to self-adaptive resource allocation in virtualized environments based on online architecture-level performance models. We present a detailed case study of a representative enterprise application, the new SPECjEnterprise2010 benchmark, deployed in a virtualized cluster environment. The case study serves as a proof-of-concept demonstrating the effectiveness and practical applicability of our approach.\n
\n','
\n@inproceedings{HuBrKo2011-SEAMS-ResAlloc,\n  abstract = {The adoption of virtualization and Cloud Computing technologies promises a number of benefits such as increased flexibility, better energy efficiency and lower operating costs for IT systems. However, highly variable workloads make it challenging to provide quality-of-service guarantees while at the same time ensuring efficient resource utilization. To avoid violations of service-level agreements (SLAs) or inefficient resource usage, resource allocations have to be adapted continuously during operation to reflect changes in application workloads. In this paper, we present a novel approach to self-adaptive resource allocation in virtualized environments based on online architecture-level performance models. We present a detailed case study of a representative enterprise application, the new SPECjEnterprise2010 benchmark, deployed in a virtualized cluster environment. The case study serves as a proof-of-concept demonstrating the effectiveness and practical applicability of our approach.},\n  address = {New York, NY, USA},\n  author = {Nikolaus Huber and Fabian Brosig and Samuel Kounev},\n  booktitle = {6th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2011)},\n  day = {23--24},\n  doi = {10.1145/1988008.1988021},\n  isbn = {978-1-4503-0575-4},\n  location = {Waikiki, Honolulu, HI, USA},\n  month = {May},\n  note = {Acceptance Rate (Full Paper): 27\\% (21/76)},\n  pages = {90--99},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/223.pdf},\n  publisher = {ACM},\n  title = {{Model-based Self-Adaptive Resource Allocation in Virtualized Environments}},\n  url = {http://dl.acm.org/authorize?425581},\n  year = {2011}\n}\n
\n\n','The adoption of virtualization and Cloud Computing technologies promises a number of benefits such as increased flexibility, better energy efficiency and lower operating costs for IT systems. However, highly variable workloads make it challenging to provide quality-of-service guarantees while at the same time ensuring efficient resource utilization. To avoid violations of service-level agreements (SLAs) or inefficient resource usage, resource allocations have to be adapted continuously during operation to reflect changes in application workloads. In this paper, we present a novel approach to self-adaptive resource allocation in virtualized environments based on online architecture-level performance models. We present a detailed case study of a representative enterprise application, the new SPECjEnterprise2010 benchmark, deployed in a virtualized cluster environment. The case study serves as a proof-of-concept demonstrating the effectiveness and practical applicability of our approach.','{Model-based Self-Adaptive Resource Allocation in Virtualized Environments}',0,5,2011,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(224,'paper','HuHoKoBrKo2012-ICEBE-STA','inproceedings','@inproceedings{HuHoKoBrKo2012-ICEBE-STA,\n abstract = {Modern virtualized system environments usually host diverse applications of different parties and aim at utilizing resources efficiently while ensuring that quality-of-service requirements are continuously satisfied. In such scenarios, complex adaptations to changes in the system environment are still largely performed manually by humans. Over the past decade, autonomic self-adaptation techniques aiming to minimize human intervention have become increasingly popular. However, given that adaptation processes are usually highly system specific, it is a challenge to abstract from system details enabling the reuse of adaptation strategies. In this paper, we propose a novel modeling language (meta-model) providing means to describe system adaptation processes at the system architecture level in a generic, human-understandable and reusable way. We apply our approach to three different realistic contexts (dynamic resource allocation, software architecture optimization, and run-time adaptation planning) showing how the gap between complex manual adaptations and their autonomous execution can be closed by using a holistic model-based approach.},\n address = {Los Alamitos, CA, USA},\n author = {Nikolaus Huber and Andr\\\'{e} van Hoorn and Anne Koziolek and Fabian Brosig and Samuel Kounev},\n booktitle = {Proceedings of the 9th IEEE International Conference on e-Business Engineering (ICEBE 2012)},\n day = {9--11},\n doi = {http://doi.ieeecomputersociety.org/10.1109/ICEBE.2012.21},\n isbn = {978-1-4673-2601-8},\n location = {Hangzhou, China},\n month = {September},\n note = {Acceptance Rate (Full Paper): 19.7\\% (26/132)},\n pages = {70--77},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/224.pdf},\n publisher = {IEEE Computer Society},\n title = {{S/T/A: Meta-Modeling Run-Time Adaptation in Component-Based System Architectures}},\n url = {http://conferences.computer.org/icebe/2012/index.htm},\n year = {2012},\n}\n\n','\n\nNikolaus Huber, André van Hoorn, Anne Koziolek, Fabian Brosig, and Samuel\nKounev.\nS/T/A: Meta-Modeling Run-Time Adaptation in Component-Based System\nArchitectures.\nIn Proceedings of the 9th IEEE International Conference on\ne-Business Engineering (ICEBE 2012), Hangzhou, China, September 9-11, 2012,\npages 70-77. IEEE Computer Society, Los Alamitos, CA, USA.\nSeptember 2012, Acceptance Rate (Full Paper): 19.7% (26/132).\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{HuHoKoBrKo2012-ICEBE-STA,\nabstract = {Modern virtualized system environments usually host diverse applications of different parties and aim at utilizing resources efficiently while ensuring that quality-of-service requirements are continuously satisfied. In such scenarios, complex adaptations to changes in the system environment are still largely performed manually by humans. Over the past decade, autonomic self-adaptation techniques aiming to minimize human intervention have become increasingly popular. However, given that adaptation processes are usually highly system specific, it is a challenge to abstract from system details enabling the reuse of adaptation strategies. In this paper, we propose a novel modeling language (meta-model) providing means to describe system adaptation processes at the system architecture level in a generic, human-understandable and reusable way. We apply our approach to three different realistic contexts (dynamic resource allocation, software architecture optimization, and run-time adaptation planning) showing how the gap between complex manual adaptations and their autonomous execution can be closed by using a holistic model-based approach.},\naddress = {Los Alamitos, CA, USA},\nauthor = {Nikolaus Huber and Andr\\\'{e} van Hoorn and Anne Koziolek and Fabian Brosig and Samuel Kounev},\nbooktitle = {Proceedings of the 9th IEEE International Conference on e-Business Engineering (ICEBE 2012)},\nday = {9--11},\ndoi = {http://doi.ieeecomputersociety.org/10.1109/ICEBE.2012.21},\nisbn = {978-1-4673-2601-8},\nlocation = {Hangzhou, China},\nmonth = {September},\nnote = {Acceptance Rate (Full Paper): 19.7\\% (26/132)},\npages = {70--77},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/224.pdf},\npublisher = {IEEE Computer Society},\ntitle = {{S/T/A: Meta-Modeling Run-Time Adaptation in Component-Based System Architectures}},\nurl = {http://conferences.computer.org/icebe/2012/index.htm},\nyear = {2012}\n}\n
\n
\nModern virtualized system environments usually host diverse applications of different parties and aim at utilizing resources efficiently while ensuring that quality-of-service requirements are continuously satisfied. In such scenarios, complex adaptations to changes in the system environment are still largely performed manually by humans. Over the past decade, autonomic self-adaptation techniques aiming to minimize human intervention have become increasingly popular. However, given that adaptation processes are usually highly system specific, it is a challenge to abstract from system details enabling the reuse of adaptation strategies. In this paper, we propose a novel modeling language (meta-model) providing means to describe system adaptation processes at the system architecture level in a generic, human-understandable and reusable way. We apply our approach to three different realistic contexts (dynamic resource allocation, software architecture optimization, and run-time adaptation planning) showing how the gap between complex manual adaptations and their autonomous execution can be closed by using a holistic model-based approach.\n
\n','
\n@inproceedings{HuHoKoBrKo2012-ICEBE-STA,\n  abstract = {Modern virtualized system environments usually host diverse applications of different parties and aim at utilizing resources efficiently while ensuring that quality-of-service requirements are continuously satisfied. In such scenarios, complex adaptations to changes in the system environment are still largely performed manually by humans. Over the past decade, autonomic self-adaptation techniques aiming to minimize human intervention have become increasingly popular. However, given that adaptation processes are usually highly system specific, it is a challenge to abstract from system details enabling the reuse of adaptation strategies. In this paper, we propose a novel modeling language (meta-model) providing means to describe system adaptation processes at the system architecture level in a generic, human-understandable and reusable way. We apply our approach to three different realistic contexts (dynamic resource allocation, software architecture optimization, and run-time adaptation planning) showing how the gap between complex manual adaptations and their autonomous execution can be closed by using a holistic model-based approach.},\n  address = {Los Alamitos, CA, USA},\n  author = {Nikolaus Huber and Andr\\\'{e} van Hoorn and Anne Koziolek and Fabian Brosig and Samuel Kounev},\n  booktitle = {Proceedings of the 9th IEEE International Conference on e-Business Engineering (ICEBE 2012)},\n  day = {9--11},\n  doi = {http://doi.ieeecomputersociety.org/10.1109/ICEBE.2012.21},\n  isbn = {978-1-4673-2601-8},\n  location = {Hangzhou, China},\n  month = {September},\n  note = {Acceptance Rate (Full Paper): 19.7\\% (26/132)},\n  pages = {70--77},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/224.pdf},\n  publisher = {IEEE Computer Society},\n  title = {{S/T/A: Meta-Modeling Run-Time Adaptation in Component-Based System Architectures}},\n  url = {http://conferences.computer.org/icebe/2012/index.htm},\n  year = {2012}\n}\n
\n\n','Modern virtualized system environments usually host diverse applications of different parties and aim at utilizing resources efficiently while ensuring that quality-of-service requirements are continuously satisfied. In such scenarios, complex adaptations to changes in the system environment are still largely performed manually by humans. Over the past decade, autonomic self-adaptation techniques aiming to minimize human intervention have become increasingly popular. However, given that adaptation processes are usually highly system specific, it is a challenge to abstract from system details enabling the reuse of adaptation strategies. In this paper, we propose a novel modeling language (meta-model) providing means to describe system adaptation processes at the system architecture level in a generic, human-understandable and reusable way. We apply our approach to three different realistic contexts (dynamic resource allocation, software architecture optimization, and run-time adaptation planning) showing how the gap between complex manual adaptations and their autonomous execution can be closed by using a holistic model-based approach.','{S/T/A: Meta-Modeling Run-Time Adaptation in Component-Based System Architectures}',0,9,2012,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(225,'paper','HuQuBrHaKo2012-CCaSS-ExpVirtPerfOverhead','incollection','@incollection{HuQuBrHaKo2012-CCaSS-ExpVirtPerfOverhead,\n address = {New York},\n author = {Huber, Nikolaus and von Quast, Marcel and Brosig, Fabian and Hauck, Michael and Kounev, Samuel},\n booktitle = {Cloud Computing and Services Science},\n doi = {10.1007/978-1-4614-2326-3_19},\n editor = {Ivanov, Ivan and van Sinderen, Marten and Shishkov, Boris},\n isbn = {978-1-4614-2325-6},\n language = {English},\n pages = {353--370},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/225.pdf},\n publisher = {Springer},\n series = {Service Science: Research and Innovations in the Service Economy},\n title = {{A Method for Experimental Analysis and Modeling of Virtualization Performance Overhead}},\n url = {http://dx.doi.org/10.1007/978-1-4614-2326-3_19},\n year = {2012},\n}\n\n','\n\nNikolaus Huber, Marcel von Quast, Fabian Brosig, Michael Hauck, and Samuel\nKounev.\nA Method for Experimental Analysis and Modeling of Virtualization\nPerformance Overhead.\nIn Cloud Computing and Services Science, Ivan Ivanov, Marten\nvan Sinderen, and Boris Shishkov, editors, Service Science: Research and\nInnovations in the Service Economy, pages 353-370. Springer, New York, 2012.\n[ bib | DOI | http | .pdf  ] 
\n@incollection{HuQuBrHaKo2012-CCaSS-ExpVirtPerfOverhead,\naddress = {New York},\nauthor = {Huber, Nikolaus and von Quast, Marcel and Brosig, Fabian and Hauck, Michael and Kounev, Samuel},\nbooktitle = {Cloud Computing and Services Science},\ndoi = {10.1007/978-1-4614-2326-3_19},\neditor = {Ivanov, Ivan and van Sinderen, Marten and Shishkov, Boris},\nisbn = {978-1-4614-2325-6},\nlanguage = {English},\npages = {353--370},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/225.pdf},\npublisher = {Springer},\nseries = {Service Science: Research and Innovations in the Service Economy},\ntitle = {{A Method for Experimental Analysis and Modeling of Virtualization Performance Overhead}},\nurl = {http://dx.doi.org/10.1007/978-1-4614-2326-3_19},\nyear = {2012}\n}\n
\n
\n','
\n@incollection{HuQuBrHaKo2012-CCaSS-ExpVirtPerfOverhead,\n  address = {New York},\n  author = {Huber, Nikolaus and von Quast, Marcel and Brosig, Fabian and Hauck, Michael and Kounev, Samuel},\n  booktitle = {Cloud Computing and Services Science},\n  doi = {10.1007/978-1-4614-2326-3_19},\n  editor = {Ivanov, Ivan and van Sinderen, Marten and Shishkov, Boris},\n  isbn = {978-1-4614-2325-6},\n  language = {English},\n  pages = {353--370},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/225.pdf},\n  publisher = {Springer},\n  series = {Service Science: Research and Innovations in the Service Economy},\n  title = {{A Method for Experimental Analysis and Modeling of Virtualization Performance Overhead}},\n  url = {http://dx.doi.org/10.1007/978-1-4614-2326-3_19},\n  year = {2012}\n}\n
\n\n',NULL,'{A Method for Experimental Analysis and Modeling of Virtualization Performance Overhead}',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(226,'paper','HuQuBrKo2010-DOA-AnalysisVirt','inproceedings','@inproceedings{HuQuBrKo2010-DOA-AnalysisVirt,\n abstract = {Nowadays, virtualization solutions are gaining increasing importance. By enabling the sharing of physical resources, thus making resource usage more efficient, they promise energy and cost savings. Additionally, virtualization is the key enabling technology for Cloud Computing and server consolidation. However, the effects of sharing resources on system performance are not yet well-understood. This makes performance prediction and performance management of services deployed in such dynamic systems very challenging. Because of the large variety of virtualization solutions, a generic approach to predict the performance influences of virtualization platforms is highly desirable. In this paper, we present a hierarchical model capturing the major performance-relevant factors of virtualization platforms. We then propose a general methodology to quantify the influence of the identified factors based on an empirical approach using benchmarks. Finally, we present a case study of Citrix XenServer 5.5, a state-of-the-art virtualization platform.},\n address = {Crete, Greece},\n author = {Nikolaus Huber and Marcel von Quast and Fabian Brosig and Samuel Kounev},\n booktitle = {The 12th International Symposium on Distributed Objects, Middleware, and Applications (DOA 2010)},\n day = {26},\n location = {Crete, Greece},\n month = {October},\n note = {Acceptance Rate (Full Paper): 33\\%},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/226.pdf},\n publisher = {Springer Verlag},\n title = {{Analysis of the Performance-Influencing Factors of Virtualization Platforms}},\n year = {2010},\n}\n\n','\n\nNikolaus Huber, Marcel von Quast, Fabian Brosig, and Samuel Kounev.\nAnalysis of the Performance-Influencing Factors of Virtualization\nPlatforms.\nIn The 12th International Symposium on Distributed Objects,\nMiddleware, and Applications (DOA 2010), Crete, Greece, October 26, 2010.\nSpringer Verlag, Crete, Greece.\nOctober 2010, Acceptance Rate (Full Paper): 33%.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{HuQuBrKo2010-DOA-AnalysisVirt,\nabstract = {Nowadays, virtualization solutions are gaining increasing importance. By enabling the sharing of physical resources, thus making resource usage more efficient, they promise energy and cost savings. Additionally, virtualization is the key enabling technology for Cloud Computing and server consolidation. However, the effects of sharing resources on system performance are not yet well-understood. This makes performance prediction and performance management of services deployed in such dynamic systems very challenging. Because of the large variety of virtualization solutions, a generic approach to predict the performance influences of virtualization platforms is highly desirable. In this paper, we present a hierarchical model capturing the major performance-relevant factors of virtualization platforms. We then propose a general methodology to quantify the influence of the identified factors based on an empirical approach using benchmarks. Finally, we present a case study of Citrix XenServer 5.5, a state-of-the-art virtualization platform.},\naddress = {Crete, Greece},\nauthor = {Nikolaus Huber and Marcel von Quast and Fabian Brosig and Samuel Kounev},\nbooktitle = {The 12th International Symposium on Distributed Objects, Middleware, and Applications (DOA 2010)},\nday = {26},\nlocation = {Crete, Greece},\nmonth = {October},\nnote = {Acceptance Rate (Full Paper): 33\\%},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/226.pdf},\npublisher = {Springer Verlag},\ntitle = {{Analysis of the Performance-Influencing Factors of Virtualization Platforms}},\nyear = {2010}\n}\n
\n
\nNowadays, virtualization solutions are gaining increasing importance. By enabling the sharing of physical resources, thus making resource usage more efficient, they promise energy and cost savings. Additionally, virtualization is the key enabling technology for Cloud Computing and server consolidation. However, the effects of sharing resources on system performance are not yet well-understood. This makes performance prediction and performance management of services deployed in such dynamic systems very challenging. Because of the large variety of virtualization solutions, a generic approach to predict the performance influences of virtualization platforms is highly desirable. In this paper, we present a hierarchical model capturing the major performance-relevant factors of virtualization platforms. We then propose a general methodology to quantify the influence of the identified factors based on an empirical approach using benchmarks. Finally, we present a case study of Citrix XenServer 5.5, a state-of-the-art virtualization platform.\n
\n','
\n@inproceedings{HuQuBrKo2010-DOA-AnalysisVirt,\n  abstract = {Nowadays, virtualization solutions are gaining increasing importance. By enabling the sharing of physical resources, thus making resource usage more efficient, they promise energy and cost savings. Additionally, virtualization is the key enabling technology for Cloud Computing and server consolidation. However, the effects of sharing resources on system performance are not yet well-understood. This makes performance prediction and performance management of services deployed in such dynamic systems very challenging. Because of the large variety of virtualization solutions, a generic approach to predict the performance influences of virtualization platforms is highly desirable. In this paper, we present a hierarchical model capturing the major performance-relevant factors of virtualization platforms. We then propose a general methodology to quantify the influence of the identified factors based on an empirical approach using benchmarks. Finally, we present a case study of Citrix XenServer 5.5, a state-of-the-art virtualization platform.},\n  address = {Crete, Greece},\n  author = {Nikolaus Huber and Marcel von Quast and Fabian Brosig and Samuel Kounev},\n  booktitle = {The 12th International Symposium on Distributed Objects, Middleware, and Applications (DOA 2010)},\n  day = {26},\n  location = {Crete, Greece},\n  month = {October},\n  note = {Acceptance Rate (Full Paper): 33\\%},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/226.pdf},\n  publisher = {Springer Verlag},\n  title = {{Analysis of the Performance-Influencing Factors of Virtualization Platforms}},\n  year = {2010}\n}\n
\n\n','Nowadays, virtualization solutions are gaining increasing importance. By enabling the sharing of physical resources, thus making resource usage more efficient, they promise energy and cost savings. Additionally, virtualization is the key enabling technology for Cloud Computing and server consolidation. However, the effects of sharing resources on system performance are not yet well-understood. This makes performance prediction and performance management of services deployed in such dynamic systems very challenging. Because of the large variety of virtualization solutions, a generic approach to predict the performance influences of virtualization platforms is highly desirable. In this paper, we present a hierarchical model capturing the major performance-relevant factors of virtualization platforms. We then propose a general methodology to quantify the influence of the identified factors based on an empirical approach using benchmarks. Finally, we present a case study of Citrix XenServer 5.5, a state-of-the-art virtualization platform.','{Analysis of the Performance-Influencing Factors of Virtualization Platforms}',0,10,2010,10,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(227,'paper','HuQuHaKo2011-CLOSER-ModelVirtOverhead','inproceedings','@inproceedings{HuQuHaKo2011-CLOSER-ModelVirtOverhead,\n abstract = {Due to trends like Cloud Computing and Green IT, virtualization technologies are gaining increasing importance. They promise energy and cost savings by sharing physical resources, thus making resource usage more efficient. However, resource sharing and other factors have direct effects on system performance, which are not yet well-understood. Hence, performance prediction and performance management of services deployed in virtualized environments like public and private Clouds is a challenging task. Because of the large variety of virtualization solutions, a generic approach to predict the performance overhead of services running on virtualization platforms is highly desirable. In this paper, we present experimental results on two popular state-of-the-art virtualization platforms, Citrix XenServer 5.5 and VMware ESX 4.0, as representatives of the two major hypervisor architectures. Based on these results, we propose a basic, generic performance prediction model for the two different types of hypervisor architectures. The target is to predict the performance overhead for executing services on virtualized platforms.},\n author = {Nikolaus Huber and Marcel von Quast and Michael Hauck and Samuel Kounev},\n booktitle = {Proceedings of the 1st International Conference on Cloud Computing and Services Science (CLOSER 2011)},\n day = {7--9},\n http = {http://closer.scitevents.org/},\n isbn = {978-989-8425-52-2},\n location = {Noordwijkerhout, The Netherlands},\n month = {May},\n note = {Acceptance Rate: 18/164 = 10.9\\%, Best Paper Award},\n pages = {563 -- 573},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/227.pdf},\n publisher = {SciTePress},\n title = {{E}valuating and {M}odeling {V}irtualization {P}erformance {O}verhead for {C}loud {E}nvironments},\n year = {2011},\n}\n\n','\n\nNikolaus Huber, Marcel von Quast, Michael Hauck, and Samuel Kounev.\nEvaluating and Modeling Virtualization Performance Overhead\nfor Cloud Environments.\nIn Proceedings of the 1st International Conference on Cloud\nComputing and Services Science (CLOSER 2011), Noordwijkerhout, The\nNetherlands, May 7-9, 2011, pages 563 - 573. SciTePress.\nMay 2011, Acceptance Rate: 18/164 = 10.9%, Best Paper Award.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{HuQuHaKo2011-CLOSER-ModelVirtOverhead,\nabstract = {Due to trends like Cloud Computing and Green IT, virtualization technologies are gaining increasing importance. They promise energy and cost savings by sharing physical resources, thus making resource usage more efficient. However, resource sharing and other factors have direct effects on system performance, which are not yet well-understood. Hence, performance prediction and performance management of services deployed in virtualized environments like public and private Clouds is a challenging task. Because of the large variety of virtualization solutions, a generic approach to predict the performance overhead of services running on virtualization platforms is highly desirable. In this paper, we present experimental results on two popular state-of-the-art virtualization platforms, Citrix XenServer 5.5 and VMware ESX 4.0, as representatives of the two major hypervisor architectures. Based on these results, we propose a basic, generic performance prediction model for the two different types of hypervisor architectures. The target is to predict the performance overhead for executing services on virtualized platforms.},\nauthor = {Nikolaus Huber and Marcel von Quast and Michael Hauck and Samuel Kounev},\nbooktitle = {Proceedings of the 1st International Conference on Cloud Computing and Services Science (CLOSER 2011)},\nday = {7--9},\nhttp = {http://closer.scitevents.org/},\nisbn = {978-989-8425-52-2},\nlocation = {Noordwijkerhout, The Netherlands},\nmonth = {May},\nnote = {Acceptance Rate: 18/164 = 10.9\\%, Best Paper Award},\npages = {563 -- 573},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/227.pdf},\npublisher = {SciTePress},\ntitle = {{E}valuating and {M}odeling {V}irtualization {P}erformance {O}verhead for {C}loud {E}nvironments},\nyear = {2011}\n}\n
\n
\nDue to trends like Cloud Computing and Green IT, virtualization technologies are gaining increasing importance. They promise energy and cost savings by sharing physical resources, thus making resource usage more efficient. However, resource sharing and other factors have direct effects on system performance, which are not yet well-understood. Hence, performance prediction and performance management of services deployed in virtualized environments like public and private Clouds is a challenging task. Because of the large variety of virtualization solutions, a generic approach to predict the performance overhead of services running on virtualization platforms is highly desirable. In this paper, we present experimental results on two popular state-of-the-art virtualization platforms, Citrix XenServer 5.5 and VMware ESX 4.0, as representatives of the two major hypervisor architectures. Based on these results, we propose a basic, generic performance prediction model for the two different types of hypervisor architectures. The target is to predict the performance overhead for executing services on virtualized platforms.\n
\n','
\n@inproceedings{HuQuHaKo2011-CLOSER-ModelVirtOverhead,\n  abstract = {Due to trends like Cloud Computing and Green IT, virtualization technologies are gaining increasing importance. They promise energy and cost savings by sharing physical resources, thus making resource usage more efficient. However, resource sharing and other factors have direct effects on system performance, which are not yet well-understood. Hence, performance prediction and performance management of services deployed in virtualized environments like public and private Clouds is a challenging task. Because of the large variety of virtualization solutions, a generic approach to predict the performance overhead of services running on virtualization platforms is highly desirable. In this paper, we present experimental results on two popular state-of-the-art virtualization platforms, Citrix XenServer 5.5 and VMware ESX 4.0, as representatives of the two major hypervisor architectures. Based on these results, we propose a basic, generic performance prediction model for the two different types of hypervisor architectures. The target is to predict the performance overhead for executing services on virtualized platforms.},\n  author = {Nikolaus Huber and Marcel von Quast and Michael Hauck and Samuel Kounev},\n  booktitle = {Proceedings of the 1st International Conference on Cloud Computing and Services Science (CLOSER 2011)},\n  day = {7--9},\n  http = {http://closer.scitevents.org/},\n  isbn = {978-989-8425-52-2},\n  location = {Noordwijkerhout, The Netherlands},\n  month = {May},\n  note = {Acceptance Rate: 18/164 = 10.9\\%, Best Paper Award},\n  pages = {563 -- 573},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/227.pdf},\n  publisher = {SciTePress},\n  title = {{E}valuating and {M}odeling {V}irtualization {P}erformance {O}verhead for {C}loud {E}nvironments},\n  year = {2011}\n}\n
\n\n','Due to trends like Cloud Computing and Green IT, virtualization technologies are gaining increasing importance. They promise energy and cost savings by sharing physical resources, thus making resource usage more efficient. However, resource sharing and other factors have direct effects on system performance, which are not yet well-understood. Hence, performance prediction and performance management of services deployed in virtualized environments like public and private Clouds is a challenging task. Because of the large variety of virtualization solutions, a generic approach to predict the performance overhead of services running on virtualization platforms is highly desirable. In this paper, we present experimental results on two popular state-of-the-art virtualization platforms, Citrix XenServer 5.5 and VMware ESX 4.0, as representatives of the two major hypervisor architectures. Based on these results, we propose a basic, generic performance prediction model for the two different types of hypervisor architectures. The target is to predict the performance overhead for executing services on virtualized platforms.','{E}valuating and {M}odeling {V}irtualization {P}erformance {O}verhead for {C}loud {E}nvironments',0,5,2011,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(231,'paper','JuKoBu2003-CMG-PetStoreWS','inproceedings','@inproceedings{JuKoBu2003-CMG-PetStoreWS,\n abstract = {Web Services are increasingly used to enable loosely coupled integration among heterogeneous systems but are perceived as a source of severe performance degradation. This paper looks at the impact on system performance when introducing Web Service interfaces to an originally tightly coupled application. Using two implementation variants of Sun\'s Java Pet Store application, one based strictly on the J2EE platform and the other implementing some interfaces as Web Services, performance is compared in terms of the achieved overall throughput, response times and latency.},\n author = {Kai S. Juse and Samuel Kounev and Alejandro Buchmann},\n booktitle = {Proceedings of the 29th International Conference of the Computer Measurement Group on Resource Management and Performance Evaluation of Enterprise Computing Systems (CMG 2003), Dallas, Texas, USA, December 7-12, 2003},\n month = {December},\n organization = {Computer Measurement Group (CMG)},\n pages = {113--123},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/231.pdf},\n title = {{PetStore-WS: Measuring the Performance Implications of Web Services}},\n url = {http://www.cmg.org/proceedings/2003/3187.pdf},\n year = {2003},\n}\n\n','\n\nKai S. Juse, Samuel Kounev, and Alejandro Buchmann.\nPetStore-WS: Measuring the Performance Implications of Web\nServices.\nIn Proceedings of the 29th International Conference of the\nComputer Measurement Group on Resource Management and Performance Evaluation\nof Enterprise Computing Systems (CMG 2003), Dallas, Texas, USA, December\n7-12, 2003, December 2003, pages 113-123. Computer Measurement Group (CMG).\n[ bib | .pdf | .pdf | Abstract  ] 
\n@inproceedings{JuKoBu2003-CMG-PetStoreWS,\nabstract = {Web Services are increasingly used to enable loosely coupled integration among heterogeneous systems but are perceived as a source of severe performance degradation. This paper looks at the impact on system performance when introducing Web Service interfaces to an originally tightly coupled application. Using two implementation variants of Sun\'s Java Pet Store application, one based strictly on the J2EE platform and the other implementing some interfaces as Web Services, performance is compared in terms of the achieved overall throughput, response times and latency.},\nauthor = {Kai S. Juse and Samuel Kounev and Alejandro Buchmann},\nbooktitle = {Proceedings of the 29th International Conference of the Computer Measurement Group on Resource Management and Performance Evaluation of Enterprise Computing Systems (CMG 2003), Dallas, Texas, USA, December 7-12, 2003},\nmonth = {December},\norganization = {Computer Measurement Group (CMG)},\npages = {113--123},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/231.pdf},\ntitle = {{PetStore-WS: Measuring the Performance Implications of Web Services}},\nurl = {http://www.cmg.org/proceedings/2003/3187.pdf},\nyear = {2003}\n}\n
\n
\nWeb Services are increasingly used to enable loosely coupled integration among heterogeneous systems but are perceived as a source of severe performance degradation. This paper looks at the impact on system performance when introducing Web Service interfaces to an originally tightly coupled application. Using two implementation variants of Sun\'s Java Pet Store application, one based strictly on the J2EE platform and the other implementing some interfaces as Web Services, performance is compared in terms of the achieved overall throughput, response times and latency.\n
\n','
\n@inproceedings{JuKoBu2003-CMG-PetStoreWS,\n  abstract = {Web Services are increasingly used to enable loosely coupled integration among heterogeneous systems but are perceived as a source of severe performance degradation. This paper looks at the impact on system performance when introducing Web Service interfaces to an originally tightly coupled application. Using two implementation variants of Sun\'s Java Pet Store application, one based strictly on the J2EE platform and the other implementing some interfaces as Web Services, performance is compared in terms of the achieved overall throughput, response times and latency.},\n  author = {Kai S. Juse and Samuel Kounev and Alejandro Buchmann},\n  booktitle = {Proceedings of the 29th International Conference of the Computer Measurement Group on Resource Management and Performance Evaluation of Enterprise Computing Systems (CMG 2003), Dallas, Texas, USA, December 7-12, 2003},\n  month = {December},\n  organization = {Computer Measurement Group (CMG)},\n  pages = {113--123},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/231.pdf},\n  title = {{PetStore-WS: Measuring the Performance Implications of Web Services}},\n  url = {http://www.cmg.org/proceedings/2003/3187.pdf},\n  year = {2003}\n}\n
\n\n','Web Services are increasingly used to enable loosely coupled integration among heterogeneous systems but are perceived as a source of severe performance degradation. This paper looks at the impact on system performance when introducing Web Service interfaces to an originally tightly coupled application. Using two implementation variants of Sun\'s Java Pet Store application, one based strictly on the J2EE platform and the other implementing some interfaces as Web Services, performance is compared in terms of the achieved overall throughput, response times and latency.','{PetStore-WS: Measuring the Performance Implications of Web Services}',0,12,2003,12,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(243,'paper','KaBeCaDiKuMoSt2012-EUROSYS','inproceedings','@inproceedings{KaBeCaDiKuMoSt2012-EUROSYS,\n acmid = {2168866},\n address = {New York, NY, USA},\n author = {Kapitza, R\\\"{u}diger and Behl, Johannes and Cachin, Christian and Distler, Tobias and Kuhnle, Simon and Mohammadi, Seyed Vahid and Schr\\\"{o}der-Preikschat, Wolfgang and Stengel, Klaus},\n booktitle = {Proceedings of the 7th ACM european conference on Computer Systems},\n doi = {10.1145/2168836.2168866},\n isbn = {978-1-4503-1223-3},\n keywords = {byzantine failures, resource efficiency},\n location = {Bern, Switzerland},\n numpages = {14},\n pages = {295--308},\n publisher = {ACM},\n series = {EuroSys \'12},\n title = {CheapBFT: resource-efficient byzantine fault tolerance},\n url = {http://doi.acm.org/10.1145/2168836.2168866},\n year = {2012},\n}\n\n','\n\nRüdiger Kapitza, Johannes Behl, Christian Cachin, Tobias Distler, Simon\nKuhnle, Seyed Vahid Mohammadi, Wolfgang Schröder-Preikschat, and Klaus\nStengel.\nCheapbft: resource-efficient byzantine fault tolerance.\nIn Proceedings of the 7th ACM european conference on Computer\nSystems, Bern, Switzerland, 2012, EuroSys \'12, pages 295-308. ACM, New\nYork, NY, USA.\n2012.\n[ bib | DOI | http  ] 
\n@inproceedings{KaBeCaDiKuMoSt2012-EUROSYS,\nacmid = {2168866},\naddress = {New York, NY, USA},\nauthor = {Kapitza, R\\\"{u}diger and Behl, Johannes and Cachin, Christian and Distler, Tobias and Kuhnle, Simon and Mohammadi, Seyed Vahid and Schr\\\"{o}der-Preikschat, Wolfgang and Stengel, Klaus},\nbooktitle = {Proceedings of the 7th ACM european conference on Computer Systems},\ndoi = {10.1145/2168836.2168866},\nisbn = {978-1-4503-1223-3},\nkeywords = {byzantine failures, resource efficiency},\nlocation = {Bern, Switzerland},\nnumpages = {14},\npages = {295--308},\npublisher = {ACM},\nseries = {EuroSys \'12},\ntitle = {CheapBFT: resource-efficient byzantine fault tolerance},\nurl = {http://doi.acm.org/10.1145/2168836.2168866},\nyear = {2012}\n}\n
\n
\n','
\n@inproceedings{KaBeCaDiKuMoSt2012-EUROSYS,\n  acmid = {2168866},\n  address = {New York, NY, USA},\n  author = {Kapitza, R\\\"{u}diger and Behl, Johannes and Cachin, Christian and Distler, Tobias and Kuhnle, Simon and Mohammadi, Seyed Vahid and Schr\\\"{o}der-Preikschat, Wolfgang and Stengel, Klaus},\n  booktitle = {Proceedings of the 7th ACM european conference on Computer Systems},\n  doi = {10.1145/2168836.2168866},\n  isbn = {978-1-4503-1223-3},\n  keywords = {byzantine failures, resource efficiency},\n  location = {Bern, Switzerland},\n  numpages = {14},\n  pages = {295--308},\n  publisher = {ACM},\n  series = {EuroSys \'12},\n  title = {CheapBFT: resource-efficient byzantine fault tolerance},\n  url = {http://doi.acm.org/10.1145/2168836.2168866},\n  year = {2012}\n}\n
\n\n',NULL,'CheapBFT: resource-efficient byzantine fault tolerance',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(261,'paper','klatt2011a','inproceedings','@inproceedings{klatt2011a,\n abstract = {With the introduction of services, software systems have become more flexible as new services can easily be composed from existing ones. Service composition frameworks offer corresponding functionality and hide the complexity of the underlying technologies from their users. However, possibilities for anticipating quality properties of com- posed services before their actual operation are limited so far. While existing approaches for model-based software quality prediction can be used by service composers for determining realizable Quality of Service (QoS) levels, integration of such techniques into composition frameworks is still missing. As a result, high effort and expert knowledge is required to build the system models required for prediction. In this paper, we present a novel service composition process that includes QoS prediction for composed services as an integral part. Furthermore, we describe how composition frameworks can be extended to support this process. With our approach, systematic consideration of service quality during the composition process is naturally achieved, without the need for de- tailed knowledge about the underlying prediction models. To evaluate our work and validate its applicability in different domains, we have integrated QoS prediction support according to our process in two com- position frameworks -- a large-scale SLA management framework and a service mashup platform.},\n author = {Benjamin Klatt and Franz Brosch and Zoya Durdik and Christoph Rathfelder},\n booktitle = {5th Workshop on Non-Functional Properties and SLA Management in Service-Oriented Computing (NFPSLAM-SOC 2011)},\n day = {5--8},\n location = {Paphos, Cyprus},\n month = {December},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/261.pdf},\n title = {{Quality Prediction in Service Composition Frameworks}},\n year = {2011},\n}\n\n','\n\nBenjamin Klatt, Franz Brosch, Zoya Durdik, and Christoph Rathfelder.\nQuality Prediction in Service Composition Frameworks.\nIn 5th Workshop on Non-Functional Properties and SLA Management\nin Service-Oriented Computing (NFPSLAM-SOC 2011), Paphos, Cyprus, December\n5-8, 2011.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{klatt2011a,\nabstract = {With the introduction of services, software systems have become more flexible as new services can easily be composed from existing ones. Service composition frameworks offer corresponding functionality and hide the complexity of the underlying technologies from their users. However, possibilities for anticipating quality properties of com- posed services before their actual operation are limited so far. While existing approaches for model-based software quality prediction can be used by service composers for determining realizable Quality of Service (QoS) levels, integration of such techniques into composition frameworks is still missing. As a result, high effort and expert knowledge is required to build the system models required for prediction. In this paper, we present a novel service composition process that includes QoS prediction for composed services as an integral part. Furthermore, we describe how composition frameworks can be extended to support this process. With our approach, systematic consideration of service quality during the composition process is naturally achieved, without the need for de- tailed knowledge about the underlying prediction models. To evaluate our work and validate its applicability in different domains, we have integrated QoS prediction support according to our process in two com- position frameworks -- a large-scale SLA management framework and a service mashup platform.},\nauthor = {Benjamin Klatt and Franz Brosch and Zoya Durdik and Christoph Rathfelder},\nbooktitle = {5th Workshop on Non-Functional Properties and SLA Management in Service-Oriented Computing (NFPSLAM-SOC 2011)},\nday = {5--8},\nlocation = {Paphos, Cyprus},\nmonth = {December},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/261.pdf},\ntitle = {{Quality Prediction in Service Composition Frameworks}},\nyear = {2011}\n}\n
\n
\nWith the introduction of services, software systems have become more flexible as new services can easily be composed from existing ones. Service composition frameworks offer corresponding functionality and hide the complexity of the underlying technologies from their users. However, possibilities for anticipating quality properties of com- posed services before their actual operation are limited so far. While existing approaches for model-based software quality prediction can be used by service composers for determining realizable Quality of Service (QoS) levels, integration of such techniques into composition frameworks is still missing. As a result, high effort and expert knowledge is required to build the system models required for prediction. In this paper, we present a novel service composition process that includes QoS prediction for composed services as an integral part. Furthermore, we describe how composition frameworks can be extended to support this process. With our approach, systematic consideration of service quality during the composition process is naturally achieved, without the need for de- tailed knowledge about the underlying prediction models. To evaluate our work and validate its applicability in different domains, we have integrated QoS prediction support according to our process in two com- position frameworks - a large-scale SLA management framework and a service mashup platform.\n
\n','
\n@inproceedings{klatt2011a,\n  abstract = {With the introduction of services, software systems have become more flexible as new services can easily be composed from existing ones. Service composition frameworks offer corresponding functionality and hide the complexity of the underlying technologies from their users. However, possibilities for anticipating quality properties of com- posed services before their actual operation are limited so far. While existing approaches for model-based software quality prediction can be used by service composers for determining realizable Quality of Service (QoS) levels, integration of such techniques into composition frameworks is still missing. As a result, high effort and expert knowledge is required to build the system models required for prediction. In this paper, we present a novel service composition process that includes QoS prediction for composed services as an integral part. Furthermore, we describe how composition frameworks can be extended to support this process. With our approach, systematic consideration of service quality during the composition process is naturally achieved, without the need for de- tailed knowledge about the underlying prediction models. To evaluate our work and validate its applicability in different domains, we have integrated QoS prediction support according to our process in two com- position frameworks -- a large-scale SLA management framework and a service mashup platform.},\n  author = {Benjamin Klatt and Franz Brosch and Zoya Durdik and Christoph Rathfelder},\n  booktitle = {5th Workshop on Non-Functional Properties and SLA Management in Service-Oriented Computing (NFPSLAM-SOC 2011)},\n  day = {5--8},\n  location = {Paphos, Cyprus},\n  month = {December},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/261.pdf},\n  title = {{Quality Prediction in Service Composition Frameworks}},\n  year = {2011}\n}\n
\n\n','With the introduction of services, software systems have become more flexible as new services can easily be composed from existing ones. Service composition frameworks offer corresponding functionality and hide the complexity of the underlying technologies from their users. However, possibilities for anticipating quality properties of com- posed services before their actual operation are limited so far. While existing approaches for model-based software quality prediction can be used by service composers for determining realizable Quality of Service (QoS) levels, integration of such techniques into composition frameworks is still missing. As a result, high effort and expert knowledge is required to build the system models required for prediction. In this paper, we present a novel service composition process that includes QoS prediction for composed services as an integral part. Furthermore, we describe how composition frameworks can be extended to support this process. With our approach, systematic consideration of service quality during the composition process is naturally achieved, without the need for de- tailed knowledge about the underlying prediction models. To evaluate our work and validate its applicability in different domains, we have integrated QoS prediction support according to our process in two com- position frameworks -- a large-scale SLA management framework and a service mashup platform.','{Quality Prediction in Service Composition Frameworks}',0,12,2011,12,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(273,'paper','KlRaKo2011-QoSA-PCMEvents','inproceedings','@inproceedings{KlRaKo2011-QoSA-PCMEvents,\n abstract = {Today, software engineering is challenged to handle more and more large-scale distributed systems with guaranteed quality-of-service. Component-based architectures have been established to build such systems in a more structured and manageable way. Modern architectures often utilize event-based communication which enables loosely-coupled interactions between components and leads to improved system scalability. However, the loose coupling of components makes it challenging to model such architectures in order to predict their quality properties, e.g., performance and reliability, at system design time. In this paper, we present an extension of the Palladio Component Model (PCM) and the Palladio software quality prediction framework, enabling the modeling of event-based communication in component-based architectures. The contributions include: i) a meta-model extension supporting events as first class entities, ii) a model-to-model transformation from the extended to the original PCM, iii) an integration of the transformation into the Palladio tool chain allowing to use existing model solution techniques, and iv) a detailed evaluation of the reduction of the modeling effort enabled by the transformation in the context of a real-world case study.},\n address = {New York, NY, USA},\n author = {Klatt, Benjamin and Rathfelder, Christoph and Kounev, Samuel},\n booktitle = {Proceedings of the joint ACM SIGSOFT conference -- QoSA and ACM SIGSOFT symposium -- ISARCS on Quality of software architectures -- QoSA and architecting critical systems -- ISARCS (QoSA-ISARCS 2011)},\n day = {20--24},\n doi = {http://doi.acm.org/10.1145/2000259.2000268},\n isbn = {978-1-4503-0724-6},\n keywords = {component-based architectures, event-based communication, performance prediction},\n location = {Boulder, Colorado, USA},\n month = {June},\n numpages = {10},\n organization = {SIGSOFT},\n pages = {43--52},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/273.pdf},\n publisher = {ACM},\n title = {Integration of event-based communication in the palladio software quality prediction framework},\n url = {http://doi.acm.org/10.1145/2000259.2000268},\n year = {2011},\n}\n\n','\n\nBenjamin Klatt, Christoph Rathfelder, and Samuel Kounev.\nIntegration of event-based communication in the palladio software\nquality prediction framework.\nIn Proceedings of the joint ACM SIGSOFT conference - QoSA and\nACM SIGSOFT symposium - ISARCS on Quality of software architectures - QoSA\nand architecting critical systems - ISARCS (QoSA-ISARCS 2011), Boulder,\nColorado, USA, June 20-24, 2011, pages 43-52. SIGSOFT, ACM, New York, NY,\nUSA.\nJune 2011.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{KlRaKo2011-QoSA-PCMEvents,\nabstract = {Today, software engineering is challenged to handle more and more large-scale distributed systems with guaranteed quality-of-service. Component-based architectures have been established to build such systems in a more structured and manageable way. Modern architectures often utilize event-based communication which enables loosely-coupled interactions between components and leads to improved system scalability. However, the loose coupling of components makes it challenging to model such architectures in order to predict their quality properties, e.g., performance and reliability, at system design time. In this paper, we present an extension of the Palladio Component Model (PCM) and the Palladio software quality prediction framework, enabling the modeling of event-based communication in component-based architectures. The contributions include: i) a meta-model extension supporting events as first class entities, ii) a model-to-model transformation from the extended to the original PCM, iii) an integration of the transformation into the Palladio tool chain allowing to use existing model solution techniques, and iv) a detailed evaluation of the reduction of the modeling effort enabled by the transformation in the context of a real-world case study.},\naddress = {New York, NY, USA},\nauthor = {Klatt, Benjamin and Rathfelder, Christoph and Kounev, Samuel},\nbooktitle = {Proceedings of the joint ACM SIGSOFT conference -- QoSA and ACM SIGSOFT symposium -- ISARCS on Quality of software architectures -- QoSA and architecting critical systems -- ISARCS (QoSA-ISARCS 2011)},\nday = {20--24},\ndoi = {http://doi.acm.org/10.1145/2000259.2000268},\nisbn = {978-1-4503-0724-6},\nkeywords = {component-based architectures, event-based communication, performance prediction},\nlocation = {Boulder, Colorado, USA},\nmonth = {June},\nnumpages = {10},\norganization = {SIGSOFT},\npages = {43--52},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/273.pdf},\npublisher = {ACM},\ntitle = {Integration of event-based communication in the palladio software quality prediction framework},\nurl = {http://doi.acm.org/10.1145/2000259.2000268},\nyear = {2011}\n}\n
\n
\nToday, software engineering is challenged to handle more and more large-scale distributed systems with guaranteed quality-of-service. Component-based architectures have been established to build such systems in a more structured and manageable way. Modern architectures often utilize event-based communication which enables loosely-coupled interactions between components and leads to improved system scalability. However, the loose coupling of components makes it challenging to model such architectures in order to predict their quality properties, e.g., performance and reliability, at system design time. In this paper, we present an extension of the Palladio Component Model (PCM) and the Palladio software quality prediction framework, enabling the modeling of event-based communication in component-based architectures. The contributions include: i) a meta-model extension supporting events as first class entities, ii) a model-to-model transformation from the extended to the original PCM, iii) an integration of the transformation into the Palladio tool chain allowing to use existing model solution techniques, and iv) a detailed evaluation of the reduction of the modeling effort enabled by the transformation in the context of a real-world case study.\n
\n','
\n@inproceedings{KlRaKo2011-QoSA-PCMEvents,\n  abstract = {Today, software engineering is challenged to handle more and more large-scale distributed systems with guaranteed quality-of-service. Component-based architectures have been established to build such systems in a more structured and manageable way. Modern architectures often utilize event-based communication which enables loosely-coupled interactions between components and leads to improved system scalability. However, the loose coupling of components makes it challenging to model such architectures in order to predict their quality properties, e.g., performance and reliability, at system design time. In this paper, we present an extension of the Palladio Component Model (PCM) and the Palladio software quality prediction framework, enabling the modeling of event-based communication in component-based architectures. The contributions include: i) a meta-model extension supporting events as first class entities, ii) a model-to-model transformation from the extended to the original PCM, iii) an integration of the transformation into the Palladio tool chain allowing to use existing model solution techniques, and iv) a detailed evaluation of the reduction of the modeling effort enabled by the transformation in the context of a real-world case study.},\n  address = {New York, NY, USA},\n  author = {Klatt, Benjamin and Rathfelder, Christoph and Kounev, Samuel},\n  booktitle = {Proceedings of the joint ACM SIGSOFT conference -- QoSA and ACM SIGSOFT symposium -- ISARCS on Quality of software architectures -- QoSA and architecting critical systems -- ISARCS (QoSA-ISARCS 2011)},\n  day = {20--24},\n  doi = {http://doi.acm.org/10.1145/2000259.2000268},\n  isbn = {978-1-4503-0724-6},\n  keywords = {component-based architectures, event-based communication, performance prediction},\n  location = {Boulder, Colorado, USA},\n  month = {June},\n  numpages = {10},\n  organization = {SIGSOFT},\n  pages = {43--52},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/273.pdf},\n  publisher = {ACM},\n  title = {Integration of event-based communication in the palladio software quality prediction framework},\n  url = {http://doi.acm.org/10.1145/2000259.2000268},\n  year = {2011}\n}\n
\n\n','Today, software engineering is challenged to handle more and more large-scale distributed systems with guaranteed quality-of-service. Component-based architectures have been established to build such systems in a more structured and manageable way. Modern architectures often utilize event-based communication which enables loosely-coupled interactions between components and leads to improved system scalability. However, the loose coupling of components makes it challenging to model such architectures in order to predict their quality properties, e.g., performance and reliability, at system design time. In this paper, we present an extension of the Palladio Component Model (PCM) and the Palladio software quality prediction framework, enabling the modeling of event-based communication in component-based architectures. The contributions include: i) a meta-model extension supporting events as first class entities, ii) a model-to-model transformation from the extended to the original PCM, iii) an integration of the transformation into the Palladio tool chain allowing to use existing model solution techniques, and iv) a detailed evaluation of the reduction of the modeling effort enabled by the transformation in the context of a real-world case study.','Integration of event-based communication in the palladio software quality prediction framework',0,6,2011,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(278,'paper','Ko2011-BMSD-PerfEngOfBis','inproceedings','@inproceedings{Ko2011-BMSD-PerfEngOfBis,\n author = {Samuel Kounev},\n booktitle = {International Symposium on Business Modeling and Software Design (BMSD 2011), Sofia, Bulgaria, July 27--28, 2011},\n isbn = {978-989-8425-68-3},\n month = {July},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/278.pdf},\n title = {{Performance Engineering of Business Information Systems - Filling the Gap between High-level Business Services and Low-level Performance Models}},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nPerformance Engineering of Business Information Systems - Filling\nthe Gap between High-level Business Services and Low-level Performance\nModels.\nIn International Symposium on Business Modeling and Software\nDesign (BMSD 2011), Sofia, Bulgaria, July 27-28, 2011, July 2011.\n[ bib | .pdf  ] 
\n@inproceedings{Ko2011-BMSD-PerfEngOfBis,\nauthor = {Samuel Kounev},\nbooktitle = {International Symposium on Business Modeling and Software Design (BMSD 2011), Sofia, Bulgaria, July 27--28, 2011},\nisbn = {978-989-8425-68-3},\nmonth = {July},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/278.pdf},\ntitle = {{Performance Engineering of Business Information Systems - Filling the Gap between High-level Business Services and Low-level Performance Models}},\nyear = {2011}\n}\n
\n
\n','
\n@inproceedings{Ko2011-BMSD-PerfEngOfBis,\n  author = {Samuel Kounev},\n  booktitle = {International Symposium on Business Modeling and Software Design (BMSD 2011), Sofia, Bulgaria, July 27--28, 2011},\n  isbn = {978-989-8425-68-3},\n  month = {July},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/278.pdf},\n  title = {{Performance Engineering of Business Information Systems - Filling the Gap between High-level Business Services and Low-level Performance Models}},\n  year = {2011}\n}\n
\n\n',NULL,'{Performance Engineering of Business Information Systems - Filling the Gap between High-level Business Services and Low-level Performance Models}',0,7,2011,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(279,'paper','Ko2011-EPEW-ResearchChallenges','inproceedings','@inproceedings{Ko2011-EPEW-ResearchChallenges,\n author = {Samuel Kounev},\n booktitle = {Proceedings of the 8th European Performance Engineering Workshop (EPEW\'11), Borrowdale, The English Lake District, October 12--13},\n note = {(Extended Abstract of Keynote Talk)},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/279.pdf},\n title = {{Engineering of Self-Aware IT Systems and Services: State-of-the-Art and Research Challenges}},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nEngineering of Self-Aware IT Systems and Services: State-of-the-Art\nand Research Challenges.\nIn Proceedings of the 8th European Performance Engineering\nWorkshop (EPEW\'11), Borrowdale, The English Lake District, October 12-13,\n2011.\n(Extended Abstract of Keynote Talk).\n[ bib | .pdf  ] 
\n@inproceedings{Ko2011-EPEW-ResearchChallenges,\nauthor = {Samuel Kounev},\nbooktitle = {Proceedings of the 8th European Performance Engineering Workshop (EPEW\'11), Borrowdale, The English Lake District, October 12--13},\nnote = {(Extended Abstract of Keynote Talk)},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/279.pdf},\ntitle = {{Engineering of Self-Aware IT Systems and Services: State-of-the-Art and Research Challenges}},\nyear = {2011}\n}\n
\n
\n','
\n@inproceedings{Ko2011-EPEW-ResearchChallenges,\n  author = {Samuel Kounev},\n  booktitle = {Proceedings of the 8th European Performance Engineering Workshop (EPEW\'11), Borrowdale, The English Lake District, October 12--13},\n  note = {(Extended Abstract of Keynote Talk)},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/279.pdf},\n  title = {{Engineering of Self-Aware IT Systems and Services: State-of-the-Art and Research Challenges}},\n  year = {2011}\n}\n
\n\n',NULL,'{Engineering of Self-Aware IT Systems and Services: State-of-the-Art and Research Challenges}',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(280,'paper','Ko2011-SE-DescartesResearch','inproceedings','@inproceedings{Ko2011-SE-DescartesResearch,\n address = {Karlsruhe, Germany},\n author = {Samuel Kounev},\n booktitle = {{GI Softwaretechnik-Trends, 31(4), November 2011, ISSN 0720-8928}},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/280.pdf},\n title = {{Self-Aware Software and Systems Engineering: A Vision and Research Roadmap}},\n url = {http://pi.informatik.uni-siegen.de/stt/31_4/index.html},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nSelf-Aware Software and Systems Engineering: A Vision and Research\nRoadmap.\nIn GI Softwaretechnik-Trends, 31(4), November 2011, ISSN\n0720-8928, 2011. Karlsruhe, Germany.\n[ bib | .html | .pdf  ] 
\n@inproceedings{Ko2011-SE-DescartesResearch,\naddress = {Karlsruhe, Germany},\nauthor = {Samuel Kounev},\nbooktitle = {{GI Softwaretechnik-Trends, 31(4), November 2011, ISSN 0720-8928}},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/280.pdf},\ntitle = {{Self-Aware Software and Systems Engineering: A Vision and Research Roadmap}},\nurl = {http://pi.informatik.uni-siegen.de/stt/31_4/index.html},\nyear = {2011}\n}\n
\n
\n','
\n@inproceedings{Ko2011-SE-DescartesResearch,\n  address = {Karlsruhe, Germany},\n  author = {Samuel Kounev},\n  booktitle = {{GI Softwaretechnik-Trends, 31(4), November 2011, ISSN 0720-8928}},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/280.pdf},\n  title = {{Self-Aware Software and Systems Engineering: A Vision and Research Roadmap}},\n  url = {http://pi.informatik.uni-siegen.de/stt/31_4/index.html},\n  year = {2011}\n}\n
\n\n',NULL,'{Self-Aware Software and Systems Engineering: A Vision and Research Roadmap}',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(281,'paper','Ko2010-KIT-Roadmap','incollection','@incollection{Ko2010-KIT-Roadmap,\n address = {Karlsruhe, Germany},\n author = {Samuel Kounev},\n booktitle = {{Emerging Research Directions in Computer Science. Contributions from the Young Informatics Faculty in Karlsruhe}},\n isbn = {978-3-86644-508-6},\n month = {July},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/281.pdf},\n publisher = {KIT Scientific Publishing},\n title = {{Engineering of Next Generation Self-Aware Software Systems: A Research Roadmap}},\n url = {http://uvka.ubka.uni-karlsruhe.de/shop/isbn/978-3-86644-508-6},\n year = {2010},\n}\n\n','\n\nSamuel Kounev.\nEngineering of Next Generation Self-Aware Software Systems: A\nResearch Roadmap.\nIn Emerging Research Directions in Computer Science.\nContributions from the Young Informatics Faculty in Karlsruhe. KIT\nScientific Publishing, Karlsruhe, Germany, July 2010.\n[ bib | http | .pdf  ] 
\n@incollection{Ko2010-KIT-Roadmap,\naddress = {Karlsruhe, Germany},\nauthor = {Samuel Kounev},\nbooktitle = {{Emerging Research Directions in Computer Science. Contributions from the Young Informatics Faculty in Karlsruhe}},\nisbn = {978-3-86644-508-6},\nmonth = {July},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/281.pdf},\npublisher = {KIT Scientific Publishing},\ntitle = {{Engineering of Next Generation Self-Aware Software Systems: A Research Roadmap}},\nurl = {http://uvka.ubka.uni-karlsruhe.de/shop/isbn/978-3-86644-508-6},\nyear = {2010}\n}\n
\n
\n','
\n@incollection{Ko2010-KIT-Roadmap,\n  address = {Karlsruhe, Germany},\n  author = {Samuel Kounev},\n  booktitle = {{Emerging Research Directions in Computer Science. Contributions from the Young Informatics Faculty in Karlsruhe}},\n  isbn = {978-3-86644-508-6},\n  month = {July},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/281.pdf},\n  publisher = {KIT Scientific Publishing},\n  title = {{Engineering of Next Generation Self-Aware Software Systems: A Research Roadmap}},\n  url = {http://uvka.ubka.uni-karlsruhe.de/shop/isbn/978-3-86644-508-6},\n  year = {2010}\n}\n
\n\n',NULL,'{Engineering of Next Generation Self-Aware Software Systems: A Research Roadmap}',0,7,2010,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(282,'paper','Ko2008-WILEY-SoftwarePerfEval','incollection','@incollection{Ko2008-WILEY-SoftwarePerfEval,\n abstract = {Modern software systems are expected to satisfy increasingly stringent requirements for performance and scalability. To avoid the pitfalls of inadequate quality of service, it is important to evaluate the expected performance and scalability characteristics of systems during all phases of their life cycle. At every stage, performance evaluation is carried out with a specific set of goals and constraints. In this article, we present an overview of the major methods and techniques for software performance evaluation. We start by considering the different types of workload models that are typically used in performance evaluation studies. We then discuss performance measurement techniques including platform benchmarking, application profiling and system load testing. Following this, we survey the most common methods and techniques for performance modeling of software systems. We consider the major types of performance models used in practice and discuss their advantages and disadvantages. Finally, we briefly discuss operational analysis as an alternative to queueing theoretic methods.},\n author = {Samuel Kounev},\n title = {{Software Performance Evaluation}},\n isbn = {0471383937},\n isbn-13 = {978-0471383932},\n month = {January},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/282.pdf},\n publisher = {Wiley-Interscience, John Wiley & Sons Inc.},\n booktitle = {{Wiley Encyclopedia of Computer Science and Engineering, edited by Benjamin W. Wah}},\n url = {http://www.amazon.com/Wiley-Encyclopedia-Computer-Science-Engineering/dp/0471383937},\n year = {2009},\n}\n\n','\n\nSamuel Kounev.\nSoftware Performance Evaluation.\nIn Wiley Encyclopedia of Computer Science and Engineering,\nedited by Benjamin W. Wah. Wiley-Interscience, John Wiley & Sons Inc.,\nJanuary 2009.\n[ bib | http | .pdf | Abstract  ] 
\n@incollection{Ko2008-WILEY-SoftwarePerfEval,\nabstract = {Modern software systems are expected to satisfy increasingly stringent requirements for performance and scalability. To avoid the pitfalls of inadequate quality of service, it is important to evaluate the expected performance and scalability characteristics of systems during all phases of their life cycle. At every stage, performance evaluation is carried out with a specific set of goals and constraints. In this article, we present an overview of the major methods and techniques for software performance evaluation. We start by considering the different types of workload models that are typically used in performance evaluation studies. We then discuss performance measurement techniques including platform benchmarking, application profiling and system load testing. Following this, we survey the most common methods and techniques for performance modeling of software systems. We consider the major types of performance models used in practice and discuss their advantages and disadvantages. Finally, we briefly discuss operational analysis as an alternative to queueing theoretic methods.},\nauthor = {Samuel Kounev},\ntitle = {{Software Performance Evaluation}},\nisbn = {0471383937},\nisbn-13 = {978-0471383932},\nmonth = {January},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/282.pdf},\npublisher = {Wiley-Interscience, John Wiley & Sons Inc.},\nbooktitle = {{Wiley Encyclopedia of Computer Science and Engineering, edited by Benjamin W. Wah}},\nurl = {http://www.amazon.com/Wiley-Encyclopedia-Computer-Science-Engineering/dp/0471383937},\nyear = {2009}\n}\n
\n
\nModern software systems are expected to satisfy increasingly stringent requirements for performance and scalability. To avoid the pitfalls of inadequate quality of service, it is important to evaluate the expected performance and scalability characteristics of systems during all phases of their life cycle. At every stage, performance evaluation is carried out with a specific set of goals and constraints. In this article, we present an overview of the major methods and techniques for software performance evaluation. We start by considering the different types of workload models that are typically used in performance evaluation studies. We then discuss performance measurement techniques including platform benchmarking, application profiling and system load testing. Following this, we survey the most common methods and techniques for performance modeling of software systems. We consider the major types of performance models used in practice and discuss their advantages and disadvantages. Finally, we briefly discuss operational analysis as an alternative to queueing theoretic methods.\n
\n','
\n@incollection{Ko2008-WILEY-SoftwarePerfEval,\n  abstract = {Modern software systems are expected to satisfy increasingly stringent requirements for performance and scalability. To avoid the pitfalls of inadequate quality of service, it is important to evaluate the expected performance and scalability characteristics of systems during all phases of their life cycle. At every stage, performance evaluation is carried out with a specific set of goals and constraints. In this article, we present an overview of the major methods and techniques for software performance evaluation. We start by considering the different types of workload models that are typically used in performance evaluation studies. We then discuss performance measurement techniques including platform benchmarking, application profiling and system load testing. Following this, we survey the most common methods and techniques for performance modeling of software systems. We consider the major types of performance models used in practice and discuss their advantages and disadvantages. Finally, we briefly discuss operational analysis as an alternative to queueing theoretic methods.},\n  author = {Samuel Kounev},\n  title = {{Software Performance Evaluation}},\n  isbn = {0471383937},\n  isbn-13 = {978-0471383932},\n  month = {January},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/282.pdf},\n  publisher = {Wiley-Interscience, John Wiley & Sons Inc.},\n  booktitle = {{Wiley Encyclopedia of Computer Science and Engineering, edited by Benjamin W. Wah}},\n  url = {http://www.amazon.com/Wiley-Encyclopedia-Computer-Science-Engineering/dp/0471383937},\n  year = {2009}\n}\n
\n\n','Modern software systems are expected to satisfy increasingly stringent requirements for performance and scalability. To avoid the pitfalls of inadequate quality of service, it is important to evaluate the expected performance and scalability characteristics of systems during all phases of their life cycle. At every stage, performance evaluation is carried out with a specific set of goals and constraints. In this article, we present an overview of the major methods and techniques for software performance evaluation. We start by considering the different types of workload models that are typically used in performance evaluation studies. We then discuss performance measurement techniques including platform benchmarking, application profiling and system load testing. Following this, we survey the most common methods and techniques for performance modeling of software systems. We consider the major types of performance models used in practice and discuss their advantages and disadvantages. Finally, we briefly discuss operational analysis as an alternative to queueing theoretic methods.','{Software Performance Evaluation}',0,1,2009,1,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(283,'paper','kounev2008a','misc','@misc{kounev2008a,\n author = {Samuel Kounev},\n howpublished = {{Online, \\url{http://descartes.ipd.kit.edu/projects/QPME}}},\n title = {{QPME (Queueing Petri net Modeling Environment) Homepage}},\n url = {http://descartes.ipd.kit.edu/projects/QPME},\n year = {2008},\n}\n\n','\n\nSamuel Kounev.\nQPME (Queueing Petri net Modeling Environment) Homepage.\nOnline, http://descartes.ipd.kit.edu/projects/QPME, 2008.\n[ bib | http  ] 
\n@misc{kounev2008a,\nauthor = {Samuel Kounev},\nhowpublished = {{Online, \\url{http://descartes.ipd.kit.edu/projects/QPME}}},\ntitle = {{QPME (Queueing Petri net Modeling Environment) Homepage}},\nurl = {http://descartes.ipd.kit.edu/projects/QPME},\nyear = {2008}\n}\n
\n
\n','
\n@misc{kounev2008a,\n  author = {Samuel Kounev},\n  howpublished = {{Online, \\url{http://descartes.ipd.kit.edu/projects/QPME}}},\n  title = {{QPME (Queueing Petri net Modeling Environment) Homepage}},\n  url = {http://descartes.ipd.kit.edu/projects/QPME},\n  year = {2008}\n}\n
\n\n',NULL,'{QPME (Queueing Petri net Modeling Environment) Homepage}',0,0,2008,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(284,'paper','Ko2006-IEEE_TSE-QPN_ModelingMethod','article','@article{Ko2006-IEEE_TSE-QPN_ModelingMethod,\n title = {{Performance Modeling and Evaluation of Distributed Component-Based Systems using Queueing Petri Nets}},\n journal = {IEEE Transactions on Software Engineering},\n year = {2006},\n month = {July},\n volume = {32},\n number = {7},\n pages = {486--502},\n abstract = {Performance models are used increasingly throughout the phases of the software engineering lifecycle of distributed component-based systems. However, as systems grow in size and complexity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. In this paper, we present a novel case study of a realistic distributed component-based system, showing how Queueing Petri Net models can be exploited as a powerful performance prediction tool in the software engineering process. A detailed system model is built in a step-by-step fashion, validated, and then used to evaluate the system performance and scalability. Along with the case study, a practical performance modeling methodology is presented which helps to construct models that accurately reflect the system performance and scalability characteristics. Taking advantage of the modeling power and expressiveness of Queueing Petri Nets, our approach makes it possible to model the system at a higher degree of accuracy, providing a number of important benefits.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/284.pdf},\n doi = {10.1109/TSE.2006.69},\n author = {Kounev, Samuel},\n}\n\n','\n\nSamuel Kounev.\nPerformance Modeling and Evaluation of Distributed Component-Based\nSystems using Queueing Petri Nets.\nIEEE Transactions on Software Engineering, 32(7):486-502, July\n2006.\n[ bib | DOI | .pdf | Abstract  ] 
\n@article{Ko2006-IEEE_TSE-QPN_ModelingMethod,\ntitle = {{Performance Modeling and Evaluation of Distributed Component-Based Systems using Queueing Petri Nets}},\njournal = {IEEE Transactions on Software Engineering},\nyear = {2006},\nmonth = {July},\nvolume = {32},\nnumber = {7},\npages = {486--502},\nabstract = {Performance models are used increasingly throughout the phases of the software engineering lifecycle of distributed component-based systems. However, as systems grow in size and complexity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. In this paper, we present a novel case study of a realistic distributed component-based system, showing how Queueing Petri Net models can be exploited as a powerful performance prediction tool in the software engineering process. A detailed system model is built in a step-by-step fashion, validated, and then used to evaluate the system performance and scalability. Along with the case study, a practical performance modeling methodology is presented which helps to construct models that accurately reflect the system performance and scalability characteristics. Taking advantage of the modeling power and expressiveness of Queueing Petri Nets, our approach makes it possible to model the system at a higher degree of accuracy, providing a number of important benefits.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/284.pdf},\ndoi = {10.1109/TSE.2006.69},\nauthor = {Kounev, Samuel}\n}\n
\n
\nPerformance models are used increasingly throughout the phases of the software engineering lifecycle of distributed component-based systems. However, as systems grow in size and complexity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. In this paper, we present a novel case study of a realistic distributed component-based system, showing how Queueing Petri Net models can be exploited as a powerful performance prediction tool in the software engineering process. A detailed system model is built in a step-by-step fashion, validated, and then used to evaluate the system performance and scalability. Along with the case study, a practical performance modeling methodology is presented which helps to construct models that accurately reflect the system performance and scalability characteristics. Taking advantage of the modeling power and expressiveness of Queueing Petri Nets, our approach makes it possible to model the system at a higher degree of accuracy, providing a number of important benefits.\n
\n','
\n@article{Ko2006-IEEE_TSE-QPN_ModelingMethod,\n  title = {{Performance Modeling and Evaluation of Distributed Component-Based Systems using Queueing Petri Nets}},\n  journal = {IEEE Transactions on Software Engineering},\n  year = {2006},\n  month = {July},\n  volume = {32},\n  number = {7},\n  pages = {486--502},\n  abstract = {Performance models are used increasingly throughout the phases of the software engineering lifecycle of distributed component-based systems. However, as systems grow in size and complexity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. In this paper, we present a novel case study of a realistic distributed component-based system, showing how Queueing Petri Net models can be exploited as a powerful performance prediction tool in the software engineering process. A detailed system model is built in a step-by-step fashion, validated, and then used to evaluate the system performance and scalability. Along with the case study, a practical performance modeling methodology is presented which helps to construct models that accurately reflect the system performance and scalability characteristics. Taking advantage of the modeling power and expressiveness of Queueing Petri Nets, our approach makes it possible to model the system at a higher degree of accuracy, providing a number of important benefits.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/284.pdf},\n  doi = {10.1109/TSE.2006.69},\n  author = {Kounev, Samuel}\n}\n
\n\n','Performance models are used increasingly throughout the phases of the software engineering lifecycle of distributed component-based systems. However, as systems grow in size and complexity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. In this paper, we present a novel case study of a realistic distributed component-based system, showing how Queueing Petri Net models can be exploited as a powerful performance prediction tool in the software engineering process. A detailed system model is built in a step-by-step fashion, validated, and then used to evaluate the system performance and scalability. Along with the case study, a practical performance modeling methodology is presented which helps to construct models that accurately reflect the system performance and scalability characteristics. Taking advantage of the modeling power and expressiveness of Queueing Petri Nets, our approach makes it possible to model the system at a higher degree of accuracy, providing a number of important benefits.','{Performance Modeling and Evaluation of Distributed Component-Based Systems using Queueing Petri Nets}',0,7,2006,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(285,'paper','Ko2006-SPEC_BW-J2EEPerfScal','inproceedings','@inproceedings{Ko2006-SPEC_BW-J2EEPerfScal,\n title = {{J2EE Performance and Scalability - From Measuring to Predicting}},\n year = {2006},\n month = {January},\n abstract = {J2EE applications are becoming increasingly ubiquitous and with their increasing adoption, performance and scalability issues are gaining in importance. For a J2EE application to perform well and be scalable, both the platform on which it is built and the application design must be efficient and scalable. Industry-standard benchmarks such as the SPECjAppServer set of benchmarks help to evaluate the performance and scalability of alternative platforms for J2EE applications, however, they cannot be used to evaluate the performance and scalability of concrete applications built on the selected platforms. In this paper, we present a systematic approach for evaluating and predicting the performance and scalability of J2EE applications based on modeling and simulation. The approach helps to identify and eliminate bottlenecks in the application design and ensure that systems are designed and sized to meet their quality of service requirements. We introduce our approach by showing how it can be applied to the SPECjAppServer2004 benchmark which is used as a representative J2EE application. A detailed model of a SPECjAppServer2004 deployment is built in a step-by-step fashion and then used to predict the behavior of the system under load. The approach is validated by comparing model predictions against measurements on the real system.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/285.pdf},\n booktitle = {Proceedings of the 2006 SPEC Benchmark Workshop, Austin, Texas, USA},\n author = {Kounev, Samuel},\n}\n\n','\n\nSamuel Kounev.\nJ2EE Performance and Scalability - From Measuring to Predicting.\nIn Proceedings of the 2006 SPEC Benchmark Workshop, Austin,\nTexas, USA, January 2006.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{Ko2006-SPEC_BW-J2EEPerfScal,\ntitle = {{J2EE Performance and Scalability - From Measuring to Predicting}},\nyear = {2006},\nmonth = {January},\nabstract = {J2EE applications are becoming increasingly ubiquitous and with their increasing adoption, performance and scalability issues are gaining in importance. For a J2EE application to perform well and be scalable, both the platform on which it is built and the application design must be efficient and scalable. Industry-standard benchmarks such as the SPECjAppServer set of benchmarks help to evaluate the performance and scalability of alternative platforms for J2EE applications, however, they cannot be used to evaluate the performance and scalability of concrete applications built on the selected platforms. In this paper, we present a systematic approach for evaluating and predicting the performance and scalability of J2EE applications based on modeling and simulation. The approach helps to identify and eliminate bottlenecks in the application design and ensure that systems are designed and sized to meet their quality of service requirements. We introduce our approach by showing how it can be applied to the SPECjAppServer2004 benchmark which is used as a representative J2EE application. A detailed model of a SPECjAppServer2004 deployment is built in a step-by-step fashion and then used to predict the behavior of the system under load. The approach is validated by comparing model predictions against measurements on the real system.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/285.pdf},\nbooktitle = {Proceedings of the 2006 SPEC Benchmark Workshop, Austin, Texas, USA},\nauthor = {Kounev, Samuel}\n}\n
\n
\nJ2EE applications are becoming increasingly ubiquitous and with their increasing adoption, performance and scalability issues are gaining in importance. For a J2EE application to perform well and be scalable, both the platform on which it is built and the application design must be efficient and scalable. Industry-standard benchmarks such as the SPECjAppServer set of benchmarks help to evaluate the performance and scalability of alternative platforms for J2EE applications, however, they cannot be used to evaluate the performance and scalability of concrete applications built on the selected platforms. In this paper, we present a systematic approach for evaluating and predicting the performance and scalability of J2EE applications based on modeling and simulation. The approach helps to identify and eliminate bottlenecks in the application design and ensure that systems are designed and sized to meet their quality of service requirements. We introduce our approach by showing how it can be applied to the SPECjAppServer2004 benchmark which is used as a representative J2EE application. A detailed model of a SPECjAppServer2004 deployment is built in a step-by-step fashion and then used to predict the behavior of the system under load. The approach is validated by comparing model predictions against measurements on the real system.\n
\n','
\n@inproceedings{Ko2006-SPEC_BW-J2EEPerfScal,\n  title = {{J2EE Performance and Scalability - From Measuring to Predicting}},\n  year = {2006},\n  month = {January},\n  abstract = {J2EE applications are becoming increasingly ubiquitous and with their increasing adoption, performance and scalability issues are gaining in importance. For a J2EE application to perform well and be scalable, both the platform on which it is built and the application design must be efficient and scalable. Industry-standard benchmarks such as the SPECjAppServer set of benchmarks help to evaluate the performance and scalability of alternative platforms for J2EE applications, however, they cannot be used to evaluate the performance and scalability of concrete applications built on the selected platforms. In this paper, we present a systematic approach for evaluating and predicting the performance and scalability of J2EE applications based on modeling and simulation. The approach helps to identify and eliminate bottlenecks in the application design and ensure that systems are designed and sized to meet their quality of service requirements. We introduce our approach by showing how it can be applied to the SPECjAppServer2004 benchmark which is used as a representative J2EE application. A detailed model of a SPECjAppServer2004 deployment is built in a step-by-step fashion and then used to predict the behavior of the system under load. The approach is validated by comparing model predictions against measurements on the real system.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/285.pdf},\n  booktitle = {Proceedings of the 2006 SPEC Benchmark Workshop, Austin, Texas, USA},\n  author = {Kounev, Samuel}\n}\n
\n\n','J2EE applications are becoming increasingly ubiquitous and with their increasing adoption, performance and scalability issues are gaining in importance. For a J2EE application to perform well and be scalable, both the platform on which it is built and the application design must be efficient and scalable. Industry-standard benchmarks such as the SPECjAppServer set of benchmarks help to evaluate the performance and scalability of alternative platforms for J2EE applications, however, they cannot be used to evaluate the performance and scalability of concrete applications built on the selected platforms. In this paper, we present a systematic approach for evaluating and predicting the performance and scalability of J2EE applications based on modeling and simulation. The approach helps to identify and eliminate bottlenecks in the application design and ensure that systems are designed and sized to meet their quality of service requirements. We introduce our approach by showing how it can be applied to the SPECjAppServer2004 benchmark which is used as a representative J2EE application. A detailed model of a SPECjAppServer2004 deployment is built in a step-by-step fashion and then used to predict the behavior of the system under load. The approach is validated by comparing model predictions against measurements on the real system.','{J2EE Performance and Scalability - From Measuring to Predicting}',0,1,2006,1,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:56',0),(286,'paper','KoBu2006-WileyInterscience-QN_CaseStudy_J2EE','incollection','@incollection{KoBu2006-WileyInterscience-QN_CaseStudy_J2EE,\n author = {Samuel Kounev},\n title = {{Case Studies of Queueing Networks --- J2EE Applications}},\n edition = {2nd},\n isbn = {0471565253},\n month = {April},\n pages = {733--745},\n publisher = {Wiley-Interscience, John Wiley & Sons Inc.},\n booktitle = {{Queueing Networks and Markov Chains, edited by Gunter Bolch, Stefan Greiner, Hermann de Meer and Kishor Shridharbhai Trivedi}},\n url = {http://www.amazon.com/exec/obidos/tg/detail/-/0471565253/qid=1116860412/sr=1-3/ref=sr_1_3/103-1432544-4046230?v=glance&s=books},\n year = {2006},\n}\n\n','\n\nSamuel Kounev.\nCase Studies of Queueing Networks - J2EE Applications.\nIn Queueing Networks and Markov Chains, edited by Gunter Bolch,\nStefan Greiner, Hermann de Meer and Kishor Shridharbhai Trivedi, pages\n733-745. Wiley-Interscience, John Wiley & Sons Inc., 2nd edition, April\n2006.\n[ bib | http  ] 
\n@incollection{KoBu2006-WileyInterscience-QN_CaseStudy_J2EE,\nauthor = {Samuel Kounev},\ntitle = {{Case Studies of Queueing Networks --- J2EE Applications}},\nedition = {2nd},\nisbn = {0471565253},\nmonth = {April},\npages = {733--745},\npublisher = {Wiley-Interscience, John Wiley & Sons Inc.},\nbooktitle = {{Queueing Networks and Markov Chains, edited by Gunter Bolch, Stefan Greiner, Hermann de Meer and Kishor Shridharbhai Trivedi}},\nurl = {http://www.amazon.com/exec/obidos/tg/detail/-/0471565253/qid=1116860412/sr=1-3/ref=sr_1_3/103-1432544-4046230?v=glance&s=books},\nyear = {2006}\n}\n
\n
\n','
\n@incollection{KoBu2006-WileyInterscience-QN_CaseStudy_J2EE,\n  author = {Samuel Kounev},\n  title = {{Case Studies of Queueing Networks --- J2EE Applications}},\n  edition = {2nd},\n  isbn = {0471565253},\n  month = {April},\n  pages = {733--745},\n  publisher = {Wiley-Interscience, John Wiley & Sons Inc.},\n  booktitle = {{Queueing Networks and Markov Chains, edited by Gunter Bolch, Stefan Greiner, Hermann de Meer and Kishor Shridharbhai Trivedi}},\n  url = {http://www.amazon.com/exec/obidos/tg/detail/-/0471565253/qid=1116860412/sr=1-3/ref=sr_1_3/103-1432544-4046230?v=glance&s=books},\n  year = {2006}\n}\n
\n\n',NULL,'{Case Studies of Queueing Networks --- J2EE Applications}',0,4,2006,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(287,'paper','Ko2005-DEV2DEV-SPECjAppServer2004','misc','@misc{Ko2005-DEV2DEV-SPECjAppServer2004,\n abstract = {This article presents SPECjAppServer2004---the new industry-standard benchmark for measuring the performance and scalability of J2EE hardware and software platforms. SPECjAppServer2004 is a completely new benchmark and not comparable to the SPEC J2EE benchmarks released in late 2002. This article discusses the business domains and workload modeled by the benchmark, as well as the benchmark design and architecture. The author also explains the meaning of the benchmark metrics, discusses the different purposes the benchmark can be used, and provides some links to additional information.},\n author = {Samuel Kounev},\n howpublished = {DEV2DEV Article, O\'Reilly Publishing Group},\n month = {September},\n title = {{SPECjAppServer2004 - The New Way to Evaluate J2EE Performance}},\n url = {http://www.oracle.com/technology/pub/articles/dev2arch/2005/03/specjappserver2004.html},\n year = {2005},\n}\n\n','\n\nSamuel Kounev.\nSPECjAppServer2004 - The New Way to Evaluate J2EE Performance.\nDEV2DEV Article, O\'Reilly Publishing Group, September 2005.\n[ bib | .html | Abstract  ] 
\n@misc{Ko2005-DEV2DEV-SPECjAppServer2004,\nabstract = {This article presents SPECjAppServer2004---the new industry-standard benchmark for measuring the performance and scalability of J2EE hardware and software platforms. SPECjAppServer2004 is a completely new benchmark and not comparable to the SPEC J2EE benchmarks released in late 2002. This article discusses the business domains and workload modeled by the benchmark, as well as the benchmark design and architecture. The author also explains the meaning of the benchmark metrics, discusses the different purposes the benchmark can be used, and provides some links to additional information.},\nauthor = {Samuel Kounev},\nhowpublished = {DEV2DEV Article, O\'Reilly Publishing Group},\nmonth = {September},\ntitle = {{SPECjAppServer2004 - The New Way to Evaluate J2EE Performance}},\nurl = {http://www.oracle.com/technology/pub/articles/dev2arch/2005/03/specjappserver2004.html},\nyear = {2005}\n}\n
\n
\nThis article presents SPECjAppServer2004-the new industry-standard benchmark for measuring the performance and scalability of J2EE hardware and software platforms. SPECjAppServer2004 is a completely new benchmark and not comparable to the SPEC J2EE benchmarks released in late 2002. This article discusses the business domains and workload modeled by the benchmark, as well as the benchmark design and architecture. The author also explains the meaning of the benchmark metrics, discusses the different purposes the benchmark can be used, and provides some links to additional information.\n
\n','
\n@misc{Ko2005-DEV2DEV-SPECjAppServer2004,\n  abstract = {This article presents SPECjAppServer2004---the new industry-standard benchmark for measuring the performance and scalability of J2EE hardware and software platforms. SPECjAppServer2004 is a completely new benchmark and not comparable to the SPEC J2EE benchmarks released in late 2002. This article discusses the business domains and workload modeled by the benchmark, as well as the benchmark design and architecture. The author also explains the meaning of the benchmark metrics, discusses the different purposes the benchmark can be used, and provides some links to additional information.},\n  author = {Samuel Kounev},\n  howpublished = {DEV2DEV Article, O\'Reilly Publishing Group},\n  month = {September},\n  title = {{SPECjAppServer2004 - The New Way to Evaluate J2EE Performance}},\n  url = {http://www.oracle.com/technology/pub/articles/dev2arch/2005/03/specjappserver2004.html},\n  year = {2005}\n}\n
\n\n','This article presents SPECjAppServer2004---the new industry-standard benchmark for measuring the performance and scalability of J2EE hardware and software platforms. SPECjAppServer2004 is a completely new benchmark and not comparable to the SPEC J2EE benchmarks released in late 2002. This article discusses the business domains and workload modeled by the benchmark, as well as the benchmark design and architecture. The author also explains the meaning of the benchmark metrics, discusses the different purposes the benchmark can be used, and provides some links to additional information.','{SPECjAppServer2004 - The New Way to Evaluate J2EE Performance}',0,9,2005,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(288,'paper','Ko2005-TUD-PhD_Thesis','book','@book{Ko2005-TUD-PhD_Thesis,\n title = {Performance Engineering of Distributed Component-Based Systems - Benchmarking, Modeling and Performance Prediction},\n year = {2005},\n month = {December},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/288.pdf},\n publisher = {Shaker Verlag, Ph.D. Thesis, Technische Universit{\\\"a}t Darmstadt, Germany},\n isbn = {3832247130},\n author = {Kounev, Samuel},\n note = {Distinguished Dissertation Award},\n}\n\n','\n\nSamuel Kounev.\nPerformance Engineering of Distributed Component-Based Systems -\nBenchmarking, Modeling and Performance Prediction.\nShaker Verlag, Ph.D. Thesis, Technische Universität Darmstadt,\nGermany, December 2005.\nDistinguished Dissertation Award.\n[ bib | .pdf  ] 
\n@book{Ko2005-TUD-PhD_Thesis,\ntitle = {Performance Engineering of Distributed Component-Based Systems - Benchmarking, Modeling and Performance Prediction},\nyear = {2005},\nmonth = {December},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/288.pdf},\npublisher = {Shaker Verlag, Ph.D. Thesis, Technische Universit{\\\"a}t Darmstadt, Germany},\nisbn = {3832247130},\nauthor = {Kounev, Samuel},\nnote = {Distinguished Dissertation Award}\n}\n
\n
\n','
\n@book{Ko2005-TUD-PhD_Thesis,\n  title = {Performance Engineering of Distributed Component-Based Systems - Benchmarking, Modeling and Performance Prediction},\n  year = {2005},\n  month = {December},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/288.pdf},\n  publisher = {Shaker Verlag, Ph.D. Thesis, Technische Universit{\\\"a}t Darmstadt, Germany},\n  isbn = {3832247130},\n  author = {Kounev, Samuel},\n  note = {Distinguished Dissertation Award}\n}\n
\n\n',NULL,'Performance Engineering of Distributed Component-Based Systems - Benchmarking, Modeling and Performance Prediction',0,12,2005,12,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(289,'paper','Ko2003-SPEC-SPECjAppServer','techreport','@techreport{Ko2003-SPEC-SPECjAppServer,\n author = {Samuel Kounev},\n institution = {SPEC OSG Java Subcommittee},\n month = {September},\n number = {TUD03-1},\n title = {{Messaging Architecture and Asynchronous Interactions in SPECjAppServer}},\n year = {2003},\n}\n\n','\n\nSamuel Kounev.\nMessaging Architecture and Asynchronous Interactions in\nSPECjAppServer.\nTechnical Report TUD03-1, SPEC OSG Java Subcommittee, September 2003.\n[ bib  ] 
\n@techreport{Ko2003-SPEC-SPECjAppServer,\nauthor = {Samuel Kounev},\ninstitution = {SPEC OSG Java Subcommittee},\nmonth = {September},\nnumber = {TUD03-1},\ntitle = {{Messaging Architecture and Asynchronous Interactions in SPECjAppServer}},\nyear = {2003}\n}\n
\n
\n','
\n@techreport{Ko2003-SPEC-SPECjAppServer,\n  author = {Samuel Kounev},\n  institution = {SPEC OSG Java Subcommittee},\n  month = {September},\n  number = {TUD03-1},\n  title = {{Messaging Architecture and Asynchronous Interactions in SPECjAppServer}},\n  year = {2003}\n}\n
\n\n',NULL,'{Messaging Architecture and Asynchronous Interactions in SPECjAppServer}',0,9,2003,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(290,'paper','Ko2001-SUN-ECperf','techreport','@techreport{Ko2001-SUN-ECperf,\n author = {Samuel Kounev},\n institution = {ECperf Expert Group at Sun Microsystems Inc.},\n month = {September},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/290.pdf},\n title = {{Eliminating ECperf Persistence Bottlenecks when using RDBMS with Pessimistic Concurrency Control}},\n year = {2001},\n}\n\n','\n\nSamuel Kounev.\nEliminating ECperf Persistence Bottlenecks when using RDBMS with\nPessimistic Concurrency Control.\nTechnical report, ECperf Expert Group at Sun Microsystems Inc.,\nSeptember 2001.\n[ bib | .pdf  ] 
\n@techreport{Ko2001-SUN-ECperf,\nauthor = {Samuel Kounev},\ninstitution = {ECperf Expert Group at Sun Microsystems Inc.},\nmonth = {September},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/290.pdf},\ntitle = {{Eliminating ECperf Persistence Bottlenecks when using RDBMS with Pessimistic Concurrency Control}},\nyear = {2001}\n}\n
\n
\n','
\n@techreport{Ko2001-SUN-ECperf,\n  author = {Samuel Kounev},\n  institution = {ECperf Expert Group at Sun Microsystems Inc.},\n  month = {September},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/290.pdf},\n  title = {{Eliminating ECperf Persistence Bottlenecks when using RDBMS with Pessimistic Concurrency Control}},\n  year = {2001}\n}\n
\n\n',NULL,'{Eliminating ECperf Persistence Bottlenecks when using RDBMS with Pessimistic Concurrency Control}',0,9,2001,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(291,'paper','Ko2001-TUD-CapPlanMethod','techreport','@techreport{Ko2001-TUD-CapPlanMethod,\n author = {Samuel Kounev},\n institution = {Technische Universit{\\\"{a}}t Darmstadt, Germany},\n month = {February},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/291.pdf},\n title = {{A Capacity Planning Methodology for Distributed E-Commerce Applications}},\n year = {2001},\n}\n\n','\n\nSamuel Kounev.\nA Capacity Planning Methodology for Distributed E-Commerce\nApplications.\nTechnical report, Technische Universität Darmstadt, Germany,\nFebruary 2001.\n[ bib | .pdf  ] 
\n@techreport{Ko2001-TUD-CapPlanMethod,\nauthor = {Samuel Kounev},\ninstitution = {Technische Universit{\\\"{a}}t Darmstadt, Germany},\nmonth = {February},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/291.pdf},\ntitle = {{A Capacity Planning Methodology for Distributed E-Commerce Applications}},\nyear = {2001}\n}\n
\n
\n','
\n@techreport{Ko2001-TUD-CapPlanMethod,\n  author = {Samuel Kounev},\n  institution = {Technische Universit{\\\"{a}}t Darmstadt, Germany},\n  month = {February},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/291.pdf},\n  title = {{A Capacity Planning Methodology for Distributed E-Commerce Applications}},\n  year = {2001}\n}\n
\n\n',NULL,'{A Capacity Planning Methodology for Distributed E-Commerce Applications}',0,2,2001,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(292,'paper','Ko2001-TUD-PerfPred','techreport','@techreport{Ko2001-TUD-PerfPred,\n author = {Samuel Kounev},\n institution = {Technische Universit{\\\"{a}}t Darmstadt, Germany},\n month = {January},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/292.pdf},\n title = {{Performance Prediction, Sizing and Capacity Planning for Distributed E-Commerce Applications}},\n year = {2001},\n}\n\n','\n\nSamuel Kounev.\nPerformance Prediction, Sizing and Capacity Planning for Distributed\nE-Commerce Applications.\nTechnical report, Technische Universität Darmstadt, Germany,\nJanuary 2001.\n[ bib | .pdf  ] 
\n@techreport{Ko2001-TUD-PerfPred,\nauthor = {Samuel Kounev},\ninstitution = {Technische Universit{\\\"{a}}t Darmstadt, Germany},\nmonth = {January},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/292.pdf},\ntitle = {{Performance Prediction, Sizing and Capacity Planning for Distributed E-Commerce Applications}},\nyear = {2001}\n}\n
\n
\n','
\n@techreport{Ko2001-TUD-PerfPred,\n  author = {Samuel Kounev},\n  institution = {Technische Universit{\\\"{a}}t Darmstadt, Germany},\n  month = {January},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/292.pdf},\n  title = {{Performance Prediction, Sizing and Capacity Planning for Distributed E-Commerce Applications}},\n  year = {2001}\n}\n
\n\n',NULL,'{Performance Prediction, Sizing and Capacity Planning for Distributed E-Commerce Applications}',0,1,2001,1,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(293,'paper','Ko1999-UNI_SOFIA-MSc_Thesis','mastersthesis','@mastersthesis{Ko1999-UNI_SOFIA-MSc_Thesis,\n address = {Sofia, Bulgaria},\n author = {Samuel Kounev},\n month = {August},\n school = {University of Sofia},\n title = {{Design and Development of an Electronic Commerce Environment}},\n year = {1999},\n}\n\n','\n\nSamuel Kounev.\nDesign and Development of an Electronic Commerce Environment.\nMaster\'s thesis, University of Sofia, Sofia, Bulgaria, August 1999.\n[ bib  ] 
\n@mastersthesis{Ko1999-UNI_SOFIA-MSc_Thesis,\naddress = {Sofia, Bulgaria},\nauthor = {Samuel Kounev},\nmonth = {August},\nschool = {University of Sofia},\ntitle = {{Design and Development of an Electronic Commerce Environment}},\nyear = {1999}\n}\n
\n
\n','
\n@mastersthesis{Ko1999-UNI_SOFIA-MSc_Thesis,\n  address = {Sofia, Bulgaria},\n  author = {Samuel Kounev},\n  month = {August},\n  school = {University of Sofia},\n  title = {{Design and Development of an Electronic Commerce Environment}},\n  year = {1999}\n}\n
\n\n',NULL,'{Design and Development of an Electronic Commerce Environment}',0,8,1999,8,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(294,'paper','KoBeBrHuOk2011-SIMUTools-DataFabrics','inproceedings','@inproceedings{KoBeBrHuOk2011-SIMUTools-DataFabrics,\n title = {Automated Simulation-Based Capacity Planning for Enterprise Data Fabrics},\n year = {2011},\n month = {March},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/294.pdf},\n booktitle = {4th International ICST Conference on Simulation Tools and Techniques (SIMUtools 2011), March 21--25, 2011, Barcelona, Spain},\n author = {Kounev, Samuel and Bender, Konstantin and Brosig, Fabian and Huber, Nikolaus and Okamoto, Russell},\n note = {Acceptance Rate (Full Paper): 29.8\\% (23/77), ICST Best Paper Award},\n}\n\n','\n\nSamuel Kounev, Konstantin Bender, Fabian Brosig, Nikolaus Huber, and Russell\nOkamoto.\nAutomated simulation-based capacity planning for enterprise data\nfabrics.\nIn 4th International ICST Conference on Simulation Tools and\nTechniques (SIMUtools 2011), March 21-25, 2011, Barcelona, Spain, March\n2011.\nAcceptance Rate (Full Paper): 29.8% (23/77), ICST Best Paper\nAward.\n[ bib | .pdf  ] 
\n@inproceedings{KoBeBrHuOk2011-SIMUTools-DataFabrics,\ntitle = {Automated Simulation-Based Capacity Planning for Enterprise Data Fabrics},\nyear = {2011},\nmonth = {March},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/294.pdf},\nbooktitle = {4th International ICST Conference on Simulation Tools and Techniques (SIMUtools 2011), March 21--25, 2011, Barcelona, Spain},\nauthor = {Kounev, Samuel and Bender, Konstantin and Brosig, Fabian and Huber, Nikolaus and Okamoto, Russell},\nnote = {Acceptance Rate (Full Paper): 29.8\\% (23/77), ICST Best Paper Award}\n}\n
\n
\n','
\n@inproceedings{KoBeBrHuOk2011-SIMUTools-DataFabrics,\n  title = {Automated Simulation-Based Capacity Planning for Enterprise Data Fabrics},\n  year = {2011},\n  month = {March},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/294.pdf},\n  booktitle = {4th International ICST Conference on Simulation Tools and Techniques (SIMUtools 2011), March 21--25, 2011, Barcelona, Spain},\n  author = {Kounev, Samuel and Bender, Konstantin and Brosig, Fabian and Huber, Nikolaus and Okamoto, Russell},\n  note = {Acceptance Rate (Full Paper): 29.8\\% (23/77), ICST Best Paper Award}\n}\n
\n\n',NULL,'Automated Simulation-Based Capacity Planning for Enterprise Data Fabrics',0,3,2011,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(295,'paper','KoBrHu2014-TechReport-DML','techreport','@techreport{KoBrHu2014-TechReport-DML,\n abstract = {{This technical report introduces the Descartes Modeling Language (DML), a new architecture-level modeling language for modeling Quality-of-Service (QoS) and resource management related aspects of modern dynamic IT systems, infrastructures and services. DML is designed to serve as a basis for self-aware resource management during operation ensuring that system QoS requirements are continuously satisfied while infrastructure resources are utilized as efficiently as possible.}},\n author = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\n institution = {{Department of Computer Science, University of Wuerzburg}},\n title = {{The Descartes Modeling Language}},\n url = {http://www.descartes-research.net/dml/},\n http = {http://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/10488},\n pdf = {http://opus.bibliothek.uni-wuerzburg.de/files/10488/DML-TechReport-1.0.pdf},\n year = {2014},\n numpages = {91},\n month = {October},\n}\n\n','\n\nSamuel Kounev, Fabian Brosig, and Nikolaus Huber.\nThe Descartes Modeling Language.\nTechnical report, Department of Computer Science, University of\nWuerzburg, October 2014.\n[ bib | http | http | .pdf | Abstract  ] 
\n@techreport{KoBrHu2014-TechReport-DML,\nabstract = {{This technical report introduces the Descartes Modeling Language (DML), a new architecture-level modeling language for modeling Quality-of-Service (QoS) and resource management related aspects of modern dynamic IT systems, infrastructures and services. DML is designed to serve as a basis for self-aware resource management during operation ensuring that system QoS requirements are continuously satisfied while infrastructure resources are utilized as efficiently as possible.}},\nauthor = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\ninstitution = {{Department of Computer Science, University of Wuerzburg}},\ntitle = {{The Descartes Modeling Language}},\nurl = {http://www.descartes-research.net/dml/},\nhttp = {http://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/10488},\npdf = {http://opus.bibliothek.uni-wuerzburg.de/files/10488/DML-TechReport-1.0.pdf},\nyear = {2014},\nnumpages = {91},\nmonth = {October}\n}\n
\n
\nThis technical report introduces the Descartes Modeling Language (DML), a new architecture-level modeling language for modeling Quality-of-Service (QoS) and resource management related aspects of modern dynamic IT systems, infrastructures and services. DML is designed to serve as a basis for self-aware resource management during operation ensuring that system QoS requirements are continuously satisfied while infrastructure resources are utilized as efficiently as possible.\n
\n','
\n@techreport{KoBrHu2014-TechReport-DML,\n  abstract = {{This technical report introduces the Descartes Modeling Language (DML), a new architecture-level modeling language for modeling Quality-of-Service (QoS) and resource management related aspects of modern dynamic IT systems, infrastructures and services. DML is designed to serve as a basis for self-aware resource management during operation ensuring that system QoS requirements are continuously satisfied while infrastructure resources are utilized as efficiently as possible.}},\n  author = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\n  institution = {{Department of Computer Science, University of Wuerzburg}},\n  title = {{The Descartes Modeling Language}},\n  url = {http://www.descartes-research.net/dml/},\n  http = {http://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/10488},\n  pdf = {http://opus.bibliothek.uni-wuerzburg.de/files/10488/DML-TechReport-1.0.pdf},\n  year = {2014},\n  numpages = {91},\n  month = {October}\n}\n
\n\n','{This technical report introduces the Descartes Modeling Language (DML), a new architecture-level modeling language for modeling Quality-of-Service (QoS) and resource management related aspects of modern dynamic IT systems, infrastructures and services. DML is designed to serve as a basis for self-aware resource management during operation ensuring that system QoS requirements are continuously satisfied while infrastructure resources are utilized as efficiently as possible.}','{The Descartes Modeling Language}',0,10,2014,10,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(296,'paper','KoBrHu2011-ICAC-QoSManagement','inproceedings','@inproceedings{KoBrHu2011-ICAC-QoSManagement,\n abstract = {We present an overview of our work-in-progress and long-term research agenda aiming to develop a novel methodology for engineering of self-aware software systems. The latter will have built-in architecture-level QoS models enhanced to capture dynamic aspects of the system environment and maintained automatically during operation. The models will be exploited at run-time to adapt the system to changes in the environment ensuring that resources are utilized efficiently and QoS requirements are satisfied.},\n author = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\n booktitle = {8th International Conference on Autonomic Computing (ICAC 2011)},\n day = {14--18},\n location = {Karlsruhe, Germany},\n month = {June},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/296.pdf},\n title = {{Self-Aware QoS Management in Virtualized Infrastructures}},\n titleaddon = {{(Poster Paper)}},\n year = {2011},\n}\n\n','\n\nSamuel Kounev, Fabian Brosig, and Nikolaus Huber.\nSelf-Aware QoS Management in Virtualized Infrastructures (Poster\nPaper).\nIn 8th International Conference on Autonomic Computing (ICAC\n2011), Karlsruhe, Germany, June 14-18, 2011.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{KoBrHu2011-ICAC-QoSManagement,\nabstract = {We present an overview of our work-in-progress and long-term research agenda aiming to develop a novel methodology for engineering of self-aware software systems. The latter will have built-in architecture-level QoS models enhanced to capture dynamic aspects of the system environment and maintained automatically during operation. The models will be exploited at run-time to adapt the system to changes in the environment ensuring that resources are utilized efficiently and QoS requirements are satisfied.},\nauthor = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\nbooktitle = {8th International Conference on Autonomic Computing (ICAC 2011)},\nday = {14--18},\nlocation = {Karlsruhe, Germany},\nmonth = {June},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/296.pdf},\ntitle = {{Self-Aware QoS Management in Virtualized Infrastructures}},\ntitleaddon = {{(Poster Paper)}},\nyear = {2011}\n}\n
\n
\nWe present an overview of our work-in-progress and long-term research agenda aiming to develop a novel methodology for engineering of self-aware software systems. The latter will have built-in architecture-level QoS models enhanced to capture dynamic aspects of the system environment and maintained automatically during operation. The models will be exploited at run-time to adapt the system to changes in the environment ensuring that resources are utilized efficiently and QoS requirements are satisfied.\n
\n','
\n@inproceedings{KoBrHu2011-ICAC-QoSManagement,\n  abstract = {We present an overview of our work-in-progress and long-term research agenda aiming to develop a novel methodology for engineering of self-aware software systems. The latter will have built-in architecture-level QoS models enhanced to capture dynamic aspects of the system environment and maintained automatically during operation. The models will be exploited at run-time to adapt the system to changes in the environment ensuring that resources are utilized efficiently and QoS requirements are satisfied.},\n  author = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\n  booktitle = {8th International Conference on Autonomic Computing (ICAC 2011)},\n  day = {14--18},\n  location = {Karlsruhe, Germany},\n  month = {June},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/296.pdf},\n  title = {{Self-Aware QoS Management in Virtualized Infrastructures}},\n  titleaddon = {{(Poster Paper)}},\n  year = {2011}\n}\n
\n\n','We present an overview of our work-in-progress and long-term research agenda aiming to develop a novel methodology for engineering of self-aware software systems. The latter will have built-in architecture-level QoS models enhanced to capture dynamic aspects of the system environment and maintained automatically during operation. The models will be exploited at run-time to adapt the system to changes in the environment ensuring that resources are utilized efficiently and QoS requirements are satisfied.','{Self-Aware QoS Management in Virtualized Infrastructures}',0,6,2011,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(297,'paper','KoBrHuRe2010-SCC-Towards','inproceedings','@inproceedings{KoBrHuRe2010-SCC-Towards,\n abstract = {Modern service-oriented systems have increasingly complex loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operating costs. This is due to the inability to predict at run-time the effect of dynamic changes in the system environment (e.g., varying service workloads) and adapt the system configuration accordingly. In this paper, we describe a long-term vision and approach for designing systems with built-in self-aware performance and resource management capabilities. We advocate the use of architecture-level performance models extracted dynamically from the evolving system configuration and maintained automatically during operation. The models will be exploited at run-time to adapt the system to changes in the environment ensuring that resources are utilized efficiently and performance requirements are continuously satisfied.},\n author = {Samuel Kounev and Fabian Brosig and Nikolaus Huber and Ralf Reussner},\n booktitle = {Proceedings of the 7th IEEE International Conference on Services Computing (SCC 2010), July 5-10, Miami, Florida, USA},\n day = {5--10},\n location = {Miami, Florida, USA},\n month = {July},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/297.pdf},\n publisher = {IEEE Computer Society},\n title = {{Towards self-aware performance and resource management in modern service-oriented systems}},\n year = {2010},\n}\n\n','\n\nSamuel Kounev, Fabian Brosig, Nikolaus Huber, and Ralf Reussner.\nTowards self-aware performance and resource management in modern\nservice-oriented systems.\nIn Proceedings of the 7th IEEE International Conference on\nServices Computing (SCC 2010), July 5-10, Miami, Florida, USA, Miami,\nFlorida, USA, July 5-10, 2010. IEEE Computer Society.\nJuly 2010.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{KoBrHuRe2010-SCC-Towards,\nabstract = {Modern service-oriented systems have increasingly complex loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operating costs. This is due to the inability to predict at run-time the effect of dynamic changes in the system environment (e.g., varying service workloads) and adapt the system configuration accordingly. In this paper, we describe a long-term vision and approach for designing systems with built-in self-aware performance and resource management capabilities. We advocate the use of architecture-level performance models extracted dynamically from the evolving system configuration and maintained automatically during operation. The models will be exploited at run-time to adapt the system to changes in the environment ensuring that resources are utilized efficiently and performance requirements are continuously satisfied.},\nauthor = {Samuel Kounev and Fabian Brosig and Nikolaus Huber and Ralf Reussner},\nbooktitle = {Proceedings of the 7th IEEE International Conference on Services Computing (SCC 2010), July 5-10, Miami, Florida, USA},\nday = {5--10},\nlocation = {Miami, Florida, USA},\nmonth = {July},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/297.pdf},\npublisher = {IEEE Computer Society},\ntitle = {{Towards self-aware performance and resource management in modern service-oriented systems}},\nyear = {2010}\n}\n
\n
\nModern service-oriented systems have increasingly complex loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operating costs. This is due to the inability to predict at run-time the effect of dynamic changes in the system environment (e.g., varying service workloads) and adapt the system configuration accordingly. In this paper, we describe a long-term vision and approach for designing systems with built-in self-aware performance and resource management capabilities. We advocate the use of architecture-level performance models extracted dynamically from the evolving system configuration and maintained automatically during operation. The models will be exploited at run-time to adapt the system to changes in the environment ensuring that resources are utilized efficiently and performance requirements are continuously satisfied.\n
\n','
\n@inproceedings{KoBrHuRe2010-SCC-Towards,\n  abstract = {Modern service-oriented systems have increasingly complex loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operating costs. This is due to the inability to predict at run-time the effect of dynamic changes in the system environment (e.g., varying service workloads) and adapt the system configuration accordingly. In this paper, we describe a long-term vision and approach for designing systems with built-in self-aware performance and resource management capabilities. We advocate the use of architecture-level performance models extracted dynamically from the evolving system configuration and maintained automatically during operation. The models will be exploited at run-time to adapt the system to changes in the environment ensuring that resources are utilized efficiently and performance requirements are continuously satisfied.},\n  author = {Samuel Kounev and Fabian Brosig and Nikolaus Huber and Ralf Reussner},\n  booktitle = {Proceedings of the 7th IEEE International Conference on Services Computing (SCC 2010), July 5-10, Miami, Florida, USA},\n  day = {5--10},\n  location = {Miami, Florida, USA},\n  month = {July},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/297.pdf},\n  publisher = {IEEE Computer Society},\n  title = {{Towards self-aware performance and resource management in modern service-oriented systems}},\n  year = {2010}\n}\n
\n\n','Modern service-oriented systems have increasingly complex loosely-coupled architectures that often exhibit poor performance and resource efficiency and have high operating costs. This is due to the inability to predict at run-time the effect of dynamic changes in the system environment (e.g., varying service workloads) and adapt the system configuration accordingly. In this paper, we describe a long-term vision and approach for designing systems with built-in self-aware performance and resource management capabilities. We advocate the use of architecture-level performance models extracted dynamically from the evolving system configuration and maintained automatically during operation. The models will be exploited at run-time to adapt the system to changes in the environment ensuring that resources are utilized efficiently and performance requirements are continuously satisfied.','{Towards self-aware performance and resource management in modern service-oriented systems}',0,7,2010,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(298,'paper','KoBu2007-ARS-OnTheUseOfQPNs','incollection','@inbook{KoBu2007-ARS-OnTheUseOfQPNs,\n title = {Petri Net, Theory and Application},\n year = {2007},\n month = {2},\n abstract = {Predictive performance models are used increasingly throughout the phases of the software engineering lifecycle of distributed systems. However, as systems grow in size and complexity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. The challenge stems from the limited model expressiveness on the one hand and the limited scalability of model analysis techniques on the other. This chapter presents a novel methodology for modeling and performance analysis of distributed systems. The methodology is based on queueing Petri nets (QPNs) which provide greater modeling power and expressiveness than conventional modeling paradigms such as queueing networks and generalized stochastic Petri nets. Using QPNs, one can integrate both hardware and software aspects of system behavior into the same model. In addition to hardware contention and scheduling strategies, QPNs make it easy to model software contention, simultaneous resource possession, synchronization, blocking and asynchronous processing. These aspects have significant impact on the performance of modern distributed systems. To avoid the problem of state space explosion, our methodology uses discrete event simulation for model analysis. We propose an efficient and reliable method for simulation of QPNs. As a validation of our approach, we present a case study of a real-world distributed system, showing how our methodology is applied in a step-by-step fashion to evaluate the system performance and scalability. The system studied is a deployment of the industry-standard SPECjAppServer2004 benchmark. A detailed model of the system and its workload is built and used to predict the system performance for several deployment configurations and workload scenarios of interest. Taking advantage of the expressive power of QPNs, our approach makes it possible to model systems at a higher degree of accuracy providing a number of important benefits.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/298.pdf},\n editor = {Vedran Kordic},\n publisher = {Advanced Robotic Systems International, I-Tech Education and Publishing},\n address = {Vienna, Austria},\n chapter = {On the Use of Queueing Petri Nets for Modeling and Performance Analysis of Distributed Systems},\n isbn = {978-3-902613-12-7},\n author = {Kounev, Samuel and Buchmann, Alejandro},\n}\n\n','\n\nSamuel Kounev and Alejandro Buchmann.\nPetri Net, Theory and Application, chapter On the Use of\nQueueing Petri Nets for Modeling and Performance Analysis of Distributed\nSystems, Vedran Kordic, editor.\nAdvanced Robotic Systems International, I-Tech Education and\nPublishing, Vienna, Austria, 2 2007.\n[ bib | .pdf | Abstract  ] 
\n@inbook{KoBu2007-ARS-OnTheUseOfQPNs,\ntitle = {Petri Net, Theory and Application},\nyear = {2007},\nmonth = {2},\nabstract = {Predictive performance models are used increasingly throughout the phases of the software engineering lifecycle of distributed systems. However, as systems grow in size and complexity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. The challenge stems from the limited model expressiveness on the one hand and the limited scalability of model analysis techniques on the other. This chapter presents a novel methodology for modeling and performance analysis of distributed systems. The methodology is based on queueing Petri nets (QPNs) which provide greater modeling power and expressiveness than conventional modeling paradigms such as queueing networks and generalized stochastic Petri nets. Using QPNs, one can integrate both hardware and software aspects of system behavior into the same model. In addition to hardware contention and scheduling strategies, QPNs make it easy to model software contention, simultaneous resource possession, synchronization, blocking and asynchronous processing. These aspects have significant impact on the performance of modern distributed systems. To avoid the problem of state space explosion, our methodology uses discrete event simulation for model analysis. We propose an efficient and reliable method for simulation of QPNs. As a validation of our approach, we present a case study of a real-world distributed system, showing how our methodology is applied in a step-by-step fashion to evaluate the system performance and scalability. The system studied is a deployment of the industry-standard SPECjAppServer2004 benchmark. A detailed model of the system and its workload is built and used to predict the system performance for several deployment configurations and workload scenarios of interest. Taking advantage of the expressive power of QPNs, our approach makes it possible to model systems at a higher degree of accuracy providing a number of important benefits.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/298.pdf},\neditor = {Vedran Kordic},\npublisher = {Advanced Robotic Systems International, I-Tech Education and Publishing},\naddress = {Vienna, Austria},\nchapter = {On the Use of Queueing Petri Nets for Modeling and Performance Analysis of Distributed Systems},\nisbn = {978-3-902613-12-7},\nauthor = {Kounev, Samuel and Buchmann, Alejandro}\n}\n
\n
\nPredictive performance models are used increasingly throughout the phases of the software engineering lifecycle of distributed systems. However, as systems grow in size and complexity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. The challenge stems from the limited model expressiveness on the one hand and the limited scalability of model analysis techniques on the other. This chapter presents a novel methodology for modeling and performance analysis of distributed systems. The methodology is based on queueing Petri nets (QPNs) which provide greater modeling power and expressiveness than conventional modeling paradigms such as queueing networks and generalized stochastic Petri nets. Using QPNs, one can integrate both hardware and software aspects of system behavior into the same model. In addition to hardware contention and scheduling strategies, QPNs make it easy to model software contention, simultaneous resource possession, synchronization, blocking and asynchronous processing. These aspects have significant impact on the performance of modern distributed systems. To avoid the problem of state space explosion, our methodology uses discrete event simulation for model analysis. We propose an efficient and reliable method for simulation of QPNs. As a validation of our approach, we present a case study of a real-world distributed system, showing how our methodology is applied in a step-by-step fashion to evaluate the system performance and scalability. The system studied is a deployment of the industry-standard SPECjAppServer2004 benchmark. A detailed model of the system and its workload is built and used to predict the system performance for several deployment configurations and workload scenarios of interest. Taking advantage of the expressive power of QPNs, our approach makes it possible to model systems at a higher degree of accuracy providing a number of important benefits.\n
\n','
\n@inbook{KoBu2007-ARS-OnTheUseOfQPNs,\n  title = {Petri Net, Theory and Application},\n  year = {2007},\n  month = {2},\n  abstract = {Predictive performance models are used increasingly throughout the phases of the software engineering lifecycle of distributed systems. However, as systems grow in size and complexity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. The challenge stems from the limited model expressiveness on the one hand and the limited scalability of model analysis techniques on the other. This chapter presents a novel methodology for modeling and performance analysis of distributed systems. The methodology is based on queueing Petri nets (QPNs) which provide greater modeling power and expressiveness than conventional modeling paradigms such as queueing networks and generalized stochastic Petri nets. Using QPNs, one can integrate both hardware and software aspects of system behavior into the same model. In addition to hardware contention and scheduling strategies, QPNs make it easy to model software contention, simultaneous resource possession, synchronization, blocking and asynchronous processing. These aspects have significant impact on the performance of modern distributed systems. To avoid the problem of state space explosion, our methodology uses discrete event simulation for model analysis. We propose an efficient and reliable method for simulation of QPNs. As a validation of our approach, we present a case study of a real-world distributed system, showing how our methodology is applied in a step-by-step fashion to evaluate the system performance and scalability. The system studied is a deployment of the industry-standard SPECjAppServer2004 benchmark. A detailed model of the system and its workload is built and used to predict the system performance for several deployment configurations and workload scenarios of interest. Taking advantage of the expressive power of QPNs, our approach makes it possible to model systems at a higher degree of accuracy providing a number of important benefits.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/298.pdf},\n  editor = {Vedran Kordic},\n  publisher = {Advanced Robotic Systems International, I-Tech Education and Publishing},\n  address = {Vienna, Austria},\n  chapter = {On the Use of Queueing Petri Nets for Modeling and Performance Analysis of Distributed Systems},\n  isbn = {978-3-902613-12-7},\n  author = {Kounev, Samuel and Buchmann, Alejandro}\n}\n
\n\n','Predictive performance models are used increasingly throughout the phases of the software engineering lifecycle of distributed systems. However, as systems grow in size and complexity, building models that accurately capture the different aspects of their behavior becomes a more and more challenging task. The challenge stems from the limited model expressiveness on the one hand and the limited scalability of model analysis techniques on the other. This chapter presents a novel methodology for modeling and performance analysis of distributed systems. The methodology is based on queueing Petri nets (QPNs) which provide greater modeling power and expressiveness than conventional modeling paradigms such as queueing networks and generalized stochastic Petri nets. Using QPNs, one can integrate both hardware and software aspects of system behavior into the same model. In addition to hardware contention and scheduling strategies, QPNs make it easy to model software contention, simultaneous resource possession, synchronization, blocking and asynchronous processing. These aspects have significant impact on the performance of modern distributed systems. To avoid the problem of state space explosion, our methodology uses discrete event simulation for model analysis. We propose an efficient and reliable method for simulation of QPNs. As a validation of our approach, we present a case study of a real-world distributed system, showing how our methodology is applied in a step-by-step fashion to evaluate the system performance and scalability. The system studied is a deployment of the industry-standard SPECjAppServer2004 benchmark. A detailed model of the system and its workload is built and used to predict the system performance for several deployment configurations and workload scenarios of interest. Taking advantage of the expressive power of QPNs, our approach makes it possible to model systems at a higher degree of accuracy providing a number of important benefits.','{{On the Use of Queueing Petri Nets for Modeling and Performance Analysis of Distributed Systems}}',0,2,2007,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(299,'paper','KoBu2006-PERFEVAL-SimQPN','article','@article{KoBu2006-PERFEVAL-SimQPN,\n title = {{SimQPN - a tool and methodology for analyzing queueing Petri net models by means of simulation}},\n journal = {Performance Evaluation},\n year = {2006},\n month = {5},\n volume = {63},\n number = {4-5},\n pages = {364--394},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/299.pdf},\n publisher = {Elsevier Science Publishers B. V.},\n address = {Amsterdam, The Netherlands},\n issn = {0166-5316},\n doi = {10.1016/j.peva.2005.03.004},\n author = {Kounev, Samuel and Buchmann, Alejandro},\n}\n\n','\n\nSamuel Kounev and Alejandro Buchmann.\nSimQPN - a tool and methodology for analyzing queueing Petri net\nmodels by means of simulation.\nPerformance Evaluation, 63(4-5):364-394, 5 2006, Elsevier\nScience Publishers B. V., Amsterdam, The Netherlands.\n[ bib | DOI | .pdf  ] 
\n@article{KoBu2006-PERFEVAL-SimQPN,\ntitle = {{SimQPN - a tool and methodology for analyzing queueing Petri net models by means of simulation}},\njournal = {Performance Evaluation},\nyear = {2006},\nmonth = {5},\nvolume = {63},\nnumber = {4-5},\npages = {364--394},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/299.pdf},\npublisher = {Elsevier Science Publishers B. V.},\naddress = {Amsterdam, The Netherlands},\nissn = {0166-5316},\ndoi = {10.1016/j.peva.2005.03.004},\nauthor = {Kounev, Samuel and Buchmann, Alejandro}\n}\n
\n
\n','
\n@article{KoBu2006-PERFEVAL-SimQPN,\n  title = {{SimQPN - a tool and methodology for analyzing queueing Petri net models by means of simulation}},\n  journal = {Performance Evaluation},\n  year = {2006},\n  month = {5},\n  volume = {63},\n  number = {4-5},\n  pages = {364--394},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/299.pdf},\n  publisher = {Elsevier Science Publishers B. V.},\n  address = {Amsterdam, The Netherlands},\n  issn = {0166-5316},\n  doi = {10.1016/j.peva.2005.03.004},\n  author = {Kounev, Samuel and Buchmann, Alejandro}\n}\n
\n\n',NULL,'{SimQPN - a tool and methodology for analyzing queueing Petri net models by means of simulation}',0,5,2006,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(300,'paper','KoBu2003-CMG-PerfModeling_J2EEApps','inproceedings','@inproceedings{KoBu2003-CMG-PerfModeling_J2EEApps,\n abstract = {Modern J2EE applications are typically based on highly distributed architectures comprising multiple components deployed in a clustered environment. This makes it difficult for deployers to estimate the capacity of the deployment environment needed to guarantee that Service Level Agreements are met. This paper looks at the different approaches to this problem and discusses the difficulties that arise when one tries to apply them to large, real-world systems. The authors study a realistic J2EE application (the SPECjAppServer2002 benchmark) and show how analytical models can be exploited for capacity planning.},\n author = {Samuel Kounev and Alejandro Buchmann},\n booktitle = {Proceedings of the 29th International Conference of the Computer Measurement Group on Resource Management and Performance Evaluation of Enterprise Computing Systems (CMG 2003), Dallas, Texas, USA, December 7-12, 2003},\n month = {December},\n note = {Best-Paper-Award},\n organization = {Computer Measurement Group (CMG)},\n pages = {273--283},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/300.pdf},\n title = {{Performance Modeling and Evaluation of Large-Scale J2EE Applications}},\n url = {http://www.cmg.org/proceedings/2003/3173.pdf},\n year = {2003},\n}\n\n','\n\nSamuel Kounev and Alejandro Buchmann.\nPerformance Modeling and Evaluation of Large-Scale J2EE\nApplications.\nIn Proceedings of the 29th International Conference of the\nComputer Measurement Group on Resource Management and Performance Evaluation\nof Enterprise Computing Systems (CMG 2003), Dallas, Texas, USA, December\n7-12, 2003, December 2003, pages 273-283. Computer Measurement Group (CMG).\nBest-Paper-Award.\n[ bib | .pdf | .pdf | Abstract  ] 
\n@inproceedings{KoBu2003-CMG-PerfModeling_J2EEApps,\nabstract = {Modern J2EE applications are typically based on highly distributed architectures comprising multiple components deployed in a clustered environment. This makes it difficult for deployers to estimate the capacity of the deployment environment needed to guarantee that Service Level Agreements are met. This paper looks at the different approaches to this problem and discusses the difficulties that arise when one tries to apply them to large, real-world systems. The authors study a realistic J2EE application (the SPECjAppServer2002 benchmark) and show how analytical models can be exploited for capacity planning.},\nauthor = {Samuel Kounev and Alejandro Buchmann},\nbooktitle = {Proceedings of the 29th International Conference of the Computer Measurement Group on Resource Management and Performance Evaluation of Enterprise Computing Systems (CMG 2003), Dallas, Texas, USA, December 7-12, 2003},\nmonth = {December},\nnote = {Best-Paper-Award},\norganization = {Computer Measurement Group (CMG)},\npages = {273--283},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/300.pdf},\ntitle = {{Performance Modeling and Evaluation of Large-Scale J2EE Applications}},\nurl = {http://www.cmg.org/proceedings/2003/3173.pdf},\nyear = {2003}\n}\n
\n
\nModern J2EE applications are typically based on highly distributed architectures comprising multiple components deployed in a clustered environment. This makes it difficult for deployers to estimate the capacity of the deployment environment needed to guarantee that Service Level Agreements are met. This paper looks at the different approaches to this problem and discusses the difficulties that arise when one tries to apply them to large, real-world systems. The authors study a realistic J2EE application (the SPECjAppServer2002 benchmark) and show how analytical models can be exploited for capacity planning.\n
\n','
\n@inproceedings{KoBu2003-CMG-PerfModeling_J2EEApps,\n  abstract = {Modern J2EE applications are typically based on highly distributed architectures comprising multiple components deployed in a clustered environment. This makes it difficult for deployers to estimate the capacity of the deployment environment needed to guarantee that Service Level Agreements are met. This paper looks at the different approaches to this problem and discusses the difficulties that arise when one tries to apply them to large, real-world systems. The authors study a realistic J2EE application (the SPECjAppServer2002 benchmark) and show how analytical models can be exploited for capacity planning.},\n  author = {Samuel Kounev and Alejandro Buchmann},\n  booktitle = {Proceedings of the 29th International Conference of the Computer Measurement Group on Resource Management and Performance Evaluation of Enterprise Computing Systems (CMG 2003), Dallas, Texas, USA, December 7-12, 2003},\n  month = {December},\n  note = {Best-Paper-Award},\n  organization = {Computer Measurement Group (CMG)},\n  pages = {273--283},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/300.pdf},\n  title = {{Performance Modeling and Evaluation of Large-Scale J2EE Applications}},\n  url = {http://www.cmg.org/proceedings/2003/3173.pdf},\n  year = {2003}\n}\n
\n\n','Modern J2EE applications are typically based on highly distributed architectures comprising multiple components deployed in a clustered environment. This makes it difficult for deployers to estimate the capacity of the deployment environment needed to guarantee that Service Level Agreements are met. This paper looks at the different approaches to this problem and discusses the difficulties that arise when one tries to apply them to large, real-world systems. The authors study a realistic J2EE application (the SPECjAppServer2002 benchmark) and show how analytical models can be exploited for capacity planning.','{Performance Modeling and Evaluation of Large-Scale J2EE Applications}',0,12,2003,12,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(301,'paper','KoBu2003-ISPASS-ModelingUsingQPNs','inproceedings','@inproceedings{KoBu2003-ISPASS-ModelingUsingQPNs,\n title = {Performance Modeling of Distributed E-Business Applications using Queueing Petri Nets},\n year = {2003},\n month = {March},\n pages = {143--155},\n abstract = {In this paper we show how Queuing Petri Net (QPN) models can be exploited for performance analysis of distributed e-business systems. We study a real-world application, and demonstrate the benefits, in terms of modelling power and expressiveness, that QPN models provide over conventional modelling paradigms such as Queuing Networks and Petri Nets. As shown, QPNs facilitate the integration of both hardware and software aspects of system behavior in the same model. In addition to hardware contention and scheduling strategies, using QPNs one can easily model simultaneous resource possession, synchronization, blocking and contention for software resources. By validating the models presented through measurements, we show that they are not just powerful as a specification mechanism, but are also very powerful as a performance analysis and prediction tool. However, currently available tools and techniques for QPN analysis are limited. Improved solution methods, which enable larger models to be analyzed, need to be developed. By demonstrating the power of QPNs as a modelling paradigm in realistic scenarios, we hope to motivate further research in this area.},\n note = {Best-Paper-Award},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/301.pdf},\n publisher = {IEEE Computer Society},\n address = {Washington, DC, USA},\n booktitle = {Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS 2003), Austin, Texas, USA, March 6-8, 2003},\n isbn = {0-7803-7756-7},\n doi = {10.1109/ISPASS.2003.1190241},\n author = {Kounev, Samuel and Buchmann, Alejandro},\n}\n\n','\n\nSamuel Kounev and Alejandro Buchmann.\nPerformance modeling of distributed e-business applications using\nqueueing petri nets.\nIn Proceedings of the 2003 IEEE International Symposium on\nPerformance Analysis of Systems and Software (ISPASS 2003), Austin, Texas,\nUSA, March 6-8, 2003, March 2003, pages 143-155. IEEE Computer Society,\nWashington, DC, USA.\nMarch 2003, Best-Paper-Award.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{KoBu2003-ISPASS-ModelingUsingQPNs,\ntitle = {Performance Modeling of Distributed E-Business Applications using Queueing Petri Nets},\nyear = {2003},\nmonth = {March},\npages = {143--155},\nabstract = {In this paper we show how Queuing Petri Net (QPN) models can be exploited for performance analysis of distributed e-business systems. We study a real-world application, and demonstrate the benefits, in terms of modelling power and expressiveness, that QPN models provide over conventional modelling paradigms such as Queuing Networks and Petri Nets. As shown, QPNs facilitate the integration of both hardware and software aspects of system behavior in the same model. In addition to hardware contention and scheduling strategies, using QPNs one can easily model simultaneous resource possession, synchronization, blocking and contention for software resources. By validating the models presented through measurements, we show that they are not just powerful as a specification mechanism, but are also very powerful as a performance analysis and prediction tool. However, currently available tools and techniques for QPN analysis are limited. Improved solution methods, which enable larger models to be analyzed, need to be developed. By demonstrating the power of QPNs as a modelling paradigm in realistic scenarios, we hope to motivate further research in this area.},\nnote = {Best-Paper-Award},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/301.pdf},\npublisher = {IEEE Computer Society},\naddress = {Washington, DC, USA},\nbooktitle = {Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS 2003), Austin, Texas, USA, March 6-8, 2003},\nisbn = {0-7803-7756-7},\ndoi = {10.1109/ISPASS.2003.1190241},\nauthor = {Kounev, Samuel and Buchmann, Alejandro}\n}\n
\n
\nIn this paper we show how Queuing Petri Net (QPN) models can be exploited for performance analysis of distributed e-business systems. We study a real-world application, and demonstrate the benefits, in terms of modelling power and expressiveness, that QPN models provide over conventional modelling paradigms such as Queuing Networks and Petri Nets. As shown, QPNs facilitate the integration of both hardware and software aspects of system behavior in the same model. In addition to hardware contention and scheduling strategies, using QPNs one can easily model simultaneous resource possession, synchronization, blocking and contention for software resources. By validating the models presented through measurements, we show that they are not just powerful as a specification mechanism, but are also very powerful as a performance analysis and prediction tool. However, currently available tools and techniques for QPN analysis are limited. Improved solution methods, which enable larger models to be analyzed, need to be developed. By demonstrating the power of QPNs as a modelling paradigm in realistic scenarios, we hope to motivate further research in this area.\n
\n','
\n@inproceedings{KoBu2003-ISPASS-ModelingUsingQPNs,\n  title = {Performance Modeling of Distributed E-Business Applications using Queueing Petri Nets},\n  year = {2003},\n  month = {March},\n  pages = {143--155},\n  abstract = {In this paper we show how Queuing Petri Net (QPN) models can be exploited for performance analysis of distributed e-business systems. We study a real-world application, and demonstrate the benefits, in terms of modelling power and expressiveness, that QPN models provide over conventional modelling paradigms such as Queuing Networks and Petri Nets. As shown, QPNs facilitate the integration of both hardware and software aspects of system behavior in the same model. In addition to hardware contention and scheduling strategies, using QPNs one can easily model simultaneous resource possession, synchronization, blocking and contention for software resources. By validating the models presented through measurements, we show that they are not just powerful as a specification mechanism, but are also very powerful as a performance analysis and prediction tool. However, currently available tools and techniques for QPN analysis are limited. Improved solution methods, which enable larger models to be analyzed, need to be developed. By demonstrating the power of QPNs as a modelling paradigm in realistic scenarios, we hope to motivate further research in this area.},\n  note = {Best-Paper-Award},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/301.pdf},\n  publisher = {IEEE Computer Society},\n  address = {Washington, DC, USA},\n  booktitle = {Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS 2003), Austin, Texas, USA, March 6-8, 2003},\n  isbn = {0-7803-7756-7},\n  doi = {10.1109/ISPASS.2003.1190241},\n  author = {Kounev, Samuel and Buchmann, Alejandro}\n}\n
\n\n','In this paper we show how Queuing Petri Net (QPN) models can be exploited for performance analysis of distributed e-business systems. We study a real-world application, and demonstrate the benefits, in terms of modelling power and expressiveness, that QPN models provide over conventional modelling paradigms such as Queuing Networks and Petri Nets. As shown, QPNs facilitate the integration of both hardware and software aspects of system behavior in the same model. In addition to hardware contention and scheduling strategies, using QPNs one can easily model simultaneous resource possession, synchronization, blocking and contention for software resources. By validating the models presented through measurements, we show that they are not just powerful as a specification mechanism, but are also very powerful as a performance analysis and prediction tool. However, currently available tools and techniques for QPN analysis are limited. Improved solution methods, which enable larger models to be analyzed, need to be developed. By demonstrating the power of QPNs as a modelling paradigm in realistic scenarios, we hope to motivate further research in this area.','Performance Modeling of Distributed E-Business Applications using Queueing Petri Nets',0,3,2003,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(302,'paper','KoBu2002-SSGRR-PerfIssuesEB','inproceedings','@inproceedings{KoBu2002-SSGRR-PerfIssuesEB,\n abstract = {Performance and scalability issues in e-business systems are gaining in importance as we move from hype and prototypes to real operational systems. Typical for this development is also the emergence of standard benchmarks of which TPC-W for transactional B2C systems and ECperf for performance and scalability measurement of application servers are two of the better known examples. In this paper we present an experience report with the ECperf benchmark defined by Sun and discuss performance issues that we observed in our implementation of the benchmark. Some of these issues are related to the specification of the benchmark, for which we made suggestions how to correct them and others are related to database connectivity, locking patterns, and the need for asynchronous processing.},\n author = {Samuel Kounev and Alejandro Buchmann},\n booktitle = {Proceedings of the International Conference on Advances in Infrastructure for e-Business, e-Education, e-Science, and e-Medicine on the Internet (SSGRR 2002w), L\'Aquila, Italy, January 21-27, 2002},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/302.pdf},\n title = {{Performance Issues in E-Business Systems}},\n year = {2002},\n month = {January},\n}\n\n','\n\nSamuel Kounev and Alejandro Buchmann.\nPerformance Issues in E-Business Systems.\nIn Proceedings of the International Conference on Advances in\nInfrastructure for e-Business, e-Education, e-Science, and e-Medicine on the\nInternet (SSGRR 2002w), L\'Aquila, Italy, January 21-27, 2002, January 2002.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{KoBu2002-SSGRR-PerfIssuesEB,\nabstract = {Performance and scalability issues in e-business systems are gaining in importance as we move from hype and prototypes to real operational systems. Typical for this development is also the emergence of standard benchmarks of which TPC-W for transactional B2C systems and ECperf for performance and scalability measurement of application servers are two of the better known examples. In this paper we present an experience report with the ECperf benchmark defined by Sun and discuss performance issues that we observed in our implementation of the benchmark. Some of these issues are related to the specification of the benchmark, for which we made suggestions how to correct them and others are related to database connectivity, locking patterns, and the need for asynchronous processing.},\nauthor = {Samuel Kounev and Alejandro Buchmann},\nbooktitle = {Proceedings of the International Conference on Advances in Infrastructure for e-Business, e-Education, e-Science, and e-Medicine on the Internet (SSGRR 2002w), L\'Aquila, Italy, January 21-27, 2002},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/302.pdf},\ntitle = {{Performance Issues in E-Business Systems}},\nyear = {2002},\nmonth = {January}\n}\n
\n
\nPerformance and scalability issues in e-business systems are gaining in importance as we move from hype and prototypes to real operational systems. Typical for this development is also the emergence of standard benchmarks of which TPC-W for transactional B2C systems and ECperf for performance and scalability measurement of application servers are two of the better known examples. In this paper we present an experience report with the ECperf benchmark defined by Sun and discuss performance issues that we observed in our implementation of the benchmark. Some of these issues are related to the specification of the benchmark, for which we made suggestions how to correct them and others are related to database connectivity, locking patterns, and the need for asynchronous processing.\n
\n','
\n@inproceedings{KoBu2002-SSGRR-PerfIssuesEB,\n  abstract = {Performance and scalability issues in e-business systems are gaining in importance as we move from hype and prototypes to real operational systems. Typical for this development is also the emergence of standard benchmarks of which TPC-W for transactional B2C systems and ECperf for performance and scalability measurement of application servers are two of the better known examples. In this paper we present an experience report with the ECperf benchmark defined by Sun and discuss performance issues that we observed in our implementation of the benchmark. Some of these issues are related to the specification of the benchmark, for which we made suggestions how to correct them and others are related to database connectivity, locking patterns, and the need for asynchronous processing.},\n  author = {Samuel Kounev and Alejandro Buchmann},\n  booktitle = {Proceedings of the International Conference on Advances in Infrastructure for e-Business, e-Education, e-Science, and e-Medicine on the Internet (SSGRR 2002w), L\'Aquila, Italy, January 21-27, 2002},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/302.pdf},\n  title = {{Performance Issues in E-Business Systems}},\n  year = {2002},\n  month = {January}\n}\n
\n\n','Performance and scalability issues in e-business systems are gaining in importance as we move from hype and prototypes to real operational systems. Typical for this development is also the emergence of standard benchmarks of which TPC-W for transactional B2C systems and ECperf for performance and scalability measurement of application servers are two of the better known examples. In this paper we present an experience report with the ECperf benchmark defined by Sun and discuss performance issues that we observed in our implementation of the benchmark. Some of these issues are related to the specification of the benchmark, for which we made suggestions how to correct them and others are related to database connectivity, locking patterns, and the need for asynchronous processing.','{Performance Issues in E-Business Systems}',0,1,2002,1,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(303,'paper','KoBu2002-VLDB-ImprovingDataAccessJ2EE','inproceedings','@inproceedings{KoBu2002-VLDB-ImprovingDataAccessJ2EE,\n abstract = {The J2EE platform provides a variety of options for making business data persistent using DBMS technology. However, the integration with existing backend database systems has proven to be of crucial importance for the scalability and performance of J2EE applications, because modern e-business systems are extremely data-intensive. As a result, the data access layer, and the link between the application server and the database server in particular, are very susceptible to turning into a system bottleneck. In this paper we use the ECperf benchmark as an example of a realistic application in order to illustrate the problems mentioned above and discuss how they could be approached and eliminated. In particular, we show how asynchronous, message-based processing could be exploited to reduce the load on the DBMS and improve system performance, scalability and reliability. Furthermore, we discuss the major issues related to the correct use of entity beans (the components provided by J2EE for modelling persistent data) and present a number of methods to optimize their performance utilizing caching mechanisms. We have evaluated the proposed techniques through measurements and have documented the performance gains that they provide.},\n author = {Samuel Kounev and Alejandro Buchmann},\n booktitle = {Proceedings of the 28th International Conference on Very Large Data Bases (VLDB 2002), Hong Kong, China, August 20--23, 2002},\n note = {Acceptance Rate (Full Paper): 14\\% Best-Paper-Award Nomination},\n pages = {574--585},\n pdf = {http://www.vldb.org/conf/2002/S16P03.pdf},\n publisher = {VLDB Endowment, Morgan Kaufmann},\n title = {{Improving Data Access of J2EE Applications by Exploiting Asynchronous Messaging and Caching Services}},\n url = {http://www.vldb.org/conf/2002/S16P03.pdf},\n year = {2002},\n}\n\n','\n\nSamuel Kounev and Alejandro Buchmann.\nImproving Data Access of J2EE Applications by Exploiting\nAsynchronous Messaging and Caching Services.\nIn Proceedings of the 28th International Conference on Very\nLarge Data Bases (VLDB 2002), Hong Kong, China, August 20-23, 2002, 2002,\npages 574-585. VLDB Endowment, Morgan Kaufmann.\n2002, Acceptance Rate (Full Paper): 14% Best-Paper-Award\nNomination.\n[ bib | .pdf | .pdf | Abstract  ] 
\n@inproceedings{KoBu2002-VLDB-ImprovingDataAccessJ2EE,\nabstract = {The J2EE platform provides a variety of options for making business data persistent using DBMS technology. However, the integration with existing backend database systems has proven to be of crucial importance for the scalability and performance of J2EE applications, because modern e-business systems are extremely data-intensive. As a result, the data access layer, and the link between the application server and the database server in particular, are very susceptible to turning into a system bottleneck. In this paper we use the ECperf benchmark as an example of a realistic application in order to illustrate the problems mentioned above and discuss how they could be approached and eliminated. In particular, we show how asynchronous, message-based processing could be exploited to reduce the load on the DBMS and improve system performance, scalability and reliability. Furthermore, we discuss the major issues related to the correct use of entity beans (the components provided by J2EE for modelling persistent data) and present a number of methods to optimize their performance utilizing caching mechanisms. We have evaluated the proposed techniques through measurements and have documented the performance gains that they provide.},\nauthor = {Samuel Kounev and Alejandro Buchmann},\nbooktitle = {Proceedings of the 28th International Conference on Very Large Data Bases (VLDB 2002), Hong Kong, China, August 20--23, 2002},\nnote = {Acceptance Rate (Full Paper): 14\\% Best-Paper-Award Nomination},\npages = {574--585},\npdf = {http://www.vldb.org/conf/2002/S16P03.pdf},\npublisher = {VLDB Endowment, Morgan Kaufmann},\ntitle = {{Improving Data Access of J2EE Applications by Exploiting Asynchronous Messaging and Caching Services}},\nurl = {http://www.vldb.org/conf/2002/S16P03.pdf},\nyear = {2002}\n}\n
\n
\nThe J2EE platform provides a variety of options for making business data persistent using DBMS technology. However, the integration with existing backend database systems has proven to be of crucial importance for the scalability and performance of J2EE applications, because modern e-business systems are extremely data-intensive. As a result, the data access layer, and the link between the application server and the database server in particular, are very susceptible to turning into a system bottleneck. In this paper we use the ECperf benchmark as an example of a realistic application in order to illustrate the problems mentioned above and discuss how they could be approached and eliminated. In particular, we show how asynchronous, message-based processing could be exploited to reduce the load on the DBMS and improve system performance, scalability and reliability. Furthermore, we discuss the major issues related to the correct use of entity beans (the components provided by J2EE for modelling persistent data) and present a number of methods to optimize their performance utilizing caching mechanisms. We have evaluated the proposed techniques through measurements and have documented the performance gains that they provide.\n
\n','
\n@inproceedings{KoBu2002-VLDB-ImprovingDataAccessJ2EE,\n  abstract = {The J2EE platform provides a variety of options for making business data persistent using DBMS technology. However, the integration with existing backend database systems has proven to be of crucial importance for the scalability and performance of J2EE applications, because modern e-business systems are extremely data-intensive. As a result, the data access layer, and the link between the application server and the database server in particular, are very susceptible to turning into a system bottleneck. In this paper we use the ECperf benchmark as an example of a realistic application in order to illustrate the problems mentioned above and discuss how they could be approached and eliminated. In particular, we show how asynchronous, message-based processing could be exploited to reduce the load on the DBMS and improve system performance, scalability and reliability. Furthermore, we discuss the major issues related to the correct use of entity beans (the components provided by J2EE for modelling persistent data) and present a number of methods to optimize their performance utilizing caching mechanisms. We have evaluated the proposed techniques through measurements and have documented the performance gains that they provide.},\n  author = {Samuel Kounev and Alejandro Buchmann},\n  booktitle = {Proceedings of the 28th International Conference on Very Large Data Bases (VLDB 2002), Hong Kong, China, August 20--23, 2002},\n  note = {Acceptance Rate (Full Paper): 14\\% Best-Paper-Award Nomination},\n  pages = {574--585},\n  pdf = {http://www.vldb.org/conf/2002/S16P03.pdf},\n  publisher = {VLDB Endowment, Morgan Kaufmann},\n  title = {{Improving Data Access of J2EE Applications by Exploiting Asynchronous Messaging and Caching Services}},\n  url = {http://www.vldb.org/conf/2002/S16P03.pdf},\n  year = {2002}\n}\n
\n\n','The J2EE platform provides a variety of options for making business data persistent using DBMS technology. However, the integration with existing backend database systems has proven to be of crucial importance for the scalability and performance of J2EE applications, because modern e-business systems are extremely data-intensive. As a result, the data access layer, and the link between the application server and the database server in particular, are very susceptible to turning into a system bottleneck. In this paper we use the ECperf benchmark as an example of a realistic application in order to illustrate the problems mentioned above and discuss how they could be approached and eliminated. In particular, we show how asynchronous, message-based processing could be exploited to reduce the load on the DBMS and improve system performance, scalability and reliability. Furthermore, we discuss the major issues related to the correct use of entity beans (the components provided by J2EE for modelling persistent data) and present a number of methods to optimize their performance utilizing caching mechanisms. We have evaluated the proposed techniques through measurements and have documented the performance gains that they provide.','{Improving Data Access of J2EE Applications by Exploiting Asynchronous Messaging and Caching Services}',0,0,2002,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(304,'paper','KoDu2009-SIGMETRICS_PER-QPME','article','@article{KoDu2009-SIGMETRICS_PER-QPME,\n title = {{QPME - A Performance Modeling Tool Based on Queueing Petri Nets}},\n journal = {ACM SIGMETRICS Performance Evaluation Review (PER), Special Issue on Tools for Computer Performance Modeling and Reliability Analysis},\n year = {2009},\n month = {3},\n volume = {36},\n pages = {46--51},\n abstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present QPME (Queueing Petri net Modeling Environment) - a tool that supports the modeling and analysis of systems using queueing Petri nets. QPME provides an Eclipse-based editor for designing queueing Petri net models and a powerful simulation engine for analyzing the models. After presenting the tool, we discuss the ongoing work on the QPME project and the planned future enhancements of the tool.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/304.pdf},\n publisher = {ACM},\n author = {Kounev, Samuel and Dutz, Christofer},\n}\n\n','\n\nSamuel Kounev and Christofer Dutz.\nQPME - A Performance Modeling Tool Based on Queueing Petri Nets.\nACM SIGMETRICS Performance Evaluation Review (PER), Special\nIssue on Tools for Computer Performance Modeling and Reliability Analysis,\n36:46-51, 3 2009, ACM.\n[ bib | .pdf | Abstract  ] 
\n@article{KoDu2009-SIGMETRICS_PER-QPME,\ntitle = {{QPME - A Performance Modeling Tool Based on Queueing Petri Nets}},\njournal = {ACM SIGMETRICS Performance Evaluation Review (PER), Special Issue on Tools for Computer Performance Modeling and Reliability Analysis},\nyear = {2009},\nmonth = {3},\nvolume = {36},\npages = {46--51},\nabstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present QPME (Queueing Petri net Modeling Environment) - a tool that supports the modeling and analysis of systems using queueing Petri nets. QPME provides an Eclipse-based editor for designing queueing Petri net models and a powerful simulation engine for analyzing the models. After presenting the tool, we discuss the ongoing work on the QPME project and the planned future enhancements of the tool.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/304.pdf},\npublisher = {ACM},\nauthor = {Kounev, Samuel and Dutz, Christofer}\n}\n
\n
\nQueueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present QPME (Queueing Petri net Modeling Environment) - a tool that supports the modeling and analysis of systems using queueing Petri nets. QPME provides an Eclipse-based editor for designing queueing Petri net models and a powerful simulation engine for analyzing the models. After presenting the tool, we discuss the ongoing work on the QPME project and the planned future enhancements of the tool.\n
\n','
\n@article{KoDu2009-SIGMETRICS_PER-QPME,\n  title = {{QPME - A Performance Modeling Tool Based on Queueing Petri Nets}},\n  journal = {ACM SIGMETRICS Performance Evaluation Review (PER), Special Issue on Tools for Computer Performance Modeling and Reliability Analysis},\n  year = {2009},\n  month = {3},\n  volume = {36},\n  pages = {46--51},\n  abstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present QPME (Queueing Petri net Modeling Environment) - a tool that supports the modeling and analysis of systems using queueing Petri nets. QPME provides an Eclipse-based editor for designing queueing Petri net models and a powerful simulation engine for analyzing the models. After presenting the tool, we discuss the ongoing work on the QPME project and the planned future enhancements of the tool.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/304.pdf},\n  publisher = {ACM},\n  author = {Kounev, Samuel and Dutz, Christofer}\n}\n
\n\n','Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present QPME (Queueing Petri net Modeling Environment) - a tool that supports the modeling and analysis of systems using queueing Petri nets. QPME provides an Eclipse-based editor for designing queueing Petri net models and a powerful simulation engine for analyzing the models. After presenting the tool, we discuss the ongoing work on the QPME project and the planned future enhancements of the tool.','{QPME - A Performance Modeling Tool Based on Queueing Petri Nets}',0,3,2009,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(305,'paper','Ko2007-TUD-QPME_UsersGuide','manual','@manual{Ko2007-TUD-QPME_UsersGuide,\n abstract = {This document describes the software package QPME (Queueing Petri net Modeling Environment), a performance modeling and analysis tool based on the Queueing Petri Net (QPN) modeling formalism. QPN models are more sophisticated than conventional queueing networks and stochastic Petri nets and have greater expressive power. This provides a number of important benefits since it makes it possible to model systems at a higher degree of accuracy. QPME is made of two components: QPE (QPN Editor) and SimQPN (Simulator for QPNs). QPE provides a user-friendly graphical tool for modeling using QPNs based on the Eclipse/GEF framework. SimQPN provides an efficient discrete-event simulation engine for QPNs that makes it possible to analyze models of realistically-sized systems. QPME runs on a wide range of platforms including Windows, Linux and Solaris. QPME is developed and maintained by Samuel Kounev and Christofer Dutz.},\n address = {Darmstadt, Germany},\n author = {Samuel Kounev and Christofer Dutz},\n month = {January},\n organization = {Technische Universit{\\\"{a}}t Darmstadt},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/305.pdf},\n title = {{QPME 1.0 User\'s Guide}},\n year = {2007},\n}\n\n','\n\nSamuel Kounev and Christofer Dutz.\nQPME 1.0 User\'s Guide.\nTechnische Universität Darmstadt, Darmstadt, Germany, January\n2007.\n[ bib | .pdf | Abstract  ] 
\n@manual{Ko2007-TUD-QPME_UsersGuide,\nabstract = {This document describes the software package QPME (Queueing Petri net Modeling Environment), a performance modeling and analysis tool based on the Queueing Petri Net (QPN) modeling formalism. QPN models are more sophisticated than conventional queueing networks and stochastic Petri nets and have greater expressive power. This provides a number of important benefits since it makes it possible to model systems at a higher degree of accuracy. QPME is made of two components: QPE (QPN Editor) and SimQPN (Simulator for QPNs). QPE provides a user-friendly graphical tool for modeling using QPNs based on the Eclipse/GEF framework. SimQPN provides an efficient discrete-event simulation engine for QPNs that makes it possible to analyze models of realistically-sized systems. QPME runs on a wide range of platforms including Windows, Linux and Solaris. QPME is developed and maintained by Samuel Kounev and Christofer Dutz.},\naddress = {Darmstadt, Germany},\nauthor = {Samuel Kounev and Christofer Dutz},\nmonth = {January},\norganization = {Technische Universit{\\\"{a}}t Darmstadt},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/305.pdf},\ntitle = {{QPME 1.0 User\'s Guide}},\nyear = {2007}\n}\n
\n
\nThis document describes the software package QPME (Queueing Petri net Modeling Environment), a performance modeling and analysis tool based on the Queueing Petri Net (QPN) modeling formalism. QPN models are more sophisticated than conventional queueing networks and stochastic Petri nets and have greater expressive power. This provides a number of important benefits since it makes it possible to model systems at a higher degree of accuracy. QPME is made of two components: QPE (QPN Editor) and SimQPN (Simulator for QPNs). QPE provides a user-friendly graphical tool for modeling using QPNs based on the Eclipse/GEF framework. SimQPN provides an efficient discrete-event simulation engine for QPNs that makes it possible to analyze models of realistically-sized systems. QPME runs on a wide range of platforms including Windows, Linux and Solaris. QPME is developed and maintained by Samuel Kounev and Christofer Dutz.\n
\n','
\n@manual{Ko2007-TUD-QPME_UsersGuide,\n  abstract = {This document describes the software package QPME (Queueing Petri net Modeling Environment), a performance modeling and analysis tool based on the Queueing Petri Net (QPN) modeling formalism. QPN models are more sophisticated than conventional queueing networks and stochastic Petri nets and have greater expressive power. This provides a number of important benefits since it makes it possible to model systems at a higher degree of accuracy. QPME is made of two components: QPE (QPN Editor) and SimQPN (Simulator for QPNs). QPE provides a user-friendly graphical tool for modeling using QPNs based on the Eclipse/GEF framework. SimQPN provides an efficient discrete-event simulation engine for QPNs that makes it possible to analyze models of realistically-sized systems. QPME runs on a wide range of platforms including Windows, Linux and Solaris. QPME is developed and maintained by Samuel Kounev and Christofer Dutz.},\n  address = {Darmstadt, Germany},\n  author = {Samuel Kounev and Christofer Dutz},\n  month = {January},\n  organization = {Technische Universit{\\\"{a}}t Darmstadt},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/305.pdf},\n  title = {{QPME 1.0 User\'s Guide}},\n  year = {2007}\n}\n
\n\n','This document describes the software package QPME (Queueing Petri net Modeling Environment), a performance modeling and analysis tool based on the Queueing Petri Net (QPN) modeling formalism. QPN models are more sophisticated than conventional queueing networks and stochastic Petri nets and have greater expressive power. This provides a number of important benefits since it makes it possible to model systems at a higher degree of accuracy. QPME is made of two components: QPE (QPN Editor) and SimQPN (Simulator for QPNs). QPE provides a user-friendly graphical tool for modeling using QPNs based on the Eclipse/GEF framework. SimQPN provides an efficient discrete-event simulation engine for QPNs that makes it possible to analyze models of realistically-sized systems. QPME runs on a wide range of platforms including Windows, Linux and Solaris. QPME is developed and maintained by Samuel Kounev and Christofer Dutz.','{QPME 1.0 User\'s Guide}',0,1,2007,1,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(306,'paper','KoDuBu2006-QEST-QPME','inproceedings','@inproceedings{KoDuBu2006-QEST-QPME,\n title = {{QPME - Queueing Petri Net Modeling Environment}},\n year = {2006},\n month = {9},\n pages = {115--116},\n abstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. However, currently available tools for modeling and analysis using queueing Petri nets are very limited in terms of the scalability of the analysis algorithms they provide. Moreover, tools are available only on highly specialized platforms unaccessible to most potential users. In this paper, we present QPME - a Queueing Petri Net Modeling Environment that supports the modeling and analysis of systems using queueing Petri nets. QPME runs on a wide range of platforms and provides a powerful simulation engine that can be used to analyze models of realistically-sized systems.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/306.pdf},\n publisher = {IEEE Computer Society},\n address = {Washington, DC, USA},\n booktitle = {Proceedings of the 3rd International Conference on Quantitative Evaluation of SysTems (QEST 2006), Riverside, California, USA, September 11-14, 2006},\n isbn = {0-7695-2665-9},\n doi = {10.1109/QEST.2006.44},\n author = {Kounev, Samuel and Dutz, Christofer and Buchmann, Alejandro},\n}\n\n','\n\nSamuel Kounev, Christofer Dutz, and Alejandro Buchmann.\nQPME - Queueing Petri Net Modeling Environment.\nIn Proceedings of the 3rd International Conference on\nQuantitative Evaluation of SysTems (QEST 2006), Riverside, California, USA,\nSeptember 11-14, 2006, 9 2006, pages 115-116. IEEE Computer Society,\nWashington, DC, USA.\n9 2006.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{KoDuBu2006-QEST-QPME,\ntitle = {{QPME - Queueing Petri Net Modeling Environment}},\nyear = {2006},\nmonth = {9},\npages = {115--116},\nabstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. However, currently available tools for modeling and analysis using queueing Petri nets are very limited in terms of the scalability of the analysis algorithms they provide. Moreover, tools are available only on highly specialized platforms unaccessible to most potential users. In this paper, we present QPME - a Queueing Petri Net Modeling Environment that supports the modeling and analysis of systems using queueing Petri nets. QPME runs on a wide range of platforms and provides a powerful simulation engine that can be used to analyze models of realistically-sized systems.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/306.pdf},\npublisher = {IEEE Computer Society},\naddress = {Washington, DC, USA},\nbooktitle = {Proceedings of the 3rd International Conference on Quantitative Evaluation of SysTems (QEST 2006), Riverside, California, USA, September 11-14, 2006},\nisbn = {0-7695-2665-9},\ndoi = {10.1109/QEST.2006.44},\nauthor = {Kounev, Samuel and Dutz, Christofer and Buchmann, Alejandro}\n}\n
\n
\nQueueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. However, currently available tools for modeling and analysis using queueing Petri nets are very limited in terms of the scalability of the analysis algorithms they provide. Moreover, tools are available only on highly specialized platforms unaccessible to most potential users. In this paper, we present QPME - a Queueing Petri Net Modeling Environment that supports the modeling and analysis of systems using queueing Petri nets. QPME runs on a wide range of platforms and provides a powerful simulation engine that can be used to analyze models of realistically-sized systems.\n
\n','
\n@inproceedings{KoDuBu2006-QEST-QPME,\n  title = {{QPME - Queueing Petri Net Modeling Environment}},\n  year = {2006},\n  month = {9},\n  pages = {115--116},\n  abstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. However, currently available tools for modeling and analysis using queueing Petri nets are very limited in terms of the scalability of the analysis algorithms they provide. Moreover, tools are available only on highly specialized platforms unaccessible to most potential users. In this paper, we present QPME - a Queueing Petri Net Modeling Environment that supports the modeling and analysis of systems using queueing Petri nets. QPME runs on a wide range of platforms and provides a powerful simulation engine that can be used to analyze models of realistically-sized systems.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/306.pdf},\n  publisher = {IEEE Computer Society},\n  address = {Washington, DC, USA},\n  booktitle = {Proceedings of the 3rd International Conference on Quantitative Evaluation of SysTems (QEST 2006), Riverside, California, USA, September 11-14, 2006},\n  isbn = {0-7695-2665-9},\n  doi = {10.1109/QEST.2006.44},\n  author = {Kounev, Samuel and Dutz, Christofer and Buchmann, Alejandro}\n}\n
\n\n','Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. However, currently available tools for modeling and analysis using queueing Petri nets are very limited in terms of the scalability of the analysis algorithms they provide. Moreover, tools are available only on highly specialized platforms unaccessible to most potential users. In this paper, we present QPME - a Queueing Petri Net Modeling Environment that supports the modeling and analysis of systems using queueing Petri nets. QPME runs on a wide range of platforms and provides a powerful simulation engine that can be used to analyze models of realistically-sized systems.','{QPME - Queueing Petri Net Modeling Environment}',0,9,2006,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(307,'paper','KoHuSpBr2012-business-inf-sys','incollection','@incollection{KoHuSpBr2012-business-inf-sys,\n abstract = {{With the increasing adoption of virtualization and the transition towards Cloud Computing platforms, modern business information systems are becoming increasingly complex and dynamic. This raises the challenge of guaranteeing system performance and scalability while at the same time ensuring efficient resource usage. In this paper, we present a historical perspective on the evolution of model-based performance engineering techniques for business information systems focusing on the major developments over the past several decades that have shaped the field. We survey the state-of-the-art on performance modeling and management approaches discussing the ongoing efforts in the community to increasingly bridge the gap between high-level business services and low level performance models. Finally, we wrap up with an outlook on the emergence of self-aware systems engineering as a new research area at the intersection of several computer science disciplines.}},\n address = {Berlin, Heidelberg},\n author = {Samuel Kounev and Nikolaus Huber and Simon Spinner and Fabian Brosig},\n booktitle = {Business Modeling and Software Design},\n editor = {Shishkov, Boris},\n isbn = {978-3-642-29788-5},\n pages = {19--37},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/307.pdf},\n publisher = {Springer-Verlag},\n series = {Lecture Notes in Business Information Processing (LNBIP)},\n title = {Model-based Techniques for Performance Engineering of Business Information Systems},\n url = {http://dx.doi.org/10.1007/978-3-642-29788-5_2},\n volume = {0109},\n year = {2012},\n}\n\n','\n\nSamuel Kounev, Nikolaus Huber, Simon Spinner, and Fabian Brosig.\nModel-based techniques for performance engineering of business\ninformation systems.\nIn Business Modeling and Software Design, Boris Shishkov,\neditor, volume 0109 of Lecture Notes in Business Information Processing\n(LNBIP), pages 19-37. Springer-Verlag, Berlin, Heidelberg, 2012.\n[ bib | http | .pdf | Abstract  ] 
\n@incollection{KoHuSpBr2012-business-inf-sys,\nabstract = {{With the increasing adoption of virtualization and the transition towards Cloud Computing platforms, modern business information systems are becoming increasingly complex and dynamic. This raises the challenge of guaranteeing system performance and scalability while at the same time ensuring efficient resource usage. In this paper, we present a historical perspective on the evolution of model-based performance engineering techniques for business information systems focusing on the major developments over the past several decades that have shaped the field. We survey the state-of-the-art on performance modeling and management approaches discussing the ongoing efforts in the community to increasingly bridge the gap between high-level business services and low level performance models. Finally, we wrap up with an outlook on the emergence of self-aware systems engineering as a new research area at the intersection of several computer science disciplines.}},\naddress = {Berlin, Heidelberg},\nauthor = {Samuel Kounev and Nikolaus Huber and Simon Spinner and Fabian Brosig},\nbooktitle = {Business Modeling and Software Design},\neditor = {Shishkov, Boris},\nisbn = {978-3-642-29788-5},\npages = {19--37},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/307.pdf},\npublisher = {Springer-Verlag},\nseries = {Lecture Notes in Business Information Processing (LNBIP)},\ntitle = {Model-based Techniques for Performance Engineering of Business Information Systems},\nurl = {http://dx.doi.org/10.1007/978-3-642-29788-5_2},\nvolume = {0109},\nyear = {2012}\n}\n
\n
\nWith the increasing adoption of virtualization and the transition towards Cloud Computing platforms, modern business information systems are becoming increasingly complex and dynamic. This raises the challenge of guaranteeing system performance and scalability while at the same time ensuring efficient resource usage. In this paper, we present a historical perspective on the evolution of model-based performance engineering techniques for business information systems focusing on the major developments over the past several decades that have shaped the field. We survey the state-of-the-art on performance modeling and management approaches discussing the ongoing efforts in the community to increasingly bridge the gap between high-level business services and low level performance models. Finally, we wrap up with an outlook on the emergence of self-aware systems engineering as a new research area at the intersection of several computer science disciplines.\n
\n','
\n@incollection{KoHuSpBr2012-business-inf-sys,\n  abstract = {{With the increasing adoption of virtualization and the transition towards Cloud Computing platforms, modern business information systems are becoming increasingly complex and dynamic. This raises the challenge of guaranteeing system performance and scalability while at the same time ensuring efficient resource usage. In this paper, we present a historical perspective on the evolution of model-based performance engineering techniques for business information systems focusing on the major developments over the past several decades that have shaped the field. We survey the state-of-the-art on performance modeling and management approaches discussing the ongoing efforts in the community to increasingly bridge the gap between high-level business services and low level performance models. Finally, we wrap up with an outlook on the emergence of self-aware systems engineering as a new research area at the intersection of several computer science disciplines.}},\n  address = {Berlin, Heidelberg},\n  author = {Samuel Kounev and Nikolaus Huber and Simon Spinner and Fabian Brosig},\n  booktitle = {Business Modeling and Software Design},\n  editor = {Shishkov, Boris},\n  isbn = {978-3-642-29788-5},\n  pages = {19--37},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/307.pdf},\n  publisher = {Springer-Verlag},\n  series = {Lecture Notes in Business Information Processing (LNBIP)},\n  title = {Model-based Techniques for Performance Engineering of Business Information Systems},\n  url = {http://dx.doi.org/10.1007/978-3-642-29788-5_2},\n  volume = {0109},\n  year = {2012}\n}\n
\n\n','{With the increasing adoption of virtualization and the transition towards Cloud Computing platforms, modern business information systems are becoming increasingly complex and dynamic. This raises the challenge of guaranteeing system performance and scalability while at the same time ensuring efficient resource usage. In this paper, we present a historical perspective on the evolution of model-based performance engineering techniques for business information systems focusing on the major developments over the past several decades that have shaped the field. We survey the state-of-the-art on performance modeling and management approaches discussing the ongoing efforts in the community to increasingly bridge the gap between high-level business services and low level performance models. Finally, we wrap up with an outlook on the emergence of self-aware systems engineering as a new research area at the intersection of several computer science disciplines.}','Model-based Techniques for Performance Engineering of Business Information Systems',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(308,'paper','KoNi1999-TOOLS_EE-Analysis_Phase','inproceedings','@inproceedings{KoNi1999-TOOLS_EE-Analysis_Phase,\n author = {Samuel Kounev and Kiril Nikolov},\n booktitle = {Proceedings of the Tools Eastern Europe \'99 Conference on Technology of Object Oriented Languages and Systems, Sofia-Blagoevgrad, Bulgaria, June 1-4, 1999},\n title = {{The Analysis Phase in the Development of E-Commerce Software Systems}},\n year = {1999},\n month = {June},\n}\n\n','\n\nSamuel Kounev and Kiril Nikolov.\nThe Analysis Phase in the Development of E-Commerce Software\nSystems.\nIn Proceedings of the Tools Eastern Europe \'99 Conference on\nTechnology of Object Oriented Languages and Systems, Sofia-Blagoevgrad,\nBulgaria, June 1-4, 1999, June 1999.\n[ bib  ] 
\n@inproceedings{KoNi1999-TOOLS_EE-Analysis_Phase,\nauthor = {Samuel Kounev and Kiril Nikolov},\nbooktitle = {Proceedings of the Tools Eastern Europe \'99 Conference on Technology of Object Oriented Languages and Systems, Sofia-Blagoevgrad, Bulgaria, June 1-4, 1999},\ntitle = {{The Analysis Phase in the Development of E-Commerce Software Systems}},\nyear = {1999},\nmonth = {June}\n}\n
\n
\n','
\n@inproceedings{KoNi1999-TOOLS_EE-Analysis_Phase,\n  author = {Samuel Kounev and Kiril Nikolov},\n  booktitle = {Proceedings of the Tools Eastern Europe \'99 Conference on Technology of Object Oriented Languages and Systems, Sofia-Blagoevgrad, Bulgaria, June 1-4, 1999},\n  title = {{The Analysis Phase in the Development of E-Commerce Software Systems}},\n  year = {1999},\n  month = {June}\n}\n
\n\n',NULL,'{The Analysis Phase in the Development of E-Commerce Software Systems}',0,6,1999,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(309,'paper','KoNoTo2007-UPC-GridAutoQoS','techreport','@techreport{KoNoTo2007-UPC-GridAutoQoS,\n title = {{Using QPN models for QoS Control in Grid Middleware}},\n year = {2007},\n month = {April},\n number = {UPC-DAC-RR-CAP-2007-4},\n institution = {Computer Architecture Department, Technical University of Catalonia (UPC), Spain},\n author = {Kounev, Samuel and Nou, Ramon and Torres, Jordi},\n}\n\n','\n\nSamuel Kounev, Ramon Nou, and Jordi Torres.\nUsing QPN models for QoS Control in Grid Middleware.\nTechnical Report UPC-DAC-RR-CAP-2007-4, Computer Architecture\nDepartment, Technical University of Catalonia (UPC), Spain, April 2007.\n[ bib  ] 
\n@techreport{KoNoTo2007-UPC-GridAutoQoS,\ntitle = {{Using QPN models for QoS Control in Grid Middleware}},\nyear = {2007},\nmonth = {April},\nnumber = {UPC-DAC-RR-CAP-2007-4},\ninstitution = {Computer Architecture Department, Technical University of Catalonia (UPC), Spain},\nauthor = {Kounev, Samuel and Nou, Ramon and Torres, Jordi}\n}\n
\n
\n','
\n@techreport{KoNoTo2007-UPC-GridAutoQoS,\n  title = {{Using QPN models for QoS Control in Grid Middleware}},\n  year = {2007},\n  month = {April},\n  number = {UPC-DAC-RR-CAP-2007-4},\n  institution = {Computer Architecture Department, Technical University of Catalonia (UPC), Spain},\n  author = {Kounev, Samuel and Nou, Ramon and Torres, Jordi}\n}\n
\n\n',NULL,'{Using QPN models for QoS Control in Grid Middleware}',0,4,2007,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(310,'paper','KoNoTo2007-VALUETOOLS-GridAuton_QoS_Control','inproceedings','@inproceedings{KoNoTo2007-VALUETOOLS-GridAuton_QoS_Control,\n title = {{Autonomic QoS-Aware Resource Management in Grid Computing using Online Performance Models}},\n year = {2007},\n pages = {1--10},\n abstract = {As Grid Computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. The inherent complexity, heterogeneity and dynamics of Grid computing environments pose some challenges in managing their capacity to ensure that QoS requirements are continuously met. In this paper, an approach to autonomic QoS-aware resource management in Grid computing based on online performance models is proposed. The paper presents a novel methodology for designing autonomic QoS-aware resource managers that have the capability to predict the performance of the Grid components they manage and allocate resources in such a way that service level agreements are honored. The goal is to make the Grid middleware self-configurable and adaptable to changes in the system environment and workload. The approach is subjected to an extensive experimental evaluation in the context of a real-world Grid environment and its effectiveness, practicality and performance are demonstrated.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/310.pdf},\n publisher = {ICST},\n address = {Brussels, Belgium},\n booktitle = {Proceedings of the Second International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2007), Nantes, France, October 23-25, 2007},\n isbn = {978-963-9799-00-4},\n doi = {10.1145/1345263.1345325},\n author = {Kounev, Samuel and Nou, Ramon and Torres, Jordi},\n}\n\n','\n\nSamuel Kounev, Ramon Nou, and Jordi Torres.\nAutonomic QoS-Aware Resource Management in Grid Computing using\nOnline Performance Models.\nIn Proceedings of the Second International Conference on\nPerformance Evaluation Methodologies and Tools (VALUETOOLS 2007), Nantes,\nFrance, October 23-25, 2007, 2007, pages 1-10. ICST, Brussels, Belgium.\n2007.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{KoNoTo2007-VALUETOOLS-GridAuton_QoS_Control,\ntitle = {{Autonomic QoS-Aware Resource Management in Grid Computing using Online Performance Models}},\nyear = {2007},\npages = {1--10},\nabstract = {As Grid Computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. The inherent complexity, heterogeneity and dynamics of Grid computing environments pose some challenges in managing their capacity to ensure that QoS requirements are continuously met. In this paper, an approach to autonomic QoS-aware resource management in Grid computing based on online performance models is proposed. The paper presents a novel methodology for designing autonomic QoS-aware resource managers that have the capability to predict the performance of the Grid components they manage and allocate resources in such a way that service level agreements are honored. The goal is to make the Grid middleware self-configurable and adaptable to changes in the system environment and workload. The approach is subjected to an extensive experimental evaluation in the context of a real-world Grid environment and its effectiveness, practicality and performance are demonstrated.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/310.pdf},\npublisher = {ICST},\naddress = {Brussels, Belgium},\nbooktitle = {Proceedings of the Second International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2007), Nantes, France, October 23-25, 2007},\nisbn = {978-963-9799-00-4},\ndoi = {10.1145/1345263.1345325},\nauthor = {Kounev, Samuel and Nou, Ramon and Torres, Jordi}\n}\n
\n
\nAs Grid Computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. The inherent complexity, heterogeneity and dynamics of Grid computing environments pose some challenges in managing their capacity to ensure that QoS requirements are continuously met. In this paper, an approach to autonomic QoS-aware resource management in Grid computing based on online performance models is proposed. The paper presents a novel methodology for designing autonomic QoS-aware resource managers that have the capability to predict the performance of the Grid components they manage and allocate resources in such a way that service level agreements are honored. The goal is to make the Grid middleware self-configurable and adaptable to changes in the system environment and workload. The approach is subjected to an extensive experimental evaluation in the context of a real-world Grid environment and its effectiveness, practicality and performance are demonstrated.\n
\n','
\n@inproceedings{KoNoTo2007-VALUETOOLS-GridAuton_QoS_Control,\n  title = {{Autonomic QoS-Aware Resource Management in Grid Computing using Online Performance Models}},\n  year = {2007},\n  pages = {1--10},\n  abstract = {As Grid Computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. The inherent complexity, heterogeneity and dynamics of Grid computing environments pose some challenges in managing their capacity to ensure that QoS requirements are continuously met. In this paper, an approach to autonomic QoS-aware resource management in Grid computing based on online performance models is proposed. The paper presents a novel methodology for designing autonomic QoS-aware resource managers that have the capability to predict the performance of the Grid components they manage and allocate resources in such a way that service level agreements are honored. The goal is to make the Grid middleware self-configurable and adaptable to changes in the system environment and workload. The approach is subjected to an extensive experimental evaluation in the context of a real-world Grid environment and its effectiveness, practicality and performance are demonstrated.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/310.pdf},\n  publisher = {ICST},\n  address = {Brussels, Belgium},\n  booktitle = {Proceedings of the Second International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2007), Nantes, France, October 23-25, 2007},\n  isbn = {978-963-9799-00-4},\n  doi = {10.1145/1345263.1345325},\n  author = {Kounev, Samuel and Nou, Ramon and Torres, Jordi}\n}\n
\n\n','As Grid Computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. The inherent complexity, heterogeneity and dynamics of Grid computing environments pose some challenges in managing their capacity to ensure that QoS requirements are continuously met. In this paper, an approach to autonomic QoS-aware resource management in Grid computing based on online performance models is proposed. The paper presents a novel methodology for designing autonomic QoS-aware resource managers that have the capability to predict the performance of the Grid components they manage and allocate resources in such a way that service level agreements are honored. The goal is to make the Grid middleware self-configurable and adaptable to changes in the system environment and workload. The approach is subjected to an extensive experimental evaluation in the context of a real-world Grid environment and its effectiveness, practicality and performance are demonstrated.','{Autonomic QoS-Aware Resource Management in Grid Computing using Online Performance Models}',0,0,2007,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(311,'paper','KoRaKl2012-FESCA-Keynote','article','@article{KoRaKl2012-FESCA-Keynote,\n abstract = {Event-based communication is used in different domains including telecommunications, transportation, and business information systems to build scalable distributed systems. Such systems typically have stringent requirements for performance and scalability as they provide business and mission critical services. While the use of event-based communication enables loosely-coupled interactions between components and leads to improved system scalability, it makes it much harder for developers to estimate the system\'s behavior and performance under load due to the decoupling of components and control flow. We present an overview on our approach enabling the modeling and performance prediction of event-based system at the architecture level. Applying a model-to-model transformation, our approach integrates platform-specific performance influences of the underlying middleware while enabling the use of different existing analytical and simulation-based prediction techniques. The results of two real world case studies demonstrate the effectiveness, practicability and accuracy of the proposed modeling and prediction approach.},\n address = {Amsterdam, The Netherlands},\n author = {Samuel Kounev and Christoph Rathfelder and Benjamin Klatt},\n day = {9},\n issn = {1571-0661},\n journal = {{Electronic Notes in Theoretical Computer Science (ENTCS)}},\n month = {May},\n pages = {3--9},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/311.pdf},\n publisher = {Elsevier Science Publishers B. V.},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/311},\n title = {{Modeling of Event-based Communication in Component-based Architectures: State-of-the-Art and Future Directions}},\n url = {http://www.sciencedirect.com/science/article/pii/S1571066113000248},\n volume = {295},\n year = {2013},\n}\n\n','\n\nSamuel Kounev, Christoph Rathfelder, and Benjamin Klatt.\nModeling of Event-based Communication in Component-based\nArchitectures: State-of-the-Art and Future Directions.\nElectronic Notes in Theoretical Computer Science (ENTCS),\n295:3-9, May 2013, Elsevier Science Publishers B. V., Amsterdam, The\nNetherlands.\n[ bib | slides | http | .pdf | Abstract  ] 
\n@article{KoRaKl2012-FESCA-Keynote,\nabstract = {Event-based communication is used in different domains including telecommunications, transportation, and business information systems to build scalable distributed systems. Such systems typically have stringent requirements for performance and scalability as they provide business and mission critical services. While the use of event-based communication enables loosely-coupled interactions between components and leads to improved system scalability, it makes it much harder for developers to estimate the system\'s behavior and performance under load due to the decoupling of components and control flow. We present an overview on our approach enabling the modeling and performance prediction of event-based system at the architecture level. Applying a model-to-model transformation, our approach integrates platform-specific performance influences of the underlying middleware while enabling the use of different existing analytical and simulation-based prediction techniques. The results of two real world case studies demonstrate the effectiveness, practicability and accuracy of the proposed modeling and prediction approach.},\naddress = {Amsterdam, The Netherlands},\nauthor = {Samuel Kounev and Christoph Rathfelder and Benjamin Klatt},\nday = {9},\nissn = {1571-0661},\njournal = {{Electronic Notes in Theoretical Computer Science (ENTCS)}},\nmonth = {May},\npages = {3--9},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/311.pdf},\npublisher = {Elsevier Science Publishers B. V.},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/311},\ntitle = {{Modeling of Event-based Communication in Component-based Architectures: State-of-the-Art and Future Directions}},\nurl = {http://www.sciencedirect.com/science/article/pii/S1571066113000248},\nvolume = {295},\nyear = {2013}\n}\n
\n
\nEvent-based communication is used in different domains including telecommunications, transportation, and business information systems to build scalable distributed systems. Such systems typically have stringent requirements for performance and scalability as they provide business and mission critical services. While the use of event-based communication enables loosely-coupled interactions between components and leads to improved system scalability, it makes it much harder for developers to estimate the system\'s behavior and performance under load due to the decoupling of components and control flow. We present an overview on our approach enabling the modeling and performance prediction of event-based system at the architecture level. Applying a model-to-model transformation, our approach integrates platform-specific performance influences of the underlying middleware while enabling the use of different existing analytical and simulation-based prediction techniques. The results of two real world case studies demonstrate the effectiveness, practicability and accuracy of the proposed modeling and prediction approach.\n
\n','
\n@article{KoRaKl2012-FESCA-Keynote,\n  abstract = {Event-based communication is used in different domains including telecommunications, transportation, and business information systems to build scalable distributed systems. Such systems typically have stringent requirements for performance and scalability as they provide business and mission critical services. While the use of event-based communication enables loosely-coupled interactions between components and leads to improved system scalability, it makes it much harder for developers to estimate the system\'s behavior and performance under load due to the decoupling of components and control flow. We present an overview on our approach enabling the modeling and performance prediction of event-based system at the architecture level. Applying a model-to-model transformation, our approach integrates platform-specific performance influences of the underlying middleware while enabling the use of different existing analytical and simulation-based prediction techniques. The results of two real world case studies demonstrate the effectiveness, practicability and accuracy of the proposed modeling and prediction approach.},\n  address = {Amsterdam, The Netherlands},\n  author = {Samuel Kounev and Christoph Rathfelder and Benjamin Klatt},\n  day = {9},\n  issn = {1571-0661},\n  journal = {{Electronic Notes in Theoretical Computer Science (ENTCS)}},\n  month = {May},\n  pages = {3--9},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/311.pdf},\n  publisher = {Elsevier Science Publishers B. V.},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/311},\n  title = {{Modeling of Event-based Communication in Component-based Architectures: State-of-the-Art and Future Directions}},\n  url = {http://www.sciencedirect.com/science/article/pii/S1571066113000248},\n  volume = {295},\n  year = {2013}\n}\n
\n\n','Event-based communication is used in different domains including telecommunications, transportation, and business information systems to build scalable distributed systems. Such systems typically have stringent requirements for performance and scalability as they provide business and mission critical services. While the use of event-based communication enables loosely-coupled interactions between components and leads to improved system scalability, it makes it much harder for developers to estimate the system\'s behavior and performance under load due to the decoupling of components and control flow. We present an overview on our approach enabling the modeling and performance prediction of event-based system at the architecture level. Applying a model-to-model transformation, our approach integrates platform-specific performance influences of the underlying middleware while enabling the use of different existing analytical and simulation-based prediction techniques. The results of two real world case studies demonstrate the effectiveness, practicability and accuracy of the proposed modeling and prediction approach.','{Modeling of Event-based Communication in Component-based Architectures: State-of-the-Art and Future Directions}',0,5,2013,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(312,'paper','KoReBrBrJoBaStGi2012-ResBook-CloudChallenges','incollection','@incollection{KoReBrBrJoBaStGi2012-ResBook-CloudChallenges,\n abstract = {{Cloud Computing is a novel paradigm for providing data center resources as on demand services in a pay-as-you-go manner. It promises significant cost savings by making it possible to consolidate workloads and share infrastructure resources among multiple applications resulting in higher cost- and energy-efficiency. However, these benefits come at the cost of increased system complexity and dynamicity posing new challenges in providing service dependability and resilience for applications running in a Cloud environment. At the same time, the virtualization of physical resources, inherent in Cloud Computing, provides new opportunities for novel dependability and quality-of-service management techniques that can potentially improve system resilience. In this chapter, we first discuss in detail the challenges and opportunities introduced by the Cloud Computing paradigm. We then provide a review of the state-of-the-art on dependability and resilience management in Cloud environments, and conclude with an overview of emerging research directions.}},\n address = {Berlin, Heidelberg},\n author = {Samuel Kounev and Philipp Reinecke and Fabian Brosig and Jeremy T. Bradley and Kaustubh Joshi and Vlastimil Babka and Anton Stefanek and Stephen Gilmore},\n booktitle = {Resilience Assessment and Evaluation of Computing Systems},\n editor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\n isbn = {978-3-642-29031-2},\n note = {ISBN: 978-3-642-29031-2},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/312.pdf},\n publisher = {Springer-Verlag},\n series = {XVIII},\n title = {Providing Dependability and Resilience in the Cloud: Challenges and Opportunities},\n url = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\n year = {2012},\n}\n\n','\n\nSamuel Kounev, Philipp Reinecke, Fabian Brosig, Jeremy T. Bradley, Kaustubh\nJoshi, Vlastimil Babka, Anton Stefanek, and Stephen Gilmore.\nProviding dependability and resilience in the cloud: Challenges and\nopportunities.\nIn Resilience Assessment and Evaluation of Computing Systems,\nK. Wolter, A. Avritzer, M. Vieira, and A. van Moorsel, editors, XVIII.\nSpringer-Verlag, Berlin, Heidelberg, 2012.\nISBN: 978-3-642-29031-2.\n[ bib | http | .pdf | Abstract  ] 
\n@incollection{KoReBrBrJoBaStGi2012-ResBook-CloudChallenges,\nabstract = {{Cloud Computing is a novel paradigm for providing data center resources as on demand services in a pay-as-you-go manner. It promises significant cost savings by making it possible to consolidate workloads and share infrastructure resources among multiple applications resulting in higher cost- and energy-efficiency. However, these benefits come at the cost of increased system complexity and dynamicity posing new challenges in providing service dependability and resilience for applications running in a Cloud environment. At the same time, the virtualization of physical resources, inherent in Cloud Computing, provides new opportunities for novel dependability and quality-of-service management techniques that can potentially improve system resilience. In this chapter, we first discuss in detail the challenges and opportunities introduced by the Cloud Computing paradigm. We then provide a review of the state-of-the-art on dependability and resilience management in Cloud environments, and conclude with an overview of emerging research directions.}},\naddress = {Berlin, Heidelberg},\nauthor = {Samuel Kounev and Philipp Reinecke and Fabian Brosig and Jeremy T. Bradley and Kaustubh Joshi and Vlastimil Babka and Anton Stefanek and Stephen Gilmore},\nbooktitle = {Resilience Assessment and Evaluation of Computing Systems},\neditor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\nisbn = {978-3-642-29031-2},\nnote = {ISBN: 978-3-642-29031-2},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/312.pdf},\npublisher = {Springer-Verlag},\nseries = {XVIII},\ntitle = {Providing Dependability and Resilience in the Cloud: Challenges and Opportunities},\nurl = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\nyear = {2012}\n}\n
\n
\nCloud Computing is a novel paradigm for providing data center resources as on demand services in a pay-as-you-go manner. It promises significant cost savings by making it possible to consolidate workloads and share infrastructure resources among multiple applications resulting in higher cost- and energy-efficiency. However, these benefits come at the cost of increased system complexity and dynamicity posing new challenges in providing service dependability and resilience for applications running in a Cloud environment. At the same time, the virtualization of physical resources, inherent in Cloud Computing, provides new opportunities for novel dependability and quality-of-service management techniques that can potentially improve system resilience. In this chapter, we first discuss in detail the challenges and opportunities introduced by the Cloud Computing paradigm. We then provide a review of the state-of-the-art on dependability and resilience management in Cloud environments, and conclude with an overview of emerging research directions.\n
\n','
\n@incollection{KoReBrBrJoBaStGi2012-ResBook-CloudChallenges,\n  abstract = {{Cloud Computing is a novel paradigm for providing data center resources as on demand services in a pay-as-you-go manner. It promises significant cost savings by making it possible to consolidate workloads and share infrastructure resources among multiple applications resulting in higher cost- and energy-efficiency. However, these benefits come at the cost of increased system complexity and dynamicity posing new challenges in providing service dependability and resilience for applications running in a Cloud environment. At the same time, the virtualization of physical resources, inherent in Cloud Computing, provides new opportunities for novel dependability and quality-of-service management techniques that can potentially improve system resilience. In this chapter, we first discuss in detail the challenges and opportunities introduced by the Cloud Computing paradigm. We then provide a review of the state-of-the-art on dependability and resilience management in Cloud environments, and conclude with an overview of emerging research directions.}},\n  address = {Berlin, Heidelberg},\n  author = {Samuel Kounev and Philipp Reinecke and Fabian Brosig and Jeremy T. Bradley and Kaustubh Joshi and Vlastimil Babka and Anton Stefanek and Stephen Gilmore},\n  booktitle = {Resilience Assessment and Evaluation of Computing Systems},\n  editor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\n  isbn = {978-3-642-29031-2},\n  note = {ISBN: 978-3-642-29031-2},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/312.pdf},\n  publisher = {Springer-Verlag},\n  series = {XVIII},\n  title = {Providing Dependability and Resilience in the Cloud: Challenges and Opportunities},\n  url = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\n  year = {2012}\n}\n
\n\n','{Cloud Computing is a novel paradigm for providing data center resources as on demand services in a pay-as-you-go manner. It promises significant cost savings by making it possible to consolidate workloads and share infrastructure resources among multiple applications resulting in higher cost- and energy-efficiency. However, these benefits come at the cost of increased system complexity and dynamicity posing new challenges in providing service dependability and resilience for applications running in a Cloud environment. At the same time, the virtualization of physical resources, inherent in Cloud Computing, provides new opportunities for novel dependability and quality-of-service management techniques that can potentially improve system resilience. In this chapter, we first discuss in detail the challenges and opportunities introduced by the Cloud Computing paradigm. We then provide a review of the state-of-the-art on dependability and resilience management in Cloud environments, and conclude with an overview of emerging research directions.}','Providing Dependability and Resilience in the Cloud: Challenges and Opportunities',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(313,'paper','Ko2013-HotTopiCS-Relate','inproceedings','@inproceedings{Ko2013-HotTopiCS-Relate,\n author = {Samuel Kounev and Stamatia Rizou and Steffen Zschaler and Spiros Alexakis and Tomas Bures and Jean-Marc J{\\\'e}z{\\\'e}quel and Dimitrios Kourtesis and Stelios Pantelopoulos},\n booktitle = {International Workshop on Hot Topics in Cloud Services (HotTopiCS 2013)},\n day = {20--21},\n location = {Prague, Czech Republic},\n month = {April},\n title = {{RELATE: A Research Training Network on Engineering and Provisioning of Service-Based Cloud Applications}},\n year = {2013},\n}\n\n','\n\nSamuel Kounev, Stamatia Rizou, Steffen Zschaler, Spiros Alexakis, Tomas Bures,\nJean-Marc Jézéquel, Dimitrios Kourtesis, and Stelios Pantelopoulos.\nRELATE: A Research Training Network on Engineering and Provisioning\nof Service-Based Cloud Applications.\nIn International Workshop on Hot Topics in Cloud Services\n(HotTopiCS 2013), Prague, Czech Republic, April 20-21, 2013.\n[ bib  ] 
\n@inproceedings{Ko2013-HotTopiCS-Relate,\nauthor = {Samuel Kounev and Stamatia Rizou and Steffen Zschaler and Spiros Alexakis and Tomas Bures and Jean-Marc J{\\\'e}z{\\\'e}quel and Dimitrios Kourtesis and Stelios Pantelopoulos},\nbooktitle = {International Workshop on Hot Topics in Cloud Services (HotTopiCS 2013)},\nday = {20--21},\nlocation = {Prague, Czech Republic},\nmonth = {April},\ntitle = {{RELATE: A Research Training Network on Engineering and Provisioning of Service-Based Cloud Applications}},\nyear = {2013}\n}\n
\n
\n','
\n@inproceedings{Ko2013-HotTopiCS-Relate,\n  author = {Samuel Kounev and Stamatia Rizou and Steffen Zschaler and Spiros Alexakis and Tomas Bures and Jean-Marc J{\\\'e}z{\\\'e}quel and Dimitrios Kourtesis and Stelios Pantelopoulos},\n  booktitle = {International Workshop on Hot Topics in Cloud Services (HotTopiCS 2013)},\n  day = {20--21},\n  location = {Prague, Czech Republic},\n  month = {April},\n  title = {{RELATE: A Research Training Network on Engineering and Provisioning of Service-Based Cloud Applications}},\n  year = {2013}\n}\n
\n\n',NULL,'{RELATE: A Research Training Network on Engineering and Provisioning of Service-Based Cloud Applications}',0,4,2013,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(315,'paper','kounev2008b','misc','@misc{kounev2008b,\n author = {Samuel Kounev and Kai Sachs},\n howpublished = {DEV2DEV Article, O\'Reilly Publishing Group},\n month = {March},\n title = {{SPECjms2007: A Novel Benchmark and Performance Analysis Framework for Message-Oriented Middleware}},\n url = {http://www.oracle.com/technology/pub/articles/dev2arch/2008/03/specjms2007.html},\n year = {2008},\n}\n\n','\n\nSamuel Kounev and Kai Sachs.\nSPECjms2007: A Novel Benchmark and Performance Analysis Framework\nfor Message-Oriented Middleware.\nDEV2DEV Article, O\'Reilly Publishing Group, March 2008.\n[ bib | .html  ] 
\n@misc{kounev2008b,\nauthor = {Samuel Kounev and Kai Sachs},\nhowpublished = {DEV2DEV Article, O\'Reilly Publishing Group},\nmonth = {March},\ntitle = {{SPECjms2007: A Novel Benchmark and Performance Analysis Framework for Message-Oriented Middleware}},\nurl = {http://www.oracle.com/technology/pub/articles/dev2arch/2008/03/specjms2007.html},\nyear = {2008}\n}\n
\n
\n','
\n@misc{kounev2008b,\n  author = {Samuel Kounev and Kai Sachs},\n  howpublished = {DEV2DEV Article, O\'Reilly Publishing Group},\n  month = {March},\n  title = {{SPECjms2007: A Novel Benchmark and Performance Analysis Framework for Message-Oriented Middleware}},\n  url = {http://www.oracle.com/technology/pub/articles/dev2arch/2008/03/specjms2007.html},\n  year = {2008}\n}\n
\n\n',NULL,'{SPECjms2007: A Novel Benchmark and Performance Analysis Framework for Message-Oriented Middleware}',0,3,2008,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(316,'paper','KoSaBaBu2008-ISORC-ModelingDEBS','inproceedings','@inproceedings{KoSaBaBu2008-ISORC-ModelingDEBS,\n abstract = {Distributed event-based systems (DEBS) are gaining increasing attention in new application areas such as transport information monitoring, event-driven supply-chain management and ubiquitous sensor-rich environments. However, as DEBS increasingly enter the enterprise and commercial domains, performance and quality of service issues are becoming a major concern. While numerous approaches to performance modeling and evaluation of conventional request/reply-based distributed systems are available in the literature, no general approach exists for DEBS. This paper is the first to provide a comprehensive methodology for workload characterization and performance modeling of DEBS. A workload model of a generic DEBS is developed and operational analysis techniques are used to characterize the system traffic and derive an approximation for the mean event delivery latency. Following this, a modeling technique is presented that can be used for accurate performance prediction. The paper is concluded with a case study of a real life system demonstrating the effectiveness and practicality of the proposed approach.},\n address = {Washington, DC, USA},\n author = {Samuel Kounev and Kai Sachs and Jean Bacon and Alejandro Buchmann},\n booktitle = {Proceedings of the 11th IEEE International Symposium on Object Oriented Real-Time Distributed Computing (ISORC 2008), Orlando, Florida, USA, May 5-7, 2008},\n doi = {10.1109/ISORC.2008.51},\n isbn = {978-0-7695-3132-8},\n note = {Acceptance Rate (Full Paper): 30\\%, Best-Paper-Award-Nomination},\n pages = {13--22},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/316.pdf},\n publisher = {IEEE Computer Society},\n title = {{A Methodology for Performance Modeling of Distributed Event-Based Systems}},\n year = {2008},\n}\n\n','\n\nSamuel Kounev, Kai Sachs, Jean Bacon, and Alejandro Buchmann.\nA Methodology for Performance Modeling of Distributed Event-Based\nSystems.\nIn Proceedings of the 11th IEEE International Symposium on\nObject Oriented Real-Time Distributed Computing (ISORC 2008), Orlando,\nFlorida, USA, May 5-7, 2008, 2008, pages 13-22. IEEE Computer Society,\nWashington, DC, USA.\n2008, Acceptance Rate (Full Paper): 30%,\nBest-Paper-Award-Nomination.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{KoSaBaBu2008-ISORC-ModelingDEBS,\nabstract = {Distributed event-based systems (DEBS) are gaining increasing attention in new application areas such as transport information monitoring, event-driven supply-chain management and ubiquitous sensor-rich environments. However, as DEBS increasingly enter the enterprise and commercial domains, performance and quality of service issues are becoming a major concern. While numerous approaches to performance modeling and evaluation of conventional request/reply-based distributed systems are available in the literature, no general approach exists for DEBS. This paper is the first to provide a comprehensive methodology for workload characterization and performance modeling of DEBS. A workload model of a generic DEBS is developed and operational analysis techniques are used to characterize the system traffic and derive an approximation for the mean event delivery latency. Following this, a modeling technique is presented that can be used for accurate performance prediction. The paper is concluded with a case study of a real life system demonstrating the effectiveness and practicality of the proposed approach.},\naddress = {Washington, DC, USA},\nauthor = {Samuel Kounev and Kai Sachs and Jean Bacon and Alejandro Buchmann},\nbooktitle = {Proceedings of the 11th IEEE International Symposium on Object Oriented Real-Time Distributed Computing (ISORC 2008), Orlando, Florida, USA, May 5-7, 2008},\ndoi = {10.1109/ISORC.2008.51},\nisbn = {978-0-7695-3132-8},\nnote = {Acceptance Rate (Full Paper): 30\\%, Best-Paper-Award-Nomination},\npages = {13--22},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/316.pdf},\npublisher = {IEEE Computer Society},\ntitle = {{A Methodology for Performance Modeling of Distributed Event-Based Systems}},\nyear = {2008}\n}\n
\n
\nDistributed event-based systems (DEBS) are gaining increasing attention in new application areas such as transport information monitoring, event-driven supply-chain management and ubiquitous sensor-rich environments. However, as DEBS increasingly enter the enterprise and commercial domains, performance and quality of service issues are becoming a major concern. While numerous approaches to performance modeling and evaluation of conventional request/reply-based distributed systems are available in the literature, no general approach exists for DEBS. This paper is the first to provide a comprehensive methodology for workload characterization and performance modeling of DEBS. A workload model of a generic DEBS is developed and operational analysis techniques are used to characterize the system traffic and derive an approximation for the mean event delivery latency. Following this, a modeling technique is presented that can be used for accurate performance prediction. The paper is concluded with a case study of a real life system demonstrating the effectiveness and practicality of the proposed approach.\n
\n','
\n@inproceedings{KoSaBaBu2008-ISORC-ModelingDEBS,\n  abstract = {Distributed event-based systems (DEBS) are gaining increasing attention in new application areas such as transport information monitoring, event-driven supply-chain management and ubiquitous sensor-rich environments. However, as DEBS increasingly enter the enterprise and commercial domains, performance and quality of service issues are becoming a major concern. While numerous approaches to performance modeling and evaluation of conventional request/reply-based distributed systems are available in the literature, no general approach exists for DEBS. This paper is the first to provide a comprehensive methodology for workload characterization and performance modeling of DEBS. A workload model of a generic DEBS is developed and operational analysis techniques are used to characterize the system traffic and derive an approximation for the mean event delivery latency. Following this, a modeling technique is presented that can be used for accurate performance prediction. The paper is concluded with a case study of a real life system demonstrating the effectiveness and practicality of the proposed approach.},\n  address = {Washington, DC, USA},\n  author = {Samuel Kounev and Kai Sachs and Jean Bacon and Alejandro Buchmann},\n  booktitle = {Proceedings of the 11th IEEE International Symposium on Object Oriented Real-Time Distributed Computing (ISORC 2008), Orlando, Florida, USA, May 5-7, 2008},\n  doi = {10.1109/ISORC.2008.51},\n  isbn = {978-0-7695-3132-8},\n  note = {Acceptance Rate (Full Paper): 30\\%, Best-Paper-Award-Nomination},\n  pages = {13--22},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/316.pdf},\n  publisher = {IEEE Computer Society},\n  title = {{A Methodology for Performance Modeling of Distributed Event-Based Systems}},\n  year = {2008}\n}\n
\n\n','Distributed event-based systems (DEBS) are gaining increasing attention in new application areas such as transport information monitoring, event-driven supply-chain management and ubiquitous sensor-rich environments. However, as DEBS increasingly enter the enterprise and commercial domains, performance and quality of service issues are becoming a major concern. While numerous approaches to performance modeling and evaluation of conventional request/reply-based distributed systems are available in the literature, no general approach exists for DEBS. This paper is the first to provide a comprehensive methodology for workload characterization and performance modeling of DEBS. A workload model of a generic DEBS is developed and operational analysis techniques are used to characterize the system traffic and derive an approximation for the mean event delivery latency. Following this, a modeling technique is presented that can be used for accurate performance prediction. The paper is concluded with a case study of a real life system demonstrating the effectiveness and practicality of the proposed approach.','{A Methodology for Performance Modeling of Distributed Event-Based Systems}',0,0,2008,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(317,'paper','KoSp2011-QPME20-UserGuide','manual','@manual{KoSp2011-QPME20-UserGuide,\n title = {QPME 2.0 User\'s Guide},\n year = {2011},\n month = {5},\n pdf = {http://descartes.ipd.kit.edu/fileadmin/user_upload/descartes/QPME/QPME-UsersGuide.pdf},\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n organization = {Karlsruhe Institute of Technology},\n author = {Kounev, Samuel and Spinner, Simon and J\\\"{u}rgen Walter},\n}\n\n','\n\nSamuel Kounev, Simon Spinner, and Jürgen Walter.\nQPME 2.0 User\'s Guide.\nKarlsruhe Institute of Technology, Am Fasanengarten 5, 76131\nKarlsruhe, Germany, 5 2011.\n[ bib | .pdf  ] 
\n@manual{KoSp2011-QPME20-UserGuide,\ntitle = {QPME 2.0 User\'s Guide},\nyear = {2011},\nmonth = {5},\npdf = {http://descartes.ipd.kit.edu/fileadmin/user_upload/descartes/QPME/QPME-UsersGuide.pdf},\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\norganization = {Karlsruhe Institute of Technology},\nauthor = {Kounev, Samuel and Spinner, Simon and J\\\"{u}rgen Walter}\n}\n
\n
\n','
\n@manual{KoSp2011-QPME20-UserGuide,\n  title = {QPME 2.0 User\'s Guide},\n  year = {2011},\n  month = {5},\n  pdf = {http://descartes.ipd.kit.edu/fileadmin/user_upload/descartes/QPME/QPME-UsersGuide.pdf},\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  organization = {Karlsruhe Institute of Technology},\n  author = {Kounev, Samuel and Spinner, Simon and J\\\"{u}rgen Walter}\n}\n
\n\n',NULL,'QPME 2.0 User\'s Guide',0,5,2011,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(318,'paper','KoSpMe2010-Festschrift-QPME2','incollection','@incollection{KoSpMe2010-Festschrift-QPME2,\n title = {{QPME 2.0 - A Tool for Stochastic Modeling and Analysis Using Queueing Petri Nets}},\n year = {2010},\n volume = {6462},\n pages = {293--311},\n editor = {Sachs, Kai and Petrov, Ilia and Guerrero, Pablo},\n publisher = {Springer-Verlag},\n address = {Berlin, Heidelberg},\n series = {Lecture Notes in Computer Science},\n booktitle = {From Active Data Management to Event-Based Systems and More},\n isbn = {978-3-642-17225-0},\n doi = {10.1007/978-3-642-17226-7_18},\n author = {Kounev, Samuel and Spinner, Simon and Meier, Philipp},\n}\n\n','\n\nSamuel Kounev, Simon Spinner, and Philipp Meier.\nQPME 2.0 - A Tool for Stochastic Modeling and Analysis Using\nQueueing Petri Nets.\nIn From Active Data Management to Event-Based Systems and More,\nKai Sachs, Ilia Petrov, and Pablo Guerrero, editors, volume 6462 of \nLecture Notes in Computer Science, pages 293-311. Springer-Verlag, Berlin,\nHeidelberg, 2010.\n[ bib | DOI  ] 
\n@incollection{KoSpMe2010-Festschrift-QPME2,\ntitle = {{QPME 2.0 - A Tool for Stochastic Modeling and Analysis Using Queueing Petri Nets}},\nyear = {2010},\nvolume = {6462},\npages = {293--311},\neditor = {Sachs, Kai and Petrov, Ilia and Guerrero, Pablo},\npublisher = {Springer-Verlag},\naddress = {Berlin, Heidelberg},\nseries = {Lecture Notes in Computer Science},\nbooktitle = {From Active Data Management to Event-Based Systems and More},\nisbn = {978-3-642-17225-0},\ndoi = {10.1007/978-3-642-17226-7_18},\nauthor = {Kounev, Samuel and Spinner, Simon and Meier, Philipp}\n}\n
\n
\n','
\n@incollection{KoSpMe2010-Festschrift-QPME2,\n  title = {{QPME 2.0 - A Tool for Stochastic Modeling and Analysis Using Queueing Petri Nets}},\n  year = {2010},\n  volume = {6462},\n  pages = {293--311},\n  editor = {Sachs, Kai and Petrov, Ilia and Guerrero, Pablo},\n  publisher = {Springer-Verlag},\n  address = {Berlin, Heidelberg},\n  series = {Lecture Notes in Computer Science},\n  booktitle = {From Active Data Management to Event-Based Systems and More},\n  isbn = {978-3-642-17225-0},\n  doi = {10.1007/978-3-642-17226-7_18},\n  author = {Kounev, Samuel and Spinner, Simon and Meier, Philipp}\n}\n
\n\n',NULL,'{QPME 2.0 - A Tool for Stochastic Modeling and Analysis Using Queueing Petri Nets}',0,0,2010,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(319,'paper','KoSpMe2012-icpe-QPME_Tutorial','inproceedings','@inproceedings{KoSpMe2012-icpe-QPME_Tutorial,\n title = {Introduction to Queueing Petri Nets: Modeling Formalism, Tool Support and Case Studies (Tutorial Paper)},\n year = {2012},\n month = {4},\n pages = {9--18},\n abstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and evaluating their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. This tutorial presents an introduction to queueing Petri nets first introducing the modeling formalism itself and then summarizing the results of several modeling case studies which demonstrate how queueing Petri nets can be used for performance modeling and analysis. As part of the tutorial, we present QPME (Queueing Petri net Modeling Environment), an open-source tool for stochastic modeling and analysis of systems using queueing Petri nets. Finally, we briefly present a model-to-model transformation automatically generating a queueing Petri net model from a higher-level software architecture model annotated with performance relevant information.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/319.pdf},\n publisher = {ACM},\n address = {New York, NY, USA},\n booktitle = {Proceedings of the 3rd ACM/SPEC International Conference on Performance Engineering (ICPE 2012), Boston, USA, 22-25 April 2012},\n isbn = {978-1-4503-1202-8},\n doi = {10.1145/2188286.2188290},\n author = {Kounev, Samuel and Spinner, Simon and Meier, Philipp},\n}\n\n','\n\nSamuel Kounev, Simon Spinner, and Philipp Meier.\nIntroduction to queueing petri nets: Modeling formalism, tool support\nand case studies (tutorial paper).\nIn Proceedings of the 3rd ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2012), Boston, USA, 22-25 April 2012, 4 2012,\npages 9-18. ACM, New York, NY, USA.\n4 2012.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{KoSpMe2012-icpe-QPME_Tutorial,\ntitle = {Introduction to Queueing Petri Nets: Modeling Formalism, Tool Support and Case Studies (Tutorial Paper)},\nyear = {2012},\nmonth = {4},\npages = {9--18},\nabstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and evaluating their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. This tutorial presents an introduction to queueing Petri nets first introducing the modeling formalism itself and then summarizing the results of several modeling case studies which demonstrate how queueing Petri nets can be used for performance modeling and analysis. As part of the tutorial, we present QPME (Queueing Petri net Modeling Environment), an open-source tool for stochastic modeling and analysis of systems using queueing Petri nets. Finally, we briefly present a model-to-model transformation automatically generating a queueing Petri net model from a higher-level software architecture model annotated with performance relevant information.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/319.pdf},\npublisher = {ACM},\naddress = {New York, NY, USA},\nbooktitle = {Proceedings of the 3rd ACM/SPEC International Conference on Performance Engineering (ICPE 2012), Boston, USA, 22-25 April 2012},\nisbn = {978-1-4503-1202-8},\ndoi = {10.1145/2188286.2188290},\nauthor = {Kounev, Samuel and Spinner, Simon and Meier, Philipp}\n}\n
\n
\nQueueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and evaluating their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. This tutorial presents an introduction to queueing Petri nets first introducing the modeling formalism itself and then summarizing the results of several modeling case studies which demonstrate how queueing Petri nets can be used for performance modeling and analysis. As part of the tutorial, we present QPME (Queueing Petri net Modeling Environment), an open-source tool for stochastic modeling and analysis of systems using queueing Petri nets. Finally, we briefly present a model-to-model transformation automatically generating a queueing Petri net model from a higher-level software architecture model annotated with performance relevant information.\n
\n','
\n@inproceedings{KoSpMe2012-icpe-QPME_Tutorial,\n  title = {Introduction to Queueing Petri Nets: Modeling Formalism, Tool Support and Case Studies (Tutorial Paper)},\n  year = {2012},\n  month = {4},\n  pages = {9--18},\n  abstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and evaluating their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. This tutorial presents an introduction to queueing Petri nets first introducing the modeling formalism itself and then summarizing the results of several modeling case studies which demonstrate how queueing Petri nets can be used for performance modeling and analysis. As part of the tutorial, we present QPME (Queueing Petri net Modeling Environment), an open-source tool for stochastic modeling and analysis of systems using queueing Petri nets. Finally, we briefly present a model-to-model transformation automatically generating a queueing Petri net model from a higher-level software architecture model annotated with performance relevant information.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/319.pdf},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  booktitle = {Proceedings of the 3rd ACM/SPEC International Conference on Performance Engineering (ICPE 2012), Boston, USA, 22-25 April 2012},\n  isbn = {978-1-4503-1202-8},\n  doi = {10.1145/2188286.2188290},\n  author = {Kounev, Samuel and Spinner, Simon and Meier, Philipp}\n}\n
\n\n',NULL,'{Introduction to Queueing Petri Nets: Modeling Formalism, Tool Support and Case Studies}',0,4,2012,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(320,'paper','KoWeBu2004-CMG_JCRM-JBoss','article','@article{KoWeBu2004-CMG_JCRM-JBoss,\n author = {Samuel Kounev and B{\\\"o}rn Weis and Alejandro Buchmann},\n journal = {Journal of Computer Resource Management},\n month = {September},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/320.pdf},\n publisher = {Computer Measurement Group (CMG)},\n title = {{Performance Tuning and Optimization of J2EE Applications on the JBoss Platform}},\n volume = {113},\n year = {2004},\n}\n\n','\n\nSamuel Kounev, Börn Weis, and Alejandro Buchmann.\nPerformance Tuning and Optimization of J2EE Applications on the\nJBoss Platform.\nJournal of Computer Resource Management, 113, September 2004,\nComputer Measurement Group (CMG).\n[ bib | .pdf  ] 
\n@article{KoWeBu2004-CMG_JCRM-JBoss,\nauthor = {Samuel Kounev and B{\\\"o}rn Weis and Alejandro Buchmann},\njournal = {Journal of Computer Resource Management},\nmonth = {September},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/320.pdf},\npublisher = {Computer Measurement Group (CMG)},\ntitle = {{Performance Tuning and Optimization of J2EE Applications on the JBoss Platform}},\nvolume = {113},\nyear = {2004}\n}\n
\n
\n','
\n@article{KoWeBu2004-CMG_JCRM-JBoss,\n  author = {Samuel Kounev and B{\\\"o}rn Weis and Alejandro Buchmann},\n  journal = {Journal of Computer Resource Management},\n  month = {September},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/320.pdf},\n  publisher = {Computer Measurement Group (CMG)},\n  title = {{Performance Tuning and Optimization of J2EE Applications on the JBoss Platform}},\n  volume = {113},\n  year = {2004}\n}\n
\n\n',NULL,'{Performance Tuning and Optimization of J2EE Applications on the JBoss Platform}',0,9,2004,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(329,'paper','KoNoRe2011-MODELS-Invited','inproceedings','@inproceedings{KoNoRe2011-MODELS-Invited,\n abstract = {Quantitative prediction of non-functional properties, such as performance, reliability, and costs, of software architectures supports systematic software engineering. Even though there usually is a rough idea on bounds for quality of service, the exact required values may be unclear and subject to trade-offs. Designing architectures that exhibit such good trade-off between multiple quality attributes is hard. Even with a given functional design, many degrees of freedom in the software architecture (e.g. component deployment or server configuration) span a large design space. Automated approaches search the design space with multi-objective metaheuristics such as evolutionary algorithms. However, as quality prediction for a single architecture is computationally expensive, these approaches are time consuming. In this work, we enhance an automated improvement approach to take into account bounds for quality of service in order to focus the search on interesting regions of the objective space, while still allowing trade-offs after the search. We compare two different constraint handling techniques to consider the bounds. To validate our approach, we applied both techniques to an architecture model of a component-based business information system. We compared both techniques to an unbounded search in 4 scenarios. Every scenario was examined with 10 optimization runs, each investigating around 1600 architectural candidates. The results indicate that the integration of quality of service bounds during the optimization process can improve the quality of the solutions found, however, the effect depends on the scenario, i.e. the problem and the quality requirements. The best results were achieved for costs requirements: The approach was able to decrease the time needed to find good solutions in the interesting regions of the objective space by 25\\% on average.},\n author = {Anne Koziolek and Qais Noorshams and Ralf Reussner},\n booktitle = {{Models in Software Engineering, Workshops and Symposia at MODELS 2010, Oslo, Norway, October 3-8, 2010, Reports and Revised Selected Papers}},\n doi = {10.1007/978-3-642-21210-9_37},\n editor = {J. Dingel and A. Solberg},\n pages = {384--399},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/329.pdf},\n publisher = {Springer-Verlag Berlin Heidelberg},\n series = {Lecture Notes in Computer Science},\n title = {Focussing Multi-objective Software Architecture Optimization Using Quality of Service Bounds},\n url = {http://dx.doi.org/10.1007/978-3-642-21210-9},\n volume = {6627},\n year = {2011},\n}\n\n','\n\nAnne Koziolek, Qais Noorshams, and Ralf Reussner.\nFocussing multi-objective software architecture optimization using\nquality of service bounds.\nIn Models in Software Engineering, Workshops and Symposia at\nMODELS 2010, Oslo, Norway, October 3-8, 2010, Reports and Revised Selected\nPapers, J. Dingel and A. Solberg, editors, 2011, volume 6627 of \nLecture Notes in Computer Science, pages 384-399. Springer-Verlag Berlin\nHeidelberg.\n2011.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{KoNoRe2011-MODELS-Invited,\nabstract = {Quantitative prediction of non-functional properties, such as performance, reliability, and costs, of software architectures supports systematic software engineering. Even though there usually is a rough idea on bounds for quality of service, the exact required values may be unclear and subject to trade-offs. Designing architectures that exhibit such good trade-off between multiple quality attributes is hard. Even with a given functional design, many degrees of freedom in the software architecture (e.g. component deployment or server configuration) span a large design space. Automated approaches search the design space with multi-objective metaheuristics such as evolutionary algorithms. However, as quality prediction for a single architecture is computationally expensive, these approaches are time consuming. In this work, we enhance an automated improvement approach to take into account bounds for quality of service in order to focus the search on interesting regions of the objective space, while still allowing trade-offs after the search. We compare two different constraint handling techniques to consider the bounds. To validate our approach, we applied both techniques to an architecture model of a component-based business information system. We compared both techniques to an unbounded search in 4 scenarios. Every scenario was examined with 10 optimization runs, each investigating around 1600 architectural candidates. The results indicate that the integration of quality of service bounds during the optimization process can improve the quality of the solutions found, however, the effect depends on the scenario, i.e. the problem and the quality requirements. The best results were achieved for costs requirements: The approach was able to decrease the time needed to find good solutions in the interesting regions of the objective space by 25\\% on average.},\nauthor = {Anne Koziolek and Qais Noorshams and Ralf Reussner},\nbooktitle = {{Models in Software Engineering, Workshops and Symposia at MODELS 2010, Oslo, Norway, October 3-8, 2010, Reports and Revised Selected Papers}},\ndoi = {10.1007/978-3-642-21210-9_37},\neditor = {J. Dingel and A. Solberg},\npages = {384--399},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/329.pdf},\npublisher = {Springer-Verlag Berlin Heidelberg},\nseries = {Lecture Notes in Computer Science},\ntitle = {Focussing Multi-objective Software Architecture Optimization Using Quality of Service Bounds},\nurl = {http://dx.doi.org/10.1007/978-3-642-21210-9},\nvolume = {6627},\nyear = {2011}\n}\n
\n
\nQuantitative prediction of non-functional properties, such as performance, reliability, and costs, of software architectures supports systematic software engineering. Even though there usually is a rough idea on bounds for quality of service, the exact required values may be unclear and subject to trade-offs. Designing architectures that exhibit such good trade-off between multiple quality attributes is hard. Even with a given functional design, many degrees of freedom in the software architecture (e.g. component deployment or server configuration) span a large design space. Automated approaches search the design space with multi-objective metaheuristics such as evolutionary algorithms. However, as quality prediction for a single architecture is computationally expensive, these approaches are time consuming. In this work, we enhance an automated improvement approach to take into account bounds for quality of service in order to focus the search on interesting regions of the objective space, while still allowing trade-offs after the search. We compare two different constraint handling techniques to consider the bounds. To validate our approach, we applied both techniques to an architecture model of a component-based business information system. We compared both techniques to an unbounded search in 4 scenarios. Every scenario was examined with 10 optimization runs, each investigating around 1600 architectural candidates. The results indicate that the integration of quality of service bounds during the optimization process can improve the quality of the solutions found, however, the effect depends on the scenario, i.e. the problem and the quality requirements. The best results were achieved for costs requirements: The approach was able to decrease the time needed to find good solutions in the interesting regions of the objective space by 25% on average.\n
\n','
\n@inproceedings{KoNoRe2011-MODELS-Invited,\n  abstract = {Quantitative prediction of non-functional properties, such as performance, reliability, and costs, of software architectures supports systematic software engineering. Even though there usually is a rough idea on bounds for quality of service, the exact required values may be unclear and subject to trade-offs. Designing architectures that exhibit such good trade-off between multiple quality attributes is hard. Even with a given functional design, many degrees of freedom in the software architecture (e.g. component deployment or server configuration) span a large design space. Automated approaches search the design space with multi-objective metaheuristics such as evolutionary algorithms. However, as quality prediction for a single architecture is computationally expensive, these approaches are time consuming. In this work, we enhance an automated improvement approach to take into account bounds for quality of service in order to focus the search on interesting regions of the objective space, while still allowing trade-offs after the search. We compare two different constraint handling techniques to consider the bounds. To validate our approach, we applied both techniques to an architecture model of a component-based business information system. We compared both techniques to an unbounded search in 4 scenarios. Every scenario was examined with 10 optimization runs, each investigating around 1600 architectural candidates. The results indicate that the integration of quality of service bounds during the optimization process can improve the quality of the solutions found, however, the effect depends on the scenario, i.e. the problem and the quality requirements. The best results were achieved for costs requirements: The approach was able to decrease the time needed to find good solutions in the interesting regions of the objective space by 25\\% on average.},\n  author = {Anne Koziolek and Qais Noorshams and Ralf Reussner},\n  booktitle = {{Models in Software Engineering, Workshops and Symposia at MODELS 2010, Oslo, Norway, October 3-8, 2010, Reports and Revised Selected Papers}},\n  doi = {10.1007/978-3-642-21210-9_37},\n  editor = {J. Dingel and A. Solberg},\n  pages = {384--399},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/329.pdf},\n  publisher = {Springer-Verlag Berlin Heidelberg},\n  series = {Lecture Notes in Computer Science},\n  title = {Focussing Multi-objective Software Architecture Optimization Using Quality of Service Bounds},\n  url = {http://dx.doi.org/10.1007/978-3-642-21210-9},\n  volume = {6627},\n  year = {2011}\n}\n
\n\n','Quantitative prediction of non-functional properties, such as performance, reliability, and costs, of software architectures supports systematic software engineering. Even though there usually is a rough idea on bounds for quality of service, the exact required values may be unclear and subject to trade-offs. Designing architectures that exhibit such good trade-off between multiple quality attributes is hard. Even with a given functional design, many degrees of freedom in the software architecture (e.g. component deployment or server configuration) span a large design space. Automated approaches search the design space with multi-objective metaheuristics such as evolutionary algorithms. However, as quality prediction for a single architecture is computationally expensive, these approaches are time consuming. In this work, we enhance an automated improvement approach to take into account bounds for quality of service in order to focus the search on interesting regions of the objective space, while still allowing trade-offs after the search. We compare two different constraint handling techniques to consider the bounds. To validate our approach, we applied both techniques to an architecture model of a component-based business information system. We compared both techniques to an unbounded search in 4 scenarios. Every scenario was examined with 10 optimization runs, each investigating around 1600 architectural candidates. The results indicate that the integration of quality of service bounds during the optimization process can improve the quality of the solutions found, however, the effect depends on the scenario, i.e. the problem and the quality requirements. The best results were achieved for costs requirements: The approach was able to decrease the time needed to find good solutions in the interesting regions of the objective space by 25\\% on average.','Focussing Multi-objective Software Architecture Optimization Using Quality of Service Bounds',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(367,'paper','Kr2010-uspatent-adaptive-elearning','misc','@misc{Kr2010-uspatent-adaptive-elearning,\n author = {Krebs, Rouven},\n howpublished = {Patent US8108327},\n month = {March},\n title = {METHOD AND SYSTEM FOR FOR AN ADAPTIVE LEARNING STRATEGY},\n year = {2010},\n}\n\n','\n\nRouven Krebs.\nMethod and system for for an adaptive learning strategy.\nPatent US8108327, March 2010.\n[ bib  ] 
\n@misc{Kr2010-uspatent-adaptive-elearning,\nauthor = {Krebs, Rouven},\nhowpublished = {Patent US8108327},\nmonth = {March},\ntitle = {METHOD AND SYSTEM FOR FOR AN ADAPTIVE LEARNING STRATEGY},\nyear = {2010}\n}\n
\n
\n','
\n@misc{Kr2010-uspatent-adaptive-elearning,\n  author = {Krebs, Rouven},\n  howpublished = {Patent US8108327},\n  month = {March},\n  title = {METHOD AND SYSTEM FOR FOR AN ADAPTIVE LEARNING STRATEGY},\n  year = {2010}\n}\n
\n\n',NULL,'METHOD AND SYSTEM FOR FOR AN ADAPTIVE LEARNING STRATEGY',0,3,2010,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(368,'paper','Krebs2010a','mastersthesis','@mastersthesis{Krebs2010a,\n address = {Moltkestr. 30, 76133 Karlsruhe, Germany},\n author = {Rouven Krebs},\n month = {October},\n school = {University of Applied Sciences Karlsruhe},\n title = {Combination of measurement and model based approaches for performance prediction in service oriented systems},\n year = {2010},\n}\n\n','\n\nRouven Krebs.\nCombination of measurement and model based approaches for performance\nprediction in service oriented systems.\nMaster\'s thesis, University of Applied Sciences Karlsruhe, Moltkestr.\n30, 76133 Karlsruhe, Germany, October 2010.\n[ bib  ] 
\n@mastersthesis{Krebs2010a,\naddress = {Moltkestr. 30, 76133 Karlsruhe, Germany},\nauthor = {Rouven Krebs},\nmonth = {October},\nschool = {University of Applied Sciences Karlsruhe},\ntitle = {Combination of measurement and model based approaches for performance prediction in service oriented systems},\nyear = {2010}\n}\n
\n
\n','
\n@mastersthesis{Krebs2010a,\n  address = {Moltkestr. 30, 76133 Karlsruhe, Germany},\n  author = {Rouven Krebs},\n  month = {October},\n  school = {University of Applied Sciences Karlsruhe},\n  title = {Combination of measurement and model based approaches for performance prediction in service oriented systems},\n  year = {2010}\n}\n
\n\n',NULL,'Combination of measurement and model based approaches for performance prediction in service oriented systems',0,10,2010,10,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(369,'paper','Kr2010-uspatent-offline-content','misc','@misc{Kr2010-uspatent-offline-content,\n author = {Krebs, Rouven and Hochwarth, Christian},\n howpublished = {Patent US8644755},\n month = {April},\n title = {METHOD AND SYSTEM FOR MANAGING LEARNING MATERIALS PRESENTED OFFLINE},\n year = {2010},\n}\n\n','\n\nRouven Krebs and Christian Hochwarth.\nMethod and system for managing learning materials presented offline.\nPatent US8644755, April 2010.\n[ bib  ] 
\n@misc{Kr2010-uspatent-offline-content,\nauthor = {Krebs, Rouven and Hochwarth, Christian},\nhowpublished = {Patent US8644755},\nmonth = {April},\ntitle = {METHOD AND SYSTEM FOR MANAGING LEARNING MATERIALS PRESENTED OFFLINE},\nyear = {2010}\n}\n
\n
\n','
\n@misc{Kr2010-uspatent-offline-content,\n  author = {Krebs, Rouven and Hochwarth, Christian},\n  howpublished = {Patent US8644755},\n  month = {April},\n  title = {METHOD AND SYSTEM FOR MANAGING LEARNING MATERIALS PRESENTED OFFLINE},\n  year = {2010}\n}\n
\n\n',NULL,'METHOD AND SYSTEM FOR MANAGING LEARNING MATERIALS PRESENTED OFFLINE',0,4,2010,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(370,'paper','KrMoKo2012-QoSA-QuantifyingPerfIsoMetrics','inproceedings','@inproceedings{KrMoKo2012-QoSA-QuantifyingPerfIsoMetrics,\n address = {New York, USA},\n author = {Krebs, Rouven and Momm, Christof and Kounev, Samuel},\n booktitle = {Proceedings of the 8th ACM SIGSOFT International Conference on the Quality of Software Architectures (QoSA 2012)},\n day = {25--28},\n editor = {Buhnova, Barbora and Vallecillo, Antonio},\n location = {Bertinoro, Italy},\n month = {June},\n note = {Acceptance Rate (Full Paper): 25.6\\%},\n pages = {91--100},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/370.pdf},\n publisher = {ACM Press},\n title = {{M}etrics and {T}echniques for {Q}uantifying {P}erformance {I}solation in {C}loud {E}nvironments},\n url = {http://qosa.ipd.kit.edu/qosa_2012/},\n year = {2012},\n}\n\n','\n\nRouven Krebs, Christof Momm, and Samuel Kounev.\nMetrics and Techniques for Quantifying Performance\nIsolation in Cloud Environments.\nIn Proceedings of the 8th ACM SIGSOFT International Conference\non the Quality of Software Architectures (QoSA 2012), Barbora Buhnova and\nAntonio Vallecillo, editors, Bertinoro, Italy, June 25-28, 2012, pages\n91-100. ACM Press, New York, USA.\nJune 2012, Acceptance Rate (Full Paper): 25.6%.\n[ bib | http | .pdf  ] 
\n@inproceedings{KrMoKo2012-QoSA-QuantifyingPerfIsoMetrics,\naddress = {New York, USA},\nauthor = {Krebs, Rouven and Momm, Christof and Kounev, Samuel},\nbooktitle = {Proceedings of the 8th ACM SIGSOFT International Conference on the Quality of Software Architectures (QoSA 2012)},\nday = {25--28},\neditor = {Buhnova, Barbora and Vallecillo, Antonio},\nlocation = {Bertinoro, Italy},\nmonth = {June},\nnote = {Acceptance Rate (Full Paper): 25.6\\%},\npages = {91--100},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/370.pdf},\npublisher = {ACM Press},\ntitle = {{M}etrics and {T}echniques for {Q}uantifying {P}erformance {I}solation in {C}loud {E}nvironments},\nurl = {http://qosa.ipd.kit.edu/qosa_2012/},\nyear = {2012}\n}\n
\n
\n','
\n@inproceedings{KrMoKo2012-QoSA-QuantifyingPerfIsoMetrics,\n  address = {New York, USA},\n  author = {Krebs, Rouven and Momm, Christof and Kounev, Samuel},\n  booktitle = {Proceedings of the 8th ACM SIGSOFT International Conference on the Quality of Software Architectures (QoSA 2012)},\n  day = {25--28},\n  editor = {Buhnova, Barbora and Vallecillo, Antonio},\n  location = {Bertinoro, Italy},\n  month = {June},\n  note = {Acceptance Rate (Full Paper): 25.6\\%},\n  pages = {91--100},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/370.pdf},\n  publisher = {ACM Press},\n  title = {{M}etrics and {T}echniques for {Q}uantifying {P}erformance {I}solation in {C}loud {E}nvironments},\n  url = {http://qosa.ipd.kit.edu/qosa_2012/},\n  year = {2012}\n}\n
\n\n',NULL,'{M}etrics and {T}echniques for {Q}uantifying {P}erformance {I}solation in {C}loud {E}nvironments',0,6,2012,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(371,'paper','KrMoKo2012-closer-multitenant-saas','inproceedings','@inproceedings{KrMoKo2012-closer-multitenant-saas,\n author = {Krebs, Rouven and Momm, Christof and Kounev, Samuel},\n booktitle = {{Proceedings of the 2nd International Conference on Cloud Computing and Services Science (CLOSER 2012)}},\n day = {18--21},\n location = {Setubal, Portugal},\n month = {April},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/371.pdf},\n publisher = {SciTePress},\n title = {{Architectural Concerns in Multi-Tenant SaaS Applications}},\n titleaddon = {{(Short Paper)}},\n year = {2012},\n}\n\n','\n\nRouven Krebs, Christof Momm, and Samuel Kounev.\nArchitectural Concerns in Multi-Tenant SaaS Applications (Short\nPaper).\nIn Proceedings of the 2nd International Conference on Cloud\nComputing and Services Science (CLOSER 2012), Setubal, Portugal, April\n18-21, 2012. SciTePress.\nApril 2012.\n[ bib | .pdf  ] 
\n@inproceedings{KrMoKo2012-closer-multitenant-saas,\nauthor = {Krebs, Rouven and Momm, Christof and Kounev, Samuel},\nbooktitle = {{Proceedings of the 2nd International Conference on Cloud Computing and Services Science (CLOSER 2012)}},\nday = {18--21},\nlocation = {Setubal, Portugal},\nmonth = {April},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/371.pdf},\npublisher = {SciTePress},\ntitle = {{Architectural Concerns in Multi-Tenant SaaS Applications}},\ntitleaddon = {{(Short Paper)}},\nyear = {2012}\n}\n
\n
\n','
\n@inproceedings{KrMoKo2012-closer-multitenant-saas,\n  author = {Krebs, Rouven and Momm, Christof and Kounev, Samuel},\n  booktitle = {{Proceedings of the 2nd International Conference on Cloud Computing and Services Science (CLOSER 2012)}},\n  day = {18--21},\n  location = {Setubal, Portugal},\n  month = {April},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/371.pdf},\n  publisher = {SciTePress},\n  title = {{Architectural Concerns in Multi-Tenant SaaS Applications}},\n  titleaddon = {{(Short Paper)}},\n  year = {2012}\n}\n
\n\n',NULL,'{Architectural Concerns in Multi-Tenant SaaS Applications}',0,4,2012,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:57',0),(372,'paper','KrWeKo2013-icwe-MTBenchmark','inproceedings','@inproceedings{KrWeKo2013-icwe-MTBenchmark,\n author = {Krebs, Rouven and Wert, Alexander and Kounev, Samuel},\n booktitle = {{Proceedings of the 13th International Conference on Web Engineering (ICWE 2013)}},\n day = {8--12},\n location = {Aalborg, Denmark},\n month = {July},\n organization = {Aalborg University, Denmark},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/372.pdf},\n publisher = {Springer-Verlag},\n title = {{Multi-Tenancy Performance Benchmark for Web Application Platforms}},\n titleaddon = {Industrial Track},\n year = {2013},\n}\n\n','\n\nRouven Krebs, Alexander Wert, and Samuel Kounev.\nMulti-Tenancy Performance Benchmark for Web Application Platforms\nindustrial track.\nIn Proceedings of the 13th International Conference on Web\nEngineering (ICWE 2013), Aalborg, Denmark, July 8-12, 2013. Aalborg\nUniversity, Denmark, Springer-Verlag.\nJuly 2013.\n[ bib | .pdf  ] 
\n@inproceedings{KrWeKo2013-icwe-MTBenchmark,\nauthor = {Krebs, Rouven and Wert, Alexander and Kounev, Samuel},\nbooktitle = {{Proceedings of the 13th International Conference on Web Engineering (ICWE 2013)}},\nday = {8--12},\nlocation = {Aalborg, Denmark},\nmonth = {July},\norganization = {Aalborg University, Denmark},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/372.pdf},\npublisher = {Springer-Verlag},\ntitle = {{Multi-Tenancy Performance Benchmark for Web Application Platforms}},\ntitleaddon = {Industrial Track},\nyear = {2013}\n}\n
\n
\n','
\n@inproceedings{KrWeKo2013-icwe-MTBenchmark,\n  author = {Krebs, Rouven and Wert, Alexander and Kounev, Samuel},\n  booktitle = {{Proceedings of the 13th International Conference on Web Engineering (ICWE 2013)}},\n  day = {8--12},\n  location = {Aalborg, Denmark},\n  month = {July},\n  organization = {Aalborg University, Denmark},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/372.pdf},\n  publisher = {Springer-Verlag},\n  title = {{Multi-Tenancy Performance Benchmark for Web Application Platforms}},\n  titleaddon = {Industrial Track},\n  year = {2013}\n}\n
\n\n',NULL,'{Multi-Tenancy Performance Benchmark for Web Application Platforms}',0,7,2013,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(390,'paper','KuHeKiRe2011-ResourceElasticity','techreport','@techreport{KuHeKiRe2011-ResourceElasticity,\n abstract = {{Elasticity is the ability of a software system to dynamically scale the amount of the resources it provides to clients as their workloads increase or decrease. Elasticity is praised as a key advantage of cloud computing, where computing resources are dynamically added and released. However, there exists no concise or formal definition of elasticity, and thus no approaches to quantify it have been developed so far. Existing work on cloud computing is limited to the technical view of implementing elastic systems, and definitions or scalability have not been extended to cover elasticity. In this report, we present a detailed discussion of elasticity, propose techniques for quantifying and measuring it, and outline next steps to be taken for enabling comparisons between cloud computing offerings on the basis of elasticity. We also present preliminary work on measuring elasticity of resource pools provided by the Java Virtual Machine.}},\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n author = {Michael Kuperberg and Nikolas Roman Herbst and J\\\'{o}akim Gunnarsson von Kistowski and Ralf Reussner},\n institution = {Karlsruhe Institute of Technology (KIT)},\n issn = {2190-4782},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/390.pdf},\n series = {Karlsruhe Reports in Informatics},\n title = {{Defining and Quantifying Elasticity of Resources in Cloud Computing and Scalable Platforms}},\n url = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000023476},\n volume = {16},\n year = {2011},\n}\n\n','\n\nMichael Kuperberg, Nikolas Roman Herbst, Jóakim Gunnarsson von Kistowski,\nand Ralf Reussner.\nDefining and Quantifying Elasticity of Resources in Cloud Computing\nand Scalable Platforms.\nTechnical report, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, 2011.\n[ bib | http | .pdf | Abstract  ] 
\n@techreport{KuHeKiRe2011-ResourceElasticity,\nabstract = {{Elasticity is the ability of a software system to dynamically scale the amount of the resources it provides to clients as their workloads increase or decrease. Elasticity is praised as a key advantage of cloud computing, where computing resources are dynamically added and released. However, there exists no concise or formal definition of elasticity, and thus no approaches to quantify it have been developed so far. Existing work on cloud computing is limited to the technical view of implementing elastic systems, and definitions or scalability have not been extended to cover elasticity. In this report, we present a detailed discussion of elasticity, propose techniques for quantifying and measuring it, and outline next steps to be taken for enabling comparisons between cloud computing offerings on the basis of elasticity. We also present preliminary work on measuring elasticity of resource pools provided by the Java Virtual Machine.}},\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nauthor = {Michael Kuperberg and Nikolas Roman Herbst and J\\\'{o}akim Gunnarsson von Kistowski and Ralf Reussner},\ninstitution = {Karlsruhe Institute of Technology (KIT)},\nissn = {2190-4782},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/390.pdf},\nseries = {Karlsruhe Reports in Informatics},\ntitle = {{Defining and Quantifying Elasticity of Resources in Cloud Computing and Scalable Platforms}},\nurl = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000023476},\nvolume = {16},\nyear = {2011}\n}\n
\n
\nElasticity is the ability of a software system to dynamically scale the amount of the resources it provides to clients as their workloads increase or decrease. Elasticity is praised as a key advantage of cloud computing, where computing resources are dynamically added and released. However, there exists no concise or formal definition of elasticity, and thus no approaches to quantify it have been developed so far. Existing work on cloud computing is limited to the technical view of implementing elastic systems, and definitions or scalability have not been extended to cover elasticity. In this report, we present a detailed discussion of elasticity, propose techniques for quantifying and measuring it, and outline next steps to be taken for enabling comparisons between cloud computing offerings on the basis of elasticity. We also present preliminary work on measuring elasticity of resource pools provided by the Java Virtual Machine.\n
\n','
\n@techreport{KuHeKiRe2011-ResourceElasticity,\n  abstract = {{Elasticity is the ability of a software system to dynamically scale the amount of the resources it provides to clients as their workloads increase or decrease. Elasticity is praised as a key advantage of cloud computing, where computing resources are dynamically added and released. However, there exists no concise or formal definition of elasticity, and thus no approaches to quantify it have been developed so far. Existing work on cloud computing is limited to the technical view of implementing elastic systems, and definitions or scalability have not been extended to cover elasticity. In this report, we present a detailed discussion of elasticity, propose techniques for quantifying and measuring it, and outline next steps to be taken for enabling comparisons between cloud computing offerings on the basis of elasticity. We also present preliminary work on measuring elasticity of resource pools provided by the Java Virtual Machine.}},\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  author = {Michael Kuperberg and Nikolas Roman Herbst and J\\\'{o}akim Gunnarsson von Kistowski and Ralf Reussner},\n  institution = {Karlsruhe Institute of Technology (KIT)},\n  issn = {2190-4782},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/390.pdf},\n  series = {Karlsruhe Reports in Informatics},\n  title = {{Defining and Quantifying Elasticity of Resources in Cloud Computing and Scalable Platforms}},\n  url = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000023476},\n  volume = {16},\n  year = {2011}\n}\n
\n\n','{Elasticity is the ability of a software system to dynamically scale the amount of the resources it provides to clients as their workloads increase or decrease. Elasticity is praised as a key advantage of cloud computing, where computing resources are dynamically added and released. However, there exists no concise or formal definition of elasticity, and thus no approaches to quantify it have been developed so far. Existing work on cloud computing is limited to the technical view of implementing elastic systems, and definitions or scalability have not been extended to cover elasticity. In this report, we present a detailed discussion of elasticity, propose techniques for quantifying and measuring it, and outline next steps to be taken for enabling comparisons between cloud computing offerings on the basis of elasticity. We also present preliminary work on measuring elasticity of resource pools provided by the Java Virtual Machine.}','{Defining and Quantifying Elasticity of Resources in Cloud Computing and Scalable Platforms}',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(405,'paper','LoKr2013-Closer-Isolation','inproceedings','@inproceedings{LoKr2013-Closer-Isolation,\n author = {Loesch, Manuel and Krebs, Rouven},\n booktitle = {{Proceedings of the 3rd International Conference on Cloud Computing and Service Science (CLOSER 2013)}},\n day = {8--10},\n location = {Aachen, Germany},\n month = {May},\n organization = {RWTH Aachen, Germany},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/405.pdf},\n publisher = {SciTePress},\n title = {{Conceptual Approach for Performance Isolation in Multi-Tenant Systems}},\n titleaddon = {Short Paper},\n year = {2013},\n}\n\n','\n\nManuel Loesch and Rouven Krebs.\nConceptual Approach for Performance Isolation in Multi-Tenant\nSystems short paper.\nIn Proceedings of the 3rd International Conference on Cloud\nComputing and Service Science (CLOSER 2013), Aachen, Germany, May 8-10,\n2013. RWTH Aachen, Germany, SciTePress.\nMay 2013.\n[ bib | .pdf  ] 
\n@inproceedings{LoKr2013-Closer-Isolation,\nauthor = {Loesch, Manuel and Krebs, Rouven},\nbooktitle = {{Proceedings of the 3rd International Conference on Cloud Computing and Service Science (CLOSER 2013)}},\nday = {8--10},\nlocation = {Aachen, Germany},\nmonth = {May},\norganization = {RWTH Aachen, Germany},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/405.pdf},\npublisher = {SciTePress},\ntitle = {{Conceptual Approach for Performance Isolation in Multi-Tenant Systems}},\ntitleaddon = {Short Paper},\nyear = {2013}\n}\n
\n
\n','
\n@inproceedings{LoKr2013-Closer-Isolation,\n  author = {Loesch, Manuel and Krebs, Rouven},\n  booktitle = {{Proceedings of the 3rd International Conference on Cloud Computing and Service Science (CLOSER 2013)}},\n  day = {8--10},\n  location = {Aachen, Germany},\n  month = {May},\n  organization = {RWTH Aachen, Germany},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/405.pdf},\n  publisher = {SciTePress},\n  title = {{Conceptual Approach for Performance Isolation in Multi-Tenant Systems}},\n  titleaddon = {Short Paper},\n  year = {2013}\n}\n
\n\n',NULL,'{Conceptual Approach for Performance Isolation in Multi-Tenant Systems}',0,5,2013,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(406,'paper','MuScPaKoRi2009-EuroPar-StoAnalPubSub','inproceedings','@inproceedings{MuScPaKoRi2009-EuroPar-StoAnalPubSub,\n abstract = {With the gradual adoption of publish/subscribe systems in mission critical areas, it is essential that systems are subjected to rigorous performance analysis before they are put into production. However, existing approaches to performance modeling and analysis of publish/subscribe systems suffer from many limitations that seriously constrain their practical applicability. In this paper, we present a generalized method for stochastic analysis of publish/subscribe systems employing identity-based hierarchical routing. The method is based on an analytical model that addresses the major limitations underlying existing work in this area. In particular, it supports arbitrary broker overlay topologies and allows to set workload parameters, e.g., publication rates and subscription lifetimes, individually for each broker. The analysis is illustrated by a running example that helps to gain better understanding of the derived mathematical relationships.},\n author = {Gero M{\\\"u}hl and Arnd Schr{\\\"o}ter and Helge Parzyjegla and Samuel Kounev and Jan Richling},\n booktitle = {Proceedings of the 15th International European Conference on Parallel and Distributed Computing (Euro-Par 2009), Delft, The Netherlands, August 25-28, 2009.},\n note = {Acceptance Rate (Full Paper): 33%},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/406.pdf},\n publisher = {Springer Verlag},\n title = {{Stochastic Analysis of Hierarchical Publish/Subscribe Systems}},\n url = {http://europar2009.ewi.tudelft.nl/},\n year = {2009},\n}\n\n','\n\nGero Mühl, Arnd Schröter, Helge Parzyjegla, Samuel Kounev, and Jan\nRichling.\nStochastic Analysis of Hierarchical Publish/Subscribe Systems.\nIn Proceedings of the 15th International European Conference on\nParallel and Distributed Computing (Euro-Par 2009), Delft, The Netherlands,\nAugust 25-28, 2009., 2009. Springer Verlag.\n2009, Acceptance Rate (Full Paper): 33%.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{MuScPaKoRi2009-EuroPar-StoAnalPubSub,\nabstract = {With the gradual adoption of publish/subscribe systems in mission critical areas, it is essential that systems are subjected to rigorous performance analysis before they are put into production. However, existing approaches to performance modeling and analysis of publish/subscribe systems suffer from many limitations that seriously constrain their practical applicability. In this paper, we present a generalized method for stochastic analysis of publish/subscribe systems employing identity-based hierarchical routing. The method is based on an analytical model that addresses the major limitations underlying existing work in this area. In particular, it supports arbitrary broker overlay topologies and allows to set workload parameters, e.g., publication rates and subscription lifetimes, individually for each broker. The analysis is illustrated by a running example that helps to gain better understanding of the derived mathematical relationships.},\nauthor = {Gero M{\\\"u}hl and Arnd Schr{\\\"o}ter and Helge Parzyjegla and Samuel Kounev and Jan Richling},\nbooktitle = {Proceedings of the 15th International European Conference on Parallel and Distributed Computing (Euro-Par 2009), Delft, The Netherlands, August 25-28, 2009.},\nnote = {Acceptance Rate (Full Paper): 33%},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/406.pdf},\npublisher = {Springer Verlag},\ntitle = {{Stochastic Analysis of Hierarchical Publish/Subscribe Systems}},\nurl = {http://europar2009.ewi.tudelft.nl/},\nyear = {2009}\n}\n
\n
\nWith the gradual adoption of publish/subscribe systems in mission critical areas, it is essential that systems are subjected to rigorous performance analysis before they are put into production. However, existing approaches to performance modeling and analysis of publish/subscribe systems suffer from many limitations that seriously constrain their practical applicability. In this paper, we present a generalized method for stochastic analysis of publish/subscribe systems employing identity-based hierarchical routing. The method is based on an analytical model that addresses the major limitations underlying existing work in this area. In particular, it supports arbitrary broker overlay topologies and allows to set workload parameters, e.g., publication rates and subscription lifetimes, individually for each broker. The analysis is illustrated by a running example that helps to gain better understanding of the derived mathematical relationships.\n
\n','
\n@inproceedings{MuScPaKoRi2009-EuroPar-StoAnalPubSub,\n  abstract = {With the gradual adoption of publish/subscribe systems in mission critical areas, it is essential that systems are subjected to rigorous performance analysis before they are put into production. However, existing approaches to performance modeling and analysis of publish/subscribe systems suffer from many limitations that seriously constrain their practical applicability. In this paper, we present a generalized method for stochastic analysis of publish/subscribe systems employing identity-based hierarchical routing. The method is based on an analytical model that addresses the major limitations underlying existing work in this area. In particular, it supports arbitrary broker overlay topologies and allows to set workload parameters, e.g., publication rates and subscription lifetimes, individually for each broker. The analysis is illustrated by a running example that helps to gain better understanding of the derived mathematical relationships.},\n  author = {Gero M{\\\"u}hl and Arnd Schr{\\\"o}ter and Helge Parzyjegla and Samuel Kounev and Jan Richling},\n  booktitle = {Proceedings of the 15th International European Conference on Parallel and Distributed Computing (Euro-Par 2009), Delft, The Netherlands, August 25-28, 2009.},\n  note = {Acceptance Rate (Full Paper): 33%},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/406.pdf},\n  publisher = {Springer Verlag},\n  title = {{Stochastic Analysis of Hierarchical Publish/Subscribe Systems}},\n  url = {http://europar2009.ewi.tudelft.nl/},\n  year = {2009}\n}\n
\n\n','With the gradual adoption of publish/subscribe systems in mission critical areas, it is essential that systems are subjected to rigorous performance analysis before they are put into production. However, existing approaches to performance modeling and analysis of publish/subscribe systems suffer from many limitations that seriously constrain their practical applicability. In this paper, we present a generalized method for stochastic analysis of publish/subscribe systems employing identity-based hierarchical routing. The method is based on an analytical model that addresses the major limitations underlying existing work in this area. In particular, it supports arbitrary broker overlay topologies and allows to set workload parameters, e.g., publication rates and subscription lifetimes, individually for each broker. The analysis is illustrated by a running example that helps to gain better understanding of the derived mathematical relationships.','{Stochastic Analysis of Hierarchical Publish/Subscribe Systems}',0,0,2009,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(417,'paper','MaMaStTuNoReRe2014-ICPE-JMSModel','inproceedings','@inproceedings{MaMaStTuNoReRe2014-ICPE-JMSModel,\n author = {Martinec, Tom\\\'{a}c{s} and Marek, Luk\\\'{a}\\c{s} and Steinhauser, Anton\\\'{i}n and T{u}ma, Petr and Noorshams, Qais and Rentschler, Andreas and Reussner, Ralf},\n title = {Constructing Performance Model of JMS Middleware Platform},\n booktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering},\n series = {ICPE \'14},\n year = {2014},\n month = {March},\n isbn = {978-1-4503-2733-6},\n location = {Dublin, Ireland},\n pages = {123--134},\n numpages = {12},\n url = {http://doi.acm.org/10.1145/2568088.2568096},\n doi = {10.1145/2568088.2568096},\n acmid = {2568096},\n publisher = {ACM},\n address = {New York, NY, USA},\n keywords = {JMS, measurement, modeling, performance analysis, software performance},\n}\n\n','\n\nTomács Martinec, Lukás Marek, Antonín Steinhauser, Petr\nTuma, Qais Noorshams, Andreas Rentschler, and Ralf Reussner.\nConstructing performance model of jms middleware platform.\nIn Proceedings of the 5th ACM/SPEC International Conference on\nPerformance Engineering, Dublin, Ireland, March 2014, ICPE \'14, pages\n123-134. ACM, New York, NY, USA.\nMarch 2014.\n[ bib | DOI | http  ] 
\n@inproceedings{MaMaStTuNoReRe2014-ICPE-JMSModel,\nauthor = {Martinec, Tom\\\'{a}c{s} and Marek, Luk\\\'{a}\\c{s} and Steinhauser, Anton\\\'{i}n and T{u}ma, Petr and Noorshams, Qais and Rentschler, Andreas and Reussner, Ralf},\ntitle = {Constructing Performance Model of JMS Middleware Platform},\nbooktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering},\nseries = {ICPE \'14},\nyear = {2014},\nmonth = {March},\nisbn = {978-1-4503-2733-6},\nlocation = {Dublin, Ireland},\npages = {123--134},\nnumpages = {12},\nurl = {http://doi.acm.org/10.1145/2568088.2568096},\ndoi = {10.1145/2568088.2568096},\nacmid = {2568096},\npublisher = {ACM},\naddress = {New York, NY, USA},\nkeywords = {JMS, measurement, modeling, performance analysis, software performance}\n}\n
\n
\n','
\n@inproceedings{MaMaStTuNoReRe2014-ICPE-JMSModel,\n  author = {Martinec, Tom\\\'{a}c{s} and Marek, Luk\\\'{a}\\c{s} and Steinhauser, Anton\\\'{i}n and T{u}ma, Petr and Noorshams, Qais and Rentschler, Andreas and Reussner, Ralf},\n  title = {Constructing Performance Model of JMS Middleware Platform},\n  booktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering},\n  series = {ICPE \'14},\n  year = {2014},\n  month = {March},\n  isbn = {978-1-4503-2733-6},\n  location = {Dublin, Ireland},\n  pages = {123--134},\n  numpages = {12},\n  url = {http://doi.acm.org/10.1145/2568088.2568096},\n  doi = {10.1145/2568088.2568096},\n  acmid = {2568096},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  keywords = {JMS, measurement, modeling, performance analysis, software performance}\n}\n
\n\n',NULL,'Constructing Performance Model of JMS Middleware Platform',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(420,'paper','Meier2010Tra','mastersthesis','@mastersthesis{Meier2010Tra,\n address = {{Karlsruhe, Germany}},\n author = {Philipp Meier},\n note = {FZI Prize \"Best Diploma Thesis\"},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Automated Transformation of Palladio Component Models to Queueing Petri Nets}},\n year = {2010},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/420.pdf},\n}\n\n','\n\nPhilipp Meier.\nAutomated Transformation of Palladio Component Models to Queueing\nPetri Nets.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, 2010.\nFZI Prize \"Best Diploma Thesis\".\n[ bib | .pdf  ] 
\n@mastersthesis{Meier2010Tra,\naddress = {{Karlsruhe, Germany}},\nauthor = {Philipp Meier},\nnote = {FZI Prize \"Best Diploma Thesis\"},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Automated Transformation of Palladio Component Models to Queueing Petri Nets}},\nyear = {2010},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/420.pdf}\n}\n
\n
\n','
\n@mastersthesis{Meier2010Tra,\n  address = {{Karlsruhe, Germany}},\n  author = {Philipp Meier},\n  note = {FZI Prize \"Best Diploma Thesis\"},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Automated Transformation of Palladio Component Models to Queueing Petri Nets}},\n  year = {2010},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/420.pdf}\n}\n
\n\n',NULL,'{Automated Transformation of Palladio Component Models to Queueing Petri Nets}',0,0,2010,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(421,'paper','MeKoKo2011-MASCOTS-PCMtoQPN','inproceedings','@inproceedings{MeKoKo2011-MASCOTS-PCMtoQPN,\n title = {Automated Transformation of Component-based Software Architecture Models to Queueing Petri Nets},\n year = {2011},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/421.pdf},\n booktitle = {19th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2011), Singapore, July 25--27},\n author = {Meier, Philipp and Kounev, Samuel and Koziolek, Heiko},\n}\n\n','\n\nPhilipp Meier, Samuel Kounev, and Heiko Koziolek.\nAutomated transformation of component-based software architecture\nmodels to queueing petri nets.\nIn 19th IEEE/ACM International Symposium on Modeling, Analysis\nand Simulation of Computer and Telecommunication Systems (MASCOTS 2011),\nSingapore, July 25-27, 2011.\n[ bib | .pdf  ] 
\n@inproceedings{MeKoKo2011-MASCOTS-PCMtoQPN,\ntitle = {Automated Transformation of Component-based Software Architecture Models to Queueing Petri Nets},\nyear = {2011},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/421.pdf},\nbooktitle = {19th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2011), Singapore, July 25--27},\nauthor = {Meier, Philipp and Kounev, Samuel and Koziolek, Heiko}\n}\n
\n
\n','
\n@inproceedings{MeKoKo2011-MASCOTS-PCMtoQPN,\n  title = {Automated Transformation of Component-based Software Architecture Models to Queueing Petri Nets},\n  year = {2011},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/421.pdf},\n  booktitle = {19th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2011), Singapore, July 25--27},\n  author = {Meier, Philipp and Kounev, Samuel and Koziolek, Heiko}\n}\n
\n\n',NULL,'Automated Transformation of Component-based Software Architecture Models to Queueing Petri Nets',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(432,'paper','MiIoKoSaRyDiCiRo2013-TechReport-CloudUsagePatterns','techreport','@techreport{MiIoKoSaRyDiCiRo2013-TechReport-CloudUsagePatterns,\n abstract = {{Cloud computing is becoming an increasingly lucrative branch of the existing information and communication technologies (ICT). Enabling a debate about cloud usage scenarios can help with attracting new customers, sharing best-practices, and designing new cloud services. In contrast to previous approaches, which have attempted mainly to formalize the common service delivery models (i.e., Infrastructure-as-a-Service, Platform-as-a-Service, and Software-as-a-Service), in this work, we propose a formalism for describing common cloud usage scenarios referred to as cloud usage patterns. Our formalism takes a structuralist approach allowing decomposition of a cloud usage scenario into elements corresponding to the common cloud service delivery models. Furthermore, our formalism considers several cloud usage patterns that have recently emerged, such as hybrid services and value chains in which mediators are involved, also referred to as value chains with mediators. We propose a simple yet expressive textual and visual language for our formalism, and we show how it can be used in practice for describing a variety of real-world cloud usage scenarios. The scenarios for which we demonstrate our formalism include resource provisioning of global providers of infrastructure and/or platform resources, online social networking services, user-data processing services, online customer and ticketing services, online asset management and banking applications, CRM (Customer Relationship Management) applications, and online social gaming applications.}},\n address = {{7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}},\n author = {Aleksandar Milenkoski and Alexandru Iosup and Samuel Kounev and Kai Sachs and Piotr Rygielski and Jason Ding and Walfredo Cirne and Florian Rosenberg},\n institution = {SPEC Research Group - Cloud Working Group, Standard Performance Evaluation Corporation (SPEC)},\n month = {May},\n url = {http://research.spec.org/fileadmin/user_upload/documents/rg_cloud/endorsed_publications/SPEC-RG-2013-001_CloudUsagePatterns.pdf},\n title = {{Cloud Usage Patterns: A Formalism for Description of Cloud Usage Scenarios}},\n type = {{Technical Report SPEC-RG-2013-001 v.1.0.1}},\n year = {2013},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/432.pdf},\n}\n\n','\n\nAleksandar Milenkoski, Alexandru Iosup, Samuel Kounev, Kai Sachs, Piotr\nRygielski, Jason Ding, Walfredo Cirne, and Florian Rosenberg.\nCloud Usage Patterns: A Formalism for Description of Cloud Usage\nScenarios.\nTechnical Report SPEC-RG-2013-001 v.1.0.1, SPEC Research Group -\nCloud Working Group, Standard Performance Evaluation Corporation (SPEC),\n7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA, May\n2013.\n[ bib | .pdf | .pdf | Abstract  ] 
\n@techreport{MiIoKoSaRyDiCiRo2013-TechReport-CloudUsagePatterns,\nabstract = {{Cloud computing is becoming an increasingly lucrative branch of the existing information and communication technologies (ICT). Enabling a debate about cloud usage scenarios can help with attracting new customers, sharing best-practices, and designing new cloud services. In contrast to previous approaches, which have attempted mainly to formalize the common service delivery models (i.e., Infrastructure-as-a-Service, Platform-as-a-Service, and Software-as-a-Service), in this work, we propose a formalism for describing common cloud usage scenarios referred to as cloud usage patterns. Our formalism takes a structuralist approach allowing decomposition of a cloud usage scenario into elements corresponding to the common cloud service delivery models. Furthermore, our formalism considers several cloud usage patterns that have recently emerged, such as hybrid services and value chains in which mediators are involved, also referred to as value chains with mediators. We propose a simple yet expressive textual and visual language for our formalism, and we show how it can be used in practice for describing a variety of real-world cloud usage scenarios. The scenarios for which we demonstrate our formalism include resource provisioning of global providers of infrastructure and/or platform resources, online social networking services, user-data processing services, online customer and ticketing services, online asset management and banking applications, CRM (Customer Relationship Management) applications, and online social gaming applications.}},\naddress = {{7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}},\nauthor = {Aleksandar Milenkoski and Alexandru Iosup and Samuel Kounev and Kai Sachs and Piotr Rygielski and Jason Ding and Walfredo Cirne and Florian Rosenberg},\ninstitution = {SPEC Research Group - Cloud Working Group, Standard Performance Evaluation Corporation (SPEC)},\nmonth = {May},\nurl = {http://research.spec.org/fileadmin/user_upload/documents/rg_cloud/endorsed_publications/SPEC-RG-2013-001_CloudUsagePatterns.pdf},\ntitle = {{Cloud Usage Patterns: A Formalism for Description of Cloud Usage Scenarios}},\ntype = {{Technical Report SPEC-RG-2013-001 v.1.0.1}},\nyear = {2013},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/432.pdf}\n}\n
\n
\nCloud computing is becoming an increasingly lucrative branch of the existing information and communication technologies (ICT). Enabling a debate about cloud usage scenarios can help with attracting new customers, sharing best-practices, and designing new cloud services. In contrast to previous approaches, which have attempted mainly to formalize the common service delivery models (i.e., Infrastructure-as-a-Service, Platform-as-a-Service, and Software-as-a-Service), in this work, we propose a formalism for describing common cloud usage scenarios referred to as cloud usage patterns. Our formalism takes a structuralist approach allowing decomposition of a cloud usage scenario into elements corresponding to the common cloud service delivery models. Furthermore, our formalism considers several cloud usage patterns that have recently emerged, such as hybrid services and value chains in which mediators are involved, also referred to as value chains with mediators. We propose a simple yet expressive textual and visual language for our formalism, and we show how it can be used in practice for describing a variety of real-world cloud usage scenarios. The scenarios for which we demonstrate our formalism include resource provisioning of global providers of infrastructure and/or platform resources, online social networking services, user-data processing services, online customer and ticketing services, online asset management and banking applications, CRM (Customer Relationship Management) applications, and online social gaming applications.\n
\n','
\n@techreport{MiIoKoSaRyDiCiRo2013-TechReport-CloudUsagePatterns,\n  abstract = {{Cloud computing is becoming an increasingly lucrative branch of the existing information and communication technologies (ICT). Enabling a debate about cloud usage scenarios can help with attracting new customers, sharing best-practices, and designing new cloud services. In contrast to previous approaches, which have attempted mainly to formalize the common service delivery models (i.e., Infrastructure-as-a-Service, Platform-as-a-Service, and Software-as-a-Service), in this work, we propose a formalism for describing common cloud usage scenarios referred to as cloud usage patterns. Our formalism takes a structuralist approach allowing decomposition of a cloud usage scenario into elements corresponding to the common cloud service delivery models. Furthermore, our formalism considers several cloud usage patterns that have recently emerged, such as hybrid services and value chains in which mediators are involved, also referred to as value chains with mediators. We propose a simple yet expressive textual and visual language for our formalism, and we show how it can be used in practice for describing a variety of real-world cloud usage scenarios. The scenarios for which we demonstrate our formalism include resource provisioning of global providers of infrastructure and/or platform resources, online social networking services, user-data processing services, online customer and ticketing services, online asset management and banking applications, CRM (Customer Relationship Management) applications, and online social gaming applications.}},\n  address = {{7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}},\n  author = {Aleksandar Milenkoski and Alexandru Iosup and Samuel Kounev and Kai Sachs and Piotr Rygielski and Jason Ding and Walfredo Cirne and Florian Rosenberg},\n  institution = {SPEC Research Group - Cloud Working Group, Standard Performance Evaluation Corporation (SPEC)},\n  month = {May},\n  url = {http://research.spec.org/fileadmin/user_upload/documents/rg_cloud/endorsed_publications/SPEC-RG-2013-001_CloudUsagePatterns.pdf},\n  title = {{Cloud Usage Patterns: A Formalism for Description of Cloud Usage Scenarios}},\n  type = {{Technical Report SPEC-RG-2013-001 v.1.0.1}},\n  year = {2013},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/432.pdf}\n}\n
\n\n','{Cloud computing is becoming an increasingly lucrative branch of the existing information and communication technologies (ICT). Enabling a debate about cloud usage scenarios can help with attracting new customers, sharing best-practices, and designing new cloud services. In contrast to previous approaches, which have attempted mainly to formalize the common service delivery models (i.e., Infrastructure-as-a-Service, Platform-as-a-Service, and Software-as-a-Service), in this work, we propose a formalism for describing common cloud usage scenarios referred to as cloud usage patterns. Our formalism takes a structuralist approach allowing decomposition of a cloud usage scenario into elements corresponding to the common cloud service delivery models. Furthermore, our formalism considers several cloud usage patterns that have recently emerged, such as hybrid services and value chains in which mediators are involved, also referred to as value chains with mediators. We propose a simple yet expressive textual and visual language for our formalism, and we show how it can be used in practice for describing a variety of real-world cloud usage scenarios. The scenarios for which we demonstrate our formalism include resource provisioning of global providers of infrastructure and/or platform resources, online social networking services, user-data processing services, online customer and ticketing services, online asset management and banking applications, CRM (Customer Relationship Management) applications, and online social gaming applications.}','{Cloud Usage Patterns: A Formalism for Description of Cloud Usage Scenarios}',0,5,2013,5,NULL,NULL,'Cloud','0000-00-00 00:00:00','2016-06-01 09:40:58',0),(433,'paper','MiKoAvAnVi2013-TechReport-OnBenchmarkingIDSes','techreport','@techreport{MiKoAvAnVi2013-TechReport-OnBenchmarkingIDSes,\n abstract = {{Modern intrusion detection systems (IDSes) for virtualized environments are deployed in the virtualization layer with components inside the virtual machine monitor (VMM) and the trusted host virtual machine (VM). Such IDSes can monitor at the same time the network and host activities of all guest VMs running on top of a VMM being isolated from malicious users of these VMs. We refer to IDSes for virtualized environments as VMM-based IDSes. In this work, we analyze state-of-the-art intrusion detection techniques applied in virtualized environments and architectures of VMM-based IDSes. Further, we identify challenges that apply specifically to benchmarking VMM-based IDSes focussing on workloads and metrics. For example, we discuss the challenge of defining representative baseline benign workload profiles as well as the challenge of defining malicious workloads containing attacks targeted at the VMM. We also discuss the impact of on-demand resource provisioning features of virtualized environments (e.g., CPU and memory hotplugging, memory ballooning) on IDS benchmarking measures such as capacity and attack detection accuracy. Finally, we outline future research directions in the area of benchmarking VMM-based IDSes and of intrusion detection in virtualized environments in general.}},\n address = {{7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}},\n author = {Aleksandar Milenkoski and Samuel Kounev and Alberto Avritzer and Nuno Antunes and Marco Vieira},\n institution = {SPEC Research Group - IDS Benchmarking Working Group, Standard Performance Evaluation Corporation (SPEC)},\n month = {June},\n pdf = {http://research.spec.org/fileadmin/user_upload/documents/wg_ids/endorsed_publications/SPEC-RG-2013-002-BenchmarkingVMMBIDSes.pdf},\n title = {{On Benchmarking Intrusion Detection Systems in Virtualized Environments}},\n type = {{Technical Report SPEC-RG-2013-002 v.1.0}},\n year = {2013},\n}\n\n','\n\nAleksandar Milenkoski, Samuel Kounev, Alberto Avritzer, Nuno Antunes, and Marco\nVieira.\nOn Benchmarking Intrusion Detection Systems in Virtualized\nEnvironments.\nTechnical Report SPEC-RG-2013-002 v.1.0, SPEC Research Group - IDS\nBenchmarking Working Group, Standard Performance Evaluation Corporation\n(SPEC), 7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA,\nJune 2013.\n[ bib | .pdf | Abstract  ] 
\n@techreport{MiKoAvAnVi2013-TechReport-OnBenchmarkingIDSes,\nabstract = {{Modern intrusion detection systems (IDSes) for virtualized environments are deployed in the virtualization layer with components inside the virtual machine monitor (VMM) and the trusted host virtual machine (VM). Such IDSes can monitor at the same time the network and host activities of all guest VMs running on top of a VMM being isolated from malicious users of these VMs. We refer to IDSes for virtualized environments as VMM-based IDSes. In this work, we analyze state-of-the-art intrusion detection techniques applied in virtualized environments and architectures of VMM-based IDSes. Further, we identify challenges that apply specifically to benchmarking VMM-based IDSes focussing on workloads and metrics. For example, we discuss the challenge of defining representative baseline benign workload profiles as well as the challenge of defining malicious workloads containing attacks targeted at the VMM. We also discuss the impact of on-demand resource provisioning features of virtualized environments (e.g., CPU and memory hotplugging, memory ballooning) on IDS benchmarking measures such as capacity and attack detection accuracy. Finally, we outline future research directions in the area of benchmarking VMM-based IDSes and of intrusion detection in virtualized environments in general.}},\naddress = {{7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}},\nauthor = {Aleksandar Milenkoski and Samuel Kounev and Alberto Avritzer and Nuno Antunes and Marco Vieira},\ninstitution = {SPEC Research Group - IDS Benchmarking Working Group, Standard Performance Evaluation Corporation (SPEC)},\nmonth = {June},\npdf = {http://research.spec.org/fileadmin/user_upload/documents/wg_ids/endorsed_publications/SPEC-RG-2013-002-BenchmarkingVMMBIDSes.pdf},\ntitle = {{On Benchmarking Intrusion Detection Systems in Virtualized Environments}},\ntype = {{Technical Report SPEC-RG-2013-002 v.1.0}},\nyear = {2013}\n}\n
\n
\nModern intrusion detection systems (IDSes) for virtualized environments are deployed in the virtualization layer with components inside the virtual machine monitor (VMM) and the trusted host virtual machine (VM). Such IDSes can monitor at the same time the network and host activities of all guest VMs running on top of a VMM being isolated from malicious users of these VMs. We refer to IDSes for virtualized environments as VMM-based IDSes. In this work, we analyze state-of-the-art intrusion detection techniques applied in virtualized environments and architectures of VMM-based IDSes. Further, we identify challenges that apply specifically to benchmarking VMM-based IDSes focussing on workloads and metrics. For example, we discuss the challenge of defining representative baseline benign workload profiles as well as the challenge of defining malicious workloads containing attacks targeted at the VMM. We also discuss the impact of on-demand resource provisioning features of virtualized environments (e.g., CPU and memory hotplugging, memory ballooning) on IDS benchmarking measures such as capacity and attack detection accuracy. Finally, we outline future research directions in the area of benchmarking VMM-based IDSes and of intrusion detection in virtualized environments in general.\n
\n','
\n@techreport{MiKoAvAnVi2013-TechReport-OnBenchmarkingIDSes,\n  abstract = {{Modern intrusion detection systems (IDSes) for virtualized environments are deployed in the virtualization layer with components inside the virtual machine monitor (VMM) and the trusted host virtual machine (VM). Such IDSes can monitor at the same time the network and host activities of all guest VMs running on top of a VMM being isolated from malicious users of these VMs. We refer to IDSes for virtualized environments as VMM-based IDSes. In this work, we analyze state-of-the-art intrusion detection techniques applied in virtualized environments and architectures of VMM-based IDSes. Further, we identify challenges that apply specifically to benchmarking VMM-based IDSes focussing on workloads and metrics. For example, we discuss the challenge of defining representative baseline benign workload profiles as well as the challenge of defining malicious workloads containing attacks targeted at the VMM. We also discuss the impact of on-demand resource provisioning features of virtualized environments (e.g., CPU and memory hotplugging, memory ballooning) on IDS benchmarking measures such as capacity and attack detection accuracy. Finally, we outline future research directions in the area of benchmarking VMM-based IDSes and of intrusion detection in virtualized environments in general.}},\n  address = {{7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}},\n  author = {Aleksandar Milenkoski and Samuel Kounev and Alberto Avritzer and Nuno Antunes and Marco Vieira},\n  institution = {SPEC Research Group - IDS Benchmarking Working Group, Standard Performance Evaluation Corporation (SPEC)},\n  month = {June},\n  pdf = {http://research.spec.org/fileadmin/user_upload/documents/wg_ids/endorsed_publications/SPEC-RG-2013-002-BenchmarkingVMMBIDSes.pdf},\n  title = {{On Benchmarking Intrusion Detection Systems in Virtualized Environments}},\n  type = {{Technical Report SPEC-RG-2013-002 v.1.0}},\n  year = {2013}\n}\n
\n\n','{Modern intrusion detection systems (IDSes) for virtualized environments are deployed in the virtualization layer with components inside the virtual machine monitor (VMM) and the trusted host virtual machine (VM). Such IDSes can monitor at the same time the network and host activities of all guest VMs running on top of a VMM being isolated from malicious users of these VMs. We refer to IDSes for virtualized environments as VMM-based IDSes. In this work, we analyze state-of-the-art intrusion detection techniques applied in virtualized environments and architectures of VMM-based IDSes. Further, we identify challenges that apply specifically to benchmarking VMM-based IDSes focussing on workloads and metrics. For example, we discuss the challenge of defining representative baseline benign workload profiles as well as the challenge of defining malicious workloads containing attacks targeted at the VMM. We also discuss the impact of on-demand resource provisioning features of virtualized environments (e.g., CPU and memory hotplugging, memory ballooning) on IDS benchmarking measures such as capacity and attack detection accuracy. Finally, we outline future research directions in the area of benchmarking VMM-based IDSes and of intrusion detection in virtualized environments in general.}','{On Benchmarking Intrusion Detection Systems in Virtualized Environments}',0,6,2013,6,NULL,NULL,'Intrusion detection; Virtual machine introspection','0000-00-00 00:00:00','2016-06-01 09:40:58',0),(434,'paper','MiKo2011-ICITST-TowardsBenchmarking','inproceedings','@inproceedings{MiKo2011-ICITST-TowardsBenchmarking,\n abstract = {{Many recent research works propose novel architectures of intrusion detection systems specifically designed to operate in virtualized environments. However, little attention has been given to the evaluation and benchmarking of such architectures with respect to their performance and dependability. In this paper, we present a research roadmap towards developing a framework for benchmarking intrusion detection systems for cloud environments in a scientifically rigorous and a representative manner.}},\n address = {New York, USA},\n author = {Aleksandar Milenkoski and Samuel Kounev},\n booktitle = {Proceedings of the 7th International Conference for Internet Technology and Secured Transactions (ICITST 2012)},\n location = {London, United Kingdom},\n month = {December},\n pages = {562--563},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/434.pdf},\n publisher = {IEEE},\n title = {{Towards Benchmarking Intrusion Detection Systems for Virtualized Cloud Environments}},\n titleaddon = {{(Work-in-Progress Paper)}},\n url = {http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6470873},\n year = {2012},\n}\n\n','\n\nAleksandar Milenkoski and Samuel Kounev.\nTowards Benchmarking Intrusion Detection Systems for Virtualized\nCloud Environments (Work-in-Progress Paper).\nIn Proceedings of the 7th International Conference for Internet\nTechnology and Secured Transactions (ICITST 2012), London, United Kingdom,\nDecember 2012, pages 562-563. IEEE, New York, USA.\nDecember 2012.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{MiKo2011-ICITST-TowardsBenchmarking,\nabstract = {{Many recent research works propose novel architectures of intrusion detection systems specifically designed to operate in virtualized environments. However, little attention has been given to the evaluation and benchmarking of such architectures with respect to their performance and dependability. In this paper, we present a research roadmap towards developing a framework for benchmarking intrusion detection systems for cloud environments in a scientifically rigorous and a representative manner.}},\naddress = {New York, USA},\nauthor = {Aleksandar Milenkoski and Samuel Kounev},\nbooktitle = {Proceedings of the 7th International Conference for Internet Technology and Secured Transactions (ICITST 2012)},\nlocation = {London, United Kingdom},\nmonth = {December},\npages = {562--563},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/434.pdf},\npublisher = {IEEE},\ntitle = {{Towards Benchmarking Intrusion Detection Systems for Virtualized Cloud Environments}},\ntitleaddon = {{(Work-in-Progress Paper)}},\nurl = {http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6470873},\nyear = {2012}\n}\n
\n
\nMany recent research works propose novel architectures of intrusion detection systems specifically designed to operate in virtualized environments. However, little attention has been given to the evaluation and benchmarking of such architectures with respect to their performance and dependability. In this paper, we present a research roadmap towards developing a framework for benchmarking intrusion detection systems for cloud environments in a scientifically rigorous and a representative manner.\n
\n','
\n@inproceedings{MiKo2011-ICITST-TowardsBenchmarking,\n  abstract = {{Many recent research works propose novel architectures of intrusion detection systems specifically designed to operate in virtualized environments. However, little attention has been given to the evaluation and benchmarking of such architectures with respect to their performance and dependability. In this paper, we present a research roadmap towards developing a framework for benchmarking intrusion detection systems for cloud environments in a scientifically rigorous and a representative manner.}},\n  address = {New York, USA},\n  author = {Aleksandar Milenkoski and Samuel Kounev},\n  booktitle = {Proceedings of the 7th International Conference for Internet Technology and Secured Transactions (ICITST 2012)},\n  location = {London, United Kingdom},\n  month = {December},\n  pages = {562--563},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/434.pdf},\n  publisher = {IEEE},\n  title = {{Towards Benchmarking Intrusion Detection Systems for Virtualized Cloud Environments}},\n  titleaddon = {{(Work-in-Progress Paper)}},\n  url = {http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6470873},\n  year = {2012}\n}\n
\n\n','{Many recent research works propose novel architectures of intrusion detection systems specifically designed to operate in virtualized environments. However, little attention has been given to the evaluation and benchmarking of such architectures with respect to their performance and dependability. In this paper, we present a research roadmap towards developing a framework for benchmarking intrusion detection systems for cloud environments in a scientifically rigorous and a representative manner.}','{Towards Benchmarking Intrusion Detection Systems for Virtualized Cloud Environments}',0,12,2012,12,NULL,NULL,'Intrusion detection; Virtual machine introspection','0000-00-00 00:00:00','2016-06-01 09:40:58',0),(435,'paper','MiPaAnViKo2013-ACSAC-HInjector','inproceedings','@inproceedings{MiPaAnViKo2013-ACSAC-HInjector,\n address = {Maryland, USA},\n author = {Aleksandar Milenkoski and Bryan D. Payne and Nuno Antunes and Marco Vieira and Samuel Kounev},\n booktitle = {The 2013 Annual Computer Security Applications Conference (ACSAC 2013)},\n publisher = {{Applied Computer Security Associates (ACSA)}},\n location = {New Orleans, Louisiana, USA},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/435.pdf},\n title = {{HInjector: Injecting Hypercall Attacks for Evaluating VMI-based Intrusion Detection Systems}},\n titleaddon = {{(Poster Paper)}},\n year = {2013},\n month = {March},\n}\n\n','\n\nAleksandar Milenkoski, Bryan D. Payne, Nuno Antunes, Marco Vieira, and Samuel\nKounev.\nHInjector: Injecting Hypercall Attacks for Evaluating VMI-based\nIntrusion Detection Systems (Poster Paper).\nIn The 2013 Annual Computer Security Applications Conference\n(ACSAC 2013), New Orleans, Louisiana, USA, March 2013. Applied Computer\nSecurity Associates (ACSA), Maryland, USA.\nMarch 2013.\n[ bib | .pdf  ] 
\n@inproceedings{MiPaAnViKo2013-ACSAC-HInjector,\naddress = {Maryland, USA},\nauthor = {Aleksandar Milenkoski and Bryan D. Payne and Nuno Antunes and Marco Vieira and Samuel Kounev},\nbooktitle = {The 2013 Annual Computer Security Applications Conference (ACSAC 2013)},\npublisher = {{Applied Computer Security Associates (ACSA)}},\nlocation = {New Orleans, Louisiana, USA},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/435.pdf},\ntitle = {{HInjector: Injecting Hypercall Attacks for Evaluating VMI-based Intrusion Detection Systems}},\ntitleaddon = {{(Poster Paper)}},\nyear = {2013},\nmonth = {March}\n}\n
\n
\n','
\n@inproceedings{MiPaAnViKo2013-ACSAC-HInjector,\n  address = {Maryland, USA},\n  author = {Aleksandar Milenkoski and Bryan D. Payne and Nuno Antunes and Marco Vieira and Samuel Kounev},\n  booktitle = {The 2013 Annual Computer Security Applications Conference (ACSAC 2013)},\n  publisher = {{Applied Computer Security Associates (ACSA)}},\n  location = {New Orleans, Louisiana, USA},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/435.pdf},\n  title = {{HInjector: Injecting Hypercall Attacks for Evaluating VMI-based Intrusion Detection Systems}},\n  titleaddon = {{(Poster Paper)}},\n  year = {2013},\n  month = {March}\n}\n
\n\n',NULL,'{HInjector: Injecting Hypercall Attacks for Evaluating VMI-based Intrusion Detection Systems}',0,3,2013,3,NULL,NULL,'Intrusion detection; Virtual machine introspection','0000-00-00 00:00:00','2016-06-01 09:40:58',0),(436,'paper','MoBaVe2012-EUROSYS','inproceedings','@inproceedings{MoBaVe2012-EUROSYS,\n author = {Mohammadi, Seyed Vahid and Bauer, Markus and Verdejo, Adrian Juan},\n booktitle = {Proceedings of the 6th EuroSys Doctoral Workshop (EuroDW 2012)},\n location = {Bern, Switzerland},\n title = {Dynamic Cloud Reconfiguration to Meet QoS Requirements},\n year = {2012},\n}\n\n','\n\nSeyed Vahid Mohammadi, Markus Bauer, and Adrian Juan Verdejo.\nDynamic cloud reconfiguration to meet qos requirements.\nIn Proceedings of the 6th EuroSys Doctoral Workshop (EuroDW\n2012), Bern, Switzerland, 2012.\n[ bib  ] 
\n@inproceedings{MoBaVe2012-EUROSYS,\nauthor = {Mohammadi, Seyed Vahid and Bauer, Markus and Verdejo, Adrian Juan},\nbooktitle = {Proceedings of the 6th EuroSys Doctoral Workshop (EuroDW 2012)},\nlocation = {Bern, Switzerland},\ntitle = {Dynamic Cloud Reconfiguration to Meet QoS Requirements},\nyear = {2012}\n}\n
\n
\n','
\n@inproceedings{MoBaVe2012-EUROSYS,\n  author = {Mohammadi, Seyed Vahid and Bauer, Markus and Verdejo, Adrian Juan},\n  booktitle = {Proceedings of the 6th EuroSys Doctoral Workshop (EuroDW 2012)},\n  location = {Bern, Switzerland},\n  title = {Dynamic Cloud Reconfiguration to Meet QoS Requirements},\n  year = {2012}\n}\n
\n\n',NULL,'Dynamic Cloud Reconfiguration to Meet QoS Requirements',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(440,'paper','MoKr2011-esosym-qualitative-discussion','inproceedings','@inproceedings{MoKr2011-esosym-qualitative-discussion,\n address = {Bonn-Buschdorf, Germany},\n author = {Momm, Christof and Krebs, Rouven},\n booktitle = {Proceedings of the Software Engineering 2011 -- Workshopband (ESoSyM-2011)},\n day = {21},\n editor = {Reussner, Ralf and Pretschner, Alexander amd J{\\\"a}hnichen, Stefan},\n isbn = {978-3-88579-278-9},\n location = {Karlsruhe, Germany},\n month = {February},\n organization = {Fachgruppe OOSE der Gesellschaft f{\\\"u}r Informatik und ihrer Arbeitskreise},\n pages = {139--150},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/440.pdf},\n publisher = {Bonner K\\\"ollen Verlag},\n title = {{A} {Q}ualitative {D}iscussion of {D}ifferent {A}pproaches for {I}mplementing {M}ulti-{T}enant {S}aa{S} {O}fferings},\n titleaddon = {{(Short Paper)}},\n year = {2011},\n}\n\n','\n\nChristof Momm and Rouven Krebs.\nA Qualitative Discussion of Different Approaches for\nImplementing Multi-Tenant SaaS Offerings (Short Paper).\nIn Proceedings of the Software Engineering 2011 - Workshopband\n(ESoSyM-2011), Ralf Reussner and Stefan Pretschner, Alexander\namd Jähnichen, editors, Karlsruhe, Germany, February 21, 2011, pages\n139-150. Fachgruppe OOSE der Gesellschaft für Informatik und ihrer\nArbeitskreise, Bonner Köllen Verlag, Bonn-Buschdorf, Germany.\nFebruary 2011.\n[ bib | .pdf  ] 
\n@inproceedings{MoKr2011-esosym-qualitative-discussion,\naddress = {Bonn-Buschdorf, Germany},\nauthor = {Momm, Christof and Krebs, Rouven},\nbooktitle = {Proceedings of the Software Engineering 2011 -- Workshopband (ESoSyM-2011)},\nday = {21},\neditor = {Reussner, Ralf and Pretschner, Alexander amd J{\\\"a}hnichen, Stefan},\nisbn = {978-3-88579-278-9},\nlocation = {Karlsruhe, Germany},\nmonth = {February},\norganization = {Fachgruppe OOSE der Gesellschaft f{\\\"u}r Informatik und ihrer Arbeitskreise},\npages = {139--150},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/440.pdf},\npublisher = {Bonner K\\\"ollen Verlag},\ntitle = {{A} {Q}ualitative {D}iscussion of {D}ifferent {A}pproaches for {I}mplementing {M}ulti-{T}enant {S}aa{S} {O}fferings},\ntitleaddon = {{(Short Paper)}},\nyear = {2011}\n}\n
\n
\n','
\n@inproceedings{MoKr2011-esosym-qualitative-discussion,\n  address = {Bonn-Buschdorf, Germany},\n  author = {Momm, Christof and Krebs, Rouven},\n  booktitle = {Proceedings of the Software Engineering 2011 -- Workshopband (ESoSyM-2011)},\n  day = {21},\n  editor = {Reussner, Ralf and Pretschner, Alexander amd J{\\\"a}hnichen, Stefan},\n  isbn = {978-3-88579-278-9},\n  location = {Karlsruhe, Germany},\n  month = {February},\n  organization = {Fachgruppe OOSE der Gesellschaft f{\\\"u}r Informatik und ihrer Arbeitskreise},\n  pages = {139--150},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/440.pdf},\n  publisher = {Bonner K\\\"ollen Verlag},\n  title = {{A} {Q}ualitative {D}iscussion of {D}ifferent {A}pproaches for {I}mplementing {M}ulti-{T}enant {S}aa{S} {O}fferings},\n  titleaddon = {{(Short Paper)}},\n  year = {2011}\n}\n
\n\n',NULL,'{A} {Q}ualitative {D}iscussion of {D}ifferent {A}pproaches for {I}mplementing {M}ulti-{T}enant {S}aa{S} {O}fferings',0,2,2011,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(442,'paper','momm2007a','inproceedings','@inproceedings{momm2007a,\n abstract = {The management of web service composition, where the employed atomic web services as well as the compositions themselves are offered on basis of Service Level Agreements (SLA), implies new requirements for the management infrastructure. In this paper we introduce the conceptual design and implementation for a standard-based and flexible manageability infrastructure offering comprehensive management information for an SLAdriven management of web service compositions. Our solution thereby is based on well-understood methodologies and standards from the area of application and web service management, in particular the WBEM standards.},\n address = {Stuttgart, Germany},\n author = {Momm, Christof and Mayerl, Christian and Rathfelder, Christoph and Abeck, Sebastian},\n booktitle = {Proceedings of the 14th Annual Workshop of HP Software University Association},\n day = {8--11},\n editor = {Hegering, H. -G. and Reiser, H. and Schiffers, M. and Nebe, Th.},\n location = {Leibniz Computing Center and Munich Network Management Team, Germany},\n month = {July},\n pages = {103--114},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/442.pdf},\n publisher = {Infonomies Consulting},\n title = {{A} {M}anageability {I}nfrastructure for the {M}onitoring of {W}eb {S}ervice},\n year = {2007},\n}\n\n','\n\nChristof Momm, Christian Mayerl, Christoph Rathfelder, and Sebastian Abeck.\nA Manageability Infrastructure for the Monitoring of Web\nService.\nIn Proceedings of the 14th Annual Workshop of HP Software\nUniversity Association, H. G. Hegering, H. Reiser, M. Schiffers, and Th.\nNebe, editors, Leibniz Computing Center and Munich Network Management Team,\nGermany, July 8-11, 2007, pages 103-114. Infonomies Consulting, Stuttgart,\nGermany.\nJuly 2007.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{momm2007a,\nabstract = {The management of web service composition, where the employed atomic web services as well as the compositions themselves are offered on basis of Service Level Agreements (SLA), implies new requirements for the management infrastructure. In this paper we introduce the conceptual design and implementation for a standard-based and flexible manageability infrastructure offering comprehensive management information for an SLAdriven management of web service compositions. Our solution thereby is based on well-understood methodologies and standards from the area of application and web service management, in particular the WBEM standards.},\naddress = {Stuttgart, Germany},\nauthor = {Momm, Christof and Mayerl, Christian and Rathfelder, Christoph and Abeck, Sebastian},\nbooktitle = {Proceedings of the 14th Annual Workshop of HP Software University Association},\nday = {8--11},\neditor = {Hegering, H. -G. and Reiser, H. and Schiffers, M. and Nebe, Th.},\nlocation = {Leibniz Computing Center and Munich Network Management Team, Germany},\nmonth = {July},\npages = {103--114},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/442.pdf},\npublisher = {Infonomies Consulting},\ntitle = {{A} {M}anageability {I}nfrastructure for the {M}onitoring of {W}eb {S}ervice},\nyear = {2007}\n}\n
\n
\nThe management of web service composition, where the employed atomic web services as well as the compositions themselves are offered on basis of Service Level Agreements (SLA), implies new requirements for the management infrastructure. In this paper we introduce the conceptual design and implementation for a standard-based and flexible manageability infrastructure offering comprehensive management information for an SLAdriven management of web service compositions. Our solution thereby is based on well-understood methodologies and standards from the area of application and web service management, in particular the WBEM standards.\n
\n','
\n@inproceedings{momm2007a,\n  abstract = {The management of web service composition, where the employed atomic web services as well as the compositions themselves are offered on basis of Service Level Agreements (SLA), implies new requirements for the management infrastructure. In this paper we introduce the conceptual design and implementation for a standard-based and flexible manageability infrastructure offering comprehensive management information for an SLAdriven management of web service compositions. Our solution thereby is based on well-understood methodologies and standards from the area of application and web service management, in particular the WBEM standards.},\n  address = {Stuttgart, Germany},\n  author = {Momm, Christof and Mayerl, Christian and Rathfelder, Christoph and Abeck, Sebastian},\n  booktitle = {Proceedings of the 14th Annual Workshop of HP Software University Association},\n  day = {8--11},\n  editor = {Hegering, H. -G. and Reiser, H. and Schiffers, M. and Nebe, Th.},\n  location = {Leibniz Computing Center and Munich Network Management Team, Germany},\n  month = {July},\n  pages = {103--114},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/442.pdf},\n  publisher = {Infonomies Consulting},\n  title = {{A} {M}anageability {I}nfrastructure for the {M}onitoring of {W}eb {S}ervice},\n  year = {2007}\n}\n
\n\n','The management of web service composition, where the employed atomic web services as well as the compositions themselves are offered on basis of Service Level Agreements (SLA), implies new requirements for the management infrastructure. In this paper we introduce the conceptual design and implementation for a standard-based and flexible manageability infrastructure offering comprehensive management information for an SLAdriven management of web service compositions. Our solution thereby is based on well-understood methodologies and standards from the area of application and web service management, in particular the WBEM standards.','{A} {M}anageability {I}nfrastructure for the {M}onitoring of {W}eb {S}ervice',0,7,2007,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(443,'paper','momm2008b','inproceedings','@inproceedings{momm2008b,\n abstract = {Web service compositions (WSC), as part of a service-oriented architecture (SOA), have to be managed to ensure compliance with guaranteed service levels. In this context, a high degree of automation is desired, which can be achieved by applying autonomic computing concepts. This paper particularly focuses the autonomic management of semi-dynamic compositions. Here, for each included service several variants are available that differ with regard to the service level they offer. Given this scenario, we first show how to instrument WSC in order to allow a controlling of the service level through switching the employed service variant. Second, we show how the desired self-manageability can be designed and implemented by means of a WSC manageability infrastructure. The presented approach is based on widely accepted methodologies and standards from the area of application and web service management, in particular the WBEM standards.},\n address = {Berlin, Germany},\n author = {Christof Momm and Christoph Rathfelder},\n booktitle = {MDD, SOA und IT-Management (MSI 2008)},\n day = {24},\n editor = {Ulrike Steffens and Jan Stefan Addicks and Niels Streekmann},\n location = {Oldenburg, Germany},\n month = {September},\n pages = {25--40},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/443.pdf},\n publisher = {GITO-Verlag},\n title = {{M}odel-based {M}anagement of {W}eb {S}ervice {C}ompositions in {S}ervice-{O}riented {A}rchitectures},\n year = {2008},\n}\n\n','\n\nChristof Momm and Christoph Rathfelder.\nModel-based Management of Web Service Compositions in\nService-Oriented Architectures.\nIn MDD, SOA und IT-Management (MSI 2008), Ulrike Steffens,\nJan Stefan Addicks, and Niels Streekmann, editors, Oldenburg, Germany,\nSeptember 24, 2008, pages 25-40. GITO-Verlag, Berlin, Germany.\nSeptember 2008.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{momm2008b,\nabstract = {Web service compositions (WSC), as part of a service-oriented architecture (SOA), have to be managed to ensure compliance with guaranteed service levels. In this context, a high degree of automation is desired, which can be achieved by applying autonomic computing concepts. This paper particularly focuses the autonomic management of semi-dynamic compositions. Here, for each included service several variants are available that differ with regard to the service level they offer. Given this scenario, we first show how to instrument WSC in order to allow a controlling of the service level through switching the employed service variant. Second, we show how the desired self-manageability can be designed and implemented by means of a WSC manageability infrastructure. The presented approach is based on widely accepted methodologies and standards from the area of application and web service management, in particular the WBEM standards.},\naddress = {Berlin, Germany},\nauthor = {Christof Momm and Christoph Rathfelder},\nbooktitle = {MDD, SOA und IT-Management (MSI 2008)},\nday = {24},\neditor = {Ulrike Steffens and Jan Stefan Addicks and Niels Streekmann},\nlocation = {Oldenburg, Germany},\nmonth = {September},\npages = {25--40},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/443.pdf},\npublisher = {GITO-Verlag},\ntitle = {{M}odel-based {M}anagement of {W}eb {S}ervice {C}ompositions in {S}ervice-{O}riented {A}rchitectures},\nyear = {2008}\n}\n
\n
\nWeb service compositions (WSC), as part of a service-oriented architecture (SOA), have to be managed to ensure compliance with guaranteed service levels. In this context, a high degree of automation is desired, which can be achieved by applying autonomic computing concepts. This paper particularly focuses the autonomic management of semi-dynamic compositions. Here, for each included service several variants are available that differ with regard to the service level they offer. Given this scenario, we first show how to instrument WSC in order to allow a controlling of the service level through switching the employed service variant. Second, we show how the desired self-manageability can be designed and implemented by means of a WSC manageability infrastructure. The presented approach is based on widely accepted methodologies and standards from the area of application and web service management, in particular the WBEM standards.\n
\n','
\n@inproceedings{momm2008b,\n  abstract = {Web service compositions (WSC), as part of a service-oriented architecture (SOA), have to be managed to ensure compliance with guaranteed service levels. In this context, a high degree of automation is desired, which can be achieved by applying autonomic computing concepts. This paper particularly focuses the autonomic management of semi-dynamic compositions. Here, for each included service several variants are available that differ with regard to the service level they offer. Given this scenario, we first show how to instrument WSC in order to allow a controlling of the service level through switching the employed service variant. Second, we show how the desired self-manageability can be designed and implemented by means of a WSC manageability infrastructure. The presented approach is based on widely accepted methodologies and standards from the area of application and web service management, in particular the WBEM standards.},\n  address = {Berlin, Germany},\n  author = {Christof Momm and Christoph Rathfelder},\n  booktitle = {MDD, SOA und IT-Management (MSI 2008)},\n  day = {24},\n  editor = {Ulrike Steffens and Jan Stefan Addicks and Niels Streekmann},\n  location = {Oldenburg, Germany},\n  month = {September},\n  pages = {25--40},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/443.pdf},\n  publisher = {GITO-Verlag},\n  title = {{M}odel-based {M}anagement of {W}eb {S}ervice {C}ompositions in {S}ervice-{O}riented {A}rchitectures},\n  year = {2008}\n}\n
\n\n','Web service compositions (WSC), as part of a service-oriented architecture (SOA), have to be managed to ensure compliance with guaranteed service levels. In this context, a high degree of automation is desired, which can be achieved by applying autonomic computing concepts. This paper particularly focuses the autonomic management of semi-dynamic compositions. Here, for each included service several variants are available that differ with regard to the service level they offer. Given this scenario, we first show how to instrument WSC in order to allow a controlling of the service level through switching the employed service variant. Second, we show how the desired self-manageability can be designed and implemented by means of a WSC manageability infrastructure. The presented approach is based on widely accepted methodologies and standards from the area of application and web service management, in particular the WBEM standards.','{M}odel-based {M}anagement of {W}eb {S}ervice {C}ompositions in {S}ervice-{O}riented {A}rchitectures',0,9,2008,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(444,'paper','momm2006a','techreport','@techreport{momm2006a,\n abstract = {The management of process-oriented service composition within a dynamic environment, where the employed core services are offered on service marketplaces and dynamically included into the composition on basis of Service Level Agreements (SLA), demands for a service management application that takes into account the specifics of processoriented compositions and supports their automated provisioning. As a first step towards such an application, in this paper we introduce the conceptual design for an architecture and implementation of an interoperable and flexible manageability infrastructure offering comprehensive monitoring and control functionality for the management of service compositions. To achieve this, our approach is based on well-understood methodologies and standards from the area of application and web service management.},\n author = {Momm, Christof and Rathfelder, Christoph and Abeck, Sebastian},\n institution = {Cooperation {&} Management},\n location = {Karlsruhe, Germany},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/444.pdf},\n title = {{T}owards a {M}anageability {I}nfrastructure for a {M}anagement of {P}rocess-{B}ased {S}ervice {C}ompositions},\n type = {C{&}M Research Report},\n year = {2006},\n}\n\n','\n\nChristof Momm, Christoph Rathfelder, and Sebastian Abeck.\nTowards a Manageability Infrastructure for a Management of\nProcess-Based Service Compositions.\nC&m research report, Cooperation & Management, 2006.\n[ bib | .pdf | Abstract  ] 
\n@techreport{momm2006a,\nabstract = {The management of process-oriented service composition within a dynamic environment, where the employed core services are offered on service marketplaces and dynamically included into the composition on basis of Service Level Agreements (SLA), demands for a service management application that takes into account the specifics of processoriented compositions and supports their automated provisioning. As a first step towards such an application, in this paper we introduce the conceptual design for an architecture and implementation of an interoperable and flexible manageability infrastructure offering comprehensive monitoring and control functionality for the management of service compositions. To achieve this, our approach is based on well-understood methodologies and standards from the area of application and web service management.},\nauthor = {Momm, Christof and Rathfelder, Christoph and Abeck, Sebastian},\ninstitution = {Cooperation {&} Management},\nlocation = {Karlsruhe, Germany},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/444.pdf},\ntitle = {{T}owards a {M}anageability {I}nfrastructure for a {M}anagement of {P}rocess-{B}ased {S}ervice {C}ompositions},\ntype = {C{&}M Research Report},\nyear = {2006}\n}\n
\n
\nThe management of process-oriented service composition within a dynamic environment, where the employed core services are offered on service marketplaces and dynamically included into the composition on basis of Service Level Agreements (SLA), demands for a service management application that takes into account the specifics of processoriented compositions and supports their automated provisioning. As a first step towards such an application, in this paper we introduce the conceptual design for an architecture and implementation of an interoperable and flexible manageability infrastructure offering comprehensive monitoring and control functionality for the management of service compositions. To achieve this, our approach is based on well-understood methodologies and standards from the area of application and web service management.\n
\n','
\n@techreport{momm2006a,\n  abstract = {The management of process-oriented service composition within a dynamic environment, where the employed core services are offered on service marketplaces and dynamically included into the composition on basis of Service Level Agreements (SLA), demands for a service management application that takes into account the specifics of processoriented compositions and supports their automated provisioning. As a first step towards such an application, in this paper we introduce the conceptual design for an architecture and implementation of an interoperable and flexible manageability infrastructure offering comprehensive monitoring and control functionality for the management of service compositions. To achieve this, our approach is based on well-understood methodologies and standards from the area of application and web service management.},\n  author = {Momm, Christof and Rathfelder, Christoph and Abeck, Sebastian},\n  institution = {Cooperation {&} Management},\n  location = {Karlsruhe, Germany},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/444.pdf},\n  title = {{T}owards a {M}anageability {I}nfrastructure for a {M}anagement of {P}rocess-{B}ased {S}ervice {C}ompositions},\n  type = {C{&}M Research Report},\n  year = {2006}\n}\n
\n\n','The management of process-oriented service composition within a dynamic environment, where the employed core services are offered on service marketplaces and dynamically included into the composition on basis of Service Level Agreements (SLA), demands for a service management application that takes into account the specifics of processoriented compositions and supports their automated provisioning. As a first step towards such an application, in this paper we introduce the conceptual design for an architecture and implementation of an interoperable and flexible manageability infrastructure offering comprehensive monitoring and control functionality for the management of service compositions. To achieve this, our approach is based on well-understood methodologies and standards from the area of application and web service management.','{T}owards a {M}anageability {I}nfrastructure for a {M}anagement of {P}rocess-{B}ased {S}ervice {C}ompositions',0,0,2006,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(445,'paper','momm2008a','inproceedings','@inproceedings{momm2008a,\n abstract = {Web service compositions (WSC), as part of a service- oriented architecture (SOA), have to be managed to ensure compliance with guaranteed service levels. In this context, a high degree of automation is desired, which can be achieved by applying autonomic computing concepts. This paper particularly focuses the autonomic management of semi-dynamic compositions. Here, for each included service several variants are available that differ with regard to the service level they offer. Given this scenario, we first show how to instrument WSC in order to allow a controlling of the service level through switching the employed service variant. Second, we show how the desired self-manageability can be designed and implemented by means of a WSC manageability infrastructure. The presented approach is based on widely accepted methodologies and standards from the area of application and web service management, in particular the WBEM standards.},\n author = {Momm, Christof and Rathfelder, Christoph and Hallerbach, Ignacio P{\\\'\'e}rez and Abeck, Sebastian},\n booktitle = {Proceedings of the Network Operations and Management Symposium (NOMS 2008)},\n day = {7--11},\n doi = {10.1109/NOMS.2008.4575227},\n issn = {1542-1201},\n location = {Salvador, Bahia, Brazil},\n month = {April},\n pages = {839--842},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/445.pdf},\n publisher = {IEEE},\n title = {{M}anageability {D}esign for an {A}utonomic {M}anagement of {S}emi-{D}ynamic {W}eb {S}ervice {C}ompositions},\n year = {2008},\n}\n\n','\n\nChristof Momm, Christoph Rathfelder, Ignacio P
”erez Hallerbach, and\nSebastian Abeck.\nManageability Design for an Autonomic Management of\nSemi-Dynamic Web Service Compositions.\nIn Proceedings of the Network Operations and Management\nSymposium (NOMS 2008), Salvador, Bahia, Brazil, April 7-11, 2008, pages\n839-842. IEEE.\nApril 2008.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{momm2008a,\nabstract = {Web service compositions (WSC), as part of a service- oriented architecture (SOA), have to be managed to ensure compliance with guaranteed service levels. In this context, a high degree of automation is desired, which can be achieved by applying autonomic computing concepts. This paper particularly focuses the autonomic management of semi-dynamic compositions. Here, for each included service several variants are available that differ with regard to the service level they offer. Given this scenario, we first show how to instrument WSC in order to allow a controlling of the service level through switching the employed service variant. Second, we show how the desired self-manageability can be designed and implemented by means of a WSC manageability infrastructure. The presented approach is based on widely accepted methodologies and standards from the area of application and web service management, in particular the WBEM standards.},\nauthor = {Momm, Christof and Rathfelder, Christoph and Hallerbach, Ignacio P{\\\\\'\'e}rez and Abeck, Sebastian},\nbooktitle = {Proceedings of the Network Operations and Management Symposium (NOMS 2008)},\nday = {7--11},\ndoi = {10.1109/NOMS.2008.4575227},\nissn = {1542-1201},\nlocation = {Salvador, Bahia, Brazil},\nmonth = {April},\npages = {839--842},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/445.pdf},\npublisher = {IEEE},\ntitle = {{M}anageability {D}esign for an {A}utonomic {M}anagement of {S}emi-{D}ynamic {W}eb {S}ervice {C}ompositions},\nyear = {2008}\n}\n
\n
\nWeb service compositions (WSC), as part of a service- oriented architecture (SOA), have to be managed to ensure compliance with guaranteed service levels. In this context, a high degree of automation is desired, which can be achieved by applying autonomic computing concepts. This paper particularly focuses the autonomic management of semi-dynamic compositions. Here, for each included service several variants are available that differ with regard to the service level they offer. Given this scenario, we first show how to instrument WSC in order to allow a controlling of the service level through switching the employed service variant. Second, we show how the desired self-manageability can be designed and implemented by means of a WSC manageability infrastructure. The presented approach is based on widely accepted methodologies and standards from the area of application and web service management, in particular the WBEM standards.\n
\n','
\n@inproceedings{momm2008a,\n  abstract = {Web service compositions (WSC), as part of a service- oriented architecture (SOA), have to be managed to ensure compliance with guaranteed service levels. In this context, a high degree of automation is desired, which can be achieved by applying autonomic computing concepts. This paper particularly focuses the autonomic management of semi-dynamic compositions. Here, for each included service several variants are available that differ with regard to the service level they offer. Given this scenario, we first show how to instrument WSC in order to allow a controlling of the service level through switching the employed service variant. Second, we show how the desired self-manageability can be designed and implemented by means of a WSC manageability infrastructure. The presented approach is based on widely accepted methodologies and standards from the area of application and web service management, in particular the WBEM standards.},\n  author = {Momm, Christof and Rathfelder, Christoph and Hallerbach, Ignacio P{\\\\\'\'e}rez and Abeck, Sebastian},\n  booktitle = {Proceedings of the Network Operations and Management Symposium (NOMS 2008)},\n  day = {7--11},\n  doi = {10.1109/NOMS.2008.4575227},\n  issn = {1542-1201},\n  location = {Salvador, Bahia, Brazil},\n  month = {April},\n  pages = {839--842},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/445.pdf},\n  publisher = {IEEE},\n  title = {{M}anageability {D}esign for an {A}utonomic {M}anagement of {S}emi-{D}ynamic {W}eb {S}ervice {C}ompositions},\n  year = {2008}\n}\n
\n\n','Web service compositions (WSC), as part of a service- oriented architecture (SOA), have to be managed to ensure compliance with guaranteed service levels. In this context, a high degree of automation is desired, which can be achieved by applying autonomic computing concepts. This paper particularly focuses the autonomic management of semi-dynamic compositions. Here, for each included service several variants are available that differ with regard to the service level they offer. Given this scenario, we first show how to instrument WSC in order to allow a controlling of the service level through switching the employed service variant. Second, we show how the desired self-manageability can be designed and implemented by means of a WSC manageability infrastructure. The presented approach is based on widely accepted methodologies and standards from the area of application and web service management, in particular the WBEM standards.','{M}anageability {D}esign for an {A}utonomic {M}anagement of {S}emi-{D}ynamic {W}eb {S}ervice {C}ompositions',0,4,2008,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(447,'paper','NeKoMi1999-JCI-VideoConf','article','@article{NeKoMi1999-JCI-VideoConf,\n author = {Plamen Nenov and Samuel Kounev and Dimiter Mihailov},\n issn = {1201-851},\n journal = {Journal of Computing and Information},\n title = {{Distributed Video-Conferencing System Organized for Work on the Internet with the use of Multimedia Server}},\n year = {1999},\n}\n\n','\n\nPlamen Nenov, Samuel Kounev, and Dimiter Mihailov.\nDistributed Video-Conferencing System Organized for Work on the\nInternet with the use of Multimedia Server.\nJournal of Computing and Information, 1999.\n[ bib  ] 
\n@article{NeKoMi1999-JCI-VideoConf,\nauthor = {Plamen Nenov and Samuel Kounev and Dimiter Mihailov},\nissn = {1201-851},\njournal = {Journal of Computing and Information},\ntitle = {{Distributed Video-Conferencing System Organized for Work on the Internet with the use of Multimedia Server}},\nyear = {1999}\n}\n
\n
\n','
\n@article{NeKoMi1999-JCI-VideoConf,\n  author = {Plamen Nenov and Samuel Kounev and Dimiter Mihailov},\n  issn = {1201-851},\n  journal = {Journal of Computing and Information},\n  title = {{Distributed Video-Conferencing System Organized for Work on the Internet with the use of Multimedia Server}},\n  year = {1999}\n}\n
\n\n',NULL,'{Distributed Video-Conferencing System Organized for Work on the Internet with the use of Multimedia Server}',0,0,1999,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(449,'paper','NoBuKoRe2015-ICPE-InvitedDemo','inproceedings','@inproceedings{NoBuKoRe2015-ICPE-InvitedDemo,\n author = {Qais Noorshams and Axel Busch and Samuel Kounev and Ralf Reussner},\n title = {{The Storage Performance Analyzer: Measuring, Monitoring, and Modeling of I/O Performance in Virtualized Environments}},\n booktitle = {Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering},\n series = {ICPE \'15},\n location = {Austin, Texas, USA},\n year = {2015},\n month = {February},\n titleaddon = {{(Demo Paper)}},\n url = {http://dx.doi.org/10.1145/2668930.2693845},\n doi = {10.1145/2668930.2693845},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/449.pdf},\n}\n\n','\n\nQais Noorshams, Axel Busch, Samuel Kounev, and Ralf Reussner.\nThe Storage Performance Analyzer: Measuring, Monitoring, and\nModeling of I/O Performance in Virtualized Environments (Demo Paper).\nIn Proceedings of the 6th ACM/SPEC International Conference on\nPerformance Engineering, Austin, Texas, USA, February 2015, ICPE \'15.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{NoBuKoRe2015-ICPE-InvitedDemo,\nauthor = {Qais Noorshams and Axel Busch and Samuel Kounev and Ralf Reussner},\ntitle = {{The Storage Performance Analyzer: Measuring, Monitoring, and Modeling of I/O Performance in Virtualized Environments}},\nbooktitle = {Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering},\nseries = {ICPE \'15},\nlocation = {Austin, Texas, USA},\nyear = {2015},\nmonth = {February},\ntitleaddon = {{(Demo Paper)}},\nurl = {http://dx.doi.org/10.1145/2668930.2693845},\ndoi = {10.1145/2668930.2693845},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/449.pdf}\n}\n
\n
\n','
\n@inproceedings{NoBuKoRe2015-ICPE-InvitedDemo,\n  author = {Qais Noorshams and Axel Busch and Samuel Kounev and Ralf Reussner},\n  title = {{The Storage Performance Analyzer: Measuring, Monitoring, and Modeling of I/O Performance in Virtualized Environments}},\n  booktitle = {Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering},\n  series = {ICPE \'15},\n  location = {Austin, Texas, USA},\n  year = {2015},\n  month = {February},\n  titleaddon = {{(Demo Paper)}},\n  url = {http://dx.doi.org/10.1145/2668930.2693845},\n  doi = {10.1145/2668930.2693845},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/449.pdf}\n}\n
\n\n',NULL,'{The Storage Performance Analyzer: Measuring, Monitoring, and Modeling of I/O Performance in Virtualized Environments}',0,2,2015,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(450,'paper','NoReReKoRe2014-CBSE-ArchitectureModelsWithStatisticalModels','inproceedings','@inproceedings{NoReReKoRe2014-CBSE-ArchitectureModelsWithStatisticalModels,\n author = {Noorshams, Qais and Reeb, Roland and Rentschler, Andreas and Kounev, Samuel and Reussner, Ralf},\n title = {Enriching Software Architecture Models with Statistical Models for Performance Prediction in Modern Storage Environments},\n booktitle = {Proceedings of the 17th International ACM Sigsoft Symposium on Component-based Software Engineering},\n series = {CBSE \'14},\n year = {2014},\n month = {June},\n isbn = {978-1-4503-2577-6},\n location = {Marcq-en-Bareul, France},\n pages = {45--54},\n numpages = {10},\n url = {http://doi.acm.org/10.1145/2602458.2602475},\n doi = {10.1145/2602458.2602475},\n acmid = {2602475},\n publisher = {ACM},\n address = {New York, NY, USA},\n keywords = {i/o, performance, prediction, software architecture, statistical model, storage},\n note = {Acceptance Rate (Full Paper): 14/62 = 23\\%.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/450.pdf},\n}\n\n','\n\nQais Noorshams, Roland Reeb, Andreas Rentschler, Samuel Kounev, and Ralf\nReussner.\nEnriching software architecture models with statistical models for\nperformance prediction in modern storage environments.\nIn Proceedings of the 17th International ACM Sigsoft Symposium\non Component-based Software Engineering, Marcq-en-Bareul, France, June 2014,\nCBSE \'14, pages 45-54. ACM, New York, NY, USA.\nJune 2014, Acceptance Rate (Full Paper): 14/62 = 23%.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{NoReReKoRe2014-CBSE-ArchitectureModelsWithStatisticalModels,\nauthor = {Noorshams, Qais and Reeb, Roland and Rentschler, Andreas and Kounev, Samuel and Reussner, Ralf},\ntitle = {Enriching Software Architecture Models with Statistical Models for Performance Prediction in Modern Storage Environments},\nbooktitle = {Proceedings of the 17th International ACM Sigsoft Symposium on Component-based Software Engineering},\nseries = {CBSE \'14},\nyear = {2014},\nmonth = {June},\nisbn = {978-1-4503-2577-6},\nlocation = {Marcq-en-Bareul, France},\npages = {45--54},\nnumpages = {10},\nurl = {http://doi.acm.org/10.1145/2602458.2602475},\ndoi = {10.1145/2602458.2602475},\nacmid = {2602475},\npublisher = {ACM},\naddress = {New York, NY, USA},\nkeywords = {i/o, performance, prediction, software architecture, statistical model, storage},\nnote = {Acceptance Rate (Full Paper): 14/62 = 23\\%.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/450.pdf}\n}\n
\n
\n','
\n@inproceedings{NoReReKoRe2014-CBSE-ArchitectureModelsWithStatisticalModels,\n  author = {Noorshams, Qais and Reeb, Roland and Rentschler, Andreas and Kounev, Samuel and Reussner, Ralf},\n  title = {Enriching Software Architecture Models with Statistical Models for Performance Prediction in Modern Storage Environments},\n  booktitle = {Proceedings of the 17th International ACM Sigsoft Symposium on Component-based Software Engineering},\n  series = {CBSE \'14},\n  year = {2014},\n  month = {June},\n  isbn = {978-1-4503-2577-6},\n  location = {Marcq-en-Bareul, France},\n  pages = {45--54},\n  numpages = {10},\n  url = {http://doi.acm.org/10.1145/2602458.2602475},\n  doi = {10.1145/2602458.2602475},\n  acmid = {2602475},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  keywords = {i/o, performance, prediction, software architecture, statistical model, storage},\n  note = {Acceptance Rate (Full Paper): 14/62 = 23\\%.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/450.pdf}\n}\n
\n\n',NULL,'Enriching Software Architecture Models with Statistical Models for Performance Prediction in Modern Storage Environments',0,6,2014,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(451,'paper','NoBuReBrKoTuRe2014-DCPerf-IORegressionModels','inproceedings','@inproceedings{NoBuReBrKoTuRe2014-DCPerf-IORegressionModels,\n author = {Qais Noorshams and Axel Busch and Andreas Rentschler and Dominik Bruhn and Samuel Kounev and Petr T{u}ma and Ralf Reussner},\n booktitle = {34th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2014 Workshops). 4th International Workshop on Data Center Performance, DCPerf \'14},\n location = {Madrid, Spain},\n title = {{Automated Modeling of I/O Performance and Interference Effects in Virtualized Storage Systems}},\n year = {2014},\n month = {July},\n pages = {88-93},\n doi = {10.1109/ICDCSW.2014.26},\n url = {http://dx.doi.org/10.1109/ICDCSW.2014.26},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/451.pdf},\n}\n\n','\n\nQais Noorshams, Axel Busch, Andreas Rentschler, Dominik Bruhn, Samuel Kounev,\nPetr Tuma, and Ralf Reussner.\nAutomated Modeling of I/O Performance and Interference Effects in\nVirtualized Storage Systems.\nIn 34th IEEE International Conference on Distributed Computing\nSystems Workshops (ICDCS 2014 Workshops). 4th International Workshop on Data\nCenter Performance, DCPerf \'14, Madrid, Spain, July 2014, pages 88-93.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{NoBuReBrKoTuRe2014-DCPerf-IORegressionModels,\nauthor = {Qais Noorshams and Axel Busch and Andreas Rentschler and Dominik Bruhn and Samuel Kounev and Petr T{u}ma and Ralf Reussner},\nbooktitle = {34th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2014 Workshops). 4th International Workshop on Data Center Performance, DCPerf \'14},\nlocation = {Madrid, Spain},\ntitle = {{Automated Modeling of I/O Performance and Interference Effects in Virtualized Storage Systems}},\nyear = {2014},\nmonth = {July},\npages = {88-93},\ndoi = {10.1109/ICDCSW.2014.26},\nurl = {http://dx.doi.org/10.1109/ICDCSW.2014.26},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/451.pdf}\n}\n
\n
\n','
\n@inproceedings{NoBuReBrKoTuRe2014-DCPerf-IORegressionModels,\n  author = {Qais Noorshams and Axel Busch and Andreas Rentschler and Dominik Bruhn and Samuel Kounev and Petr T{u}ma and Ralf Reussner},\n  booktitle = {34th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2014 Workshops). 4th International Workshop on Data Center Performance, DCPerf \'14},\n  location = {Madrid, Spain},\n  title = {{Automated Modeling of I/O Performance and Interference Effects in Virtualized Storage Systems}},\n  year = {2014},\n  month = {July},\n  pages = {88-93},\n  doi = {10.1109/ICDCSW.2014.26},\n  url = {http://dx.doi.org/10.1109/ICDCSW.2014.26},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/451.pdf}\n}\n
\n\n',NULL,'{Automated Modeling of I/O Performance and Interference Effects in Virtualized Storage Systems}',0,7,2014,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(452,'paper','NoRoKoTuRe2013-MASCOTS-IOQNs','inproceedings','@inproceedings{NoRoKoTuRe2013-MASCOTS-IOQNs,\n author = {Qais Noorshams and Kiana Rostami and Samuel Kounev and Petr T{u}ma and Ralf Reussner},\n booktitle = {Proceedings of the 21st IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2013)},\n series = {MASCOTS\'13},\n date = {August 14--16},\n location = {San Francisco, USA},\n note = {Acceptance Rate (Full Paper): 44/163 = 27\\%},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/452.pdf},\n title = {{I/O Performance Modeling of Virtualized Storage Systems}},\n pages = {121-130},\n doi = {10.1109/MASCOTS.2013.20},\n url = {http://dx.doi.org/10.1109/MASCOTS.2013.20},\n year = {2013},\n}\n\n','\n\nQais Noorshams, Kiana Rostami, Samuel Kounev, Petr Tuma, and Ralf Reussner.\nI/O Performance Modeling of Virtualized Storage Systems.\nIn Proceedings of the 21st IEEE International Symposium on\nModeling, Analysis and Simulation of Computer and Telecommunication Systems\n(MASCOTS 2013), San Francisco, USA, 2013, MASCOTS\'13, pages 121-130.\nAcceptance Rate (Full Paper): 44/163 = 27%.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{NoRoKoTuRe2013-MASCOTS-IOQNs,\nauthor = {Qais Noorshams and Kiana Rostami and Samuel Kounev and Petr T{u}ma and Ralf Reussner},\nbooktitle = {Proceedings of the 21st IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2013)},\nseries = {MASCOTS\'13},\ndate = {August 14--16},\nlocation = {San Francisco, USA},\nnote = {Acceptance Rate (Full Paper): 44/163 = 27\\%},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/452.pdf},\ntitle = {{I/O Performance Modeling of Virtualized Storage Systems}},\npages = {121-130},\ndoi = {10.1109/MASCOTS.2013.20},\nurl = {http://dx.doi.org/10.1109/MASCOTS.2013.20},\nyear = {2013}\n}\n
\n
\n','
\n@inproceedings{NoRoKoTuRe2013-MASCOTS-IOQNs,\n  author = {Qais Noorshams and Kiana Rostami and Samuel Kounev and Petr T{u}ma and Ralf Reussner},\n  booktitle = {Proceedings of the 21st IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2013)},\n  series = {MASCOTS\'13},\n  date = {August 14--16},\n  location = {San Francisco, USA},\n  note = {Acceptance Rate (Full Paper): 44/163 = 27\\%},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/452.pdf},\n  title = {{I/O Performance Modeling of Virtualized Storage Systems}},\n  pages = {121-130},\n  doi = {10.1109/MASCOTS.2013.20},\n  url = {http://dx.doi.org/10.1109/MASCOTS.2013.20},\n  year = {2013}\n}\n
\n\n',NULL,'{I/O Performance Modeling of Virtualized Storage Systems}',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(453,'paper','NoBrKoRe2013-ICPE-IORegressionModels','inproceedings','@inproceedings{NoBrKoRe2013-ICPE-IORegressionModels,\n acmid = {2479910},\n address = {New York, NY, USA},\n author = {Noorshams, Qais and Bruhn, Dominik and Kounev, Samuel and Reussner, Ralf},\n booktitle = {Proceedings of the ACM/SPEC International Conference on Performance Engineering (ICPE 2013)},\n doi = {10.1145/2479871.2479910},\n isbn = {978-1-4503-1636-1},\n keywords = {i/o, performance, prediction, storage, virtualization},\n location = {Prague, Czech Republic},\n numpages = {12},\n pages = {283--294},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/453.pdf},\n publisher = {ACM},\n series = {ICPE\'13},\n title = {{Predictive Performance Modeling of Virtualized Storage Systems using Optimized Statistical Regression Techniques}},\n url = {http://doi.acm.org/10.1145/2479871.2479910},\n year = {2013},\n}\n\n','\n\nQais Noorshams, Dominik Bruhn, Samuel Kounev, and Ralf Reussner.\nPredictive Performance Modeling of Virtualized Storage Systems using\nOptimized Statistical Regression Techniques.\nIn Proceedings of the ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2013), Prague, Czech Republic, 2013, ICPE\'13,\npages 283-294. ACM, New York, NY, USA.\n2013.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{NoBrKoRe2013-ICPE-IORegressionModels,\nacmid = {2479910},\naddress = {New York, NY, USA},\nauthor = {Noorshams, Qais and Bruhn, Dominik and Kounev, Samuel and Reussner, Ralf},\nbooktitle = {Proceedings of the ACM/SPEC International Conference on Performance Engineering (ICPE 2013)},\ndoi = {10.1145/2479871.2479910},\nisbn = {978-1-4503-1636-1},\nkeywords = {i/o, performance, prediction, storage, virtualization},\nlocation = {Prague, Czech Republic},\nnumpages = {12},\npages = {283--294},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/453.pdf},\npublisher = {ACM},\nseries = {ICPE\'13},\ntitle = {{Predictive Performance Modeling of Virtualized Storage Systems using Optimized Statistical Regression Techniques}},\nurl = {http://doi.acm.org/10.1145/2479871.2479910},\nyear = {2013}\n}\n
\n
\n','
\n@inproceedings{NoBrKoRe2013-ICPE-IORegressionModels,\n  acmid = {2479910},\n  address = {New York, NY, USA},\n  author = {Noorshams, Qais and Bruhn, Dominik and Kounev, Samuel and Reussner, Ralf},\n  booktitle = {Proceedings of the ACM/SPEC International Conference on Performance Engineering (ICPE 2013)},\n  doi = {10.1145/2479871.2479910},\n  isbn = {978-1-4503-1636-1},\n  keywords = {i/o, performance, prediction, storage, virtualization},\n  location = {Prague, Czech Republic},\n  numpages = {12},\n  pages = {283--294},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/453.pdf},\n  publisher = {ACM},\n  series = {ICPE\'13},\n  title = {{Predictive Performance Modeling of Virtualized Storage Systems using Optimized Statistical Regression Techniques}},\n  url = {http://doi.acm.org/10.1145/2479871.2479910},\n  year = {2013}\n}\n
\n\n',NULL,'{Predictive Performance Modeling of Virtualized Storage Systems using Optimized Statistical Regression Techniques}',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(454,'paper','NoReKoRe2013-ICPE-WIP','inproceedings','@inproceedings{NoReKoRe2013-ICPE-WIP,\n acmid = {2479921},\n address = {New York, NY, USA},\n author = {Noorshams, Qais and Rentschler, Andreas and Kounev, Samuel and Reussner, Ralf},\n booktitle = {Proceedings of the ACM/SPEC International Conference on Performance Engineering},\n doi = {10.1145/2479871.2479921},\n isbn = {978-1-4503-1636-1},\n keywords = {i/o, performance, storage, virtualization},\n location = {Prague, Czech Republic},\n numpages = {4},\n pages = {339--342},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/454.pdf},\n publisher = {ACM},\n series = {ICPE \'13},\n title = {{A Generic Approach for Architecture-level Performance Modeling and Prediction of Virtualized Storage Systems}},\n url = {http://doi.acm.org/10.1145/2479871.2479921},\n year = {2013},\n}\n\n','\n\nQais Noorshams, Andreas Rentschler, Samuel Kounev, and Ralf Reussner.\nA Generic Approach for Architecture-level Performance Modeling and\nPrediction of Virtualized Storage Systems.\nIn Proceedings of the ACM/SPEC International Conference on\nPerformance Engineering, Prague, Czech Republic, 2013, ICPE \'13, pages\n339-342. ACM, New York, NY, USA.\n2013.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{NoReKoRe2013-ICPE-WIP,\nacmid = {2479921},\naddress = {New York, NY, USA},\nauthor = {Noorshams, Qais and Rentschler, Andreas and Kounev, Samuel and Reussner, Ralf},\nbooktitle = {Proceedings of the ACM/SPEC International Conference on Performance Engineering},\ndoi = {10.1145/2479871.2479921},\nisbn = {978-1-4503-1636-1},\nkeywords = {i/o, performance, storage, virtualization},\nlocation = {Prague, Czech Republic},\nnumpages = {4},\npages = {339--342},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/454.pdf},\npublisher = {ACM},\nseries = {ICPE \'13},\ntitle = {{A Generic Approach for Architecture-level Performance Modeling and Prediction of Virtualized Storage Systems}},\nurl = {http://doi.acm.org/10.1145/2479871.2479921},\nyear = {2013}\n}\n
\n
\n','
\n@inproceedings{NoReKoRe2013-ICPE-WIP,\n  acmid = {2479921},\n  address = {New York, NY, USA},\n  author = {Noorshams, Qais and Rentschler, Andreas and Kounev, Samuel and Reussner, Ralf},\n  booktitle = {Proceedings of the ACM/SPEC International Conference on Performance Engineering},\n  doi = {10.1145/2479871.2479921},\n  isbn = {978-1-4503-1636-1},\n  keywords = {i/o, performance, storage, virtualization},\n  location = {Prague, Czech Republic},\n  numpages = {4},\n  pages = {339--342},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/454.pdf},\n  publisher = {ACM},\n  series = {ICPE \'13},\n  title = {{A Generic Approach for Architecture-level Performance Modeling and Prediction of Virtualized Storage Systems}},\n  url = {http://doi.acm.org/10.1145/2479871.2479921},\n  year = {2013}\n}\n
\n\n',NULL,'{A Generic Approach for Architecture-level Performance Modeling and Prediction of Virtualized Storage Systems}',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(455,'paper','NoKoRe2012-EPEW-Experiments','incollection','@incollection{NoKoRe2012-EPEW-Experiments,\n author = {Noorshams, Qais and Kounev, Samuel and Reussner, Ralf},\n booktitle = {Computer Performance Engineering. 9th European Performance Engineering Workshop (EPEW 2012), Munich, Germany, July 30, 2012, and 28th UK Performance Engineering Workshop (UKPEW 2012), Edinburgh, UK, July 2, 2012, Revised Selected Papers},\n doi = {10.1007/978-3-642-36781-6_5},\n editor = {Tribastone, Mirco and Gilmore, Stephen},\n isbn = {978-3-642-36780-9},\n keywords = {I/O; Storage; Performance; Virtualization},\n pages = {63-79},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/455.pdf},\n publisher = {Springer Berlin Heidelberg},\n series = {Lecture Notes in Computer Science (LNCS)},\n title = {{Experimental Evaluation of the Performance-Influencing Factors of Virtualized Storage Systems}},\n url = {http://dx.doi.org/10.1007/978-3-642-36781-6_5},\n volume = {7587},\n year = {2013},\n month = {July},\n}\n\n','\n\nQais Noorshams, Samuel Kounev, and Ralf Reussner.\nExperimental Evaluation of the Performance-Influencing Factors of\nVirtualized Storage Systems.\nIn Computer Performance Engineering. 9th European Performance\nEngineering Workshop (EPEW 2012), Munich, Germany, July 30, 2012, and 28th UK\nPerformance Engineering Workshop (UKPEW 2012), Edinburgh, UK, July 2, 2012,\nRevised Selected Papers, Mirco Tribastone and Stephen Gilmore, editors,\nvolume 7587 of Lecture Notes in Computer Science (LNCS), pages 63-79.\nSpringer Berlin Heidelberg, July 2013.\n[ bib | DOI | http | .pdf  ] 
\n@incollection{NoKoRe2012-EPEW-Experiments,\nauthor = {Noorshams, Qais and Kounev, Samuel and Reussner, Ralf},\nbooktitle = {Computer Performance Engineering. 9th European Performance Engineering Workshop (EPEW 2012), Munich, Germany, July 30, 2012, and 28th UK Performance Engineering Workshop (UKPEW 2012), Edinburgh, UK, July 2, 2012, Revised Selected Papers},\ndoi = {10.1007/978-3-642-36781-6_5},\neditor = {Tribastone, Mirco and Gilmore, Stephen},\nisbn = {978-3-642-36780-9},\nkeywords = {I/O; Storage; Performance; Virtualization},\npages = {63-79},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/455.pdf},\npublisher = {Springer Berlin Heidelberg},\nseries = {Lecture Notes in Computer Science (LNCS)},\ntitle = {{Experimental Evaluation of the Performance-Influencing Factors of Virtualized Storage Systems}},\nurl = {http://dx.doi.org/10.1007/978-3-642-36781-6_5},\nvolume = {7587},\nyear = {2013},\nmonth = {July}\n}\n
\n
\n','
\n@incollection{NoKoRe2012-EPEW-Experiments,\n  author = {Noorshams, Qais and Kounev, Samuel and Reussner, Ralf},\n  booktitle = {Computer Performance Engineering. 9th European Performance Engineering Workshop (EPEW 2012), Munich, Germany, July 30, 2012, and 28th UK Performance Engineering Workshop (UKPEW 2012), Edinburgh, UK, July 2, 2012, Revised Selected Papers},\n  doi = {10.1007/978-3-642-36781-6_5},\n  editor = {Tribastone, Mirco and Gilmore, Stephen},\n  isbn = {978-3-642-36780-9},\n  keywords = {I/O; Storage; Performance; Virtualization},\n  pages = {63-79},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/455.pdf},\n  publisher = {Springer Berlin Heidelberg},\n  series = {Lecture Notes in Computer Science (LNCS)},\n  title = {{Experimental Evaluation of the Performance-Influencing Factors of Virtualized Storage Systems}},\n  url = {http://dx.doi.org/10.1007/978-3-642-36781-6_5},\n  volume = {7587},\n  year = {2013},\n  month = {July}\n}\n
\n\n',NULL,'{Experimental Evaluation of the Performance-Influencing Factors of Virtualized Storage Systems}',0,7,2013,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(456,'paper','No2010-Masterthesis-Optimization','mastersthesis','@mastersthesis{No2010-Masterthesis-Optimization,\n address = {Karlsruhe, Germany},\n author = {Qais Noorshams},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/456.pdf},\n school = {Karlsruhe Institute of Technology},\n title = {Focusing the Optimization of Software Architecture Models Using Non-Functional Requirements},\n year = {2010},\n}\n\n','\n\nQais Noorshams.\nFocusing the optimization of software architecture models using\nnon-functional requirements.\nMaster\'s thesis, Karlsruhe Institute of Technology, Karlsruhe,\nGermany, 2010.\n[ bib | .pdf  ] 
\n@mastersthesis{No2010-Masterthesis-Optimization,\naddress = {Karlsruhe, Germany},\nauthor = {Qais Noorshams},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/456.pdf},\nschool = {Karlsruhe Institute of Technology},\ntitle = {Focusing the Optimization of Software Architecture Models Using Non-Functional Requirements},\nyear = {2010}\n}\n
\n
\n','
\n@mastersthesis{No2010-Masterthesis-Optimization,\n  address = {Karlsruhe, Germany},\n  author = {Qais Noorshams},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/456.pdf},\n  school = {Karlsruhe Institute of Technology},\n  title = {Focusing the Optimization of Software Architecture Models Using Non-Functional Requirements},\n  year = {2010}\n}\n
\n\n',NULL,'Focusing the Optimization of Software Architecture Models Using Non-Functional Requirements',0,0,2010,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(457,'paper','NoMaRe2010-QUASOSS-Optimization','inproceedings','@inproceedings{NoMaRe2010-QUASOSS-Optimization,\n author = {Qais Noorshams and Anne Martens and Ralf Reussner},\n booktitle = {Proceedings of the 2nd International Workshop on the Quality of Service-Oriented Software Systems (QUASOSS \'10), Oslo, Norway, October 4, 2010},\n doi = {10.1145/1858263.1858265},\n isbn = {978-1-4503-0239-5},\n pages = {1:1--1:6},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/457.pdf},\n publisher = {ACM, New York, NY, USA},\n title = {Using Quality of Service Bounds for Effective Multi-objective Software Architecture Optimization},\n url = {http://sdq.ipd.kit.edu/conferences_and_events/quasoss2010/},\n year = {2010},\n}\n\n','\n\nQais Noorshams, Anne Martens, and Ralf Reussner.\nUsing quality of service bounds for effective multi-objective\nsoftware architecture optimization.\nIn Proceedings of the 2nd International Workshop on the Quality\nof Service-Oriented Software Systems (QUASOSS \'10), Oslo, Norway, October 4,\n2010, 2010, pages 1:1-1:6. ACM, New York, NY, USA.\n2010.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{NoMaRe2010-QUASOSS-Optimization,\nauthor = {Qais Noorshams and Anne Martens and Ralf Reussner},\nbooktitle = {Proceedings of the 2nd International Workshop on the Quality of Service-Oriented Software Systems (QUASOSS \'10), Oslo, Norway, October 4, 2010},\ndoi = {10.1145/1858263.1858265},\nisbn = {978-1-4503-0239-5},\npages = {1:1--1:6},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/457.pdf},\npublisher = {ACM, New York, NY, USA},\ntitle = {Using Quality of Service Bounds for Effective Multi-objective Software Architecture Optimization},\nurl = {http://sdq.ipd.kit.edu/conferences_and_events/quasoss2010/},\nyear = {2010}\n}\n
\n
\n','
\n@inproceedings{NoMaRe2010-QUASOSS-Optimization,\n  author = {Qais Noorshams and Anne Martens and Ralf Reussner},\n  booktitle = {Proceedings of the 2nd International Workshop on the Quality of Service-Oriented Software Systems (QUASOSS \'10), Oslo, Norway, October 4, 2010},\n  doi = {10.1145/1858263.1858265},\n  isbn = {978-1-4503-0239-5},\n  pages = {1:1--1:6},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/457.pdf},\n  publisher = {ACM, New York, NY, USA},\n  title = {Using Quality of Service Bounds for Effective Multi-objective Software Architecture Optimization},\n  url = {http://sdq.ipd.kit.edu/conferences_and_events/quasoss2010/},\n  year = {2010}\n}\n
\n\n',NULL,'Using Quality of Service Bounds for Effective Multi-objective Software Architecture Optimization',0,0,2010,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(458,'paper','NoKo2007-UPC-GlobusOnlinePerfModels','techreport','@techreport{NoKo2007-UPC-GlobusOnlinePerfModels,\n title = {{Preliminary Analysis of Globus Toolkit 4 to Create Prediction Models}},\n year = {2007},\n month = {7},\n number = {UPC-DAC-RR-2007-37},\n institution = {Computer Architecture Department, Technical University of Catalonia (UPC), Spain},\n author = {Nou, Ramon and Kounev, Samuel},\n}\n\n','\n\nRamon Nou and Samuel Kounev.\nPreliminary Analysis of Globus Toolkit 4 to Create Prediction\nModels.\nTechnical Report UPC-DAC-RR-2007-37, Computer Architecture\nDepartment, Technical University of Catalonia (UPC), Spain, 7 2007.\n[ bib  ] 
\n@techreport{NoKo2007-UPC-GlobusOnlinePerfModels,\ntitle = {{Preliminary Analysis of Globus Toolkit 4 to Create Prediction Models}},\nyear = {2007},\nmonth = {7},\nnumber = {UPC-DAC-RR-2007-37},\ninstitution = {Computer Architecture Department, Technical University of Catalonia (UPC), Spain},\nauthor = {Nou, Ramon and Kounev, Samuel}\n}\n
\n
\n','
\n@techreport{NoKo2007-UPC-GlobusOnlinePerfModels,\n  title = {{Preliminary Analysis of Globus Toolkit 4 to Create Prediction Models}},\n  year = {2007},\n  month = {7},\n  number = {UPC-DAC-RR-2007-37},\n  institution = {Computer Architecture Department, Technical University of Catalonia (UPC), Spain},\n  author = {Nou, Ramon and Kounev, Samuel}\n}\n
\n\n',NULL,'{Preliminary Analysis of Globus Toolkit 4 to Create Prediction Models}',0,7,2007,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(459,'paper','NoKoJuTo2008-JSS-GridAutoQoS','article','@article{NoKoJuTo2008-JSS-GridAutoQoS,\n title = {{Autonomic QoS control in enterprise Grid environments using online simulation}},\n journal = {Journal of Systems and Software},\n year = {2009},\n month = {March},\n volume = {82},\n number = {3},\n pages = {486--502},\n abstract = {As Grid Computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. The inherent complexity, heterogeneity and dynamics of Grid computing environments pose some challenges in managing their capacity to ensure that QoS requirements are continuously met. In this paper, a comprehensive framework for autonomic QoS control in enterprise Grid environments using online simulation is proposed. The paper presents a novel methodology for designing autonomic QoS-aware resource managers that have the capability to predict the performance of the Grid components they manage and allocate resources in such a way that service level agreements are honored. Support for advanced features such as autonomic workload characterization on-the-fly, dynamic deployment of Grid servers on demand, as well as dynamic system reconfiguration after a server failure is provided. The goal is to make the Grid middleware self-configurable and adaptable to changes in the system environment and workload. The approach is subjected to an extensive experimental evaluation in the context of a real-world Grid environment and its effectiveness, practicality and performance are demonstrated.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/459.pdf},\n publisher = {Elsevier Science Publishers B. V.},\n address = {Amsterdam, The Netherlands},\n doi = {10.1016/j.jss.2008.07.048},\n author = {Nou, Ramon and Kounev, Samuel and Julia, Ferran and Torres, Jordi},\n}\n\n','\n\nRamon Nou, Samuel Kounev, Ferran Julia, and Jordi Torres.\nAutonomic QoS control in enterprise Grid environments using online\nsimulation.\nJournal of Systems and Software, 82(3):486-502, March 2009,\nElsevier Science Publishers B. V., Amsterdam, The Netherlands.\n[ bib | DOI | .pdf | Abstract  ] 
\n@article{NoKoJuTo2008-JSS-GridAutoQoS,\ntitle = {{Autonomic QoS control in enterprise Grid environments using online simulation}},\njournal = {Journal of Systems and Software},\nyear = {2009},\nmonth = {March},\nvolume = {82},\nnumber = {3},\npages = {486--502},\nabstract = {As Grid Computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. The inherent complexity, heterogeneity and dynamics of Grid computing environments pose some challenges in managing their capacity to ensure that QoS requirements are continuously met. In this paper, a comprehensive framework for autonomic QoS control in enterprise Grid environments using online simulation is proposed. The paper presents a novel methodology for designing autonomic QoS-aware resource managers that have the capability to predict the performance of the Grid components they manage and allocate resources in such a way that service level agreements are honored. Support for advanced features such as autonomic workload characterization on-the-fly, dynamic deployment of Grid servers on demand, as well as dynamic system reconfiguration after a server failure is provided. The goal is to make the Grid middleware self-configurable and adaptable to changes in the system environment and workload. The approach is subjected to an extensive experimental evaluation in the context of a real-world Grid environment and its effectiveness, practicality and performance are demonstrated.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/459.pdf},\npublisher = {Elsevier Science Publishers B. V.},\naddress = {Amsterdam, The Netherlands},\ndoi = {10.1016/j.jss.2008.07.048},\nauthor = {Nou, Ramon and Kounev, Samuel and Julia, Ferran and Torres, Jordi}\n}\n
\n
\nAs Grid Computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. The inherent complexity, heterogeneity and dynamics of Grid computing environments pose some challenges in managing their capacity to ensure that QoS requirements are continuously met. In this paper, a comprehensive framework for autonomic QoS control in enterprise Grid environments using online simulation is proposed. The paper presents a novel methodology for designing autonomic QoS-aware resource managers that have the capability to predict the performance of the Grid components they manage and allocate resources in such a way that service level agreements are honored. Support for advanced features such as autonomic workload characterization on-the-fly, dynamic deployment of Grid servers on demand, as well as dynamic system reconfiguration after a server failure is provided. The goal is to make the Grid middleware self-configurable and adaptable to changes in the system environment and workload. The approach is subjected to an extensive experimental evaluation in the context of a real-world Grid environment and its effectiveness, practicality and performance are demonstrated.\n
\n','
\n@article{NoKoJuTo2008-JSS-GridAutoQoS,\n  title = {{Autonomic QoS control in enterprise Grid environments using online simulation}},\n  journal = {Journal of Systems and Software},\n  year = {2009},\n  month = {March},\n  volume = {82},\n  number = {3},\n  pages = {486--502},\n  abstract = {As Grid Computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. The inherent complexity, heterogeneity and dynamics of Grid computing environments pose some challenges in managing their capacity to ensure that QoS requirements are continuously met. In this paper, a comprehensive framework for autonomic QoS control in enterprise Grid environments using online simulation is proposed. The paper presents a novel methodology for designing autonomic QoS-aware resource managers that have the capability to predict the performance of the Grid components they manage and allocate resources in such a way that service level agreements are honored. Support for advanced features such as autonomic workload characterization on-the-fly, dynamic deployment of Grid servers on demand, as well as dynamic system reconfiguration after a server failure is provided. The goal is to make the Grid middleware self-configurable and adaptable to changes in the system environment and workload. The approach is subjected to an extensive experimental evaluation in the context of a real-world Grid environment and its effectiveness, practicality and performance are demonstrated.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/459.pdf},\n  publisher = {Elsevier Science Publishers B. V.},\n  address = {Amsterdam, The Netherlands},\n  doi = {10.1016/j.jss.2008.07.048},\n  author = {Nou, Ramon and Kounev, Samuel and Julia, Ferran and Torres, Jordi}\n}\n
\n\n','As Grid Computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. The inherent complexity, heterogeneity and dynamics of Grid computing environments pose some challenges in managing their capacity to ensure that QoS requirements are continuously met. In this paper, a comprehensive framework for autonomic QoS control in enterprise Grid environments using online simulation is proposed. The paper presents a novel methodology for designing autonomic QoS-aware resource managers that have the capability to predict the performance of the Grid components they manage and allocate resources in such a way that service level agreements are honored. Support for advanced features such as autonomic workload characterization on-the-fly, dynamic deployment of Grid servers on demand, as well as dynamic system reconfiguration after a server failure is provided. The goal is to make the Grid middleware self-configurable and adaptable to changes in the system environment and workload. The approach is subjected to an extensive experimental evaluation in the context of a real-world Grid environment and its effectiveness, practicality and performance are demonstrated.','{Autonomic QoS control in enterprise Grid environments using online simulation}',0,3,2009,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(460,'paper','NoKoTo2007-EPEW-GridOnlinePerfModels','inproceedings','@inproceedings{NoKoTo2007-EPEW-GridOnlinePerfModels,\n title = {{Building Online Performance Models of Grid Middleware with Fine-Grained Load-Balancing: A Globus Toolkit Case Study}},\n year = {2007},\n month = {9},\n number = {4748},\n pages = {125--140},\n abstract = {As Grid computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. To guarantee that QoS requirements are continuously satisfied, the Grid middleware must be capable of predicting the application performance on the fly when deciding how to distribute the workload among the available resources. One way to achieve this is by using online performance models that get generated and analyzed on the fly. In this paper, we present a novel case study with the Globus Toolkit in which we show how performance models can be generated dynamically and used to provide online performance prediction capabilities. We have augmented the Grid middleware with an online performance prediction component that can be called at any time during operation to predict the Grid performance for a given resource allocation and load-balancing strategy. We evaluate the quality of our performance prediction mechanism and present some experimental results that demonstrate its effectiveness and practicality. The framework we propose can be used to design intelligent QoS-aware resource allocation and admission control mechanisms.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/460.pdf},\n editor = {Katinka Wolter},\n publisher = {Springer},\n address = {Heidelberg, Germany},\n series = {Lecture Notes in Computer Science},\n booktitle = {Formal Methods and Stochastic Models for Performance Evaluation, Proceedings of the 4th European Performance Engineering Workshop (EPEW 2007), Berlin, Germany, September 27-28, 2007},\n isbn = {978-3-540-75210-3},\n doi = {10.1007/978-3-540-75211-0_10},\n author = {Nou, Ramon and Kounev, Samuel and Torres, Jordi},\n}\n\n','\n\nRamon Nou, Samuel Kounev, and Jordi Torres.\nBuilding Online Performance Models of Grid Middleware with\nFine-Grained Load-Balancing: A Globus Toolkit Case Study.\nIn Formal Methods and Stochastic Models for Performance\nEvaluation, Proceedings of the 4th European Performance Engineering Workshop\n(EPEW 2007), Berlin, Germany, September 27-28, 2007, Katinka Wolter, editor,\n9 2007, number 4748 in Lecture Notes in Computer Science, pages 125-140.\nSpringer, Heidelberg, Germany.\n9 2007.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{NoKoTo2007-EPEW-GridOnlinePerfModels,\ntitle = {{Building Online Performance Models of Grid Middleware with Fine-Grained Load-Balancing: A Globus Toolkit Case Study}},\nyear = {2007},\nmonth = {9},\nnumber = {4748},\npages = {125--140},\nabstract = {As Grid computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. To guarantee that QoS requirements are continuously satisfied, the Grid middleware must be capable of predicting the application performance on the fly when deciding how to distribute the workload among the available resources. One way to achieve this is by using online performance models that get generated and analyzed on the fly. In this paper, we present a novel case study with the Globus Toolkit in which we show how performance models can be generated dynamically and used to provide online performance prediction capabilities. We have augmented the Grid middleware with an online performance prediction component that can be called at any time during operation to predict the Grid performance for a given resource allocation and load-balancing strategy. We evaluate the quality of our performance prediction mechanism and present some experimental results that demonstrate its effectiveness and practicality. The framework we propose can be used to design intelligent QoS-aware resource allocation and admission control mechanisms.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/460.pdf},\neditor = {Katinka Wolter},\npublisher = {Springer},\naddress = {Heidelberg, Germany},\nseries = {Lecture Notes in Computer Science},\nbooktitle = {Formal Methods and Stochastic Models for Performance Evaluation, Proceedings of the 4th European Performance Engineering Workshop (EPEW 2007), Berlin, Germany, September 27-28, 2007},\nisbn = {978-3-540-75210-3},\ndoi = {10.1007/978-3-540-75211-0_10},\nauthor = {Nou, Ramon and Kounev, Samuel and Torres, Jordi}\n}\n
\n
\nAs Grid computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. To guarantee that QoS requirements are continuously satisfied, the Grid middleware must be capable of predicting the application performance on the fly when deciding how to distribute the workload among the available resources. One way to achieve this is by using online performance models that get generated and analyzed on the fly. In this paper, we present a novel case study with the Globus Toolkit in which we show how performance models can be generated dynamically and used to provide online performance prediction capabilities. We have augmented the Grid middleware with an online performance prediction component that can be called at any time during operation to predict the Grid performance for a given resource allocation and load-balancing strategy. We evaluate the quality of our performance prediction mechanism and present some experimental results that demonstrate its effectiveness and practicality. The framework we propose can be used to design intelligent QoS-aware resource allocation and admission control mechanisms.\n
\n','
\n@inproceedings{NoKoTo2007-EPEW-GridOnlinePerfModels,\n  title = {{Building Online Performance Models of Grid Middleware with Fine-Grained Load-Balancing: A Globus Toolkit Case Study}},\n  year = {2007},\n  month = {9},\n  number = {4748},\n  pages = {125--140},\n  abstract = {As Grid computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. To guarantee that QoS requirements are continuously satisfied, the Grid middleware must be capable of predicting the application performance on the fly when deciding how to distribute the workload among the available resources. One way to achieve this is by using online performance models that get generated and analyzed on the fly. In this paper, we present a novel case study with the Globus Toolkit in which we show how performance models can be generated dynamically and used to provide online performance prediction capabilities. We have augmented the Grid middleware with an online performance prediction component that can be called at any time during operation to predict the Grid performance for a given resource allocation and load-balancing strategy. We evaluate the quality of our performance prediction mechanism and present some experimental results that demonstrate its effectiveness and practicality. The framework we propose can be used to design intelligent QoS-aware resource allocation and admission control mechanisms.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/460.pdf},\n  editor = {Katinka Wolter},\n  publisher = {Springer},\n  address = {Heidelberg, Germany},\n  series = {Lecture Notes in Computer Science},\n  booktitle = {Formal Methods and Stochastic Models for Performance Evaluation, Proceedings of the 4th European Performance Engineering Workshop (EPEW 2007), Berlin, Germany, September 27-28, 2007},\n  isbn = {978-3-540-75210-3},\n  doi = {10.1007/978-3-540-75211-0_10},\n  author = {Nou, Ramon and Kounev, Samuel and Torres, Jordi}\n}\n
\n\n','As Grid computing increasingly enters the commercial domain, performance and Quality of Service (QoS) issues are becoming a major concern. To guarantee that QoS requirements are continuously satisfied, the Grid middleware must be capable of predicting the application performance on the fly when deciding how to distribute the workload among the available resources. One way to achieve this is by using online performance models that get generated and analyzed on the fly. In this paper, we present a novel case study with the Globus Toolkit in which we show how performance models can be generated dynamically and used to provide online performance prediction capabilities. We have augmented the Grid middleware with an online performance prediction component that can be called at any time during operation to predict the Grid performance for a given resource allocation and load-balancing strategy. We evaluate the quality of our performance prediction mechanism and present some experimental results that demonstrate its effectiveness and practicality. The framework we propose can be used to design intelligent QoS-aware resource allocation and admission control mechanisms.','{Building Online Performance Models of Grid Middleware with Fine-Grained Load-Balancing: A Globus Toolkit Case Study}',0,9,2007,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(481,'paper','PiEyKoSh2007-DEBS-PubSubAPI','inproceedings','@inproceedings{PiEyKoSh2007-DEBS-PubSubAPI,\n abstract = {Over the last decade a wide range of publish/subscribe (pub/sub) systems have come out of the research community. However, there is little consensus on a common pub/sub API, which would facilitate innovation, encourage application building, and simplify the evaluation of existing prototypes. Industry pub/sub standards tend to be overly complex, technology-centric, and hard to extend, thus limiting their applicability in research systems. In this paper we propose a common API for pub/sub that is tailored towards research requirements. The API supports three levels of compliance (with optional extensions): the lowest level specifies abstract operations without prescribing an implementation or data model; medium compliance describes interactions using a light-weight XML-RPC mechanism; finally, the highest level of compliance enforces an XML-RPC data model, enabling systems to understand each other\'s event and subscription semantics. We show that, by following this flexible approach with emphasis on extensibility, our API can be supported by many prototype systems with little effort.},\n author = {Peter Pietzuch and David Eyers and Samuel Kounev and Brian Shand},\n booktitle = {Proceedings of the 2007 Inaugural International Conference on Distributed Event-Based Systems (DEBS 2007), Toronto, Canada, June 20-22, 2007},\n doi = {10.1145/1266894.1266924},\n editor = {Hans-Arno Jacobsen and Gero M{\\\"u}hl and Michael A. Jaeger},\n isbn = {978-1-59593-665-3},\n month = {June},\n pages = {152--157},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/481.pdf},\n publisher = {ACM, New York, NY, USA},\n series = {ACM International Conference Proceeding Series},\n title = {{Towards a Common API for Publish/Subscribe}},\n url = {http://debs.msrg.utoronto.ca/},\n volume = {233},\n year = {2007},\n}\n\n','\n\nPeter Pietzuch, David Eyers, Samuel Kounev, and Brian Shand.\nTowards a Common API for Publish/Subscribe.\nIn Proceedings of the 2007 Inaugural International Conference on\nDistributed Event-Based Systems (DEBS 2007), Toronto, Canada, June 20-22,\n2007, Hans-Arno Jacobsen, Gero Mühl, and Michael A. Jaeger, editors,\nJune 2007, volume 233 of ACM International Conference Proceeding\nSeries, pages 152-157. ACM, New York, NY, USA.\nJune 2007.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{PiEyKoSh2007-DEBS-PubSubAPI,\nabstract = {Over the last decade a wide range of publish/subscribe (pub/sub) systems have come out of the research community. However, there is little consensus on a common pub/sub API, which would facilitate innovation, encourage application building, and simplify the evaluation of existing prototypes. Industry pub/sub standards tend to be overly complex, technology-centric, and hard to extend, thus limiting their applicability in research systems. In this paper we propose a common API for pub/sub that is tailored towards research requirements. The API supports three levels of compliance (with optional extensions): the lowest level specifies abstract operations without prescribing an implementation or data model; medium compliance describes interactions using a light-weight XML-RPC mechanism; finally, the highest level of compliance enforces an XML-RPC data model, enabling systems to understand each other\'s event and subscription semantics. We show that, by following this flexible approach with emphasis on extensibility, our API can be supported by many prototype systems with little effort.},\nauthor = {Peter Pietzuch and David Eyers and Samuel Kounev and Brian Shand},\nbooktitle = {Proceedings of the 2007 Inaugural International Conference on Distributed Event-Based Systems (DEBS 2007), Toronto, Canada, June 20-22, 2007},\ndoi = {10.1145/1266894.1266924},\neditor = {Hans-Arno Jacobsen and Gero M{\\\"u}hl and Michael A. Jaeger},\nisbn = {978-1-59593-665-3},\nmonth = {June},\npages = {152--157},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/481.pdf},\npublisher = {ACM, New York, NY, USA},\nseries = {ACM International Conference Proceeding Series},\ntitle = {{Towards a Common API for Publish/Subscribe}},\nurl = {http://debs.msrg.utoronto.ca/},\nvolume = {233},\nyear = {2007}\n}\n
\n
\nOver the last decade a wide range of publish/subscribe (pub/sub) systems have come out of the research community. However, there is little consensus on a common pub/sub API, which would facilitate innovation, encourage application building, and simplify the evaluation of existing prototypes. Industry pub/sub standards tend to be overly complex, technology-centric, and hard to extend, thus limiting their applicability in research systems. In this paper we propose a common API for pub/sub that is tailored towards research requirements. The API supports three levels of compliance (with optional extensions): the lowest level specifies abstract operations without prescribing an implementation or data model; medium compliance describes interactions using a light-weight XML-RPC mechanism; finally, the highest level of compliance enforces an XML-RPC data model, enabling systems to understand each other\'s event and subscription semantics. We show that, by following this flexible approach with emphasis on extensibility, our API can be supported by many prototype systems with little effort.\n
\n','
\n@inproceedings{PiEyKoSh2007-DEBS-PubSubAPI,\n  abstract = {Over the last decade a wide range of publish/subscribe (pub/sub) systems have come out of the research community. However, there is little consensus on a common pub/sub API, which would facilitate innovation, encourage application building, and simplify the evaluation of existing prototypes. Industry pub/sub standards tend to be overly complex, technology-centric, and hard to extend, thus limiting their applicability in research systems. In this paper we propose a common API for pub/sub that is tailored towards research requirements. The API supports three levels of compliance (with optional extensions): the lowest level specifies abstract operations without prescribing an implementation or data model; medium compliance describes interactions using a light-weight XML-RPC mechanism; finally, the highest level of compliance enforces an XML-RPC data model, enabling systems to understand each other\'s event and subscription semantics. We show that, by following this flexible approach with emphasis on extensibility, our API can be supported by many prototype systems with little effort.},\n  author = {Peter Pietzuch and David Eyers and Samuel Kounev and Brian Shand},\n  booktitle = {Proceedings of the 2007 Inaugural International Conference on Distributed Event-Based Systems (DEBS 2007), Toronto, Canada, June 20-22, 2007},\n  doi = {10.1145/1266894.1266924},\n  editor = {Hans-Arno Jacobsen and Gero M{\\\"u}hl and Michael A. Jaeger},\n  isbn = {978-1-59593-665-3},\n  month = {June},\n  pages = {152--157},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/481.pdf},\n  publisher = {ACM, New York, NY, USA},\n  series = {ACM International Conference Proceeding Series},\n  title = {{Towards a Common API for Publish/Subscribe}},\n  url = {http://debs.msrg.utoronto.ca/},\n  volume = {233},\n  year = {2007}\n}\n
\n\n','Over the last decade a wide range of publish/subscribe (pub/sub) systems have come out of the research community. However, there is little consensus on a common pub/sub API, which would facilitate innovation, encourage application building, and simplify the evaluation of existing prototypes. Industry pub/sub standards tend to be overly complex, technology-centric, and hard to extend, thus limiting their applicability in research systems. In this paper we propose a common API for pub/sub that is tailored towards research requirements. The API supports three levels of compliance (with optional extensions): the lowest level specifies abstract operations without prescribing an implementation or data model; medium compliance describes interactions using a light-weight XML-RPC mechanism; finally, the highest level of compliance enforces an XML-RPC data model, enabling systems to understand each other\'s event and subscription semantics. We show that, by following this flexible approach with emphasis on extensibility, our API can be supported by many prototype systems with little effort.','{Towards a Common API for Publish/Subscribe}',0,6,2007,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:58',0),(487,'paper','rathfelder2013b','book','@book{rathfelder2013b,\n address = {Karlsruhe, Germany},\n author = {Christoph Rathfelder},\n pdf = {http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/2499675},\n publisher = {KIT Scientific Publishing},\n series = {The Karlsruhe Series on Software Design and Quality},\n title = {Modelling Event-Based Interactions in Component-Based Architectures for Quantitative System Evaluation},\n url = {http://www.ksp.kit.edu/shop/isbn2shopid.php?isbn=978-3-86644-969-5},\n volume = {10},\n year = {2013},\n}\n\n','\n\nChristoph Rathfelder.\nModelling Event-Based Interactions in Component-Based\nArchitectures for Quantitative System Evaluation, volume 10 of The\nKarlsruhe Series on Software Design and Quality.\nKIT Scientific Publishing, Karlsruhe, Germany, 2013.\n[ bib | http | http  ] 
\n@book{rathfelder2013b,\naddress = {Karlsruhe, Germany},\nauthor = {Christoph Rathfelder},\npdf = {http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/2499675},\npublisher = {KIT Scientific Publishing},\nseries = {The Karlsruhe Series on Software Design and Quality},\ntitle = {Modelling Event-Based Interactions in Component-Based Architectures for Quantitative System Evaluation},\nurl = {http://www.ksp.kit.edu/shop/isbn2shopid.php?isbn=978-3-86644-969-5},\nvolume = {10},\nyear = {2013}\n}\n
\n
\n','
\n@book{rathfelder2013b,\n  address = {Karlsruhe, Germany},\n  author = {Christoph Rathfelder},\n  pdf = {http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/2499675},\n  publisher = {KIT Scientific Publishing},\n  series = {The Karlsruhe Series on Software Design and Quality},\n  title = {Modelling Event-Based Interactions in Component-Based Architectures for Quantitative System Evaluation},\n  url = {http://www.ksp.kit.edu/shop/isbn2shopid.php?isbn=978-3-86644-969-5},\n  volume = {10},\n  year = {2013}\n}\n
\n\n',NULL,'Modelling Event-Based Interactions in Component-Based Architectures for Quantitative System Evaluation',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(488,'paper','rathfelder2007a','book','@book{rathfelder2007a,\n address = {Saarbr\\\"{u}cken, Germany},\n author = {Rathfelder, Christoph},\n month = {April},\n publisher = {VDM Verlag Dr. M\\\"{u}ller},\n title = {{M}anagement in serviceorientierten {A}rchitekturen: {E}ine {M}anagementinfrastruktur f\\\"{u}r die \\\"{U}berwachung komponierter {W}ebservices},\n year = {2007},\n}\n\n','\n\nChristoph Rathfelder.\nManagement in serviceorientierten Architekturen: Eine\nManagementinfrastruktur für die Überwachung komponierter\nWebservices.\nVDM Verlag Dr. Müller, Saarbrücken, Germany, April 2007.\n[ bib  ] 
\n@book{rathfelder2007a,\naddress = {Saarbr\\\"{u}cken, Germany},\nauthor = {Rathfelder, Christoph},\nmonth = {April},\npublisher = {VDM Verlag Dr. M\\\"{u}ller},\ntitle = {{M}anagement in serviceorientierten {A}rchitekturen: {E}ine {M}anagementinfrastruktur f\\\"{u}r die \\\"{U}berwachung komponierter {W}ebservices},\nyear = {2007}\n}\n
\n
\n','
\n@book{rathfelder2007a,\n  address = {Saarbr\\\"{u}cken, Germany},\n  author = {Rathfelder, Christoph},\n  month = {April},\n  publisher = {VDM Verlag Dr. M\\\"{u}ller},\n  title = {{M}anagement in serviceorientierten {A}rchitekturen: {E}ine {M}anagementinfrastruktur f\\\"{u}r die \\\"{U}berwachung komponierter {W}ebservices},\n  year = {2007}\n}\n
\n\n',NULL,'{M}anagement in serviceorientierten {A}rchitekturen: {E}ine {M}anagementinfrastruktur f\\\"{u}r die \\\"{U}berwachung komponierter {W}ebservices',0,4,2007,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 10:15:30',0),(489,'paper','rathfelder2007b','mastersthesis','@mastersthesis{rathfelder2007b,\n address = {Karlsruhe},\n author = {Rathfelder, Christoph},\n school = {Universit{\"a}t Karlsruhe (TH)},\n title = {{{E}ine {M}anagementinfrastruktur f{\\\"u}r die {\\\"U}berwachung komponierter {W}ebservices}},\n year = {2007},\n}\n\n','\n\nChristoph Rathfelder.\nEine Managementinfrastruktur für die Überwachung\nkomponierter Webservices.\nMaster\'s thesis, Universit\"at Karlsruhe (TH), Karlsruhe, 2007.\n[ bib  ] 
\n@mastersthesis{rathfelder2007b,\naddress = {Karlsruhe},\nauthor = {Rathfelder, Christoph},\nschool = {Universit{\"a}t Karlsruhe (TH)},\ntitle = {{{E}ine {M}anagementinfrastruktur f{\\\"u}r die {\\\"U}berwachung komponierter {W}ebservices}},\nyear = {2007}\n}\n
\n
\n','
\n@mastersthesis{rathfelder2007b,\n  address = {Karlsruhe},\n  author = {Rathfelder, Christoph},\n  school = {Universit{\"a}t Karlsruhe (TH)},\n  title = {{{E}ine {M}anagementinfrastruktur f{\\\"u}r die {\\\"U}berwachung komponierter {W}ebservices}},\n  year = {2007}\n}\n
\n\n',NULL,'{{E}ine {M}anagementinfrastruktur f{\\\"u}r die {\\\"U}berwachung komponierter {W}ebservices}',0,0,2007,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(490,'paper','rathfelder2012a','inproceedings','@inproceedings{rathfelder2012a,\n author = {Christoph Rathfelder and Stefan Becker and Klaus Krogmann and Ralf Reussner},\n booktitle = {Proceedings of the Joint 10th Working IEEE/IFIP Conference on Software Architecture (WICSA) & 6th European Conference on Software Architecture (ECSA)},\n doi = {10.1109/WICSA-ECSA.212.11},\n location = {Helsinki, Finland},\n month = {August},\n note = {Acceptance Rate (Full Paper): 19.8\\%},\n pages = {31--40},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/490.pdf},\n title = {Workload-aware System Monitoring Using Performance Predictions Applied to a Large-scale E-Mail System},\n url = {http://www.wicsa.net/},\n year = {2012},\n}\n\n','\n\nChristoph Rathfelder, Stefan Becker, Klaus Krogmann, and Ralf Reussner.\nWorkload-aware system monitoring using performance predictions\napplied to a large-scale e-mail system.\nIn Proceedings of the Joint 10th Working IEEE/IFIP Conference on\nSoftware Architecture (WICSA) & 6th European Conference on Software\nArchitecture (ECSA), Helsinki, Finland, August 2012, pages 31-40.\nAcceptance Rate (Full Paper): 19.8%.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{rathfelder2012a,\nauthor = {Christoph Rathfelder and Stefan Becker and Klaus Krogmann and Ralf Reussner},\nbooktitle = {Proceedings of the Joint 10th Working IEEE/IFIP Conference on Software Architecture (WICSA) & 6th European Conference on Software Architecture (ECSA)},\ndoi = {10.1109/WICSA-ECSA.212.11},\nlocation = {Helsinki, Finland},\nmonth = {August},\nnote = {Acceptance Rate (Full Paper): 19.8\\%},\npages = {31--40},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/490.pdf},\ntitle = {Workload-aware System Monitoring Using Performance Predictions Applied to a Large-scale E-Mail System},\nurl = {http://www.wicsa.net/},\nyear = {2012}\n}\n
\n
\n','
\n@inproceedings{rathfelder2012a,\n  author = {Christoph Rathfelder and Stefan Becker and Klaus Krogmann and Ralf Reussner},\n  booktitle = {Proceedings of the Joint 10th Working IEEE/IFIP Conference on Software Architecture (WICSA) & 6th European Conference on Software Architecture (ECSA)},\n  doi = {10.1109/WICSA-ECSA.212.11},\n  location = {Helsinki, Finland},\n  month = {August},\n  note = {Acceptance Rate (Full Paper): 19.8\\%},\n  pages = {31--40},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/490.pdf},\n  title = {Workload-aware System Monitoring Using Performance Predictions Applied to a Large-scale E-Mail System},\n  url = {http://www.wicsa.net/},\n  year = {2012}\n}\n
\n\n',NULL,'Workload-aware System Monitoring Using Performance Predictions Applied to a Large-scale E-Mail System',0,8,2012,8,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(491,'paper','rathfelder2010a','inproceedings','@inproceedings{rathfelder2010a,\n abstract = {The event-driven communication paradigm is used increasingly often to build loosely-coupled distributed systems in many industry domains including telecommunications, transportation, and supply chain management. However, the loose coupling of components in such systems makes it hard for developers to estimate their behaviour and performance under load. Most general purpose performance meta-models for component-based systems provide limited support for modelling event-driven communication. In this paper, we present a case study of a real-life road traffic monitoring system that shows how event-driven communication can be modelled for performance prediction and capacity planning. Our approach is based on the Palladio Component Model (PCM) which we have extended to support event-driven communication. We evaluate the accuracy of our modelling approach in a number of different workload and configuration scenarios. The results demonstrate the practicality and effectiveness of the proposed approach.},\n address = {Berlin, Heidelberg},\n author = {Christoph Rathfelder and David Evans and Samuel Kounev},\n booktitle = {Proceedings of the 7th European Performance Engineering Workshop (EPEW 2010)},\n day = {23--24},\n editor = {Alessandro Aldini and Marco Bernardo and Luciano Bononi and Vittorio Cortellessa},\n location = {Bertinoro, Italy},\n month = {September},\n pages = {219--235},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/491.pdf},\n publisher = {Springer-Verlag},\n series = {Lecture Notes in Computer Science (LNCS)},\n title = {{P}redictive {M}odelling of {P}eer-to-{P}eer {E}vent-driven {C}ommunication in {C}omponent-based {S}ystems},\n volume = {6342},\n year = {2010},\n}\n\n','\n\nChristoph Rathfelder, David Evans, and Samuel Kounev.\nPredictive Modelling of Peer-to-Peer Event-driven\nCommunication in Component-based Systems.\nIn Proceedings of the 7th European Performance Engineering\nWorkshop (EPEW 2010), Alessandro Aldini, Marco Bernardo, Luciano Bononi, and\nVittorio Cortellessa, editors, Bertinoro, Italy, September 23-24, 2010,\nvolume 6342 of Lecture Notes in Computer Science (LNCS), pages\n219-235. Springer-Verlag, Berlin, Heidelberg.\nSeptember 2010.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{rathfelder2010a,\nabstract = {The event-driven communication paradigm is used increasingly often to build loosely-coupled distributed systems in many industry domains including telecommunications, transportation, and supply chain management. However, the loose coupling of components in such systems makes it hard for developers to estimate their behaviour and performance under load. Most general purpose performance meta-models for component-based systems provide limited support for modelling event-driven communication. In this paper, we present a case study of a real-life road traffic monitoring system that shows how event-driven communication can be modelled for performance prediction and capacity planning. Our approach is based on the Palladio Component Model (PCM) which we have extended to support event-driven communication. We evaluate the accuracy of our modelling approach in a number of different workload and configuration scenarios. The results demonstrate the practicality and effectiveness of the proposed approach.},\naddress = {Berlin, Heidelberg},\nauthor = {Christoph Rathfelder and David Evans and Samuel Kounev},\nbooktitle = {Proceedings of the 7th European Performance Engineering Workshop (EPEW 2010)},\nday = {23--24},\neditor = {Alessandro Aldini and Marco Bernardo and Luciano Bononi and Vittorio Cortellessa},\nlocation = {Bertinoro, Italy},\nmonth = {September},\npages = {219--235},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/491.pdf},\npublisher = {Springer-Verlag},\nseries = {Lecture Notes in Computer Science (LNCS)},\ntitle = {{P}redictive {M}odelling of {P}eer-to-{P}eer {E}vent-driven {C}ommunication in {C}omponent-based {S}ystems},\nvolume = {6342},\nyear = {2010}\n}\n
\n
\nThe event-driven communication paradigm is used increasingly often to build loosely-coupled distributed systems in many industry domains including telecommunications, transportation, and supply chain management. However, the loose coupling of components in such systems makes it hard for developers to estimate their behaviour and performance under load. Most general purpose performance meta-models for component-based systems provide limited support for modelling event-driven communication. In this paper, we present a case study of a real-life road traffic monitoring system that shows how event-driven communication can be modelled for performance prediction and capacity planning. Our approach is based on the Palladio Component Model (PCM) which we have extended to support event-driven communication. We evaluate the accuracy of our modelling approach in a number of different workload and configuration scenarios. The results demonstrate the practicality and effectiveness of the proposed approach.\n
\n','
\n@inproceedings{rathfelder2010a,\n  abstract = {The event-driven communication paradigm is used increasingly often to build loosely-coupled distributed systems in many industry domains including telecommunications, transportation, and supply chain management. However, the loose coupling of components in such systems makes it hard for developers to estimate their behaviour and performance under load. Most general purpose performance meta-models for component-based systems provide limited support for modelling event-driven communication. In this paper, we present a case study of a real-life road traffic monitoring system that shows how event-driven communication can be modelled for performance prediction and capacity planning. Our approach is based on the Palladio Component Model (PCM) which we have extended to support event-driven communication. We evaluate the accuracy of our modelling approach in a number of different workload and configuration scenarios. The results demonstrate the practicality and effectiveness of the proposed approach.},\n  address = {Berlin, Heidelberg},\n  author = {Christoph Rathfelder and David Evans and Samuel Kounev},\n  booktitle = {Proceedings of the 7th European Performance Engineering Workshop (EPEW 2010)},\n  day = {23--24},\n  editor = {Alessandro Aldini and Marco Bernardo and Luciano Bononi and Vittorio Cortellessa},\n  location = {Bertinoro, Italy},\n  month = {September},\n  pages = {219--235},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/491.pdf},\n  publisher = {Springer-Verlag},\n  series = {Lecture Notes in Computer Science (LNCS)},\n  title = {{P}redictive {M}odelling of {P}eer-to-{P}eer {E}vent-driven {C}ommunication in {C}omponent-based {S}ystems},\n  volume = {6342},\n  year = {2010}\n}\n
\n\n','The event-driven communication paradigm is used increasingly often to build loosely-coupled distributed systems in many industry domains including telecommunications, transportation, and supply chain management. However, the loose coupling of components in such systems makes it hard for developers to estimate their behaviour and performance under load. Most general purpose performance meta-models for component-based systems provide limited support for modelling event-driven communication. In this paper, we present a case study of a real-life road traffic monitoring system that shows how event-driven communication can be modelled for performance prediction and capacity planning. Our approach is based on the Palladio Component Model (PCM) which we have extended to support event-driven communication. We evaluate the accuracy of our modelling approach in a number of different workload and configuration scenarios. The results demonstrate the practicality and effectiveness of the proposed approach.','{P}redictive {M}odelling of {P}eer-to-{P}eer {E}vent-driven {C}ommunication in {C}omponent-based {S}ystems',0,9,2010,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(492,'paper','rathfelder2009c','inproceedings','@inproceedings{rathfelder2009c,\n abstract = {Today, the architectures of software systems are not stable for their whole lifetime but often adapted driven by business needs. Preserving their quality characteristics beyond each of these changes requires deep knowledge of the requirements and the systems themselves. Proper documentation reduces the risk that knowledge is lost and hence is a base for the system\'s maintenance in the long-run. However, the influence of architectural documentation on the maintainability of software systems is neglected in current quality assessment methods. They are limited to documentation for anticipated change scenarios and do not provide a general assessment approach. In this paper, we propose a maturity model for architecture documentation. It is shaped relative to growing quality preservation maturity and independent of specific technologies or products. It supports the weighting of necessary effort against reducing long-term risks in the maintenance phase. This allows to take product maintainability requirements into account for selecting an appropriate documentation maturity level.},\n address = {Berlin, Germany},\n author = {Rathfelder, Christoph and Groenda, Henning},\n booktitle = {Proceedings of the 3rd Workshop MDD, SOA und IT-Management (MSI 2009)},\n day = {6--7},\n location = {Oldenburg, Germany},\n month = {October},\n pages = {65--80},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/492.pdf},\n publisher = {GiTO-Verlag},\n title = {{T}he {A}rchitecture {D}ocumentation {M}aturity {M}odel {ADM2}},\n year = {2009},\n}\n\n','\n\nChristoph Rathfelder and Henning Groenda.\nThe Architecture Documentation Maturity Model ADM2.\nIn Proceedings of the 3rd Workshop MDD, SOA und IT-Management\n(MSI 2009), Oldenburg, Germany, October 6-7, 2009, pages 65-80.\nGiTO-Verlag, Berlin, Germany.\nOctober 2009.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{rathfelder2009c,\nabstract = {Today, the architectures of software systems are not stable for their whole lifetime but often adapted driven by business needs. Preserving their quality characteristics beyond each of these changes requires deep knowledge of the requirements and the systems themselves. Proper documentation reduces the risk that knowledge is lost and hence is a base for the system\'s maintenance in the long-run. However, the influence of architectural documentation on the maintainability of software systems is neglected in current quality assessment methods. They are limited to documentation for anticipated change scenarios and do not provide a general assessment approach. In this paper, we propose a maturity model for architecture documentation. It is shaped relative to growing quality preservation maturity and independent of specific technologies or products. It supports the weighting of necessary effort against reducing long-term risks in the maintenance phase. This allows to take product maintainability requirements into account for selecting an appropriate documentation maturity level.},\naddress = {Berlin, Germany},\nauthor = {Rathfelder, Christoph and Groenda, Henning},\nbooktitle = {Proceedings of the 3rd Workshop MDD, SOA und IT-Management (MSI 2009)},\nday = {6--7},\nlocation = {Oldenburg, Germany},\nmonth = {October},\npages = {65--80},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/492.pdf},\npublisher = {GiTO-Verlag},\ntitle = {{T}he {A}rchitecture {D}ocumentation {M}aturity {M}odel {ADM2}},\nyear = {2009}\n}\n
\n
\nToday, the architectures of software systems are not stable for their whole lifetime but often adapted driven by business needs. Preserving their quality characteristics beyond each of these changes requires deep knowledge of the requirements and the systems themselves. Proper documentation reduces the risk that knowledge is lost and hence is a base for the system\'s maintenance in the long-run. However, the influence of architectural documentation on the maintainability of software systems is neglected in current quality assessment methods. They are limited to documentation for anticipated change scenarios and do not provide a general assessment approach. In this paper, we propose a maturity model for architecture documentation. It is shaped relative to growing quality preservation maturity and independent of specific technologies or products. It supports the weighting of necessary effort against reducing long-term risks in the maintenance phase. This allows to take product maintainability requirements into account for selecting an appropriate documentation maturity level.\n
\n','
\n@inproceedings{rathfelder2009c,\n  abstract = {Today, the architectures of software systems are not stable for their whole lifetime but often adapted driven by business needs. Preserving their quality characteristics beyond each of these changes requires deep knowledge of the requirements and the systems themselves. Proper documentation reduces the risk that knowledge is lost and hence is a base for the system\'s maintenance in the long-run. However, the influence of architectural documentation on the maintainability of software systems is neglected in current quality assessment methods. They are limited to documentation for anticipated change scenarios and do not provide a general assessment approach. In this paper, we propose a maturity model for architecture documentation. It is shaped relative to growing quality preservation maturity and independent of specific technologies or products. It supports the weighting of necessary effort against reducing long-term risks in the maintenance phase. This allows to take product maintainability requirements into account for selecting an appropriate documentation maturity level.},\n  address = {Berlin, Germany},\n  author = {Rathfelder, Christoph and Groenda, Henning},\n  booktitle = {Proceedings of the 3rd Workshop MDD, SOA und IT-Management (MSI 2009)},\n  day = {6--7},\n  location = {Oldenburg, Germany},\n  month = {October},\n  pages = {65--80},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/492.pdf},\n  publisher = {GiTO-Verlag},\n  title = {{T}he {A}rchitecture {D}ocumentation {M}aturity {M}odel {ADM2}},\n  year = {2009}\n}\n
\n\n','Today, the architectures of software systems are not stable for their whole lifetime but often adapted driven by business needs. Preserving their quality characteristics beyond each of these changes requires deep knowledge of the requirements and the systems themselves. Proper documentation reduces the risk that knowledge is lost and hence is a base for the system\'s maintenance in the long-run. However, the influence of architectural documentation on the maintainability of software systems is neglected in current quality assessment methods. They are limited to documentation for anticipated change scenarios and do not provide a general assessment approach. In this paper, we propose a maturity model for architecture documentation. It is shaped relative to growing quality preservation maturity and independent of specific technologies or products. It supports the weighting of necessary effort against reducing long-term risks in the maintenance phase. This allows to take product maintainability requirements into account for selecting an appropriate documentation maturity level.','{T}he {A}rchitecture {D}ocumentation {M}aturity {M}odel {ADM2}',0,10,2009,10,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(493,'paper','rathfelder2008a','inproceedings','@inproceedings{rathfelder2008a,\n abstract = {The implementation of an enterprise-wide Service Oriented Architecture (SOA) is a complex task. In most cases, evolutional approaches are used to handle this complexity. Maturity models are a possibility to plan and control such an evolution as they allow evaluating the current maturity and identifying current shortcomings. In order to support an SOA implementation, maturity models should also support in the selection of the most adequate maturity level and the deduction of a roadmap to this level. Existing SOA maturity models provide only weak assistance with the selection of an adequate maturity level. Most of them are developed by vendors of SOA products and often used to promote their products. In this paper, we introduce our independent SOA Maturity Model (iSOAMM), which is independent of the used technologies and products. In addition to the impacts on IT systems, it reflects the implications on organizational structures and governance. Furthermore, the iSOAMM lists the challenges, benefits and risks associated with each maturity level. This enables enterprises to select the most adequate maturity level for them, which is not necessarily the highest one.},\n address = {Berlin, Heidelberg},\n author = {Rathfelder, Christoph and Groenda, Henning},\n booktitle = {Proceedings of the 8th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS 2008)},\n day = {4--6},\n location = {Olso, Norway},\n month = {June},\n pages = {1--15},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/493.pdf},\n publisher = {Springer-Verlag},\n series = {Lecture Notes in Computer Science (LNCS)},\n title = {i{SOAMM}: {A}n independent {SOA} {M}aturity {M}odel},\n url = {http://www.springerlink.com/content/p38u564015713h55/?p=2777c4e8e3d6487e8f1e11de52f10f91&pi=1},\n volume = {5053/2008},\n year = {2008},\n}\n\n','\n\nChristoph Rathfelder and Henning Groenda.\niSOAMM: An independent SOA Maturity Model.\nIn Proceedings of the 8th IFIP International Conference on\nDistributed Applications and Interoperable Systems (DAIS 2008), Olso,\nNorway, June 4-6, 2008, volume 5053/2008 of Lecture Notes in Computer\nScience (LNCS), pages 1-15. Springer-Verlag, Berlin, Heidelberg.\nJune 2008.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{rathfelder2008a,\nabstract = {The implementation of an enterprise-wide Service Oriented Architecture (SOA) is a complex task. In most cases, evolutional approaches are used to handle this complexity. Maturity models are a possibility to plan and control such an evolution as they allow evaluating the current maturity and identifying current shortcomings. In order to support an SOA implementation, maturity models should also support in the selection of the most adequate maturity level and the deduction of a roadmap to this level. Existing SOA maturity models provide only weak assistance with the selection of an adequate maturity level. Most of them are developed by vendors of SOA products and often used to promote their products. In this paper, we introduce our independent SOA Maturity Model (iSOAMM), which is independent of the used technologies and products. In addition to the impacts on IT systems, it reflects the implications on organizational structures and governance. Furthermore, the iSOAMM lists the challenges, benefits and risks associated with each maturity level. This enables enterprises to select the most adequate maturity level for them, which is not necessarily the highest one.},\naddress = {Berlin, Heidelberg},\nauthor = {Rathfelder, Christoph and Groenda, Henning},\nbooktitle = {Proceedings of the 8th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS 2008)},\nday = {4--6},\nlocation = {Olso, Norway},\nmonth = {June},\npages = {1--15},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/493.pdf},\npublisher = {Springer-Verlag},\nseries = {Lecture Notes in Computer Science (LNCS)},\ntitle = {i{SOAMM}: {A}n independent {SOA} {M}aturity {M}odel},\nurl = {http://www.springerlink.com/content/p38u564015713h55/?p=2777c4e8e3d6487e8f1e11de52f10f91&pi=1},\nvolume = {5053/2008},\nyear = {2008}\n}\n
\n
\nThe implementation of an enterprise-wide Service Oriented Architecture (SOA) is a complex task. In most cases, evolutional approaches are used to handle this complexity. Maturity models are a possibility to plan and control such an evolution as they allow evaluating the current maturity and identifying current shortcomings. In order to support an SOA implementation, maturity models should also support in the selection of the most adequate maturity level and the deduction of a roadmap to this level. Existing SOA maturity models provide only weak assistance with the selection of an adequate maturity level. Most of them are developed by vendors of SOA products and often used to promote their products. In this paper, we introduce our independent SOA Maturity Model (iSOAMM), which is independent of the used technologies and products. In addition to the impacts on IT systems, it reflects the implications on organizational structures and governance. Furthermore, the iSOAMM lists the challenges, benefits and risks associated with each maturity level. This enables enterprises to select the most adequate maturity level for them, which is not necessarily the highest one.\n
\n','
\n@inproceedings{rathfelder2008a,\n  abstract = {The implementation of an enterprise-wide Service Oriented Architecture (SOA) is a complex task. In most cases, evolutional approaches are used to handle this complexity. Maturity models are a possibility to plan and control such an evolution as they allow evaluating the current maturity and identifying current shortcomings. In order to support an SOA implementation, maturity models should also support in the selection of the most adequate maturity level and the deduction of a roadmap to this level. Existing SOA maturity models provide only weak assistance with the selection of an adequate maturity level. Most of them are developed by vendors of SOA products and often used to promote their products. In this paper, we introduce our independent SOA Maturity Model (iSOAMM), which is independent of the used technologies and products. In addition to the impacts on IT systems, it reflects the implications on organizational structures and governance. Furthermore, the iSOAMM lists the challenges, benefits and risks associated with each maturity level. This enables enterprises to select the most adequate maturity level for them, which is not necessarily the highest one.},\n  address = {Berlin, Heidelberg},\n  author = {Rathfelder, Christoph and Groenda, Henning},\n  booktitle = {Proceedings of the 8th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS 2008)},\n  day = {4--6},\n  location = {Olso, Norway},\n  month = {June},\n  pages = {1--15},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/493.pdf},\n  publisher = {Springer-Verlag},\n  series = {Lecture Notes in Computer Science (LNCS)},\n  title = {i{SOAMM}: {A}n independent {SOA} {M}aturity {M}odel},\n  url = {http://www.springerlink.com/content/p38u564015713h55/?p=2777c4e8e3d6487e8f1e11de52f10f91&pi=1},\n  volume = {5053/2008},\n  year = {2008}\n}\n
\n\n','The implementation of an enterprise-wide Service Oriented Architecture (SOA) is a complex task. In most cases, evolutional approaches are used to handle this complexity. Maturity models are a possibility to plan and control such an evolution as they allow evaluating the current maturity and identifying current shortcomings. In order to support an SOA implementation, maturity models should also support in the selection of the most adequate maturity level and the deduction of a roadmap to this level. Existing SOA maturity models provide only weak assistance with the selection of an adequate maturity level. Most of them are developed by vendors of SOA products and often used to promote their products. In this paper, we introduce our independent SOA Maturity Model (iSOAMM), which is independent of the used technologies and products. In addition to the impacts on IT systems, it reflects the implications on organizational structures and governance. Furthermore, the iSOAMM lists the challenges, benefits and risks associated with each maturity level. This enables enterprises to select the most adequate maturity level for them, which is not necessarily the highest one.','i{SOAMM}: {A}n independent {SOA} {M}aturity {M}odel',0,6,2008,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(494,'paper','rathfelder2008c','article','@article{rathfelder2008c,\n address = {Bonn, Germany},\n author = {Christoph Rathfelder and Henning Groenda},\n journal = {Softwaretechnik-Trends},\n month = {November},\n number = {4},\n pages = {3--7},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/494.pdf},\n publisher = {GI (Gesellschaft fuer Informatik)},\n timestamp = {2009.01.19},\n title = {{T}owards an {A}rchitecture {M}aintainability {M}aturity {M}odel ({AM}3)},\n volume = {28},\n year = {2008},\n}\n\n','\n\nChristoph Rathfelder and Henning Groenda.\nTowards an Architecture Maintainability Maturity Model\n(AM3).\nSoftwaretechnik-Trends, 28(4):3-7, November 2008, GI\n(Gesellschaft fuer Informatik), Bonn, Germany.\n[ bib | .pdf  ] 
\n@article{rathfelder2008c,\naddress = {Bonn, Germany},\nauthor = {Christoph Rathfelder and Henning Groenda},\njournal = {Softwaretechnik-Trends},\nmonth = {November},\nnumber = {4},\npages = {3--7},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/494.pdf},\npublisher = {GI (Gesellschaft fuer Informatik)},\ntimestamp = {2009.01.19},\ntitle = {{T}owards an {A}rchitecture {M}aintainability {M}aturity {M}odel ({AM}3)},\nvolume = {28},\nyear = {2008}\n}\n
\n
\n','
\n@article{rathfelder2008c,\n  address = {Bonn, Germany},\n  author = {Christoph Rathfelder and Henning Groenda},\n  journal = {Softwaretechnik-Trends},\n  month = {November},\n  number = {4},\n  pages = {3--7},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/494.pdf},\n  publisher = {GI (Gesellschaft fuer Informatik)},\n  timestamp = {2009.01.19},\n  title = {{T}owards an {A}rchitecture {M}aintainability {M}aturity {M}odel ({AM}3)},\n  volume = {28},\n  year = {2008}\n}\n
\n\n',NULL,'{T}owards an {A}rchitecture {M}aintainability {M}aturity {M}odel ({AM}3)',0,11,2008,11,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(495,'paper','rathfelder2007c','inproceedings','@inproceedings{rathfelder2007c,\n abstract = {Service-Orientierte Architekturen (SOAs) versprechen eine bessere Unterst\\\"{u}tzung von Gesch\\\"{a}ftsprozessen. Es gibt jedoch unterschiedliche Interpretationen dar\\\"{u}ber, was eine Service-Orientierte Architektur (SOA) ist. Da die Verbesserung der Gesch\\\"{a}ftsprozessunterst\\\"{u}tzung eines der h\\\"{a}ufigsten Argumente f\\\"{u}r SOAs ist, bietet es sich an, die verschiedenen SOA-Varianten nach der damit erm\\\"{o}glichten Prozessunterst\\\"{u}tzung zu kategorisieren. Bisherige Ans\\\"{a}tze zur Kategorisierung sind in vielen F\\\"{a}llen auf bestimmte Technologien oder Standards beschr\\\"{a}nkt und gehen nur am Rand auf die gegebene Prozessunterst\\\"{u}tzung ein. In diesem Artikel wird eine solche gesch\\\"{a}ftsprozessorientierte Kategorisierung von SOAs pr\\\"{a}sentiert.},\n author = {Rathfelder, Christoph and Groenda, Henning},\n booktitle = {2. Workshop Bewertungsaspekte serviceorientierter Architekturen},\n day = {13},\n location = {Karlsruhe, Germany},\n month = {November},\n pages = {11--22},\n pdf = {http://www.fzi.de/images/files/pub/SOA_Kategorisierung.pdf},\n publisher = {SHAKER Verlag},\n title = {{G}esch\\\"{a}ftsprozessorientierte {K}ategorisierung von {SOA}},\n year = {2007},\n}\n\n','\n\nChristoph Rathfelder and Henning Groenda.\nGeschäftsprozessorientierte Kategorisierung von SOA.\nIn 2. Workshop Bewertungsaspekte serviceorientierter\nArchitekturen, Karlsruhe, Germany, November 13, 2007, pages 11-22. SHAKER\nVerlag.\nNovember 2007.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{rathfelder2007c,\nabstract = {Service-Orientierte Architekturen (SOAs) versprechen eine bessere Unterst\\\"{u}tzung von Gesch\\\"{a}ftsprozessen. Es gibt jedoch unterschiedliche Interpretationen dar\\\"{u}ber, was eine Service-Orientierte Architektur (SOA) ist. Da die Verbesserung der Gesch\\\"{a}ftsprozessunterst\\\"{u}tzung eines der h\\\"{a}ufigsten Argumente f\\\"{u}r SOAs ist, bietet es sich an, die verschiedenen SOA-Varianten nach der damit erm\\\"{o}glichten Prozessunterst\\\"{u}tzung zu kategorisieren. Bisherige Ans\\\"{a}tze zur Kategorisierung sind in vielen F\\\"{a}llen auf bestimmte Technologien oder Standards beschr\\\"{a}nkt und gehen nur am Rand auf die gegebene Prozessunterst\\\"{u}tzung ein. In diesem Artikel wird eine solche gesch\\\"{a}ftsprozessorientierte Kategorisierung von SOAs pr\\\"{a}sentiert.},\nauthor = {Rathfelder, Christoph and Groenda, Henning},\nbooktitle = {2. Workshop Bewertungsaspekte serviceorientierter Architekturen},\nday = {13},\nlocation = {Karlsruhe, Germany},\nmonth = {November},\npages = {11--22},\npdf = {http://www.fzi.de/images/files/pub/SOA_Kategorisierung.pdf},\npublisher = {SHAKER Verlag},\ntitle = {{G}esch\\\"{a}ftsprozessorientierte {K}ategorisierung von {SOA}},\nyear = {2007}\n}\n
\n
\nService-Orientierte Architekturen (SOAs) versprechen eine bessere Unterstützung von Geschäftsprozessen. Es gibt jedoch unterschiedliche Interpretationen darüber, was eine Service-Orientierte Architektur (SOA) ist. Da die Verbesserung der Geschäftsprozessunterstützung eines der häufigsten Argumente für SOAs ist, bietet es sich an, die verschiedenen SOA-Varianten nach der damit ermöglichten Prozessunterstützung zu kategorisieren. Bisherige Ansätze zur Kategorisierung sind in vielen Fällen auf bestimmte Technologien oder Standards beschränkt und gehen nur am Rand auf die gegebene Prozessunterstützung ein. In diesem Artikel wird eine solche geschäftsprozessorientierte Kategorisierung von SOAs präsentiert.\n
\n','
\n@inproceedings{rathfelder2007c,\n  abstract = {Service-Orientierte Architekturen (SOAs) versprechen eine bessere Unterst\\\"{u}tzung von Gesch\\\"{a}ftsprozessen. Es gibt jedoch unterschiedliche Interpretationen dar\\\"{u}ber, was eine Service-Orientierte Architektur (SOA) ist. Da die Verbesserung der Gesch\\\"{a}ftsprozessunterst\\\"{u}tzung eines der h\\\"{a}ufigsten Argumente f\\\"{u}r SOAs ist, bietet es sich an, die verschiedenen SOA-Varianten nach der damit erm\\\"{o}glichten Prozessunterst\\\"{u}tzung zu kategorisieren. Bisherige Ans\\\"{a}tze zur Kategorisierung sind in vielen F\\\"{a}llen auf bestimmte Technologien oder Standards beschr\\\"{a}nkt und gehen nur am Rand auf die gegebene Prozessunterst\\\"{u}tzung ein. In diesem Artikel wird eine solche gesch\\\"{a}ftsprozessorientierte Kategorisierung von SOAs pr\\\"{a}sentiert.},\n  author = {Rathfelder, Christoph and Groenda, Henning},\n  booktitle = {2. Workshop Bewertungsaspekte serviceorientierter Architekturen},\n  day = {13},\n  location = {Karlsruhe, Germany},\n  month = {November},\n  pages = {11--22},\n  pdf = {http://www.fzi.de/images/files/pub/SOA_Kategorisierung.pdf},\n  publisher = {SHAKER Verlag},\n  title = {{G}esch\\\"{a}ftsprozessorientierte {K}ategorisierung von {SOA}},\n  year = {2007}\n}\n
\n\n','Service-Orientierte Architekturen (SOAs) versprechen eine bessere Unterst\\\"{u}tzung von Gesch\\\"{a}ftsprozessen. Es gibt jedoch unterschiedliche Interpretationen dar\\\"{u}ber, was eine Service-Orientierte Architektur (SOA) ist. Da die Verbesserung der Gesch\\\"{a}ftsprozessunterst\\\"{u}tzung eines der h\\\"{a}ufigsten Argumente f\\\"{u}r SOAs ist, bietet es sich an, die verschiedenen SOA-Varianten nach der damit erm\\\"{o}glichten Prozessunterst\\\"{u}tzung zu kategorisieren. Bisherige Ans\\\"{a}tze zur Kategorisierung sind in vielen F\\\"{a}llen auf bestimmte Technologien oder Standards beschr\\\"{a}nkt und gehen nur am Rand auf die gegebene Prozessunterst\\\"{u}tzung ein. In diesem Artikel wird eine solche gesch\\\"{a}ftsprozessorientierte Kategorisierung von SOAs pr\\\"{a}sentiert.','{G}esch\\\"{a}ftsprozessorientierte {K}ategorisierung von {SOA}',0,11,2007,11,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 10:14:37',0),(496,'paper','rathfelder2008b','incollection','@incollection{rathfelder2008b,\n author = {Christoph Rathfelder and Henning Groenda and Ralf Reussner},\n booktitle = {Industrialisierung des Software-Managements: Fachtagung des GI-Fachausschusses Management der Anwendungsentwicklung und -Wartung im Fachbereich Wirtschaftsinformatik (WI-MAW)},\n day = {12--14},\n editor = {Georg Herzwurm and Martin Mikusz},\n isbn = {978-3-88579-233-8, 3-88579-383-0},\n location = {Stuttgart, Germany},\n month = {November},\n pages = {169--180},\n series = {Lecture Notes in Informatics (LNI)},\n title = {{S}oftware {I}ndustrialization and {A}rchitecture {C}ertification},\n volume = {139},\n year = {2008},\n}\n\n','\n\nChristoph Rathfelder, Henning Groenda, and Ralf Reussner.\nSoftware Industrialization and Architecture Certification.\nIn Industrialisierung des Software-Managements: Fachtagung des\nGI-Fachausschusses Management der Anwendungsentwicklung und -Wartung im\nFachbereich Wirtschaftsinformatik (WI-MAW), Georg Herzwurm and Martin\nMikusz, editors, volume 139 of Lecture Notes in Informatics (LNI),\npages 169-180. November 2008.\n[ bib  ] 
\n@incollection{rathfelder2008b,\nauthor = {Christoph Rathfelder and Henning Groenda and Ralf Reussner},\nbooktitle = {Industrialisierung des Software-Managements: Fachtagung des GI-Fachausschusses Management der Anwendungsentwicklung und -Wartung im Fachbereich Wirtschaftsinformatik (WI-MAW)},\nday = {12--14},\neditor = {Georg Herzwurm and Martin Mikusz},\nisbn = {978-3-88579-233-8, 3-88579-383-0},\nlocation = {Stuttgart, Germany},\nmonth = {November},\npages = {169--180},\nseries = {Lecture Notes in Informatics (LNI)},\ntitle = {{S}oftware {I}ndustrialization and {A}rchitecture {C}ertification},\nvolume = {139},\nyear = {2008}\n}\n
\n
\n','
\n@incollection{rathfelder2008b,\n  author = {Christoph Rathfelder and Henning Groenda and Ralf Reussner},\n  booktitle = {Industrialisierung des Software-Managements: Fachtagung des GI-Fachausschusses Management der Anwendungsentwicklung und -Wartung im Fachbereich Wirtschaftsinformatik (WI-MAW)},\n  day = {12--14},\n  editor = {Georg Herzwurm and Martin Mikusz},\n  isbn = {978-3-88579-233-8, 3-88579-383-0},\n  location = {Stuttgart, Germany},\n  month = {November},\n  pages = {169--180},\n  series = {Lecture Notes in Informatics (LNI)},\n  title = {{S}oftware {I}ndustrialization and {A}rchitecture {C}ertification},\n  volume = {139},\n  year = {2008}\n}\n
\n\n',NULL,'{S}oftware {I}ndustrialization and {A}rchitecture {C}ertification',0,11,2008,11,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(497,'paper','rathfelder2011a','inproceedings','@inproceedings{rathfelder2011a,\n abstract = {Today, software engineering is challenged to handle more and more large-scale distributed systems with a guaranteed level of service quality. Component-based architectures have been established to build more structured and manageable software systems. However, due to time and cost constraints, it is not feasible to use a trial and error approach to ensure that an architecture meets the quality of service (QoS) requirements. In this tool demo, we present the Palladio Workbench that permits the modeling of component-based software architectures and the prediction of its quality characteristics (e.g., response time and utilization). Additional to a general tool overview, we will give some insights about a new feature to analyze the impact of event-driven communication that was added in the latest release of the Palladio Component Model (PCM)},\n address = {Washington, DC, USA},\n author = {Rathfelder, Christoph and Klatt, Benjamin},\n booktitle = {Proceedings of the 2011 Ninth Working IEEE/IFIP Conference on Software Architecture (WICSA 2011)},\n day = {20--24},\n doi = {http://dx.doi.org/10.1109/WICSA.2011.55},\n isbn = {978-0-7695-4351-2},\n location = {Boulder, Colorado, USA},\n month = {June},\n pages = {347--350},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/497.pdf},\n publisher = {IEEE Computer Society},\n title = {Palladio Workbench: A Quality-Prediction Tool for Component-Based Architectures},\n url = {http://dx.doi.org/10.1109/WICSA.2011.55},\n year = {2011},\n}\n\n','\n\nChristoph Rathfelder and Benjamin Klatt.\nPalladio workbench: A quality-prediction tool for component-based\narchitectures.\nIn Proceedings of the 2011 Ninth Working IEEE/IFIP Conference on\nSoftware Architecture (WICSA 2011), Boulder, Colorado, USA, June 20-24,\n2011, pages 347-350. IEEE Computer Society, Washington, DC, USA.\nJune 2011.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{rathfelder2011a,\nabstract = {Today, software engineering is challenged to handle more and more large-scale distributed systems with a guaranteed level of service quality. Component-based architectures have been established to build more structured and manageable software systems. However, due to time and cost constraints, it is not feasible to use a trial and error approach to ensure that an architecture meets the quality of service (QoS) requirements. In this tool demo, we present the Palladio Workbench that permits the modeling of component-based software architectures and the prediction of its quality characteristics (e.g., response time and utilization). Additional to a general tool overview, we will give some insights about a new feature to analyze the impact of event-driven communication that was added in the latest release of the Palladio Component Model (PCM)},\naddress = {Washington, DC, USA},\nauthor = {Rathfelder, Christoph and Klatt, Benjamin},\nbooktitle = {Proceedings of the 2011 Ninth Working IEEE/IFIP Conference on Software Architecture (WICSA 2011)},\nday = {20--24},\ndoi = {http://dx.doi.org/10.1109/WICSA.2011.55},\nisbn = {978-0-7695-4351-2},\nlocation = {Boulder, Colorado, USA},\nmonth = {June},\npages = {347--350},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/497.pdf},\npublisher = {IEEE Computer Society},\ntitle = {Palladio Workbench: A Quality-Prediction Tool for Component-Based Architectures},\nurl = {http://dx.doi.org/10.1109/WICSA.2011.55},\nyear = {2011}\n}\n
\n
\nToday, software engineering is challenged to handle more and more large-scale distributed systems with a guaranteed level of service quality. Component-based architectures have been established to build more structured and manageable software systems. However, due to time and cost constraints, it is not feasible to use a trial and error approach to ensure that an architecture meets the quality of service (QoS) requirements. In this tool demo, we present the Palladio Workbench that permits the modeling of component-based software architectures and the prediction of its quality characteristics (e.g., response time and utilization). Additional to a general tool overview, we will give some insights about a new feature to analyze the impact of event-driven communication that was added in the latest release of the Palladio Component Model (PCM)\n
\n','
\n@inproceedings{rathfelder2011a,\n  abstract = {Today, software engineering is challenged to handle more and more large-scale distributed systems with a guaranteed level of service quality. Component-based architectures have been established to build more structured and manageable software systems. However, due to time and cost constraints, it is not feasible to use a trial and error approach to ensure that an architecture meets the quality of service (QoS) requirements. In this tool demo, we present the Palladio Workbench that permits the modeling of component-based software architectures and the prediction of its quality characteristics (e.g., response time and utilization). Additional to a general tool overview, we will give some insights about a new feature to analyze the impact of event-driven communication that was added in the latest release of the Palladio Component Model (PCM)},\n  address = {Washington, DC, USA},\n  author = {Rathfelder, Christoph and Klatt, Benjamin},\n  booktitle = {Proceedings of the 2011 Ninth Working IEEE/IFIP Conference on Software Architecture (WICSA 2011)},\n  day = {20--24},\n  doi = {http://dx.doi.org/10.1109/WICSA.2011.55},\n  isbn = {978-0-7695-4351-2},\n  location = {Boulder, Colorado, USA},\n  month = {June},\n  pages = {347--350},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/497.pdf},\n  publisher = {IEEE Computer Society},\n  title = {Palladio Workbench: A Quality-Prediction Tool for Component-Based Architectures},\n  url = {http://dx.doi.org/10.1109/WICSA.2011.55},\n  year = {2011}\n}\n
\n\n','Today, software engineering is challenged to handle more and more large-scale distributed systems with a guaranteed level of service quality. Component-based architectures have been established to build more structured and manageable software systems. However, due to time and cost constraints, it is not feasible to use a trial and error approach to ensure that an architecture meets the quality of service (QoS) requirements. In this tool demo, we present the Palladio Workbench that permits the modeling of component-based software architectures and the prediction of its quality characteristics (e.g., response time and utilization). Additional to a general tool overview, we will give some insights about a new feature to analyze the impact of event-driven communication that was added in the latest release of the Palladio Component Model (PCM)','Palladio Workbench: A Quality-Prediction Tool for Component-Based Architectures',0,6,2011,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(498,'paper','rathfelder2010c','book','@book{rathfelder2010c,\n abstract = {With the introduction of services, systems become more flexible as new services can easily be composed out of existing services. Services are increasingly used in mission-critical systems and applications and therefore considering Quality of Service (QoS) properties is an essential part of the service selection. Quality prediction techniques support the service provider in determining possible QoS levels that can be guaranteed to a customer or in deriving the operation costs induced by a certain QoS level. In this chapter, we present an overview on our work on modeling service-oriented systems for performance prediction using the Palladio Component Model. The prediction builds upon a model of a service-based system, and evaluates this model in order to determine the expected service quality. The presented techniques allow for early quality prediction, without the need for the system being already deployed and operating. We present the integration of our prediction approach into an SLA management framework. The emerging trend to combine event-based communication and Service-Oriented Architecture (SOA) into Event-based SOA (ESOA) induces new challenges to our approach, which are topic of a special subsection.},\n address = {Hershey, PA, USA},\n author = {Christoph Rathfelder and Benjamin Klatt and Franz Brosch and Samuel Kounev},\n booktitle = {{Handbook of Research on Service-Oriented Systems and Non-Functional Properties: Future Directions}},\n doi = {10.4018/978-1-61350-432-1},\n editor = {Stephan Reiff-Marganiec and Marcel Tilly},\n isbn = {9781613504321},\n month = {December},\n pages = {258--279},\n publisher = {IGI Global},\n title = {{P}erformance {M}odeling for {Q}uality of {S}ervice {P}rediction in {S}ervice-{O}riented {S}ystems},\n url = {http://www.igi-global.com/chapter/handbook-research-service-oriented-systems/60889},\n year = {2011},\n}\n\n','\n\nChristoph Rathfelder, Benjamin Klatt, Franz Brosch, and Samuel Kounev.\nPerformance Modeling for Quality of Service Prediction\nin Service-Oriented Systems.\nIGI Global, Hershey, PA, USA, December 2011.\n[ bib | DOI | http | Abstract  ] 
\n@book{rathfelder2010c,\nabstract = {With the introduction of services, systems become more flexible as new services can easily be composed out of existing services. Services are increasingly used in mission-critical systems and applications and therefore considering Quality of Service (QoS) properties is an essential part of the service selection. Quality prediction techniques support the service provider in determining possible QoS levels that can be guaranteed to a customer or in deriving the operation costs induced by a certain QoS level. In this chapter, we present an overview on our work on modeling service-oriented systems for performance prediction using the Palladio Component Model. The prediction builds upon a model of a service-based system, and evaluates this model in order to determine the expected service quality. The presented techniques allow for early quality prediction, without the need for the system being already deployed and operating. We present the integration of our prediction approach into an SLA management framework. The emerging trend to combine event-based communication and Service-Oriented Architecture (SOA) into Event-based SOA (ESOA) induces new challenges to our approach, which are topic of a special subsection.},\naddress = {Hershey, PA, USA},\nauthor = {Christoph Rathfelder and Benjamin Klatt and Franz Brosch and Samuel Kounev},\nbooktitle = {{Handbook of Research on Service-Oriented Systems and Non-Functional Properties: Future Directions}},\ndoi = {10.4018/978-1-61350-432-1},\neditor = {Stephan Reiff-Marganiec and Marcel Tilly},\nisbn = {9781613504321},\nmonth = {December},\npages = {258--279},\npublisher = {IGI Global},\ntitle = {{P}erformance {M}odeling for {Q}uality of {S}ervice {P}rediction in {S}ervice-{O}riented {S}ystems},\nurl = {http://www.igi-global.com/chapter/handbook-research-service-oriented-systems/60889},\nyear = {2011}\n}\n
\n
\nWith the introduction of services, systems become more flexible as new services can easily be composed out of existing services. Services are increasingly used in mission-critical systems and applications and therefore considering Quality of Service (QoS) properties is an essential part of the service selection. Quality prediction techniques support the service provider in determining possible QoS levels that can be guaranteed to a customer or in deriving the operation costs induced by a certain QoS level. In this chapter, we present an overview on our work on modeling service-oriented systems for performance prediction using the Palladio Component Model. The prediction builds upon a model of a service-based system, and evaluates this model in order to determine the expected service quality. The presented techniques allow for early quality prediction, without the need for the system being already deployed and operating. We present the integration of our prediction approach into an SLA management framework. The emerging trend to combine event-based communication and Service-Oriented Architecture (SOA) into Event-based SOA (ESOA) induces new challenges to our approach, which are topic of a special subsection.\n
\n','
\n@book{rathfelder2010c,\n  abstract = {With the introduction of services, systems become more flexible as new services can easily be composed out of existing services. Services are increasingly used in mission-critical systems and applications and therefore considering Quality of Service (QoS) properties is an essential part of the service selection. Quality prediction techniques support the service provider in determining possible QoS levels that can be guaranteed to a customer or in deriving the operation costs induced by a certain QoS level. In this chapter, we present an overview on our work on modeling service-oriented systems for performance prediction using the Palladio Component Model. The prediction builds upon a model of a service-based system, and evaluates this model in order to determine the expected service quality. The presented techniques allow for early quality prediction, without the need for the system being already deployed and operating. We present the integration of our prediction approach into an SLA management framework. The emerging trend to combine event-based communication and Service-Oriented Architecture (SOA) into Event-based SOA (ESOA) induces new challenges to our approach, which are topic of a special subsection.},\n  address = {Hershey, PA, USA},\n  author = {Christoph Rathfelder and Benjamin Klatt and Franz Brosch and Samuel Kounev},\n  booktitle = {{Handbook of Research on Service-Oriented Systems and Non-Functional Properties: Future Directions}},\n  doi = {10.4018/978-1-61350-432-1},\n  editor = {Stephan Reiff-Marganiec and Marcel Tilly},\n  isbn = {9781613504321},\n  month = {December},\n  pages = {258--279},\n  publisher = {IGI Global},\n  title = {{P}erformance {M}odeling for {Q}uality of {S}ervice {P}rediction in {S}ervice-{O}riented {S}ystems},\n  url = {http://www.igi-global.com/chapter/handbook-research-service-oriented-systems/60889},\n  year = {2011}\n}\n
\n\n','With the introduction of services, systems become more flexible as new services can easily be composed out of existing services. Services are increasingly used in mission-critical systems and applications and therefore considering Quality of Service (QoS) properties is an essential part of the service selection. Quality prediction techniques support the service provider in determining possible QoS levels that can be guaranteed to a customer or in deriving the operation costs induced by a certain QoS level. In this chapter, we present an overview on our work on modeling service-oriented systems for performance prediction using the Palladio Component Model. The prediction builds upon a model of a service-based system, and evaluates this model in order to determine the expected service quality. The presented techniques allow for early quality prediction, without the need for the system being already deployed and operating. We present the integration of our prediction approach into an SLA management framework. The emerging trend to combine event-based communication and Service-Oriented Architecture (SOA) into Event-based SOA (ESOA) induces new challenges to our approach, which are topic of a special subsection.','{P}erformance {M}odeling for {Q}uality of {S}ervice {P}rediction in {S}ervice-{O}riented {S}ystems',0,12,2011,12,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(499,'paper','rathfelder2011b','incollection','@incollection{rathfelder2011b,\n address = {New York},\n author = {Rathfelder, Christoph and Klatt, Benjamin and Falcone, Giovanni},\n booktitle = {{Service Level Agreements for Cloud Computing}},\n editor = {Wieder, Philipp and Butler, Joe M. and Theilmann, Wolfgang and Yahyapour, Ramin},\n isbn = {978-1-4614-1614-2},\n pages = {27--40},\n publisher = {Springer},\n title = {The Open Reference Case A Reference Use Case for the SLA@SOI Framework},\n url = {http://dx.doi.org/10.1007/978-1-4614-1614-2_3},\n year = {2011},\n}\n\n','\n\nChristoph Rathfelder, Benjamin Klatt, and Giovanni Falcone.\nThe open reference case a reference use case for the sla@soi\nframework.\nIn Service Level Agreements for Cloud Computing, Philipp\nWieder, Joe M. Butler, Wolfgang Theilmann, and Ramin Yahyapour, editors,\npages 27-40. Springer, New York, 2011.\n[ bib | http  ] 
\n@incollection{rathfelder2011b,\naddress = {New York},\nauthor = {Rathfelder, Christoph and Klatt, Benjamin and Falcone, Giovanni},\nbooktitle = {{Service Level Agreements for Cloud Computing}},\neditor = {Wieder, Philipp and Butler, Joe M. and Theilmann, Wolfgang and Yahyapour, Ramin},\nisbn = {978-1-4614-1614-2},\npages = {27--40},\npublisher = {Springer},\ntitle = {The Open Reference Case A Reference Use Case for the SLA@SOI Framework},\nurl = {http://dx.doi.org/10.1007/978-1-4614-1614-2_3},\nyear = {2011}\n}\n
\n
\n','
\n@incollection{rathfelder2011b,\n  address = {New York},\n  author = {Rathfelder, Christoph and Klatt, Benjamin and Falcone, Giovanni},\n  booktitle = {{Service Level Agreements for Cloud Computing}},\n  editor = {Wieder, Philipp and Butler, Joe M. and Theilmann, Wolfgang and Yahyapour, Ramin},\n  isbn = {978-1-4614-1614-2},\n  pages = {27--40},\n  publisher = {Springer},\n  title = {The Open Reference Case A Reference Use Case for the SLA@SOI Framework},\n  url = {http://dx.doi.org/10.1007/978-1-4614-1614-2_3},\n  year = {2011}\n}\n
\n\n',NULL,'The Open Reference Case A Reference Use Case for the SLA@SOI Framework',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(500,'paper','rathfelder2010b','inproceedings','@inproceedings{rathfelder2010b,\n abstract = {The event-based communication paradigm is becoming increasingly ubiquitous as an enabling technology for building loosely-coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to predict their performance under load. Most general purpose performance meta-models for component-based systems provide limited support for modelling event-based communication and neglect middleware-specific influence factors. In this poster, we present an extension of our approach to modelling event-based communication in the context of the Palladio Component Model (PCM), allowing to take into account middleware-specific influence factors. The latter are captured in a separate model automatically woven into the PCM instance by means of a model-to-model transformation. As a second contribution, we present a short case study of a real-life road traffic monitoring system showing how event-based communication can be modelled for performance prediction and capacity planning.},\n address = {New York, NY, USA},\n author = {Rathfelder, Christoph and Klatt, Benjamin and Kounev, Samuel and Evans, David},\n booktitle = {Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems (DEBS 2010)},\n day = {12--15},\n doi = {http://doi.acm.org/10.1145/1827418.1827437},\n isbn = {978-1-60558-927-5},\n location = {Cambridge, United Kingdom},\n month = {July},\n pages = {97--98},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/500.pdf},\n publisher = {ACM},\n title = {{Towards Middleware-Aware Integration of Event-based Communication into the Palladio Component Model}},\n titleaddon = {{(Poster Paper)}},\n url = {http://doi.acm.org/10.1145/1827418.1827437},\n year = {2010},\n}\n\n','\n\nChristoph Rathfelder, Benjamin Klatt, Samuel Kounev, and David Evans.\nTowards Middleware-Aware Integration of Event-based Communication\ninto the Palladio Component Model (Poster Paper).\nIn Proceedings of the Fourth ACM International Conference on\nDistributed Event-Based Systems (DEBS 2010), Cambridge, United Kingdom, July\n12-15, 2010, pages 97-98. ACM, New York, NY, USA.\nJuly 2010.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{rathfelder2010b,\nabstract = {The event-based communication paradigm is becoming increasingly ubiquitous as an enabling technology for building loosely-coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to predict their performance under load. Most general purpose performance meta-models for component-based systems provide limited support for modelling event-based communication and neglect middleware-specific influence factors. In this poster, we present an extension of our approach to modelling event-based communication in the context of the Palladio Component Model (PCM), allowing to take into account middleware-specific influence factors. The latter are captured in a separate model automatically woven into the PCM instance by means of a model-to-model transformation. As a second contribution, we present a short case study of a real-life road traffic monitoring system showing how event-based communication can be modelled for performance prediction and capacity planning.},\naddress = {New York, NY, USA},\nauthor = {Rathfelder, Christoph and Klatt, Benjamin and Kounev, Samuel and Evans, David},\nbooktitle = {Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems (DEBS 2010)},\nday = {12--15},\ndoi = {http://doi.acm.org/10.1145/1827418.1827437},\nisbn = {978-1-60558-927-5},\nlocation = {Cambridge, United Kingdom},\nmonth = {July},\npages = {97--98},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/500.pdf},\npublisher = {ACM},\ntitle = {{Towards Middleware-Aware Integration of Event-based Communication into the Palladio Component Model}},\ntitleaddon = {{(Poster Paper)}},\nurl = {http://doi.acm.org/10.1145/1827418.1827437},\nyear = {2010}\n}\n
\n
\nThe event-based communication paradigm is becoming increasingly ubiquitous as an enabling technology for building loosely-coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to predict their performance under load. Most general purpose performance meta-models for component-based systems provide limited support for modelling event-based communication and neglect middleware-specific influence factors. In this poster, we present an extension of our approach to modelling event-based communication in the context of the Palladio Component Model (PCM), allowing to take into account middleware-specific influence factors. The latter are captured in a separate model automatically woven into the PCM instance by means of a model-to-model transformation. As a second contribution, we present a short case study of a real-life road traffic monitoring system showing how event-based communication can be modelled for performance prediction and capacity planning.\n
\n','
\n@inproceedings{rathfelder2010b,\n  abstract = {The event-based communication paradigm is becoming increasingly ubiquitous as an enabling technology for building loosely-coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to predict their performance under load. Most general purpose performance meta-models for component-based systems provide limited support for modelling event-based communication and neglect middleware-specific influence factors. In this poster, we present an extension of our approach to modelling event-based communication in the context of the Palladio Component Model (PCM), allowing to take into account middleware-specific influence factors. The latter are captured in a separate model automatically woven into the PCM instance by means of a model-to-model transformation. As a second contribution, we present a short case study of a real-life road traffic monitoring system showing how event-based communication can be modelled for performance prediction and capacity planning.},\n  address = {New York, NY, USA},\n  author = {Rathfelder, Christoph and Klatt, Benjamin and Kounev, Samuel and Evans, David},\n  booktitle = {Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems (DEBS 2010)},\n  day = {12--15},\n  doi = {http://doi.acm.org/10.1145/1827418.1827437},\n  isbn = {978-1-60558-927-5},\n  location = {Cambridge, United Kingdom},\n  month = {July},\n  pages = {97--98},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/500.pdf},\n  publisher = {ACM},\n  title = {{Towards Middleware-Aware Integration of Event-based Communication into the Palladio Component Model}},\n  titleaddon = {{(Poster Paper)}},\n  url = {http://doi.acm.org/10.1145/1827418.1827437},\n  year = {2010}\n}\n
\n\n','The event-based communication paradigm is becoming increasingly ubiquitous as an enabling technology for building loosely-coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to predict their performance under load. Most general purpose performance meta-models for component-based systems provide limited support for modelling event-based communication and neglect middleware-specific influence factors. In this poster, we present an extension of our approach to modelling event-based communication in the context of the Palladio Component Model (PCM), allowing to take into account middleware-specific influence factors. The latter are captured in a separate model automatically woven into the PCM instance by means of a model-to-model transformation. As a second contribution, we present a short case study of a real-life road traffic monitoring system showing how event-based communication can be modelled for performance prediction and capacity planning.','{Towards Middleware-Aware Integration of Event-based Communication into the Palladio Component Model}',0,7,2010,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(501,'paper','rathfelder2013a','article','@article{rathfelder2013a,\n author = {Christoph Rathfelder and Benjamin Klatt and Kai Sachs and Samuel Kounev},\n doi = {10.1007/s10270-013-0316-x},\n issn = {1619-1366},\n journal = {Journal of Software and Systems Modeling (SoSyM)},\n month = {March},\n pages = {1--27},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/501.pdf},\n publisher = {Springer Verlag},\n title = {Modeling Event-based Communication in Component-based Software Architectures for Performance Predictions},\n url = {http://dx.doi.org/10.1007/s10270-013-0316-x},\n year = {2013},\n}\n\n','\n\nChristoph Rathfelder, Benjamin Klatt, Kai Sachs, and Samuel Kounev.\nModeling event-based communication in component-based software\narchitectures for performance predictions.\nJournal of Software and Systems Modeling (SoSyM), pages 1-27,\nMarch 2013, Springer Verlag.\n[ bib | DOI | http | .pdf  ] 
\n@article{rathfelder2013a,\nauthor = {Christoph Rathfelder and Benjamin Klatt and Kai Sachs and Samuel Kounev},\ndoi = {10.1007/s10270-013-0316-x},\nissn = {1619-1366},\njournal = {Journal of Software and Systems Modeling (SoSyM)},\nmonth = {March},\npages = {1--27},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/501.pdf},\npublisher = {Springer Verlag},\ntitle = {Modeling Event-based Communication in Component-based Software Architectures for Performance Predictions},\nurl = {http://dx.doi.org/10.1007/s10270-013-0316-x},\nyear = {2013}\n}\n
\n
\n','
\n@article{rathfelder2013a,\n  author = {Christoph Rathfelder and Benjamin Klatt and Kai Sachs and Samuel Kounev},\n  doi = {10.1007/s10270-013-0316-x},\n  issn = {1619-1366},\n  journal = {Journal of Software and Systems Modeling (SoSyM)},\n  month = {March},\n  pages = {1--27},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/501.pdf},\n  publisher = {Springer Verlag},\n  title = {Modeling Event-based Communication in Component-based Software Architectures for Performance Predictions},\n  url = {http://dx.doi.org/10.1007/s10270-013-0316-x},\n  year = {2013}\n}\n
\n\n',NULL,'Modeling Event-based Communication in Component-based Software Architectures for Performance Predictions',0,3,2013,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(502,'paper','rathfelder2009','inproceedings','@inproceedings{rathfelder2009,\n abstract = {The event-driven communication paradigm provides a number of advantages for building loosely coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to estimate their behavior and performance under load. Most existing performance prediction techniques for systems using event-driven communication require specialized knowledge to build the necessary prediction models. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication and supports different performance prediction techniques.},\n address = {New York, NY, USA},\n author = {Rathfelder, Christoph and Kounev, Samuel},\n booktitle = {Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (DEBS 2009)},\n day = {6--9},\n doi = {http://doi.acm.org/10.1145/1619258.1619300},\n isbn = {978-1-60558-665-6},\n location = {Nashville, Tennessee},\n month = {July},\n pages = {33:1--33:2},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/502.pdf},\n publisher = {ACM},\n title = {{Model-Based Performance Prediction for Event-Driven Systems}},\n titleaddon = {{(Extended Abstract)}},\n url = {http://doi.acm.org/10.1145/1619258.1619300},\n year = {2009},\n}\n\n','\n\nChristoph Rathfelder and Samuel Kounev.\nModel-Based Performance Prediction for Event-Driven Systems\n(Extended Abstract).\nIn Proceedings of the Third ACM International Conference on\nDistributed Event-Based Systems (DEBS 2009), Nashville, Tennessee, July\n6-9, 2009, pages 33:1-33:2. ACM, New York, NY, USA.\nJuly 2009.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{rathfelder2009,\nabstract = {The event-driven communication paradigm provides a number of advantages for building loosely coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to estimate their behavior and performance under load. Most existing performance prediction techniques for systems using event-driven communication require specialized knowledge to build the necessary prediction models. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication and supports different performance prediction techniques.},\naddress = {New York, NY, USA},\nauthor = {Rathfelder, Christoph and Kounev, Samuel},\nbooktitle = {Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (DEBS 2009)},\nday = {6--9},\ndoi = {http://doi.acm.org/10.1145/1619258.1619300},\nisbn = {978-1-60558-665-6},\nlocation = {Nashville, Tennessee},\nmonth = {July},\npages = {33:1--33:2},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/502.pdf},\npublisher = {ACM},\ntitle = {{Model-Based Performance Prediction for Event-Driven Systems}},\ntitleaddon = {{(Extended Abstract)}},\nurl = {http://doi.acm.org/10.1145/1619258.1619300},\nyear = {2009}\n}\n
\n
\nThe event-driven communication paradigm provides a number of advantages for building loosely coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to estimate their behavior and performance under load. Most existing performance prediction techniques for systems using event-driven communication require specialized knowledge to build the necessary prediction models. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication and supports different performance prediction techniques.\n
\n','
\n@inproceedings{rathfelder2009,\n  abstract = {The event-driven communication paradigm provides a number of advantages for building loosely coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to estimate their behavior and performance under load. Most existing performance prediction techniques for systems using event-driven communication require specialized knowledge to build the necessary prediction models. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication and supports different performance prediction techniques.},\n  address = {New York, NY, USA},\n  author = {Rathfelder, Christoph and Kounev, Samuel},\n  booktitle = {Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (DEBS 2009)},\n  day = {6--9},\n  doi = {http://doi.acm.org/10.1145/1619258.1619300},\n  isbn = {978-1-60558-665-6},\n  location = {Nashville, Tennessee},\n  month = {July},\n  pages = {33:1--33:2},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/502.pdf},\n  publisher = {ACM},\n  title = {{Model-Based Performance Prediction for Event-Driven Systems}},\n  titleaddon = {{(Extended Abstract)}},\n  url = {http://doi.acm.org/10.1145/1619258.1619300},\n  year = {2009}\n}\n
\n\n','The event-driven communication paradigm provides a number of advantages for building loosely coupled distributed systems. However, the loose coupling of components in such systems makes it hard for developers to estimate their behavior and performance under load. Most existing performance prediction techniques for systems using event-driven communication require specialized knowledge to build the necessary prediction models. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication and supports different performance prediction techniques.','{Model-Based Performance Prediction for Event-Driven Systems}',0,7,2009,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(503,'paper','rathfelder2009b','inproceedings','@inproceedings{rathfelder2009b,\n abstract = {The use of event-based communication within a Service-Oriented Architecture promises several benefits including more loosely-coupled services and better scalability. However, the loose coupling of services makes it difficult for system developers to estimate the behavior and performance of systems composed of multiple services. Most existing performance prediction techniques for systems using event-based communication require specialized knowledge to build the necessary prediction models. Furthermore, general purpose design-oriented performance models for component-based systems provide limited support for modeling event-based communication. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication. We show how this extension can be exploited to model event-driven service-oriented systems with the aim to evaluate their performance and scalability.},\n address = {New York, USA},\n author = {Christoph Rathfelder and Samuel Kounev},\n booktitle = {Proceedings of the 1st International Workshop on the Quality of Service-Oriented Software Systems (QUASOSS 2009)},\n day = {24--28},\n doi = {10.1145/1596473.159648207-ModelingDEBS-CameraReady},\n location = {Amsterdam, The Netherlands},\n month = {August},\n pages = {33--38},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/503.pdf},\n publisher = {ACM},\n title = {{M}odeling {E}vent-{D}riven {S}ervice-{O}riented {S}ystems using the {P}alladio {C}omponent {M}odel},\n year = {2009},\n}\n\n','\n\nChristoph Rathfelder and Samuel Kounev.\nModeling Event-Driven Service-Oriented Systems using the\nPalladio Component Model.\nIn Proceedings of the 1st International Workshop on the Quality\nof Service-Oriented Software Systems (QUASOSS 2009), Amsterdam, The\nNetherlands, August 24-28, 2009, pages 33-38. ACM, New York, USA.\nAugust 2009.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{rathfelder2009b,\nabstract = {The use of event-based communication within a Service-Oriented Architecture promises several benefits including more loosely-coupled services and better scalability. However, the loose coupling of services makes it difficult for system developers to estimate the behavior and performance of systems composed of multiple services. Most existing performance prediction techniques for systems using event-based communication require specialized knowledge to build the necessary prediction models. Furthermore, general purpose design-oriented performance models for component-based systems provide limited support for modeling event-based communication. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication. We show how this extension can be exploited to model event-driven service-oriented systems with the aim to evaluate their performance and scalability.},\naddress = {New York, USA},\nauthor = {Christoph Rathfelder and Samuel Kounev},\nbooktitle = {Proceedings of the 1st International Workshop on the Quality of Service-Oriented Software Systems (QUASOSS 2009)},\nday = {24--28},\ndoi = {10.1145/1596473.159648207-ModelingDEBS-CameraReady},\nlocation = {Amsterdam, The Netherlands},\nmonth = {August},\npages = {33--38},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/503.pdf},\npublisher = {ACM},\ntitle = {{M}odeling {E}vent-{D}riven {S}ervice-{O}riented {S}ystems using the {P}alladio {C}omponent {M}odel},\nyear = {2009}\n}\n
\n
\nThe use of event-based communication within a Service-Oriented Architecture promises several benefits including more loosely-coupled services and better scalability. However, the loose coupling of services makes it difficult for system developers to estimate the behavior and performance of systems composed of multiple services. Most existing performance prediction techniques for systems using event-based communication require specialized knowledge to build the necessary prediction models. Furthermore, general purpose design-oriented performance models for component-based systems provide limited support for modeling event-based communication. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication. We show how this extension can be exploited to model event-driven service-oriented systems with the aim to evaluate their performance and scalability.\n
\n','
\n@inproceedings{rathfelder2009b,\n  abstract = {The use of event-based communication within a Service-Oriented Architecture promises several benefits including more loosely-coupled services and better scalability. However, the loose coupling of services makes it difficult for system developers to estimate the behavior and performance of systems composed of multiple services. Most existing performance prediction techniques for systems using event-based communication require specialized knowledge to build the necessary prediction models. Furthermore, general purpose design-oriented performance models for component-based systems provide limited support for modeling event-based communication. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication. We show how this extension can be exploited to model event-driven service-oriented systems with the aim to evaluate their performance and scalability.},\n  address = {New York, USA},\n  author = {Christoph Rathfelder and Samuel Kounev},\n  booktitle = {Proceedings of the 1st International Workshop on the Quality of Service-Oriented Software Systems (QUASOSS 2009)},\n  day = {24--28},\n  doi = {10.1145/1596473.159648207-ModelingDEBS-CameraReady},\n  location = {Amsterdam, The Netherlands},\n  month = {August},\n  pages = {33--38},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/503.pdf},\n  publisher = {ACM},\n  title = {{M}odeling {E}vent-{D}riven {S}ervice-{O}riented {S}ystems using the {P}alladio {C}omponent {M}odel},\n  year = {2009}\n}\n
\n\n','The use of event-based communication within a Service-Oriented Architecture promises several benefits including more loosely-coupled services and better scalability. However, the loose coupling of services makes it difficult for system developers to estimate the behavior and performance of systems composed of multiple services. Most existing performance prediction techniques for systems using event-based communication require specialized knowledge to build the necessary prediction models. Furthermore, general purpose design-oriented performance models for component-based systems provide limited support for modeling event-based communication. In this paper, we propose an extension of the Palladio Component Model (PCM) that provides natural support for modeling event-based communication. We show how this extension can be exploited to model event-driven service-oriented systems with the aim to evaluate their performance and scalability.','{M}odeling {E}vent-{D}riven {S}ervice-{O}riented {S}ystems using the {P}alladio {C}omponent {M}odel',0,8,2009,8,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(504,'paper','RaKoEv2011-ASE-CapacityPlanning','inproceedings','@inproceedings{RaKoEv2011-ASE-CapacityPlanning,\n abstract = {Event-based communication is used in different domains including telecommunications, transportation, and business information systems to build scalable distributed systems. The loose coupling of components in such systems makes it easy to vary the deployment. At the same time, the complexity to estimate the behavior and performance of the whole system is increased, which complicates capacity planning. In this paper, we present an automated performance prediction method supporting capacity planning for event-based systems. The performance prediction is based on an extended version of the Palladio Component Model -- a performance meta-model for component-based systems. We apply this method on a real-world case study of a traffic monitoring system. In addition to the application of our performance prediction techniques for capacity planning, we evaluate the prediction results against measurements in the context of the case study. The results demonstrate the practicality and effectiveness of the proposed approach.},\n author = {Christoph Rathfelder and Samuel Kounev and David Evans},\n booktitle = {26th IEEE/ACM International Conference On Automated Software Engineering (ASE 2011)},\n day = {6--12},\n location = {Oread, Lawrence, Kansas},\n month = {November},\n note = {Acceptance Rate (Full Paper): 14.7\\% (37/252)},\n pages = {352--361},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/504.pdf},\n publisher = {IEEE},\n title = {{C}apacity {P}lanning for {E}vent-based {S}ystems using {A}utomated {P}erformance {P}redictions},\n year = {2011},\n}\n\n','\n\nChristoph Rathfelder, Samuel Kounev, and David Evans.\nCapacity Planning for Event-based Systems using Automated\nPerformance Predictions.\nIn 26th IEEE/ACM International Conference On Automated Software\nEngineering (ASE 2011), Oread, Lawrence, Kansas, November 6-12, 2011, pages\n352-361. IEEE.\nNovember 2011, Acceptance Rate (Full Paper): 14.7% (37/252).\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{RaKoEv2011-ASE-CapacityPlanning,\nabstract = {Event-based communication is used in different domains including telecommunications, transportation, and business information systems to build scalable distributed systems. The loose coupling of components in such systems makes it easy to vary the deployment. At the same time, the complexity to estimate the behavior and performance of the whole system is increased, which complicates capacity planning. In this paper, we present an automated performance prediction method supporting capacity planning for event-based systems. The performance prediction is based on an extended version of the Palladio Component Model -- a performance meta-model for component-based systems. We apply this method on a real-world case study of a traffic monitoring system. In addition to the application of our performance prediction techniques for capacity planning, we evaluate the prediction results against measurements in the context of the case study. The results demonstrate the practicality and effectiveness of the proposed approach.},\nauthor = {Christoph Rathfelder and Samuel Kounev and David Evans},\nbooktitle = {26th IEEE/ACM International Conference On Automated Software Engineering (ASE 2011)},\nday = {6--12},\nlocation = {Oread, Lawrence, Kansas},\nmonth = {November},\nnote = {Acceptance Rate (Full Paper): 14.7\\% (37/252)},\npages = {352--361},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/504.pdf},\npublisher = {IEEE},\ntitle = {{C}apacity {P}lanning for {E}vent-based {S}ystems using {A}utomated {P}erformance {P}redictions},\nyear = {2011}\n}\n
\n
\nEvent-based communication is used in different domains including telecommunications, transportation, and business information systems to build scalable distributed systems. The loose coupling of components in such systems makes it easy to vary the deployment. At the same time, the complexity to estimate the behavior and performance of the whole system is increased, which complicates capacity planning. In this paper, we present an automated performance prediction method supporting capacity planning for event-based systems. The performance prediction is based on an extended version of the Palladio Component Model - a performance meta-model for component-based systems. We apply this method on a real-world case study of a traffic monitoring system. In addition to the application of our performance prediction techniques for capacity planning, we evaluate the prediction results against measurements in the context of the case study. The results demonstrate the practicality and effectiveness of the proposed approach.\n
\n','
\n@inproceedings{RaKoEv2011-ASE-CapacityPlanning,\n  abstract = {Event-based communication is used in different domains including telecommunications, transportation, and business information systems to build scalable distributed systems. The loose coupling of components in such systems makes it easy to vary the deployment. At the same time, the complexity to estimate the behavior and performance of the whole system is increased, which complicates capacity planning. In this paper, we present an automated performance prediction method supporting capacity planning for event-based systems. The performance prediction is based on an extended version of the Palladio Component Model -- a performance meta-model for component-based systems. We apply this method on a real-world case study of a traffic monitoring system. In addition to the application of our performance prediction techniques for capacity planning, we evaluate the prediction results against measurements in the context of the case study. The results demonstrate the practicality and effectiveness of the proposed approach.},\n  author = {Christoph Rathfelder and Samuel Kounev and David Evans},\n  booktitle = {26th IEEE/ACM International Conference On Automated Software Engineering (ASE 2011)},\n  day = {6--12},\n  location = {Oread, Lawrence, Kansas},\n  month = {November},\n  note = {Acceptance Rate (Full Paper): 14.7\\% (37/252)},\n  pages = {352--361},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/504.pdf},\n  publisher = {IEEE},\n  title = {{C}apacity {P}lanning for {E}vent-based {S}ystems using {A}utomated {P}erformance {P}redictions},\n  year = {2011}\n}\n
\n\n','Event-based communication is used in different domains including telecommunications, transportation, and business information systems to build scalable distributed systems. The loose coupling of components in such systems makes it easy to vary the deployment. At the same time, the complexity to estimate the behavior and performance of the whole system is increased, which complicates capacity planning. In this paper, we present an automated performance prediction method supporting capacity planning for event-based systems. The performance prediction is based on an extended version of the Palladio Component Model -- a performance meta-model for component-based systems. We apply this method on a real-world case study of a traffic monitoring system. In addition to the application of our performance prediction techniques for capacity planning, we evaluate the prediction results against measurements in the context of the case study. The results demonstrate the practicality and effectiveness of the proposed approach.','{C}apacity {P}lanning for {E}vent-based {S}ystems using {A}utomated {P}erformance {P}redictions',0,11,2011,11,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(508,'paper','ReNoHaRe2013-ICMT-VisualAnalystics','inproceedings','@inproceedings{ReNoHaRe2013-ICMT-VisualAnalystics,\n author = {Andreas Rentschler and Qais Noorshams and Lucia Happe and Ralf Reussner},\n title = {{Interactive Visual Analytics for Efficient Maintenance of Model Transformations}},\n booktitle = {Proceedings of the 6th International Conference on Model Transformation (ICMT \'13), Budapest, Hungary},\n _booktitle = {Theory and Practice of Model Transformations - 6th International Conference, ICMT 2013, Budapest, Hungary, June 18-19, 2013. Proceedings},\n editor = {Keith Duddy and Gerti Kappel},\n month = {June},\n note = {Acceptance Rate: 20.7\\%},\n publisher = {Springer-Verlag Berlin Heidelberg},\n _address = {Berlin--Heidelberg--New York},\n series = {Lecture Notes in Computer Science},\n year = {2013},\n volume = {7909},\n pages = {141--157},\n url = {http://dx.doi.org/10.1007/978-3-642-38883-5_14},\n doi = {10.1007/978-3-642-38883-5_14},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/508.pdf},\n}\n\n','\n\nAndreas Rentschler, Qais Noorshams, Lucia Happe, and Ralf Reussner.\nInteractive Visual Analytics for Efficient Maintenance of Model\nTransformations.\nIn Proceedings of the 6th International Conference on Model\nTransformation (ICMT \'13), Budapest, Hungary, Keith Duddy and Gerti Kappel,\neditors, June 2013, volume 7909 of Lecture Notes in Computer Science,\npages 141-157. Springer-Verlag Berlin Heidelberg.\nJune 2013, Acceptance Rate: 20.7%.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{ReNoHaRe2013-ICMT-VisualAnalystics,\nauthor = {Andreas Rentschler and Qais Noorshams and Lucia Happe and Ralf Reussner},\ntitle = {{Interactive Visual Analytics for Efficient Maintenance of Model Transformations}},\nbooktitle = {Proceedings of the 6th International Conference on Model Transformation (ICMT \'13), Budapest, Hungary},\n_booktitle = {Theory and Practice of Model Transformations - 6th International Conference, ICMT 2013, Budapest, Hungary, June 18-19, 2013. Proceedings},\neditor = {Keith Duddy and Gerti Kappel},\nmonth = {June},\nnote = {Acceptance Rate: 20.7\\%},\npublisher = {Springer-Verlag Berlin Heidelberg},\n_address = {Berlin--Heidelberg--New York},\nseries = {Lecture Notes in Computer Science},\nyear = {2013},\nvolume = {7909},\npages = {141--157},\nurl = {http://dx.doi.org/10.1007/978-3-642-38883-5_14},\ndoi = {10.1007/978-3-642-38883-5_14},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/508.pdf}\n}\n
\n
\n','
\n@inproceedings{ReNoHaRe2013-ICMT-VisualAnalystics,\n  author = {Andreas Rentschler and Qais Noorshams and Lucia Happe and Ralf Reussner},\n  title = {{Interactive Visual Analytics for Efficient Maintenance of Model Transformations}},\n  booktitle = {Proceedings of the 6th International Conference on Model Transformation (ICMT \'13), Budapest, Hungary},\n  _booktitle = {Theory and Practice of Model Transformations - 6th International Conference, ICMT 2013, Budapest, Hungary, June 18-19, 2013. Proceedings},\n  editor = {Keith Duddy and Gerti Kappel},\n  month = {June},\n  note = {Acceptance Rate: 20.7\\%},\n  publisher = {Springer-Verlag Berlin Heidelberg},\n  _address = {Berlin--Heidelberg--New York},\n  series = {Lecture Notes in Computer Science},\n  year = {2013},\n  volume = {7909},\n  pages = {141--157},\n  url = {http://dx.doi.org/10.1007/978-3-642-38883-5_14},\n  doi = {10.1007/978-3-642-38883-5_14},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/508.pdf}\n}\n
\n\n',NULL,'{Interactive Visual Analytics for Efficient Maintenance of Model Transformations}',0,6,2013,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(510,'paper','ReWeNoHaRe2014-AOSD-Modularity','inproceedings','@inproceedings{ReWeNoHaRe2014-AOSD-Modularity,\n author = {Andreas Rentschler and Dominik Werle and Qais Noorshams and Lucia Happe and Ralf Reussner},\n title = {{Designing Information Hiding Modularity for Model Transformation Languages}},\n booktitle = {Proceedings of the 13th International Conference on Modularity (AOSD \'14), Lugano, Switzerland, April 22 - 26, 2014},\n month = {April},\n publisher = {ACM},\n address = {New York, NY, USA},\n year = {2014},\n note = {Acceptance Rate: 35.0\\%},\n isbn = {978-1-450-32772-5},\n acmid = {2577094},\n pages = {217--228},\n numpages = {12},\n url = {http://doi.acm.org/10.1145/2577080.2577094},\n doi = {10.1145/2577080.2577094},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/510.pdf},\n}\n\n','\n\nAndreas Rentschler, Dominik Werle, Qais Noorshams, Lucia Happe, and Ralf\nReussner.\nDesigning Information Hiding Modularity for Model Transformation\nLanguages.\nIn Proceedings of the 13th International Conference on\nModularity (AOSD \'14), Lugano, Switzerland, April 22 - 26, 2014, April 2014,\npages 217-228. ACM, New York, NY, USA.\nApril 2014, Acceptance Rate: 35.0%.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{ReWeNoHaRe2014-AOSD-Modularity,\nauthor = {Andreas Rentschler and Dominik Werle and Qais Noorshams and Lucia Happe and Ralf Reussner},\ntitle = {{Designing Information Hiding Modularity for Model Transformation Languages}},\nbooktitle = {Proceedings of the 13th International Conference on Modularity (AOSD \'14), Lugano, Switzerland, April 22 - 26, 2014},\nmonth = {April},\npublisher = {ACM},\naddress = {New York, NY, USA},\nyear = {2014},\nnote = {Acceptance Rate: 35.0\\%},\nisbn = {978-1-450-32772-5},\nacmid = {2577094},\npages = {217--228},\nnumpages = {12},\nurl = {http://doi.acm.org/10.1145/2577080.2577094},\ndoi = {10.1145/2577080.2577094},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/510.pdf}\n}\n
\n
\n','
\n@inproceedings{ReWeNoHaRe2014-AOSD-Modularity,\n  author = {Andreas Rentschler and Dominik Werle and Qais Noorshams and Lucia Happe and Ralf Reussner},\n  title = {{Designing Information Hiding Modularity for Model Transformation Languages}},\n  booktitle = {Proceedings of the 13th International Conference on Modularity (AOSD \'14), Lugano, Switzerland, April 22 - 26, 2014},\n  month = {April},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  year = {2014},\n  note = {Acceptance Rate: 35.0\\%},\n  isbn = {978-1-450-32772-5},\n  acmid = {2577094},\n  pages = {217--228},\n  numpages = {12},\n  url = {http://doi.acm.org/10.1145/2577080.2577094},\n  doi = {10.1145/2577080.2577094},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/510.pdf}\n}\n
\n\n',NULL,'{Designing Information Hiding Modularity for Model Transformation Languages}',0,4,2014,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(559,'paper','RyKo2013','article','@article{RyKo2013,\n author = {Piotr Rygielski and Samuel Kounev},\n doi = {http://dx.doi.org/10.1515/pik-2012-0136},\n journal = {PIK --- Praxis der Informationsverarbeitung und Kommunikation},\n month = {February},\n number = {1},\n pages = {55--64},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/559.pdf},\n publisher = {de Gruyter},\n title = {{Network Virtualization for QoS-Aware Resource Management in Cloud Data Centers: A Survey}},\n url = {http://www.degruyter.com/view/j/piko-2013-36-issue-1/pik-2012-0136/pik-2012-0136.xml?format=INT},\n volume = {36},\n year = {2013},\n abstract = {The increasing popularity of Cloud Computing is leading to the emergence of large virtualized data centers hosting increasingly complex and dynamic IT systems and services. Over the past decade, the efficient sharing of computational resources through virtualization has been subject to intensive research, while network management in cloud data centers has received less attention. A variety of network-intensive applications require QoS (Quality-of-Service) provisioning, performance isolation and support for flexible and efficient migration of virtual machines. In this paper, we survey existing network virtualization approaches and evaluate the extent to which they can be used as a basis for realizing the mentioned requirements in a cloud data center. More specifically, we identify generic network virtualization techniques, characterize them according to their features related to QoS management and performance isolation, and show how they can be composed together and used as building blocks for complex network virtualization solutions. We then present an overview of selected representative cloud platforms and show how they leverage the generic techniques as a basis for network resource management. Finally, we outline open issues and research challenges in the area of performance modeling and proactive resource management of virtualized data center infrastructures.},\n}\n\n','\n\nPiotr Rygielski and Samuel Kounev.\nNetwork Virtualization for QoS-Aware Resource Management in Cloud\nData Centers: A Survey.\nPIK - Praxis der Informationsverarbeitung und Kommunikation,\n36(1):55-64, February 2013, de Gruyter.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@article{RyKo2013,\nauthor = {Piotr Rygielski and Samuel Kounev},\ndoi = {http://dx.doi.org/10.1515/pik-2012-0136},\njournal = {PIK --- Praxis der Informationsverarbeitung und Kommunikation},\nmonth = {February},\nnumber = {1},\npages = {55--64},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/559.pdf},\npublisher = {de Gruyter},\ntitle = {{Network Virtualization for QoS-Aware Resource Management in Cloud Data Centers: A Survey}},\nurl = {http://www.degruyter.com/view/j/piko-2013-36-issue-1/pik-2012-0136/pik-2012-0136.xml?format=INT},\nvolume = {36},\nyear = {2013},\nabstract = {The increasing popularity of Cloud Computing is leading to the emergence of large virtualized data centers hosting increasingly complex and dynamic IT systems and services. Over the past decade, the efficient sharing of computational resources through virtualization has been subject to intensive research, while network management in cloud data centers has received less attention. A variety of network-intensive applications require QoS (Quality-of-Service) provisioning, performance isolation and support for flexible and efficient migration of virtual machines. In this paper, we survey existing network virtualization approaches and evaluate the extent to which they can be used as a basis for realizing the mentioned requirements in a cloud data center. More specifically, we identify generic network virtualization techniques, characterize them according to their features related to QoS management and performance isolation, and show how they can be composed together and used as building blocks for complex network virtualization solutions. We then present an overview of selected representative cloud platforms and show how they leverage the generic techniques as a basis for network resource management. Finally, we outline open issues and research challenges in the area of performance modeling and proactive resource management of virtualized data center infrastructures.}\n}\n
\n
\nThe increasing popularity of Cloud Computing is leading to the emergence of large virtualized data centers hosting increasingly complex and dynamic IT systems and services. Over the past decade, the efficient sharing of computational resources through virtualization has been subject to intensive research, while network management in cloud data centers has received less attention. A variety of network-intensive applications require QoS (Quality-of-Service) provisioning, performance isolation and support for flexible and efficient migration of virtual machines. In this paper, we survey existing network virtualization approaches and evaluate the extent to which they can be used as a basis for realizing the mentioned requirements in a cloud data center. More specifically, we identify generic network virtualization techniques, characterize them according to their features related to QoS management and performance isolation, and show how they can be composed together and used as building blocks for complex network virtualization solutions. We then present an overview of selected representative cloud platforms and show how they leverage the generic techniques as a basis for network resource management. Finally, we outline open issues and research challenges in the area of performance modeling and proactive resource management of virtualized data center infrastructures.\n
\n','
\n@article{RyKo2013,\n  author = {Piotr Rygielski and Samuel Kounev},\n  doi = {http://dx.doi.org/10.1515/pik-2012-0136},\n  journal = {PIK --- Praxis der Informationsverarbeitung und Kommunikation},\n  month = {February},\n  number = {1},\n  pages = {55--64},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/559.pdf},\n  publisher = {de Gruyter},\n  title = {{Network Virtualization for QoS-Aware Resource Management in Cloud Data Centers: A Survey}},\n  url = {http://www.degruyter.com/view/j/piko-2013-36-issue-1/pik-2012-0136/pik-2012-0136.xml?format=INT},\n  volume = {36},\n  year = {2013},\n  abstract = {The increasing popularity of Cloud Computing is leading to the emergence of large virtualized data centers hosting increasingly complex and dynamic IT systems and services. Over the past decade, the efficient sharing of computational resources through virtualization has been subject to intensive research, while network management in cloud data centers has received less attention. A variety of network-intensive applications require QoS (Quality-of-Service) provisioning, performance isolation and support for flexible and efficient migration of virtual machines. In this paper, we survey existing network virtualization approaches and evaluate the extent to which they can be used as a basis for realizing the mentioned requirements in a cloud data center. More specifically, we identify generic network virtualization techniques, characterize them according to their features related to QoS management and performance isolation, and show how they can be composed together and used as building blocks for complex network virtualization solutions. We then present an overview of selected representative cloud platforms and show how they leverage the generic techniques as a basis for network resource management. Finally, we outline open issues and research challenges in the area of performance modeling and proactive resource management of virtualized data center infrastructures.}\n}\n
\n\n','The increasing popularity of Cloud Computing is leading to the emergence of large virtualized data centers hosting increasingly complex and dynamic IT systems and services. Over the past decade, the efficient sharing of computational resources through virtualization has been subject to intensive research, while network management in cloud data centers has received less attention. A variety of network-intensive applications require QoS (Quality-of-Service) provisioning, performance isolation and support for flexible and efficient migration of virtual machines. In this paper, we survey existing network virtualization approaches and evaluate the extent to which they can be used as a basis for realizing the mentioned requirements in a cloud data center. More specifically, we identify generic network virtualization techniques, characterize them according to their features related to QoS management and performance isolation, and show how they can be composed together and used as building blocks for complex network virtualization solutions. We then present an overview of selected representative cloud platforms and show how they leverage the generic techniques as a basis for network resource management. Finally, we outline open issues and research challenges in the area of performance modeling and proactive resource management of virtualized data center infrastructures.','{Network Virtualization for QoS-Aware Resource Management in Cloud Data Centers: A Survey}',0,2,2013,2,NULL,NULL,'Networking; QoS in Networks; Virtualization; Cloud; Survey','0000-00-00 00:00:00','2016-06-01 09:40:59',0),(560,'paper','RyZsKo2013-DNI-meta-model','inproceedings','@inproceedings{RyZsKo2013-DNI-meta-model,\n address = {New York, NY, USA},\n author = {Piotr Rygielski and Steffen Zschaler and Samuel Kounev},\n booktitle = {Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013)},\n day = {21--24},\n location = {Prague, Czech Republic},\n month = {April},\n pages = {327--330},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/560.pdf},\n publisher = {ACM},\n title = {{A Meta-Model for Performance Modeling of Dynamic Virtualized Network Infrastructures}},\n titleaddon = {{(work-in-progress paper)}},\n url = {http://icpe2013.ipd.kit.edu/},\n year = {2013},\n abstract = {In this work-in-progress paper, we present a new meta-model designed for the performance modeling of dynamic data center network infrastructures. Our approach models characteristic aspects of Cloud data centers which were not crucial in classical data centers. We present our meta-model and demonstrate its use for performance modeling and analysis through an example, including a transformation into OMNeT++ for performance simulation.},\n}\n\n','\n\nPiotr Rygielski, Steffen Zschaler, and Samuel Kounev.\nA Meta-Model for Performance Modeling of Dynamic Virtualized Network\nInfrastructures (work-in-progress paper).\nIn Proceedings of the 4th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2013), Prague, Czech Republic, April 21-24,\n2013, pages 327-330. ACM, New York, NY, USA.\nApril 2013.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{RyZsKo2013-DNI-meta-model,\naddress = {New York, NY, USA},\nauthor = {Piotr Rygielski and Steffen Zschaler and Samuel Kounev},\nbooktitle = {Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013)},\nday = {21--24},\nlocation = {Prague, Czech Republic},\nmonth = {April},\npages = {327--330},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/560.pdf},\npublisher = {ACM},\ntitle = {{A Meta-Model for Performance Modeling of Dynamic Virtualized Network Infrastructures}},\ntitleaddon = {{(work-in-progress paper)}},\nurl = {http://icpe2013.ipd.kit.edu/},\nyear = {2013},\nabstract = {In this work-in-progress paper, we present a new meta-model designed for the performance modeling of dynamic data center network infrastructures. Our approach models characteristic aspects of Cloud data centers which were not crucial in classical data centers. We present our meta-model and demonstrate its use for performance modeling and analysis through an example, including a transformation into OMNeT++ for performance simulation.}\n}\n
\n
\nIn this work-in-progress paper, we present a new meta-model designed for the performance modeling of dynamic data center network infrastructures. Our approach models characteristic aspects of Cloud data centers which were not crucial in classical data centers. We present our meta-model and demonstrate its use for performance modeling and analysis through an example, including a transformation into OMNeT++ for performance simulation.\n
\n','
\n@inproceedings{RyZsKo2013-DNI-meta-model,\n  address = {New York, NY, USA},\n  author = {Piotr Rygielski and Steffen Zschaler and Samuel Kounev},\n  booktitle = {Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013)},\n  day = {21--24},\n  location = {Prague, Czech Republic},\n  month = {April},\n  pages = {327--330},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/560.pdf},\n  publisher = {ACM},\n  title = {{A Meta-Model for Performance Modeling of Dynamic Virtualized Network Infrastructures}},\n  titleaddon = {{(work-in-progress paper)}},\n  url = {http://icpe2013.ipd.kit.edu/},\n  year = {2013},\n  abstract = {In this work-in-progress paper, we present a new meta-model designed for the performance modeling of dynamic data center network infrastructures. Our approach models characteristic aspects of Cloud data centers which were not crucial in classical data centers. We present our meta-model and demonstrate its use for performance modeling and analysis through an example, including a transformation into OMNeT++ for performance simulation.}\n}\n
\n\n','In this work-in-progress paper, we present a new meta-model designed for the performance modeling of dynamic data center network infrastructures. Our approach models characteristic aspects of Cloud data centers which were not crucial in classical data centers. We present our meta-model and demonstrate its use for performance modeling and analysis through an example, including a transformation into OMNeT++ for performance simulation.','{A Meta-Model for Performance Modeling of Dynamic Virtualized Network Infrastructures}',0,4,2013,4,NULL,NULL,'Networking; Simulation; Modeling; Performance; Prediction','0000-00-00 00:00:00','2016-06-01 09:40:59',0),(563,'paper','KaiSachs-Thesis-2010','phdthesis','@phdthesis{KaiSachs-Thesis-2010,\n title = {Performance Modeling and Benchmarking of Event-Based Systems},\n year = {2010},\n address = {Karolinenplatz 5, 64289 Darmstadt, Germany},\n school = {TU Darmstadt},\n author = {Sachs, Kai},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/563.pdf},\n}\n\n','\n\nKai Sachs.\nPerformance Modeling and Benchmarking of Event-Based Systems.\nPhD thesis, TU Darmstadt, Karolinenplatz 5, 64289 Darmstadt, Germany,\n2010.\n[ bib | .pdf  ] 
\n@phdthesis{KaiSachs-Thesis-2010,\ntitle = {Performance Modeling and Benchmarking of Event-Based Systems},\nyear = {2010},\naddress = {Karolinenplatz 5, 64289 Darmstadt, Germany},\nschool = {TU Darmstadt},\nauthor = {Sachs, Kai},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/563.pdf}\n}\n
\n
\n','
\n@phdthesis{KaiSachs-Thesis-2010,\n  title = {Performance Modeling and Benchmarking of Event-Based Systems},\n  year = {2010},\n  address = {Karolinenplatz 5, 64289 Darmstadt, Germany},\n  school = {TU Darmstadt},\n  author = {Sachs, Kai},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/563.pdf}\n}\n
\n\n',NULL,'Performance Modeling and Benchmarking of Event-Based Systems',0,0,2010,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(564,'paper','SaApKoBu2010-BenchmarX-PubSub','inproceedings','@inproceedings{SaApKoBu2010-BenchmarX-PubSub,\n author = {Kai Sachs and Stefan Appel and Samuel Kounev and Alejandro Buchmann},\n booktitle = {Proc. of 2nd International Workshop on Benchmarking of Database Management Systems and Data-Oriented Web Technologies (BenchmarX\'10).},\n editor = {Martin Necasky and Eric Pardede},\n month = {April},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/564.pdf},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science (LNCS)},\n title = {{Benchmarking Publish/Subscribe-based Messaging Systems}},\n volume = {6193},\n year = {2010},\n}\n\n','\n\nKai Sachs, Stefan Appel, Samuel Kounev, and Alejandro Buchmann.\nBenchmarking Publish/Subscribe-based Messaging Systems.\nIn Proc. of 2nd International Workshop on Benchmarking of\nDatabase Management Systems and Data-Oriented Web Technologies\n(BenchmarX\'10)., Martin Necasky and Eric Pardede, editors, April 2010,\nvolume 6193 of Lecture Notes in Computer Science (LNCS). Springer.\nApril 2010.\n[ bib | .pdf  ] 
\n@inproceedings{SaApKoBu2010-BenchmarX-PubSub,\nauthor = {Kai Sachs and Stefan Appel and Samuel Kounev and Alejandro Buchmann},\nbooktitle = {Proc. of 2nd International Workshop on Benchmarking of Database Management Systems and Data-Oriented Web Technologies (BenchmarX\'10).},\neditor = {Martin Necasky and Eric Pardede},\nmonth = {April},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/564.pdf},\npublisher = {Springer},\nseries = {Lecture Notes in Computer Science (LNCS)},\ntitle = {{Benchmarking Publish/Subscribe-based Messaging Systems}},\nvolume = {6193},\nyear = {2010}\n}\n
\n
\n','
\n@inproceedings{SaApKoBu2010-BenchmarX-PubSub,\n  author = {Kai Sachs and Stefan Appel and Samuel Kounev and Alejandro Buchmann},\n  booktitle = {Proc. of 2nd International Workshop on Benchmarking of Database Management Systems and Data-Oriented Web Technologies (BenchmarX\'10).},\n  editor = {Martin Necasky and Eric Pardede},\n  month = {April},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/564.pdf},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science (LNCS)},\n  title = {{Benchmarking Publish/Subscribe-based Messaging Systems}},\n  volume = {6193},\n  year = {2010}\n}\n
\n\n',NULL,'{Benchmarking Publish/Subscribe-based Messaging Systems}',0,4,2010,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(565,'paper','sachs2008a','misc','@misc{sachs2008a,\n author = {Samuel Kounev and Kai Sachs},\n howpublished = {iX Magazin, Heft 02/2008, Heise Zeitschriften Verlag},\n title = {{Kaffeekunde - SPECjms misst Message-oriented Middleware}},\n url = {http://www.heise.de/kiosk/archiv/ix/2008/2/121},\n year = {2008},\n}\n\n','\n\nSamuel Kounev and Kai Sachs.\nKaffeekunde - SPECjms misst Message-oriented Middleware.\niX Magazin, Heft 02/2008, Heise Zeitschriften Verlag, 2008.\n[ bib | http  ] 
\n@misc{sachs2008a,\nauthor = {Samuel Kounev and Kai Sachs},\nhowpublished = {iX Magazin, Heft 02/2008, Heise Zeitschriften Verlag},\ntitle = {{Kaffeekunde - SPECjms misst Message-oriented Middleware}},\nurl = {http://www.heise.de/kiosk/archiv/ix/2008/2/121},\nyear = {2008}\n}\n
\n
\n','
\n@misc{sachs2008a,\n  author = {Samuel Kounev and Kai Sachs},\n  howpublished = {iX Magazin, Heft 02/2008, Heise Zeitschriften Verlag},\n  title = {{Kaffeekunde - SPECjms misst Message-oriented Middleware}},\n  url = {http://www.heise.de/kiosk/archiv/ix/2008/2/121},\n  year = {2008}\n}\n
\n\n',NULL,'{Kaffeekunde - SPECjms misst Message-oriented Middleware}',0,0,2008,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(566,'paper','SaKo2006-MessageTypesInSPECjms','techreport','@techreport{SaKo2006-MessageTypesInSPECjms,\n author = {Kai Sachs and Samuel Kounev},\n institution = {SPEC OSG Java Subcommittee},\n month = {February},\n number = {DVS06-3},\n title = {{Message Types and Interfaces Between Components in SPECjms}},\n year = {2006},\n}\n\n','\n\nKai Sachs and Samuel Kounev.\nMessage Types and Interfaces Between Components in SPECjms.\nTechnical Report DVS06-3, SPEC OSG Java Subcommittee, February 2006.\n[ bib  ] 
\n@techreport{SaKo2006-MessageTypesInSPECjms,\nauthor = {Kai Sachs and Samuel Kounev},\ninstitution = {SPEC OSG Java Subcommittee},\nmonth = {February},\nnumber = {DVS06-3},\ntitle = {{Message Types and Interfaces Between Components in SPECjms}},\nyear = {2006}\n}\n
\n
\n','
\n@techreport{SaKo2006-MessageTypesInSPECjms,\n  author = {Kai Sachs and Samuel Kounev},\n  institution = {SPEC OSG Java Subcommittee},\n  month = {February},\n  number = {DVS06-3},\n  title = {{Message Types and Interfaces Between Components in SPECjms}},\n  year = {2006}\n}\n
\n\n',NULL,'{Message Types and Interfaces Between Components in SPECjms}',0,2,2006,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(567,'paper','SaKo2006-WorkloadScenarioSPECjms','techreport','@techreport{SaKo2006-WorkloadScenarioSPECjms,\n abstract = {Message-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern informationdriven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scalability of MOM. With all major vendors adopting JMS (Java Message Service) as a standard interface to MOM servers, there is at last a means for creating a standardized workload for evaluating products in this space. This paper describes a novel application in the supply chain management domain that has been specifically designed as a representative workload scenario for evaluating the performance and scalability of MOM products. This scenario is used as a basis in SPEC?s new SPECjms benchmark which will be the world?s first industry-standard benchmark for MOM.},\n author = {Kai Sachs and Samuel Kounev},\n institution = {SPEC OSG Java Subcommittee},\n month = {January},\n number = {DVS06-2},\n title = {{Workload Scenario for SPECjms - Supermarket Supply Chain}},\n year = {2006},\n}\n\n','\n\nKai Sachs and Samuel Kounev.\nWorkload Scenario for SPECjms - Supermarket Supply Chain.\nTechnical Report DVS06-2, SPEC OSG Java Subcommittee, January 2006.\n[ bib | Abstract  ] 
\n@techreport{SaKo2006-WorkloadScenarioSPECjms,\nabstract = {Message-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern informationdriven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scalability of MOM. With all major vendors adopting JMS (Java Message Service) as a standard interface to MOM servers, there is at last a means for creating a standardized workload for evaluating products in this space. This paper describes a novel application in the supply chain management domain that has been specifically designed as a representative workload scenario for evaluating the performance and scalability of MOM products. This scenario is used as a basis in SPEC?s new SPECjms benchmark which will be the world?s first industry-standard benchmark for MOM.},\nauthor = {Kai Sachs and Samuel Kounev},\ninstitution = {SPEC OSG Java Subcommittee},\nmonth = {January},\nnumber = {DVS06-2},\ntitle = {{Workload Scenario for SPECjms - Supermarket Supply Chain}},\nyear = {2006}\n}\n
\n
\nMessage-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern informationdriven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scalability of MOM. With all major vendors adopting JMS (Java Message Service) as a standard interface to MOM servers, there is at last a means for creating a standardized workload for evaluating products in this space. This paper describes a novel application in the supply chain management domain that has been specifically designed as a representative workload scenario for evaluating the performance and scalability of MOM products. This scenario is used as a basis in SPEC?s new SPECjms benchmark which will be the world?s first industry-standard benchmark for MOM.\n
\n','
\n@techreport{SaKo2006-WorkloadScenarioSPECjms,\n  abstract = {Message-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern informationdriven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scalability of MOM. With all major vendors adopting JMS (Java Message Service) as a standard interface to MOM servers, there is at last a means for creating a standardized workload for evaluating products in this space. This paper describes a novel application in the supply chain management domain that has been specifically designed as a representative workload scenario for evaluating the performance and scalability of MOM products. This scenario is used as a basis in SPEC?s new SPECjms benchmark which will be the world?s first industry-standard benchmark for MOM.},\n  author = {Kai Sachs and Samuel Kounev},\n  institution = {SPEC OSG Java Subcommittee},\n  month = {January},\n  number = {DVS06-2},\n  title = {{Workload Scenario for SPECjms - Supermarket Supply Chain}},\n  year = {2006}\n}\n
\n\n','Message-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern informationdriven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scalability of MOM. With all major vendors adopting JMS (Java Message Service) as a standard interface to MOM servers, there is at last a means for creating a standardized workload for evaluating products in this space. This paper describes a novel application in the supply chain management domain that has been specifically designed as a representative workload scenario for evaluating the performance and scalability of MOM products. This scenario is used as a basis in SPEC?s new SPECjms benchmark which will be the world?s first industry-standard benchmark for MOM.','{Workload Scenario for SPECjms - Supermarket Supply Chain}',0,1,2006,1,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(568,'paper','SaKoApBu2009-DEBS-MOM_Benchmarking','inproceedings','@inproceedings{SaKoApBu2009-DEBS-MOM_Benchmarking,\n abstract = {In this poster, we provide an overview of our past and current research in the area of Message-Oriented Middleware (MOM) performance benchmarks. Our main research motivation is a) to gain a better understanding of the performance of MOM, b) to show how to use benchmarks for the evaluation of performance aspects and c)to establish performance modeling techniques. For a better understanding, we first introduce the Java Message Service (JMS) standard. Afterwards, we provide an overview of our work on MOM benchmark development, i.e., we present the SPECjms2007 benchmark and the new jms2009-PS, a test harness designed specifically for JMS-based pub/sub. We outline a new case study with jms2009-PS and present first results of our work-in-progress.},\n author = {Sachs, Kai and Kounev, Samuel and Appel, Stefan and Buchmann, Alejandro},\n booktitle = {Proceedings of the 3rd ACM International Conference on Distributed Event-Based Systems (DEBS-2009), Nashville, TN, {USA}, July 6-9, 2009},\n month = {July},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/568.pdf},\n publisher = {ACM, New York, NY, USA},\n title = {{Benchmarking of Message-Oriented Middleware}},\n titleaddon = {{(Poster Paper)}},\n url = {http://www.debs.org/2009},\n year = {2009},\n}\n\n','\n\nKai Sachs, Samuel Kounev, Stefan Appel, and Alejandro Buchmann.\nBenchmarking of Message-Oriented Middleware (Poster Paper).\nIn Proceedings of the 3rd ACM International Conference on\nDistributed Event-Based Systems (DEBS-2009), Nashville, TN, USA, July 6-9,\n2009, July 2009. ACM, New York, NY, USA.\nJuly 2009.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{SaKoApBu2009-DEBS-MOM_Benchmarking,\nabstract = {In this poster, we provide an overview of our past and current research in the area of Message-Oriented Middleware (MOM) performance benchmarks. Our main research motivation is a) to gain a better understanding of the performance of MOM, b) to show how to use benchmarks for the evaluation of performance aspects and c)to establish performance modeling techniques. For a better understanding, we first introduce the Java Message Service (JMS) standard. Afterwards, we provide an overview of our work on MOM benchmark development, i.e., we present the SPECjms2007 benchmark and the new jms2009-PS, a test harness designed specifically for JMS-based pub/sub. We outline a new case study with jms2009-PS and present first results of our work-in-progress.},\nauthor = {Sachs, Kai and Kounev, Samuel and Appel, Stefan and Buchmann, Alejandro},\nbooktitle = {Proceedings of the 3rd ACM International Conference on Distributed Event-Based Systems (DEBS-2009), Nashville, TN, {USA}, July 6-9, 2009},\nmonth = {July},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/568.pdf},\npublisher = {ACM, New York, NY, USA},\ntitle = {{Benchmarking of Message-Oriented Middleware}},\ntitleaddon = {{(Poster Paper)}},\nurl = {http://www.debs.org/2009},\nyear = {2009}\n}\n
\n
\nIn this poster, we provide an overview of our past and current research in the area of Message-Oriented Middleware (MOM) performance benchmarks. Our main research motivation is a) to gain a better understanding of the performance of MOM, b) to show how to use benchmarks for the evaluation of performance aspects and c)to establish performance modeling techniques. For a better understanding, we first introduce the Java Message Service (JMS) standard. Afterwards, we provide an overview of our work on MOM benchmark development, i.e., we present the SPECjms2007 benchmark and the new jms2009-PS, a test harness designed specifically for JMS-based pub/sub. We outline a new case study with jms2009-PS and present first results of our work-in-progress.\n
\n','
\n@inproceedings{SaKoApBu2009-DEBS-MOM_Benchmarking,\n  abstract = {In this poster, we provide an overview of our past and current research in the area of Message-Oriented Middleware (MOM) performance benchmarks. Our main research motivation is a) to gain a better understanding of the performance of MOM, b) to show how to use benchmarks for the evaluation of performance aspects and c)to establish performance modeling techniques. For a better understanding, we first introduce the Java Message Service (JMS) standard. Afterwards, we provide an overview of our work on MOM benchmark development, i.e., we present the SPECjms2007 benchmark and the new jms2009-PS, a test harness designed specifically for JMS-based pub/sub. We outline a new case study with jms2009-PS and present first results of our work-in-progress.},\n  author = {Sachs, Kai and Kounev, Samuel and Appel, Stefan and Buchmann, Alejandro},\n  booktitle = {Proceedings of the 3rd ACM International Conference on Distributed Event-Based Systems (DEBS-2009), Nashville, TN, {USA}, July 6-9, 2009},\n  month = {July},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/568.pdf},\n  publisher = {ACM, New York, NY, USA},\n  title = {{Benchmarking of Message-Oriented Middleware}},\n  titleaddon = {{(Poster Paper)}},\n  url = {http://www.debs.org/2009},\n  year = {2009}\n}\n
\n\n','In this poster, we provide an overview of our past and current research in the area of Message-Oriented Middleware (MOM) performance benchmarks. Our main research motivation is a) to gain a better understanding of the performance of MOM, b) to show how to use benchmarks for the evaluation of performance aspects and c)to establish performance modeling techniques. For a better understanding, we first introduce the Java Message Service (JMS) standard. Afterwards, we provide an overview of our work on MOM benchmark development, i.e., we present the SPECjms2007 benchmark and the new jms2009-PS, a test harness designed specifically for JMS-based pub/sub. We outline a new case study with jms2009-PS and present first results of our work-in-progress.','{Benchmarking of Message-Oriented Middleware}',0,7,2009,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(569,'paper','SaKoApBu2009-SIGMETRICS-jms2009_PS','inproceedings','@inproceedings{SaKoApBu2009-SIGMETRICS-jms2009_PS,\n abstract = {Publish/subscribe is becoming increasingly popular as communication paradigm for loosely-coupled message exchange. It is used as a building block in major new software architectures and technology domains such as Enterprise Service Bus, Enterprise Application Integration, Service-Oriented Architecture and Event-Driven Architecture. The growing adoption of these technologies leads to a strong need for benchmarks and performance evaluation tools in this area. In this demonstration, we present jms2009-PS, a benchmark for publish/subscribe middleware based on the Java Message Service standard interface.},\n author = {Sachs, Kai and Kounev, Samuel and Appel, Stefan and Buchmann, Alejandro},\n booktitle = {SIGMETRICS/Performance 2009 International Conference, Seattle, WA, USA, June 15--19, 2009},\n month = {June},\n titleaddon = {{(Demo Paper)}},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/569.pdf},\n title = {{A Performance Test Harness For Publish/Subscribe Middleware}},\n url = {http://www.sigmetrics.org/conferences/sigmetrics/2009/program_sigmetrics-demo.shtml},\n year = {2009},\n}\n\n','\n\nKai Sachs, Samuel Kounev, Stefan Appel, and Alejandro Buchmann.\nA Performance Test Harness For Publish/Subscribe Middleware (Demo\nPaper).\nIn SIGMETRICS/Performance 2009 International Conference,\nSeattle, WA, USA, June 15-19, 2009, June 2009.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{SaKoApBu2009-SIGMETRICS-jms2009_PS,\nabstract = {Publish/subscribe is becoming increasingly popular as communication paradigm for loosely-coupled message exchange. It is used as a building block in major new software architectures and technology domains such as Enterprise Service Bus, Enterprise Application Integration, Service-Oriented Architecture and Event-Driven Architecture. The growing adoption of these technologies leads to a strong need for benchmarks and performance evaluation tools in this area. In this demonstration, we present jms2009-PS, a benchmark for publish/subscribe middleware based on the Java Message Service standard interface.},\nauthor = {Sachs, Kai and Kounev, Samuel and Appel, Stefan and Buchmann, Alejandro},\nbooktitle = {SIGMETRICS/Performance 2009 International Conference, Seattle, WA, USA, June 15--19, 2009},\nmonth = {June},\ntitleaddon = {{(Demo Paper)}},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/569.pdf},\ntitle = {{A Performance Test Harness For Publish/Subscribe Middleware}},\nurl = {http://www.sigmetrics.org/conferences/sigmetrics/2009/program_sigmetrics-demo.shtml},\nyear = {2009}\n}\n
\n
\nPublish/subscribe is becoming increasingly popular as communication paradigm for loosely-coupled message exchange. It is used as a building block in major new software architectures and technology domains such as Enterprise Service Bus, Enterprise Application Integration, Service-Oriented Architecture and Event-Driven Architecture. The growing adoption of these technologies leads to a strong need for benchmarks and performance evaluation tools in this area. In this demonstration, we present jms2009-PS, a benchmark for publish/subscribe middleware based on the Java Message Service standard interface.\n
\n','
\n@inproceedings{SaKoApBu2009-SIGMETRICS-jms2009_PS,\n  abstract = {Publish/subscribe is becoming increasingly popular as communication paradigm for loosely-coupled message exchange. It is used as a building block in major new software architectures and technology domains such as Enterprise Service Bus, Enterprise Application Integration, Service-Oriented Architecture and Event-Driven Architecture. The growing adoption of these technologies leads to a strong need for benchmarks and performance evaluation tools in this area. In this demonstration, we present jms2009-PS, a benchmark for publish/subscribe middleware based on the Java Message Service standard interface.},\n  author = {Sachs, Kai and Kounev, Samuel and Appel, Stefan and Buchmann, Alejandro},\n  booktitle = {SIGMETRICS/Performance 2009 International Conference, Seattle, WA, USA, June 15--19, 2009},\n  month = {June},\n  titleaddon = {{(Demo Paper)}},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/569.pdf},\n  title = {{A Performance Test Harness For Publish/Subscribe Middleware}},\n  url = {http://www.sigmetrics.org/conferences/sigmetrics/2009/program_sigmetrics-demo.shtml},\n  year = {2009}\n}\n
\n\n','Publish/subscribe is becoming increasingly popular as communication paradigm for loosely-coupled message exchange. It is used as a building block in major new software architectures and technology domains such as Enterprise Service Bus, Enterprise Application Integration, Service-Oriented Architecture and Event-Driven Architecture. The growing adoption of these technologies leads to a strong need for benchmarks and performance evaluation tools in this area. In this demonstration, we present jms2009-PS, a benchmark for publish/subscribe middleware based on the Java Message Service standard interface.','{A Performance Test Harness For Publish/Subscribe Middleware}',0,6,2009,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:40:59',0),(570,'paper','SaKoBaBu2007-EPEW-WorkloadChar_SPECjms2007','inproceedings','@inproceedings{SaKoBaBu2007-EPEW-WorkloadChar_SPECjms2007,\n abstract = {Message-oriented middleware (MOM) is at the core of a vast number of financial services and telco applications, and is gaining increasing traction in other industries, such as manufacturing, transportation, health-care and supply chain management. There is a strong interest in the end user and analyst communities for a standardized benchmark suite for evaluating the performance and scalability of MOM. In this paper, we present a workload characterization of the SPECjms2007 benchmark which is the world\'s first industry-standard benchmark specialized for MOM. In addition to providing standard workload and metrics for MOM performance, the benchmark provides a flexible performance analysis framework that allows users to customize the workload according to their requirements. The workload characterization presented in this paper serves two purposes i) to help users understand the internal components of the SPECjms2007 workload and the way they are scaled, ii) to show how the workload can be customized to exercise and evaluate selected aspects of MOM performance.We discuss how the various features supported by the benchmark can be exploited for in-depth performance analysis of MOM infrastructures.},\n address = {Heidelberg, Germany},\n author = {Kai Sachs and Samuel Kounev and Jean Bacon and Alejandro Buchmann},\n booktitle = {Formal Methods and Stochastic Models for Performance Evaluation, Proceedings of the 4th European Performance Engineering Workshop (EPEW 2007), Berlin, Germany, September 27--28, 2007},\n doi = {10.1007/978-3-540-75211-0_17},\n editor = {Katinka Wolter},\n isbn = {978-3-540-75210-3},\n month = {September},\n pages = {228--244},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/570.pdf},\n publisher = {Springer Verlag},\n series = {Lecture Notes in Computer Science (LNCS)},\n title = {{Workload Characterization of the SPECjms2007 Benchmark}},\n url = {http://www.springer.com/computer/programming/book/978-3-540-75210-3},\n volume = {4748},\n year = {2007},\n}\n\n','\n\nKai Sachs, Samuel Kounev, Jean Bacon, and Alejandro Buchmann.\nWorkload Characterization of the SPECjms2007 Benchmark.\nIn Formal Methods and Stochastic Models for Performance\nEvaluation, Proceedings of the 4th European Performance Engineering Workshop\n(EPEW 2007), Berlin, Germany, September 27-28, 2007, Katinka Wolter,\neditor, September 2007, volume 4748 of Lecture Notes in Computer Science\n(LNCS), pages 228-244. Springer Verlag, Heidelberg, Germany.\nSeptember 2007.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{SaKoBaBu2007-EPEW-WorkloadChar_SPECjms2007,\nabstract = {Message-oriented middleware (MOM) is at the core of a vast number of financial services and telco applications, and is gaining increasing traction in other industries, such as manufacturing, transportation, health-care and supply chain management. There is a strong interest in the end user and analyst communities for a standardized benchmark suite for evaluating the performance and scalability of MOM. In this paper, we present a workload characterization of the SPECjms2007 benchmark which is the world\'s first industry-standard benchmark specialized for MOM. In addition to providing standard workload and metrics for MOM performance, the benchmark provides a flexible performance analysis framework that allows users to customize the workload according to their requirements. The workload characterization presented in this paper serves two purposes i) to help users understand the internal components of the SPECjms2007 workload and the way they are scaled, ii) to show how the workload can be customized to exercise and evaluate selected aspects of MOM performance.We discuss how the various features supported by the benchmark can be exploited for in-depth performance analysis of MOM infrastructures.},\naddress = {Heidelberg, Germany},\nauthor = {Kai Sachs and Samuel Kounev and Jean Bacon and Alejandro Buchmann},\nbooktitle = {Formal Methods and Stochastic Models for Performance Evaluation, Proceedings of the 4th European Performance Engineering Workshop (EPEW 2007), Berlin, Germany, September 27--28, 2007},\ndoi = {10.1007/978-3-540-75211-0_17},\neditor = {Katinka Wolter},\nisbn = {978-3-540-75210-3},\nmonth = {September},\npages = {228--244},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/570.pdf},\npublisher = {Springer Verlag},\nseries = {Lecture Notes in Computer Science (LNCS)},\ntitle = {{Workload Characterization of the SPECjms2007 Benchmark}},\nurl = {http://www.springer.com/computer/programming/book/978-3-540-75210-3},\nvolume = {4748},\nyear = {2007}\n}\n
\n
\nMessage-oriented middleware (MOM) is at the core of a vast number of financial services and telco applications, and is gaining increasing traction in other industries, such as manufacturing, transportation, health-care and supply chain management. There is a strong interest in the end user and analyst communities for a standardized benchmark suite for evaluating the performance and scalability of MOM. In this paper, we present a workload characterization of the SPECjms2007 benchmark which is the world\'s first industry-standard benchmark specialized for MOM. In addition to providing standard workload and metrics for MOM performance, the benchmark provides a flexible performance analysis framework that allows users to customize the workload according to their requirements. The workload characterization presented in this paper serves two purposes i) to help users understand the internal components of the SPECjms2007 workload and the way they are scaled, ii) to show how the workload can be customized to exercise and evaluate selected aspects of MOM performance.We discuss how the various features supported by the benchmark can be exploited for in-depth performance analysis of MOM infrastructures.\n
\n','
\n@inproceedings{SaKoBaBu2007-EPEW-WorkloadChar_SPECjms2007,\n  abstract = {Message-oriented middleware (MOM) is at the core of a vast number of financial services and telco applications, and is gaining increasing traction in other industries, such as manufacturing, transportation, health-care and supply chain management. There is a strong interest in the end user and analyst communities for a standardized benchmark suite for evaluating the performance and scalability of MOM. In this paper, we present a workload characterization of the SPECjms2007 benchmark which is the world\'s first industry-standard benchmark specialized for MOM. In addition to providing standard workload and metrics for MOM performance, the benchmark provides a flexible performance analysis framework that allows users to customize the workload according to their requirements. The workload characterization presented in this paper serves two purposes i) to help users understand the internal components of the SPECjms2007 workload and the way they are scaled, ii) to show how the workload can be customized to exercise and evaluate selected aspects of MOM performance.We discuss how the various features supported by the benchmark can be exploited for in-depth performance analysis of MOM infrastructures.},\n  address = {Heidelberg, Germany},\n  author = {Kai Sachs and Samuel Kounev and Jean Bacon and Alejandro Buchmann},\n  booktitle = {Formal Methods and Stochastic Models for Performance Evaluation, Proceedings of the 4th European Performance Engineering Workshop (EPEW 2007), Berlin, Germany, September 27--28, 2007},\n  doi = {10.1007/978-3-540-75211-0_17},\n  editor = {Katinka Wolter},\n  isbn = {978-3-540-75210-3},\n  month = {September},\n  pages = {228--244},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/570.pdf},\n  publisher = {Springer Verlag},\n  series = {Lecture Notes in Computer Science (LNCS)},\n  title = {{Workload Characterization of the SPECjms2007 Benchmark}},\n  url = {http://www.springer.com/computer/programming/book/978-3-540-75210-3},\n  volume = {4748},\n  year = {2007}\n}\n
\n\n','Message-oriented middleware (MOM) is at the core of a vast number of financial services and telco applications, and is gaining increasing traction in other industries, such as manufacturing, transportation, health-care and supply chain management. There is a strong interest in the end user and analyst communities for a standardized benchmark suite for evaluating the performance and scalability of MOM. In this paper, we present a workload characterization of the SPECjms2007 benchmark which is the world\'s first industry-standard benchmark specialized for MOM. In addition to providing standard workload and metrics for MOM performance, the benchmark provides a flexible performance analysis framework that allows users to customize the workload according to their requirements. The workload characterization presented in this paper serves two purposes i) to help users understand the internal components of the SPECjms2007 workload and the way they are scaled, ii) to show how the workload can be customized to exercise and evaluate selected aspects of MOM performance.We discuss how the various features supported by the benchmark can be exploited for in-depth performance analysis of MOM infrastructures.','{Workload Characterization of the SPECjms2007 Benchmark}',0,9,2007,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(571,'paper','SaKoBaBu2008-PERFEVAL-SPECjms2007','article','@article{SaKoBaBu2008-PERFEVAL-SPECjms2007,\n abstract = {Message-oriented middleware (MOM) is at the core of a vast number of financial services and telco applications, and is gaining increasing traction in other industries, such as manufacturing, transportation, health-care and supply chain management. Novel messaging applications, however, pose some serious performance and scalability challenges. In this paper, we present a methodology for performance evaluation of MOM platforms using the SPECjms2007 benchmark which is the world\'s first industry-standard benchmark specialized for MOM. SPECjms2007 is based on a novel application in the supply chain management domain designed to stress MOM infrastructures in a manner representative of real-world applications. In addition to providing a standard workload and metrics for MOM performance, the benchmark provides a flexible performance analysis framework that allows users to tailor the workload to their requirements. The contributions of this paper are: i) we present a detailed workload characterization of SPECjms2007 with the goal to help users understand the internal components of the workload and the way they are scaled, ii) we show how the workload can be customized to exercise and evaluate selected aspects of MOM performance, iii) we present a case study of a leading JMS platform, the BEA WebLogic server, conducting an in-depth performance analysis of the platform under a number of different workload and configuration scenarios. The methodology we propose is the first one that uses an industry-standard benchmark providing both a representative workload as well as the ability to customize it to evaluate the features of MOM platforms selectively.},\n address = {Amsterdam, The Netherlands},\n author = {Kai Sachs and Samuel Kounev and Jean Bacon and Alejandro Buchmann},\n doi = {10.1016/j.peva.2009.01.003},\n journal = {Performance Evaluation},\n month = {August},\n number = {8},\n pages = {410--434},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/571.pdf},\n publisher = {Elsevier Science Publishers B. V.},\n title = {{Performance evaluation of message-oriented middleware using the SPECjms2007 benchmark}},\n url = {http://www.elsevier.com/wps/find/journaldescription.cws_home/505618/description},\n volume = {66},\n year = {2009},\n}\n\n','\n\nKai Sachs, Samuel Kounev, Jean Bacon, and Alejandro Buchmann.\nPerformance evaluation of message-oriented middleware using the\nSPECjms2007 benchmark.\nPerformance Evaluation, 66(8):410-434, August 2009, Elsevier\nScience Publishers B. V., Amsterdam, The Netherlands.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@article{SaKoBaBu2008-PERFEVAL-SPECjms2007,\nabstract = {Message-oriented middleware (MOM) is at the core of a vast number of financial services and telco applications, and is gaining increasing traction in other industries, such as manufacturing, transportation, health-care and supply chain management. Novel messaging applications, however, pose some serious performance and scalability challenges. In this paper, we present a methodology for performance evaluation of MOM platforms using the SPECjms2007 benchmark which is the world\'s first industry-standard benchmark specialized for MOM. SPECjms2007 is based on a novel application in the supply chain management domain designed to stress MOM infrastructures in a manner representative of real-world applications. In addition to providing a standard workload and metrics for MOM performance, the benchmark provides a flexible performance analysis framework that allows users to tailor the workload to their requirements. The contributions of this paper are: i) we present a detailed workload characterization of SPECjms2007 with the goal to help users understand the internal components of the workload and the way they are scaled, ii) we show how the workload can be customized to exercise and evaluate selected aspects of MOM performance, iii) we present a case study of a leading JMS platform, the BEA WebLogic server, conducting an in-depth performance analysis of the platform under a number of different workload and configuration scenarios. The methodology we propose is the first one that uses an industry-standard benchmark providing both a representative workload as well as the ability to customize it to evaluate the features of MOM platforms selectively.},\naddress = {Amsterdam, The Netherlands},\nauthor = {Kai Sachs and Samuel Kounev and Jean Bacon and Alejandro Buchmann},\ndoi = {10.1016/j.peva.2009.01.003},\njournal = {Performance Evaluation},\nmonth = {August},\nnumber = {8},\npages = {410--434},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/571.pdf},\npublisher = {Elsevier Science Publishers B. V.},\ntitle = {{Performance evaluation of message-oriented middleware using the SPECjms2007 benchmark}},\nurl = {http://www.elsevier.com/wps/find/journaldescription.cws_home/505618/description},\nvolume = {66},\nyear = {2009}\n}\n
\n
\nMessage-oriented middleware (MOM) is at the core of a vast number of financial services and telco applications, and is gaining increasing traction in other industries, such as manufacturing, transportation, health-care and supply chain management. Novel messaging applications, however, pose some serious performance and scalability challenges. In this paper, we present a methodology for performance evaluation of MOM platforms using the SPECjms2007 benchmark which is the world\'s first industry-standard benchmark specialized for MOM. SPECjms2007 is based on a novel application in the supply chain management domain designed to stress MOM infrastructures in a manner representative of real-world applications. In addition to providing a standard workload and metrics for MOM performance, the benchmark provides a flexible performance analysis framework that allows users to tailor the workload to their requirements. The contributions of this paper are: i) we present a detailed workload characterization of SPECjms2007 with the goal to help users understand the internal components of the workload and the way they are scaled, ii) we show how the workload can be customized to exercise and evaluate selected aspects of MOM performance, iii) we present a case study of a leading JMS platform, the BEA WebLogic server, conducting an in-depth performance analysis of the platform under a number of different workload and configuration scenarios. The methodology we propose is the first one that uses an industry-standard benchmark providing both a representative workload as well as the ability to customize it to evaluate the features of MOM platforms selectively.\n
\n','
\n@article{SaKoBaBu2008-PERFEVAL-SPECjms2007,\n  abstract = {Message-oriented middleware (MOM) is at the core of a vast number of financial services and telco applications, and is gaining increasing traction in other industries, such as manufacturing, transportation, health-care and supply chain management. Novel messaging applications, however, pose some serious performance and scalability challenges. In this paper, we present a methodology for performance evaluation of MOM platforms using the SPECjms2007 benchmark which is the world\'s first industry-standard benchmark specialized for MOM. SPECjms2007 is based on a novel application in the supply chain management domain designed to stress MOM infrastructures in a manner representative of real-world applications. In addition to providing a standard workload and metrics for MOM performance, the benchmark provides a flexible performance analysis framework that allows users to tailor the workload to their requirements. The contributions of this paper are: i) we present a detailed workload characterization of SPECjms2007 with the goal to help users understand the internal components of the workload and the way they are scaled, ii) we show how the workload can be customized to exercise and evaluate selected aspects of MOM performance, iii) we present a case study of a leading JMS platform, the BEA WebLogic server, conducting an in-depth performance analysis of the platform under a number of different workload and configuration scenarios. The methodology we propose is the first one that uses an industry-standard benchmark providing both a representative workload as well as the ability to customize it to evaluate the features of MOM platforms selectively.},\n  address = {Amsterdam, The Netherlands},\n  author = {Kai Sachs and Samuel Kounev and Jean Bacon and Alejandro Buchmann},\n  doi = {10.1016/j.peva.2009.01.003},\n  journal = {Performance Evaluation},\n  month = {August},\n  number = {8},\n  pages = {410--434},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/571.pdf},\n  publisher = {Elsevier Science Publishers B. V.},\n  title = {{Performance evaluation of message-oriented middleware using the SPECjms2007 benchmark}},\n  url = {http://www.elsevier.com/wps/find/journaldescription.cws_home/505618/description},\n  volume = {66},\n  year = {2009}\n}\n
\n\n','Message-oriented middleware (MOM) is at the core of a vast number of financial services and telco applications, and is gaining increasing traction in other industries, such as manufacturing, transportation, health-care and supply chain management. Novel messaging applications, however, pose some serious performance and scalability challenges. In this paper, we present a methodology for performance evaluation of MOM platforms using the SPECjms2007 benchmark which is the world\'s first industry-standard benchmark specialized for MOM. SPECjms2007 is based on a novel application in the supply chain management domain designed to stress MOM infrastructures in a manner representative of real-world applications. In addition to providing a standard workload and metrics for MOM performance, the benchmark provides a flexible performance analysis framework that allows users to tailor the workload to their requirements. The contributions of this paper are: i) we present a detailed workload characterization of SPECjms2007 with the goal to help users understand the internal components of the workload and the way they are scaled, ii) we show how the workload can be customized to exercise and evaluate selected aspects of MOM performance, iii) we present a case study of a leading JMS platform, the BEA WebLogic server, conducting an in-depth performance analysis of the platform under a number of different workload and configuration scenarios. The methodology we propose is the first one that uses an industry-standard benchmark providing both a representative workload as well as the ability to customize it to evaluate the features of MOM platforms selectively.','{Performance evaluation of message-oriented middleware using the SPECjms2007 benchmark}',0,8,2009,8,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(572,'paper','SaKoBu2011-SoSyM-PerfModMoEdSys','article','@article{SaKoBu2011-SoSyM-PerfModMoEdSys,\n title = {Performance modeling and analysis of message-oriented event-driven systems},\n journal = {Journal of Software and Systems Modeling},\n pages = {705--729},\n publisher = {Springer-Verlag},\n year = {2013},\n volume = {12},\n number = {4},\n month = {},\n abstract = {Message-oriented event-driven systems are becoming increasingly ubiquitous in many industry domains including telecommunications, transportation and supply chain management. Applications in these areas typically have stringent requirements for performance and scalability. To guarantee adequate quality-of-service, systems must be subjected to a rigorous performance and scalability analysis before they are put into production. In this paper, we present a comprehensive modeling methodology for message-oriented event-driven systems in the context of a case study of a representative application in the supply chain management domain. The methodology, which is based on queueing Petri nets, provides a basis for performance analysis and capacity planning. We study a deployment of the SPECjms2007 standard benchmark on a leading commercial middleware platform. A detailed system model is built in a step-by-step fashion and then used to predict the system performance under various workload and configuration scenarios. After the case study, we present a set of generic performance modeling patterns that can be used as building blocks when modeling message-oriented event-driven systems. The results demonstrate the effectiveness, practicality and accuracy of the proposed modeling and prediction approach.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/572.pdf},\n issn = {1619-1366},\n doi = {10.1007/s10270-012-0228-1},\n author = {Sachs, Kai and Kounev, Samuel and Buchmann, Alejandro},\n}\n\n','\n\nKai Sachs, Samuel Kounev, and Alejandro Buchmann.\nPerformance modeling and analysis of message-oriented event-driven\nsystems.\nJournal of Software and Systems Modeling, 12(4):705-729, 2013,\nSpringer-Verlag.\n[ bib | DOI | .pdf | Abstract  ] 
\n@article{SaKoBu2011-SoSyM-PerfModMoEdSys,\ntitle = {Performance modeling and analysis of message-oriented event-driven systems},\njournal = {Journal of Software and Systems Modeling},\npages = {705--729},\npublisher = {Springer-Verlag},\nyear = {2013},\nvolume = {12},\nnumber = {4},\nmonth = {},\nabstract = {Message-oriented event-driven systems are becoming increasingly ubiquitous in many industry domains including telecommunications, transportation and supply chain management. Applications in these areas typically have stringent requirements for performance and scalability. To guarantee adequate quality-of-service, systems must be subjected to a rigorous performance and scalability analysis before they are put into production. In this paper, we present a comprehensive modeling methodology for message-oriented event-driven systems in the context of a case study of a representative application in the supply chain management domain. The methodology, which is based on queueing Petri nets, provides a basis for performance analysis and capacity planning. We study a deployment of the SPECjms2007 standard benchmark on a leading commercial middleware platform. A detailed system model is built in a step-by-step fashion and then used to predict the system performance under various workload and configuration scenarios. After the case study, we present a set of generic performance modeling patterns that can be used as building blocks when modeling message-oriented event-driven systems. The results demonstrate the effectiveness, practicality and accuracy of the proposed modeling and prediction approach.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/572.pdf},\nissn = {1619-1366},\ndoi = {10.1007/s10270-012-0228-1},\nauthor = {Sachs, Kai and Kounev, Samuel and Buchmann, Alejandro}\n}\n
\n
\nMessage-oriented event-driven systems are becoming increasingly ubiquitous in many industry domains including telecommunications, transportation and supply chain management. Applications in these areas typically have stringent requirements for performance and scalability. To guarantee adequate quality-of-service, systems must be subjected to a rigorous performance and scalability analysis before they are put into production. In this paper, we present a comprehensive modeling methodology for message-oriented event-driven systems in the context of a case study of a representative application in the supply chain management domain. The methodology, which is based on queueing Petri nets, provides a basis for performance analysis and capacity planning. We study a deployment of the SPECjms2007 standard benchmark on a leading commercial middleware platform. A detailed system model is built in a step-by-step fashion and then used to predict the system performance under various workload and configuration scenarios. After the case study, we present a set of generic performance modeling patterns that can be used as building blocks when modeling message-oriented event-driven systems. The results demonstrate the effectiveness, practicality and accuracy of the proposed modeling and prediction approach.\n
\n','
\n@article{SaKoBu2011-SoSyM-PerfModMoEdSys,\n  title = {Performance modeling and analysis of message-oriented event-driven systems},\n  journal = {Journal of Software and Systems Modeling},\n  pages = {705--729},\n  publisher = {Springer-Verlag},\n  year = {2013},\n  volume = {12},\n  number = {4},\n  month = {},\n  abstract = {Message-oriented event-driven systems are becoming increasingly ubiquitous in many industry domains including telecommunications, transportation and supply chain management. Applications in these areas typically have stringent requirements for performance and scalability. To guarantee adequate quality-of-service, systems must be subjected to a rigorous performance and scalability analysis before they are put into production. In this paper, we present a comprehensive modeling methodology for message-oriented event-driven systems in the context of a case study of a representative application in the supply chain management domain. The methodology, which is based on queueing Petri nets, provides a basis for performance analysis and capacity planning. We study a deployment of the SPECjms2007 standard benchmark on a leading commercial middleware platform. A detailed system model is built in a step-by-step fashion and then used to predict the system performance under various workload and configuration scenarios. After the case study, we present a set of generic performance modeling patterns that can be used as building blocks when modeling message-oriented event-driven systems. The results demonstrate the effectiveness, practicality and accuracy of the proposed modeling and prediction approach.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/572.pdf},\n  issn = {1619-1366},\n  doi = {10.1007/s10270-012-0228-1},\n  author = {Sachs, Kai and Kounev, Samuel and Buchmann, Alejandro}\n}\n
\n\n','Message-oriented event-driven systems are becoming increasingly ubiquitous in many industry domains including telecommunications, transportation and supply chain management. Applications in these areas typically have stringent requirements for performance and scalability. To guarantee adequate quality-of-service, systems must be subjected to a rigorous performance and scalability analysis before they are put into production. In this paper, we present a comprehensive modeling methodology for message-oriented event-driven systems in the context of a case study of a representative application in the supply chain management domain. The methodology, which is based on queueing Petri nets, provides a basis for performance analysis and capacity planning. We study a deployment of the SPECjms2007 standard benchmark on a leading commercial middleware platform. A detailed system model is built in a step-by-step fashion and then used to predict the system performance under various workload and configuration scenarios. After the case study, we present a set of generic performance modeling patterns that can be used as building blocks when modeling message-oriented event-driven systems. The results demonstrate the effectiveness, practicality and accuracy of the proposed modeling and prediction approach.','Performance modeling and analysis of message-oriented event-driven systems',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(573,'paper','SaKoCaBu2007-SPEC_BW-BenchmarkingMOM','inproceedings','@inproceedings{SaKoCaBu2007-SPEC_BW-BenchmarkingMOM,\n abstract = {Message-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern information-driven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scalability of MOM. With all major vendors adopting JMS (Java Message Service) as a standard interface to MOM servers, there is at last a means for creating a standardized workload for evaluating products in this space. This paper describes a novel application in the supply chain management domain that has been specifically designed as a representative workload scenario for evaluating the performance and scalability of MOM products. This scenario is used as a basis in SPEC\'s new SPECjms benchmark which will be the world\'s first industry-standard benchmark for MOM.},\n author = {Kai Sachs and Samuel Kounev and Marc Carter and Alejandro Buchmann},\n booktitle = {Proceedings of the 2007 SPEC Benchmark Workshop, Austin, Texas, January 21, 2007},\n month = {January},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/573.pdf},\n publisher = {SPEC},\n title = {{Designing a Workload Scenario for Benchmarking Message-Oriented Middleware}},\n url = {http://www.spec.org/workshops/2007/austin/},\n year = {2007},\n}\n\n','\n\nKai Sachs, Samuel Kounev, Marc Carter, and Alejandro Buchmann.\nDesigning a Workload Scenario for Benchmarking Message-Oriented\nMiddleware.\nIn Proceedings of the 2007 SPEC Benchmark Workshop, Austin,\nTexas, January 21, 2007, January 2007. SPEC.\nJanuary 2007.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{SaKoCaBu2007-SPEC_BW-BenchmarkingMOM,\nabstract = {Message-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern information-driven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scalability of MOM. With all major vendors adopting JMS (Java Message Service) as a standard interface to MOM servers, there is at last a means for creating a standardized workload for evaluating products in this space. This paper describes a novel application in the supply chain management domain that has been specifically designed as a representative workload scenario for evaluating the performance and scalability of MOM products. This scenario is used as a basis in SPEC\'s new SPECjms benchmark which will be the world\'s first industry-standard benchmark for MOM.},\nauthor = {Kai Sachs and Samuel Kounev and Marc Carter and Alejandro Buchmann},\nbooktitle = {Proceedings of the 2007 SPEC Benchmark Workshop, Austin, Texas, January 21, 2007},\nmonth = {January},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/573.pdf},\npublisher = {SPEC},\ntitle = {{Designing a Workload Scenario for Benchmarking Message-Oriented Middleware}},\nurl = {http://www.spec.org/workshops/2007/austin/},\nyear = {2007}\n}\n
\n
\nMessage-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern information-driven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scalability of MOM. With all major vendors adopting JMS (Java Message Service) as a standard interface to MOM servers, there is at last a means for creating a standardized workload for evaluating products in this space. This paper describes a novel application in the supply chain management domain that has been specifically designed as a representative workload scenario for evaluating the performance and scalability of MOM products. This scenario is used as a basis in SPEC\'s new SPECjms benchmark which will be the world\'s first industry-standard benchmark for MOM.\n
\n','
\n@inproceedings{SaKoCaBu2007-SPEC_BW-BenchmarkingMOM,\n  abstract = {Message-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern information-driven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scalability of MOM. With all major vendors adopting JMS (Java Message Service) as a standard interface to MOM servers, there is at last a means for creating a standardized workload for evaluating products in this space. This paper describes a novel application in the supply chain management domain that has been specifically designed as a representative workload scenario for evaluating the performance and scalability of MOM products. This scenario is used as a basis in SPEC\'s new SPECjms benchmark which will be the world\'s first industry-standard benchmark for MOM.},\n  author = {Kai Sachs and Samuel Kounev and Marc Carter and Alejandro Buchmann},\n  booktitle = {Proceedings of the 2007 SPEC Benchmark Workshop, Austin, Texas, January 21, 2007},\n  month = {January},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/573.pdf},\n  publisher = {SPEC},\n  title = {{Designing a Workload Scenario for Benchmarking Message-Oriented Middleware}},\n  url = {http://www.spec.org/workshops/2007/austin/},\n  year = {2007}\n}\n
\n\n','Message-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern information-driven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scalability of MOM. With all major vendors adopting JMS (Java Message Service) as a standard interface to MOM servers, there is at last a means for creating a standardized workload for evaluating products in this space. This paper describes a novel application in the supply chain management domain that has been specifically designed as a representative workload scenario for evaluating the performance and scalability of MOM products. This scenario is used as a basis in SPEC\'s new SPECjms benchmark which will be the world\'s first industry-standard benchmark for MOM.','{Designing a Workload Scenario for Benchmarking Message-Oriented Middleware}',0,1,2007,1,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(579,'paper','SchroterMuhlRichling2010Stochastic','inproceedings','@inproceedings{SchroterMuhlRichling2010Stochastic,\n author = {Schr{\\\"{o}}ter, Arnd and M{\\\"{u}}hl, Gero and Kounev, Samuel and Parzyjegla, Helge and Richling, Jan},\n booktitle = {4th ACM International Conference on Distributed Event-Based Systems (DEBS 2010), July 12-15, Cambridge, United Kingdom},\n note = {Acceptance Rate: 25\\%},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/579.pdf},\n publisher = {ACM, New York, USA},\n title = {{Stochastic Performance Analysis and Capacity Planning of Publish/Subscribe Systems}},\n year = {2010},\n}\n\n','\n\nArnd Schröter, Gero Mühl, Samuel Kounev, Helge Parzyjegla, and Jan\nRichling.\nStochastic Performance Analysis and Capacity Planning of\nPublish/Subscribe Systems.\nIn 4th ACM International Conference on Distributed Event-Based\nSystems (DEBS 2010), July 12-15, Cambridge, United Kingdom, 2010. ACM, New\nYork, USA.\n2010, Acceptance Rate: 25%.\n[ bib | .pdf  ] 
\n@inproceedings{SchroterMuhlRichling2010Stochastic,\nauthor = {Schr{\\\"{o}}ter, Arnd and M{\\\"{u}}hl, Gero and Kounev, Samuel and Parzyjegla, Helge and Richling, Jan},\nbooktitle = {4th ACM International Conference on Distributed Event-Based Systems (DEBS 2010), July 12-15, Cambridge, United Kingdom},\nnote = {Acceptance Rate: 25\\%},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/579.pdf},\npublisher = {ACM, New York, USA},\ntitle = {{Stochastic Performance Analysis and Capacity Planning of Publish/Subscribe Systems}},\nyear = {2010}\n}\n
\n
\n','
\n@inproceedings{SchroterMuhlRichling2010Stochastic,\n  author = {Schr{\\\"{o}}ter, Arnd and M{\\\"{u}}hl, Gero and Kounev, Samuel and Parzyjegla, Helge and Richling, Jan},\n  booktitle = {4th ACM International Conference on Distributed Event-Based Systems (DEBS 2010), July 12-15, Cambridge, United Kingdom},\n  note = {Acceptance Rate: 25\\%},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/579.pdf},\n  publisher = {ACM, New York, USA},\n  title = {{Stochastic Performance Analysis and Capacity Planning of Publish/Subscribe Systems}},\n  year = {2010}\n}\n
\n\n',NULL,'{Stochastic Performance Analysis and Capacity Planning of Publish/Subscribe Systems}',0,0,2010,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(580,'paper','schuster2010a','inproceedings','@inproceedings{schuster2010a,\n abstract = {In recent years continuously changing market situations required IT systems that are flexible and highly responsive to changes of the underlying business processes. The transformation to service-oriented architecture (SOA) concepts, mainly services and loose coupling, promises to meet these demands. However, elevated complexity in management and evolution processes is required for the migration of existing systems towards SOA. Studies in this area of research have revealed a gap between in continuous and actual tool support of development teams throughout the process phases of evolution processes. Thus, in this article we introduce a method that fosters evolution by an iterative approach and illustrate how each phase of this method can be tool-supported.},\n author = {Thomas Schuster and Christoph Rathfelder and Nelly Schuster and Jens Nimis},\n booktitle = {Proceedings of the International Workshop on SOA Migration and Evolution 2010 (SOAME 2010) as part of the 14th European Conference on Software Maintenance and Reengineering (CSMR 2010)},\n day = {15},\n month = {March},\n pages = {1--10},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/580.pdf},\n title = {Comprehensive tool support for iterative SOA evolution},\n year = {2010},\n}\n\n','\n\nThomas Schuster, Christoph Rathfelder, Nelly Schuster, and Jens Nimis.\nComprehensive tool support for iterative soa evolution.\nIn Proceedings of the International Workshop on SOA Migration\nand Evolution 2010 (SOAME 2010) as part of the 14th European Conference on\nSoftware Maintenance and Reengineering (CSMR 2010), March 15, 2010, pages\n1-10.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{schuster2010a,\nabstract = {In recent years continuously changing market situations required IT systems that are flexible and highly responsive to changes of the underlying business processes. The transformation to service-oriented architecture (SOA) concepts, mainly services and loose coupling, promises to meet these demands. However, elevated complexity in management and evolution processes is required for the migration of existing systems towards SOA. Studies in this area of research have revealed a gap between in continuous and actual tool support of development teams throughout the process phases of evolution processes. Thus, in this article we introduce a method that fosters evolution by an iterative approach and illustrate how each phase of this method can be tool-supported.},\nauthor = {Thomas Schuster and Christoph Rathfelder and Nelly Schuster and Jens Nimis},\nbooktitle = {Proceedings of the International Workshop on SOA Migration and Evolution 2010 (SOAME 2010) as part of the 14th European Conference on Software Maintenance and Reengineering (CSMR 2010)},\nday = {15},\nmonth = {March},\npages = {1--10},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/580.pdf},\ntitle = {Comprehensive tool support for iterative SOA evolution},\nyear = {2010}\n}\n
\n
\nIn recent years continuously changing market situations required IT systems that are flexible and highly responsive to changes of the underlying business processes. The transformation to service-oriented architecture (SOA) concepts, mainly services and loose coupling, promises to meet these demands. However, elevated complexity in management and evolution processes is required for the migration of existing systems towards SOA. Studies in this area of research have revealed a gap between in continuous and actual tool support of development teams throughout the process phases of evolution processes. Thus, in this article we introduce a method that fosters evolution by an iterative approach and illustrate how each phase of this method can be tool-supported.\n
\n','
\n@inproceedings{schuster2010a,\n  abstract = {In recent years continuously changing market situations required IT systems that are flexible and highly responsive to changes of the underlying business processes. The transformation to service-oriented architecture (SOA) concepts, mainly services and loose coupling, promises to meet these demands. However, elevated complexity in management and evolution processes is required for the migration of existing systems towards SOA. Studies in this area of research have revealed a gap between in continuous and actual tool support of development teams throughout the process phases of evolution processes. Thus, in this article we introduce a method that fosters evolution by an iterative approach and illustrate how each phase of this method can be tool-supported.},\n  author = {Thomas Schuster and Christoph Rathfelder and Nelly Schuster and Jens Nimis},\n  booktitle = {Proceedings of the International Workshop on SOA Migration and Evolution 2010 (SOAME 2010) as part of the 14th European Conference on Software Maintenance and Reengineering (CSMR 2010)},\n  day = {15},\n  month = {March},\n  pages = {1--10},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/580.pdf},\n  title = {Comprehensive tool support for iterative SOA evolution},\n  year = {2010}\n}\n
\n\n','In recent years continuously changing market situations required IT systems that are flexible and highly responsive to changes of the underlying business processes. The transformation to service-oriented architecture (SOA) concepts, mainly services and loose coupling, promises to meet these demands. However, elevated complexity in management and evolution processes is required for the migration of existing systems towards SOA. Studies in this area of research have revealed a gap between in continuous and actual tool support of development teams throughout the process phases of evolution processes. Thus, in this article we introduce a method that fosters evolution by an iterative approach and illustrate how each phase of this method can be tool-supported.','Comprehensive tool support for iterative SOA evolution',0,3,2010,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(584,'paper','sp2007-SPEC-SPECjms2007','misc','@misc{sp2007-SPEC-SPECjms2007,\n author = {SPEC},\n howpublished = {Standard Performance Evaluation Corporation},\n month = {October},\n note = {SPECtacular Performance Award},\n title = {{SPECjms2007 - First industry-standard benchmark for enterprise messaging servers (JMS~1.1).}},\n url = {http://www.spec.org/jms2007/},\n year = {2007},\n}\n\n','\n\nSPEC.\nSPECjms2007 - First industry-standard benchmark for enterprise\nmessaging servers (JMS 1.1).\nStandard Performance Evaluation Corporation, October 2007.\nSPECtacular Performance Award.\n[ bib | http  ] 
\n@misc{sp2007-SPEC-SPECjms2007,\nauthor = {SPEC},\nhowpublished = {Standard Performance Evaluation Corporation},\nmonth = {October},\nnote = {SPECtacular Performance Award},\ntitle = {{SPECjms2007 - First industry-standard benchmark for enterprise messaging servers (JMS~1.1).}},\nurl = {http://www.spec.org/jms2007/},\nyear = {2007}\n}\n
\n
\n','
\n@misc{sp2007-SPEC-SPECjms2007,\n  author = {SPEC},\n  howpublished = {Standard Performance Evaluation Corporation},\n  month = {October},\n  note = {SPECtacular Performance Award},\n  title = {{SPECjms2007 - First industry-standard benchmark for enterprise messaging servers (JMS~1.1).}},\n  url = {http://www.spec.org/jms2007/},\n  year = {2007}\n}\n
\n\n',NULL,'{SPECjms2007 - First industry-standard benchmark for enterprise messaging servers (JMS~1.1).}',0,10,2007,10,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(585,'paper','sp2005-SPEC-SPECjbb2005','misc','@misc{sp2005-SPEC-SPECjbb2005,\n abstract = {SPECjbb2005 (Java Server Benchmark) is SPEC\'s benchmark for evaluating the performance of server side Java. Like its predecessor, SPECjbb2000, SPECjbb2005 evaluates the performance of server side Java by emulating a three-tier client/server system (with emphasis on the middle tier). The benchmark exercises the implementations of the JVM (Java Virtual Machine), JIT (Just-In-Time) compiler, garbage collection, threads and some aspects of the operating system. It also measures the performance of CPUs, caches, memory hierarchy and the scalability of shared memory processors (SMPs). SPECjbb2005 provides a new enhanced workload, implemented in a more object-oriented manner to reflect how real-world applications are designed and introduces new features such as XML processing and BigDecimal computations to make the benchmark a more realistic reflection of today\'s applications.},\n author = {SPEC},\n howpublished = {Standard Performance Evaluation Corporation},\n month = {June},\n note = {SPECtacular Award},\n title = {{SPECjbb2005 - Industry-standard server-side Java benchmark (J2SE 5.0).}},\n url = {http://www.spec.org/jbb2005/},\n year = {2005},\n}\n\n','\n\nSPEC.\nSPECjbb2005 - Industry-standard server-side Java benchmark (J2SE\n5.0).\nStandard Performance Evaluation Corporation, June 2005.\nSPECtacular Award.\n[ bib | http | Abstract  ] 
\n@misc{sp2005-SPEC-SPECjbb2005,\nabstract = {SPECjbb2005 (Java Server Benchmark) is SPEC\'s benchmark for evaluating the performance of server side Java. Like its predecessor, SPECjbb2000, SPECjbb2005 evaluates the performance of server side Java by emulating a three-tier client/server system (with emphasis on the middle tier). The benchmark exercises the implementations of the JVM (Java Virtual Machine), JIT (Just-In-Time) compiler, garbage collection, threads and some aspects of the operating system. It also measures the performance of CPUs, caches, memory hierarchy and the scalability of shared memory processors (SMPs). SPECjbb2005 provides a new enhanced workload, implemented in a more object-oriented manner to reflect how real-world applications are designed and introduces new features such as XML processing and BigDecimal computations to make the benchmark a more realistic reflection of today\'s applications.},\nauthor = {SPEC},\nhowpublished = {Standard Performance Evaluation Corporation},\nmonth = {June},\nnote = {SPECtacular Award},\ntitle = {{SPECjbb2005 - Industry-standard server-side Java benchmark (J2SE 5.0).}},\nurl = {http://www.spec.org/jbb2005/},\nyear = {2005}\n}\n
\n
\nSPECjbb2005 (Java Server Benchmark) is SPEC\'s benchmark for evaluating the performance of server side Java. Like its predecessor, SPECjbb2000, SPECjbb2005 evaluates the performance of server side Java by emulating a three-tier client/server system (with emphasis on the middle tier). The benchmark exercises the implementations of the JVM (Java Virtual Machine), JIT (Just-In-Time) compiler, garbage collection, threads and some aspects of the operating system. It also measures the performance of CPUs, caches, memory hierarchy and the scalability of shared memory processors (SMPs). SPECjbb2005 provides a new enhanced workload, implemented in a more object-oriented manner to reflect how real-world applications are designed and introduces new features such as XML processing and BigDecimal computations to make the benchmark a more realistic reflection of today\'s applications.\n
\n','
\n@misc{sp2005-SPEC-SPECjbb2005,\n  abstract = {SPECjbb2005 (Java Server Benchmark) is SPEC\'s benchmark for evaluating the performance of server side Java. Like its predecessor, SPECjbb2000, SPECjbb2005 evaluates the performance of server side Java by emulating a three-tier client/server system (with emphasis on the middle tier). The benchmark exercises the implementations of the JVM (Java Virtual Machine), JIT (Just-In-Time) compiler, garbage collection, threads and some aspects of the operating system. It also measures the performance of CPUs, caches, memory hierarchy and the scalability of shared memory processors (SMPs). SPECjbb2005 provides a new enhanced workload, implemented in a more object-oriented manner to reflect how real-world applications are designed and introduces new features such as XML processing and BigDecimal computations to make the benchmark a more realistic reflection of today\'s applications.},\n  author = {SPEC},\n  howpublished = {Standard Performance Evaluation Corporation},\n  month = {June},\n  note = {SPECtacular Award},\n  title = {{SPECjbb2005 - Industry-standard server-side Java benchmark (J2SE 5.0).}},\n  url = {http://www.spec.org/jbb2005/},\n  year = {2005}\n}\n
\n\n','SPECjbb2005 (Java Server Benchmark) is SPEC\'s benchmark for evaluating the performance of server side Java. Like its predecessor, SPECjbb2000, SPECjbb2005 evaluates the performance of server side Java by emulating a three-tier client/server system (with emphasis on the middle tier). The benchmark exercises the implementations of the JVM (Java Virtual Machine), JIT (Just-In-Time) compiler, garbage collection, threads and some aspects of the operating system. It also measures the performance of CPUs, caches, memory hierarchy and the scalability of shared memory processors (SMPs). SPECjbb2005 provides a new enhanced workload, implemented in a more object-oriented manner to reflect how real-world applications are designed and introduces new features such as XML processing and BigDecimal computations to make the benchmark a more realistic reflection of today\'s applications.','{SPECjbb2005 - Industry-standard server-side Java benchmark (J2SE 5.0).}',0,6,2005,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(586,'paper','sp2004-SPEC-SPECjAppServer2004','misc','@misc{sp2004-SPEC-SPECjAppServer2004,\n absract = {SPECjAppServer2004 (Java Application Server) is a multi-tier benchmark for measuring the performance of Java 2 Enterprise Edition (J2EE) technology-based application servers. SPECjAppServer2004 is an end-to-end application which exercises all major J2EE technologies implemented by compliant application servers as follows: * The web container, including servlets and JSPs * The EJB container * EJB2.0 Container Managed Persistence * JMS and Message Driven Beans * Transaction management * Database connectivity Moreover, SPECjAppServer2004 also heavily exercises all parts of the underlying infrastructure that make up the application environment, including hardware, JVM software, database software, JDBC drivers, and the system network.},\n author = {SPEC},\n howpublished = {Standard Performance Evaluation Corporation},\n month = {April},\n note = {SPECtacular Performance Award},\n title = {{SPECjAppServer2004 - Industry-standard enterprise Java application server benchmark (J2EE 1.4).}},\n url = {http://www.spec.org/jAppServer2004/},\n year = {2004},\n}\n\n','\n\nSPEC.\nSPECjAppServer2004 - Industry-standard enterprise Java application\nserver benchmark (J2EE 1.4).\nStandard Performance Evaluation Corporation, April 2004.\nSPECtacular Performance Award.\n[ bib | http  ] 
\n@misc{sp2004-SPEC-SPECjAppServer2004,\nabsract = {SPECjAppServer2004 (Java Application Server) is a multi-tier benchmark for measuring the performance of Java 2 Enterprise Edition (J2EE) technology-based application servers. SPECjAppServer2004 is an end-to-end application which exercises all major J2EE technologies implemented by compliant application servers as follows: * The web container, including servlets and JSPs * The EJB container * EJB2.0 Container Managed Persistence * JMS and Message Driven Beans * Transaction management * Database connectivity Moreover, SPECjAppServer2004 also heavily exercises all parts of the underlying infrastructure that make up the application environment, including hardware, JVM software, database software, JDBC drivers, and the system network.},\nauthor = {SPEC},\nhowpublished = {Standard Performance Evaluation Corporation},\nmonth = {April},\nnote = {SPECtacular Performance Award},\ntitle = {{SPECjAppServer2004 - Industry-standard enterprise Java application server benchmark (J2EE 1.4).}},\nurl = {http://www.spec.org/jAppServer2004/},\nyear = {2004}\n}\n
\n
\n','
\n@misc{sp2004-SPEC-SPECjAppServer2004,\n  absract = {SPECjAppServer2004 (Java Application Server) is a multi-tier benchmark for measuring the performance of Java 2 Enterprise Edition (J2EE) technology-based application servers. SPECjAppServer2004 is an end-to-end application which exercises all major J2EE technologies implemented by compliant application servers as follows: * The web container, including servlets and JSPs * The EJB container * EJB2.0 Container Managed Persistence * JMS and Message Driven Beans * Transaction management * Database connectivity Moreover, SPECjAppServer2004 also heavily exercises all parts of the underlying infrastructure that make up the application environment, including hardware, JVM software, database software, JDBC drivers, and the system network.},\n  author = {SPEC},\n  howpublished = {Standard Performance Evaluation Corporation},\n  month = {April},\n  note = {SPECtacular Performance Award},\n  title = {{SPECjAppServer2004 - Industry-standard enterprise Java application server benchmark (J2EE 1.4).}},\n  url = {http://www.spec.org/jAppServer2004/},\n  year = {2004}\n}\n
\n\n',NULL,'{SPECjAppServer2004 - Industry-standard enterprise Java application server benchmark (J2EE 1.4).}',0,4,2004,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(587,'paper','sp2002-SPEC-SPECjAppServer2001','misc','@misc{sp2002-SPEC-SPECjAppServer2001,\n abstract = {SPECjAppServer2001 (Java Application Server) is a client/server benchmark for measuring the performance of Java Enterprise Application Servers using a subset of J2EE API\'s in a complete end-to-end web application. Joining the client-side SPECjvm98 and the server side SPECjbb2000, SPECjAppServer2001 continues the SPEC tradition of giving Java users the most objective and representative benchmark for measuring a system\'s ability to run Java applications. SPEC has designed the SPECjAppServer2001 benchmark to exercise the Java Enterprise Application Server, the Java Virtual Machine (JVM), as well as the server Systems Under Test (SUT). As a true J2EE application the benchmark will require a functional RDBMS (for JDBC) and a Web Server, but the benchmark has been designed so that the SUT can be a single system. Please note that while the SPECjAppServer2001 suite is still available for purchase, the suite has been retired, no further results are being accepted for publication, and support is no longer provided.},\n author = {SPEC},\n howpublished = {Standard Performance Evaluation Corporation},\n month = {September},\n title = {{SPECjAppServer2001 - Industry-standard enterprise Java application server benchmark (J2EE 1.2).}},\n url = {http://www.spec.org/jAppServer2001/},\n year = {2002},\n}\n\n','\n\nSPEC.\nSPECjAppServer2001 - Industry-standard enterprise Java application\nserver benchmark (J2EE 1.2).\nStandard Performance Evaluation Corporation, September 2002.\n[ bib | http | Abstract  ] 
\n@misc{sp2002-SPEC-SPECjAppServer2001,\nabstract = {SPECjAppServer2001 (Java Application Server) is a client/server benchmark for measuring the performance of Java Enterprise Application Servers using a subset of J2EE API\'s in a complete end-to-end web application. Joining the client-side SPECjvm98 and the server side SPECjbb2000, SPECjAppServer2001 continues the SPEC tradition of giving Java users the most objective and representative benchmark for measuring a system\'s ability to run Java applications. SPEC has designed the SPECjAppServer2001 benchmark to exercise the Java Enterprise Application Server, the Java Virtual Machine (JVM), as well as the server Systems Under Test (SUT). As a true J2EE application the benchmark will require a functional RDBMS (for JDBC) and a Web Server, but the benchmark has been designed so that the SUT can be a single system. Please note that while the SPECjAppServer2001 suite is still available for purchase, the suite has been retired, no further results are being accepted for publication, and support is no longer provided.},\nauthor = {SPEC},\nhowpublished = {Standard Performance Evaluation Corporation},\nmonth = {September},\ntitle = {{SPECjAppServer2001 - Industry-standard enterprise Java application server benchmark (J2EE 1.2).}},\nurl = {http://www.spec.org/jAppServer2001/},\nyear = {2002}\n}\n
\n
\nSPECjAppServer2001 (Java Application Server) is a client/server benchmark for measuring the performance of Java Enterprise Application Servers using a subset of J2EE API\'s in a complete end-to-end web application. Joining the client-side SPECjvm98 and the server side SPECjbb2000, SPECjAppServer2001 continues the SPEC tradition of giving Java users the most objective and representative benchmark for measuring a system\'s ability to run Java applications. SPEC has designed the SPECjAppServer2001 benchmark to exercise the Java Enterprise Application Server, the Java Virtual Machine (JVM), as well as the server Systems Under Test (SUT). As a true J2EE application the benchmark will require a functional RDBMS (for JDBC) and a Web Server, but the benchmark has been designed so that the SUT can be a single system. Please note that while the SPECjAppServer2001 suite is still available for purchase, the suite has been retired, no further results are being accepted for publication, and support is no longer provided.\n
\n','
\n@misc{sp2002-SPEC-SPECjAppServer2001,\n  abstract = {SPECjAppServer2001 (Java Application Server) is a client/server benchmark for measuring the performance of Java Enterprise Application Servers using a subset of J2EE API\'s in a complete end-to-end web application. Joining the client-side SPECjvm98 and the server side SPECjbb2000, SPECjAppServer2001 continues the SPEC tradition of giving Java users the most objective and representative benchmark for measuring a system\'s ability to run Java applications. SPEC has designed the SPECjAppServer2001 benchmark to exercise the Java Enterprise Application Server, the Java Virtual Machine (JVM), as well as the server Systems Under Test (SUT). As a true J2EE application the benchmark will require a functional RDBMS (for JDBC) and a Web Server, but the benchmark has been designed so that the SUT can be a single system. Please note that while the SPECjAppServer2001 suite is still available for purchase, the suite has been retired, no further results are being accepted for publication, and support is no longer provided.},\n  author = {SPEC},\n  howpublished = {Standard Performance Evaluation Corporation},\n  month = {September},\n  title = {{SPECjAppServer2001 - Industry-standard enterprise Java application server benchmark (J2EE 1.2).}},\n  url = {http://www.spec.org/jAppServer2001/},\n  year = {2002}\n}\n
\n\n','SPECjAppServer2001 (Java Application Server) is a client/server benchmark for measuring the performance of Java Enterprise Application Servers using a subset of J2EE API\'s in a complete end-to-end web application. Joining the client-side SPECjvm98 and the server side SPECjbb2000, SPECjAppServer2001 continues the SPEC tradition of giving Java users the most objective and representative benchmark for measuring a system\'s ability to run Java applications. SPEC has designed the SPECjAppServer2001 benchmark to exercise the Java Enterprise Application Server, the Java Virtual Machine (JVM), as well as the server Systems Under Test (SUT). As a true J2EE application the benchmark will require a functional RDBMS (for JDBC) and a Web Server, but the benchmark has been designed so that the SUT can be a single system. Please note that while the SPECjAppServer2001 suite is still available for purchase, the suite has been retired, no further results are being accepted for publication, and support is no longer provided.','{SPECjAppServer2001 - Industry-standard enterprise Java application server benchmark (J2EE 1.2).}',0,9,2002,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(588,'paper','sp2002-SPEC-SPECjAppServer2002','misc','@misc{sp2002-SPEC-SPECjAppServer2002,\n abstract = {SPECjAppServer2002 (Java Application Server) is a client/server benchmark for measuring the performance of Java Enterprise Application Servers using a subset of J2EE APIs in a complete end-to-end web application. It is the same as SPECjAppServer2001 (released in September 2002) except that the Enterprise Java Beans (EJBs) are defined using the EJB 2.0 specification instead of the EJB 1.1 specification. SPECjAppServer2002 can therefore take advantage of several EJB 2.0 features such as local interfaces, the EJB-QL query language, and Container Managed Relationships (CMR) between entity beans. Joining the client-side SPECjvm98 and the server side SPECjbb2000, SPECjAppServer2002 and SPECjAppServer2001 continue the SPEC tradition of giving Java users the most objective and representative benchmarks for measuring a system\'s ability to run Java applications. SPEC has designed the SPECjAppServer2002 benchmark to exercise the Java Enterprise Application Server, the Java Virtual Machine (JVM), as well as the server Systems Under Test (SUT). As a true J2EE application the benchmark will require a functional RDBMS (for JDBC) and a Web Server, but the benchmark has been designed so that the SUT can be a single system. Please note that while the SPECjAppServer2002 suite is still available for purchase, the suite has been retired, no further results are being accepted for publication, and support is no longer provided.},\n author = {SPEC},\n howpublished = {Standard Performance Evaluation Corporation},\n month = {November},\n title = {{SPECjAppServer2002 - Industry-standard enterprise Java application server benchmark (J2EE 1.3).}},\n url = {http://www.spec.org/jAppServer2002/},\n year = {2002},\n}\n\n','\n\nSPEC.\nSPECjAppServer2002 - Industry-standard enterprise Java application\nserver benchmark (J2EE 1.3).\nStandard Performance Evaluation Corporation, November 2002.\n[ bib | http | Abstract  ] 
\n@misc{sp2002-SPEC-SPECjAppServer2002,\nabstract = {SPECjAppServer2002 (Java Application Server) is a client/server benchmark for measuring the performance of Java Enterprise Application Servers using a subset of J2EE APIs in a complete end-to-end web application. It is the same as SPECjAppServer2001 (released in September 2002) except that the Enterprise Java Beans (EJBs) are defined using the EJB 2.0 specification instead of the EJB 1.1 specification. SPECjAppServer2002 can therefore take advantage of several EJB 2.0 features such as local interfaces, the EJB-QL query language, and Container Managed Relationships (CMR) between entity beans. Joining the client-side SPECjvm98 and the server side SPECjbb2000, SPECjAppServer2002 and SPECjAppServer2001 continue the SPEC tradition of giving Java users the most objective and representative benchmarks for measuring a system\'s ability to run Java applications. SPEC has designed the SPECjAppServer2002 benchmark to exercise the Java Enterprise Application Server, the Java Virtual Machine (JVM), as well as the server Systems Under Test (SUT). As a true J2EE application the benchmark will require a functional RDBMS (for JDBC) and a Web Server, but the benchmark has been designed so that the SUT can be a single system. Please note that while the SPECjAppServer2002 suite is still available for purchase, the suite has been retired, no further results are being accepted for publication, and support is no longer provided.},\nauthor = {SPEC},\nhowpublished = {Standard Performance Evaluation Corporation},\nmonth = {November},\ntitle = {{SPECjAppServer2002 - Industry-standard enterprise Java application server benchmark (J2EE 1.3).}},\nurl = {http://www.spec.org/jAppServer2002/},\nyear = {2002}\n}\n
\n
\nSPECjAppServer2002 (Java Application Server) is a client/server benchmark for measuring the performance of Java Enterprise Application Servers using a subset of J2EE APIs in a complete end-to-end web application. It is the same as SPECjAppServer2001 (released in September 2002) except that the Enterprise Java Beans (EJBs) are defined using the EJB 2.0 specification instead of the EJB 1.1 specification. SPECjAppServer2002 can therefore take advantage of several EJB 2.0 features such as local interfaces, the EJB-QL query language, and Container Managed Relationships (CMR) between entity beans. Joining the client-side SPECjvm98 and the server side SPECjbb2000, SPECjAppServer2002 and SPECjAppServer2001 continue the SPEC tradition of giving Java users the most objective and representative benchmarks for measuring a system\'s ability to run Java applications. SPEC has designed the SPECjAppServer2002 benchmark to exercise the Java Enterprise Application Server, the Java Virtual Machine (JVM), as well as the server Systems Under Test (SUT). As a true J2EE application the benchmark will require a functional RDBMS (for JDBC) and a Web Server, but the benchmark has been designed so that the SUT can be a single system. Please note that while the SPECjAppServer2002 suite is still available for purchase, the suite has been retired, no further results are being accepted for publication, and support is no longer provided.\n
\n','
\n@misc{sp2002-SPEC-SPECjAppServer2002,\n  abstract = {SPECjAppServer2002 (Java Application Server) is a client/server benchmark for measuring the performance of Java Enterprise Application Servers using a subset of J2EE APIs in a complete end-to-end web application. It is the same as SPECjAppServer2001 (released in September 2002) except that the Enterprise Java Beans (EJBs) are defined using the EJB 2.0 specification instead of the EJB 1.1 specification. SPECjAppServer2002 can therefore take advantage of several EJB 2.0 features such as local interfaces, the EJB-QL query language, and Container Managed Relationships (CMR) between entity beans. Joining the client-side SPECjvm98 and the server side SPECjbb2000, SPECjAppServer2002 and SPECjAppServer2001 continue the SPEC tradition of giving Java users the most objective and representative benchmarks for measuring a system\'s ability to run Java applications. SPEC has designed the SPECjAppServer2002 benchmark to exercise the Java Enterprise Application Server, the Java Virtual Machine (JVM), as well as the server Systems Under Test (SUT). As a true J2EE application the benchmark will require a functional RDBMS (for JDBC) and a Web Server, but the benchmark has been designed so that the SUT can be a single system. Please note that while the SPECjAppServer2002 suite is still available for purchase, the suite has been retired, no further results are being accepted for publication, and support is no longer provided.},\n  author = {SPEC},\n  howpublished = {Standard Performance Evaluation Corporation},\n  month = {November},\n  title = {{SPECjAppServer2002 - Industry-standard enterprise Java application server benchmark (J2EE 1.3).}},\n  url = {http://www.spec.org/jAppServer2002/},\n  year = {2002}\n}\n
\n\n','SPECjAppServer2002 (Java Application Server) is a client/server benchmark for measuring the performance of Java Enterprise Application Servers using a subset of J2EE APIs in a complete end-to-end web application. It is the same as SPECjAppServer2001 (released in September 2002) except that the Enterprise Java Beans (EJBs) are defined using the EJB 2.0 specification instead of the EJB 1.1 specification. SPECjAppServer2002 can therefore take advantage of several EJB 2.0 features such as local interfaces, the EJB-QL query language, and Container Managed Relationships (CMR) between entity beans. Joining the client-side SPECjvm98 and the server side SPECjbb2000, SPECjAppServer2002 and SPECjAppServer2001 continue the SPEC tradition of giving Java users the most objective and representative benchmarks for measuring a system\'s ability to run Java applications. SPEC has designed the SPECjAppServer2002 benchmark to exercise the Java Enterprise Application Server, the Java Virtual Machine (JVM), as well as the server Systems Under Test (SUT). As a true J2EE application the benchmark will require a functional RDBMS (for JDBC) and a Web Server, but the benchmark has been designed so that the SUT can be a single system. Please note that while the SPECjAppServer2002 suite is still available for purchase, the suite has been retired, no further results are being accepted for publication, and support is no longer provided.','{SPECjAppServer2002 - Industry-standard enterprise Java application server benchmark (J2EE 1.3).}',0,11,2002,11,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(589,'paper','Spinner2011a','mastersthesis','@mastersthesis{Spinner2011a,\n title = {{Evaluating Approaches to Resource Demand Estimation}},\n year = {2011},\n month = {7},\n abstract = {Proactively managing the performance and resource efficiency of running software systems requires techniques to predict system performance and resource consumption. Typically, performance predictions are based on performance models that capture the performance-relevant aspects of the considered software system. Building performance models involves the estimation of resource demands, i.e., estimating the time a unit of work spends obtaining service from a resource. A number of approaches to estimating the resource demands of a system already exist, e.g., based on regression analysis or stochastic filtering. These approaches differ in their accuracy, their robustness and their applicability. For instance, there are notable differences in the amount and type of measurement data that is required as input. However, to the best of our knowledge, a comprehensive evaluation and comparison of these approaches in a representative context does not exist. In this thesis, we give an overview of the state-of-the-art in resource demand estimation and develop a classification scheme for approaches to resource demand estimation. We implement a sub-set of these estimation approaches and evaluate them in a representative environment. We analyze the influence of various factors of the environment on the estimation accuracy, considering the impact of current technologies, such as multi-core processors and virtualization. Our work improves the comparability of existing estimation approaches and facilitates the selection of an approach in a given application scenario. Additionally, it shows possible directions for future research in the field of resource demand estimation.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/589.pdf},\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n school = {Karlsruhe Institute of Technology (KIT)},\n author = {Spinner, Simon},\n note = {Best Graduate Award from the Faculty of Informatics},\n}\n\n','\n\nSimon Spinner.\nEvaluating Approaches to Resource Demand Estimation.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, 7 2011.\nBest Graduate Award from the Faculty of Informatics.\n[ bib | .pdf | Abstract  ] 
\n@mastersthesis{Spinner2011a,\ntitle = {{Evaluating Approaches to Resource Demand Estimation}},\nyear = {2011},\nmonth = {7},\nabstract = {Proactively managing the performance and resource efficiency of running software systems requires techniques to predict system performance and resource consumption. Typically, performance predictions are based on performance models that capture the performance-relevant aspects of the considered software system. Building performance models involves the estimation of resource demands, i.e., estimating the time a unit of work spends obtaining service from a resource. A number of approaches to estimating the resource demands of a system already exist, e.g., based on regression analysis or stochastic filtering. These approaches differ in their accuracy, their robustness and their applicability. For instance, there are notable differences in the amount and type of measurement data that is required as input. However, to the best of our knowledge, a comprehensive evaluation and comparison of these approaches in a representative context does not exist. In this thesis, we give an overview of the state-of-the-art in resource demand estimation and develop a classification scheme for approaches to resource demand estimation. We implement a sub-set of these estimation approaches and evaluate them in a representative environment. We analyze the influence of various factors of the environment on the estimation accuracy, considering the impact of current technologies, such as multi-core processors and virtualization. Our work improves the comparability of existing estimation approaches and facilitates the selection of an approach in a given application scenario. Additionally, it shows possible directions for future research in the field of resource demand estimation.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/589.pdf},\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nschool = {Karlsruhe Institute of Technology (KIT)},\nauthor = {Spinner, Simon},\nnote = {Best Graduate Award from the Faculty of Informatics}\n}\n
\n
\nProactively managing the performance and resource efficiency of running software systems requires techniques to predict system performance and resource consumption. Typically, performance predictions are based on performance models that capture the performance-relevant aspects of the considered software system. Building performance models involves the estimation of resource demands, i.e., estimating the time a unit of work spends obtaining service from a resource. A number of approaches to estimating the resource demands of a system already exist, e.g., based on regression analysis or stochastic filtering. These approaches differ in their accuracy, their robustness and their applicability. For instance, there are notable differences in the amount and type of measurement data that is required as input. However, to the best of our knowledge, a comprehensive evaluation and comparison of these approaches in a representative context does not exist. In this thesis, we give an overview of the state-of-the-art in resource demand estimation and develop a classification scheme for approaches to resource demand estimation. We implement a sub-set of these estimation approaches and evaluate them in a representative environment. We analyze the influence of various factors of the environment on the estimation accuracy, considering the impact of current technologies, such as multi-core processors and virtualization. Our work improves the comparability of existing estimation approaches and facilitates the selection of an approach in a given application scenario. Additionally, it shows possible directions for future research in the field of resource demand estimation.\n
\n','
\n@mastersthesis{Spinner2011a,\n  title = {{Evaluating Approaches to Resource Demand Estimation}},\n  year = {2011},\n  month = {7},\n  abstract = {Proactively managing the performance and resource efficiency of running software systems requires techniques to predict system performance and resource consumption. Typically, performance predictions are based on performance models that capture the performance-relevant aspects of the considered software system. Building performance models involves the estimation of resource demands, i.e., estimating the time a unit of work spends obtaining service from a resource. A number of approaches to estimating the resource demands of a system already exist, e.g., based on regression analysis or stochastic filtering. These approaches differ in their accuracy, their robustness and their applicability. For instance, there are notable differences in the amount and type of measurement data that is required as input. However, to the best of our knowledge, a comprehensive evaluation and comparison of these approaches in a representative context does not exist. In this thesis, we give an overview of the state-of-the-art in resource demand estimation and develop a classification scheme for approaches to resource demand estimation. We implement a sub-set of these estimation approaches and evaluate them in a representative environment. We analyze the influence of various factors of the environment on the estimation accuracy, considering the impact of current technologies, such as multi-core processors and virtualization. Our work improves the comparability of existing estimation approaches and facilitates the selection of an approach in a given application scenario. Additionally, it shows possible directions for future research in the field of resource demand estimation.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/589.pdf},\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  author = {Spinner, Simon},\n  note = {Best Graduate Award from the Faculty of Informatics}\n}\n
\n\n','Proactively managing the performance and resource efficiency of running software systems requires techniques to predict system performance and resource consumption. Typically, performance predictions are based on performance models that capture the performance-relevant aspects of the considered software system. Building performance models involves the estimation of resource demands, i.e., estimating the time a unit of work spends obtaining service from a resource. A number of approaches to estimating the resource demands of a system already exist, e.g., based on regression analysis or stochastic filtering. These approaches differ in their accuracy, their robustness and their applicability. For instance, there are notable differences in the amount and type of measurement data that is required as input. However, to the best of our knowledge, a comprehensive evaluation and comparison of these approaches in a representative context does not exist. In this thesis, we give an overview of the state-of-the-art in resource demand estimation and develop a classification scheme for approaches to resource demand estimation. We implement a sub-set of these estimation approaches and evaluate them in a representative environment. We analyze the influence of various factors of the environment on the estimation accuracy, considering the impact of current technologies, such as multi-core processors and virtualization. Our work improves the comparability of existing estimation approaches and facilitates the selection of an approach in a given application scenario. Additionally, it shows possible directions for future research in the field of resource demand estimation.','{Evaluating Approaches to Resource Demand Estimation}',0,7,2011,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(590,'paper','SpKoMe2012-PETRINETS-QPME','inproceedings','@inproceedings{SpKoMe2012-PETRINETS-QPME,\n abstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present our tool QPME (Queueing Petri net Modeling Environment) for modeling and analysis using queueing Petri nets. QPME provides an Eclipse-based editor for building queueing Petri net models and a powerful simulation engine for analyzing these models. The development of the tool started in 2003 and since then the tool has been distributed to more than 120 organizations worldwide.},\n address = {Berlin, Heidelberg},\n author = {Simon Spinner and Samuel Kounev and Philipp Meier},\n booktitle = {Proceedings of the 33rd International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2012)},\n day = {27--29},\n editor = {Haddad, Serge and Pomello, Lucia},\n isbn = {978-3-642-31130-7},\n location = {Hamburg, Germany},\n month = {June},\n pages = {388--397},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/590.pdf},\n publisher = {Springer-Verlag},\n series = {Lecture Notes in Computer Science (LNCS)},\n title = {{Stochastic Modeling and Analysis using QPME: Queueing Petri Net Modeling Environment v2.0}},\n url = {http://dx.doi.org/10.1007/978-3-642-31131-4_21},\n volume = {7347},\n year = {2012},\n}\n\n','\n\nSimon Spinner, Samuel Kounev, and Philipp Meier.\nStochastic Modeling and Analysis using QPME: Queueing Petri Net\nModeling Environment v2.0.\nIn Proceedings of the 33rd International Conference on\nApplication and Theory of Petri Nets and Concurrency (Petri Nets 2012),\nSerge Haddad and Lucia Pomello, editors, Hamburg, Germany, June 27-29, 2012,\nvolume 7347 of Lecture Notes in Computer Science (LNCS), pages\n388-397. Springer-Verlag, Berlin, Heidelberg.\nJune 2012.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{SpKoMe2012-PETRINETS-QPME,\nabstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present our tool QPME (Queueing Petri net Modeling Environment) for modeling and analysis using queueing Petri nets. QPME provides an Eclipse-based editor for building queueing Petri net models and a powerful simulation engine for analyzing these models. The development of the tool started in 2003 and since then the tool has been distributed to more than 120 organizations worldwide.},\naddress = {Berlin, Heidelberg},\nauthor = {Simon Spinner and Samuel Kounev and Philipp Meier},\nbooktitle = {Proceedings of the 33rd International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2012)},\nday = {27--29},\neditor = {Haddad, Serge and Pomello, Lucia},\nisbn = {978-3-642-31130-7},\nlocation = {Hamburg, Germany},\nmonth = {June},\npages = {388--397},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/590.pdf},\npublisher = {Springer-Verlag},\nseries = {Lecture Notes in Computer Science (LNCS)},\ntitle = {{Stochastic Modeling and Analysis using QPME: Queueing Petri Net Modeling Environment v2.0}},\nurl = {http://dx.doi.org/10.1007/978-3-642-31131-4_21},\nvolume = {7347},\nyear = {2012}\n}\n
\n
\nQueueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present our tool QPME (Queueing Petri net Modeling Environment) for modeling and analysis using queueing Petri nets. QPME provides an Eclipse-based editor for building queueing Petri net models and a powerful simulation engine for analyzing these models. The development of the tool started in 2003 and since then the tool has been distributed to more than 120 organizations worldwide.\n
\n','
\n@inproceedings{SpKoMe2012-PETRINETS-QPME,\n  abstract = {Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present our tool QPME (Queueing Petri net Modeling Environment) for modeling and analysis using queueing Petri nets. QPME provides an Eclipse-based editor for building queueing Petri net models and a powerful simulation engine for analyzing these models. The development of the tool started in 2003 and since then the tool has been distributed to more than 120 organizations worldwide.},\n  address = {Berlin, Heidelberg},\n  author = {Simon Spinner and Samuel Kounev and Philipp Meier},\n  booktitle = {Proceedings of the 33rd International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2012)},\n  day = {27--29},\n  editor = {Haddad, Serge and Pomello, Lucia},\n  isbn = {978-3-642-31130-7},\n  location = {Hamburg, Germany},\n  month = {June},\n  pages = {388--397},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/590.pdf},\n  publisher = {Springer-Verlag},\n  series = {Lecture Notes in Computer Science (LNCS)},\n  title = {{Stochastic Modeling and Analysis using QPME: Queueing Petri Net Modeling Environment v2.0}},\n  url = {http://dx.doi.org/10.1007/978-3-642-31131-4_21},\n  volume = {7347},\n  year = {2012}\n}\n
\n\n','Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present our tool QPME (Queueing Petri net Modeling Environment) for modeling and analysis using queueing Petri nets. QPME provides an Eclipse-based editor for building queueing Petri net models and a powerful simulation engine for analyzing these models. The development of the tool started in 2003 and since then the tool has been distributed to more than 120 organizations worldwide.','{Stochastic Modeling and Analysis using QPME: Queueing Petri Net Modeling Environment v2.0}',0,6,2012,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(596,'paper','theilmann2010a','incollection','@incollection{theilmann2010a,\n address = {Hershey, PA, USA},\n author = {Wolfgang Theilmann and Sergio Garcia Gomez and John Kennedy and Davide Lorenzoli and Christoph Rathfelder and Thomas Roeblitz and Gabriele Zacco},\n booktitle = {{Handbook of Research on Service-Oriented Systems and Non-Functional Properties: Future Directions}},\n editor = {Stephan Reiff-Marganiec and Marcel Tilly},\n pages = {470--490},\n publisher = {IGI Global},\n title = {{A} {F}ramework for {M}ulti-level {SLA} {M}anagement},\n url = {http://www.igi-global.com/book/handbook-research-service-oriented-systems/55308},\n year = {2012},\n}\n\n','\n\nWolfgang Theilmann, Sergio Garcia Gomez, John Kennedy, Davide Lorenzoli,\nChristoph Rathfelder, Thomas Roeblitz, and Gabriele Zacco.\nA Framework for Multi-level SLA Management.\nIn Handbook of Research on Service-Oriented Systems and\nNon-Functional Properties: Future Directions, Stephan Reiff-Marganiec and\nMarcel Tilly, editors, pages 470-490. IGI Global, Hershey, PA, USA, 2012.\n[ bib | http  ] 
\n@incollection{theilmann2010a,\naddress = {Hershey, PA, USA},\nauthor = {Wolfgang Theilmann and Sergio Garcia Gomez and John Kennedy and Davide Lorenzoli and Christoph Rathfelder and Thomas Roeblitz and Gabriele Zacco},\nbooktitle = {{Handbook of Research on Service-Oriented Systems and Non-Functional Properties: Future Directions}},\neditor = {Stephan Reiff-Marganiec and Marcel Tilly},\npages = {470--490},\npublisher = {IGI Global},\ntitle = {{A} {F}ramework for {M}ulti-level {SLA} {M}anagement},\nurl = {http://www.igi-global.com/book/handbook-research-service-oriented-systems/55308},\nyear = {2012}\n}\n
\n
\n','
\n@incollection{theilmann2010a,\n  address = {Hershey, PA, USA},\n  author = {Wolfgang Theilmann and Sergio Garcia Gomez and John Kennedy and Davide Lorenzoli and Christoph Rathfelder and Thomas Roeblitz and Gabriele Zacco},\n  booktitle = {{Handbook of Research on Service-Oriented Systems and Non-Functional Properties: Future Directions}},\n  editor = {Stephan Reiff-Marganiec and Marcel Tilly},\n  pages = {470--490},\n  publisher = {IGI Global},\n  title = {{A} {F}ramework for {M}ulti-level {SLA} {M}anagement},\n  url = {http://www.igi-global.com/book/handbook-research-service-oriented-systems/55308},\n  year = {2012}\n}\n
\n\n',NULL,'{A} {F}ramework for {M}ulti-level {SLA} {M}anagement',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(597,'paper','Thomas20111','proceedings','@proceedings{Thomas20111,\n title = {Fifth International Workshop on the Practical Application of Stochastic Modelling (PASM)},\n editor = {Nigel Thomas and Jeremy Bradley and William Knottenbelt and Samuel Kounev and Nikolaus Huber and Fabian Brosig},\n volume = {275},\n series = {Electronic Notes in Theoretical Computer Science},\n address = {Amsterdam, The Netherlands},\n month = {September},\n issn = {1571-0661},\n pages = {1--174},\n publisher = {Elsevier Science Publishers B. V.},\n doi = {10.1016/j.entcs.2011.09.001},\n year = {2011},\n pages = {1--174},\n}\n\n','\n\nNigel Thomas, Jeremy Bradley, William Knottenbelt, Samuel Kounev, Nikolaus\nHuber, and Fabian Brosig, editors.\nFifth International Workshop on the Practical Application of\nStochastic Modelling (PASM), volume 275 of Electronic Notes in\nTheoretical Computer Science, Amsterdam, The Netherlands, September 2011.\nElsevier Science Publishers B. V.\n[ bib | DOI  ] 
\n@proceedings{Thomas20111,\ntitle = {Fifth International Workshop on the Practical Application of Stochastic Modelling (PASM)},\neditor = {Nigel Thomas and Jeremy Bradley and William Knottenbelt and Samuel Kounev and Nikolaus Huber and Fabian Brosig},\nvolume = {275},\nseries = {Electronic Notes in Theoretical Computer Science},\naddress = {Amsterdam, The Netherlands},\nmonth = {September},\nissn = {1571-0661},\npages = {1--174},\npublisher = {Elsevier Science Publishers B. V.},\ndoi = {10.1016/j.entcs.2011.09.001},\nyear = {2011},\npages = {1--174}\n}\n
\n
\n','
\n@proceedings{Thomas20111,\n  title = {Fifth International Workshop on the Practical Application of Stochastic Modelling (PASM)},\n  editor = {Nigel Thomas and Jeremy Bradley and William Knottenbelt and Samuel Kounev and Nikolaus Huber and Fabian Brosig},\n  volume = {275},\n  series = {Electronic Notes in Theoretical Computer Science},\n  address = {Amsterdam, The Netherlands},\n  month = {September},\n  issn = {1571-0661},\n  pages = {1--174},\n  publisher = {Elsevier Science Publishers B. V.},\n  doi = {10.1016/j.entcs.2011.09.001},\n  year = {2011},\n  pages = {1--174}\n}\n
\n\n',NULL,'Fifth International Workshop on the Practical Application of Stochastic Modelling (PASM)',0,9,2011,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0); -INSERT INTO `Entry` VALUES (606,'paper','VaNoKoRe2013-EPEW-IndustrialCaseStudySystemz','incollection','@incollection{VaNoKoRe2013-EPEW-IndustrialCaseStudySystemz,\n author = {Vaupel, Robert and Noorshams, Qais and Kounev, Samuel and Reussner, Ralf},\n booktitle = {Computer Performance Engineering, Proceedings of the 10th European Performance Engineering Workshop (EPEW 2013), Venice, Italy},\n doi = {10.1007/978-3-642-40725-3_20},\n editor = {Balsamo, Maria Simonetta and Knottenbelt, William J. and Marin, Andrea},\n isbn = {978-3-642-40724-6},\n keywords = {Business Transactions; Performance; Prediction},\n pages = {263-275},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/606.pdf},\n publisher = {Springer Berlin Heidelberg},\n series = {Lecture Notes in Computer Science (LNCS)},\n title = {{Using Queuing Models for Large System Migration Scenarios -- An Industrial Case Study with IBM System z}},\n url = {http://dx.doi.org/10.1007/978-3-642-40725-3_20},\n volume = {8168},\n year = {2013},\n month = {September},\n day = {16--17},\n}\n\n','\n\nRobert Vaupel, Qais Noorshams, Samuel Kounev, and Ralf Reussner.\nUsing Queuing Models for Large System Migration Scenarios - An\nIndustrial Case Study with IBM System z.\nIn Computer Performance Engineering, Proceedings of the 10th\nEuropean Performance Engineering Workshop (EPEW 2013), Venice, Italy,\nMaria Simonetta Balsamo, William J. Knottenbelt, and Andrea Marin, editors,\nvolume 8168 of Lecture Notes in Computer Science (LNCS), pages\n263-275. Springer Berlin Heidelberg, September 2013.\n[ bib | DOI | http | .pdf  ] 
\n@incollection{VaNoKoRe2013-EPEW-IndustrialCaseStudySystemz,\nauthor = {Vaupel, Robert and Noorshams, Qais and Kounev, Samuel and Reussner, Ralf},\nbooktitle = {Computer Performance Engineering, Proceedings of the 10th European Performance Engineering Workshop (EPEW 2013), Venice, Italy},\ndoi = {10.1007/978-3-642-40725-3_20},\neditor = {Balsamo, Maria Simonetta and Knottenbelt, William J. and Marin, Andrea},\nisbn = {978-3-642-40724-6},\nkeywords = {Business Transactions; Performance; Prediction},\npages = {263-275},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/606.pdf},\npublisher = {Springer Berlin Heidelberg},\nseries = {Lecture Notes in Computer Science (LNCS)},\ntitle = {{Using Queuing Models for Large System Migration Scenarios -- An Industrial Case Study with IBM System z}},\nurl = {http://dx.doi.org/10.1007/978-3-642-40725-3_20},\nvolume = {8168},\nyear = {2013},\nmonth = {September},\nday = {16--17}\n}\n
\n
\n','
\n@incollection{VaNoKoRe2013-EPEW-IndustrialCaseStudySystemz,\n  author = {Vaupel, Robert and Noorshams, Qais and Kounev, Samuel and Reussner, Ralf},\n  booktitle = {Computer Performance Engineering, Proceedings of the 10th European Performance Engineering Workshop (EPEW 2013), Venice, Italy},\n  doi = {10.1007/978-3-642-40725-3_20},\n  editor = {Balsamo, Maria Simonetta and Knottenbelt, William J. and Marin, Andrea},\n  isbn = {978-3-642-40724-6},\n  keywords = {Business Transactions; Performance; Prediction},\n  pages = {263-275},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/606.pdf},\n  publisher = {Springer Berlin Heidelberg},\n  series = {Lecture Notes in Computer Science (LNCS)},\n  title = {{Using Queuing Models for Large System Migration Scenarios -- An Industrial Case Study with IBM System z}},\n  url = {http://dx.doi.org/10.1007/978-3-642-40725-3_20},\n  volume = {8168},\n  year = {2013},\n  month = {September},\n  day = {16--17}\n}\n
\n\n',NULL,'{Using Queuing Models for Large System Migration Scenarios -- An Industrial Case Study with IBM System z}',0,9,2013,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(615,'paper','ViMaSaKo2012-ResBook-ResilBenchmark','incollection','@incollection{ViMaSaKo2012-ResBook-ResilBenchmark,\n address = {Berlin, Heidelberg},\n author = {Marco Vieira and Henrique Madeira and Kai Sachs and Samuel Kounev},\n booktitle = {{Resilience Assessment and Evaluation of Computing Systems}},\n editor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\n isbn = {978-3-642-29031-2},\n note = {ISBN: 978-3-642-29031-2},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/615.pdf},\n publisher = {Springer-Verlag},\n series = {XVIII},\n title = {{Resilience Benchmarking}},\n url = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\n year = {2012},\n}\n\n','\n\nMarco Vieira, Henrique Madeira, Kai Sachs, and Samuel Kounev.\nResilience Benchmarking.\nIn Resilience Assessment and Evaluation of Computing Systems,\nK. Wolter, A. Avritzer, M. Vieira, and A. van Moorsel, editors, XVIII.\nSpringer-Verlag, Berlin, Heidelberg, 2012.\nISBN: 978-3-642-29031-2.\n[ bib | http | .pdf  ] 
\n@incollection{ViMaSaKo2012-ResBook-ResilBenchmark,\naddress = {Berlin, Heidelberg},\nauthor = {Marco Vieira and Henrique Madeira and Kai Sachs and Samuel Kounev},\nbooktitle = {{Resilience Assessment and Evaluation of Computing Systems}},\neditor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\nisbn = {978-3-642-29031-2},\nnote = {ISBN: 978-3-642-29031-2},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/615.pdf},\npublisher = {Springer-Verlag},\nseries = {XVIII},\ntitle = {{Resilience Benchmarking}},\nurl = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\nyear = {2012}\n}\n
\n
\n','
\n@incollection{ViMaSaKo2012-ResBook-ResilBenchmark,\n  address = {Berlin, Heidelberg},\n  author = {Marco Vieira and Henrique Madeira and Kai Sachs and Samuel Kounev},\n  booktitle = {{Resilience Assessment and Evaluation of Computing Systems}},\n  editor = {K. Wolter and A. Avritzer and M. Vieira and A. van Moorsel},\n  isbn = {978-3-642-29031-2},\n  note = {ISBN: 978-3-642-29031-2},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/615.pdf},\n  publisher = {Springer-Verlag},\n  series = {XVIII},\n  title = {{Resilience Benchmarking}},\n  url = {http://www.springer.com/computer/communication+networks/book/978-3-642-29031-2},\n  year = {2012}\n}\n
\n\n',NULL,'{Resilience Benchmarking}',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(629,'paper','westermann2012b','inproceedings','@inproceedings{westermann2012b,\n author = {Dennis Westermann and Jens Happe and Rouven Krebs and Roozbeh Farahbod},\n booktitle = {Proceedings of the 27th IEEE/ACM International Conference On Automated Software Engineering (ASE 2012)},\n day = {3--7},\n location = {Essen, Germany},\n month = {September},\n title = {Automated Inference of Goal-oriented Performance Prediction Functions},\n year = {2012},\n}\n\n','\n\nDennis Westermann, Jens Happe, Rouven Krebs, and Roozbeh Farahbod.\nAutomated inference of goal-oriented performance prediction\nfunctions.\nIn Proceedings of the 27th IEEE/ACM International Conference On\nAutomated Software Engineering (ASE 2012), Essen, Germany, September 3-7,\n2012.\n[ bib  ] 
\n@inproceedings{westermann2012b,\nauthor = {Dennis Westermann and Jens Happe and Rouven Krebs and Roozbeh Farahbod},\nbooktitle = {Proceedings of the 27th IEEE/ACM International Conference On Automated Software Engineering (ASE 2012)},\nday = {3--7},\nlocation = {Essen, Germany},\nmonth = {September},\ntitle = {Automated Inference of Goal-oriented Performance Prediction Functions},\nyear = {2012}\n}\n
\n
\n','
\n@inproceedings{westermann2012b,\n  author = {Dennis Westermann and Jens Happe and Rouven Krebs and Roozbeh Farahbod},\n  booktitle = {Proceedings of the 27th IEEE/ACM International Conference On Automated Software Engineering (ASE 2012)},\n  day = {3--7},\n  location = {Essen, Germany},\n  month = {September},\n  title = {Automated Inference of Goal-oriented Performance Prediction Functions},\n  year = {2012}\n}\n
\n\n',NULL,'Automated Inference of Goal-oriented Performance Prediction Functions',0,9,2012,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(639,'paper','DBLP-conf-wosp-2011','proceedings','@proceedings{DBLP-conf-wosp-2011,\n address = {New York, NY, USA},\n editor = {Samuel Kounev and Vittorio Cortellessa and Raffaela Mirandola and David J. Lilja},\n isbn = {978-1-4503-0519-8},\n month = {March},\n publisher = {ACM},\n title = {ICPE\'11 - 2nd Joint ACM/SPEC International Conference on Performance Engineering, Karlsruhe, Germany, March 14--16, 2011},\n year = {2011},\n}\n\n','\n\nSamuel Kounev, Vittorio Cortellessa, Raffaela Mirandola, and David J. Lilja,\neditors.\nICPE\'11 - 2nd Joint ACM/SPEC International Conference on\nPerformance Engineering, Karlsruhe, Germany, March 14-16, 2011, New York,\nNY, USA, March 2011. ACM.\n[ bib  ] 
\n@proceedings{DBLP-conf-wosp-2011,\naddress = {New York, NY, USA},\neditor = {Samuel Kounev and Vittorio Cortellessa and Raffaela Mirandola and David J. Lilja},\nisbn = {978-1-4503-0519-8},\nmonth = {March},\npublisher = {ACM},\ntitle = {ICPE\'11 - 2nd Joint ACM/SPEC International Conference on Performance Engineering, Karlsruhe, Germany, March 14--16, 2011},\nyear = {2011}\n}\n
\n
\n','
\n@proceedings{DBLP-conf-wosp-2011,\n  address = {New York, NY, USA},\n  editor = {Samuel Kounev and Vittorio Cortellessa and Raffaela Mirandola and David J. Lilja},\n  isbn = {978-1-4503-0519-8},\n  month = {March},\n  publisher = {ACM},\n  title = {ICPE\'11 - 2nd Joint ACM/SPEC International Conference on Performance Engineering, Karlsruhe, Germany, March 14--16, 2011},\n  year = {2011}\n}\n
\n\n',NULL,'ICPE\'11 - 2nd Joint ACM/SPEC International Conference on Performance Engineering, Karlsruhe, Germany, March 14--16, 2011',0,3,2011,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(640,'paper','kounev2008c','proceedings','@proceedings{kounev2008c,\n abstract = {This book constitutes the refereed proceedings of the SPEC International Performance Evaluation Workshop, SIPEW 2008, held in Darmstadt, Germany, in June 2008. The 17 revised full papers presented together with 3 keynote talks were carefully reviewed and selected out of 39 submissions for inclusion in the book. The papers are organized in topical sections on models for software performance engineering; benchmarks and workload characterization; Web services and service-oriented architectures; power and performance; and profiling, monitoring and optimization.},\n address = {Heidelberg, Germany},\n editor = {Samuel Kounev and Ian Gorton and Kai Sachs},\n isbn = {978-3-540-69813-5},\n month = {June},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science (LNCS)},\n title = {{Performance Evaluation: Metrics, Models and Benchmarks, Proceedings of the 2008 SPEC International Performance Evaluation Workshop (SIPEW 2008), Darmstadt, Germany, June 27-28}},\n url = {http://www.springer.com/computer/programming/book/978-3-540-69813-5},\n volume = {5119},\n year = {2008},\n}\n\n','\n\nSamuel Kounev, Ian Gorton, and Kai Sachs, editors.\nPerformance Evaluation: Metrics, Models and Benchmarks,\nProceedings of the 2008 SPEC International Performance Evaluation Workshop\n(SIPEW 2008), Darmstadt, Germany, June 27-28, volume 5119 of Lecture\nNotes in Computer Science (LNCS), Heidelberg, Germany, June 2008. Springer.\n[ bib | http | Abstract  ] 
\n@proceedings{kounev2008c,\nabstract = {This book constitutes the refereed proceedings of the SPEC International Performance Evaluation Workshop, SIPEW 2008, held in Darmstadt, Germany, in June 2008. The 17 revised full papers presented together with 3 keynote talks were carefully reviewed and selected out of 39 submissions for inclusion in the book. The papers are organized in topical sections on models for software performance engineering; benchmarks and workload characterization; Web services and service-oriented architectures; power and performance; and profiling, monitoring and optimization.},\naddress = {Heidelberg, Germany},\neditor = {Samuel Kounev and Ian Gorton and Kai Sachs},\nisbn = {978-3-540-69813-5},\nmonth = {June},\npublisher = {Springer},\nseries = {Lecture Notes in Computer Science (LNCS)},\ntitle = {{Performance Evaluation: Metrics, Models and Benchmarks, Proceedings of the 2008 SPEC International Performance Evaluation Workshop (SIPEW 2008), Darmstadt, Germany, June 27-28}},\nurl = {http://www.springer.com/computer/programming/book/978-3-540-69813-5},\nvolume = {5119},\nyear = {2008}\n}\n
\n
\nThis book constitutes the refereed proceedings of the SPEC International Performance Evaluation Workshop, SIPEW 2008, held in Darmstadt, Germany, in June 2008. The 17 revised full papers presented together with 3 keynote talks were carefully reviewed and selected out of 39 submissions for inclusion in the book. The papers are organized in topical sections on models for software performance engineering; benchmarks and workload characterization; Web services and service-oriented architectures; power and performance; and profiling, monitoring and optimization.\n
\n','
\n@proceedings{kounev2008c,\n  abstract = {This book constitutes the refereed proceedings of the SPEC International Performance Evaluation Workshop, SIPEW 2008, held in Darmstadt, Germany, in June 2008. The 17 revised full papers presented together with 3 keynote talks were carefully reviewed and selected out of 39 submissions for inclusion in the book. The papers are organized in topical sections on models for software performance engineering; benchmarks and workload characterization; Web services and service-oriented architectures; power and performance; and profiling, monitoring and optimization.},\n  address = {Heidelberg, Germany},\n  editor = {Samuel Kounev and Ian Gorton and Kai Sachs},\n  isbn = {978-3-540-69813-5},\n  month = {June},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science (LNCS)},\n  title = {{Performance Evaluation: Metrics, Models and Benchmarks, Proceedings of the 2008 SPEC International Performance Evaluation Workshop (SIPEW 2008), Darmstadt, Germany, June 27-28}},\n  url = {http://www.springer.com/computer/programming/book/978-3-540-69813-5},\n  volume = {5119},\n  year = {2008}\n}\n
\n\n','This book constitutes the refereed proceedings of the SPEC International Performance Evaluation Workshop, SIPEW 2008, held in Darmstadt, Germany, in June 2008. The 17 revised full papers presented together with 3 keynote talks were carefully reviewed and selected out of 39 submissions for inclusion in the book. The papers are organized in topical sections on models for software performance engineering; benchmarks and workload characterization; Web services and service-oriented architectures; power and performance; and profiling, monitoring and optimization.','{Performance Evaluation: Metrics, Models and Benchmarks, Proceedings of the 2008 SPEC International Performance Evaluation Workshop (SIPEW 2008), Darmstadt, Germany, June 27-28}',0,6,2008,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(641,'paper','KoZsSa2013-HOTTOPICS-Proceedings','proceedings','@proceedings{KoZsSa2013-HOTTOPICS-Proceedings,\n day = {20--21},\n editor = {Samuel Kounev and Steffen Zschaler and Kai Sachs},\n location = {Prague, Czech Republic},\n month = {April},\n publisher = {ACM},\n title = {Proceedings of the 2013 International Workshop on Hot Topics in Cloud Services (HotTopiCS 2013)},\n year = {2013},\n}\n\n','\n\nSamuel Kounev, Steffen Zschaler, and Kai Sachs, editors.\nProceedings of the 2013 International Workshop on Hot Topics in\nCloud Services (HotTopiCS 2013). ACM, April 2013.\n[ bib  ] 
\n@proceedings{KoZsSa2013-HOTTOPICS-Proceedings,\nday = {20--21},\neditor = {Samuel Kounev and Steffen Zschaler and Kai Sachs},\nlocation = {Prague, Czech Republic},\nmonth = {April},\npublisher = {ACM},\ntitle = {Proceedings of the 2013 International Workshop on Hot Topics in Cloud Services (HotTopiCS 2013)},\nyear = {2013}\n}\n
\n
\n','
\n@proceedings{KoZsSa2013-HOTTOPICS-Proceedings,\n  day = {20--21},\n  editor = {Samuel Kounev and Steffen Zschaler and Kai Sachs},\n  location = {Prague, Czech Republic},\n  month = {April},\n  publisher = {ACM},\n  title = {Proceedings of the 2013 International Workshop on Hot Topics in Cloud Services (HotTopiCS 2013)},\n  year = {2013}\n}\n
\n\n',NULL,'Proceedings of the 2013 International Workshop on Hot Topics in Cloud Services (HotTopiCS 2013)',0,4,2013,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(642,'paper','PaKo2010-KIT-YoungInformatics','proceedings','@proceedings{PaKo2010-KIT-YoungInformatics,\n address = {Karlsruhe, Germany},\n editor = {Victor Pankratius and Samuel Kounev},\n month = {July},\n note = {ISBN: 978-3-86644-508-6},\n publisher = {KIT Scientific Publishing},\n title = {{Emerging Research Directions in Computer Science. Contributions from the Young Informatics Faculty in Karlsruhe}},\n url = {http://uvka.ubka.uni-karlsruhe.de/shop/isbn/978-3-86644-508-6},\n year = {2010},\n}\n\n','\n\nVictor Pankratius and Samuel Kounev, editors.\nEmerging Research Directions in Computer Science. Contributions\nfrom the Young Informatics Faculty in Karlsruhe, Karlsruhe, Germany, July\n2010. KIT Scientific Publishing.\nISBN: 978-3-86644-508-6.\n[ bib | http  ] 
\n@proceedings{PaKo2010-KIT-YoungInformatics,\naddress = {Karlsruhe, Germany},\neditor = {Victor Pankratius and Samuel Kounev},\nmonth = {July},\nnote = {ISBN: 978-3-86644-508-6},\npublisher = {KIT Scientific Publishing},\ntitle = {{Emerging Research Directions in Computer Science. Contributions from the Young Informatics Faculty in Karlsruhe}},\nurl = {http://uvka.ubka.uni-karlsruhe.de/shop/isbn/978-3-86644-508-6},\nyear = {2010}\n}\n
\n
\n','
\n@proceedings{PaKo2010-KIT-YoungInformatics,\n  address = {Karlsruhe, Germany},\n  editor = {Victor Pankratius and Samuel Kounev},\n  month = {July},\n  note = {ISBN: 978-3-86644-508-6},\n  publisher = {KIT Scientific Publishing},\n  title = {{Emerging Research Directions in Computer Science. Contributions from the Young Informatics Faculty in Karlsruhe}},\n  url = {http://uvka.ubka.uni-karlsruhe.de/shop/isbn/978-3-86644-508-6},\n  year = {2010}\n}\n
\n\n',NULL,'{Emerging Research Directions in Computer Science. Contributions from the Young Informatics Faculty in Karlsruhe}',0,7,2010,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(646,'paper','KrMoKo2013-SciCo-MetricsAndTechniquesForPerformanceIsolation','article','@article{KrMoKo2013-SciCo-MetricsAndTechniquesForPerformanceIsolation,\n author = {Rouven Krebs and Christof Momm and Samuel Kounev},\n journal = {Elsevier Science of Computer Programming Journal (SciCo)},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/646.pdf},\n publisher = {Elsevier B.V.},\n title = {{Metrics and Techniques for Quantifying Performance Isolation in Cloud Environments}},\n year = {2014},\n volume = {Vol. 90, Part B},\n pages = {116--134},\n month = {February},\n}\n\n','\n\nRouven Krebs, Christof Momm, and Samuel Kounev.\nMetrics and Techniques for Quantifying Performance Isolation in\nCloud Environments.\nElsevier Science of Computer Programming Journal (SciCo), Vol.\n90, Part B:116-134, February 2014, Elsevier B.V.\n[ bib | .pdf  ] 
\n@article{KrMoKo2013-SciCo-MetricsAndTechniquesForPerformanceIsolation,\nauthor = {Rouven Krebs and Christof Momm and Samuel Kounev},\njournal = {Elsevier Science of Computer Programming Journal (SciCo)},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/646.pdf},\npublisher = {Elsevier B.V.},\ntitle = {{Metrics and Techniques for Quantifying Performance Isolation in Cloud Environments}},\nyear = {2014},\nvolume = {Vol. 90, Part B},\npages = {116--134},\nmonth = {February}\n}\n
\n
\n','
\n@article{KrMoKo2013-SciCo-MetricsAndTechniquesForPerformanceIsolation,\n  author = {Rouven Krebs and Christof Momm and Samuel Kounev},\n  journal = {Elsevier Science of Computer Programming Journal (SciCo)},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/646.pdf},\n  publisher = {Elsevier B.V.},\n  title = {{Metrics and Techniques for Quantifying Performance Isolation in Cloud Environments}},\n  year = {2014},\n  volume = {Vol. 90, Part B},\n  pages = {116--134},\n  month = {February}\n}\n
\n\n',NULL,'{Metrics and Techniques for Quantifying Performance Isolation in Cloud Environments}',0,2,2014,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(649,'paper','BrHuKo2013-SciCo-SoftwarePerformanceAbstractions','article','@article{BrHuKo2013-SciCo-SoftwarePerformanceAbstractions,\n author = {Fabian Brosig and Nikolaus Huber and Samuel Kounev},\n doi = {10.1016/j.scico.2013.06.004},\n journal = {Elsevier Science of Computer Programming Journal (SciCo)},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/649.pdf},\n publisher = {Elsevier},\n volume = {Vol. 90, Part B},\n pages = {71--92},\n title = {{Architecture-Level Software Performance Abstractions for Online Performance Prediction}},\n url = {http://authors.elsevier.com/sd/article/S0167642313001421},\n year = {2014},\n month = {September},\n}\n\n','\n\nFabian Brosig, Nikolaus Huber, and Samuel Kounev.\nArchitecture-Level Software Performance Abstractions for Online\nPerformance Prediction.\nElsevier Science of Computer Programming Journal (SciCo), Vol.\n90, Part B:71-92, September 2014, Elsevier.\n[ bib | DOI | http | .pdf  ] 
\n@article{BrHuKo2013-SciCo-SoftwarePerformanceAbstractions,\nauthor = {Fabian Brosig and Nikolaus Huber and Samuel Kounev},\ndoi = {10.1016/j.scico.2013.06.004},\njournal = {Elsevier Science of Computer Programming Journal (SciCo)},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/649.pdf},\npublisher = {Elsevier},\nvolume = {Vol. 90, Part B},\npages = {71--92},\ntitle = {{Architecture-Level Software Performance Abstractions for Online Performance Prediction}},\nurl = {http://authors.elsevier.com/sd/article/S0167642313001421},\nyear = {2014},\nmonth = {September}\n}\n
\n
\n','
\n@article{BrHuKo2013-SciCo-SoftwarePerformanceAbstractions,\n  author = {Fabian Brosig and Nikolaus Huber and Samuel Kounev},\n  doi = {10.1016/j.scico.2013.06.004},\n  journal = {Elsevier Science of Computer Programming Journal (SciCo)},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/649.pdf},\n  publisher = {Elsevier},\n  volume = {Vol. 90, Part B},\n  pages = {71--92},\n  title = {{Architecture-Level Software Performance Abstractions for Online Performance Prediction}},\n  url = {http://authors.elsevier.com/sd/article/S0167642313001421},\n  year = {2014},\n  month = {September}\n}\n
\n\n',NULL,'{Architecture-Level Software Performance Abstractions for Online Performance Prediction}',0,9,2014,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(651,'paper','BrGoHuKo2013-MASCOTS-EvaluationApproachesForPerformancePredictionInVirtualizedEnvironments','inproceedings','@inproceedings{BrGoHuKo2013-MASCOTS-EvaluationApproachesForPerformancePredictionInVirtualizedEnvironments,\n author = {Fabian Brosig and Fabian Gorsler and Nikolaus Huber and Samuel Kounev},\n booktitle = {Proceedings of the IEEE 21st International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2013)},\n day = {14--16},\n location = {San Francisco, USA},\n month = {August},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/651.pdf},\n title = {{Evaluating Approaches for Performance Prediction in Virtualized Environments}},\n titleaddon = {{(Short Paper)}},\n year = {2013},\n}\n\n','\n\nFabian Brosig, Fabian Gorsler, Nikolaus Huber, and Samuel Kounev.\nEvaluating Approaches for Performance Prediction in Virtualized\nEnvironments (Short Paper).\nIn Proceedings of the IEEE 21st International Symposium on\nModeling, Analysis and Simulation of Computer and Telecommunication Systems\n(MASCOTS 2013), San Francisco, USA, August 14-16, 2013.\n[ bib | .pdf  ] 
\n@inproceedings{BrGoHuKo2013-MASCOTS-EvaluationApproachesForPerformancePredictionInVirtualizedEnvironments,\nauthor = {Fabian Brosig and Fabian Gorsler and Nikolaus Huber and Samuel Kounev},\nbooktitle = {Proceedings of the IEEE 21st International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2013)},\nday = {14--16},\nlocation = {San Francisco, USA},\nmonth = {August},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/651.pdf},\ntitle = {{Evaluating Approaches for Performance Prediction in Virtualized Environments}},\ntitleaddon = {{(Short Paper)}},\nyear = {2013}\n}\n
\n
\n','
\n@inproceedings{BrGoHuKo2013-MASCOTS-EvaluationApproachesForPerformancePredictionInVirtualizedEnvironments,\n  author = {Fabian Brosig and Fabian Gorsler and Nikolaus Huber and Samuel Kounev},\n  booktitle = {Proceedings of the IEEE 21st International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2013)},\n  day = {14--16},\n  location = {San Francisco, USA},\n  month = {August},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/651.pdf},\n  title = {{Evaluating Approaches for Performance Prediction in Virtualized Environments}},\n  titleaddon = {{(Short Paper)}},\n  year = {2013}\n}\n
\n\n',NULL,'{Evaluating Approaches for Performance Prediction in Virtualized Environments}',0,8,2013,8,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(663,'paper','HuHoKoBrKo2014-SOCA-ModelingRuntimeAdaptation','article','@article{HuHoKoBrKo2014-SOCA-ModelingRuntimeAdaptation,\n author = {Nikolaus Huber and Andr\\\'{e} van Hoorn and Anne Koziolek and Fabian Brosig and Samuel Kounev},\n doi = {10.1007/s11761-013-0144-4},\n journal = {Service Oriented Computing and Applications Journal (SOCA)},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/663.pdf},\n publisher = {Springer-Verlag},\n title = {{Modeling Run-Time Adaptation at the System Architecture Level in Dynamic Service-Oriented Environments}},\n volume = {8},\n number = {1},\n pages = {73--89},\n year = {2014},\n month = {{March}},\n}\n\n','\n\nNikolaus Huber, André van Hoorn, Anne Koziolek, Fabian Brosig, and Samuel\nKounev.\nModeling Run-Time Adaptation at the System Architecture Level in\nDynamic Service-Oriented Environments.\nService Oriented Computing and Applications Journal (SOCA),\n8(1):73-89, March 2014, Springer-Verlag.\n[ bib | DOI | .pdf  ] 
\n@article{HuHoKoBrKo2014-SOCA-ModelingRuntimeAdaptation,\nauthor = {Nikolaus Huber and Andr\\\'{e} van Hoorn and Anne Koziolek and Fabian Brosig and Samuel Kounev},\ndoi = {10.1007/s11761-013-0144-4},\njournal = {Service Oriented Computing and Applications Journal (SOCA)},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/663.pdf},\npublisher = {Springer-Verlag},\ntitle = {{Modeling Run-Time Adaptation at the System Architecture Level in Dynamic Service-Oriented Environments}},\nvolume = {8},\nnumber = {1},\npages = {73--89},\nyear = {2014},\nmonth = {{March}}\n}\n
\n
\n','
\n@article{HuHoKoBrKo2014-SOCA-ModelingRuntimeAdaptation,\n  author = {Nikolaus Huber and Andr\\\'{e} van Hoorn and Anne Koziolek and Fabian Brosig and Samuel Kounev},\n  doi = {10.1007/s11761-013-0144-4},\n  journal = {Service Oriented Computing and Applications Journal (SOCA)},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/663.pdf},\n  publisher = {Springer-Verlag},\n  title = {{Modeling Run-Time Adaptation at the System Architecture Level in Dynamic Service-Oriented Environments}},\n  volume = {8},\n  number = {1},\n  pages = {73--89},\n  year = {2014},\n  month = {{March}}\n}\n
\n\n',NULL,'{Modeling Run-Time Adaptation at the System Architecture Level in Dynamic Service-Oriented Environments}',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:00',0),(664,'paper','RyPs2010-ICSS-GF','incollection','@incollection{RyPs2010-ICSS-GF,\n address = {ul. Maszynowa 5/9, 02-392 Warszawa, Poland},\n author = {Piotr Rygielski and Pawe\\l{} \\\'Swi\\k{a}tek},\n booktitle = {Applications of Systems Science},\n editor = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Krzysztof Brzostowski},\n month = {September},\n note = {Most Promising Student Paper Award},\n pages = {217--226},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/664.pdf},\n publisher = {Exit},\n title = {{Optimal Complex Services Composition in SOA Systems}},\n year = {2010},\n abstract = {One of the most important tasks in service oriented architecture paradigm based systems is the task of composition of the complex service. Aim of this paper is to focus on the very last phase of the composition process, where proper atomic service versions are picked to execute the whole complex service. An exact algorithm is proposed in this paper solving two tasks based on popular quality of service delivery approaches: best-effort and differentiated services. The procedure of graph reduction has been introduced to generate space of possible solutions in such way that decision is made in more efficient way. The graph-fold algorithm was tested in simulation environment where its performance was compared to five reference algorithms. Moreover ability to deliver quality at desired level has been tested.},\n}\n\n','\n\nPiotr Rygielski and Pawel Świątek.\nOptimal Complex Services Composition in SOA Systems.\nIn Applications of Systems Science, Adam Grzech, Pawel\nŚwiątek, and Krzysztof Brzostowski, editors, pages 217-226. Exit, ul.\nMaszynowa 5/9, 02-392 Warszawa, Poland, September 2010.\nMost Promising Student Paper Award.\n[ bib | .pdf | Abstract  ] 
\n@incollection{RyPs2010-ICSS-GF,\naddress = {ul. Maszynowa 5/9, 02-392 Warszawa, Poland},\nauthor = {Piotr Rygielski and Pawe\\l{} \\\'Swi\\k{a}tek},\nbooktitle = {Applications of Systems Science},\neditor = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Krzysztof Brzostowski},\nmonth = {September},\nnote = {Most Promising Student Paper Award},\npages = {217--226},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/664.pdf},\npublisher = {Exit},\ntitle = {{Optimal Complex Services Composition in SOA Systems}},\nyear = {2010},\nabstract = {One of the most important tasks in service oriented architecture paradigm based systems is the task of composition of the complex service. Aim of this paper is to focus on the very last phase of the composition process, where proper atomic service versions are picked to execute the whole complex service. An exact algorithm is proposed in this paper solving two tasks based on popular quality of service delivery approaches: best-effort and differentiated services. The procedure of graph reduction has been introduced to generate space of possible solutions in such way that decision is made in more efficient way. The graph-fold algorithm was tested in simulation environment where its performance was compared to five reference algorithms. Moreover ability to deliver quality at desired level has been tested.}\n}\n
\n
\nOne of the most important tasks in service oriented architecture paradigm based systems is the task of composition of the complex service. Aim of this paper is to focus on the very last phase of the composition process, where proper atomic service versions are picked to execute the whole complex service. An exact algorithm is proposed in this paper solving two tasks based on popular quality of service delivery approaches: best-effort and differentiated services. The procedure of graph reduction has been introduced to generate space of possible solutions in such way that decision is made in more efficient way. The graph-fold algorithm was tested in simulation environment where its performance was compared to five reference algorithms. Moreover ability to deliver quality at desired level has been tested.\n
\n','
\n@incollection{RyPs2010-ICSS-GF,\n  address = {ul. Maszynowa 5/9, 02-392 Warszawa, Poland},\n  author = {Piotr Rygielski and Pawe\\l{} \\\'Swi\\k{a}tek},\n  booktitle = {Applications of Systems Science},\n  editor = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Krzysztof Brzostowski},\n  month = {September},\n  note = {Most Promising Student Paper Award},\n  pages = {217--226},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/664.pdf},\n  publisher = {Exit},\n  title = {{Optimal Complex Services Composition in SOA Systems}},\n  year = {2010},\n  abstract = {One of the most important tasks in service oriented architecture paradigm based systems is the task of composition of the complex service. Aim of this paper is to focus on the very last phase of the composition process, where proper atomic service versions are picked to execute the whole complex service. An exact algorithm is proposed in this paper solving two tasks based on popular quality of service delivery approaches: best-effort and differentiated services. The procedure of graph reduction has been introduced to generate space of possible solutions in such way that decision is made in more efficient way. The graph-fold algorithm was tested in simulation environment where its performance was compared to five reference algorithms. Moreover ability to deliver quality at desired level has been tested.}\n}\n
\n\n','One of the most important tasks in service oriented architecture paradigm based systems is the task of composition of the complex service. Aim of this paper is to focus on the very last phase of the composition process, where proper atomic service versions are picked to execute the whole complex service. An exact algorithm is proposed in this paper solving two tasks based on popular quality of service delivery approaches: best-effort and differentiated services. The procedure of graph reduction has been introduced to generate space of possible solutions in such way that decision is made in more efficient way. The graph-fold algorithm was tested in simulation environment where its performance was compared to five reference algorithms. Moreover ability to deliver quality at desired level has been tested.','{Optimal Complex Services Composition in SOA Systems}',0,9,2010,9,NULL,NULL,'SOA','0000-00-00 00:00:00','2016-06-01 09:41:00',0),(665,'paper','RyPs2010-ICSS-handover','incollection','@incollection{RyPs2010-ICSS-handover,\n address = {ul. Maszynowa 5/9, 02-392 Warszawa, Poland},\n author = {Piotr Rygielski and Pawe\\l{} \\\'Swi\\k{a}tek},\n booktitle = {Applications of Systems Science},\n editor = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Krzysztof Brzostowski},\n month = {September},\n pages = {227--236},\n publisher = {Exit},\n title = {{Wireless Network Management Through Network-Enforced Handover}},\n year = {2010},\n}\n\n','\n\nPiotr Rygielski and Pawel Świątek.\nWireless Network Management Through Network-Enforced Handover.\nIn Applications of Systems Science, Adam Grzech, Pawel\nŚwiątek, and Krzysztof Brzostowski, editors, pages 227-236. Exit, ul.\nMaszynowa 5/9, 02-392 Warszawa, Poland, September 2010.\n[ bib  ] 
\n@incollection{RyPs2010-ICSS-handover,\naddress = {ul. Maszynowa 5/9, 02-392 Warszawa, Poland},\nauthor = {Piotr Rygielski and Pawe\\l{} \\\'Swi\\k{a}tek},\nbooktitle = {Applications of Systems Science},\neditor = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Krzysztof Brzostowski},\nmonth = {September},\npages = {227--236},\npublisher = {Exit},\ntitle = {{Wireless Network Management Through Network-Enforced Handover}},\nyear = {2010}\n}\n
\n
\n','
\n@incollection{RyPs2010-ICSS-handover,\n  address = {ul. Maszynowa 5/9, 02-392 Warszawa, Poland},\n  author = {Piotr Rygielski and Pawe\\l{} \\\'Swi\\k{a}tek},\n  booktitle = {Applications of Systems Science},\n  editor = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Krzysztof Brzostowski},\n  month = {September},\n  pages = {227--236},\n  publisher = {Exit},\n  title = {{Wireless Network Management Through Network-Enforced Handover}},\n  year = {2010}\n}\n
\n\n',NULL,'{Wireless Network Management Through Network-Enforced Handover}',0,9,2010,9,NULL,NULL,'Networking; Resource Management; Simulation; QoS in Networks','0000-00-00 00:00:00','2016-06-01 09:41:00',0),(666,'paper','GrRySw2010-SOAbook','incollection','@incollection{GrRySw2010-SOAbook,\n address = {Pozna{\\\'n}, Poland},\n author = {Adam Grzech and Piotr Rygielski and Pawel \\\'{S}wi\\k{a}tek},\n booktitle = {SOA Infrastructure Tools: Concepts and Methods},\n editor = {Stanislaw Ambroszkiewicz and Jerzy Brzezi\\\'{n}ski and Wojciech Cellary and Adam Grzech and Krzysztof Zieli\\\"{n}ski},\n isbn = {978-83-7417-544-9},\n pages = {289--312},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/666.pdf},\n publisher = {Pozna{\\\'n} University of Economics Press},\n title = {{QoS-aware Complex Service Composition in SOA-based Systems}},\n year = {2010},\n abstract = {In this work, a method for the QoS-aware complex service composition in SOA-based systems is presented. The considered complex service composition process consists of three stages: complex service structure, scenario and plan composition. Complex service structure contains a set of required functionalities and precedence relations between them, and is derived directly from a service level agreement. Service scenario is derived from service structure by choosing the optimal (in the sense of certain quality criterion) order of execution of required functionalities. Finally, a service plan emerges from a scenario by choosing the best versions of atomic services for the delivery of required functionalities. For such distinguished composition process methods for complex service scenario and execution plan optimization are proposed. Optimization of a complex service scenario is based on the analysis of possible parallel executions of required functionalities. In order to deliver required level of the quality of service, well known QoS assurance models (i.e.: best effort, integrated services and differentiated services) are applied in the process of complex service execution plan optimization.},\n}\n\n','\n\nAdam Grzech, Piotr Rygielski, and Pawel Świątek.\nQoS-aware Complex Service Composition in SOA-based Systems.\nIn SOA Infrastructure Tools: Concepts and Methods, Stanislaw\nAmbroszkiewicz, Jerzy Brzeziński, Wojciech Cellary, Adam Grzech, and\nKrzysztof Zielinski, editors, pages 289-312. Poznań University of\nEconomics Press, Poznań, Poland, 2010.\n[ bib | .pdf | Abstract  ] 
\n@incollection{GrRySw2010-SOAbook,\naddress = {Pozna{\\\'n}, Poland},\nauthor = {Adam Grzech and Piotr Rygielski and Pawel \\\'{S}wi\\k{a}tek},\nbooktitle = {SOA Infrastructure Tools: Concepts and Methods},\neditor = {Stanislaw Ambroszkiewicz and Jerzy Brzezi\\\'{n}ski and Wojciech Cellary and Adam Grzech and Krzysztof Zieli\\\"{n}ski},\nisbn = {978-83-7417-544-9},\npages = {289--312},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/666.pdf},\npublisher = {Pozna{\\\'n} University of Economics Press},\ntitle = {{QoS-aware Complex Service Composition in SOA-based Systems}},\nyear = {2010},\nabstract = {In this work, a method for the QoS-aware complex service composition in SOA-based systems is presented. The considered complex service composition process consists of three stages: complex service structure, scenario and plan composition. Complex service structure contains a set of required functionalities and precedence relations between them, and is derived directly from a service level agreement. Service scenario is derived from service structure by choosing the optimal (in the sense of certain quality criterion) order of execution of required functionalities. Finally, a service plan emerges from a scenario by choosing the best versions of atomic services for the delivery of required functionalities. For such distinguished composition process methods for complex service scenario and execution plan optimization are proposed. Optimization of a complex service scenario is based on the analysis of possible parallel executions of required functionalities. In order to deliver required level of the quality of service, well known QoS assurance models (i.e.: best effort, integrated services and differentiated services) are applied in the process of complex service execution plan optimization.}\n}\n
\n
\nIn this work, a method for the QoS-aware complex service composition in SOA-based systems is presented. The considered complex service composition process consists of three stages: complex service structure, scenario and plan composition. Complex service structure contains a set of required functionalities and precedence relations between them, and is derived directly from a service level agreement. Service scenario is derived from service structure by choosing the optimal (in the sense of certain quality criterion) order of execution of required functionalities. Finally, a service plan emerges from a scenario by choosing the best versions of atomic services for the delivery of required functionalities. For such distinguished composition process methods for complex service scenario and execution plan optimization are proposed. Optimization of a complex service scenario is based on the analysis of possible parallel executions of required functionalities. In order to deliver required level of the quality of service, well known QoS assurance models (i.e.: best effort, integrated services and differentiated services) are applied in the process of complex service execution plan optimization.\n
\n','
\n@incollection{GrRySw2010-SOAbook,\n  address = {Pozna{\\\'n}, Poland},\n  author = {Adam Grzech and Piotr Rygielski and Pawel \\\'{S}wi\\k{a}tek},\n  booktitle = {SOA Infrastructure Tools: Concepts and Methods},\n  editor = {Stanislaw Ambroszkiewicz and Jerzy Brzezi\\\'{n}ski and Wojciech Cellary and Adam Grzech and Krzysztof Zieli\\\"{n}ski},\n  isbn = {978-83-7417-544-9},\n  pages = {289--312},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/666.pdf},\n  publisher = {Pozna{\\\'n} University of Economics Press},\n  title = {{QoS-aware Complex Service Composition in SOA-based Systems}},\n  year = {2010},\n  abstract = {In this work, a method for the QoS-aware complex service composition in SOA-based systems is presented. The considered complex service composition process consists of three stages: complex service structure, scenario and plan composition. Complex service structure contains a set of required functionalities and precedence relations between them, and is derived directly from a service level agreement. Service scenario is derived from service structure by choosing the optimal (in the sense of certain quality criterion) order of execution of required functionalities. Finally, a service plan emerges from a scenario by choosing the best versions of atomic services for the delivery of required functionalities. For such distinguished composition process methods for complex service scenario and execution plan optimization are proposed. Optimization of a complex service scenario is based on the analysis of possible parallel executions of required functionalities. In order to deliver required level of the quality of service, well known QoS assurance models (i.e.: best effort, integrated services and differentiated services) are applied in the process of complex service execution plan optimization.}\n}\n
\n\n','In this work, a method for the QoS-aware complex service composition in SOA-based systems is presented. The considered complex service composition process consists of three stages: complex service structure, scenario and plan composition. Complex service structure contains a set of required functionalities and precedence relations between them, and is derived directly from a service level agreement. Service scenario is derived from service structure by choosing the optimal (in the sense of certain quality criterion) order of execution of required functionalities. Finally, a service plan emerges from a scenario by choosing the best versions of atomic services for the delivery of required functionalities. For such distinguished composition process methods for complex service scenario and execution plan optimization are proposed. Optimization of a complex service scenario is based on the analysis of possible parallel executions of required functionalities. In order to deliver required level of the quality of service, well known QoS assurance models (i.e.: best effort, integrated services and differentiated services) are applied in the process of complex service execution plan optimization.','{QoS-aware Complex Service Composition in SOA-based Systems}',0,0,2010,0,NULL,NULL,'Resource Management; SOA','0000-00-00 00:00:00','2016-06-01 09:41:00',0),(667,'paper','GrSwRy2009-ICSE','inproceedings','@inproceedings{GrSwRy2009-ICSE,\n author = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Piotr Rygielski},\n booktitle = {Proceedings of Twentieth International Conference on Systems Engineering, (ICSE 2009)},\n day = {8--10},\n editor = {Keith J. Burnham and Olivier C. L. Haas},\n location = {Coventry, UK},\n month = {September},\n pages = {181--184},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/667.pdf},\n publisher = {Coventry University Press},\n title = {{Twostage Packet Scheduling in the Network Node}},\n year = {2009},\n abstract = {In this paper the problem of two-stage packet scheduling on parallel processors is considered. It is assumed, that each processor schedules packets according to Weighted Round Robin (WRR) rule. In order to deliver required level of the quality of service (QoS) weights of local WRR algorithms are adapted such that QoS requirements are met for all distinguished traffic classes. Adaptation of WRR weights relies on the adaptation through identification (Bubnicki, 2005) methodology with the diagonal recurrent neural network (DRNN) applied as the model of QoS parameters. Simulation study of the performance of proposed scheduling methodology shows, that it can deliver better QoS guaranties and higher systems throughput than commonly used reference algorithms.},\n}\n\n','\n\nAdam Grzech, Pawel Świątek, and Piotr Rygielski.\nTwostage Packet Scheduling in the Network Node.\nIn Proceedings of Twentieth International Conference on Systems\nEngineering, (ICSE 2009), Keith J. Burnham and Olivier C. L. Haas, editors,\nCoventry, UK, September 8-10, 2009, pages 181-184. Coventry University\nPress.\nSeptember 2009.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{GrSwRy2009-ICSE,\nauthor = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Piotr Rygielski},\nbooktitle = {Proceedings of Twentieth International Conference on Systems Engineering, (ICSE 2009)},\nday = {8--10},\neditor = {Keith J. Burnham and Olivier C. L. Haas},\nlocation = {Coventry, UK},\nmonth = {September},\npages = {181--184},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/667.pdf},\npublisher = {Coventry University Press},\ntitle = {{Twostage Packet Scheduling in the Network Node}},\nyear = {2009},\nabstract = {In this paper the problem of two-stage packet scheduling on parallel processors is considered. It is assumed, that each processor schedules packets according to Weighted Round Robin (WRR) rule. In order to deliver required level of the quality of service (QoS) weights of local WRR algorithms are adapted such that QoS requirements are met for all distinguished traffic classes. Adaptation of WRR weights relies on the adaptation through identification (Bubnicki, 2005) methodology with the diagonal recurrent neural network (DRNN) applied as the model of QoS parameters. Simulation study of the performance of proposed scheduling methodology shows, that it can deliver better QoS guaranties and higher systems throughput than commonly used reference algorithms.}\n}\n
\n
\nIn this paper the problem of two-stage packet scheduling on parallel processors is considered. It is assumed, that each processor schedules packets according to Weighted Round Robin (WRR) rule. In order to deliver required level of the quality of service (QoS) weights of local WRR algorithms are adapted such that QoS requirements are met for all distinguished traffic classes. Adaptation of WRR weights relies on the adaptation through identification (Bubnicki, 2005) methodology with the diagonal recurrent neural network (DRNN) applied as the model of QoS parameters. Simulation study of the performance of proposed scheduling methodology shows, that it can deliver better QoS guaranties and higher systems throughput than commonly used reference algorithms.\n
\n','
\n@inproceedings{GrSwRy2009-ICSE,\n  author = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Piotr Rygielski},\n  booktitle = {Proceedings of Twentieth International Conference on Systems Engineering, (ICSE 2009)},\n  day = {8--10},\n  editor = {Keith J. Burnham and Olivier C. L. Haas},\n  location = {Coventry, UK},\n  month = {September},\n  pages = {181--184},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/667.pdf},\n  publisher = {Coventry University Press},\n  title = {{Twostage Packet Scheduling in the Network Node}},\n  year = {2009},\n  abstract = {In this paper the problem of two-stage packet scheduling on parallel processors is considered. It is assumed, that each processor schedules packets according to Weighted Round Robin (WRR) rule. In order to deliver required level of the quality of service (QoS) weights of local WRR algorithms are adapted such that QoS requirements are met for all distinguished traffic classes. Adaptation of WRR weights relies on the adaptation through identification (Bubnicki, 2005) methodology with the diagonal recurrent neural network (DRNN) applied as the model of QoS parameters. Simulation study of the performance of proposed scheduling methodology shows, that it can deliver better QoS guaranties and higher systems throughput than commonly used reference algorithms.}\n}\n
\n\n','In this paper the problem of two-stage packet scheduling on parallel processors is considered. It is assumed, that each processor schedules packets according to Weighted Round Robin (WRR) rule. In order to deliver required level of the quality of service (QoS) weights of local WRR algorithms are adapted such that QoS requirements are met for all distinguished traffic classes. Adaptation of WRR weights relies on the adaptation through identification (Bubnicki, 2005) methodology with the diagonal recurrent neural network (DRNN) applied as the model of QoS parameters. Simulation study of the performance of proposed scheduling methodology shows, that it can deliver better QoS guaranties and higher systems throughput than commonly used reference algorithms.','{Twostage Packet Scheduling in the Network Node}',0,9,2009,9,NULL,NULL,'QoS in Networks; Networking','0000-00-00 00:00:00','2016-06-01 09:41:00',0),(668,'paper','GrSwRy2009-PTS','inproceedings','@inproceedings{GrSwRy2009-PTS,\n author = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Piotr Rygielski},\n booktitle = {Proceedings of the 16th Polish Teletraffic Symposium (PTS 2009)},\n day = {24--25},\n isbn = {978-83-7283-317-4},\n location = {L{\\\'o}d{\\\'Z}, Poland},\n month = {September},\n note = {Young Author Best Paper Award},\n organization = {Technical University of \\L{}{\\\'o}d{\\\'Z}},\n pages = {53--56},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/668.pdf},\n title = {{Improving QoS Guaranties via Adaptive Packet Scheduling}},\n year = {2009},\n abstract = {In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network node is one of the crucial mechanisms essential for delivery of required level of quality of services (QoS). In order to satisfy QoS guaranties for each connection belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions basing on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: connections lengths, packet intensities within connections, etc.). Here we propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of system and traffic characteristics. By means of computer simulation, on representative examples, we show, that utilization of additional knowledge in the process of packet scheduling may improve QoS guaranties for serviced traffic.},\n}\n\n','\n\nAdam Grzech, Pawel Świątek, and Piotr Rygielski.\nImproving QoS Guaranties via Adaptive Packet Scheduling.\nIn Proceedings of the 16th Polish Teletraffic Symposium (PTS\n2009), Lódź, Poland, September 24-25, 2009, pages 53-56. Technical\nUniversity of Lódź.\nYoung Author Best Paper Award.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{GrSwRy2009-PTS,\nauthor = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Piotr Rygielski},\nbooktitle = {Proceedings of the 16th Polish Teletraffic Symposium (PTS 2009)},\nday = {24--25},\nisbn = {978-83-7283-317-4},\nlocation = {L{\\\'o}d{\\\'Z}, Poland},\nmonth = {September},\nnote = {Young Author Best Paper Award},\norganization = {Technical University of \\L{}{\\\'o}d{\\\'Z}},\npages = {53--56},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/668.pdf},\ntitle = {{Improving QoS Guaranties via Adaptive Packet Scheduling}},\nyear = {2009},\nabstract = {In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network node is one of the crucial mechanisms essential for delivery of required level of quality of services (QoS). In order to satisfy QoS guaranties for each connection belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions basing on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: connections lengths, packet intensities within connections, etc.). Here we propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of system and traffic characteristics. By means of computer simulation, on representative examples, we show, that utilization of additional knowledge in the process of packet scheduling may improve QoS guaranties for serviced traffic.}\n}\n
\n
\nIn this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network node is one of the crucial mechanisms essential for delivery of required level of quality of services (QoS). In order to satisfy QoS guaranties for each connection belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions basing on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: connections lengths, packet intensities within connections, etc.). Here we propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of system and traffic characteristics. By means of computer simulation, on representative examples, we show, that utilization of additional knowledge in the process of packet scheduling may improve QoS guaranties for serviced traffic.\n
\n','
\n@inproceedings{GrSwRy2009-PTS,\n  author = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Piotr Rygielski},\n  booktitle = {Proceedings of the 16th Polish Teletraffic Symposium (PTS 2009)},\n  day = {24--25},\n  isbn = {978-83-7283-317-4},\n  location = {L{\\\'o}d{\\\'Z}, Poland},\n  month = {September},\n  note = {Young Author Best Paper Award},\n  organization = {Technical University of \\L{}{\\\'o}d{\\\'Z}},\n  pages = {53--56},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/668.pdf},\n  title = {{Improving QoS Guaranties via Adaptive Packet Scheduling}},\n  year = {2009},\n  abstract = {In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network node is one of the crucial mechanisms essential for delivery of required level of quality of services (QoS). In order to satisfy QoS guaranties for each connection belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions basing on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: connections lengths, packet intensities within connections, etc.). Here we propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of system and traffic characteristics. By means of computer simulation, on representative examples, we show, that utilization of additional knowledge in the process of packet scheduling may improve QoS guaranties for serviced traffic.}\n}\n
\n\n','In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network node is one of the crucial mechanisms essential for delivery of required level of quality of services (QoS). In order to satisfy QoS guaranties for each connection belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions basing on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: connections lengths, packet intensities within connections, etc.). Here we propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of system and traffic characteristics. By means of computer simulation, on representative examples, we show, that utilization of additional knowledge in the process of packet scheduling may improve QoS guaranties for serviced traffic.','{Improving QoS Guaranties via Adaptive Packet Scheduling}',0,9,2009,9,NULL,NULL,'QoS in Networks; Networking;','0000-00-00 00:00:00','2016-06-01 09:41:00',0),(669,'paper','GrRySw2009-HETNETS-sim','inproceedings','@inproceedings{GrRySw2009-HETNETS-sim,\n address = {Ba{l}tycka 5, 44-100 Gliwice, Poland},\n author = {Adam Grzech and Piotr Rygielski and Pawel \\\'Swi\\k{a}tek},\n booktitle = {Performance modeling and evaluation of heterogeneous networks, 6th Working International Conference (HET-NETs 2010)},\n day = {14--16},\n editor = {Tadeusz Czach{\\\'o}rski},\n isbn = {978-83-926054-4-7},\n location = {Zakopane, Poland},\n month = {January},\n pages = {89--97},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/669.pdf},\n publisher = {Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences},\n title = {{Simulation Environment for Delivering Quality of Service in Systems Based on Service-Oriented Architecture Paradigm}},\n year = {2010},\n abstract = {In this paper a model of complex service in service-oriented architecture (SOA) system is presented. A complex service is composed with a set of atomic services. Each atomic service is characterized with its own non-functional parameters what allows to formulate quality of service optimization tasks. A simulation environment has been developed to allow experiments execution to determine quality of service (QoS) of composed service.},\n}\n\n','\n\nAdam Grzech, Piotr Rygielski, and Pawel Świątek.\nSimulation Environment for Delivering Quality of Service in Systems\nBased on Service-Oriented Architecture Paradigm.\nIn Performance modeling and evaluation of heterogeneous\nnetworks, 6th Working International Conference (HET-NETs 2010), Tadeusz\nCzachórski, editor, Zakopane, Poland, January 14-16, 2010, pages 89-97.\nInstitute of Theoretical and Applied Informatics of the Polish Academy of\nSciences, Baltycka 5, 44-100 Gliwice, Poland.\nJanuary 2010.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{GrRySw2009-HETNETS-sim,\naddress = {Ba{l}tycka 5, 44-100 Gliwice, Poland},\nauthor = {Adam Grzech and Piotr Rygielski and Pawel \\\'Swi\\k{a}tek},\nbooktitle = {Performance modeling and evaluation of heterogeneous networks, 6th Working International Conference (HET-NETs 2010)},\nday = {14--16},\neditor = {Tadeusz Czach{\\\'o}rski},\nisbn = {978-83-926054-4-7},\nlocation = {Zakopane, Poland},\nmonth = {January},\npages = {89--97},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/669.pdf},\npublisher = {Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences},\ntitle = {{Simulation Environment for Delivering Quality of Service in Systems Based on Service-Oriented Architecture Paradigm}},\nyear = {2010},\nabstract = {In this paper a model of complex service in service-oriented architecture (SOA) system is presented. A complex service is composed with a set of atomic services. Each atomic service is characterized with its own non-functional parameters what allows to formulate quality of service optimization tasks. A simulation environment has been developed to allow experiments execution to determine quality of service (QoS) of composed service.}\n}\n
\n
\nIn this paper a model of complex service in service-oriented architecture (SOA) system is presented. A complex service is composed with a set of atomic services. Each atomic service is characterized with its own non-functional parameters what allows to formulate quality of service optimization tasks. A simulation environment has been developed to allow experiments execution to determine quality of service (QoS) of composed service.\n
\n','
\n@inproceedings{GrRySw2009-HETNETS-sim,\n  address = {Ba{l}tycka 5, 44-100 Gliwice, Poland},\n  author = {Adam Grzech and Piotr Rygielski and Pawel \\\'Swi\\k{a}tek},\n  booktitle = {Performance modeling and evaluation of heterogeneous networks, 6th Working International Conference (HET-NETs 2010)},\n  day = {14--16},\n  editor = {Tadeusz Czach{\\\'o}rski},\n  isbn = {978-83-926054-4-7},\n  location = {Zakopane, Poland},\n  month = {January},\n  pages = {89--97},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/669.pdf},\n  publisher = {Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences},\n  title = {{Simulation Environment for Delivering Quality of Service in Systems Based on Service-Oriented Architecture Paradigm}},\n  year = {2010},\n  abstract = {In this paper a model of complex service in service-oriented architecture (SOA) system is presented. A complex service is composed with a set of atomic services. Each atomic service is characterized with its own non-functional parameters what allows to formulate quality of service optimization tasks. A simulation environment has been developed to allow experiments execution to determine quality of service (QoS) of composed service.}\n}\n
\n\n','In this paper a model of complex service in service-oriented architecture (SOA) system is presented. A complex service is composed with a set of atomic services. Each atomic service is characterized with its own non-functional parameters what allows to formulate quality of service optimization tasks. A simulation environment has been developed to allow experiments execution to determine quality of service (QoS) of composed service.','{Simulation Environment for Delivering Quality of Service in Systems Based on Service-Oriented Architecture Paradigm}',0,1,2010,1,NULL,NULL,'SOA; QoS in Networks; Simulation','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(670,'paper','GrRySw2009-HETNETS-QoS','inproceedings','@inproceedings{GrRySw2009-HETNETS-QoS,\n address = {Ba{l}tycka 5, 44-100 Gliwice, Poland},\n author = {Adam Grzech and Piotr Rygielski and Pawel \\\'Swi\\k{a}tek},\n booktitle = {Performance modelling and evaluation of heterogeneous networks, 6th Working International Conference (HET-NETs 2010)},\n day = {14--16},\n editor = {Tadeusz Czach{\\\'o}rski},\n isbn = {978-83-926054-4-7},\n location = {Zakopane, Poland},\n month = {January},\n pages = {35--47},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/670.pdf},\n publisher = {Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences},\n title = {{QoS-aware Infrastructure Resources Allocation in Systems Based on Service-Oriented Architecture Paradigm}},\n year = {2010},\n abstract = {In this paper the task of communication and computational resources allocation in systems based on SOA paradigm is considered. The task of resources allocation consists in assigning resources to each incoming service request in such a way, that required level of the quality of service is met. Complex services performance time in distributed environment is assumed as the quality of service measure. Models of the system and analysis of service response time presented in this paper allowed to formulate several tasks of resource allocation in terms of well known quality of service assurance models: best effort, IntServ and DiffServ. For each formulated task solution algorithms were proposed and their correctness was evaluated by means of simulation.},\n}\n\n','\n\nAdam Grzech, Piotr Rygielski, and Pawel Świątek.\nQoS-aware Infrastructure Resources Allocation in Systems Based on\nService-Oriented Architecture Paradigm.\nIn Performance modelling and evaluation of heterogeneous\nnetworks, 6th Working International Conference (HET-NETs 2010), Tadeusz\nCzachórski, editor, Zakopane, Poland, January 14-16, 2010, pages 35-47.\nInstitute of Theoretical and Applied Informatics of the Polish Academy of\nSciences, Baltycka 5, 44-100 Gliwice, Poland.\nJanuary 2010.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{GrRySw2009-HETNETS-QoS,\naddress = {Ba{l}tycka 5, 44-100 Gliwice, Poland},\nauthor = {Adam Grzech and Piotr Rygielski and Pawel \\\'Swi\\k{a}tek},\nbooktitle = {Performance modelling and evaluation of heterogeneous networks, 6th Working International Conference (HET-NETs 2010)},\nday = {14--16},\neditor = {Tadeusz Czach{\\\'o}rski},\nisbn = {978-83-926054-4-7},\nlocation = {Zakopane, Poland},\nmonth = {January},\npages = {35--47},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/670.pdf},\npublisher = {Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences},\ntitle = {{QoS-aware Infrastructure Resources Allocation in Systems Based on Service-Oriented Architecture Paradigm}},\nyear = {2010},\nabstract = {In this paper the task of communication and computational resources allocation in systems based on SOA paradigm is considered. The task of resources allocation consists in assigning resources to each incoming service request in such a way, that required level of the quality of service is met. Complex services performance time in distributed environment is assumed as the quality of service measure. Models of the system and analysis of service response time presented in this paper allowed to formulate several tasks of resource allocation in terms of well known quality of service assurance models: best effort, IntServ and DiffServ. For each formulated task solution algorithms were proposed and their correctness was evaluated by means of simulation.}\n}\n
\n
\nIn this paper the task of communication and computational resources allocation in systems based on SOA paradigm is considered. The task of resources allocation consists in assigning resources to each incoming service request in such a way, that required level of the quality of service is met. Complex services performance time in distributed environment is assumed as the quality of service measure. Models of the system and analysis of service response time presented in this paper allowed to formulate several tasks of resource allocation in terms of well known quality of service assurance models: best effort, IntServ and DiffServ. For each formulated task solution algorithms were proposed and their correctness was evaluated by means of simulation.\n
\n','
\n@inproceedings{GrRySw2009-HETNETS-QoS,\n  address = {Ba{l}tycka 5, 44-100 Gliwice, Poland},\n  author = {Adam Grzech and Piotr Rygielski and Pawel \\\'Swi\\k{a}tek},\n  booktitle = {Performance modelling and evaluation of heterogeneous networks, 6th Working International Conference (HET-NETs 2010)},\n  day = {14--16},\n  editor = {Tadeusz Czach{\\\'o}rski},\n  isbn = {978-83-926054-4-7},\n  location = {Zakopane, Poland},\n  month = {January},\n  pages = {35--47},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/670.pdf},\n  publisher = {Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences},\n  title = {{QoS-aware Infrastructure Resources Allocation in Systems Based on Service-Oriented Architecture Paradigm}},\n  year = {2010},\n  abstract = {In this paper the task of communication and computational resources allocation in systems based on SOA paradigm is considered. The task of resources allocation consists in assigning resources to each incoming service request in such a way, that required level of the quality of service is met. Complex services performance time in distributed environment is assumed as the quality of service measure. Models of the system and analysis of service response time presented in this paper allowed to formulate several tasks of resource allocation in terms of well known quality of service assurance models: best effort, IntServ and DiffServ. For each formulated task solution algorithms were proposed and their correctness was evaluated by means of simulation.}\n}\n
\n\n','In this paper the task of communication and computational resources allocation in systems based on SOA paradigm is considered. The task of resources allocation consists in assigning resources to each incoming service request in such a way, that required level of the quality of service is met. Complex services performance time in distributed environment is assumed as the quality of service measure. Models of the system and analysis of service response time presented in this paper allowed to formulate several tasks of resource allocation in terms of well known quality of service assurance models: best effort, IntServ and DiffServ. For each formulated task solution algorithms were proposed and their correctness was evaluated by means of simulation.','{QoS-aware Infrastructure Resources Allocation in Systems Based on Service-Oriented Architecture Paradigm}',0,1,2010,1,NULL,NULL,'SOA; QoS in Networks; Simulation','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(671,'paper','GrSwRy2011-ETS','inproceedings','@inproceedings{GrSwRy2011-ETS,\n address = {Pozna{\\\'n}, Poland},\n author = {Pawel \\\'Swi\\k{a}tek and Piotr Rygielski and Adam Grzech},\n booktitle = {{Proceedings of the First European Teletraffic Seminar: an initiative to strengthen collaboration on Network Design and Performance (ETS 2011)}},\n day = {14--16},\n editor = {Grzegorz Danilewicz},\n location = {Pozna{\\\'n}, Poland},\n month = {February},\n pages = {80--84},\n publisher = {ASART STUDIO Agnieszka Chwalisz},\n title = {{Handover: a Tool for Optimization of Wireless Networks}},\n year = {2011},\n abstract = {The growth of mobile devices equipped with wireless network interface on the market puts researchers focus on the new area of wireless connection management. In this paper we introduce an approach of wireless network management with handovers which occurs when user is moving through the area that is covered with more than one wireless network. The task of user’s assignment to the wireless network is considered in this paper. There have been two main tasks formulated: local optimization, where user chooses the network to connect and global one, where the network management system picks users in order to maximize users satisfaction. The users have to be assigned with proper amount of communicational resources in every moment of the passing of considered geographical area. I this paper we propose three heuristic algorithms of user QoS-constrained assignment to networks. In two algorithms the user makes decision basing on his knowledge about network and his mobile device state and in the third algorithm, the networks management system decides which users to connect. The evaluation of proposed algorithms is done by means of computer simulation.},\n}\n\n','\n\nPawel Świątek, Piotr Rygielski, and Adam Grzech.\nHandover: a Tool for Optimization of Wireless Networks.\nIn Proceedings of the First European Teletraffic Seminar: an\ninitiative to strengthen collaboration on Network Design and Performance (ETS\n2011), Grzegorz Danilewicz, editor, Poznań, Poland, February 14-16,\n2011, pages 80-84. ASART STUDIO Agnieszka Chwalisz, Poznań, Poland.\nFebruary 2011.\n[ bib | Abstract  ] 
\n@inproceedings{GrSwRy2011-ETS,\naddress = {Pozna{\\\'n}, Poland},\nauthor = {Pawel \\\'Swi\\k{a}tek and Piotr Rygielski and Adam Grzech},\nbooktitle = {{Proceedings of the First European Teletraffic Seminar: an initiative to strengthen collaboration on Network Design and Performance (ETS 2011)}},\nday = {14--16},\neditor = {Grzegorz Danilewicz},\nlocation = {Pozna{\\\'n}, Poland},\nmonth = {February},\npages = {80--84},\npublisher = {ASART STUDIO Agnieszka Chwalisz},\ntitle = {{Handover: a Tool for Optimization of Wireless Networks}},\nyear = {2011},\nabstract = {The growth of mobile devices equipped with wireless network interface on the market puts researchers focus on the new area of wireless connection management. In this paper we introduce an approach of wireless network management with handovers which occurs when user is moving through the area that is covered with more than one wireless network. The task of user’s assignment to the wireless network is considered in this paper. There have been two main tasks formulated: local optimization, where user chooses the network to connect and global one, where the network management system picks users in order to maximize users satisfaction. The users have to be assigned with proper amount of communicational resources in every moment of the passing of considered geographical area. I this paper we propose three heuristic algorithms of user QoS-constrained assignment to networks. In two algorithms the user makes decision basing on his knowledge about network and his mobile device state and in the third algorithm, the networks management system decides which users to connect. The evaluation of proposed algorithms is done by means of computer simulation.}\n}\n
\n
\nThe growth of mobile devices equipped with wireless network interface on the market puts researchers focus on the new area of wireless connection management. In this paper we introduce an approach of wireless network management with handovers which occurs when user is moving through the area that is covered with more than one wireless network. The task of user’s assignment to the wireless network is considered in this paper. There have been two main tasks formulated: local optimization, where user chooses the network to connect and global one, where the network management system picks users in order to maximize users satisfaction. The users have to be assigned with proper amount of communicational resources in every moment of the passing of considered geographical area. I this paper we propose three heuristic algorithms of user QoS-constrained assignment to networks. In two algorithms the user makes decision basing on his knowledge about network and his mobile device state and in the third algorithm, the networks management system decides which users to connect. The evaluation of proposed algorithms is done by means of computer simulation.\n
\n','
\n@inproceedings{GrSwRy2011-ETS,\n  address = {Pozna{\\\'n}, Poland},\n  author = {Pawel \\\'Swi\\k{a}tek and Piotr Rygielski and Adam Grzech},\n  booktitle = {{Proceedings of the First European Teletraffic Seminar: an initiative to strengthen collaboration on Network Design and Performance (ETS 2011)}},\n  day = {14--16},\n  editor = {Grzegorz Danilewicz},\n  location = {Pozna{\\\'n}, Poland},\n  month = {February},\n  pages = {80--84},\n  publisher = {ASART STUDIO Agnieszka Chwalisz},\n  title = {{Handover: a Tool for Optimization of Wireless Networks}},\n  year = {2011},\n  abstract = {The growth of mobile devices equipped with wireless network interface on the market puts researchers focus on the new area of wireless connection management. In this paper we introduce an approach of wireless network management with handovers which occurs when user is moving through the area that is covered with more than one wireless network. The task of user’s assignment to the wireless network is considered in this paper. There have been two main tasks formulated: local optimization, where user chooses the network to connect and global one, where the network management system picks users in order to maximize users satisfaction. The users have to be assigned with proper amount of communicational resources in every moment of the passing of considered geographical area. I this paper we propose three heuristic algorithms of user QoS-constrained assignment to networks. In two algorithms the user makes decision basing on his knowledge about network and his mobile device state and in the third algorithm, the networks management system decides which users to connect. The evaluation of proposed algorithms is done by means of computer simulation.}\n}\n
\n\n','The growth of mobile devices equipped with wireless network interface on the market puts researchers focus on the new area of wireless connection management. In this paper we introduce an approach of wireless network management with handovers which occurs when user is moving through the area that is covered with more than one wireless network. The task of user’s assignment to the wireless network is considered in this paper. There have been two main tasks formulated: local optimization, where user chooses the network to connect and global one, where the network management system picks users in order to maximize users satisfaction. The users have to be assigned with proper amount of communicational resources in every moment of the passing of considered geographical area. I this paper we propose three heuristic algorithms of user QoS-constrained assignment to networks. In two algorithms the user makes decision basing on his knowledge about network and his mobile device state and in the third algorithm, the networks management system decides which users to connect. The evaluation of proposed algorithms is done by means of computer simulation.','{Handover: a Tool for Optimization of Wireless Networks}',0,2,2011,2,NULL,NULL,'QoS in Networks; Resource Management; Networking;','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(672,'paper','RySwJuGr2011-KES','inproceedings','@inproceedings{RySwJuGr2011-KES,\n address = {Berlin, Heidelberg},\n author = {Rygielski, Piotr and \\\'{S}wi\\k{a}tek, Pawel and Juszczyszyn, Krzysztof and Grzech, Adam},\n booktitle = {Knowledge-Based and Intelligent Information and Engineering Systems, Part II (KES 2011)},\n day = {12--14},\n edition = {1},\n editor = {Koenig, A. and Dengel, A. and Hinkelmann, K. and Kise, K. and Howlett, R.J. and Jain, L.C.},\n isbn = {978-3-642-23862-8},\n location = {Kaiserslautern, Germany},\n month = {September},\n pages = {687--696},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/672.pdf},\n publisher = {Springer-Verlag},\n series = {{Lecture Notes in Computer Science (LNCS)}},\n title = {{Prediction Based Handovers for Wireless Networks Resources Management}},\n url = {http://dl.acm.org/citation.cfm?id=2041341.2041419},\n volume = {6882},\n year = {2011},\n abstract = {The paper is devoted to the problem of mobility and resources management in heterogeneous wireless networks. It is assumed that in certain area covered by multiple overlapping wireless networks there is certain number of mobile client which consume networks resources by use of available communication services (e.g., voice or data transmission) delivered by network providers. Moreover it is assumed, that communication services continuity may be assured with use of common handover techniques supporting clients mobility (e.g: MIPv6, IEEE 802.21, etc.). The task of mobility and resources management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g. utilization of network resources). In this paper we show that gathering knowledge about clients movement and prediction of their future position may significantly improve the overall quality of delivered services and network resources utilization.},\n}\n\n','\n\nPiotr Rygielski, Pawel Świątek, Krzysztof Juszczyszyn, and Adam Grzech.\nPrediction Based Handovers for Wireless Networks Resources\nManagement.\nIn Knowledge-Based and Intelligent Information and Engineering\nSystems, Part II (KES 2011), A. Koenig, A. Dengel, K. Hinkelmann, K. Kise,\nR.J. Howlett, and L.C. Jain, editors, Kaiserslautern, Germany, September\n12-14, 2011, volume 6882 of Lecture Notes in Computer Science\n(LNCS), pages 687-696. Springer-Verlag, Berlin, Heidelberg.\nSeptember 2011.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{RySwJuGr2011-KES,\naddress = {Berlin, Heidelberg},\nauthor = {Rygielski, Piotr and \\\'{S}wi\\k{a}tek, Pawel and Juszczyszyn, Krzysztof and Grzech, Adam},\nbooktitle = {Knowledge-Based and Intelligent Information and Engineering Systems, Part II (KES 2011)},\nday = {12--14},\nedition = {1},\neditor = {Koenig, A. and Dengel, A. and Hinkelmann, K. and Kise, K. and Howlett, R.J. and Jain, L.C.},\nisbn = {978-3-642-23862-8},\nlocation = {Kaiserslautern, Germany},\nmonth = {September},\npages = {687--696},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/672.pdf},\npublisher = {Springer-Verlag},\nseries = {{Lecture Notes in Computer Science (LNCS)}},\ntitle = {{Prediction Based Handovers for Wireless Networks Resources Management}},\nurl = {http://dl.acm.org/citation.cfm?id=2041341.2041419},\nvolume = {6882},\nyear = {2011},\nabstract = {The paper is devoted to the problem of mobility and resources management in heterogeneous wireless networks. It is assumed that in certain area covered by multiple overlapping wireless networks there is certain number of mobile client which consume networks resources by use of available communication services (e.g., voice or data transmission) delivered by network providers. Moreover it is assumed, that communication services continuity may be assured with use of common handover techniques supporting clients mobility (e.g: MIPv6, IEEE 802.21, etc.). The task of mobility and resources management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g. utilization of network resources). In this paper we show that gathering knowledge about clients movement and prediction of their future position may significantly improve the overall quality of delivered services and network resources utilization.}\n}\n
\n
\nThe paper is devoted to the problem of mobility and resources management in heterogeneous wireless networks. It is assumed that in certain area covered by multiple overlapping wireless networks there is certain number of mobile client which consume networks resources by use of available communication services (e.g., voice or data transmission) delivered by network providers. Moreover it is assumed, that communication services continuity may be assured with use of common handover techniques supporting clients mobility (e.g: MIPv6, IEEE 802.21, etc.). The task of mobility and resources management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g. utilization of network resources). In this paper we show that gathering knowledge about clients movement and prediction of their future position may significantly improve the overall quality of delivered services and network resources utilization.\n
\n','
\n@inproceedings{RySwJuGr2011-KES,\n  address = {Berlin, Heidelberg},\n  author = {Rygielski, Piotr and \\\'{S}wi\\k{a}tek, Pawel and Juszczyszyn, Krzysztof and Grzech, Adam},\n  booktitle = {Knowledge-Based and Intelligent Information and Engineering Systems, Part II (KES 2011)},\n  day = {12--14},\n  edition = {1},\n  editor = {Koenig, A. and Dengel, A. and Hinkelmann, K. and Kise, K. and Howlett, R.J. and Jain, L.C.},\n  isbn = {978-3-642-23862-8},\n  location = {Kaiserslautern, Germany},\n  month = {September},\n  pages = {687--696},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/672.pdf},\n  publisher = {Springer-Verlag},\n  series = {{Lecture Notes in Computer Science (LNCS)}},\n  title = {{Prediction Based Handovers for Wireless Networks Resources Management}},\n  url = {http://dl.acm.org/citation.cfm?id=2041341.2041419},\n  volume = {6882},\n  year = {2011},\n  abstract = {The paper is devoted to the problem of mobility and resources management in heterogeneous wireless networks. It is assumed that in certain area covered by multiple overlapping wireless networks there is certain number of mobile client which consume networks resources by use of available communication services (e.g., voice or data transmission) delivered by network providers. Moreover it is assumed, that communication services continuity may be assured with use of common handover techniques supporting clients mobility (e.g: MIPv6, IEEE 802.21, etc.). The task of mobility and resources management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g. utilization of network resources). In this paper we show that gathering knowledge about clients movement and prediction of their future position may significantly improve the overall quality of delivered services and network resources utilization.}\n}\n
\n\n','The paper is devoted to the problem of mobility and resources management in heterogeneous wireless networks. It is assumed that in certain area covered by multiple overlapping wireless networks there is certain number of mobile client which consume networks resources by use of available communication services (e.g., voice or data transmission) delivered by network providers. Moreover it is assumed, that communication services continuity may be assured with use of common handover techniques supporting clients mobility (e.g: MIPv6, IEEE 802.21, etc.). The task of mobility and resources management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g. utilization of network resources). In this paper we show that gathering knowledge about clients movement and prediction of their future position may significantly improve the overall quality of delivered services and network resources utilization.','{Prediction Based Handovers for Wireless Networks Resources Management}',0,9,2011,9,NULL,NULL,'QoS in Networks; Resource Management; Prediction; Networking;','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(673,'paper','RyTo2011-KES','inproceedings','@inproceedings{RyTo2011-KES,\n address = {Berlin, Heidelberg},\n author = {Rygielski, Piotr and Tomczak, Jakub},\n booktitle = {Knowledge-Based and Intelligent Information and Engineering Systems, Part II (KES 2011)},\n day = {12--14},\n edition = {1},\n editor = {Koenig, A. and Dengel, A. and Hinkelmann, K. and Kise, K. and Howlett, R.J. and Jain, L.C.},\n isbn = {978-3-642-23862-8},\n location = {Kaiserslautern, Germany},\n month = {September},\n pages = {591--600},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/673.pdf},\n publisher = {Springer-Verlag},\n series = {{Lecture Notes in Computer Science (LNCS)}},\n title = {{Context Change Detection for Resource Allocation in Service-Oriented Systems}},\n volume = {6882},\n year = {2011},\n abstract = {In this paper, the problem of detecting the major changes in the stream of service requests is formulated. The change of stream component varies over time and depends on, e.g., a time of a day. The underlying cause of the change is called a context. Hence, at each moment there exists a probability distribution determining the probability of requesting the system service conditioned by the context. The aim is to find such a moment in which the distributions change. To solve that problem dissimilarity measures between two probability distributions are given. Nevertheless, detecting every change is not interesting but only long-lasting changes because of the costs of the service system resources reallocation. Therefore, in the proposed algorithm an issue of sensitivity to temporary changes detection is considered},\n}\n\n','\n\nPiotr Rygielski and Jakub Tomczak.\nContext Change Detection for Resource Allocation in Service-Oriented\nSystems.\nIn Knowledge-Based and Intelligent Information and Engineering\nSystems, Part II (KES 2011), A. Koenig, A. Dengel, K. Hinkelmann, K. Kise,\nR.J. Howlett, and L.C. Jain, editors, Kaiserslautern, Germany, September\n12-14, 2011, volume 6882 of Lecture Notes in Computer Science\n(LNCS), pages 591-600. Springer-Verlag, Berlin, Heidelberg.\nSeptember 2011.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{RyTo2011-KES,\naddress = {Berlin, Heidelberg},\nauthor = {Rygielski, Piotr and Tomczak, Jakub},\nbooktitle = {Knowledge-Based and Intelligent Information and Engineering Systems, Part II (KES 2011)},\nday = {12--14},\nedition = {1},\neditor = {Koenig, A. and Dengel, A. and Hinkelmann, K. and Kise, K. and Howlett, R.J. and Jain, L.C.},\nisbn = {978-3-642-23862-8},\nlocation = {Kaiserslautern, Germany},\nmonth = {September},\npages = {591--600},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/673.pdf},\npublisher = {Springer-Verlag},\nseries = {{Lecture Notes in Computer Science (LNCS)}},\ntitle = {{Context Change Detection for Resource Allocation in Service-Oriented Systems}},\nvolume = {6882},\nyear = {2011},\nabstract = {In this paper, the problem of detecting the major changes in the stream of service requests is formulated. The change of stream component varies over time and depends on, e.g., a time of a day. The underlying cause of the change is called a context. Hence, at each moment there exists a probability distribution determining the probability of requesting the system service conditioned by the context. The aim is to find such a moment in which the distributions change. To solve that problem dissimilarity measures between two probability distributions are given. Nevertheless, detecting every change is not interesting but only long-lasting changes because of the costs of the service system resources reallocation. Therefore, in the proposed algorithm an issue of sensitivity to temporary changes detection is considered}\n}\n
\n
\nIn this paper, the problem of detecting the major changes in the stream of service requests is formulated. The change of stream component varies over time and depends on, e.g., a time of a day. The underlying cause of the change is called a context. Hence, at each moment there exists a probability distribution determining the probability of requesting the system service conditioned by the context. The aim is to find such a moment in which the distributions change. To solve that problem dissimilarity measures between two probability distributions are given. Nevertheless, detecting every change is not interesting but only long-lasting changes because of the costs of the service system resources reallocation. Therefore, in the proposed algorithm an issue of sensitivity to temporary changes detection is considered\n
\n','
\n@inproceedings{RyTo2011-KES,\n  address = {Berlin, Heidelberg},\n  author = {Rygielski, Piotr and Tomczak, Jakub},\n  booktitle = {Knowledge-Based and Intelligent Information and Engineering Systems, Part II (KES 2011)},\n  day = {12--14},\n  edition = {1},\n  editor = {Koenig, A. and Dengel, A. and Hinkelmann, K. and Kise, K. and Howlett, R.J. and Jain, L.C.},\n  isbn = {978-3-642-23862-8},\n  location = {Kaiserslautern, Germany},\n  month = {September},\n  pages = {591--600},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/673.pdf},\n  publisher = {Springer-Verlag},\n  series = {{Lecture Notes in Computer Science (LNCS)}},\n  title = {{Context Change Detection for Resource Allocation in Service-Oriented Systems}},\n  volume = {6882},\n  year = {2011},\n  abstract = {In this paper, the problem of detecting the major changes in the stream of service requests is formulated. The change of stream component varies over time and depends on, e.g., a time of a day. The underlying cause of the change is called a context. Hence, at each moment there exists a probability distribution determining the probability of requesting the system service conditioned by the context. The aim is to find such a moment in which the distributions change. To solve that problem dissimilarity measures between two probability distributions are given. Nevertheless, detecting every change is not interesting but only long-lasting changes because of the costs of the service system resources reallocation. Therefore, in the proposed algorithm an issue of sensitivity to temporary changes detection is considered}\n}\n
\n\n','In this paper, the problem of detecting the major changes in the stream of service requests is formulated. The change of stream component varies over time and depends on, e.g., a time of a day. The underlying cause of the change is called a context. Hence, at each moment there exists a probability distribution determining the probability of requesting the system service conditioned by the context. The aim is to find such a moment in which the distributions change. To solve that problem dissimilarity measures between two probability distributions are given. Nevertheless, detecting every change is not interesting but only long-lasting changes because of the costs of the service system resources reallocation. Therefore, in the proposed algorithm an issue of sensitivity to temporary changes detection is considered','{Context Change Detection for Resource Allocation in Service-Oriented Systems}',0,9,2011,9,NULL,NULL,'Resource Management; SOA; Networking;','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(674,'paper','GrSwRy2010-SS','article','@article{GrSwRy2010-SS,\n address = {Wroclaw, Poland},\n author = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Piotr Rygielski},\n journal = {Systems Science},\n number = {1},\n pages = {7--12},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/674.pdf},\n publisher = {Wroclaw University of Technology Press},\n title = {{Adaptive Packet Scheduling for Requests Delay Guaranties in Packet-Switched Communication Network}},\n url = {http://linksource.ebsco.com/linking.aspx?issn=0137-1223&volume=36&spage=7},\n volume = {36},\n year = {2010},\n abstract = {In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network edge nodes is one of the crucial mechanisms essential for delivery of required level of quality of end-to-end network services (QoS). In order to satisfy QoS guaranties for each incoming request belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions based on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: lengths of connections following requests, packet intensities within requests, etc.). The paper is devoted to propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of networkÂ’s load and traffic characteristics. By means of computer simulation, on representative examples, it was shown, that utilization of additional knowledge about incoming traffic in the process of packet scheduling may improve QoS guaranties for serviced traffic.},\n}\n\n','\n\nAdam Grzech, Pawel Świątek, and Piotr Rygielski.\nAdaptive Packet Scheduling for Requests Delay Guaranties in\nPacket-Switched Communication Network.\nSystems Science, 36(1):7-12, 2010, Wroclaw University of\nTechnology Press, Wroclaw, Poland.\n[ bib | http | .pdf | Abstract  ] 
\n@article{GrSwRy2010-SS,\naddress = {Wroclaw, Poland},\nauthor = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Piotr Rygielski},\njournal = {Systems Science},\nnumber = {1},\npages = {7--12},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/674.pdf},\npublisher = {Wroclaw University of Technology Press},\ntitle = {{Adaptive Packet Scheduling for Requests Delay Guaranties in Packet-Switched Communication Network}},\nurl = {http://linksource.ebsco.com/linking.aspx?issn=0137-1223&volume=36&spage=7},\nvolume = {36},\nyear = {2010},\nabstract = {In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network edge nodes is one of the crucial mechanisms essential for delivery of required level of quality of end-to-end network services (QoS). In order to satisfy QoS guaranties for each incoming request belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions based on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: lengths of connections following requests, packet intensities within requests, etc.). The paper is devoted to propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of networkÂ’s load and traffic characteristics. By means of computer simulation, on representative examples, it was shown, that utilization of additional knowledge about incoming traffic in the process of packet scheduling may improve QoS guaranties for serviced traffic.}\n}\n
\n
\nIn this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network edge nodes is one of the crucial mechanisms essential for delivery of required level of quality of end-to-end network services (QoS). In order to satisfy QoS guaranties for each incoming request belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions based on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: lengths of connections following requests, packet intensities within requests, etc.). The paper is devoted to propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of networkÂ’s load and traffic characteristics. By means of computer simulation, on representative examples, it was shown, that utilization of additional knowledge about incoming traffic in the process of packet scheduling may improve QoS guaranties for serviced traffic.\n
\n','
\n@article{GrSwRy2010-SS,\n  address = {Wroclaw, Poland},\n  author = {Adam Grzech and Pawel \\\'Swi\\k{a}tek and Piotr Rygielski},\n  journal = {Systems Science},\n  number = {1},\n  pages = {7--12},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/674.pdf},\n  publisher = {Wroclaw University of Technology Press},\n  title = {{Adaptive Packet Scheduling for Requests Delay Guaranties in Packet-Switched Communication Network}},\n  url = {http://linksource.ebsco.com/linking.aspx?issn=0137-1223&volume=36&spage=7},\n  volume = {36},\n  year = {2010},\n  abstract = {In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network edge nodes is one of the crucial mechanisms essential for delivery of required level of quality of end-to-end network services (QoS). In order to satisfy QoS guaranties for each incoming request belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions based on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: lengths of connections following requests, packet intensities within requests, etc.). The paper is devoted to propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of networkÂ’s load and traffic characteristics. By means of computer simulation, on representative examples, it was shown, that utilization of additional knowledge about incoming traffic in the process of packet scheduling may improve QoS guaranties for serviced traffic.}\n}\n
\n\n','In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network edge nodes is one of the crucial mechanisms essential for delivery of required level of quality of end-to-end network services (QoS). In order to satisfy QoS guaranties for each incoming request belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions based on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: lengths of connections following requests, packet intensities within requests, etc.). The paper is devoted to propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of networkÂ’s load and traffic characteristics. By means of computer simulation, on representative examples, it was shown, that utilization of additional knowledge about incoming traffic in the process of packet scheduling may improve QoS guaranties for serviced traffic.','{Adaptive Packet Scheduling for Requests Delay Guaranties in Packet-Switched Communication Network}',0,0,2010,0,NULL,NULL,'QoS in Networks; Prediction; Networking','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(675,'paper','SwRyGr2011-EAT','article','@article{SwRyGr2011-EAT,\n address = {Pozna{\\\'n}, Poland},\n author = {Pawel \\\'{S}wi\\k{a}tek and Piotr Rygielski and Adam Grzech},\n isbn = {2081-8580},\n journal = {Advances in Electronics and Telecommunications},\n month = {November},\n number = {3},\n pages = {50--54},\n publisher = {Pozna{\\\'n} University of Technology Press},\n title = {{Resources Management and Services Personalization in Future Internet Applications}},\n url = {http://www.advances.et.put.poznan.pl/},\n volume = {2},\n year = {2011},\n}\n\n','\n\nPawel Świątek, Piotr Rygielski, and Adam Grzech.\nResources Management and Services Personalization in Future Internet\nApplications.\nAdvances in Electronics and Telecommunications, 2(3):50-54,\nNovember 2011, Poznań University of Technology Press, Poznań, Poland.\n[ bib | http  ] 
\n@article{SwRyGr2011-EAT,\naddress = {Pozna{\\\'n}, Poland},\nauthor = {Pawel \\\'{S}wi\\k{a}tek and Piotr Rygielski and Adam Grzech},\nisbn = {2081-8580},\njournal = {Advances in Electronics and Telecommunications},\nmonth = {November},\nnumber = {3},\npages = {50--54},\npublisher = {Pozna{\\\'n} University of Technology Press},\ntitle = {{Resources Management and Services Personalization in Future Internet Applications}},\nurl = {http://www.advances.et.put.poznan.pl/},\nvolume = {2},\nyear = {2011}\n}\n
\n
\n','
\n@article{SwRyGr2011-EAT,\n  address = {Pozna{\\\'n}, Poland},\n  author = {Pawel \\\'{S}wi\\k{a}tek and Piotr Rygielski and Adam Grzech},\n  isbn = {2081-8580},\n  journal = {Advances in Electronics and Telecommunications},\n  month = {November},\n  number = {3},\n  pages = {50--54},\n  publisher = {Pozna{\\\'n} University of Technology Press},\n  title = {{Resources Management and Services Personalization in Future Internet Applications}},\n  url = {http://www.advances.et.put.poznan.pl/},\n  volume = {2},\n  year = {2011}\n}\n
\n\n',NULL,'{Resources Management and Services Personalization in Future Internet Applications}',0,11,2011,11,NULL,NULL,'QoS in Networks; Resource Management; Networking','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(676,'paper','GrSwRy2010-CBS','article','@article{GrSwRy2010-CBS,\n address = {Bristol, PA, USA},\n author = {Adam Grzech and Pawel \\\'{S}wi\\k{a}tek and Piotr Rygielski},\n issn = {0196-9722},\n journal = {{Cybernetics and Systems: An International Journal (CBS)}},\n month = {November},\n number = {8},\n pages = {610--627},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/676.pdf},\n publisher = {Taylor & Francis, Inc.},\n title = {Translations of Service Level Agreement in Systems Based on Service Oriented Architectures},\n url = {http://dx.doi.org/10.1080/01969722.2010.520225},\n volume = {41},\n year = {2010},\n note = {5-Year Impact Factor (2014): 0.968},\n abstract = {The gain of the article is to introduce and to discuss a formal specification of a computer system\'s service level agreement (SLA) and its translation into the structure of complex services (composed of atomic services) delivering required functionalities and nonfunctionalities in a distributed environment. It is assumed that the SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define the structure of the adequate complex services in form of a directed graph, where potential parallelism of atomic services performance may be taken into account. The latter qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structures are available at the considered distributed environment in different versions and locations. Different versions of atomic services are atomic services delivering the required functionalities and satisfy non-functionalities at various levels. Different locations (installation place) of available atomic services means that the cost of atomic services delivery (communication and calculation) depends on parts of the distributed systems where the services are performed. The proposed model of SLA translation into complex services structures and variants may be applied among others to calculate upper and lower complex services delivery times and to estimate the validity of possible parallelism in complex services.},\n}\n\n','\n\nAdam Grzech, Pawel Świątek, and Piotr Rygielski.\nTranslations of service level agreement in systems based on service\noriented architectures.\nCybernetics and Systems: An International Journal (CBS),\n41(8):610-627, November 2010, Taylor & Francis, Inc., Bristol, PA, USA.\n5-Year Impact Factor (2014): 0.968.\n[ bib | http | .pdf | Abstract  ] 
\n@article{GrSwRy2010-CBS,\naddress = {Bristol, PA, USA},\nauthor = {Adam Grzech and Pawel \\\'{S}wi\\k{a}tek and Piotr Rygielski},\nissn = {0196-9722},\njournal = {{Cybernetics and Systems: An International Journal (CBS)}},\nmonth = {November},\nnumber = {8},\npages = {610--627},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/676.pdf},\npublisher = {Taylor & Francis, Inc.},\ntitle = {Translations of Service Level Agreement in Systems Based on Service Oriented Architectures},\nurl = {http://dx.doi.org/10.1080/01969722.2010.520225},\nvolume = {41},\nyear = {2010},\nnote = {5-Year Impact Factor (2014): 0.968},\nabstract = {The gain of the article is to introduce and to discuss a formal specification of a computer system\'s service level agreement (SLA) and its translation into the structure of complex services (composed of atomic services) delivering required functionalities and nonfunctionalities in a distributed environment. It is assumed that the SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define the structure of the adequate complex services in form of a directed graph, where potential parallelism of atomic services performance may be taken into account. The latter qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structures are available at the considered distributed environment in different versions and locations. Different versions of atomic services are atomic services delivering the required functionalities and satisfy non-functionalities at various levels. Different locations (installation place) of available atomic services means that the cost of atomic services delivery (communication and calculation) depends on parts of the distributed systems where the services are performed. The proposed model of SLA translation into complex services structures and variants may be applied among others to calculate upper and lower complex services delivery times and to estimate the validity of possible parallelism in complex services.}\n}\n
\n
\nThe gain of the article is to introduce and to discuss a formal specification of a computer system\'s service level agreement (SLA) and its translation into the structure of complex services (composed of atomic services) delivering required functionalities and nonfunctionalities in a distributed environment. It is assumed that the SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define the structure of the adequate complex services in form of a directed graph, where potential parallelism of atomic services performance may be taken into account. The latter qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structures are available at the considered distributed environment in different versions and locations. Different versions of atomic services are atomic services delivering the required functionalities and satisfy non-functionalities at various levels. Different locations (installation place) of available atomic services means that the cost of atomic services delivery (communication and calculation) depends on parts of the distributed systems where the services are performed. The proposed model of SLA translation into complex services structures and variants may be applied among others to calculate upper and lower complex services delivery times and to estimate the validity of possible parallelism in complex services.\n
\n','
\n@article{GrSwRy2010-CBS,\n  address = {Bristol, PA, USA},\n  author = {Adam Grzech and Pawel \\\'{S}wi\\k{a}tek and Piotr Rygielski},\n  issn = {0196-9722},\n  journal = {{Cybernetics and Systems: An International Journal (CBS)}},\n  month = {November},\n  number = {8},\n  pages = {610--627},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/676.pdf},\n  publisher = {Taylor & Francis, Inc.},\n  title = {Translations of Service Level Agreement in Systems Based on Service Oriented Architectures},\n  url = {http://dx.doi.org/10.1080/01969722.2010.520225},\n  volume = {41},\n  year = {2010},\n  note = {5-Year Impact Factor (2014): 0.968},\n  abstract = {The gain of the article is to introduce and to discuss a formal specification of a computer system\'s service level agreement (SLA) and its translation into the structure of complex services (composed of atomic services) delivering required functionalities and nonfunctionalities in a distributed environment. It is assumed that the SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define the structure of the adequate complex services in form of a directed graph, where potential parallelism of atomic services performance may be taken into account. The latter qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structures are available at the considered distributed environment in different versions and locations. Different versions of atomic services are atomic services delivering the required functionalities and satisfy non-functionalities at various levels. Different locations (installation place) of available atomic services means that the cost of atomic services delivery (communication and calculation) depends on parts of the distributed systems where the services are performed. The proposed model of SLA translation into complex services structures and variants may be applied among others to calculate upper and lower complex services delivery times and to estimate the validity of possible parallelism in complex services.}\n}\n
\n\n','The gain of the article is to introduce and to discuss a formal specification of a computer system\'s service level agreement (SLA) and its translation into the structure of complex services (composed of atomic services) delivering required functionalities and nonfunctionalities in a distributed environment. It is assumed that the SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define the structure of the adequate complex services in form of a directed graph, where potential parallelism of atomic services performance may be taken into account. The latter qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structures are available at the considered distributed environment in different versions and locations. Different versions of atomic services are atomic services delivering the required functionalities and satisfy non-functionalities at various levels. Different locations (installation place) of available atomic services means that the cost of atomic services delivery (communication and calculation) depends on parts of the distributed systems where the services are performed. The proposed model of SLA translation into complex services structures and variants may be applied among others to calculate upper and lower complex services delivery times and to estimate the validity of possible parallelism in complex services.','Translations of Service Level Agreement in Systems Based on Service Oriented Architectures',0,11,2010,11,NULL,NULL,'SOA','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(677,'paper','RySw2010-SS','article','@article{RySw2010-SS,\n address = {Wroclaw, Poland},\n author = {Piotr Rygielski and Pawel \\\'Swi\\k{a}tek},\n journal = {Systems Science},\n number = {3},\n pages = {25--32},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/677.pdf},\n publisher = {Wroclaw University of Technology Press},\n title = {{Graph-fold: an Efficient Method for Complex Service Execution Plan Optimization}},\n url = {http://linksource.ebsco.com/linking.aspx?issn=0137-1223&volume=36&spage=25},\n volume = {36},\n year = {2010},\n abstract = {The task of optimization of the complex service execution plan is the last stage of the process of complex services composition in systems based on the SOA paradigm. In general this task consists of choosing proper versions of atomic services, delivering requested functionalities, such that non-functional requirements for complex service are satisfied. In most real-life cases this task is reduced to the problem of multidimensional knapsack problem (MKP), which is known to be NP-hard. Therefore, in order to facilitate effective complex service composition, it is crucial to provide an efficient MKP solution algorithm. In this paper a novel approach to the problem of optimization of complex service execution plan is introduced. In the proposed approach the MKP feasible solution space is constructed in such a way, that the optimal solution can be found in constant time. Of course, since MKP is NP-hard, the process of solution space construction takes an exponential time, This time, however, is amortized by multiple usages of single solution space for determination of optimal execution plans for multiple complex service requests.},\n}\n\n','\n\nPiotr Rygielski and Pawel Świątek.\nGraph-fold: an Efficient Method for Complex Service Execution Plan\nOptimization.\nSystems Science, 36(3):25-32, 2010, Wroclaw University of\nTechnology Press, Wroclaw, Poland.\n[ bib | http | .pdf | Abstract  ] 
\n@article{RySw2010-SS,\naddress = {Wroclaw, Poland},\nauthor = {Piotr Rygielski and Pawel \\\'Swi\\k{a}tek},\njournal = {Systems Science},\nnumber = {3},\npages = {25--32},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/677.pdf},\npublisher = {Wroclaw University of Technology Press},\ntitle = {{Graph-fold: an Efficient Method for Complex Service Execution Plan Optimization}},\nurl = {http://linksource.ebsco.com/linking.aspx?issn=0137-1223&volume=36&spage=25},\nvolume = {36},\nyear = {2010},\nabstract = {The task of optimization of the complex service execution plan is the last stage of the process of complex services composition in systems based on the SOA paradigm. In general this task consists of choosing proper versions of atomic services, delivering requested functionalities, such that non-functional requirements for complex service are satisfied. In most real-life cases this task is reduced to the problem of multidimensional knapsack problem (MKP), which is known to be NP-hard. Therefore, in order to facilitate effective complex service composition, it is crucial to provide an efficient MKP solution algorithm. In this paper a novel approach to the problem of optimization of complex service execution plan is introduced. In the proposed approach the MKP feasible solution space is constructed in such a way, that the optimal solution can be found in constant time. Of course, since MKP is NP-hard, the process of solution space construction takes an exponential time, This time, however, is amortized by multiple usages of single solution space for determination of optimal execution plans for multiple complex service requests.}\n}\n
\n
\nThe task of optimization of the complex service execution plan is the last stage of the process of complex services composition in systems based on the SOA paradigm. In general this task consists of choosing proper versions of atomic services, delivering requested functionalities, such that non-functional requirements for complex service are satisfied. In most real-life cases this task is reduced to the problem of multidimensional knapsack problem (MKP), which is known to be NP-hard. Therefore, in order to facilitate effective complex service composition, it is crucial to provide an efficient MKP solution algorithm. In this paper a novel approach to the problem of optimization of complex service execution plan is introduced. In the proposed approach the MKP feasible solution space is constructed in such a way, that the optimal solution can be found in constant time. Of course, since MKP is NP-hard, the process of solution space construction takes an exponential time, This time, however, is amortized by multiple usages of single solution space for determination of optimal execution plans for multiple complex service requests.\n
\n','
\n@article{RySw2010-SS,\n  address = {Wroclaw, Poland},\n  author = {Piotr Rygielski and Pawel \\\'Swi\\k{a}tek},\n  journal = {Systems Science},\n  number = {3},\n  pages = {25--32},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/677.pdf},\n  publisher = {Wroclaw University of Technology Press},\n  title = {{Graph-fold: an Efficient Method for Complex Service Execution Plan Optimization}},\n  url = {http://linksource.ebsco.com/linking.aspx?issn=0137-1223&volume=36&spage=25},\n  volume = {36},\n  year = {2010},\n  abstract = {The task of optimization of the complex service execution plan is the last stage of the process of complex services composition in systems based on the SOA paradigm. In general this task consists of choosing proper versions of atomic services, delivering requested functionalities, such that non-functional requirements for complex service are satisfied. In most real-life cases this task is reduced to the problem of multidimensional knapsack problem (MKP), which is known to be NP-hard. Therefore, in order to facilitate effective complex service composition, it is crucial to provide an efficient MKP solution algorithm. In this paper a novel approach to the problem of optimization of complex service execution plan is introduced. In the proposed approach the MKP feasible solution space is constructed in such a way, that the optimal solution can be found in constant time. Of course, since MKP is NP-hard, the process of solution space construction takes an exponential time, This time, however, is amortized by multiple usages of single solution space for determination of optimal execution plans for multiple complex service requests.}\n}\n
\n\n','The task of optimization of the complex service execution plan is the last stage of the process of complex services composition in systems based on the SOA paradigm. In general this task consists of choosing proper versions of atomic services, delivering requested functionalities, such that non-functional requirements for complex service are satisfied. In most real-life cases this task is reduced to the problem of multidimensional knapsack problem (MKP), which is known to be NP-hard. Therefore, in order to facilitate effective complex service composition, it is crucial to provide an efficient MKP solution algorithm. In this paper a novel approach to the problem of optimization of complex service execution plan is introduced. In the proposed approach the MKP feasible solution space is constructed in such a way, that the optimal solution can be found in constant time. Of course, since MKP is NP-hard, the process of solution space construction takes an exponential time, This time, however, is amortized by multiple usages of single solution space for determination of optimal execution plans for multiple complex service requests.','{Graph-fold: an Efficient Method for Complex Service Execution Plan Optimization}',0,0,2010,0,NULL,NULL,'SOA; Optimization','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(678,'paper','RyGo2011-ICSEng','inproceedings','@inproceedings{RyGo2011-ICSEng,\n address = {Los Alamitos, California USA},\n author = {Piotr Rygielski and Adam Gonczarek},\n booktitle = {ICSEng 2011: Proceedings of the 21st international conference on Systems Engineering (ICSEng 2011)},\n day = {16--18},\n editor = {Henry Selvaraj and Dawid Zydek},\n location = {Las Vegas, Nevada, USA},\n month = {August},\n pages = {212--216},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/678.pdf},\n publisher = {IEEE Computer Society\'s Conference Publishing Services},\n title = {{Migration-aware Optimization of Virtualized Computational Resources Allocation in Complex Systems}},\n year = {2011},\n abstract = {In this paper a task of resources allocation in the complex system is considered. Novelty of the formulated task consists of assumption that the applications assigned with resources of one machine can be migrated to another machine during system lifetime. The formulated task has been solved using proposed heuristic optimization method. Due to non-convex set of valid solutions the optimization procedure has been decomposed into two stages and forms approach similar to the relax-and-round approach. Proposed decomposition approach facilitates fast algorithm convergence and guaranties that achieved solution satisfies assumed constraints},\n}\n\n','\n\nPiotr Rygielski and Adam Gonczarek.\nMigration-aware Optimization of Virtualized Computational Resources\nAllocation in Complex Systems.\nIn ICSEng 2011: Proceedings of the 21st international conference\non Systems Engineering (ICSEng 2011), Henry Selvaraj and Dawid Zydek,\neditors, Las Vegas, Nevada, USA, August 16-18, 2011, pages 212-216. IEEE\nComputer Society\'s Conference Publishing Services, Los Alamitos, California\nUSA.\nAugust 2011.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{RyGo2011-ICSEng,\naddress = {Los Alamitos, California USA},\nauthor = {Piotr Rygielski and Adam Gonczarek},\nbooktitle = {ICSEng 2011: Proceedings of the 21st international conference on Systems Engineering (ICSEng 2011)},\nday = {16--18},\neditor = {Henry Selvaraj and Dawid Zydek},\nlocation = {Las Vegas, Nevada, USA},\nmonth = {August},\npages = {212--216},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/678.pdf},\npublisher = {IEEE Computer Society\'s Conference Publishing Services},\ntitle = {{Migration-aware Optimization of Virtualized Computational Resources Allocation in Complex Systems}},\nyear = {2011},\nabstract = {In this paper a task of resources allocation in the complex system is considered. Novelty of the formulated task consists of assumption that the applications assigned with resources of one machine can be migrated to another machine during system lifetime. The formulated task has been solved using proposed heuristic optimization method. Due to non-convex set of valid solutions the optimization procedure has been decomposed into two stages and forms approach similar to the relax-and-round approach. Proposed decomposition approach facilitates fast algorithm convergence and guaranties that achieved solution satisfies assumed constraints}\n}\n
\n
\nIn this paper a task of resources allocation in the complex system is considered. Novelty of the formulated task consists of assumption that the applications assigned with resources of one machine can be migrated to another machine during system lifetime. The formulated task has been solved using proposed heuristic optimization method. Due to non-convex set of valid solutions the optimization procedure has been decomposed into two stages and forms approach similar to the relax-and-round approach. Proposed decomposition approach facilitates fast algorithm convergence and guaranties that achieved solution satisfies assumed constraints\n
\n','
\n@inproceedings{RyGo2011-ICSEng,\n  address = {Los Alamitos, California USA},\n  author = {Piotr Rygielski and Adam Gonczarek},\n  booktitle = {ICSEng 2011: Proceedings of the 21st international conference on Systems Engineering (ICSEng 2011)},\n  day = {16--18},\n  editor = {Henry Selvaraj and Dawid Zydek},\n  location = {Las Vegas, Nevada, USA},\n  month = {August},\n  pages = {212--216},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/678.pdf},\n  publisher = {IEEE Computer Society\'s Conference Publishing Services},\n  title = {{Migration-aware Optimization of Virtualized Computational Resources Allocation in Complex Systems}},\n  year = {2011},\n  abstract = {In this paper a task of resources allocation in the complex system is considered. Novelty of the formulated task consists of assumption that the applications assigned with resources of one machine can be migrated to another machine during system lifetime. The formulated task has been solved using proposed heuristic optimization method. Due to non-convex set of valid solutions the optimization procedure has been decomposed into two stages and forms approach similar to the relax-and-round approach. Proposed decomposition approach facilitates fast algorithm convergence and guaranties that achieved solution satisfies assumed constraints}\n}\n
\n\n','In this paper a task of resources allocation in the complex system is considered. Novelty of the formulated task consists of assumption that the applications assigned with resources of one machine can be migrated to another machine during system lifetime. The formulated task has been solved using proposed heuristic optimization method. Due to non-convex set of valid solutions the optimization procedure has been decomposed into two stages and forms approach similar to the relax-and-round approach. Proposed decomposition approach facilitates fast algorithm convergence and guaranties that achieved solution satisfies assumed constraints','{Migration-aware Optimization of Virtualized Computational Resources Allocation in Complex Systems}',0,8,2011,8,NULL,NULL,'SOA; Optimization; Virtualization; Resource Management','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(679,'paper','GrRy2010-KES','inproceedings','@inproceedings{GrRy2010-KES,\n address = {Berlin, Heidelberg},\n author = {Grzech, Adam and Rygielski, Piotr},\n booktitle = {Proceedings of the 14th International Conference on Knowledge-based and Intelligent Information and Engineering Systems (KES 2010)},\n day = {8--10},\n editor = {Setchi, Rossitza and Jordanov, Ivan},\n isbn = {978-3-642-15389-1},\n location = {Cardiff, UK},\n month = {September},\n pages = {523--532},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/679.pdf},\n publisher = {Springer-Verlag},\n series = {Lecture Notes in Computer Science (LNCS)},\n title = {{Translations of Service Level Agreement in Systems Based on Service Oriented Architecture}},\n url = {http://dl.acm.org/citation.cfm?id=1885375.1885435},\n volume = {6277},\n year = {2010},\n abstract = {The gain of the paper is to introduce and to discuss a formal specification of computer system’s Service Level Agreement (SLA) and its translation into structure of complex services (composed of atomic services) delivering required functionalities and non-functionalities in distributed environment. The SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define structure of the adequate complex services as a directed graph, where potential parallelism of atomic services performance may be taken into account. The qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structure are available in the environment in different versions and locations. Different versions of atomic services are delivering the required functionalities and satisfy non-functionalities at various levels. Various locations of atomic services means that the time and cost of atomic services delivery (communication and calculation) may vary. Proposed model of SLA translation into complex services causes that a scenario variants may be applied — among others — to calculate upper and lower complex services’ delivering times and to estimate validity of possible parallelism in complex services.},\n}\n\n','\n\nAdam Grzech and Piotr Rygielski.\nTranslations of Service Level Agreement in Systems Based on Service\nOriented Architecture.\nIn Proceedings of the 14th International Conference on\nKnowledge-based and Intelligent Information and Engineering Systems (KES\n2010), Rossitza Setchi and Ivan Jordanov, editors, Cardiff, UK, September\n8-10, 2010, volume 6277 of Lecture Notes in Computer Science (LNCS),\npages 523-532. Springer-Verlag, Berlin, Heidelberg.\nSeptember 2010.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{GrRy2010-KES,\naddress = {Berlin, Heidelberg},\nauthor = {Grzech, Adam and Rygielski, Piotr},\nbooktitle = {Proceedings of the 14th International Conference on Knowledge-based and Intelligent Information and Engineering Systems (KES 2010)},\nday = {8--10},\neditor = {Setchi, Rossitza and Jordanov, Ivan},\nisbn = {978-3-642-15389-1},\nlocation = {Cardiff, UK},\nmonth = {September},\npages = {523--532},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/679.pdf},\npublisher = {Springer-Verlag},\nseries = {Lecture Notes in Computer Science (LNCS)},\ntitle = {{Translations of Service Level Agreement in Systems Based on Service Oriented Architecture}},\nurl = {http://dl.acm.org/citation.cfm?id=1885375.1885435},\nvolume = {6277},\nyear = {2010},\nabstract = {The gain of the paper is to introduce and to discuss a formal specification of computer system’s Service Level Agreement (SLA) and its translation into structure of complex services (composed of atomic services) delivering required functionalities and non-functionalities in distributed environment. The SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define structure of the adequate complex services as a directed graph, where potential parallelism of atomic services performance may be taken into account. The qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structure are available in the environment in different versions and locations. Different versions of atomic services are delivering the required functionalities and satisfy non-functionalities at various levels. Various locations of atomic services means that the time and cost of atomic services delivery (communication and calculation) may vary. Proposed model of SLA translation into complex services causes that a scenario variants may be applied — among others — to calculate upper and lower complex services’ delivering times and to estimate validity of possible parallelism in complex services.}\n}\n
\n
\nThe gain of the paper is to introduce and to discuss a formal specification of computer system’s Service Level Agreement (SLA) and its translation into structure of complex services (composed of atomic services) delivering required functionalities and non-functionalities in distributed environment. The SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define structure of the adequate complex services as a directed graph, where potential parallelism of atomic services performance may be taken into account. The qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structure are available in the environment in different versions and locations. Different versions of atomic services are delivering the required functionalities and satisfy non-functionalities at various levels. Various locations of atomic services means that the time and cost of atomic services delivery (communication and calculation) may vary. Proposed model of SLA translation into complex services causes that a scenario variants may be applied — among others — to calculate upper and lower complex services’ delivering times and to estimate validity of possible parallelism in complex services.\n
\n','
\n@inproceedings{GrRy2010-KES,\n  address = {Berlin, Heidelberg},\n  author = {Grzech, Adam and Rygielski, Piotr},\n  booktitle = {Proceedings of the 14th International Conference on Knowledge-based and Intelligent Information and Engineering Systems (KES 2010)},\n  day = {8--10},\n  editor = {Setchi, Rossitza and Jordanov, Ivan},\n  isbn = {978-3-642-15389-1},\n  location = {Cardiff, UK},\n  month = {September},\n  pages = {523--532},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/679.pdf},\n  publisher = {Springer-Verlag},\n  series = {Lecture Notes in Computer Science (LNCS)},\n  title = {{Translations of Service Level Agreement in Systems Based on Service Oriented Architecture}},\n  url = {http://dl.acm.org/citation.cfm?id=1885375.1885435},\n  volume = {6277},\n  year = {2010},\n  abstract = {The gain of the paper is to introduce and to discuss a formal specification of computer system’s Service Level Agreement (SLA) and its translation into structure of complex services (composed of atomic services) delivering required functionalities and non-functionalities in distributed environment. The SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define structure of the adequate complex services as a directed graph, where potential parallelism of atomic services performance may be taken into account. The qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structure are available in the environment in different versions and locations. Different versions of atomic services are delivering the required functionalities and satisfy non-functionalities at various levels. Various locations of atomic services means that the time and cost of atomic services delivery (communication and calculation) may vary. Proposed model of SLA translation into complex services causes that a scenario variants may be applied — among others — to calculate upper and lower complex services’ delivering times and to estimate validity of possible parallelism in complex services.}\n}\n
\n\n','The gain of the paper is to introduce and to discuss a formal specification of computer system’s Service Level Agreement (SLA) and its translation into structure of complex services (composed of atomic services) delivering required functionalities and non-functionalities in distributed environment. The SLA is composed of two parts specifying quantitative and qualitative requirements. The former requirements define structure of the adequate complex services as a directed graph, where potential parallelism of atomic services performance may be taken into account. The qualitative requirements are applied to select the optimal complex service realization scenario; it is based on assumption that various atomic services distinguished in the complex services structure are available in the environment in different versions and locations. Different versions of atomic services are delivering the required functionalities and satisfy non-functionalities at various levels. Various locations of atomic services means that the time and cost of atomic services delivery (communication and calculation) may vary. Proposed model of SLA translation into complex services causes that a scenario variants may be applied — among others — to calculate upper and lower complex services’ delivering times and to estimate validity of possible parallelism in complex services.','{Translations of Service Level Agreement in Systems Based on Service Oriented Architecture}',0,9,2010,9,NULL,NULL,'SOA; Optimization','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(680,'paper','SwRy2011-CIST','inproceedings','@inproceedings{SwRy2011-CIST,\n author = {\\\'{S}wi\\k{a}tek, Pawe{\\l} and Rygielski, Piotr},\n booktitle = {{Proceedings of the VIth International Scientific and Technical Conference (CSIT 2011)}},\n day = {16--19},\n location = {Lviv, Ukraine},\n month = {November},\n pages = {136--139},\n publisher = {Publishing House Vezha&Co},\n title = {{Universal Comunication Platform for QoS-aware Delivery of Complex Services}},\n year = {2011},\n}\n\n','\n\nPawel Świątek and Piotr Rygielski.\nUniversal Comunication Platform for QoS-aware Delivery of Complex\nServices.\nIn Proceedings of the VIth International Scientific and\nTechnical Conference (CSIT 2011), Lviv, Ukraine, November 16-19, 2011,\npages 136-139. Publishing House Vezha&Co.\nNovember 2011.\n[ bib  ] 
\n@inproceedings{SwRy2011-CIST,\nauthor = {\\\'{S}wi\\k{a}tek, Pawe{\\l} and Rygielski, Piotr},\nbooktitle = {{Proceedings of the VIth International Scientific and Technical Conference (CSIT 2011)}},\nday = {16--19},\nlocation = {Lviv, Ukraine},\nmonth = {November},\npages = {136--139},\npublisher = {Publishing House Vezha&Co},\ntitle = {{Universal Comunication Platform for QoS-aware Delivery of Complex Services}},\nyear = {2011}\n}\n
\n
\n','
\n@inproceedings{SwRy2011-CIST,\n  author = {\\\'{S}wi\\k{a}tek, Pawe{\\l} and Rygielski, Piotr},\n  booktitle = {{Proceedings of the VIth International Scientific and Technical Conference (CSIT 2011)}},\n  day = {16--19},\n  location = {Lviv, Ukraine},\n  month = {November},\n  pages = {136--139},\n  publisher = {Publishing House Vezha&Co},\n  title = {{Universal Comunication Platform for QoS-aware Delivery of Complex Services}},\n  year = {2011}\n}\n
\n\n',NULL,'{Universal Comunication Platform for QoS-aware Delivery of Complex Services}',0,11,2011,11,NULL,NULL,'SOA; Virtualization; Resource Management; QoS in Networks; Networking','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(681,'paper','GrSwRy2010-IFIP','incollection','@incollection{GrSwRy2010-IFIP,\n address = {Boston},\n author = {Grzech, Adam and \\\'Swi\\k{a}tek, Pawel and Rygielski, Piotr},\n booktitle = {Software Services for e-World},\n editor = {Cellary, Wojciech and Estevez, Elsa},\n isbn = {978-3-642-16282-4},\n month = {November},\n pages = {17--28},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/681.pdf},\n publisher = {Springer},\n series = {IFIP Advances in Information and Communication Technology},\n title = {{Dynamic Resources Allocation for Delivery of Personalized Services}},\n url = {http://dx.doi.org/10.1007/978-3-642-16283-1_6},\n volume = {341},\n year = {2010},\n abstract = {The aim of this paper is to introduce a problem of e-health services quality management. The process of delivering e-health services to users consists of two major tasks: service personalization and resources allocation. In this paper we introduce a use-cases of e-health system and distinguish services that can be offered. In order to satisfy user requirements one have to manage resources properly especially when communication conditions change (e.g. in an ambulance). An exemplary solution has been presented and conclusions for further work have been formulated.},\n}\n\n','\n\nAdam Grzech, Pawel Świątek, and Piotr Rygielski.\nDynamic Resources Allocation for Delivery of Personalized Services.\nIn Software Services for e-World, Wojciech Cellary and Elsa\nEstevez, editors, volume 341 of IFIP Advances in Information and\nCommunication Technology, pages 17-28. Springer, Boston, November 2010.\n[ bib | http | .pdf | Abstract  ] 
\n@incollection{GrSwRy2010-IFIP,\naddress = {Boston},\nauthor = {Grzech, Adam and \\\'Swi\\k{a}tek, Pawel and Rygielski, Piotr},\nbooktitle = {Software Services for e-World},\neditor = {Cellary, Wojciech and Estevez, Elsa},\nisbn = {978-3-642-16282-4},\nmonth = {November},\npages = {17--28},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/681.pdf},\npublisher = {Springer},\nseries = {IFIP Advances in Information and Communication Technology},\ntitle = {{Dynamic Resources Allocation for Delivery of Personalized Services}},\nurl = {http://dx.doi.org/10.1007/978-3-642-16283-1_6},\nvolume = {341},\nyear = {2010},\nabstract = {The aim of this paper is to introduce a problem of e-health services quality management. The process of delivering e-health services to users consists of two major tasks: service personalization and resources allocation. In this paper we introduce a use-cases of e-health system and distinguish services that can be offered. In order to satisfy user requirements one have to manage resources properly especially when communication conditions change (e.g. in an ambulance). An exemplary solution has been presented and conclusions for further work have been formulated.}\n}\n
\n
\nThe aim of this paper is to introduce a problem of e-health services quality management. The process of delivering e-health services to users consists of two major tasks: service personalization and resources allocation. In this paper we introduce a use-cases of e-health system and distinguish services that can be offered. In order to satisfy user requirements one have to manage resources properly especially when communication conditions change (e.g. in an ambulance). An exemplary solution has been presented and conclusions for further work have been formulated.\n
\n','
\n@incollection{GrSwRy2010-IFIP,\n  address = {Boston},\n  author = {Grzech, Adam and \\\'Swi\\k{a}tek, Pawel and Rygielski, Piotr},\n  booktitle = {Software Services for e-World},\n  editor = {Cellary, Wojciech and Estevez, Elsa},\n  isbn = {978-3-642-16282-4},\n  month = {November},\n  pages = {17--28},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/681.pdf},\n  publisher = {Springer},\n  series = {IFIP Advances in Information and Communication Technology},\n  title = {{Dynamic Resources Allocation for Delivery of Personalized Services}},\n  url = {http://dx.doi.org/10.1007/978-3-642-16283-1_6},\n  volume = {341},\n  year = {2010},\n  abstract = {The aim of this paper is to introduce a problem of e-health services quality management. The process of delivering e-health services to users consists of two major tasks: service personalization and resources allocation. In this paper we introduce a use-cases of e-health system and distinguish services that can be offered. In order to satisfy user requirements one have to manage resources properly especially when communication conditions change (e.g. in an ambulance). An exemplary solution has been presented and conclusions for further work have been formulated.}\n}\n
\n\n','The aim of this paper is to introduce a problem of e-health services quality management. The process of delivering e-health services to users consists of two major tasks: service personalization and resources allocation. In this paper we introduce a use-cases of e-health system and distinguish services that can be offered. In order to satisfy user requirements one have to manage resources properly especially when communication conditions change (e.g. in an ambulance). An exemplary solution has been presented and conclusions for further work have been formulated.','{Dynamic Resources Allocation for Delivery of Personalized Services}',0,11,2010,11,NULL,NULL,'Virtualization; Resource Management; QoS in Networks; Networking','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(682,'paper','SwRyJuGr2012-CBS','article','@article{SwRyJuGr2012-CBS,\n address = {Bristol, PA, USA},\n author = {Pawe{l} \\\'{S}wi\\k{a}tek and Piotr Rygielski and Krzysztof Juszczyszyn and Adam Grzech},\n isbn = {0196-9722},\n journal = {{Cybernetics and Systems: An International Journal (CBS)}},\n month = {May},\n number = {4},\n pages = {340--353},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/682.pdf},\n publisher = {Taylor & Francis, Inc.},\n title = {{User Assignment and Movement Prediction in Wireless Networks}},\n url = {http://www.tandfonline.com/doi/abs/10.1080/01969722.2012.678219},\n volume = {43},\n note = {5-Year Impact Factor (2014): 0.968},\n year = {2012},\n abstract = {The article is devoted to the problem of mobility and resource management in heterogeneous wireless networks. It is assumed that in certain areas covered by multiple overlapping wireless networks there are a certain number of mobile clients that consume networks resources by use of the available communication services (e.g., voice or data transmission) delivered by network providers. Moreover, it is assumed that the continuity of communication services may be assured by the use of common handover techniques supporting client mobility (e.g., Mobile IPv6, IEEE 802.21, etc.). The task of mobility and resource management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g., utilization of network resources). In this article we show that gathering knowledge about client movements and prediction of their future positions may significantly improve the overall quality of the services delivered and network resource utilization.},\n}\n\n','\n\nPawel Świątek, Piotr Rygielski, Krzysztof Juszczyszyn, and Adam\nGrzech.\nUser Assignment and Movement Prediction in Wireless Networks.\nCybernetics and Systems: An International Journal (CBS),\n43(4):340-353, May 2012, Taylor & Francis, Inc., Bristol, PA, USA.\n5-Year Impact Factor (2014): 0.968.\n[ bib | http | .pdf | Abstract  ] 
\n@article{SwRyJuGr2012-CBS,\naddress = {Bristol, PA, USA},\nauthor = {Pawe{l} \\\'{S}wi\\k{a}tek and Piotr Rygielski and Krzysztof Juszczyszyn and Adam Grzech},\nisbn = {0196-9722},\njournal = {{Cybernetics and Systems: An International Journal (CBS)}},\nmonth = {May},\nnumber = {4},\npages = {340--353},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/682.pdf},\npublisher = {Taylor & Francis, Inc.},\ntitle = {{User Assignment and Movement Prediction in Wireless Networks}},\nurl = {http://www.tandfonline.com/doi/abs/10.1080/01969722.2012.678219},\nvolume = {43},\nnote = {5-Year Impact Factor (2014): 0.968},\nyear = {2012},\nabstract = {The article is devoted to the problem of mobility and resource management in heterogeneous wireless networks. It is assumed that in certain areas covered by multiple overlapping wireless networks there are a certain number of mobile clients that consume networks resources by use of the available communication services (e.g., voice or data transmission) delivered by network providers. Moreover, it is assumed that the continuity of communication services may be assured by the use of common handover techniques supporting client mobility (e.g., Mobile IPv6, IEEE 802.21, etc.). The task of mobility and resource management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g., utilization of network resources). In this article we show that gathering knowledge about client movements and prediction of their future positions may significantly improve the overall quality of the services delivered and network resource utilization.}\n}\n
\n
\nThe article is devoted to the problem of mobility and resource management in heterogeneous wireless networks. It is assumed that in certain areas covered by multiple overlapping wireless networks there are a certain number of mobile clients that consume networks resources by use of the available communication services (e.g., voice or data transmission) delivered by network providers. Moreover, it is assumed that the continuity of communication services may be assured by the use of common handover techniques supporting client mobility (e.g., Mobile IPv6, IEEE 802.21, etc.). The task of mobility and resource management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g., utilization of network resources). In this article we show that gathering knowledge about client movements and prediction of their future positions may significantly improve the overall quality of the services delivered and network resource utilization.\n
\n','
\n@article{SwRyJuGr2012-CBS,\n  address = {Bristol, PA, USA},\n  author = {Pawe{l} \\\'{S}wi\\k{a}tek and Piotr Rygielski and Krzysztof Juszczyszyn and Adam Grzech},\n  isbn = {0196-9722},\n  journal = {{Cybernetics and Systems: An International Journal (CBS)}},\n  month = {May},\n  number = {4},\n  pages = {340--353},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/682.pdf},\n  publisher = {Taylor & Francis, Inc.},\n  title = {{User Assignment and Movement Prediction in Wireless Networks}},\n  url = {http://www.tandfonline.com/doi/abs/10.1080/01969722.2012.678219},\n  volume = {43},\n  note = {5-Year Impact Factor (2014): 0.968},\n  year = {2012},\n  abstract = {The article is devoted to the problem of mobility and resource management in heterogeneous wireless networks. It is assumed that in certain areas covered by multiple overlapping wireless networks there are a certain number of mobile clients that consume networks resources by use of the available communication services (e.g., voice or data transmission) delivered by network providers. Moreover, it is assumed that the continuity of communication services may be assured by the use of common handover techniques supporting client mobility (e.g., Mobile IPv6, IEEE 802.21, etc.). The task of mobility and resource management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g., utilization of network resources). In this article we show that gathering knowledge about client movements and prediction of their future positions may significantly improve the overall quality of the services delivered and network resource utilization.}\n}\n
\n\n','The article is devoted to the problem of mobility and resource management in heterogeneous wireless networks. It is assumed that in certain areas covered by multiple overlapping wireless networks there are a certain number of mobile clients that consume networks resources by use of the available communication services (e.g., voice or data transmission) delivered by network providers. Moreover, it is assumed that the continuity of communication services may be assured by the use of common handover techniques supporting client mobility (e.g., Mobile IPv6, IEEE 802.21, etc.). The task of mobility and resource management consists of making decisions concerning the moment and the network to which particular clients should be handed over in order to optimize certain quality criterion (e.g., utilization of network resources). In this article we show that gathering knowledge about client movements and prediction of their future positions may significantly improve the overall quality of the services delivered and network resource utilization.','{User Assignment and Movement Prediction in Wireless Networks}',0,5,2012,5,NULL,NULL,'Resource Management; QoS in Networks; Prediction; Networking','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(683,'paper','rygielski2009a','mastersthesis','@mastersthesis{rygielski2009a,\n abstract = {In this thesis, the problem of controlling network traffic for guaranteeing demanded Quality of Service level was presented. An architecture for network node with parallel processing units was considered and exemplary problems of teletraffic control were formulated. The process of service is a multistage process. A simulation environment was designed and developed for the needs of quantitatively analysis of control algorithms placed on the node. There were load balancing and packet scheduling algorithms implemented. Exemplary simulations were run to present functionality of environment and the way, users should implement their own, new algorithms was presented. At the end, the work was summarised and the future work plans were presented.},\n address = {Wybrze{\\.z}e Wyspia{\\\'n}skiego 27, 50-370 Wroclaw, Poland},\n author = {Piotr Rygielski},\n month = {July},\n note = {The work is written in Polish language.},\n school = {Wroclaw University of Technology},\n title = {{Software implementation of the simulation environment of the system for multistage parallel processing of teletraffic in the node of the packet-switched network for traffic control algorithms performance analysis purposes.}},\n year = {2009},\n}\n\n','\n\nPiotr Rygielski.\nSoftware implementation of the simulation environment of the system\nfor multistage parallel processing of teletraffic in the node of the\npacket-switched network for traffic control algorithms performance analysis\npurposes.\nMaster\'s thesis, Wroclaw University of Technology, Wybrzeże\nWyspiańskiego 27, 50-370 Wroclaw, Poland, July 2009.\nThe work is written in Polish language.\n[ bib | Abstract  ] 
\n@mastersthesis{rygielski2009a,\nabstract = {In this thesis, the problem of controlling network traffic for guaranteeing demanded Quality of Service level was presented. An architecture for network node with parallel processing units was considered and exemplary problems of teletraffic control were formulated. The process of service is a multistage process. A simulation environment was designed and developed for the needs of quantitatively analysis of control algorithms placed on the node. There were load balancing and packet scheduling algorithms implemented. Exemplary simulations were run to present functionality of environment and the way, users should implement their own, new algorithms was presented. At the end, the work was summarised and the future work plans were presented.},\naddress = {Wybrze{\\.z}e Wyspia{\\\'n}skiego 27, 50-370 Wroclaw, Poland},\nauthor = {Piotr Rygielski},\nmonth = {July},\nnote = {The work is written in Polish language.},\nschool = {Wroclaw University of Technology},\ntitle = {{Software implementation of the simulation environment of the system for multistage parallel processing of teletraffic in the node of the packet-switched network for traffic control algorithms performance analysis purposes.}},\nyear = {2009}\n}\n
\n
\nIn this thesis, the problem of controlling network traffic for guaranteeing demanded Quality of Service level was presented. An architecture for network node with parallel processing units was considered and exemplary problems of teletraffic control were formulated. The process of service is a multistage process. A simulation environment was designed and developed for the needs of quantitatively analysis of control algorithms placed on the node. There were load balancing and packet scheduling algorithms implemented. Exemplary simulations were run to present functionality of environment and the way, users should implement their own, new algorithms was presented. At the end, the work was summarised and the future work plans were presented.\n
\n','
\n@mastersthesis{rygielski2009a,\n  abstract = {In this thesis, the problem of controlling network traffic for guaranteeing demanded Quality of Service level was presented. An architecture for network node with parallel processing units was considered and exemplary problems of teletraffic control were formulated. The process of service is a multistage process. A simulation environment was designed and developed for the needs of quantitatively analysis of control algorithms placed on the node. There were load balancing and packet scheduling algorithms implemented. Exemplary simulations were run to present functionality of environment and the way, users should implement their own, new algorithms was presented. At the end, the work was summarised and the future work plans were presented.},\n  address = {Wybrze{\\.z}e Wyspia{\\\'n}skiego 27, 50-370 Wroclaw, Poland},\n  author = {Piotr Rygielski},\n  month = {July},\n  note = {The work is written in Polish language.},\n  school = {Wroclaw University of Technology},\n  title = {{Software implementation of the simulation environment of the system for multistage parallel processing of teletraffic in the node of the packet-switched network for traffic control algorithms performance analysis purposes.}},\n  year = {2009}\n}\n
\n\n','In this thesis, the problem of controlling network traffic for guaranteeing demanded Quality of Service level was presented. An architecture for network node with parallel processing units was considered and exemplary problems of teletraffic control were formulated. The process of service is a multistage process. A simulation environment was designed and developed for the needs of quantitatively analysis of control algorithms placed on the node. There were load balancing and packet scheduling algorithms implemented. Exemplary simulations were run to present functionality of environment and the way, users should implement their own, new algorithms was presented. At the end, the work was summarised and the future work plans were presented.','{Software implementation of the simulation environment of the system for multistage parallel processing of teletraffic in the node of the packet-switched network for traffic control algorithms performance analysis purposes.}',0,7,2009,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(684,'paper','SPEC-RG-NEWSLETTER-1','misc','@misc{SPEC-RG-NEWSLETTER-1,\n author = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\n month = {September},\n note = {Published by Standard Performance Evaluation Corporation (SPEC)},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/684.pdf},\n title = {{SPEC Research Group Newsletter, vol. 1 no. 1}},\n url = {http://research.spec.org/en/newsletter.html},\n year = {2012},\n}\n\n','\n\nSamuel Kounev, Kai Sachs, and Piotr Rygielski.\nSPEC Research Group Newsletter, vol. 1 no. 1, September 2012.\nPublished by Standard Performance Evaluation Corporation (SPEC).\n[ bib | .html | .pdf  ] 
\n@misc{SPEC-RG-NEWSLETTER-1,\nauthor = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\nmonth = {September},\nnote = {Published by Standard Performance Evaluation Corporation (SPEC)},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/684.pdf},\ntitle = {{SPEC Research Group Newsletter, vol. 1 no. 1}},\nurl = {http://research.spec.org/en/newsletter.html},\nyear = {2012}\n}\n
\n
\n','
\n@misc{SPEC-RG-NEWSLETTER-1,\n  author = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\n  month = {September},\n  note = {Published by Standard Performance Evaluation Corporation (SPEC)},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/684.pdf},\n  title = {{SPEC Research Group Newsletter, vol. 1 no. 1}},\n  url = {http://research.spec.org/en/newsletter.html},\n  year = {2012}\n}\n
\n\n',NULL,'{SPEC Research Group Newsletter, vol. 1 no. 1}',0,9,2012,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(685,'paper','SPEC-RG-NEWSLETTER-2','misc','@misc{SPEC-RG-NEWSLETTER-2,\n author = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\n month = {June},\n note = {Published by Standard Performance Evaluation Corporation (SPEC)},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/685.pdf},\n title = {{SPEC Research Group Newsletter, vol. 1 no. 2}},\n url = {http://research.spec.org/en/newsletter.html},\n year = {2013},\n}\n\n','\n\nSamuel Kounev, Kai Sachs, and Piotr Rygielski.\nSPEC Research Group Newsletter, vol. 1 no. 2, June 2013.\nPublished by Standard Performance Evaluation Corporation (SPEC).\n[ bib | .html | .pdf  ] 
\n@misc{SPEC-RG-NEWSLETTER-2,\nauthor = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\nmonth = {June},\nnote = {Published by Standard Performance Evaluation Corporation (SPEC)},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/685.pdf},\ntitle = {{SPEC Research Group Newsletter, vol. 1 no. 2}},\nurl = {http://research.spec.org/en/newsletter.html},\nyear = {2013}\n}\n
\n
\n','
\n@misc{SPEC-RG-NEWSLETTER-2,\n  author = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\n  month = {June},\n  note = {Published by Standard Performance Evaluation Corporation (SPEC)},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/685.pdf},\n  title = {{SPEC Research Group Newsletter, vol. 1 no. 2}},\n  url = {http://research.spec.org/en/newsletter.html},\n  year = {2013}\n}\n
\n\n',NULL,'{SPEC Research Group Newsletter, vol. 1 no. 2}',0,6,2013,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(686,'paper','RyKoZs2013-ThroughputPrediction','inproceedings','@inproceedings{RyKoZs2013-ThroughputPrediction,\n author = {Piotr Rygielski and Samuel Kounev and Steffen Zschaler},\n booktitle = {{Proceedings of the 2nd IEEE International Workshop on Measurements and Networking (M\\&N 2013)}},\n day = {7--8},\n location = {Naples, Italy},\n month = {October},\n pages = {167--172},\n isbn = {978-1-4673-2873-9},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/686.pdf},\n title = {{Model-Based Throughput Prediction in Data Center Networks}},\n year = {2013},\n abstract = {In this paper, we address the problem of performance analysis in computer networks. We present a new meta-model designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. We evaluate the approach in a case study of a road traffic monitoring system. We compare the performance prediction results against the real system and a benchmark. The presented results show that our approach, despite of introducing many modeling abstractions, delivers predictions with errors less than 32% and correctly detects bottlenecks in the modeled network.},\n}\n\n','\n\nPiotr Rygielski, Samuel Kounev, and Steffen Zschaler.\nModel-Based Throughput Prediction in Data Center Networks.\nIn Proceedings of the 2nd IEEE International Workshop on\nMeasurements and Networking (M&N 2013), Naples, Italy, October 7-8, 2013,\npages 167-172.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{RyKoZs2013-ThroughputPrediction,\nauthor = {Piotr Rygielski and Samuel Kounev and Steffen Zschaler},\nbooktitle = {{Proceedings of the 2nd IEEE International Workshop on Measurements and Networking (M\\&N 2013)}},\nday = {7--8},\nlocation = {Naples, Italy},\nmonth = {October},\npages = {167--172},\nisbn = {978-1-4673-2873-9},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/686.pdf},\ntitle = {{Model-Based Throughput Prediction in Data Center Networks}},\nyear = {2013},\nabstract = {In this paper, we address the problem of performance analysis in computer networks. We present a new meta-model designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. We evaluate the approach in a case study of a road traffic monitoring system. We compare the performance prediction results against the real system and a benchmark. The presented results show that our approach, despite of introducing many modeling abstractions, delivers predictions with errors less than 32% and correctly detects bottlenecks in the modeled network.}\n}\n
\n
\nIn this paper, we address the problem of performance analysis in computer networks. We present a new meta-model designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. We evaluate the approach in a case study of a road traffic monitoring system. We compare the performance prediction results against the real system and a benchmark. The presented results show that our approach, despite of introducing many modeling abstractions, delivers predictions with errors less than 32% and correctly detects bottlenecks in the modeled network.\n
\n','
\n@inproceedings{RyKoZs2013-ThroughputPrediction,\n  author = {Piotr Rygielski and Samuel Kounev and Steffen Zschaler},\n  booktitle = {{Proceedings of the 2nd IEEE International Workshop on Measurements and Networking (M\\&N 2013)}},\n  day = {7--8},\n  location = {Naples, Italy},\n  month = {October},\n  pages = {167--172},\n  isbn = {978-1-4673-2873-9},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/686.pdf},\n  title = {{Model-Based Throughput Prediction in Data Center Networks}},\n  year = {2013},\n  abstract = {In this paper, we address the problem of performance analysis in computer networks. We present a new meta-model designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. We evaluate the approach in a case study of a road traffic monitoring system. We compare the performance prediction results against the real system and a benchmark. The presented results show that our approach, despite of introducing many modeling abstractions, delivers predictions with errors less than 32% and correctly detects bottlenecks in the modeled network.}\n}\n
\n\n','In this paper, we address the problem of performance analysis in computer networks. We present a new meta-model designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. We evaluate the approach in a case study of a road traffic monitoring system. We compare the performance prediction results against the real system and a benchmark. The presented results show that our approach, despite of introducing many modeling abstractions, delivers predictions with errors less than 32% and correctly detects bottlenecks in the modeled network.','{Model-Based Throughput Prediction in Data Center Networks}',0,10,2013,10,NULL,NULL,'Networking; Simulation; Modeling; Performance; Prediction','0000-00-00 00:00:00','2016-06-01 09:41:01',0),(688,'paper','KrLoKo2013-CGC-FeedbackController','inproceedings','@inproceedings{KrLoKo2013-CGC-FeedbackController,\n author = {Rouven Krebs and Arpit Mehta},\n booktitle = {Proceedings of the 3rd IEEE International Conference on Cloud and Green Computing (CGC 2013)},\n location = {Karlsruhe, Germany},\n title = {{A Feedback Controlled Scheduler for Performance Isolation in Multi-tenant Applications}},\n notes = {Poster},\n year = {2013},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/688.pdf},\n}\n\n','\n\nRouven Krebs and Arpit Mehta.\nA Feedback Controlled Scheduler for Performance Isolation in\nMulti-tenant Applications.\nIn Proceedings of the 3rd IEEE International Conference on Cloud\nand Green Computing (CGC 2013), Karlsruhe, Germany, 2013.\n[ bib | .pdf  ] 
\n@inproceedings{KrLoKo2013-CGC-FeedbackController,\nauthor = {Rouven Krebs and Arpit Mehta},\nbooktitle = {Proceedings of the 3rd IEEE International Conference on Cloud and Green Computing (CGC 2013)},\nlocation = {Karlsruhe, Germany},\ntitle = {{A Feedback Controlled Scheduler for Performance Isolation in Multi-tenant Applications}},\nnotes = {Poster},\nyear = {2013},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/688.pdf}\n}\n
\n
\n','
\n@inproceedings{KrLoKo2013-CGC-FeedbackController,\n  author = {Rouven Krebs and Arpit Mehta},\n  booktitle = {Proceedings of the 3rd IEEE International Conference on Cloud and Green Computing (CGC 2013)},\n  location = {Karlsruhe, Germany},\n  title = {{A Feedback Controlled Scheduler for Performance Isolation in Multi-tenant Applications}},\n  notes = {Poster},\n  year = {2013},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/688.pdf}\n}\n
\n\n',NULL,'{A Feedback Controlled Scheduler for Performance Isolation in Multi-tenant Applications}',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(689,'paper','MoKoJuBa2013-BMSD-SoftReservations','inproceedings','@inproceedings{MoKoJuBa2013-BMSD-SoftReservations,\n author = {Seyed Vahid Mohammadi and Samuel Kounev and Adri\\\"{a}n Juan-Verdejo and Bholanathsingh Surajbali},\n booktitle = {Proceedings of the 3rd International Symposium on Business Modeling and Software Design (BMSD 2013)},\n location = {Noordwijkerhout, The Netherlands},\n title = {{Soft Reservations: Uncertainty-Aware Resource Reservations in IaaS Environments}},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/689.pdf},\n year = {2013},\n}\n\n','\n\nSeyed Vahid Mohammadi, Samuel Kounev, Adriän Juan-Verdejo, and\nBholanathsingh Surajbali.\nSoft Reservations: Uncertainty-Aware Resource Reservations in IaaS\nEnvironments.\nIn Proceedings of the 3rd International Symposium on Business\nModeling and Software Design (BMSD 2013), Noordwijkerhout, The Netherlands,\n2013.\n[ bib | .pdf  ] 
\n@inproceedings{MoKoJuBa2013-BMSD-SoftReservations,\nauthor = {Seyed Vahid Mohammadi and Samuel Kounev and Adri\\\"{a}n Juan-Verdejo and Bholanathsingh Surajbali},\nbooktitle = {Proceedings of the 3rd International Symposium on Business Modeling and Software Design (BMSD 2013)},\nlocation = {Noordwijkerhout, The Netherlands},\ntitle = {{Soft Reservations: Uncertainty-Aware Resource Reservations in IaaS Environments}},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/689.pdf},\nyear = {2013}\n}\n
\n
\n','
\n@inproceedings{MoKoJuBa2013-BMSD-SoftReservations,\n  author = {Seyed Vahid Mohammadi and Samuel Kounev and Adri\\\"{a}n Juan-Verdejo and Bholanathsingh Surajbali},\n  booktitle = {Proceedings of the 3rd International Symposium on Business Modeling and Software Design (BMSD 2013)},\n  location = {Noordwijkerhout, The Netherlands},\n  title = {{Soft Reservations: Uncertainty-Aware Resource Reservations in IaaS Environments}},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/689.pdf},\n  year = {2013}\n}\n
\n\n',NULL,'{Soft Reservations: Uncertainty-Aware Resource Reservations in IaaS Environments}',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(690,'paper','Gorsler2013a','mastersthesis','@mastersthesis{Gorsler2013a,\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n author = {Fabian Gorsler},\n month = {July},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/690.pdf},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Online Performance Queries for Architecture-Level Performance Models}},\n year = {2013},\n}\n\n','\n\nFabian Gorsler.\nOnline Performance Queries for Architecture-Level Performance\nModels.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, July 2013.\n[ bib | .pdf  ] 
\n@mastersthesis{Gorsler2013a,\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nauthor = {Fabian Gorsler},\nmonth = {July},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/690.pdf},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Online Performance Queries for Architecture-Level Performance Models}},\nyear = {2013}\n}\n
\n
\n','
\n@mastersthesis{Gorsler2013a,\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  author = {Fabian Gorsler},\n  month = {July},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/690.pdf},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Online Performance Queries for Architecture-Level Performance Models}},\n  year = {2013}\n}\n
\n\n',NULL,'{Online Performance Queries for Architecture-Level Performance Models}',0,7,2013,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(691,'paper','Walter2013-parallel-simulation','mastersthesis','@mastersthesis{Walter2013-parallel-simulation,\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n author = {J\\\"{u}rgen Walter},\n month = {October},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Parallel Simulation of Queueing Petri Net Models}},\n year = {2013},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/691.pdf},\n type = {Master Thesis},\n abstract = {For years the CPU clock frequency was the key to improve processor performance. Nowadays, modern processors enable performance improvements by increasing the number of cores. However, existing software needs to be adapted to be able to utilize multiple cores. Such an adaptation poses many challenges in the field of discrete-event software simulation. Decades of intensive research have been spent to find a general solution for parallel discrete event simulation. In this context, QNs and PNs have been extensively studied. However, to the best of our knowledge, there is only one previous work that considers the concurrent simulation of QPN [Juergens1997]. This work focuses on comparing different synchronization algorithms and excludes a majority of lookahead calculation and net decomposition. In this thesis, we build upon and extend this work. For this purpose, we adapted and extended findings from QNs, PNs and parallel simulation in general. We apply our findings to SimQPN, which is a sequential simulation engine for QPN. Among other application areas, SimQPN is currently applied to online performance prediction for which a speedup due to parallelization is desirable. We present a parallel SimQPN implementation that employs application level and event level parallelism. A validation ensures the functional correctness of the new parallel implementations. The parallelization of multiple runs enables almost linear speedup. We parallelized the execution of a single run by the use of a conservative barrier-based synchronization algorithm. The speedup for a single run depends on the capability of the model. Hence, a number of experiments on different net characteristics were conducted showing that for certain models a superlinear speedup is possible.},\n}\n\n','\n\nJürgen Walter.\nParallel Simulation of Queueing Petri Net Models.\nMaster thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, October 2013.\n[ bib | .pdf | Abstract  ] 
\n@mastersthesis{Walter2013-parallel-simulation,\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nauthor = {J\\\"{u}rgen Walter},\nmonth = {October},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Parallel Simulation of Queueing Petri Net Models}},\nyear = {2013},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/691.pdf},\ntype = {Master Thesis},\nabstract = {For years the CPU clock frequency was the key to improve processor performance. Nowadays, modern processors enable performance improvements by increasing the number of cores. However, existing software needs to be adapted to be able to utilize multiple cores. Such an adaptation poses many challenges in the field of discrete-event software simulation. Decades of intensive research have been spent to find a general solution for parallel discrete event simulation. In this context, QNs and PNs have been extensively studied. However, to the best of our knowledge, there is only one previous work that considers the concurrent simulation of QPN [Juergens1997]. This work focuses on comparing different synchronization algorithms and excludes a majority of lookahead calculation and net decomposition. In this thesis, we build upon and extend this work. For this purpose, we adapted and extended findings from QNs, PNs and parallel simulation in general. We apply our findings to SimQPN, which is a sequential simulation engine for QPN. Among other application areas, SimQPN is currently applied to online performance prediction for which a speedup due to parallelization is desirable. We present a parallel SimQPN implementation that employs application level and event level parallelism. A validation ensures the functional correctness of the new parallel implementations. The parallelization of multiple runs enables almost linear speedup. We parallelized the execution of a single run by the use of a conservative barrier-based synchronization algorithm. The speedup for a single run depends on the capability of the model. Hence, a number of experiments on different net characteristics were conducted showing that for certain models a superlinear speedup is possible.}\n}\n
\n
\nFor years the CPU clock frequency was the key to improve processor performance. Nowadays, modern processors enable performance improvements by increasing the number of cores. However, existing software needs to be adapted to be able to utilize multiple cores. Such an adaptation poses many challenges in the field of discrete-event software simulation. Decades of intensive research have been spent to find a general solution for parallel discrete event simulation. In this context, QNs and PNs have been extensively studied. However, to the best of our knowledge, there is only one previous work that considers the concurrent simulation of QPN [Juergens1997]. This work focuses on comparing different synchronization algorithms and excludes a majority of lookahead calculation and net decomposition. In this thesis, we build upon and extend this work. For this purpose, we adapted and extended findings from QNs, PNs and parallel simulation in general. We apply our findings to SimQPN, which is a sequential simulation engine for QPN. Among other application areas, SimQPN is currently applied to online performance prediction for which a speedup due to parallelization is desirable. We present a parallel SimQPN implementation that employs application level and event level parallelism. A validation ensures the functional correctness of the new parallel implementations. The parallelization of multiple runs enables almost linear speedup. We parallelized the execution of a single run by the use of a conservative barrier-based synchronization algorithm. The speedup for a single run depends on the capability of the model. Hence, a number of experiments on different net characteristics were conducted showing that for certain models a superlinear speedup is possible.\n
\n','
\n@mastersthesis{Walter2013-parallel-simulation,\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  author = {J\\\"{u}rgen Walter},\n  month = {October},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Parallel Simulation of Queueing Petri Net Models}},\n  year = {2013},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/691.pdf},\n  type = {Master Thesis},\n  abstract = {For years the CPU clock frequency was the key to improve processor performance. Nowadays, modern processors enable performance improvements by increasing the number of cores. However, existing software needs to be adapted to be able to utilize multiple cores. Such an adaptation poses many challenges in the field of discrete-event software simulation. Decades of intensive research have been spent to find a general solution for parallel discrete event simulation. In this context, QNs and PNs have been extensively studied. However, to the best of our knowledge, there is only one previous work that considers the concurrent simulation of QPN [Juergens1997]. This work focuses on comparing different synchronization algorithms and excludes a majority of lookahead calculation and net decomposition. In this thesis, we build upon and extend this work. For this purpose, we adapted and extended findings from QNs, PNs and parallel simulation in general. We apply our findings to SimQPN, which is a sequential simulation engine for QPN. Among other application areas, SimQPN is currently applied to online performance prediction for which a speedup due to parallelization is desirable. We present a parallel SimQPN implementation that employs application level and event level parallelism. A validation ensures the functional correctness of the new parallel implementations. The parallelization of multiple runs enables almost linear speedup. We parallelized the execution of a single run by the use of a conservative barrier-based synchronization algorithm. The speedup for a single run depends on the capability of the model. Hence, a number of experiments on different net characteristics were conducted showing that for certain models a superlinear speedup is possible.}\n}\n
\n\n','For years the CPU clock frequency was the key to improve processor performance. Nowadays, modern processors enable performance improvements by increasing the number of cores. However, existing software needs to be adapted to be able to utilize multiple cores. Such an adaptation poses many challenges in the field of discrete-event software simulation. Decades of intensive research have been spent to find a general solution for parallel discrete event simulation. In this context, QNs and PNs have been extensively studied. However, to the best of our knowledge, there is only one previous work that considers the concurrent simulation of QPN [Juergens1997]. This work focuses on comparing different synchronization algorithms and excludes a majority of lookahead calculation and net decomposition. In this thesis, we build upon and extend this work. For this purpose, we adapted and extended findings from QNs, PNs and parallel simulation in general. We apply our findings to SimQPN, which is a sequential simulation engine for QPN. Among other application areas, SimQPN is currently applied to online performance prediction for which a speedup due to parallelization is desirable. We present a parallel SimQPN implementation that employs application level and event level parallelism. A validation ensures the functional correctness of the new parallel implementations. The parallelization of multiple runs enables almost linear speedup. We parallelized the execution of a single run by the use of a conservative barrier-based synchronization algorithm. The speedup for a single run depends on the capability of the model. Hence, a number of experiments on different net characteristics were conducted showing that for certain models a superlinear speedup is possible.','{Parallel Simulation of Queueing Petri Net Models}',0,10,2013,10,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(697,'paper','GoBrKo2013-ControllingPCM','inproceedings','@inproceedings{GoBrKo2013-ControllingPCM,\n title = {Controlling the Palladio Bench using the Descartes Query Language},\n author = {Gorsler, Fabian and Brosig, Fabian and Kounev, Samuel},\n booktitle = {Proceedings of the Symposium on Software Performance: Joint Kieker/Palladio Days (KPDAYS 2013)},\n year = {2013},\n address = {Aachen, Germany},\n editor = {Becker, Steffen and Hasselbring, Wilhelm and van Hoorn, Andr\\\'{e} and Reussner, Ralf},\n month = {November},\n number = {1083},\n pages = {109--118},\n publisher = {CEUR-WS.org},\n abstract = {The Palladio Bench is a tool to model, simulate and analyze Palladio Component Model (PCM) instances. However, for the Palladio Bench, no single interface to automate experiments or Application Programming Interface (API) to trigger the simulation of PCM instances and to extract performance prediction results is available. The Descartes Query Language (DQL) is a novel approach of a declarative query language to integrate different performance modeling and prediction techniques behind a unifying interface. Users benefit from the abstraction of specific tools to prepare and trigger performance predictions, less effort to obtain performance metrics of interest, and means to automate performance predictions. In this paper, we describe the realization of a DQL Connector for PCM and demonstrate the applicability of our approach in a case study.},\n url = {http://ceur-ws.org/Vol-1083/},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/697.pdf},\n}\n\n','\n\nFabian Gorsler, Fabian Brosig, and Samuel Kounev.\nControlling the palladio bench using the descartes query language.\nIn Proceedings of the Symposium on Software Performance: Joint\nKieker/Palladio Days (KPDAYS 2013), Steffen Becker, Wilhelm Hasselbring,\nAndré van Hoorn, and Ralf Reussner, editors, November 2013, number 1083,\npages 109-118. CEUR-WS.org, Aachen, Germany.\nNovember 2013.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{GoBrKo2013-ControllingPCM,\ntitle = {Controlling the Palladio Bench using the Descartes Query Language},\nauthor = {Gorsler, Fabian and Brosig, Fabian and Kounev, Samuel},\nbooktitle = {Proceedings of the Symposium on Software Performance: Joint Kieker/Palladio Days (KPDAYS 2013)},\nyear = {2013},\naddress = {Aachen, Germany},\neditor = {Becker, Steffen and Hasselbring, Wilhelm and van Hoorn, Andr\\\'{e} and Reussner, Ralf},\nmonth = {November},\nnumber = {1083},\npages = {109--118},\npublisher = {CEUR-WS.org},\nabstract = {The Palladio Bench is a tool to model, simulate and analyze Palladio Component Model (PCM) instances. However, for the Palladio Bench, no single interface to automate experiments or Application Programming Interface (API) to trigger the simulation of PCM instances and to extract performance prediction results is available. The Descartes Query Language (DQL) is a novel approach of a declarative query language to integrate different performance modeling and prediction techniques behind a unifying interface. Users benefit from the abstraction of specific tools to prepare and trigger performance predictions, less effort to obtain performance metrics of interest, and means to automate performance predictions. In this paper, we describe the realization of a DQL Connector for PCM and demonstrate the applicability of our approach in a case study.},\nurl = {http://ceur-ws.org/Vol-1083/},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/697.pdf}\n}\n
\n
\nThe Palladio Bench is a tool to model, simulate and analyze Palladio Component Model (PCM) instances. However, for the Palladio Bench, no single interface to automate experiments or Application Programming Interface (API) to trigger the simulation of PCM instances and to extract performance prediction results is available. The Descartes Query Language (DQL) is a novel approach of a declarative query language to integrate different performance modeling and prediction techniques behind a unifying interface. Users benefit from the abstraction of specific tools to prepare and trigger performance predictions, less effort to obtain performance metrics of interest, and means to automate performance predictions. In this paper, we describe the realization of a DQL Connector for PCM and demonstrate the applicability of our approach in a case study.\n
\n','
\n@inproceedings{GoBrKo2013-ControllingPCM,\n  title = {Controlling the Palladio Bench using the Descartes Query Language},\n  author = {Gorsler, Fabian and Brosig, Fabian and Kounev, Samuel},\n  booktitle = {Proceedings of the Symposium on Software Performance: Joint Kieker/Palladio Days (KPDAYS 2013)},\n  year = {2013},\n  address = {Aachen, Germany},\n  editor = {Becker, Steffen and Hasselbring, Wilhelm and van Hoorn, Andr\\\'{e} and Reussner, Ralf},\n  month = {November},\n  number = {1083},\n  pages = {109--118},\n  publisher = {CEUR-WS.org},\n  abstract = {The Palladio Bench is a tool to model, simulate and analyze Palladio Component Model (PCM) instances. However, for the Palladio Bench, no single interface to automate experiments or Application Programming Interface (API) to trigger the simulation of PCM instances and to extract performance prediction results is available. The Descartes Query Language (DQL) is a novel approach of a declarative query language to integrate different performance modeling and prediction techniques behind a unifying interface. Users benefit from the abstraction of specific tools to prepare and trigger performance predictions, less effort to obtain performance metrics of interest, and means to automate performance predictions. In this paper, we describe the realization of a DQL Connector for PCM and demonstrate the applicability of our approach in a case study.},\n  url = {http://ceur-ws.org/Vol-1083/},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/697.pdf}\n}\n
\n\n','The Palladio Bench is a tool to model, simulate and analyze Palladio Component Model (PCM) instances. However, for the Palladio Bench, no single interface to automate experiments or Application Programming Interface (API) to trigger the simulation of PCM instances and to extract performance prediction results is available. The Descartes Query Language (DQL) is a novel approach of a declarative query language to integrate different performance modeling and prediction techniques behind a unifying interface. Users benefit from the abstraction of specific tools to prepare and trigger performance predictions, less effort to obtain performance metrics of interest, and means to automate performance predictions. In this paper, we describe the realization of a DQL Connector for PCM and demonstrate the applicability of our approach in a case study.','Controlling the Palladio Bench using the Descartes Query Language',0,11,2013,11,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(702,'paper','GoBrKo2014-PerformanceQueries','inproceedings','@inproceedings{GoBrKo2014-PerformanceQueries,\n title = {{Performance Queries for Architecture-Level Performance Models}},\n author = {Gorsler, Fabian and Brosig, Fabian and Kounev, Samuel},\n booktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n year = {2014},\n month = {{March}},\n address = {New York, NY, USA},\n note = {Acceptance Rate (Full Paper): 14/56 = 25\\%.},\n publisher = {ACM},\n location = {Dublin, Ireland},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/702.pdf},\n doi = {10.1145/2568088.2568100},\n}\n\n','\n\nFabian Gorsler, Fabian Brosig, and Samuel Kounev.\nPerformance Queries for Architecture-Level Performance Models.\nIn Proceedings of the 5th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2014), Dublin, Ireland, March 2014. ACM, New\nYork, NY, USA.\nMarch 2014, Acceptance Rate (Full Paper): 14/56 = 25%.\n[ bib | DOI | .pdf  ] 
\n@inproceedings{GoBrKo2014-PerformanceQueries,\ntitle = {{Performance Queries for Architecture-Level Performance Models}},\nauthor = {Gorsler, Fabian and Brosig, Fabian and Kounev, Samuel},\nbooktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\nyear = {2014},\nmonth = {{March}},\naddress = {New York, NY, USA},\nnote = {Acceptance Rate (Full Paper): 14/56 = 25\\%.},\npublisher = {ACM},\nlocation = {Dublin, Ireland},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/702.pdf},\ndoi = {10.1145/2568088.2568100}\n}\n
\n
\n','
\n@inproceedings{GoBrKo2014-PerformanceQueries,\n  title = {{Performance Queries for Architecture-Level Performance Models}},\n  author = {Gorsler, Fabian and Brosig, Fabian and Kounev, Samuel},\n  booktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n  year = {2014},\n  month = {{March}},\n  address = {New York, NY, USA},\n  note = {Acceptance Rate (Full Paper): 14/56 = 25\\%.},\n  publisher = {ACM},\n  location = {Dublin, Ireland},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/702.pdf},\n  doi = {10.1145/2568088.2568100}\n}\n
\n\n',NULL,'{Performance Queries for Architecture-Level Performance Models}',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(703,'paper','SpCaZhKo2014-ICPEDemo-LibReDE','inproceedings','@inproceedings{SpCaZhKo2014-ICPEDemo-LibReDE,\n abstract = {When creating a performance model, it is necessary to quantify the amount of resources consumed by an application serving individual requests. In distributed enterprise systems, these resource demands usually cannot be observed directly, their estimation is a major challenge. Different statistical approaches to resource demand estimation based on monitoring data have been proposed, e.g., using linear regression or Kalman filtering techniques. In this paper, we present LibReDE, a library of ready-to-use implementations of approaches to resource demand estimation that can be used for online and offline analysis. It is the first publicly available tool for this task and aims at supporting performance engineers during performance model construction. The library enables the quick comparison of the estimation accuracy of different approaches in a given context and thus helps to select an optimal one.},\n author = {Simon Spinner and Giuliano Casale and Xiaoyun Zhu and Samuel Kounev},\n titleaddon = {{(Demo Paper)}},\n booktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n day = {22--26},\n location = {Dublin, Ireland},\n month = {March},\n publisher = {ACM Press},\n isbn = {978-1-4503-2733-6},\n title = {{LibReDE: A Library for Resource Demand Estimation}},\n year = {2014},\n pages = {227--228},\n url = {http://doi.acm.org/10.1145/2568088.2576093},\n address = {New York, NY, USA},\n doi = {10.1145/2568088.2576093},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/703.pdf},\n}\n\n','\n\nSimon Spinner, Giuliano Casale, Xiaoyun Zhu, and Samuel Kounev.\nLibReDE: A Library for Resource Demand Estimation (Demo Paper).\nIn Proceedings of the 5th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2014), Dublin, Ireland, March 22-26, 2014,\npages 227-228. ACM Press, New York, NY, USA.\nMarch 2014.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{SpCaZhKo2014-ICPEDemo-LibReDE,\nabstract = {When creating a performance model, it is necessary to quantify the amount of resources consumed by an application serving individual requests. In distributed enterprise systems, these resource demands usually cannot be observed directly, their estimation is a major challenge. Different statistical approaches to resource demand estimation based on monitoring data have been proposed, e.g., using linear regression or Kalman filtering techniques. In this paper, we present LibReDE, a library of ready-to-use implementations of approaches to resource demand estimation that can be used for online and offline analysis. It is the first publicly available tool for this task and aims at supporting performance engineers during performance model construction. The library enables the quick comparison of the estimation accuracy of different approaches in a given context and thus helps to select an optimal one.},\nauthor = {Simon Spinner and Giuliano Casale and Xiaoyun Zhu and Samuel Kounev},\ntitleaddon = {{(Demo Paper)}},\nbooktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\nday = {22--26},\nlocation = {Dublin, Ireland},\nmonth = {March},\npublisher = {ACM Press},\nisbn = {978-1-4503-2733-6},\ntitle = {{LibReDE: A Library for Resource Demand Estimation}},\nyear = {2014},\npages = {227--228},\nurl = {http://doi.acm.org/10.1145/2568088.2576093},\naddress = {New York, NY, USA},\ndoi = {10.1145/2568088.2576093},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/703.pdf}\n}\n
\n
\nWhen creating a performance model, it is necessary to quantify the amount of resources consumed by an application serving individual requests. In distributed enterprise systems, these resource demands usually cannot be observed directly, their estimation is a major challenge. Different statistical approaches to resource demand estimation based on monitoring data have been proposed, e.g., using linear regression or Kalman filtering techniques. In this paper, we present LibReDE, a library of ready-to-use implementations of approaches to resource demand estimation that can be used for online and offline analysis. It is the first publicly available tool for this task and aims at supporting performance engineers during performance model construction. The library enables the quick comparison of the estimation accuracy of different approaches in a given context and thus helps to select an optimal one.\n
\n','
\n@inproceedings{SpCaZhKo2014-ICPEDemo-LibReDE,\n  abstract = {When creating a performance model, it is necessary to quantify the amount of resources consumed by an application serving individual requests. In distributed enterprise systems, these resource demands usually cannot be observed directly, their estimation is a major challenge. Different statistical approaches to resource demand estimation based on monitoring data have been proposed, e.g., using linear regression or Kalman filtering techniques. In this paper, we present LibReDE, a library of ready-to-use implementations of approaches to resource demand estimation that can be used for online and offline analysis. It is the first publicly available tool for this task and aims at supporting performance engineers during performance model construction. The library enables the quick comparison of the estimation accuracy of different approaches in a given context and thus helps to select an optimal one.},\n  author = {Simon Spinner and Giuliano Casale and Xiaoyun Zhu and Samuel Kounev},\n  titleaddon = {{(Demo Paper)}},\n  booktitle = {Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n  day = {22--26},\n  location = {Dublin, Ireland},\n  month = {March},\n  publisher = {ACM Press},\n  isbn = {978-1-4503-2733-6},\n  title = {{LibReDE: A Library for Resource Demand Estimation}},\n  year = {2014},\n  pages = {227--228},\n  url = {http://doi.acm.org/10.1145/2568088.2576093},\n  address = {New York, NY, USA},\n  doi = {10.1145/2568088.2576093},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/703.pdf}\n}\n
\n\n','When creating a performance model, it is necessary to quantify the amount of resources consumed by an application serving individual requests. In distributed enterprise systems, these resource demands usually cannot be observed directly, their estimation is a major challenge. Different statistical approaches to resource demand estimation based on monitoring data have been proposed, e.g., using linear regression or Kalman filtering techniques. In this paper, we present LibReDE, a library of ready-to-use implementations of approaches to resource demand estimation that can be used for online and offline analysis. It is the first publicly available tool for this task and aims at supporting performance engineers during performance model construction. The library enables the quick comparison of the estimation accuracy of different approaches in a given context and thus helps to select an optimal one.','{LibReDE: A Library for Resource Demand Estimation}',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(705,'paper','RyKo2014-DCPerf-DNI2QPN','inproceedings','@inproceedings{RyKo2014-DCPerf-DNI2QPN,\n author = {Piotr Rygielski and Samuel Kounev},\n booktitle = {34th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2014 Workshops). 4th International Workshop on Data Center Performance, (DCPerf 2014)},\n location = {Madrid, Spain},\n title = {{Data Center Network Throughput Analysis using Queueing Petri Nets}},\n year = {2014},\n month = {June},\n day = {30},\n pages = {100--105},\n doi = {10.1109/ICDCSW.2014.11},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/705.pdf},\n abstract = {In this paper, we address the problem of performance analysis in computer networks. We present a metamodel designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. In this paper, we present the transformation to Queueing Petri Nets (QPNs) and simulate them using SimQPN simulator. We show that despite the high level of abstraction of the QPNs, we are able to estimate the utilization of resources with good accuracy within a short time.},\n}\n\n','\n\nPiotr Rygielski and Samuel Kounev.\nData Center Network Throughput Analysis using Queueing Petri Nets.\nIn 34th IEEE International Conference on Distributed Computing\nSystems Workshops (ICDCS 2014 Workshops). 4th International Workshop on Data\nCenter Performance, (DCPerf 2014), Madrid, Spain, June 30, 2014, pages\n100-105.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{RyKo2014-DCPerf-DNI2QPN,\nauthor = {Piotr Rygielski and Samuel Kounev},\nbooktitle = {34th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2014 Workshops). 4th International Workshop on Data Center Performance, (DCPerf 2014)},\nlocation = {Madrid, Spain},\ntitle = {{Data Center Network Throughput Analysis using Queueing Petri Nets}},\nyear = {2014},\nmonth = {June},\nday = {30},\npages = {100--105},\ndoi = {10.1109/ICDCSW.2014.11},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/705.pdf},\nabstract = {In this paper, we address the problem of performance analysis in computer networks. We present a metamodel designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. In this paper, we present the transformation to Queueing Petri Nets (QPNs) and simulate them using SimQPN simulator. We show that despite the high level of abstraction of the QPNs, we are able to estimate the utilization of resources with good accuracy within a short time.}\n}\n
\n
\nIn this paper, we address the problem of performance analysis in computer networks. We present a metamodel designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. In this paper, we present the transformation to Queueing Petri Nets (QPNs) and simulate them using SimQPN simulator. We show that despite the high level of abstraction of the QPNs, we are able to estimate the utilization of resources with good accuracy within a short time.\n
\n','
\n@inproceedings{RyKo2014-DCPerf-DNI2QPN,\n  author = {Piotr Rygielski and Samuel Kounev},\n  booktitle = {34th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2014 Workshops). 4th International Workshop on Data Center Performance, (DCPerf 2014)},\n  location = {Madrid, Spain},\n  title = {{Data Center Network Throughput Analysis using Queueing Petri Nets}},\n  year = {2014},\n  month = {June},\n  day = {30},\n  pages = {100--105},\n  doi = {10.1109/ICDCSW.2014.11},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/705.pdf},\n  abstract = {In this paper, we address the problem of performance analysis in computer networks. We present a metamodel designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. In this paper, we present the transformation to Queueing Petri Nets (QPNs) and simulate them using SimQPN simulator. We show that despite the high level of abstraction of the QPNs, we are able to estimate the utilization of resources with good accuracy within a short time.}\n}\n
\n\n','In this paper, we address the problem of performance analysis in computer networks. We present a metamodel designed for the performance modeling of network infrastructures in modern data centers. Instances of our metamodel can be automatically transformed into stochastic simulation models for performance prediction. In this paper, we present the transformation to Queueing Petri Nets (QPNs) and simulate them using SimQPN simulator. We show that despite the high level of abstraction of the QPNs, we are able to estimate the utilization of resources with good accuracy within a short time.','{Data Center Network Throughput Analysis using Queueing Petri Nets}',0,6,2014,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(706,'paper','KrScHe2014-HotTopiCS-OptimizationApproach','inproceedings','@inproceedings{KrScHe2014-HotTopiCS-OptimizationApproach,\n abstract = {{Software-as-a-Service (SaaS) often shares one single application instance among different tenants to reduce costs. However, sharing potentially leads to undesired influence from one tenant onto the performance observed by the others. Furthermore, providing one tenant additional resources to support its increasing demands without increasing the performance of tenants who do not pay for it is a major challenge. The application intentionally does not manage hardware resources, and the OS is not aware of application level entities like tenants. Thus, it is difficult to control the performance of different tenants to keep them isolated. These problems gain importance as performance is one of the major obstacles for cloud customers. Existing work applies request based admission control mechanisms like a weighted round robin with an individual queue for each tenant to control the share guaranteed for a tenant. However, the computation of the concrete weights for such an admission control is still challenging. In this paper, we present a fitness function and optimization approach reflecting various requirements from this field to compute proper weights with the goal to ensure an isolated performance as foundation to scale on a tenants basis.}},\n author = {Rouven Krebs and Philipp Schneider and Nikolas Herbst},\n booktitle = {Proceedings of the 2nd International Workshop on Hot Topics in Cloud Service Scalability (HotTopiCS 2014), co-located with the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n day = {22},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/706.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/706},\n location = {Dublin, Ireland},\n month = {March},\n publisher = {ACM},\n keywords = {SaaS, Multi-Tenancy, Performance, Isolation, Scalability},\n title = {{Optimization Method for Request Admission Control to Guarantee Performance Isolation}},\n year = {2014},\n}\n\n','\n\nRouven Krebs, Philipp Schneider, and Nikolas Herbst.\nOptimization Method for Request Admission Control to Guarantee\nPerformance Isolation.\nIn Proceedings of the 2nd International Workshop on Hot Topics\nin Cloud Service Scalability (HotTopiCS 2014), co-located with the 5th\nACM/SPEC International Conference on Performance Engineering (ICPE 2014),\nDublin, Ireland, March 22, 2014. ACM.\nMarch 2014.\n[ bib | slides | .pdf | Abstract  ] 
\n@inproceedings{KrScHe2014-HotTopiCS-OptimizationApproach,\nabstract = {{Software-as-a-Service (SaaS) often shares one single application instance among different tenants to reduce costs. However, sharing potentially leads to undesired influence from one tenant onto the performance observed by the others. Furthermore, providing one tenant additional resources to support its increasing demands without increasing the performance of tenants who do not pay for it is a major challenge. The application intentionally does not manage hardware resources, and the OS is not aware of application level entities like tenants. Thus, it is difficult to control the performance of different tenants to keep them isolated. These problems gain importance as performance is one of the major obstacles for cloud customers. Existing work applies request based admission control mechanisms like a weighted round robin with an individual queue for each tenant to control the share guaranteed for a tenant. However, the computation of the concrete weights for such an admission control is still challenging. In this paper, we present a fitness function and optimization approach reflecting various requirements from this field to compute proper weights with the goal to ensure an isolated performance as foundation to scale on a tenants basis.}},\nauthor = {Rouven Krebs and Philipp Schneider and Nikolas Herbst},\nbooktitle = {Proceedings of the 2nd International Workshop on Hot Topics in Cloud Service Scalability (HotTopiCS 2014), co-located with the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\nday = {22},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/706.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/706},\nlocation = {Dublin, Ireland},\nmonth = {March},\npublisher = {ACM},\nkeywords = {SaaS, Multi-Tenancy, Performance, Isolation, Scalability},\ntitle = {{Optimization Method for Request Admission Control to Guarantee Performance Isolation}},\nyear = {2014}\n}\n
\n
\nSoftware-as-a-Service (SaaS) often shares one single application instance among different tenants to reduce costs. However, sharing potentially leads to undesired influence from one tenant onto the performance observed by the others. Furthermore, providing one tenant additional resources to support its increasing demands without increasing the performance of tenants who do not pay for it is a major challenge. The application intentionally does not manage hardware resources, and the OS is not aware of application level entities like tenants. Thus, it is difficult to control the performance of different tenants to keep them isolated. These problems gain importance as performance is one of the major obstacles for cloud customers. Existing work applies request based admission control mechanisms like a weighted round robin with an individual queue for each tenant to control the share guaranteed for a tenant. However, the computation of the concrete weights for such an admission control is still challenging. In this paper, we present a fitness function and optimization approach reflecting various requirements from this field to compute proper weights with the goal to ensure an isolated performance as foundation to scale on a tenants basis.\n
\n','
\n@inproceedings{KrScHe2014-HotTopiCS-OptimizationApproach,\n  abstract = {{Software-as-a-Service (SaaS) often shares one single application instance among different tenants to reduce costs. However, sharing potentially leads to undesired influence from one tenant onto the performance observed by the others. Furthermore, providing one tenant additional resources to support its increasing demands without increasing the performance of tenants who do not pay for it is a major challenge. The application intentionally does not manage hardware resources, and the OS is not aware of application level entities like tenants. Thus, it is difficult to control the performance of different tenants to keep them isolated. These problems gain importance as performance is one of the major obstacles for cloud customers. Existing work applies request based admission control mechanisms like a weighted round robin with an individual queue for each tenant to control the share guaranteed for a tenant. However, the computation of the concrete weights for such an admission control is still challenging. In this paper, we present a fitness function and optimization approach reflecting various requirements from this field to compute proper weights with the goal to ensure an isolated performance as foundation to scale on a tenants basis.}},\n  author = {Rouven Krebs and Philipp Schneider and Nikolas Herbst},\n  booktitle = {Proceedings of the 2nd International Workshop on Hot Topics in Cloud Service Scalability (HotTopiCS 2014), co-located with the 5th ACM/SPEC International Conference on Performance Engineering (ICPE 2014)},\n  day = {22},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/706.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/706},\n  location = {Dublin, Ireland},\n  month = {March},\n  publisher = {ACM},\n  keywords = {SaaS, Multi-Tenancy, Performance, Isolation, Scalability},\n  title = {{Optimization Method for Request Admission Control to Guarantee Performance Isolation}},\n  year = {2014}\n}\n
\n\n','{Software-as-a-Service (SaaS) often shares one single application instance among different tenants to reduce costs. However, sharing potentially leads to undesired influence from one tenant onto the performance observed by the others. Furthermore, providing one tenant additional resources to support its increasing demands without increasing the performance of tenants who do not pay for it is a major challenge. The application intentionally does not manage hardware resources, and the OS is not aware of application level entities like tenants. Thus, it is difficult to control the performance of different tenants to keep them isolated. These problems gain importance as performance is one of the major obstacles for cloud customers. Existing work applies request based admission control mechanisms like a weighted round robin with an individual queue for each tenant to control the share guaranteed for a tenant. However, the computation of the concrete weights for such an admission control is still challenging. In this paper, we present a fitness function and optimization approach reflecting various requirements from this field to compute proper weights with the goal to ensure an isolated performance as foundation to scale on a tenants basis.}','{Optimization Method for Request Admission Control to Guarantee Performance Isolation}',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(707,'paper','KrSpAhKo2014_CCGrid_ResourceIsolation','inproceedings','@inproceedings{KrSpAhKo2014_CCGrid_ResourceIsolation,\n abstract = {{Multi-tenancy is an approach to share one application instance among multiple customers by providing each of them a dedicated view. This approach is commonly used by SaaS providers to reduce the costs for service provisioning. Tenants also expect to be isolated in terms of the performance they observe and the providers inability to offer performance guarantees is a major obstacle for potential cloud customers. To guarantee an isolated performance it is essential to control the resources used by a tenant. This is a challenge, because the layers of the execution environment, responsible for controlling resource usage (e.g., operating system), normally do not have knowledge about entities defined at the application level and thus they cannot distinguish between different tenants. Furthermore, it is hard to predict how tenant requests propagate through the multiple layers of the execution environment down to the physical resource layer. The intended abstraction of the application from the resource controlling layers does not allow to solely solving this problem in the application. In this paper, we propose an approach which applies resource demand estimation techniques in combination with a request based admission control. The resource demand estimation is used to determine resource consumption information for individual requests. The admission control mechanism uses this knowledge to delay requests originating from tenants that exceed their allocated resource share. The proposed method is validated by a widely accepted benchmark showing its applicability in a setup motivated by today\'s platform environments.}},\n author = {Rouven Krebs and Simon Spinner and Nadia Ahmed and Samuel Kounev},\n booktitle = {Proceedings of the 14th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2014)},\n day = {26},\n location = {Chicago, IL, USA},\n month = {May},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/707.pdf},\n publisher = {IEEE/ACM},\n title = {{Resource Usage Control In Multi-Tenant Applications}},\n note = {Acceptance Rate: 19\\% (54/283)},\n year = {2014},\n doi = {10.1109/CCGrid.2014.80},\n pages = {122-131},\n}\n\n','\n\nRouven Krebs, Simon Spinner, Nadia Ahmed, and Samuel Kounev.\nResource Usage Control In Multi-Tenant Applications.\nIn Proceedings of the 14th IEEE/ACM International Symposium on\nCluster, Cloud and Grid Computing (CCGrid 2014), Chicago, IL, USA, May 26,\n2014, pages 122-131. IEEE/ACM.\nMay 2014, Acceptance Rate: 19% (54/283).\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{KrSpAhKo2014_CCGrid_ResourceIsolation,\nabstract = {{Multi-tenancy is an approach to share one application instance among multiple customers by providing each of them a dedicated view. This approach is commonly used by SaaS providers to reduce the costs for service provisioning. Tenants also expect to be isolated in terms of the performance they observe and the providers inability to offer performance guarantees is a major obstacle for potential cloud customers. To guarantee an isolated performance it is essential to control the resources used by a tenant. This is a challenge, because the layers of the execution environment, responsible for controlling resource usage (e.g., operating system), normally do not have knowledge about entities defined at the application level and thus they cannot distinguish between different tenants. Furthermore, it is hard to predict how tenant requests propagate through the multiple layers of the execution environment down to the physical resource layer. The intended abstraction of the application from the resource controlling layers does not allow to solely solving this problem in the application. In this paper, we propose an approach which applies resource demand estimation techniques in combination with a request based admission control. The resource demand estimation is used to determine resource consumption information for individual requests. The admission control mechanism uses this knowledge to delay requests originating from tenants that exceed their allocated resource share. The proposed method is validated by a widely accepted benchmark showing its applicability in a setup motivated by today\'s platform environments.}},\nauthor = {Rouven Krebs and Simon Spinner and Nadia Ahmed and Samuel Kounev},\nbooktitle = {Proceedings of the 14th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2014)},\nday = {26},\nlocation = {Chicago, IL, USA},\nmonth = {May},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/707.pdf},\npublisher = {IEEE/ACM},\ntitle = {{Resource Usage Control In Multi-Tenant Applications}},\nnote = {Acceptance Rate: 19\\% (54/283)},\nyear = {2014},\ndoi = {10.1109/CCGrid.2014.80},\npages = {122-131}\n}\n
\n
\nMulti-tenancy is an approach to share one application instance among multiple customers by providing each of them a dedicated view. This approach is commonly used by SaaS providers to reduce the costs for service provisioning. Tenants also expect to be isolated in terms of the performance they observe and the providers inability to offer performance guarantees is a major obstacle for potential cloud customers. To guarantee an isolated performance it is essential to control the resources used by a tenant. This is a challenge, because the layers of the execution environment, responsible for controlling resource usage (e.g., operating system), normally do not have knowledge about entities defined at the application level and thus they cannot distinguish between different tenants. Furthermore, it is hard to predict how tenant requests propagate through the multiple layers of the execution environment down to the physical resource layer. The intended abstraction of the application from the resource controlling layers does not allow to solely solving this problem in the application. In this paper, we propose an approach which applies resource demand estimation techniques in combination with a request based admission control. The resource demand estimation is used to determine resource consumption information for individual requests. The admission control mechanism uses this knowledge to delay requests originating from tenants that exceed their allocated resource share. The proposed method is validated by a widely accepted benchmark showing its applicability in a setup motivated by today\'s platform environments.\n
\n','
\n@inproceedings{KrSpAhKo2014_CCGrid_ResourceIsolation,\n  abstract = {{Multi-tenancy is an approach to share one application instance among multiple customers by providing each of them a dedicated view. This approach is commonly used by SaaS providers to reduce the costs for service provisioning. Tenants also expect to be isolated in terms of the performance they observe and the providers inability to offer performance guarantees is a major obstacle for potential cloud customers. To guarantee an isolated performance it is essential to control the resources used by a tenant. This is a challenge, because the layers of the execution environment, responsible for controlling resource usage (e.g., operating system), normally do not have knowledge about entities defined at the application level and thus they cannot distinguish between different tenants. Furthermore, it is hard to predict how tenant requests propagate through the multiple layers of the execution environment down to the physical resource layer. The intended abstraction of the application from the resource controlling layers does not allow to solely solving this problem in the application. In this paper, we propose an approach which applies resource demand estimation techniques in combination with a request based admission control. The resource demand estimation is used to determine resource consumption information for individual requests. The admission control mechanism uses this knowledge to delay requests originating from tenants that exceed their allocated resource share. The proposed method is validated by a widely accepted benchmark showing its applicability in a setup motivated by today\'s platform environments.}},\n  author = {Rouven Krebs and Simon Spinner and Nadia Ahmed and Samuel Kounev},\n  booktitle = {Proceedings of the 14th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2014)},\n  day = {26},\n  location = {Chicago, IL, USA},\n  month = {May},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/707.pdf},\n  publisher = {IEEE/ACM},\n  title = {{Resource Usage Control In Multi-Tenant Applications}},\n  note = {Acceptance Rate: 19\\% (54/283)},\n  year = {2014},\n  doi = {10.1109/CCGrid.2014.80},\n  pages = {122-131}\n}\n
\n\n','{Multi-tenancy is an approach to share one application instance among multiple customers by providing each of them a dedicated view. This approach is commonly used by SaaS providers to reduce the costs for service provisioning. Tenants also expect to be isolated in terms of the performance they observe and the providers inability to offer performance guarantees is a major obstacle for potential cloud customers. To guarantee an isolated performance it is essential to control the resources used by a tenant. This is a challenge, because the layers of the execution environment, responsible for controlling resource usage (e.g., operating system), normally do not have knowledge about entities defined at the application level and thus they cannot distinguish between different tenants. Furthermore, it is hard to predict how tenant requests propagate through the multiple layers of the execution environment down to the physical resource layer. The intended abstraction of the application from the resource controlling layers does not allow to solely solving this problem in the application. In this paper, we propose an approach which applies resource demand estimation techniques in combination with a request based admission control. The resource demand estimation is used to determine resource consumption information for individual requests. The admission control mechanism uses this knowledge to delay requests originating from tenants that exceed their allocated resource share. The proposed method is validated by a widely accepted benchmark showing its applicability in a setup motivated by today\'s platform environments.}','{Resource Usage Control In Multi-Tenant Applications}',0,5,2014,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 10:27:45',0),(708,'paper','KrLo2014_Closer_IsolationTypes','inproceedings','@inproceedings{KrLo2014_Closer_IsolationTypes,\n abstract = {{Multi-tenancy is an approach to share one application instance among multiple customers by providing each of them a dedicated view. This approach is commonly used by SaaS providers to reduce the costs for service provisioning. Tenants also expect to be isolated in terms of the performance they observe and the providers inability to offer performance guarantees is a major obstacle for potential cloud customers. To guarantee an isolated performance it is essential to control the resources used by a tenant. This is a challenge, because the layers of the execution environment, responsible for controlling resource usage (e.g., operating system), normally do not have knowledge about entities defined at the application level and thus they cannot distinguish between different tenants. Furthermore, it is hard to predict how tenant requests propagate through the multiple layers of the execution environment down to the physical resource layer. The intended abstraction of the application from the resource controlling layers does not allow to solely solving this problem in the application. In this paper, we propose an approach which applies resource demand estimation techniques in combination with a request based admission control. The resource demand estimation is used to determine resource consumption information for individual requests. The admission control mechanism uses this knowledge to delay requests originating from tenants that exceed their allocated resource share. The proposed method is validated by a widely accepted benchmark showing its applicability in a setup motivated by todayâ??s platform environments.}},\n author = {Rouven Krebs and Manuel Loesch},\n booktitle = {Proceedings of 4th International Conference On Cloud Computing And Services Science (CLOSER 2014)},\n day = {3},\n location = {Barcelona, Spain},\n month = {April},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/708.pdf},\n publisher = {SciTePress},\n title = {{Comparison of Request Admission Based Performance Isolation Approaches in Multi-Tenant SaaS Applications (Short Paper)}},\n year = {2014},\n}\n\n','\n\nRouven Krebs and Manuel Loesch.\nComparison of Request Admission Based Performance Isolation\nApproaches in Multi-Tenant SaaS Applications (Short Paper).\nIn Proceedings of 4th International Conference On Cloud\nComputing And Services Science (CLOSER 2014), Barcelona, Spain, April 3,\n2014. SciTePress.\nApril 2014.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{KrLo2014_Closer_IsolationTypes,\nabstract = {{Multi-tenancy is an approach to share one application instance among multiple customers by providing each of them a dedicated view. This approach is commonly used by SaaS providers to reduce the costs for service provisioning. Tenants also expect to be isolated in terms of the performance they observe and the providers inability to offer performance guarantees is a major obstacle for potential cloud customers. To guarantee an isolated performance it is essential to control the resources used by a tenant. This is a challenge, because the layers of the execution environment, responsible for controlling resource usage (e.g., operating system), normally do not have knowledge about entities defined at the application level and thus they cannot distinguish between different tenants. Furthermore, it is hard to predict how tenant requests propagate through the multiple layers of the execution environment down to the physical resource layer. The intended abstraction of the application from the resource controlling layers does not allow to solely solving this problem in the application. In this paper, we propose an approach which applies resource demand estimation techniques in combination with a request based admission control. The resource demand estimation is used to determine resource consumption information for individual requests. The admission control mechanism uses this knowledge to delay requests originating from tenants that exceed their allocated resource share. The proposed method is validated by a widely accepted benchmark showing its applicability in a setup motivated by todayâ??s platform environments.}},\nauthor = {Rouven Krebs and Manuel Loesch},\nbooktitle = {Proceedings of 4th International Conference On Cloud Computing And Services Science (CLOSER 2014)},\nday = {3},\nlocation = {Barcelona, Spain},\nmonth = {April},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/708.pdf},\npublisher = {SciTePress},\ntitle = {{Comparison of Request Admission Based Performance Isolation Approaches in Multi-Tenant SaaS Applications (Short Paper)}},\nyear = {2014}\n}\n
\n
\nMulti-tenancy is an approach to share one application instance among multiple customers by providing each of them a dedicated view. This approach is commonly used by SaaS providers to reduce the costs for service provisioning. Tenants also expect to be isolated in terms of the performance they observe and the providers inability to offer performance guarantees is a major obstacle for potential cloud customers. To guarantee an isolated performance it is essential to control the resources used by a tenant. This is a challenge, because the layers of the execution environment, responsible for controlling resource usage (e.g., operating system), normally do not have knowledge about entities defined at the application level and thus they cannot distinguish between different tenants. Furthermore, it is hard to predict how tenant requests propagate through the multiple layers of the execution environment down to the physical resource layer. The intended abstraction of the application from the resource controlling layers does not allow to solely solving this problem in the application. In this paper, we propose an approach which applies resource demand estimation techniques in combination with a request based admission control. The resource demand estimation is used to determine resource consumption information for individual requests. The admission control mechanism uses this knowledge to delay requests originating from tenants that exceed their allocated resource share. The proposed method is validated by a widely accepted benchmark showing its applicability in a setup motivated by todayâ??s platform environments.\n
\n','
\n@inproceedings{KrLo2014_Closer_IsolationTypes,\n  abstract = {{Multi-tenancy is an approach to share one application instance among multiple customers by providing each of them a dedicated view. This approach is commonly used by SaaS providers to reduce the costs for service provisioning. Tenants also expect to be isolated in terms of the performance they observe and the providers inability to offer performance guarantees is a major obstacle for potential cloud customers. To guarantee an isolated performance it is essential to control the resources used by a tenant. This is a challenge, because the layers of the execution environment, responsible for controlling resource usage (e.g., operating system), normally do not have knowledge about entities defined at the application level and thus they cannot distinguish between different tenants. Furthermore, it is hard to predict how tenant requests propagate through the multiple layers of the execution environment down to the physical resource layer. The intended abstraction of the application from the resource controlling layers does not allow to solely solving this problem in the application. In this paper, we propose an approach which applies resource demand estimation techniques in combination with a request based admission control. The resource demand estimation is used to determine resource consumption information for individual requests. The admission control mechanism uses this knowledge to delay requests originating from tenants that exceed their allocated resource share. The proposed method is validated by a widely accepted benchmark showing its applicability in a setup motivated by todayâ??s platform environments.}},\n  author = {Rouven Krebs and Manuel Loesch},\n  booktitle = {Proceedings of 4th International Conference On Cloud Computing And Services Science (CLOSER 2014)},\n  day = {3},\n  location = {Barcelona, Spain},\n  month = {April},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/708.pdf},\n  publisher = {SciTePress},\n  title = {{Comparison of Request Admission Based Performance Isolation Approaches in Multi-Tenant SaaS Applications (Short Paper)}},\n  year = {2014}\n}\n
\n\n','{Multi-tenancy is an approach to share one application instance among multiple customers by providing each of them a dedicated view. This approach is commonly used by SaaS providers to reduce the costs for service provisioning. Tenants also expect to be isolated in terms of the performance they observe and the providers inability to offer performance guarantees is a major obstacle for potential cloud customers. To guarantee an isolated performance it is essential to control the resources used by a tenant. This is a challenge, because the layers of the execution environment, responsible for controlling resource usage (e.g., operating system), normally do not have knowledge about entities defined at the application level and thus they cannot distinguish between different tenants. Furthermore, it is hard to predict how tenant requests propagate through the multiple layers of the execution environment down to the physical resource layer. The intended abstraction of the application from the resource controlling layers does not allow to solely solving this problem in the application. In this paper, we propose an approach which applies resource demand estimation techniques in combination with a request based admission control. The resource demand estimation is used to determine resource consumption information for individual requests. The admission control mechanism uses this knowledge to delay requests originating from tenants that exceed their allocated resource share. The proposed method is validated by a widely accepted benchmark showing its applicability in a setup motivated by todayâ??s platform environments.}','{Comparison of Request Admission Based Performance Isolation Approaches in Multi-Tenant SaaS Applications (Short Paper)}',0,4,2014,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(709,'paper','SPEC-RG-NEWSLETTER-3','misc','@misc{SPEC-RG-NEWSLETTER-3,\n author = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\n month = {March},\n note = {Published by Standard Performance Evaluation Corporation (SPEC)},\n title = {{SPEC Research Group Newsletter, vol. 1 no. 3}},\n url = {http://research.spec.org/en/newsletter.html},\n year = {2014},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/709.pdf},\n}\n\n','\n\nSamuel Kounev, Kai Sachs, and Piotr Rygielski.\nSPEC Research Group Newsletter, vol. 1 no. 3, March 2014.\nPublished by Standard Performance Evaluation Corporation (SPEC).\n[ bib | .html | .pdf  ] 
\n@misc{SPEC-RG-NEWSLETTER-3,\nauthor = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\nmonth = {March},\nnote = {Published by Standard Performance Evaluation Corporation (SPEC)},\ntitle = {{SPEC Research Group Newsletter, vol. 1 no. 3}},\nurl = {http://research.spec.org/en/newsletter.html},\nyear = {2014},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/709.pdf}\n}\n
\n
\n','
\n@misc{SPEC-RG-NEWSLETTER-3,\n  author = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\n  month = {March},\n  note = {Published by Standard Performance Evaluation Corporation (SPEC)},\n  title = {{SPEC Research Group Newsletter, vol. 1 no. 3}},\n  url = {http://research.spec.org/en/newsletter.html},\n  year = {2014},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/709.pdf}\n}\n
\n\n',NULL,'{SPEC Research Group Newsletter, vol. 1 no. 3}',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:01',0),(710,'paper','Osman2013','incollection','@incollection{Osman2013,\n title = {Performance Modelling of Concurrency Control Schemes for Relational Databases},\n year = {2013},\n volume = {7984},\n pages = {337-351},\n pdf = {http://dx.doi.org/10.1007/978-3-642-39408-9_24},\n editor = {Dudin, Alexander and Turck, Koen},\n publisher = {Springer Berlin Heidelberg},\n series = {Lecture Notes in Computer Science},\n booktitle = {Analytical and Stochastic Modeling Techniques and Applications},\n isbn = {978-3-642-39407-2},\n doi = {10.1007/978-3-642-39408-9_24},\n author = {Osman, Rasha and Coulden, David and Knottenbelt, WilliamJ.},\n}\n\n','\n\nRasha Osman, David Coulden, and WilliamJ. Knottenbelt.\nPerformance modelling of concurrency control schemes for relational\ndatabases.\nIn Analytical and Stochastic Modeling Techniques and\nApplications, Alexander Dudin and Koen Turck, editors, volume 7984 of \nLecture Notes in Computer Science, pages 337-351. Springer Berlin\nHeidelberg, 2013.\n[ bib | DOI | http  ] 
\n@incollection{Osman2013,\ntitle = {Performance Modelling of Concurrency Control Schemes for Relational Databases},\nyear = {2013},\nvolume = {7984},\npages = {337-351},\npdf = {http://dx.doi.org/10.1007/978-3-642-39408-9_24},\neditor = {Dudin, Alexander and Turck, Koen},\npublisher = {Springer Berlin Heidelberg},\nseries = {Lecture Notes in Computer Science},\nbooktitle = {Analytical and Stochastic Modeling Techniques and Applications},\nisbn = {978-3-642-39407-2},\ndoi = {10.1007/978-3-642-39408-9_24},\nauthor = {Osman, Rasha and Coulden, David and Knottenbelt, WilliamJ.}\n}\n
\n
\n','
\n@incollection{Osman2013,\n  title = {Performance Modelling of Concurrency Control Schemes for Relational Databases},\n  year = {2013},\n  volume = {7984},\n  pages = {337-351},\n  pdf = {http://dx.doi.org/10.1007/978-3-642-39408-9_24},\n  editor = {Dudin, Alexander and Turck, Koen},\n  publisher = {Springer Berlin Heidelberg},\n  series = {Lecture Notes in Computer Science},\n  booktitle = {Analytical and Stochastic Modeling Techniques and Applications},\n  isbn = {978-3-642-39407-2},\n  doi = {10.1007/978-3-642-39408-9_24},\n  author = {Osman, Rasha and Coulden, David and Knottenbelt, WilliamJ.}\n}\n
\n\n',NULL,'Performance Modelling of Concurrency Control Schemes for Relational Databases',0,0,2013,0,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(711,'paper','Coulden-2013-PMD-2479871.2479919','inproceedings','@inproceedings{Coulden-2013-PMD-2479871.2479919,\n title = {{Performance Modelling of Database Contention Using Queueing Petri Nets}},\n year = {2013},\n pages = {331--334},\n keywords = {database locking, performance modelling, queueing petri nets},\n pdf = {http://doi.acm.org/10.1145/2479871.2479919},\n publisher = {ACM},\n address = {New York, NY, USA},\n series = {ICPE 2013},\n booktitle = {Proceedings of the ACM/SPEC International conference on performance engineering},\n isbn = {978-1-4503-1636-1},\n doi = {10.1145/2479871.2479919},\n author = {Coulden, David and Osman, Rasha and Knottenbelt, William J.},\n}\n\n','\n\nDavid Coulden, Rasha Osman, and William J. Knottenbelt.\nPerformance Modelling of Database Contention Using Queueing Petri\nNets.\nIn Proceedings of the ACM/SPEC International conference on\nperformance engineering, 2013, ICPE 2013, pages 331-334. ACM, New York, NY,\nUSA.\n2013.\n[ bib | DOI | http  ] 
\n@inproceedings{Coulden-2013-PMD-2479871.2479919,\ntitle = {{Performance Modelling of Database Contention Using Queueing Petri Nets}},\nyear = {2013},\npages = {331--334},\nkeywords = {database locking, performance modelling, queueing petri nets},\npdf = {http://doi.acm.org/10.1145/2479871.2479919},\npublisher = {ACM},\naddress = {New York, NY, USA},\nseries = {ICPE 2013},\nbooktitle = {Proceedings of the ACM/SPEC International conference on performance engineering},\nisbn = {978-1-4503-1636-1},\ndoi = {10.1145/2479871.2479919},\nauthor = {Coulden, David and Osman, Rasha and Knottenbelt, William J.}\n}\n
\n
\n','
\n@inproceedings{Coulden-2013-PMD-2479871.2479919,\n  title = {{Performance Modelling of Database Contention Using Queueing Petri Nets}},\n  year = {2013},\n  pages = {331--334},\n  keywords = {database locking, performance modelling, queueing petri nets},\n  pdf = {http://doi.acm.org/10.1145/2479871.2479919},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  series = {ICPE 2013},\n  booktitle = {Proceedings of the ACM/SPEC International conference on performance engineering},\n  isbn = {978-1-4503-1636-1},\n  doi = {10.1145/2479871.2479919},\n  author = {Coulden, David and Osman, Rasha and Knottenbelt, William J.}\n}\n
\n\n',NULL,'{Performance Modelling of Database Contention Using Queueing Petri Nets}',0,0,2013,0,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(712,'paper','2012-Babka-PhD','phdthesis','@phdthesis{2012-Babka-PhD,\n title = {Improving Accuracy of Software Performance Models on Multicore Platforms with Shared Caches},\n year = {2012},\n month = {9},\n school = {Charles University in Prague, Czech Republic},\n author = {Babka, Vlastimil},\n}\n\n','\n\nVlastimil Babka.\nImproving Accuracy of Software Performance Models on Multicore\nPlatforms with Shared Caches.\nPhD thesis, Charles University in Prague, Czech Republic, 9 2012.\n[ bib  ] 
\n@phdthesis{2012-Babka-PhD,\ntitle = {Improving Accuracy of Software Performance Models on Multicore Platforms with Shared Caches},\nyear = {2012},\nmonth = {9},\nschool = {Charles University in Prague, Czech Republic},\nauthor = {Babka, Vlastimil}\n}\n
\n
\n','
\n@phdthesis{2012-Babka-PhD,\n  title = {Improving Accuracy of Software Performance Models on Multicore Platforms with Shared Caches},\n  year = {2012},\n  month = {9},\n  school = {Charles University in Prague, Czech Republic},\n  author = {Babka, Vlastimil}\n}\n
\n\n',NULL,'Improving Accuracy of Software Performance Models on Multicore Platforms with Shared Caches',0,9,2012,9,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(714,'paper','2011_QImpress_Deliverable','techreport','@techreport{2011_QImpress_Deliverable,\n title = {Resource Impact Analysis},\n year = {2011},\n month = {1},\n pdf = {http://www.q-impress.eu/wordpress/wp-content/uploads/2010/11/D3.4-Resource_impact_analysis.pdf},\n institution = {Q-ImPrESS Project Deliverable D3.4},\n author = {Babka, Vlastimil and Bulej, Lubomir and Libic, Peter and Marek, Lukas and Martinec, Tomas and Podzimek, Andrej and Tuma, Petr},\n}\n\n','\n\nVlastimil Babka, Lubomir Bulej, Peter Libic, Lukas Marek, Tomas Martinec,\nAndrej Podzimek, and Petr Tuma.\nResource impact analysis.\nTechnical report, Q-ImPrESS Project Deliverable D3.4, 1 2011.\n[ bib | .pdf  ] 
\n@techreport{2011_QImpress_Deliverable,\ntitle = {Resource Impact Analysis},\nyear = {2011},\nmonth = {1},\npdf = {http://www.q-impress.eu/wordpress/wp-content/uploads/2010/11/D3.4-Resource_impact_analysis.pdf},\ninstitution = {Q-ImPrESS Project Deliverable D3.4},\nauthor = {Babka, Vlastimil and Bulej, Lubomir and Libic, Peter and Marek, Lukas and Martinec, Tomas and Podzimek, Andrej and Tuma, Petr}\n}\n
\n
\n','
\n@techreport{2011_QImpress_Deliverable,\n  title = {Resource Impact Analysis},\n  year = {2011},\n  month = {1},\n  pdf = {http://www.q-impress.eu/wordpress/wp-content/uploads/2010/11/D3.4-Resource_impact_analysis.pdf},\n  institution = {Q-ImPrESS Project Deliverable D3.4},\n  author = {Babka, Vlastimil and Bulej, Lubomir and Libic, Peter and Marek, Lukas and Martinec, Tomas and Podzimek, Andrej and Tuma, Petr}\n}\n
\n\n',NULL,'Resource Impact Analysis',0,1,2011,1,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(715,'paper','Babka-2011-LAI-2186355.2186377','inproceedings','@inproceedings{Babka-2011-LAI-2186355.2186377,\n title = {Can linear approximation improve performance prediction ?},\n year = {2011},\n pages = {250--264},\n abstract = {Software performance evaluation relies on the ability of simple models to predict the performance of complex systems. Often, however, the models are not capturing potentially relevant effects in system behavior, such as sharing of memory caches or sharing of cores by hardware threads. The goal of this paper is to investigate whether and to what degree a simple linear adjustment of service demands in software performance models captures these effects and thus improves accuracy. Outlined experiments explore the limits of the approach on two hardware platforms that include shared caches and hardware threads, with results indicating that the approach can improve throughput prediction accuracy significantly, but can also lead to loss of accuracy when the performance models are otherwise defective.},\n publisher = {Springer-Verlag},\n address = {Berlin, Heidelberg},\n booktitle = {Proceedings of the 8th European conference on Computer Performance Engineering},\n isbn = {978-3-642-24748-4},\n doi = {10.1007/978-3-642-24749-1_19},\n author = {Babka, Vlastimil and Tuma, Petr},\n}\n\n','\n\nVlastimil Babka and Petr Tuma.\nCan linear approximation improve performance prediction ?\nIn Proceedings of the 8th European conference on Computer\nPerformance Engineering, 2011, pages 250-264. Springer-Verlag, Berlin,\nHeidelberg.\n2011.\n[ bib | DOI | Abstract  ] 
\n@inproceedings{Babka-2011-LAI-2186355.2186377,\ntitle = {Can linear approximation improve performance prediction ?},\nyear = {2011},\npages = {250--264},\nabstract = {Software performance evaluation relies on the ability of simple models to predict the performance of complex systems. Often, however, the models are not capturing potentially relevant effects in system behavior, such as sharing of memory caches or sharing of cores by hardware threads. The goal of this paper is to investigate whether and to what degree a simple linear adjustment of service demands in software performance models captures these effects and thus improves accuracy. Outlined experiments explore the limits of the approach on two hardware platforms that include shared caches and hardware threads, with results indicating that the approach can improve throughput prediction accuracy significantly, but can also lead to loss of accuracy when the performance models are otherwise defective.},\npublisher = {Springer-Verlag},\naddress = {Berlin, Heidelberg},\nbooktitle = {Proceedings of the 8th European conference on Computer Performance Engineering},\nisbn = {978-3-642-24748-4},\ndoi = {10.1007/978-3-642-24749-1_19},\nauthor = {Babka, Vlastimil and Tuma, Petr}\n}\n
\n
\nSoftware performance evaluation relies on the ability of simple models to predict the performance of complex systems. Often, however, the models are not capturing potentially relevant effects in system behavior, such as sharing of memory caches or sharing of cores by hardware threads. The goal of this paper is to investigate whether and to what degree a simple linear adjustment of service demands in software performance models captures these effects and thus improves accuracy. Outlined experiments explore the limits of the approach on two hardware platforms that include shared caches and hardware threads, with results indicating that the approach can improve throughput prediction accuracy significantly, but can also lead to loss of accuracy when the performance models are otherwise defective.\n
\n','
\n@inproceedings{Babka-2011-LAI-2186355.2186377,\n  title = {Can linear approximation improve performance prediction ?},\n  year = {2011},\n  pages = {250--264},\n  abstract = {Software performance evaluation relies on the ability of simple models to predict the performance of complex systems. Often, however, the models are not capturing potentially relevant effects in system behavior, such as sharing of memory caches or sharing of cores by hardware threads. The goal of this paper is to investigate whether and to what degree a simple linear adjustment of service demands in software performance models captures these effects and thus improves accuracy. Outlined experiments explore the limits of the approach on two hardware platforms that include shared caches and hardware threads, with results indicating that the approach can improve throughput prediction accuracy significantly, but can also lead to loss of accuracy when the performance models are otherwise defective.},\n  publisher = {Springer-Verlag},\n  address = {Berlin, Heidelberg},\n  booktitle = {Proceedings of the 8th European conference on Computer Performance Engineering},\n  isbn = {978-3-642-24748-4},\n  doi = {10.1007/978-3-642-24749-1_19},\n  author = {Babka, Vlastimil and Tuma, Petr}\n}\n
\n\n','Software performance evaluation relies on the ability of simple models to predict the performance of complex systems. Often, however, the models are not capturing potentially relevant effects in system behavior, such as sharing of memory caches or sharing of cores by hardware threads. The goal of this paper is to investigate whether and to what degree a simple linear adjustment of service demands in software performance models captures these effects and thus improves accuracy. Outlined experiments explore the limits of the approach on two hardware platforms that include shared caches and hardware threads, with results indicating that the approach can improve throughput prediction accuracy significantly, but can also lead to loss of accuracy when the performance models are otherwise defective.','Can linear approximation improve performance prediction ?',0,0,2011,0,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(716,'paper','Babka-2010-VMP-2163764.2163769','inproceedings','@inproceedings{Babka-2010-VMP-2163764.2163769,\n title = {Validating model-driven performance predictions on random software systems},\n year = {2010},\n pages = {3--19},\n publisher = {Springer-Verlag},\n address = {Berlin, Heidelberg},\n booktitle = {Proceedings of the 6th international conference on Quality of Software Architectures: research into Practice - Reality and Gaps},\n isbn = {978-3-642-13820-1},\n doi = {10.1007/978-3-642-13821-8_3},\n author = {Babka, Vlastimil and Tuma, Petr and Bulej, Lubomir},\n}\n\n','\n\nVlastimil Babka, Petr Tuma, and Lubomir Bulej.\nValidating model-driven performance predictions on random software\nsystems.\nIn Proceedings of the 6th international conference on Quality of\nSoftware Architectures: research into Practice - Reality and Gaps, 2010,\npages 3-19. Springer-Verlag, Berlin, Heidelberg.\n2010.\n[ bib | DOI  ] 
\n@inproceedings{Babka-2010-VMP-2163764.2163769,\ntitle = {Validating model-driven performance predictions on random software systems},\nyear = {2010},\npages = {3--19},\npublisher = {Springer-Verlag},\naddress = {Berlin, Heidelberg},\nbooktitle = {Proceedings of the 6th international conference on Quality of Software Architectures: research into Practice - Reality and Gaps},\nisbn = {978-3-642-13820-1},\ndoi = {10.1007/978-3-642-13821-8_3},\nauthor = {Babka, Vlastimil and Tuma, Petr and Bulej, Lubomir}\n}\n
\n
\n','
\n@inproceedings{Babka-2010-VMP-2163764.2163769,\n  title = {Validating model-driven performance predictions on random software systems},\n  year = {2010},\n  pages = {3--19},\n  publisher = {Springer-Verlag},\n  address = {Berlin, Heidelberg},\n  booktitle = {Proceedings of the 6th international conference on Quality of Software Architectures: research into Practice - Reality and Gaps},\n  isbn = {978-3-642-13820-1},\n  doi = {10.1007/978-3-642-13821-8_3},\n  author = {Babka, Vlastimil and Tuma, Petr and Bulej, Lubomir}\n}\n
\n\n',NULL,'Validating model-driven performance predictions on random software systems',0,0,2010,0,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(717,'paper','KoSa2009-DEBSPerformance','article','@article{KoSa2009-DEBSPerformance,\n title = {{Benchmarking and Performance Modeling of Event-Based Systems}},\n journal = {it - Information Technology},\n year = {2009},\n month = {October},\n volume = {51},\n number = {5},\n pages = {262--269},\n abstract = {Event-based systems are used increasingly often to build loosely-coupled distributed applications. With their growing popularity and gradual adoption in mission critical areas, the need for novel techniques for benchmarking and performance modeling of event-based systems is increasing. In this article, we provide an overview of the state-of-the-art in this area considering both centralized systems based on message-oriented middleware as well as large-scale distributed publish/subscribe systems. We consider a number of specific techniques for benchmarking and performance modeling, discuss their advantages and disadvantages, and provide references for further information. The techniques we review help to ensure that systems are designed and sized to meet their quality-of-service requirements.},\n pdf = {http://www.dvs.tu-darmstadt.de/publications/pdf/itit.2009.0550.pdf},\n publisher = {Oldenbourg Wissenschaftsverlag},\n address = {Munich, Germany},\n doi = {10.1524/itit.2009.0550},\n author = {Kounev, Samuel and Sachs, Kai},\n}\n\n','\n\nSamuel Kounev and Kai Sachs.\nBenchmarking and Performance Modeling of Event-Based Systems.\nit - Information Technology, 51(5):262-269, October 2009,\nOldenbourg Wissenschaftsverlag, Munich, Germany.\n[ bib | DOI | .pdf | Abstract  ] 
\n@article{KoSa2009-DEBSPerformance,\ntitle = {{Benchmarking and Performance Modeling of Event-Based Systems}},\njournal = {it - Information Technology},\nyear = {2009},\nmonth = {October},\nvolume = {51},\nnumber = {5},\npages = {262--269},\nabstract = {Event-based systems are used increasingly often to build loosely-coupled distributed applications. With their growing popularity and gradual adoption in mission critical areas, the need for novel techniques for benchmarking and performance modeling of event-based systems is increasing. In this article, we provide an overview of the state-of-the-art in this area considering both centralized systems based on message-oriented middleware as well as large-scale distributed publish/subscribe systems. We consider a number of specific techniques for benchmarking and performance modeling, discuss their advantages and disadvantages, and provide references for further information. The techniques we review help to ensure that systems are designed and sized to meet their quality-of-service requirements.},\npdf = {http://www.dvs.tu-darmstadt.de/publications/pdf/itit.2009.0550.pdf},\npublisher = {Oldenbourg Wissenschaftsverlag},\naddress = {Munich, Germany},\ndoi = {10.1524/itit.2009.0550},\nauthor = {Kounev, Samuel and Sachs, Kai}\n}\n
\n
\nEvent-based systems are used increasingly often to build loosely-coupled distributed applications. With their growing popularity and gradual adoption in mission critical areas, the need for novel techniques for benchmarking and performance modeling of event-based systems is increasing. In this article, we provide an overview of the state-of-the-art in this area considering both centralized systems based on message-oriented middleware as well as large-scale distributed publish/subscribe systems. We consider a number of specific techniques for benchmarking and performance modeling, discuss their advantages and disadvantages, and provide references for further information. The techniques we review help to ensure that systems are designed and sized to meet their quality-of-service requirements.\n
\n','
\n@article{KoSa2009-DEBSPerformance,\n  title = {{Benchmarking and Performance Modeling of Event-Based Systems}},\n  journal = {it - Information Technology},\n  year = {2009},\n  month = {October},\n  volume = {51},\n  number = {5},\n  pages = {262--269},\n  abstract = {Event-based systems are used increasingly often to build loosely-coupled distributed applications. With their growing popularity and gradual adoption in mission critical areas, the need for novel techniques for benchmarking and performance modeling of event-based systems is increasing. In this article, we provide an overview of the state-of-the-art in this area considering both centralized systems based on message-oriented middleware as well as large-scale distributed publish/subscribe systems. We consider a number of specific techniques for benchmarking and performance modeling, discuss their advantages and disadvantages, and provide references for further information. The techniques we review help to ensure that systems are designed and sized to meet their quality-of-service requirements.},\n  pdf = {http://www.dvs.tu-darmstadt.de/publications/pdf/itit.2009.0550.pdf},\n  publisher = {Oldenbourg Wissenschaftsverlag},\n  address = {Munich, Germany},\n  doi = {10.1524/itit.2009.0550},\n  author = {Kounev, Samuel and Sachs, Kai}\n}\n
\n\n','Event-based systems are used increasingly often to build loosely-coupled distributed applications. With their growing popularity and gradual adoption in mission critical areas, the need for novel techniques for benchmarking and performance modeling of event-based systems is increasing. In this article, we provide an overview of the state-of-the-art in this area considering both centralized systems based on message-oriented middleware as well as large-scale distributed publish/subscribe systems. We consider a number of specific techniques for benchmarking and performance modeling, discuss their advantages and disadvantages, and provide references for further information. The techniques we review help to ensure that systems are designed and sized to meet their quality-of-service requirements.','{Benchmarking and Performance Modeling of Event-Based Systems}',0,10,2009,10,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(718,'paper','SeLa2008','inproceedings','@inproceedings{SeLa2008,\n title = {An Operational Activity Analysis Using Analytic Hierarchy Process and Queuing Petri Net},\n year = {2008},\n month = {6},\n pages = {107--121},\n editor = {Joseph Barjis and Murali Mohan Narasipuram and Peter Rittgen and Ela Hunt and Xavier Franch and Remi Coletta},\n booktitle = {Proceedings of the 4th International Workshop on Enterprise & Organizational Modeling and Simulation held in conjunction with the CAiSE\'08 Conference, Montpellier, France, June 16-17},\n author = {Ait Seddik, Arezki and Lallement, Patrick},\n}\n\n','\n\nArezki Ait Seddik and Patrick Lallement.\nAn operational activity analysis using analytic hierarchy process and\nqueuing petri net.\nIn Proceedings of the 4th International Workshop on Enterprise &\nOrganizational Modeling and Simulation held in conjunction with the CAiSE\'08\nConference, Montpellier, France, June 16-17, Joseph Barjis, Murali Mohan\nNarasipuram, Peter Rittgen, Ela Hunt, Xavier Franch, and Remi Coletta,\neditors, 6 2008, pages 107-121.\n[ bib  ] 
\n@inproceedings{SeLa2008,\ntitle = {An Operational Activity Analysis Using Analytic Hierarchy Process and Queuing Petri Net},\nyear = {2008},\nmonth = {6},\npages = {107--121},\neditor = {Joseph Barjis and Murali Mohan Narasipuram and Peter Rittgen and Ela Hunt and Xavier Franch and Remi Coletta},\nbooktitle = {Proceedings of the 4th International Workshop on Enterprise & Organizational Modeling and Simulation held in conjunction with the CAiSE\'08 Conference, Montpellier, France, June 16-17},\nauthor = {Ait Seddik, Arezki and Lallement, Patrick}\n}\n
\n
\n','
\n@inproceedings{SeLa2008,\n  title = {An Operational Activity Analysis Using Analytic Hierarchy Process and Queuing Petri Net},\n  year = {2008},\n  month = {6},\n  pages = {107--121},\n  editor = {Joseph Barjis and Murali Mohan Narasipuram and Peter Rittgen and Ela Hunt and Xavier Franch and Remi Coletta},\n  booktitle = {Proceedings of the 4th International Workshop on Enterprise & Organizational Modeling and Simulation held in conjunction with the CAiSE\'08 Conference, Montpellier, France, June 16-17},\n  author = {Ait Seddik, Arezki and Lallement, Patrick}\n}\n
\n\n',NULL,'An Operational Activity Analysis Using Analytic Hierarchy Process and Queuing Petri Net',0,6,2008,6,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(720,'paper','He2007-TUD-LQNvsQPN','mastersthesis','@mastersthesis{He2007-TUD-LQNvsQPN,\n title = {Performance Modelling of Java EE Applications using LQNs and QPNs},\n year = {2007},\n month = {9},\n school = {Technische Universit{\"a}t Darmstadt, Darmstadt, Germany},\n author = {Heimburger, Frank},\n}\n\n','\n\nFrank Heimburger.\nPerformance modelling of java ee applications using lqns and qpns.\nMaster\'s thesis, Technische Universit\"at Darmstadt, Darmstadt,\nGermany, 9 2007.\n[ bib  ] 
\n@mastersthesis{He2007-TUD-LQNvsQPN,\ntitle = {Performance Modelling of Java EE Applications using LQNs and QPNs},\nyear = {2007},\nmonth = {9},\nschool = {Technische Universit{\"a}t Darmstadt, Darmstadt, Germany},\nauthor = {Heimburger, Frank}\n}\n
\n
\n','
\n@mastersthesis{He2007-TUD-LQNvsQPN,\n  title = {Performance Modelling of Java EE Applications using LQNs and QPNs},\n  year = {2007},\n  month = {9},\n  school = {Technische Universit{\"a}t Darmstadt, Darmstadt, Germany},\n  author = {Heimburger, Frank}\n}\n
\n\n',NULL,'Performance Modelling of Java EE Applications using LQNs and QPNs',0,9,2007,9,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(721,'paper','Du2006-TUD-QPE','mastersthesis','@mastersthesis{Du2006-TUD-QPE,\n title = {{QPE - A Graphical Editor for Modeling using Queueing Petri Nets}},\n year = {2006},\n month = {3},\n school = {{Technische Universit{\\\"a}t Darmstadt}},\n author = {Dutz, Christofer},\n}\n\n','\n\nChristofer Dutz.\nQPE - A Graphical Editor for Modeling using Queueing Petri Nets.\nMaster\'s thesis, Technische Universität Darmstadt, 3 2006.\n[ bib  ] 
\n@mastersthesis{Du2006-TUD-QPE,\ntitle = {{QPE - A Graphical Editor for Modeling using Queueing Petri Nets}},\nyear = {2006},\nmonth = {3},\nschool = {{Technische Universit{\\\"a}t Darmstadt}},\nauthor = {Dutz, Christofer}\n}\n
\n
\n','
\n@mastersthesis{Du2006-TUD-QPE,\n  title = {{QPE - A Graphical Editor for Modeling using Queueing Petri Nets}},\n  year = {2006},\n  month = {3},\n  school = {{Technische Universit{\\\"a}t Darmstadt}},\n  author = {Dutz, Christofer}\n}\n
\n\n',NULL,'{QPE - A Graphical Editor for Modeling using Queueing Petri Nets}',0,3,2006,3,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(722,'paper','BeSh2004','inproceedings','@inproceedings{BeSh2004,\n title = {Performance Prediction and Physical Design of J2EE based Web applications},\n year = {2004},\n month = {7},\n booktitle = {WSEAS CSCC 2004, Athens, Greece},\n author = {Bellur, Umesh and Shirabate, Akhilesh},\n}\n\n','\n\nUmesh Bellur and Akhilesh Shirabate.\nPerformance prediction and physical design of j2ee based web\napplications.\nIn WSEAS CSCC 2004, Athens, Greece, 7 2004.\n[ bib  ] 
\n@inproceedings{BeSh2004,\ntitle = {Performance Prediction and Physical Design of J2EE based Web applications},\nyear = {2004},\nmonth = {7},\nbooktitle = {WSEAS CSCC 2004, Athens, Greece},\nauthor = {Bellur, Umesh and Shirabate, Akhilesh}\n}\n
\n
\n','
\n@inproceedings{BeSh2004,\n  title = {Performance Prediction and Physical Design of J2EE based Web applications},\n  year = {2004},\n  month = {7},\n  booktitle = {WSEAS CSCC 2004, Athens, Greece},\n  author = {Bellur, Umesh and Shirabate, Akhilesh}\n}\n
\n\n',NULL,'Performance Prediction and Physical Design of J2EE based Web applications',0,7,2004,7,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(723,'paper','BaKr2002-SPNs_Intro_to_the_Theory','book','@book{BaKr2002-SPNs_Intro_to_the_Theory,\n title = {Stochastic Petri Nets - An Introduction to the Theory},\n year = {2002},\n publisher = {Vieweg Verlag},\n author = {Bause, Falko and Kritzinger, Pieter S.},\n}\n\n','\n\nFalko Bause and Pieter S. Kritzinger.\nStochastic Petri Nets - An Introduction to the Theory.\nVieweg Verlag, 2002.\n[ bib  ] 
\n@book{BaKr2002-SPNs_Intro_to_the_Theory,\ntitle = {Stochastic Petri Nets - An Introduction to the Theory},\nyear = {2002},\npublisher = {Vieweg Verlag},\nauthor = {Bause, Falko and Kritzinger, Pieter S.}\n}\n
\n
\n','
\n@book{BaKr2002-SPNs_Intro_to_the_Theory,\n  title = {Stochastic Petri Nets - An Introduction to the Theory},\n  year = {2002},\n  publisher = {Vieweg Verlag},\n  author = {Bause, Falko and Kritzinger, Pieter S.}\n}\n
\n\n',NULL,'Stochastic Petri Nets - An Introduction to the Theory',0,0,2002,0,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(724,'paper','933169','article','@article{933169,\n title = {Modeling, scheduling, and prediction in wafer fabrication systems using queueing Petri net and genetic algorithm},\n journal = {Proceedings of the 2001 IEEE International Conference on Robotics and Automation (ICRA 2001)},\n year = {2001},\n month = {7},\n volume = {4},\n pages = {3559-3564},\n isbn = {0-7803-6576-3},\n issn = {1050-4729},\n doi = {10.1109/ROBOT.2001.933169},\n author = {Wen, Hung-We and Fu, Li-Chen and Huang, Shih-Shinh},\n}\n\n','\n\nHung-We Wen, Li-Chen Fu, and Shih-Shinh Huang.\nModeling, scheduling, and prediction in wafer fabrication systems\nusing queueing petri net and genetic algorithm.\nProceedings of the 2001 IEEE International Conference on\nRobotics and Automation (ICRA 2001), 4:3559-3564, 7 2001.\n[ bib | DOI  ] 
\n@article{933169,\ntitle = {Modeling, scheduling, and prediction in wafer fabrication systems using queueing Petri net and genetic algorithm},\njournal = {Proceedings of the 2001 IEEE International Conference on Robotics and Automation (ICRA 2001)},\nyear = {2001},\nmonth = {7},\nvolume = {4},\npages = {3559-3564},\nisbn = {0-7803-6576-3},\nissn = {1050-4729},\ndoi = {10.1109/ROBOT.2001.933169},\nauthor = {Wen, Hung-We and Fu, Li-Chen and Huang, Shih-Shinh}\n}\n
\n
\n','
\n@article{933169,\n  title = {Modeling, scheduling, and prediction in wafer fabrication systems using queueing Petri net and genetic algorithm},\n  journal = {Proceedings of the 2001 IEEE International Conference on Robotics and Automation (ICRA 2001)},\n  year = {2001},\n  month = {7},\n  volume = {4},\n  pages = {3559-3564},\n  isbn = {0-7803-6576-3},\n  issn = {1050-4729},\n  doi = {10.1109/ROBOT.2001.933169},\n  author = {Wen, Hung-We and Fu, Li-Chen and Huang, Shih-Shinh}\n}\n
\n\n',NULL,'Modeling, scheduling, and prediction in wafer fabrication systems using queueing Petri net and genetic algorithm',0,7,2001,7,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(725,'paper','BaBu1998-QPNs_with_PF_Solution','article','@article{BaBu1998-QPNs_with_PF_Solution,\n title = {Queueing Petri Nets with Product Form Solution},\n journal = {Performance Evaluation},\n year = {1998},\n volume = {32},\n number = {4},\n pages = {265--299},\n author = {Bause, Falko and Buchholz, Peter},\n}\n\n','\n\nFalko Bause and Peter Buchholz.\nQueueing petri nets with product form solution.\nPerformance Evaluation, 32(4):265-299, 1998.\n[ bib  ] 
\n@article{BaBu1998-QPNs_with_PF_Solution,\ntitle = {Queueing Petri Nets with Product Form Solution},\njournal = {Performance Evaluation},\nyear = {1998},\nvolume = {32},\nnumber = {4},\npages = {265--299},\nauthor = {Bause, Falko and Buchholz, Peter}\n}\n
\n
\n','
\n@article{BaBu1998-QPNs_with_PF_Solution,\n  title = {Queueing Petri Nets with Product Form Solution},\n  journal = {Performance Evaluation},\n  year = {1998},\n  volume = {32},\n  number = {4},\n  pages = {265--299},\n  author = {Bause, Falko and Buchholz, Peter}\n}\n
\n\n',NULL,'Queueing Petri Nets with Product Form Solution',0,0,1998,0,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(726,'paper','BaBuKe1997-Integrating_Software_and_Hardware_Perf_Models','inproceedings','@inproceedings{BaBuKe1997-Integrating_Software_and_Hardware_Perf_Models,\n title = {Integrating Software and Hardware Performance Models Using Hierarchical Queueing Petri Nets},\n year = {1997},\n booktitle = {Proceedings of the 9.verb=~=ITGverb=~=/verb=~=GIverb=~=- Fachtagung Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen,verb=~=(MMB\'97), Freiberg, Germany, September 17-19},\n author = {Bause, Falko and Buchholz, Peter and Kemper, Peter},\n}\n\n','\n\nFalko Bause, Peter Buchholz, and Peter Kemper.\nIntegrating software and hardware performance models using\nhierarchical queueing petri nets.\nIn Proceedings of the 9.verb= =ITGverb= =/verb= =GIverb= =-\nFachtagung Messung, Modellierung und Bewertung von Rechen- und\nKommunikationssystemen,verb= =(MMB\'97), Freiberg, Germany, September 17-19,\n1997.\n[ bib  ] 
\n@inproceedings{BaBuKe1997-Integrating_Software_and_Hardware_Perf_Models,\ntitle = {Integrating Software and Hardware Performance Models Using Hierarchical Queueing Petri Nets},\nyear = {1997},\nbooktitle = {Proceedings of the 9.verb=~=ITGverb=~=/verb=~=GIverb=~=- Fachtagung Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen,verb=~=(MMB\'97), Freiberg, Germany, September 17-19},\nauthor = {Bause, Falko and Buchholz, Peter and Kemper, Peter}\n}\n
\n
\n','
\n@inproceedings{BaBuKe1997-Integrating_Software_and_Hardware_Perf_Models,\n  title = {Integrating Software and Hardware Performance Models Using Hierarchical Queueing Petri Nets},\n  year = {1997},\n  booktitle = {Proceedings of the 9.verb=~=ITGverb=~=/verb=~=GIverb=~=- Fachtagung Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen,verb=~=(MMB\'97), Freiberg, Germany, September 17-19},\n  author = {Bause, Falko and Buchholz, Peter and Kemper, Peter}\n}\n
\n\n',NULL,'Integrating Software and Hardware Performance Models Using Hierarchical Queueing Petri Nets',0,0,1997,0,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(727,'paper','BaBuKe1995-QPN_Tool_for_HQPN','inproceedings','@inproceedings{BaBuKe1995-QPN_Tool_for_HQPN,\n title = {QPN-Tool for the Specification and Analysis of Hierarchically Combined Queueing Petri Nets},\n year = {1995},\n volume = {977},\n pages = {224--238},\n editor = {Beilner, H. and Bause, F.},\n publisher = {Springer},\n address = {Heidelberg, Germany},\n series = {Lecture Notes in Computer Science},\n booktitle = {Quantitative Evaluation of Computing and Communication Systems},\n author = {Bause, Falko and Buchholz, Peter and Kemper, Peter},\n}\n\n','\n\nFalko Bause, Peter Buchholz, and Peter Kemper.\nQpn-tool for the specification and analysis of hierarchically\ncombined queueing petri nets.\nIn Quantitative Evaluation of Computing and Communication\nSystems, H. Beilner and F. Bause, editors, 1995, volume 977 of Lecture\nNotes in Computer Science, pages 224-238. Springer, Heidelberg, Germany.\n1995.\n[ bib  ] 
\n@inproceedings{BaBuKe1995-QPN_Tool_for_HQPN,\ntitle = {QPN-Tool for the Specification and Analysis of Hierarchically Combined Queueing Petri Nets},\nyear = {1995},\nvolume = {977},\npages = {224--238},\neditor = {Beilner, H. and Bause, F.},\npublisher = {Springer},\naddress = {Heidelberg, Germany},\nseries = {Lecture Notes in Computer Science},\nbooktitle = {Quantitative Evaluation of Computing and Communication Systems},\nauthor = {Bause, Falko and Buchholz, Peter and Kemper, Peter}\n}\n
\n
\n','
\n@inproceedings{BaBuKe1995-QPN_Tool_for_HQPN,\n  title = {QPN-Tool for the Specification and Analysis of Hierarchically Combined Queueing Petri Nets},\n  year = {1995},\n  volume = {977},\n  pages = {224--238},\n  editor = {Beilner, H. and Bause, F.},\n  publisher = {Springer},\n  address = {Heidelberg, Germany},\n  series = {Lecture Notes in Computer Science},\n  booktitle = {Quantitative Evaluation of Computing and Communication Systems},\n  author = {Bause, Falko and Buchholz, Peter and Kemper, Peter}\n}\n
\n\n',NULL,'QPN-Tool for the Specification and Analysis of Hierarchically Combined Queueing Petri Nets',0,0,1995,0,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(728,'paper','BaBuKe1994-HQPNs','inproceedings','@inproceedings{BaBuKe1994-HQPNs,\n title = {Hierarchically Combined Queueing Petri Nets},\n year = {1994},\n month = {6},\n number = {199},\n pages = {176--182},\n publisher = {Springer},\n address = {Heidelberg, Germany},\n series = {LNCI 199},\n booktitle = {Proceedings of the 11th International Conference on Analysis and Optimization of Systems, Discrete Event Systems, Sophie-Antipolis, France},\n author = {Bause, Falko and Buchholz, Peter and Kemper, Peter},\n}\n\n','\n\nFalko Bause, Peter Buchholz, and Peter Kemper.\nHierarchically combined queueing petri nets.\nIn Proceedings of the 11th International Conference on Analysis\nand Optimization of Systems, Discrete Event Systems, Sophie-Antipolis,\nFrance, 6 1994, number 199 in LNCI 199, pages 176-182. Springer,\nHeidelberg, Germany.\n6 1994.\n[ bib  ] 
\n@inproceedings{BaBuKe1994-HQPNs,\ntitle = {Hierarchically Combined Queueing Petri Nets},\nyear = {1994},\nmonth = {6},\nnumber = {199},\npages = {176--182},\npublisher = {Springer},\naddress = {Heidelberg, Germany},\nseries = {LNCI 199},\nbooktitle = {Proceedings of the 11th International Conference on Analysis and Optimization of Systems, Discrete Event Systems, Sophie-Antipolis, France},\nauthor = {Bause, Falko and Buchholz, Peter and Kemper, Peter}\n}\n
\n
\n','
\n@inproceedings{BaBuKe1994-HQPNs,\n  title = {Hierarchically Combined Queueing Petri Nets},\n  year = {1994},\n  month = {6},\n  number = {199},\n  pages = {176--182},\n  publisher = {Springer},\n  address = {Heidelberg, Germany},\n  series = {LNCI 199},\n  booktitle = {Proceedings of the 11th International Conference on Analysis and Optimization of Systems, Discrete Event Systems, Sophie-Antipolis, France},\n  author = {Bause, Falko and Buchholz, Peter and Kemper, Peter}\n}\n
\n\n',NULL,'Hierarchically Combined Queueing Petri Nets',0,6,1994,6,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(729,'paper','Ba1993-QPN_Formalism','inproceedings','@inproceedings{Ba1993-QPN_Formalism,\n title = {Queueing Petri Nets - A formalism for the combined qualitative and quantitative analysis of systems},\n year = {1993},\n pages = {14--23},\n publisher = {IEEE Computer Society},\n address = {Washington, DC, USA},\n booktitle = {Proceedings of the 5th International Workshop on Petri Nets and Performance Models, Toulouse, France, October 19-22},\n author = {Bause, Falko},\n}\n\n','\n\nFalko Bause.\nQueueing petri nets - a formalism for the combined qualitative and\nquantitative analysis of systems.\nIn Proceedings of the 5th International Workshop on Petri Nets\nand Performance Models, Toulouse, France, October 19-22, 1993, pages 14-23.\nIEEE Computer Society, Washington, DC, USA.\n1993.\n[ bib  ] 
\n@inproceedings{Ba1993-QPN_Formalism,\ntitle = {Queueing Petri Nets - A formalism for the combined qualitative and quantitative analysis of systems},\nyear = {1993},\npages = {14--23},\npublisher = {IEEE Computer Society},\naddress = {Washington, DC, USA},\nbooktitle = {Proceedings of the 5th International Workshop on Petri Nets and Performance Models, Toulouse, France, October 19-22},\nauthor = {Bause, Falko}\n}\n
\n
\n','
\n@inproceedings{Ba1993-QPN_Formalism,\n  title = {Queueing Petri Nets - A formalism for the combined qualitative and quantitative analysis of systems},\n  year = {1993},\n  pages = {14--23},\n  publisher = {IEEE Computer Society},\n  address = {Washington, DC, USA},\n  booktitle = {Proceedings of the 5th International Workshop on Petri Nets and Performance Models, Toulouse, France, October 19-22},\n  author = {Bause, Falko}\n}\n
\n\n',NULL,'Queueing Petri Nets - A formalism for the combined qualitative and quantitative analysis of systems',0,0,1993,0,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(730,'paper','Ba1993-QPN+PN--QPN','techreport','@techreport{Ba1993-QPN+PN--QPN,\n title = {QN + PN = QPN - Combining Queueing Networks and Petri Nets},\n year = {1993},\n institution = {Department of CS, University of Dortmund, Germany},\n type = {Technical Report No.461},\n author = {Bause, Falko},\n}\n\n','\n\nFalko Bause.\nQn + pn = qpn - combining queueing networks and petri nets.\nTechnical report no.461, Department of CS, University of Dortmund,\nGermany, 1993.\n[ bib  ] 
\n@techreport{Ba1993-QPN+PN--QPN,\ntitle = {QN + PN = QPN - Combining Queueing Networks and Petri Nets},\nyear = {1993},\ninstitution = {Department of CS, University of Dortmund, Germany},\ntype = {Technical Report No.461},\nauthor = {Bause, Falko}\n}\n
\n
\n','
\n@techreport{Ba1993-QPN+PN--QPN,\n  title = {QN + PN = QPN - Combining Queueing Networks and Petri Nets},\n  year = {1993},\n  institution = {Department of CS, University of Dortmund, Germany},\n  type = {Technical Report No.461},\n  author = {Bause, Falko}\n}\n
\n\n',NULL,'QN + PN = QPN - Combining Queueing Networks and Petri Nets',0,0,1993,0,NULL,NULL,'QPME','0000-00-00 00:00:00','2016-06-01 09:41:02',0),(738,'paper','intervalPowerVariants','article','@article{intervalPowerVariants,\n abstract = {The article gives an overview of power function variants and compares three differently extensive versions for use in interval arithmetics. Aiming at the general power function for inclusion in interval libraries, which is defined for as many pairs of base and exponent as possible, we observe that the definition of a power for each such pair depends on the context. This problem eventually comes up at the point where reasonable doubts about the definition 0_sup_0 and powers with negative base in correlation with a non-integral exponent arise. We come up with several variants serving distinct purposes, yet also recommend a general-purpose power function, which is unique for being restricted to integral exponents on the domain of negative bases. Three different variants of interval power functions satisfy all meaningful general exponentiation needs. We provide a unified treatment to handle the variants and present valuable implementation techniques for the computation of these interval functions along with a mathematic foundation.},\n year = {2013},\n issn = {1432-7643},\n journal = {Soft Computing},\n volume = {17},\n number = {8},\n doi = {10.1007/s00500-013-1008-8},\n title = {Variants of the general interval power function},\n url = {http://dx.doi.org/10.1007/s00500-013-1008-8},\n publisher = {Springer Berlin Heidelberg},\n keywords = {Power function; Interval arithmetic; Interval functions},\n author = {Heimlich, Oliver and Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\n pages = {1357-1366},\n language = {English},\n}\n\n','\n\nOliver Heimlich, Marco Nehmeier, and Jürgen Wolff von Gudenberg.\nVariants of the general interval power function.\nSoft Computing, 17(8):1357-1366, 2013, Springer Berlin\nHeidelberg.\n[ bib | DOI | http | Abstract  ] 
\n@article{intervalPowerVariants,\nabstract = {The article gives an overview of power function variants and compares three differently extensive versions for use in interval arithmetics. Aiming at the general power function for inclusion in interval libraries, which is defined for as many pairs of base and exponent as possible, we observe that the definition of a power for each such pair depends on the context. This problem eventually comes up at the point where reasonable doubts about the definition 0_sup_0 and powers with negative base in correlation with a non-integral exponent arise. We come up with several variants serving distinct purposes, yet also recommend a general-purpose power function, which is unique for being restricted to integral exponents on the domain of negative bases. Three different variants of interval power functions satisfy all meaningful general exponentiation needs. We provide a unified treatment to handle the variants and present valuable implementation techniques for the computation of these interval functions along with a mathematic foundation.},\nyear = {2013},\nissn = {1432-7643},\njournal = {Soft Computing},\nvolume = {17},\nnumber = {8},\ndoi = {10.1007/s00500-013-1008-8},\ntitle = {Variants of the general interval power function},\nurl = {http://dx.doi.org/10.1007/s00500-013-1008-8},\npublisher = {Springer Berlin Heidelberg},\nkeywords = {Power function; Interval arithmetic; Interval functions},\nauthor = {Heimlich, Oliver and Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\npages = {1357-1366},\nlanguage = {English}\n}\n
\n
\nThe article gives an overview of power function variants and compares three differently extensive versions for use in interval arithmetics. Aiming at the general power function for inclusion in interval libraries, which is defined for as many pairs of base and exponent as possible, we observe that the definition of a power for each such pair depends on the context. This problem eventually comes up at the point where reasonable doubts about the definition 0_sup_0 and powers with negative base in correlation with a non-integral exponent arise. We come up with several variants serving distinct purposes, yet also recommend a general-purpose power function, which is unique for being restricted to integral exponents on the domain of negative bases. Three different variants of interval power functions satisfy all meaningful general exponentiation needs. We provide a unified treatment to handle the variants and present valuable implementation techniques for the computation of these interval functions along with a mathematic foundation.\n
\n','
\n@article{intervalPowerVariants,\n  abstract = {The article gives an overview of power function variants and compares three differently extensive versions for use in interval arithmetics. Aiming at the general power function for inclusion in interval libraries, which is defined for as many pairs of base and exponent as possible, we observe that the definition of a power for each such pair depends on the context. This problem eventually comes up at the point where reasonable doubts about the definition 0_sup_0 and powers with negative base in correlation with a non-integral exponent arise. We come up with several variants serving distinct purposes, yet also recommend a general-purpose power function, which is unique for being restricted to integral exponents on the domain of negative bases. Three different variants of interval power functions satisfy all meaningful general exponentiation needs. We provide a unified treatment to handle the variants and present valuable implementation techniques for the computation of these interval functions along with a mathematic foundation.},\n  year = {2013},\n  issn = {1432-7643},\n  journal = {Soft Computing},\n  volume = {17},\n  number = {8},\n  doi = {10.1007/s00500-013-1008-8},\n  title = {Variants of the general interval power function},\n  url = {http://dx.doi.org/10.1007/s00500-013-1008-8},\n  publisher = {Springer Berlin Heidelberg},\n  keywords = {Power function; Interval arithmetic; Interval functions},\n  author = {Heimlich, Oliver and Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\n  pages = {1357-1366},\n  language = {English}\n}\n
\n\n','The article gives an overview of power function variants and compares three differently extensive versions for use in interval arithmetics. Aiming at the general power function for inclusion in interval libraries, which is defined for as many pairs of base and exponent as possible, we observe that the definition of a power for each such pair depends on the context. This problem eventually comes up at the point where reasonable doubts about the definition 0_sup_0 and powers with negative base in correlation with a non-integral exponent arise. We come up with several variants serving distinct purposes, yet also recommend a general-purpose power function, which is unique for being restricted to integral exponents on the domain of negative bases. Three different variants of interval power functions satisfy all meaningful general exponentiation needs. We provide a unified treatment to handle the variants and present valuable implementation techniques for the computation of these interval functions along with a mathematic foundation.','Variants of the general interval power function',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 10:30:35',0),(739,'paper','siegelScan2010','article','@article{siegelScan2010,\n abstract = {Long accumulators for the exact summation of floating point numbers or products are well known tools in numerical analysis especially in algorithms verifying the result (C++ Toolbox for Verified Computing, Springer, New York, 1995). An exact dot product is one of the features of the upcoming interval standard (IEEE Interval Standard Working Group, P1788. http://grouper.ieee.org/groups/1788/). Usually an accumulator is realized as a memory block with operations to add floating point numbers and products. Several variants have been proposed to avoid carry rippling: use separate accumulators for positive and negative numbers, initialize the accu with a pattern not equal to zero, or perform a kind of carry look-ahead-technique. All these approaches are described in detail in Kulisch (Computer arithmetic and validity—theory, implementation, and applications. Series: de Gruyter Studies in Mathematics 33, 2008) and Bohlender (Computer arithmetic and self-validating numerical methods, Academic Press, San Diego, 1990). In this paper we propose a long accumulator similar to a carry-save adder. The main idea is to augment the long accumulator with cache information. The cache is used to store the carries or borrows, instead of propagating them through the whole accumulator every time. Due to the cache, operations are kept local in our approach. The full information of the exact result is represented by the accu and the cache. When we want to deliver the result we have to add the contents of the cache into the accumulator. In this paper we present an implementation in software and compare it with other approaches. Furthermore we discuss the advantages of this algorithm for a hardware implementation.},\n added-at = {2012-03-04T10:59:16.000+0100},\n affiliation = {Institute of Computer Science, University of W\\\"urzburg, 97074 W\\\"urzburg, Germany},\n author = {Siegel, Stefan and Wolff von Gudenberg, J\\\"urgen},\n biburl = {http://www.bibsonomy.org/bibtex/2d08a4994b594b6d5f24aec838016f013/info2},\n interhash = {77fc08bc44fdcd1bb684d4d66e36c1b1},\n intrahash = {d08a4994b594b6d5f24aec838016f013},\n issn = {0010-485X},\n issue = {2},\n journal = {Computing},\n keyword = {Informatik},\n keywords = {info2 myown rari},\n note = {10.1007/s00607-011-0164-x},\n pages = {203-213},\n publisher = {Springer Wien},\n timestamp = {2012-03-04T10:59:16.000+0100},\n title = {A long accumulator like a carry-save adder},\n url = {http://dx.doi.org/10.1007/s00607-011-0164-x},\n volume = {94},\n year = {2012},\n}\n\n','\n\nStefan Siegel and Jürgen Wolff von Gudenberg.\nA long accumulator like a carry-save adder.\nComputing, 94:203-213, 2012, Springer Wien.\n10.1007/s00607-011-0164-x.\n[ bib | http | Abstract  ] 
\n@article{siegelScan2010,\nabstract = {Long accumulators for the exact summation of floating point numbers or products are well known tools in numerical analysis especially in algorithms verifying the result (C++ Toolbox for Verified Computing, Springer, New York, 1995). An exact dot product is one of the features of the upcoming interval standard (IEEE Interval Standard Working Group, P1788. http://grouper.ieee.org/groups/1788/). Usually an accumulator is realized as a memory block with operations to add floating point numbers and products. Several variants have been proposed to avoid carry rippling: use separate accumulators for positive and negative numbers, initialize the accu with a pattern not equal to zero, or perform a kind of carry look-ahead-technique. All these approaches are described in detail in Kulisch (Computer arithmetic and validity—theory, implementation, and applications. Series: de Gruyter Studies in Mathematics 33, 2008) and Bohlender (Computer arithmetic and self-validating numerical methods, Academic Press, San Diego, 1990). In this paper we propose a long accumulator similar to a carry-save adder. The main idea is to augment the long accumulator with cache information. The cache is used to store the carries or borrows, instead of propagating them through the whole accumulator every time. Due to the cache, operations are kept local in our approach. The full information of the exact result is represented by the accu and the cache. When we want to deliver the result we have to add the contents of the cache into the accumulator. In this paper we present an implementation in software and compare it with other approaches. Furthermore we discuss the advantages of this algorithm for a hardware implementation.},\nadded-at = {2012-03-04T10:59:16.000+0100},\naffiliation = {Institute of Computer Science, University of W\\\"urzburg, 97074 W\\\"urzburg, Germany},\nauthor = {Siegel, Stefan and Wolff von Gudenberg, J\\\"urgen},\nbiburl = {http://www.bibsonomy.org/bibtex/2d08a4994b594b6d5f24aec838016f013/info2},\ninterhash = {77fc08bc44fdcd1bb684d4d66e36c1b1},\nintrahash = {d08a4994b594b6d5f24aec838016f013},\nissn = {0010-485X},\nissue = {2},\njournal = {Computing},\nkeyword = {Informatik},\nkeywords = {info2 myown rari},\nnote = {10.1007/s00607-011-0164-x},\npages = {203-213},\npublisher = {Springer Wien},\ntimestamp = {2012-03-04T10:59:16.000+0100},\ntitle = {A long accumulator like a carry-save adder},\nurl = {http://dx.doi.org/10.1007/s00607-011-0164-x},\nvolume = {94},\nyear = {2012}\n}\n
\n
\nLong accumulators for the exact summation of floating point numbers or products are well known tools in numerical analysis especially in algorithms verifying the result (C++ Toolbox for Verified Computing, Springer, New York, 1995). An exact dot product is one of the features of the upcoming interval standard (IEEE Interval Standard Working Group, P1788. http://grouper.ieee.org/groups/1788/). Usually an accumulator is realized as a memory block with operations to add floating point numbers and products. Several variants have been proposed to avoid carry rippling: use separate accumulators for positive and negative numbers, initialize the accu with a pattern not equal to zero, or perform a kind of carry look-ahead-technique. All these approaches are described in detail in Kulisch (Computer arithmetic and validity—theory, implementation, and applications. Series: de Gruyter Studies in Mathematics 33, 2008) and Bohlender (Computer arithmetic and self-validating numerical methods, Academic Press, San Diego, 1990). In this paper we propose a long accumulator similar to a carry-save adder. The main idea is to augment the long accumulator with cache information. The cache is used to store the carries or borrows, instead of propagating them through the whole accumulator every time. Due to the cache, operations are kept local in our approach. The full information of the exact result is represented by the accu and the cache. When we want to deliver the result we have to add the contents of the cache into the accumulator. In this paper we present an implementation in software and compare it with other approaches. Furthermore we discuss the advantages of this algorithm for a hardware implementation.\n
\n','
\n@article{siegelScan2010,\n  abstract = {Long accumulators for the exact summation of floating point numbers or products are well known tools in numerical analysis especially in algorithms verifying the result (C++ Toolbox for Verified Computing, Springer, New York, 1995). An exact dot product is one of the features of the upcoming interval standard (IEEE Interval Standard Working Group, P1788. http://grouper.ieee.org/groups/1788/). Usually an accumulator is realized as a memory block with operations to add floating point numbers and products. Several variants have been proposed to avoid carry rippling: use separate accumulators for positive and negative numbers, initialize the accu with a pattern not equal to zero, or perform a kind of carry look-ahead-technique. All these approaches are described in detail in Kulisch (Computer arithmetic and validity—theory, implementation, and applications. Series: de Gruyter Studies in Mathematics 33, 2008) and Bohlender (Computer arithmetic and self-validating numerical methods, Academic Press, San Diego, 1990). In this paper we propose a long accumulator similar to a carry-save adder. The main idea is to augment the long accumulator with cache information. The cache is used to store the carries or borrows, instead of propagating them through the whole accumulator every time. Due to the cache, operations are kept local in our approach. The full information of the exact result is represented by the accu and the cache. When we want to deliver the result we have to add the contents of the cache into the accumulator. In this paper we present an implementation in software and compare it with other approaches. Furthermore we discuss the advantages of this algorithm for a hardware implementation.},\n  added-at = {2012-03-04T10:59:16.000+0100},\n  affiliation = {Institute of Computer Science, University of W\\\"urzburg, 97074 W\\\"urzburg, Germany},\n  author = {Siegel, Stefan and Wolff von Gudenberg, J\\\"urgen},\n  biburl = {http://www.bibsonomy.org/bibtex/2d08a4994b594b6d5f24aec838016f013/info2},\n  interhash = {77fc08bc44fdcd1bb684d4d66e36c1b1},\n  intrahash = {d08a4994b594b6d5f24aec838016f013},\n  issn = {0010-485X},\n  issue = {2},\n  journal = {Computing},\n  keyword = {Informatik},\n  keywords = {info2 myown rari},\n  note = {10.1007/s00607-011-0164-x},\n  pages = {203-213},\n  publisher = {Springer Wien},\n  timestamp = {2012-03-04T10:59:16.000+0100},\n  title = {A long accumulator like a carry-save adder},\n  url = {http://dx.doi.org/10.1007/s00607-011-0164-x},\n  volume = {94},\n  year = {2012}\n}\n
\n\n','Long accumulators for the exact summation of floating point numbers or products are well known tools in numerical analysis especially in algorithms verifying the result (C++ Toolbox for Verified Computing, Springer, New York, 1995). An exact dot product is one of the features of the upcoming interval standard (IEEE Interval Standard Working Group, P1788. http://grouper.ieee.org/groups/1788/). Usually an accumulator is realized as a memory block with operations to add floating point numbers and products. Several variants have been proposed to avoid carry rippling: use separate accumulators for positive and negative numbers, initialize the accu with a pattern not equal to zero, or perform a kind of carry look-ahead-technique. All these approaches are described in detail in Kulisch (Computer arithmetic and validity—theory, implementation, and applications. Series: de Gruyter Studies in Mathematics 33, 2008) and Bohlender (Computer arithmetic and self-validating numerical methods, Academic Press, San Diego, 1990). In this paper we propose a long accumulator similar to a carry-save adder. The main idea is to augment the long accumulator with cache information. The cache is used to store the carries or borrows, instead of propagating them through the whole accumulator every time. Due to the cache, operations are kept local in our approach. The full information of the exact result is represented by the accu and the cache. When we want to deliver the result we have to add the contents of the cache into the accumulator. In this paper we present an implementation in software and compare it with other approaches. Furthermore we discuss the advantages of this algorithm for a hardware implementation.','A long accumulator like a carry-save adder',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(740,'paper','iaHardwareScan2010','article','@article{iaHardwareScan2010,\n abstract = {Interval arithmetic, as it is standardized by the IEEE working group P1788 can be implemented by using floating point arithmetic units with directed rounding modes. The easiest way to represent an interval is by its two bounds. Simple formulas for the arithmetic operations can be applied. Our goal is to perform interval operations as fast as their floating point counterparts. Hence, we provide at least two units per operation. We also specify the operation for reverse multiplication (Neumaier in Vienna proposal for interval standardization, 2008) which can be implemented with the division unit. In this paper we do not care about optimization. Our primary intention is to give an easily understandable specification of hardware for interval arithmetic.},\n year = {2012},\n issn = {0010-485X},\n journal = {Computing},\n volume = {94},\n number = {2-4},\n doi = {10.1007/s00607-012-0185-0},\n title = {Specification of hardware for interval arithmetic},\n url = {http://dx.doi.org/10.1007/s00607-012-0185-0},\n publisher = {Springer Vienna},\n keywords = {Interval arithmetic; Hardware design; Interval standardization; 68-04; 94C99},\n author = {Nehmeier, Marco and Siegel, Stefan and Wolff von Gudenberg, J\\\"urgen},\n pages = {243-255},\n language = {English},\n}\n\n','\n\nMarco Nehmeier, Stefan Siegel, and Jürgen Wolff von Gudenberg.\nSpecification of hardware for interval arithmetic.\nComputing, 94(2-4):243-255, 2012, Springer Vienna.\n[ bib | DOI | http | Abstract  ] 
\n@article{iaHardwareScan2010,\nabstract = {Interval arithmetic, as it is standardized by the IEEE working group P1788 can be implemented by using floating point arithmetic units with directed rounding modes. The easiest way to represent an interval is by its two bounds. Simple formulas for the arithmetic operations can be applied. Our goal is to perform interval operations as fast as their floating point counterparts. Hence, we provide at least two units per operation. We also specify the operation for reverse multiplication (Neumaier in Vienna proposal for interval standardization, 2008) which can be implemented with the division unit. In this paper we do not care about optimization. Our primary intention is to give an easily understandable specification of hardware for interval arithmetic.},\nyear = {2012},\nissn = {0010-485X},\njournal = {Computing},\nvolume = {94},\nnumber = {2-4},\ndoi = {10.1007/s00607-012-0185-0},\ntitle = {Specification of hardware for interval arithmetic},\nurl = {http://dx.doi.org/10.1007/s00607-012-0185-0},\npublisher = {Springer Vienna},\nkeywords = {Interval arithmetic; Hardware design; Interval standardization; 68-04; 94C99},\nauthor = {Nehmeier, Marco and Siegel, Stefan and Wolff von Gudenberg, J\\\"urgen},\npages = {243-255},\nlanguage = {English}\n}\n
\n
\nInterval arithmetic, as it is standardized by the IEEE working group P1788 can be implemented by using floating point arithmetic units with directed rounding modes. The easiest way to represent an interval is by its two bounds. Simple formulas for the arithmetic operations can be applied. Our goal is to perform interval operations as fast as their floating point counterparts. Hence, we provide at least two units per operation. We also specify the operation for reverse multiplication (Neumaier in Vienna proposal for interval standardization, 2008) which can be implemented with the division unit. In this paper we do not care about optimization. Our primary intention is to give an easily understandable specification of hardware for interval arithmetic.\n
\n','
\n@article{iaHardwareScan2010,\n  abstract = {Interval arithmetic, as it is standardized by the IEEE working group P1788 can be implemented by using floating point arithmetic units with directed rounding modes. The easiest way to represent an interval is by its two bounds. Simple formulas for the arithmetic operations can be applied. Our goal is to perform interval operations as fast as their floating point counterparts. Hence, we provide at least two units per operation. We also specify the operation for reverse multiplication (Neumaier in Vienna proposal for interval standardization, 2008) which can be implemented with the division unit. In this paper we do not care about optimization. Our primary intention is to give an easily understandable specification of hardware for interval arithmetic.},\n  year = {2012},\n  issn = {0010-485X},\n  journal = {Computing},\n  volume = {94},\n  number = {2-4},\n  doi = {10.1007/s00607-012-0185-0},\n  title = {Specification of hardware for interval arithmetic},\n  url = {http://dx.doi.org/10.1007/s00607-012-0185-0},\n  publisher = {Springer Vienna},\n  keywords = {Interval arithmetic; Hardware design; Interval standardization; 68-04; 94C99},\n  author = {Nehmeier, Marco and Siegel, Stefan and Wolff von Gudenberg, J\\\"urgen},\n  pages = {243-255},\n  language = {English}\n}\n
\n\n','Interval arithmetic, as it is standardized by the IEEE working group P1788 can be implemented by using floating point arithmetic units with directed rounding modes. The easiest way to represent an interval is by its two bounds. Simple formulas for the arithmetic operations can be applied. Our goal is to perform interval operations as fast as their floating point counterparts. Hence, we provide at least two units per operation. We also specify the operation for reverse multiplication (Neumaier in Vienna proposal for interval standardization, 2008) which can be implemented with the division unit. In this paper we do not care about optimization. Our primary intention is to give an easily understandable specification of hardware for interval arithmetic.','Specification of hardware for interval arithmetic',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(741,'paper','tischlerScan08','article','@article{tischlerScan08,\n added-at = {2012-02-24T16:55:57.000+0100},\n author = {Tischler, German and Wolff von Gudenberg, J\\\"urgen},\n biburl = {http://www.bibsonomy.org/bibtex/214dcb975d4a421928dfa30e82e271f80/info2},\n interhash = {7de13a747748527178e9a9e83a38f4f1},\n intrahash = {14dcb975d4a421928dfa30e82e271f80},\n journal = {Reliable Computing},\n keywords = {info2 myown rari},\n month = {},\n number = {3},\n pages = {279--289},\n timestamp = {2012-02-24T16:55:57.000+0100},\n title = {Solving Decidability Problems with Interval Arithmetic},\n url = {http://interval.louisiana.edu/reliable-computing-journal/volume-15/no-3/reliable-computing-15-pp-279-289.pdf},\n volume = {15},\n year = {2011},\n}\n\n','\n\nGerman Tischler and Jürgen Wolff von Gudenberg.\nSolving decidability problems with interval arithmetic.\nReliable Computing, 15(3):279-289, 2011.\n[ bib | .pdf  ] 
\n@article{tischlerScan08,\nadded-at = {2012-02-24T16:55:57.000+0100},\nauthor = {Tischler, German and Wolff von Gudenberg, J\\\"urgen},\nbiburl = {http://www.bibsonomy.org/bibtex/214dcb975d4a421928dfa30e82e271f80/info2},\ninterhash = {7de13a747748527178e9a9e83a38f4f1},\nintrahash = {14dcb975d4a421928dfa30e82e271f80},\njournal = {Reliable Computing},\nkeywords = {info2 myown rari},\nmonth = {},\nnumber = {3},\npages = {279--289},\ntimestamp = {2012-02-24T16:55:57.000+0100},\ntitle = {Solving Decidability Problems with Interval Arithmetic},\nurl = {http://interval.louisiana.edu/reliable-computing-journal/volume-15/no-3/reliable-computing-15-pp-279-289.pdf},\nvolume = {15},\nyear = {2011}\n}\n
\n
\n','
\n@article{tischlerScan08,\n  added-at = {2012-02-24T16:55:57.000+0100},\n  author = {Tischler, German and Wolff von Gudenberg, J\\\"urgen},\n  biburl = {http://www.bibsonomy.org/bibtex/214dcb975d4a421928dfa30e82e271f80/info2},\n  interhash = {7de13a747748527178e9a9e83a38f4f1},\n  intrahash = {14dcb975d4a421928dfa30e82e271f80},\n  journal = {Reliable Computing},\n  keywords = {info2 myown rari},\n  month = {},\n  number = {3},\n  pages = {279--289},\n  timestamp = {2012-02-24T16:55:57.000+0100},\n  title = {Solving Decidability Problems with Interval Arithmetic},\n  url = {http://interval.louisiana.edu/reliable-computing-journal/volume-15/no-3/reliable-computing-15-pp-279-289.pdf},\n  volume = {15},\n  year = {2011}\n}\n
\n\n',NULL,'Solving Decidability Problems with Interval Arithmetic',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(742,'paper','nehmeierPara2010','incollection','@incollection{nehmeierPara2010,\n abstract = {In this paper we define the interval overlapping relation and develop a parallel hardware unit for its realization. As one application we consider the interval comparisons. It is shown that a detailed classification of the interval overlapping relation leads to a reduction of floating-point comparisons in common applications.},\n year = {2012},\n isbn = {978-3-642-28144-0},\n booktitle = {Applied Parallel and Scientific Computing},\n volume = {7134},\n series = {Lecture Notes in Computer Science},\n editor = {J\\\"onasson, Kristj\\\"an},\n doi = {10.1007/978-3-642-28145-7_13},\n title = {{P}arallel {D}etection of {I}nterval {O}verlapping},\n url = {http://dx.doi.org/10.1007/978-3-642-28145-7_13},\n publisher = {Springer Berlin Heidelberg},\n keywords = {interval arithmetic; interval relations; hardware unit},\n author = {Nehmeier, Marco and Siegel, Stefan and Wolff von Gudenberg, J\\\"urgen},\n pages = {127-136},\n language = {English},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/742.pdf},\n}\n\n','\n\nMarco Nehmeier, Stefan Siegel, and Jürgen Wolff von Gudenberg.\nParallel Detection of Interval Overlapping.\nIn Applied Parallel and Scientific Computing, Kristjän\nJönasson, editor, volume 7134 of Lecture Notes in Computer Science,\npages 127-136. Springer Berlin Heidelberg, 2012.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@incollection{nehmeierPara2010,\nabstract = {In this paper we define the interval overlapping relation and develop a parallel hardware unit for its realization. As one application we consider the interval comparisons. It is shown that a detailed classification of the interval overlapping relation leads to a reduction of floating-point comparisons in common applications.},\nyear = {2012},\nisbn = {978-3-642-28144-0},\nbooktitle = {Applied Parallel and Scientific Computing},\nvolume = {7134},\nseries = {Lecture Notes in Computer Science},\neditor = {J\\\"onasson, Kristj\\\"an},\ndoi = {10.1007/978-3-642-28145-7_13},\ntitle = {{P}arallel {D}etection of {I}nterval {O}verlapping},\nurl = {http://dx.doi.org/10.1007/978-3-642-28145-7_13},\npublisher = {Springer Berlin Heidelberg},\nkeywords = {interval arithmetic; interval relations; hardware unit},\nauthor = {Nehmeier, Marco and Siegel, Stefan and Wolff von Gudenberg, J\\\"urgen},\npages = {127-136},\nlanguage = {English},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/742.pdf}\n}\n
\n
\nIn this paper we define the interval overlapping relation and develop a parallel hardware unit for its realization. As one application we consider the interval comparisons. It is shown that a detailed classification of the interval overlapping relation leads to a reduction of floating-point comparisons in common applications.\n
\n','
\n@incollection{nehmeierPara2010,\n  abstract = {In this paper we define the interval overlapping relation and develop a parallel hardware unit for its realization. As one application we consider the interval comparisons. It is shown that a detailed classification of the interval overlapping relation leads to a reduction of floating-point comparisons in common applications.},\n  year = {2012},\n  isbn = {978-3-642-28144-0},\n  booktitle = {Applied Parallel and Scientific Computing},\n  volume = {7134},\n  series = {Lecture Notes in Computer Science},\n  editor = {J\\\"onasson, Kristj\\\"an},\n  doi = {10.1007/978-3-642-28145-7_13},\n  title = {{P}arallel {D}etection of {I}nterval {O}verlapping},\n  url = {http://dx.doi.org/10.1007/978-3-642-28145-7_13},\n  publisher = {Springer Berlin Heidelberg},\n  keywords = {interval arithmetic; interval relations; hardware unit},\n  author = {Nehmeier, Marco and Siegel, Stefan and Wolff von Gudenberg, J\\\"urgen},\n  pages = {127-136},\n  language = {English},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/742.pdf}\n}\n
\n\n','In this paper we define the interval overlapping relation and develop a parallel hardware unit for its realization. As one application we consider the interval comparisons. It is shown that a detailed classification of the interval overlapping relation leads to a reduction of floating-point comparisons in common applications.','{P}arallel {D}etection of {I}nterval {O}verlapping',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(743,'paper','nehmeierWconSC2011','inproceedings','@inproceedings{nehmeierWconSC2011,\n abstract = {The interval overlapping relation defines 13 different states of the relative position of two intervals. In this paper we show that this relation can be used to define the interval comparisons and lattice operations. The shift from a boolean (binary) comparison to a comprehensive relation (13 different states) enables the user to exploit involved dependencies. We further introduce an object oriented abstract datatype to provide a userfriendly interface.},\n address = {San Francisco, CA, USA},\n author = {Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\n booktitle = {Proceedings of the World Conference on Soft Computing 2011 (WConSC\'11)},\n month = {},\n title = {{I}nterval {C}omparisons and {L}attice {O}perations based on the {I}nterval {O}verlapping {R}elation},\n url = {http://wwwi2.informatik.uni-wuerzburg.de/publications/paperNehmeierWConSC11.pdf},\n year = {2011},\n}\n\n','\n\nMarco Nehmeier and Jürgen Wolff von Gudenberg.\nInterval Comparisons and Lattice Operations based on the\nInterval Overlapping Relation.\nIn Proceedings of the World Conference on Soft Computing 2011\n(WConSC\'11), 2011. San Francisco, CA, USA.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{nehmeierWconSC2011,\nabstract = {The interval overlapping relation defines 13 different states of the relative position of two intervals. In this paper we show that this relation can be used to define the interval comparisons and lattice operations. The shift from a boolean (binary) comparison to a comprehensive relation (13 different states) enables the user to exploit involved dependencies. We further introduce an object oriented abstract datatype to provide a userfriendly interface.},\naddress = {San Francisco, CA, USA},\nauthor = {Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\nbooktitle = {Proceedings of the World Conference on Soft Computing 2011 (WConSC\'11)},\nmonth = {},\ntitle = {{I}nterval {C}omparisons and {L}attice {O}perations based on the {I}nterval {O}verlapping {R}elation},\nurl = {http://wwwi2.informatik.uni-wuerzburg.de/publications/paperNehmeierWConSC11.pdf},\nyear = {2011}\n}\n
\n
\nThe interval overlapping relation defines 13 different states of the relative position of two intervals. In this paper we show that this relation can be used to define the interval comparisons and lattice operations. The shift from a boolean (binary) comparison to a comprehensive relation (13 different states) enables the user to exploit involved dependencies. We further introduce an object oriented abstract datatype to provide a userfriendly interface.\n
\n','
\n@inproceedings{nehmeierWconSC2011,\n  abstract = {The interval overlapping relation defines 13 different states of the relative position of two intervals. In this paper we show that this relation can be used to define the interval comparisons and lattice operations. The shift from a boolean (binary) comparison to a comprehensive relation (13 different states) enables the user to exploit involved dependencies. We further introduce an object oriented abstract datatype to provide a userfriendly interface.},\n  address = {San Francisco, CA, USA},\n  author = {Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\n  booktitle = {Proceedings of the World Conference on Soft Computing 2011 (WConSC\'11)},\n  month = {},\n  title = {{I}nterval {C}omparisons and {L}attice {O}perations based on the {I}nterval {O}verlapping {R}elation},\n  url = {http://wwwi2.informatik.uni-wuerzburg.de/publications/paperNehmeierWConSC11.pdf},\n  year = {2011}\n}\n
\n\n','The interval overlapping relation defines 13 different states of the relative position of two intervals. In this paper we show that this relation can be used to define the interval comparisons and lattice operations. The shift from a boolean (binary) comparison to a comprehensive relation (13 different states) enables the user to exploit involved dependencies. We further introduce an object oriented abstract datatype to provide a userfriendly interface.','{I}nterval {C}omparisons and {L}attice {O}perations based on the {I}nterval {O}verlapping {R}elation',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(744,'paper','nehmeierSCAN2008','article','@article{nehmeierSCAN2008,\n abstract = {In this paper we investigate how a C++ class library can be improved by the concept of expression templates. Our first result is a saving of rounding mode switches which considerably increases the performance. Our second result deals with handling the discontinuity flag that will probably be decided to be raised whenever a function is called outside its domain (loose evaluation). We discuss several alternatives and propose an expression related flag that can be used in a thread safe manner. Both results are reviewed with respect to the coming IEEE standard for interval arithmetic.},\n author = {Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\n journal = {Reliable Computing},\n month = {},\n number = {4},\n pages = {312--320},\n title = {filib++, {E}xpression {T}emplates and the {C}oming {I}nterval {S}tandard},\n url = {http://interval.louisiana.edu/reliable-computing-journal/volume-15/no-4/reliable-computing-15-pp-312-320.pdf},\n volume = {15},\n year = {2011},\n}\n\n','\n\nMarco Nehmeier and Jürgen Wolff von Gudenberg.\nfilib++, Expression Templates and the Coming Interval\nStandard.\nReliable Computing, 15(4):312-320, 2011.\n[ bib | .pdf | Abstract  ] 
\n@article{nehmeierSCAN2008,\nabstract = {In this paper we investigate how a C++ class library can be improved by the concept of expression templates. Our first result is a saving of rounding mode switches which considerably increases the performance. Our second result deals with handling the discontinuity flag that will probably be decided to be raised whenever a function is called outside its domain (loose evaluation). We discuss several alternatives and propose an expression related flag that can be used in a thread safe manner. Both results are reviewed with respect to the coming IEEE standard for interval arithmetic.},\nauthor = {Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\njournal = {Reliable Computing},\nmonth = {},\nnumber = {4},\npages = {312--320},\ntitle = {filib++, {E}xpression {T}emplates and the {C}oming {I}nterval {S}tandard},\nurl = {http://interval.louisiana.edu/reliable-computing-journal/volume-15/no-4/reliable-computing-15-pp-312-320.pdf},\nvolume = {15},\nyear = {2011}\n}\n
\n
\nIn this paper we investigate how a C++ class library can be improved by the concept of expression templates. Our first result is a saving of rounding mode switches which considerably increases the performance. Our second result deals with handling the discontinuity flag that will probably be decided to be raised whenever a function is called outside its domain (loose evaluation). We discuss several alternatives and propose an expression related flag that can be used in a thread safe manner. Both results are reviewed with respect to the coming IEEE standard for interval arithmetic.\n
\n','
\n@article{nehmeierSCAN2008,\n  abstract = {In this paper we investigate how a C++ class library can be improved by the concept of expression templates. Our first result is a saving of rounding mode switches which considerably increases the performance. Our second result deals with handling the discontinuity flag that will probably be decided to be raised whenever a function is called outside its domain (loose evaluation). We discuss several alternatives and propose an expression related flag that can be used in a thread safe manner. Both results are reviewed with respect to the coming IEEE standard for interval arithmetic.},\n  author = {Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\n  journal = {Reliable Computing},\n  month = {},\n  number = {4},\n  pages = {312--320},\n  title = {filib++, {E}xpression {T}emplates and the {C}oming {I}nterval {S}tandard},\n  url = {http://interval.louisiana.edu/reliable-computing-journal/volume-15/no-4/reliable-computing-15-pp-312-320.pdf},\n  volume = {15},\n  year = {2011}\n}\n
\n\n','In this paper we investigate how a C++ class library can be improved by the concept of expression templates. Our first result is a saving of rounding mode switches which considerably increases the performance. Our second result deals with handling the discontinuity flag that will probably be decided to be raised whenever a function is called outside its domain (loose evaluation). We discuss several alternatives and propose an expression related flag that can be used in a thread safe manner. Both results are reviewed with respect to the coming IEEE standard for interval arithmetic.','filib++, {E}xpression {T}emplates and the {C}oming {I}nterval {S}tandard',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(745,'paper','NoRoKoRe2014-MASCOTS-IOQPNs','inproceedings','@inproceedings{NoRoKoRe2014-MASCOTS-IOQPNs,\n author = {Qais Noorshams and Kiana Rostami and Samuel Kounev and Ralf Reussner},\n booktitle = {Proceedings of the IEEE 22nd International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems},\n series = {MASCOTS 2014},\n day = {09--11},\n location = {France, Paris},\n title = {{Modeling of I/O Performance Interference in Virtualized Environments with Queueing Petri Nets}},\n titleaddon = {{(Short Paper)}},\n year = {2014},\n month = {{September}},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/745.pdf},\n}\n\n','\n\nQais Noorshams, Kiana Rostami, Samuel Kounev, and Ralf Reussner.\nModeling of I/O Performance Interference in Virtualized Environments\nwith Queueing Petri Nets (Short Paper).\nIn Proceedings of the IEEE 22nd International Symposium on\nModeling, Analysis and Simulation of Computer and Telecommunication Systems,\nFrance, Paris, September 09-11, 2014, MASCOTS 2014.\n[ bib | .pdf  ] 
\n@inproceedings{NoRoKoRe2014-MASCOTS-IOQPNs,\nauthor = {Qais Noorshams and Kiana Rostami and Samuel Kounev and Ralf Reussner},\nbooktitle = {Proceedings of the IEEE 22nd International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems},\nseries = {MASCOTS 2014},\nday = {09--11},\nlocation = {France, Paris},\ntitle = {{Modeling of I/O Performance Interference in Virtualized Environments with Queueing Petri Nets}},\ntitleaddon = {{(Short Paper)}},\nyear = {2014},\nmonth = {{September}},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/745.pdf}\n}\n
\n
\n','
\n@inproceedings{NoRoKoRe2014-MASCOTS-IOQPNs,\n  author = {Qais Noorshams and Kiana Rostami and Samuel Kounev and Ralf Reussner},\n  booktitle = {Proceedings of the IEEE 22nd International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems},\n  series = {MASCOTS 2014},\n  day = {09--11},\n  location = {France, Paris},\n  title = {{Modeling of I/O Performance Interference in Virtualized Environments with Queueing Petri Nets}},\n  titleaddon = {{(Short Paper)}},\n  year = {2014},\n  month = {{September}},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/745.pdf}\n}\n
\n\n',NULL,'{Modeling of I/O Performance Interference in Virtualized Environments with Queueing Petri Nets}',0,9,2014,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(746,'paper','SpKoZhLuUyHoGr2014-SASO','inproceedings','@inproceedings{SpKoZhLuUyHoGr2014-SASO,\n author = {Spinner, Simon and Kounev, Samuel and Zhu, Xiaoyun and Lu, Lei and Uysal, Mustafa and Holler, Anne and Griffith, Rean},\n title = {{Runtime Vertical Scaling of Virtualized Applications via Online Model Estimation}},\n booktitle = {Proceedings of the 2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems (SASO)},\n location = {London, UK},\n organizer = {IEEE},\n day = {8--12},\n month = {September},\n year = {2014},\n publisher = {IEEE},\n pages = {157--166},\n doi = {10.1109/SASO.2014.29},\n note = {Acceptance Rate (Full Papers): 26%},\n abstract = {Applications in virtualized data centers are often subject to Service Level Objectives (SLOs) regarding their performance (e.g., latency or throughput). In order to fulfill these SLOs, it is necessary to allocate sufficient resources of different types (CPU, memory, I/O, etc.) to an application. However, the relationship between the application performance and the resource allocations is complex and depends on multiple factors including application architecture, system configuration, and workload demands. In this paper, we present a model-based approach to ensure that the application performance meets the user-defined SLO efficiently by runtime \"vertical scaling\" (i.e., adding or removing resources) of individual virtual machines (VMs) running the application. A layered performance model describing the relationship between the resource allocations and the observed application performance is automatically extracted and updated online using resource demand estimation techniques. Such a model is then used in a feedback controller to dynamically adapt the number of virtual CPUs of individual VMs. We have implemented the controller on top of the VMware vSphere platform and evaluated it in a case study using a real-world email and groupware server. The experimental results show that our approach allows the managed application to achieve SLO satisfaction in spite of workload demand variation while avoiding oscillations commonly observed with state-of-the-art threshold-based controllers.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/746.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/746},\n}\n\n','\n\nSimon Spinner, Samuel Kounev, Xiaoyun Zhu, Lei Lu, Mustafa Uysal, Anne Holler,\nand Rean Griffith.\nRuntime Vertical Scaling of Virtualized Applications via Online\nModel Estimation.\nIn Proceedings of the 2014 IEEE Eighth International Conference\non Self-Adaptive and Self-Organizing Systems (SASO), London, UK, September\n8-12, 2014, pages 157-166. IEEE.\nSeptember 2014, Acceptance Rate (Full Papers): 26%.\n[ bib | DOI | slides | .pdf | Abstract  ] 
\n@inproceedings{SpKoZhLuUyHoGr2014-SASO,\nauthor = {Spinner, Simon and Kounev, Samuel and Zhu, Xiaoyun and Lu, Lei and Uysal, Mustafa and Holler, Anne and Griffith, Rean},\ntitle = {{Runtime Vertical Scaling of Virtualized Applications via Online Model Estimation}},\nbooktitle = {Proceedings of the 2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems (SASO)},\nlocation = {London, UK},\norganizer = {IEEE},\nday = {8--12},\nmonth = {September},\nyear = {2014},\npublisher = {IEEE},\npages = {157--166},\ndoi = {10.1109/SASO.2014.29},\nnote = {Acceptance Rate (Full Papers): 26%},\nabstract = {Applications in virtualized data centers are often subject to Service Level Objectives (SLOs) regarding their performance (e.g., latency or throughput). In order to fulfill these SLOs, it is necessary to allocate sufficient resources of different types (CPU, memory, I/O, etc.) to an application. However, the relationship between the application performance and the resource allocations is complex and depends on multiple factors including application architecture, system configuration, and workload demands. In this paper, we present a model-based approach to ensure that the application performance meets the user-defined SLO efficiently by runtime \"vertical scaling\" (i.e., adding or removing resources) of individual virtual machines (VMs) running the application. A layered performance model describing the relationship between the resource allocations and the observed application performance is automatically extracted and updated online using resource demand estimation techniques. Such a model is then used in a feedback controller to dynamically adapt the number of virtual CPUs of individual VMs. We have implemented the controller on top of the VMware vSphere platform and evaluated it in a case study using a real-world email and groupware server. The experimental results show that our approach allows the managed application to achieve SLO satisfaction in spite of workload demand variation while avoiding oscillations commonly observed with state-of-the-art threshold-based controllers.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/746.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/746}\n}\n
\n
\nApplications in virtualized data centers are often subject to Service Level Objectives (SLOs) regarding their performance (e.g., latency or throughput). In order to fulfill these SLOs, it is necessary to allocate sufficient resources of different types (CPU, memory, I/O, etc.) to an application. However, the relationship between the application performance and the resource allocations is complex and depends on multiple factors including application architecture, system configuration, and workload demands. In this paper, we present a model-based approach to ensure that the application performance meets the user-defined SLO efficiently by runtime \"vertical scaling\" (i.e., adding or removing resources) of individual virtual machines (VMs) running the application. A layered performance model describing the relationship between the resource allocations and the observed application performance is automatically extracted and updated online using resource demand estimation techniques. Such a model is then used in a feedback controller to dynamically adapt the number of virtual CPUs of individual VMs. We have implemented the controller on top of the VMware vSphere platform and evaluated it in a case study using a real-world email and groupware server. The experimental results show that our approach allows the managed application to achieve SLO satisfaction in spite of workload demand variation while avoiding oscillations commonly observed with state-of-the-art threshold-based controllers.\n
\n','
\n@inproceedings{SpKoZhLuUyHoGr2014-SASO,\n  author = {Spinner, Simon and Kounev, Samuel and Zhu, Xiaoyun and Lu, Lei and Uysal, Mustafa and Holler, Anne and Griffith, Rean},\n  title = {{Runtime Vertical Scaling of Virtualized Applications via Online Model Estimation}},\n  booktitle = {Proceedings of the 2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems (SASO)},\n  location = {London, UK},\n  organizer = {IEEE},\n  day = {8--12},\n  month = {September},\n  year = {2014},\n  publisher = {IEEE},\n  pages = {157--166},\n  doi = {10.1109/SASO.2014.29},\n  note = {Acceptance Rate (Full Papers): 26%},\n  abstract = {Applications in virtualized data centers are often subject to Service Level Objectives (SLOs) regarding their performance (e.g., latency or throughput). In order to fulfill these SLOs, it is necessary to allocate sufficient resources of different types (CPU, memory, I/O, etc.) to an application. However, the relationship between the application performance and the resource allocations is complex and depends on multiple factors including application architecture, system configuration, and workload demands. In this paper, we present a model-based approach to ensure that the application performance meets the user-defined SLO efficiently by runtime \"vertical scaling\" (i.e., adding or removing resources) of individual virtual machines (VMs) running the application. A layered performance model describing the relationship between the resource allocations and the observed application performance is automatically extracted and updated online using resource demand estimation techniques. Such a model is then used in a feedback controller to dynamically adapt the number of virtual CPUs of individual VMs. We have implemented the controller on top of the VMware vSphere platform and evaluated it in a case study using a real-world email and groupware server. The experimental results show that our approach allows the managed application to achieve SLO satisfaction in spite of workload demand variation while avoiding oscillations commonly observed with state-of-the-art threshold-based controllers.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/746.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/746}\n}\n
\n\n','Applications in virtualized data centers are often subject to Service Level Objectives (SLOs) regarding their performance (e.g., latency or throughput). In order to fulfill these SLOs, it is necessary to allocate sufficient resources of different types (CPU, memory, I/O, etc.) to an application. However, the relationship between the application performance and the resource allocations is complex and depends on multiple factors including application architecture, system configuration, and workload demands. In this paper, we present a model-based approach to ensure that the application performance meets the user-defined SLO efficiently by runtime \"vertical scaling\" (i.e., adding or removing resources) of individual virtual machines (VMs) running the application. A layered performance model describing the relationship between the resource allocations and the observed application performance is automatically extracted and updated online using resource demand estimation techniques. Such a model is then used in a feedback controller to dynamically adapt the number of virtual CPUs of individual VMs. We have implemented the controller on top of the VMware vSphere platform and evaluated it in a case study using a real-world email and groupware server. The experimental results show that our approach allows the managed application to achieve SLO satisfaction in spite of workload demand variation while avoiding oscillations commonly observed with state-of-the-art threshold-based controllers.','{Runtime Vertical Scaling of Virtualized Applications via Online Model Estimation}',0,9,2014,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(747,'paper','Ko2014-QEST-Keynote','inproceedings','@inproceedings{Ko2014-QEST-Keynote,\n author = {Samuel Kounev},\n title = {{Quantitative Evaluation of Service Dependability in Shared Execution Environments (Extended Abstract of Keynote Talk)}},\n year = {2014},\n month = {{September}},\n day = {8--12},\n booktitle = {Proceedings of the 11th International Conference on Quantitative Evaluation of SysTems (QEST 2014), Florence, Italy},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/747.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/747},\n}\n\n','\n\nSamuel Kounev.\nQuantitative Evaluation of Service Dependability in Shared Execution\nEnvironments (Extended Abstract of Keynote Talk).\nIn Proceedings of the 11th International Conference on\nQuantitative Evaluation of SysTems (QEST 2014), Florence, Italy, September\n8-12, 2014.\n[ bib | slides | .pdf  ] 
\n@inproceedings{Ko2014-QEST-Keynote,\nauthor = {Samuel Kounev},\ntitle = {{Quantitative Evaluation of Service Dependability in Shared Execution Environments (Extended Abstract of Keynote Talk)}},\nyear = {2014},\nmonth = {{September}},\nday = {8--12},\nbooktitle = {Proceedings of the 11th International Conference on Quantitative Evaluation of SysTems (QEST 2014), Florence, Italy},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/747.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/747}\n}\n
\n
\n','
\n@inproceedings{Ko2014-QEST-Keynote,\n  author = {Samuel Kounev},\n  title = {{Quantitative Evaluation of Service Dependability in Shared Execution Environments (Extended Abstract of Keynote Talk)}},\n  year = {2014},\n  month = {{September}},\n  day = {8--12},\n  booktitle = {Proceedings of the 11th International Conference on Quantitative Evaluation of SysTems (QEST 2014), Florence, Italy},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/747.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/747}\n}\n
\n\n',NULL,'{Quantitative Evaluation of Service Dependability in Shared Execution Environments (Extended Abstract of Keynote Talk)}',0,9,2014,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(748,'paper','Kistowski2011a','mastersthesis','@mastersthesis{Kistowski2011a,\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n author = {J\\\'{o}akim von Kistowski},\n keywords = {Cloud, Resource Elasticity},\n school = {{Karlsruhe Institute of Technology (KIT)}},\n title = {{Defining and Measuring Workloads for Elasticity Benchmarking}},\n type = {{Bachelor Thesis}},\n year = {2011},\n}\n\n','\n\nJóakim von Kistowski.\nDefining and Measuring Workloads for Elasticity Benchmarking.\nBachelor Thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, 2011.\n[ bib  ] 
\n@mastersthesis{Kistowski2011a,\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nauthor = {J\\\'{o}akim von Kistowski},\nkeywords = {Cloud, Resource Elasticity},\nschool = {{Karlsruhe Institute of Technology (KIT)}},\ntitle = {{Defining and Measuring Workloads for Elasticity Benchmarking}},\ntype = {{Bachelor Thesis}},\nyear = {2011}\n}\n
\n
\n','
\n@mastersthesis{Kistowski2011a,\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  author = {J\\\'{o}akim von Kistowski},\n  keywords = {Cloud, Resource Elasticity},\n  school = {{Karlsruhe Institute of Technology (KIT)}},\n  title = {{Defining and Measuring Workloads for Elasticity Benchmarking}},\n  type = {{Bachelor Thesis}},\n  year = {2011}\n}\n
\n\n',NULL,'{Defining and Measuring Workloads for Elasticity Benchmarking}',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(749,'paper','Kistowski2014','mastersthesis','@mastersthesis{Kistowski2014,\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n abstract = {{Today\'s software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. Based on this observation, I identify the need for means allowing flexible definition of load profiles and address this by introducing two meta-models at different abstraction levels. At the lower abstraction level, the Descartes Load Intensity Meta-Model (DLIM) offers a structured and accessible way of describing the load intensity over time by editing and combining mathematical functions. The high-level Descartes Load Intensity Meta-Model (hl-DLIM) allows the description of load variations using few defined parameters that characterize the seasonal patterns, trends, bursts, and noise parts. Using these parameters, hl-DLIM is capable of describing a subset of most common load intensity variations. During the work on this thesis I developed LIMBO - an Eclipse-based tool for modeling variable load intensity profiles based on DLIM and hl-DLIM as underlying modeling formalisms. LIMBO provides visualization for DLIM instances and a model creation wizard based on hl-DLIM parameters. It also offers three automated model extraction processes with which to extract DLIM and hl-DLIM instances from existing arrival rate traces. It also offers a model-to-model transformation from hl-DLIM to DLIM. I demonstrate that both meta-models are capable of capturing real-world load profiles with acceptable accuracy, having an average median deviation of 19.9\\% from the original trace. This is done by comparing nine different real life traces, which were measured over duration of two weeks to seven months, to their respective model instances as extracted by the automated model extraction processes. I also evaluate the usability and accessibility of LIMBO based on a questionnaire which was answered by eight computer scientists from five different organizations within the performance engineering community.}},\n author = {J\\\'{o}akim von Kistowski},\n keywords = {Load Intensity, Model},\n school = {{Karlsruhe Institute of Technology (KIT)}},\n title = {{Modeling Variations in Load Intensity Profiles}},\n type = {{Master Thesis}},\n year = {2014},\n month = {March},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/749.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/749},\n note = {Gesellschaft zur F\\\"orderung des Forschungstransfers (GFFT) Prize \"Best Master Thesis\"},\n}\n\n','\n\nJóakim von Kistowski.\nModeling Variations in Load Intensity Profiles.\nMaster Thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, March 2014.\nGesellschaft zur Förderung des Forschungstransfers (GFFT) Prize\n\"Best Master Thesis\".\n[ bib | slides | .pdf | Abstract  ] 
\n@mastersthesis{Kistowski2014,\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nabstract = {{Today\'s software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. Based on this observation, I identify the need for means allowing flexible definition of load profiles and address this by introducing two meta-models at different abstraction levels. At the lower abstraction level, the Descartes Load Intensity Meta-Model (DLIM) offers a structured and accessible way of describing the load intensity over time by editing and combining mathematical functions. The high-level Descartes Load Intensity Meta-Model (hl-DLIM) allows the description of load variations using few defined parameters that characterize the seasonal patterns, trends, bursts, and noise parts. Using these parameters, hl-DLIM is capable of describing a subset of most common load intensity variations. During the work on this thesis I developed LIMBO - an Eclipse-based tool for modeling variable load intensity profiles based on DLIM and hl-DLIM as underlying modeling formalisms. LIMBO provides visualization for DLIM instances and a model creation wizard based on hl-DLIM parameters. It also offers three automated model extraction processes with which to extract DLIM and hl-DLIM instances from existing arrival rate traces. It also offers a model-to-model transformation from hl-DLIM to DLIM. I demonstrate that both meta-models are capable of capturing real-world load profiles with acceptable accuracy, having an average median deviation of 19.9\\% from the original trace. This is done by comparing nine different real life traces, which were measured over duration of two weeks to seven months, to their respective model instances as extracted by the automated model extraction processes. I also evaluate the usability and accessibility of LIMBO based on a questionnaire which was answered by eight computer scientists from five different organizations within the performance engineering community.}},\nauthor = {J\\\'{o}akim von Kistowski},\nkeywords = {Load Intensity, Model},\nschool = {{Karlsruhe Institute of Technology (KIT)}},\ntitle = {{Modeling Variations in Load Intensity Profiles}},\ntype = {{Master Thesis}},\nyear = {2014},\nmonth = {March},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/749.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/749},\nnote = {Gesellschaft zur F\\\"orderung des Forschungstransfers (GFFT) Prize \"Best Master Thesis\"}\n}\n
\n
\nToday\'s software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. Based on this observation, I identify the need for means allowing flexible definition of load profiles and address this by introducing two meta-models at different abstraction levels. At the lower abstraction level, the Descartes Load Intensity Meta-Model (DLIM) offers a structured and accessible way of describing the load intensity over time by editing and combining mathematical functions. The high-level Descartes Load Intensity Meta-Model (hl-DLIM) allows the description of load variations using few defined parameters that characterize the seasonal patterns, trends, bursts, and noise parts. Using these parameters, hl-DLIM is capable of describing a subset of most common load intensity variations. During the work on this thesis I developed LIMBO - an Eclipse-based tool for modeling variable load intensity profiles based on DLIM and hl-DLIM as underlying modeling formalisms. LIMBO provides visualization for DLIM instances and a model creation wizard based on hl-DLIM parameters. It also offers three automated model extraction processes with which to extract DLIM and hl-DLIM instances from existing arrival rate traces. It also offers a model-to-model transformation from hl-DLIM to DLIM. I demonstrate that both meta-models are capable of capturing real-world load profiles with acceptable accuracy, having an average median deviation of 19.9% from the original trace. This is done by comparing nine different real life traces, which were measured over duration of two weeks to seven months, to their respective model instances as extracted by the automated model extraction processes. I also evaluate the usability and accessibility of LIMBO based on a questionnaire which was answered by eight computer scientists from five different organizations within the performance engineering community.\n
\n','
\n@mastersthesis{Kistowski2014,\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  abstract = {{Today\'s software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. Based on this observation, I identify the need for means allowing flexible definition of load profiles and address this by introducing two meta-models at different abstraction levels. At the lower abstraction level, the Descartes Load Intensity Meta-Model (DLIM) offers a structured and accessible way of describing the load intensity over time by editing and combining mathematical functions. The high-level Descartes Load Intensity Meta-Model (hl-DLIM) allows the description of load variations using few defined parameters that characterize the seasonal patterns, trends, bursts, and noise parts. Using these parameters, hl-DLIM is capable of describing a subset of most common load intensity variations. During the work on this thesis I developed LIMBO - an Eclipse-based tool for modeling variable load intensity profiles based on DLIM and hl-DLIM as underlying modeling formalisms. LIMBO provides visualization for DLIM instances and a model creation wizard based on hl-DLIM parameters. It also offers three automated model extraction processes with which to extract DLIM and hl-DLIM instances from existing arrival rate traces. It also offers a model-to-model transformation from hl-DLIM to DLIM. I demonstrate that both meta-models are capable of capturing real-world load profiles with acceptable accuracy, having an average median deviation of 19.9\\% from the original trace. This is done by comparing nine different real life traces, which were measured over duration of two weeks to seven months, to their respective model instances as extracted by the automated model extraction processes. I also evaluate the usability and accessibility of LIMBO based on a questionnaire which was answered by eight computer scientists from five different organizations within the performance engineering community.}},\n  author = {J\\\'{o}akim von Kistowski},\n  keywords = {Load Intensity, Model},\n  school = {{Karlsruhe Institute of Technology (KIT)}},\n  title = {{Modeling Variations in Load Intensity Profiles}},\n  type = {{Master Thesis}},\n  year = {2014},\n  month = {March},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/749.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/749},\n  note = {Gesellschaft zur F\\\"orderung des Forschungstransfers (GFFT) Prize \"Best Master Thesis\"}\n}\n
\n\n','{Today\'s software systems are expected to deliver reliable performance under highly variable load intensities while at the same time making efficient use of dynamically allocated resources. Conventional benchmarking frameworks provide limited support for emulating such highly variable and dynamic load profiles and workload scenarios. Industrial benchmarks typically use workloads with constant or stepwise increasing load intensity, or they simply replay recorded workload traces. Based on this observation, I identify the need for means allowing flexible definition of load profiles and address this by introducing two meta-models at different abstraction levels. At the lower abstraction level, the Descartes Load Intensity Meta-Model (DLIM) offers a structured and accessible way of describing the load intensity over time by editing and combining mathematical functions. The high-level Descartes Load Intensity Meta-Model (hl-DLIM) allows the description of load variations using few defined parameters that characterize the seasonal patterns, trends, bursts, and noise parts. Using these parameters, hl-DLIM is capable of describing a subset of most common load intensity variations. During the work on this thesis I developed LIMBO - an Eclipse-based tool for modeling variable load intensity profiles based on DLIM and hl-DLIM as underlying modeling formalisms. LIMBO provides visualization for DLIM instances and a model creation wizard based on hl-DLIM parameters. It also offers three automated model extraction processes with which to extract DLIM and hl-DLIM instances from existing arrival rate traces. It also offers a model-to-model transformation from hl-DLIM to DLIM. I demonstrate that both meta-models are capable of capturing real-world load profiles with acceptable accuracy, having an average median deviation of 19.9\\% from the original trace. This is done by comparing nine different real life traces, which were measured over duration of two weeks to seven months, to their respective model instances as extracted by the automated model extraction processes. I also evaluate the usability and accessibility of LIMBO based on a questionnaire which was answered by eight computer scientists from five different organizations within the performance engineering community.}','{Modeling Variations in Load Intensity Profiles}',0,3,2014,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(750,'paper','MiPaAnViKo2014-ISSRE-AnAnalHypHanVulns','inproceedings','@inproceedings{MiPaAnViKo2014-ISSRE-AnAnalHypHanVulns,\n abstract = {{Hypervisors are becoming increasingly ubiquitous with the growing proliferation of virtualized data centers. As a result, attackers are exploring vectors to attack hypervisors, against which an attack may be executed via several attack vectors such as device drivers, virtual machine exit events, or hypercalls. Hypercalls enable intrusions in hypervisors through their hypercall interfaces. Despite the importance, there is very limited publicly available information on vulnerabilities of hypercall handlers and attacks triggering them, which significantly hinders advances towards monitoring and securing these interfaces. In this paper, we characterize the hypercall attack surface based on analyzing a set of vulnerabilities of hypercall handlers. We systematize and discuss the errors that caused the considered vulnerabilities, and activities for executing attacks triggering them. We also demonstrate attacks triggering the considered vulnerabilities and analyze their effects. Finally, we suggest an action plan for improving the security of hypercall interfaces.}},\n author = {Aleksandar Milenkoski and Bryan D. Payne and Nuno Antunes and Marco Vieira and Samuel Kounev},\n title = {{Experience Report: An Analysis of Hypercall Handler Vulnerabilities}},\n location = {Naples, Italy},\n month = {November},\n booktitle = {{Proceedings of The 25th IEEE International Symposium on Software Reliability Engineering (ISSRE 2014) --- Research Track}},\n organization = {IEEE},\n publisher = {IEEE Computer Society},\n note = {Acceptance Rate: 25\\%, Best Paper Award Nomination},\n address = {{Washington DC, USA}},\n year = {2014},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/750},\n url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6982618},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/750.pdf},\n}\n\n','\n\nAleksandar Milenkoski, Bryan D. Payne, Nuno Antunes, Marco Vieira, and Samuel\nKounev.\nExperience Report: An Analysis of Hypercall Handler\nVulnerabilities.\nIn Proceedings of The 25th IEEE International Symposium on\nSoftware Reliability Engineering (ISSRE 2014) - Research Track, Naples,\nItaly, November 2014. IEEE, IEEE Computer Society, Washington DC, USA.\nNovember 2014, Acceptance Rate: 25%, Best Paper Award\nNomination.\n[ bib | slides | http | .pdf | Abstract  ] 
\n@inproceedings{MiPaAnViKo2014-ISSRE-AnAnalHypHanVulns,\nabstract = {{Hypervisors are becoming increasingly ubiquitous with the growing proliferation of virtualized data centers. As a result, attackers are exploring vectors to attack hypervisors, against which an attack may be executed via several attack vectors such as device drivers, virtual machine exit events, or hypercalls. Hypercalls enable intrusions in hypervisors through their hypercall interfaces. Despite the importance, there is very limited publicly available information on vulnerabilities of hypercall handlers and attacks triggering them, which significantly hinders advances towards monitoring and securing these interfaces. In this paper, we characterize the hypercall attack surface based on analyzing a set of vulnerabilities of hypercall handlers. We systematize and discuss the errors that caused the considered vulnerabilities, and activities for executing attacks triggering them. We also demonstrate attacks triggering the considered vulnerabilities and analyze their effects. Finally, we suggest an action plan for improving the security of hypercall interfaces.}},\nauthor = {Aleksandar Milenkoski and Bryan D. Payne and Nuno Antunes and Marco Vieira and Samuel Kounev},\ntitle = {{Experience Report: An Analysis of Hypercall Handler Vulnerabilities}},\nlocation = {Naples, Italy},\nmonth = {November},\nbooktitle = {{Proceedings of The 25th IEEE International Symposium on Software Reliability Engineering (ISSRE 2014) --- Research Track}},\norganization = {IEEE},\npublisher = {IEEE Computer Society},\nnote = {Acceptance Rate: 25\\%, Best Paper Award Nomination},\naddress = {{Washington DC, USA}},\nyear = {2014},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/750},\nurl = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6982618},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/750.pdf}\n}\n
\n
\nHypervisors are becoming increasingly ubiquitous with the growing proliferation of virtualized data centers. As a result, attackers are exploring vectors to attack hypervisors, against which an attack may be executed via several attack vectors such as device drivers, virtual machine exit events, or hypercalls. Hypercalls enable intrusions in hypervisors through their hypercall interfaces. Despite the importance, there is very limited publicly available information on vulnerabilities of hypercall handlers and attacks triggering them, which significantly hinders advances towards monitoring and securing these interfaces. In this paper, we characterize the hypercall attack surface based on analyzing a set of vulnerabilities of hypercall handlers. We systematize and discuss the errors that caused the considered vulnerabilities, and activities for executing attacks triggering them. We also demonstrate attacks triggering the considered vulnerabilities and analyze their effects. Finally, we suggest an action plan for improving the security of hypercall interfaces.\n
\n','
\n@inproceedings{MiPaAnViKo2014-ISSRE-AnAnalHypHanVulns,\n  abstract = {{Hypervisors are becoming increasingly ubiquitous with the growing proliferation of virtualized data centers. As a result, attackers are exploring vectors to attack hypervisors, against which an attack may be executed via several attack vectors such as device drivers, virtual machine exit events, or hypercalls. Hypercalls enable intrusions in hypervisors through their hypercall interfaces. Despite the importance, there is very limited publicly available information on vulnerabilities of hypercall handlers and attacks triggering them, which significantly hinders advances towards monitoring and securing these interfaces. In this paper, we characterize the hypercall attack surface based on analyzing a set of vulnerabilities of hypercall handlers. We systematize and discuss the errors that caused the considered vulnerabilities, and activities for executing attacks triggering them. We also demonstrate attacks triggering the considered vulnerabilities and analyze their effects. Finally, we suggest an action plan for improving the security of hypercall interfaces.}},\n  author = {Aleksandar Milenkoski and Bryan D. Payne and Nuno Antunes and Marco Vieira and Samuel Kounev},\n  title = {{Experience Report: An Analysis of Hypercall Handler Vulnerabilities}},\n  location = {Naples, Italy},\n  month = {November},\n  booktitle = {{Proceedings of The 25th IEEE International Symposium on Software Reliability Engineering (ISSRE 2014) --- Research Track}},\n  organization = {IEEE},\n  publisher = {IEEE Computer Society},\n  note = {Acceptance Rate: 25\\%, Best Paper Award Nomination},\n  address = {{Washington DC, USA}},\n  year = {2014},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/750},\n  url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6982618},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/750.pdf}\n}\n
\n\n','{Hypervisors are becoming increasingly ubiquitous with the growing proliferation of virtualized data centers. As a result, attackers are exploring vectors to attack hypervisors, against which an attack may be executed via several attack vectors such as device drivers, virtual machine exit events, or hypercalls. Hypercalls enable intrusions in hypervisors through their hypercall interfaces. Despite the importance, there is very limited publicly available information on vulnerabilities of hypercall handlers and attacks triggering them, which significantly hinders advances towards monitoring and securing these interfaces. In this paper, we characterize the hypercall attack surface based on analyzing a set of vulnerabilities of hypercall handlers. We systematize and discuss the errors that caused the considered vulnerabilities, and activities for executing attacks triggering them. We also demonstrate attacks triggering the considered vulnerabilities and analyze their effects. Finally, we suggest an action plan for improving the security of hypercall interfaces.}','{Experience Report: An Analysis of Hypercall Handler Vulnerabilities}',0,11,2014,11,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(751,'paper','KrLoKo2014_CLOUD_Framework','inproceedings','@inproceedings{KrLoKo2014_CLOUD_Framework,\n abstract = {{Software-as-a-Service (SaaS) often shares one single application instance among different tenants to reduce costs. However, sharing potentially leads to undesired influence from one tenant onto the performance observed by the others. This is a significant problem as performance is one of the major obstacles for cloud customers. The application does intentionally not manage hardware resources, and the operating system is not aware of application level entities like tenants which makes the performance control a challenge. In case the SaaS is hosted on a Platform-as-a-Service (PaaS), the SaaS developer usually wants to control performance-related issues according to individual needs, and available information is even more limited. Thus, it is difficult to control the performance of different tenants to keep them isolated. Existing work focuses on concrete methods to provide performance isolation in systems where the whole stack is under control. In this paper we present a concrete PaaS enhancement which enables application developers to realize isolation methods for their hosted SaaS application. In a case study we evaluated the applicability and effectiveness of the enhancement in different environments.}},\n author = {Rouven Krebs and Manuel Loesch and Samuel Kounev},\n booktitle = {Proceedings of the 7th IEEE International Conference on Cloud Computing (IEEE Cloud 2014)},\n day = {2},\n location = {Anchorage, USA},\n month = {July},\n publisher = {IEEE},\n title = {{Platform-as-a-Service Architecture for Performance Isolated Multi-Tenant Applications}},\n year = {2014},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/751.pdf},\n}\n\n','\n\nRouven Krebs, Manuel Loesch, and Samuel Kounev.\nPlatform-as-a-Service Architecture for Performance Isolated\nMulti-Tenant Applications.\nIn Proceedings of the 7th IEEE International Conference on Cloud\nComputing (IEEE Cloud 2014), Anchorage, USA, July 2, 2014. IEEE.\nJuly 2014.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{KrLoKo2014_CLOUD_Framework,\nabstract = {{Software-as-a-Service (SaaS) often shares one single application instance among different tenants to reduce costs. However, sharing potentially leads to undesired influence from one tenant onto the performance observed by the others. This is a significant problem as performance is one of the major obstacles for cloud customers. The application does intentionally not manage hardware resources, and the operating system is not aware of application level entities like tenants which makes the performance control a challenge. In case the SaaS is hosted on a Platform-as-a-Service (PaaS), the SaaS developer usually wants to control performance-related issues according to individual needs, and available information is even more limited. Thus, it is difficult to control the performance of different tenants to keep them isolated. Existing work focuses on concrete methods to provide performance isolation in systems where the whole stack is under control. In this paper we present a concrete PaaS enhancement which enables application developers to realize isolation methods for their hosted SaaS application. In a case study we evaluated the applicability and effectiveness of the enhancement in different environments.}},\nauthor = {Rouven Krebs and Manuel Loesch and Samuel Kounev},\nbooktitle = {Proceedings of the 7th IEEE International Conference on Cloud Computing (IEEE Cloud 2014)},\nday = {2},\nlocation = {Anchorage, USA},\nmonth = {July},\npublisher = {IEEE},\ntitle = {{Platform-as-a-Service Architecture for Performance Isolated Multi-Tenant Applications}},\nyear = {2014},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/751.pdf}\n}\n
\n
\nSoftware-as-a-Service (SaaS) often shares one single application instance among different tenants to reduce costs. However, sharing potentially leads to undesired influence from one tenant onto the performance observed by the others. This is a significant problem as performance is one of the major obstacles for cloud customers. The application does intentionally not manage hardware resources, and the operating system is not aware of application level entities like tenants which makes the performance control a challenge. In case the SaaS is hosted on a Platform-as-a-Service (PaaS), the SaaS developer usually wants to control performance-related issues according to individual needs, and available information is even more limited. Thus, it is difficult to control the performance of different tenants to keep them isolated. Existing work focuses on concrete methods to provide performance isolation in systems where the whole stack is under control. In this paper we present a concrete PaaS enhancement which enables application developers to realize isolation methods for their hosted SaaS application. In a case study we evaluated the applicability and effectiveness of the enhancement in different environments.\n
\n','
\n@inproceedings{KrLoKo2014_CLOUD_Framework,\n  abstract = {{Software-as-a-Service (SaaS) often shares one single application instance among different tenants to reduce costs. However, sharing potentially leads to undesired influence from one tenant onto the performance observed by the others. This is a significant problem as performance is one of the major obstacles for cloud customers. The application does intentionally not manage hardware resources, and the operating system is not aware of application level entities like tenants which makes the performance control a challenge. In case the SaaS is hosted on a Platform-as-a-Service (PaaS), the SaaS developer usually wants to control performance-related issues according to individual needs, and available information is even more limited. Thus, it is difficult to control the performance of different tenants to keep them isolated. Existing work focuses on concrete methods to provide performance isolation in systems where the whole stack is under control. In this paper we present a concrete PaaS enhancement which enables application developers to realize isolation methods for their hosted SaaS application. In a case study we evaluated the applicability and effectiveness of the enhancement in different environments.}},\n  author = {Rouven Krebs and Manuel Loesch and Samuel Kounev},\n  booktitle = {Proceedings of the 7th IEEE International Conference on Cloud Computing (IEEE Cloud 2014)},\n  day = {2},\n  location = {Anchorage, USA},\n  month = {July},\n  publisher = {IEEE},\n  title = {{Platform-as-a-Service Architecture for Performance Isolated Multi-Tenant Applications}},\n  year = {2014},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/751.pdf}\n}\n
\n\n','{Software-as-a-Service (SaaS) often shares one single application instance among different tenants to reduce costs. However, sharing potentially leads to undesired influence from one tenant onto the performance observed by the others. This is a significant problem as performance is one of the major obstacles for cloud customers. The application does intentionally not manage hardware resources, and the operating system is not aware of application level entities like tenants which makes the performance control a challenge. In case the SaaS is hosted on a Platform-as-a-Service (PaaS), the SaaS developer usually wants to control performance-related issues according to individual needs, and available information is even more limited. Thus, it is difficult to control the performance of different tenants to keep them isolated. Existing work focuses on concrete methods to provide performance isolation in systems where the whole stack is under control. In this paper we present a concrete PaaS enhancement which enables application developers to realize isolation methods for their hosted SaaS application. In a case study we evaluated the applicability and effectiveness of the enhancement in different environments.}','{Platform-as-a-Service Architecture for Performance Isolated Multi-Tenant Applications}',0,7,2014,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(752,'paper','LoKr2014-CCIS-LocationsForIsolation','inproceedings','@inproceedings{LoKr2014-CCIS-LocationsForIsolation,\n author = {Manuel Loesch and Rouven Krebs},\n title = {{Locations for Performance Ensuring Admission Control in Load Balanced Multi-Tenant Systems}},\n booktitle = {Communications in Computer and Information Science - Third International Conference, CLOSER 2013, Aachen, Germany, May 8-10, 2013, Selected Papers},\n editor = {Springer},\n year = {2014},\n month = {May},\n abstract = {In the context of Software as a Service offerings, multi-tenant applications (MTAs) allow to increase the efficiency by sharing one application instance among several customers. Due to the tight coupling and sharing of resources on all layers up to the application layer, customers may influence each other with regards to the performance they observe. Existing research on performance isolation of MTAs focuses on methods and concrete algorithms. In this paper, we present concerns that are raised when serving a high amount of users in a load balancing cluster with multiple MTA instances. We identified potential positions in such an architecture where performance isolation can be enforced based on request admission control. Considering various approaches for request-to-instance allocation, our discussion shows that different positions come along with specific pros and cons that have influence on the ability to performance-isolate tenants.},\n}\n\n','\n\nManuel Loesch and Rouven Krebs.\nLocations for Performance Ensuring Admission Control in Load\nBalanced Multi-Tenant Systems.\nIn Communications in Computer and Information Science - Third\nInternational Conference, CLOSER 2013, Aachen, Germany, May 8-10, 2013,\nSelected Papers, Springer, editor, May 2014.\n[ bib | Abstract  ] 
\n@inproceedings{LoKr2014-CCIS-LocationsForIsolation,\nauthor = {Manuel Loesch and Rouven Krebs},\ntitle = {{Locations for Performance Ensuring Admission Control in Load Balanced Multi-Tenant Systems}},\nbooktitle = {Communications in Computer and Information Science - Third International Conference, CLOSER 2013, Aachen, Germany, May 8-10, 2013, Selected Papers},\neditor = {Springer},\nyear = {2014},\nmonth = {May},\nabstract = {In the context of Software as a Service offerings, multi-tenant applications (MTAs) allow to increase the efficiency by sharing one application instance among several customers. Due to the tight coupling and sharing of resources on all layers up to the application layer, customers may influence each other with regards to the performance they observe. Existing research on performance isolation of MTAs focuses on methods and concrete algorithms. In this paper, we present concerns that are raised when serving a high amount of users in a load balancing cluster with multiple MTA instances. We identified potential positions in such an architecture where performance isolation can be enforced based on request admission control. Considering various approaches for request-to-instance allocation, our discussion shows that different positions come along with specific pros and cons that have influence on the ability to performance-isolate tenants.}\n}\n
\n
\nIn the context of Software as a Service offerings, multi-tenant applications (MTAs) allow to increase the efficiency by sharing one application instance among several customers. Due to the tight coupling and sharing of resources on all layers up to the application layer, customers may influence each other with regards to the performance they observe. Existing research on performance isolation of MTAs focuses on methods and concrete algorithms. In this paper, we present concerns that are raised when serving a high amount of users in a load balancing cluster with multiple MTA instances. We identified potential positions in such an architecture where performance isolation can be enforced based on request admission control. Considering various approaches for request-to-instance allocation, our discussion shows that different positions come along with specific pros and cons that have influence on the ability to performance-isolate tenants.\n
\n','
\n@inproceedings{LoKr2014-CCIS-LocationsForIsolation,\n  author = {Manuel Loesch and Rouven Krebs},\n  title = {{Locations for Performance Ensuring Admission Control in Load Balanced Multi-Tenant Systems}},\n  booktitle = {Communications in Computer and Information Science - Third International Conference, CLOSER 2013, Aachen, Germany, May 8-10, 2013, Selected Papers},\n  editor = {Springer},\n  year = {2014},\n  month = {May},\n  abstract = {In the context of Software as a Service offerings, multi-tenant applications (MTAs) allow to increase the efficiency by sharing one application instance among several customers. Due to the tight coupling and sharing of resources on all layers up to the application layer, customers may influence each other with regards to the performance they observe. Existing research on performance isolation of MTAs focuses on methods and concrete algorithms. In this paper, we present concerns that are raised when serving a high amount of users in a load balancing cluster with multiple MTA instances. We identified potential positions in such an architecture where performance isolation can be enforced based on request admission control. Considering various approaches for request-to-instance allocation, our discussion shows that different positions come along with specific pros and cons that have influence on the ability to performance-isolate tenants.}\n}\n
\n\n','In the context of Software as a Service offerings, multi-tenant applications (MTAs) allow to increase the efficiency by sharing one application instance among several customers. Due to the tight coupling and sharing of resources on all layers up to the application layer, customers may influence each other with regards to the performance they observe. Existing research on performance isolation of MTAs focuses on methods and concrete algorithms. In this paper, we present concerns that are raised when serving a high amount of users in a load balancing cluster with multiple MTA instances. We identified potential positions in such an architecture where performance isolation can be enforced based on request admission control. Considering various approaches for request-to-instance allocation, our discussion shows that different positions come along with specific pros and cons that have influence on the ability to performance-isolate tenants.','{Locations for Performance Ensuring Admission Control in Load Balanced Multi-Tenant Systems}',0,5,2014,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:02',0),(754,'paper','BrMeBeKoKoKo2014-TSE-ModelSolutionTradeOffs','article','@article{BrMeBeKoKoKo2014-TSE-ModelSolutionTradeOffs,\n author = {Fabian Brosig and Philipp Meier and Steffen Becker and Anne Koziolek and Heiko Koziolek and Samuel Kounev},\n journal = {IEEE Transactions on Software Engineering (TSE)},\n publisher = {IEEE},\n title = {{Quantitative Evaluation of Model-Driven Performance Analysis and Simulation of Component-based Architectures}},\n volume = {41},\n number = {2},\n pages = {157--175},\n year = {2015},\n month = {{February}},\n url = {http://dx.doi.org/10.1109/TSE.2014.2362755},\n doi = {10.1109/TSE.2014.2362755},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/754.pdf},\n}\n\n','\n\nFabian Brosig, Philipp Meier, Steffen Becker, Anne Koziolek, Heiko Koziolek,\nand Samuel Kounev.\nQuantitative Evaluation of Model-Driven Performance Analysis and\nSimulation of Component-based Architectures.\nIEEE Transactions on Software Engineering (TSE),\n41(2):157-175, February 2015, IEEE.\n[ bib | DOI | http | .pdf  ] 
\n@article{BrMeBeKoKoKo2014-TSE-ModelSolutionTradeOffs,\nauthor = {Fabian Brosig and Philipp Meier and Steffen Becker and Anne Koziolek and Heiko Koziolek and Samuel Kounev},\njournal = {IEEE Transactions on Software Engineering (TSE)},\npublisher = {IEEE},\ntitle = {{Quantitative Evaluation of Model-Driven Performance Analysis and Simulation of Component-based Architectures}},\nvolume = {41},\nnumber = {2},\npages = {157--175},\nyear = {2015},\nmonth = {{February}},\nurl = {http://dx.doi.org/10.1109/TSE.2014.2362755},\ndoi = {10.1109/TSE.2014.2362755},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/754.pdf}\n}\n
\n
\n','
\n@article{BrMeBeKoKoKo2014-TSE-ModelSolutionTradeOffs,\n  author = {Fabian Brosig and Philipp Meier and Steffen Becker and Anne Koziolek and Heiko Koziolek and Samuel Kounev},\n  journal = {IEEE Transactions on Software Engineering (TSE)},\n  publisher = {IEEE},\n  title = {{Quantitative Evaluation of Model-Driven Performance Analysis and Simulation of Component-based Architectures}},\n  volume = {41},\n  number = {2},\n  pages = {157--175},\n  year = {2015},\n  month = {{February}},\n  url = {http://dx.doi.org/10.1109/TSE.2014.2362755},\n  doi = {10.1109/TSE.2014.2362755},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/754.pdf}\n}\n
\n\n',NULL,'{Quantitative Evaluation of Model-Driven Performance Analysis and Simulation of Component-based Architectures}',0,2,2015,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(755,'paper','Kr2014-uspatent-Controller','misc','@misc{Kr2014-uspatent-Controller,\n author = {Krebs, Rouven and Mehta, Arpit},\n howpublished = {US Patent Application No 13/972,477},\n title = {Multi-Stage Feedback controller for prioritizing tenants for Multi-Tenant application},\n year = {2013},\n}\n\n','\n\nRouven Krebs and Arpit Mehta.\nMulti-stage feedback controller for prioritizing tenants for\nmulti-tenant application.\nUS Patent Application No 13/972,477, 2013.\n[ bib  ] 
\n@misc{Kr2014-uspatent-Controller,\nauthor = {Krebs, Rouven and Mehta, Arpit},\nhowpublished = {US Patent Application No 13/972,477},\ntitle = {Multi-Stage Feedback controller for prioritizing tenants for Multi-Tenant application},\nyear = {2013}\n}\n
\n
\n','
\n@misc{Kr2014-uspatent-Controller,\n  author = {Krebs, Rouven and Mehta, Arpit},\n  howpublished = {US Patent Application No 13/972,477},\n  title = {Multi-Stage Feedback controller for prioritizing tenants for Multi-Tenant application},\n  year = {2013}\n}\n
\n\n',NULL,'Multi-Stage Feedback controller for prioritizing tenants for Multi-Tenant application',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(756,'paper','Kr2014-uspatent-Probabilistic','misc','@misc{Kr2014-uspatent-Probabilistic,\n author = {Mehta, Arpit and Krebs, Rouven},\n howpublished = {US Patent Application No 13/904,729},\n title = {Probabilistic tenant selection in quota enforcing Request Admission mechanisms for Shared Applications},\n year = {2013},\n}\n\n','\n\nArpit Mehta and Rouven Krebs.\nProbabilistic tenant selection in quota enforcing request admission\nmechanisms for shared applications.\nUS Patent Application No 13/904,729, 2013.\n[ bib  ] 
\n@misc{Kr2014-uspatent-Probabilistic,\nauthor = {Mehta, Arpit and Krebs, Rouven},\nhowpublished = {US Patent Application No 13/904,729},\ntitle = {Probabilistic tenant selection in quota enforcing Request Admission mechanisms for Shared Applications},\nyear = {2013}\n}\n
\n
\n','
\n@misc{Kr2014-uspatent-Probabilistic,\n  author = {Mehta, Arpit and Krebs, Rouven},\n  howpublished = {US Patent Application No 13/904,729},\n  title = {Probabilistic tenant selection in quota enforcing Request Admission mechanisms for Shared Applications},\n  year = {2013}\n}\n
\n\n',NULL,'Probabilistic tenant selection in quota enforcing Request Admission mechanisms for Shared Applications',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(757,'paper','Kr2014-uspatent-ResourceControl','misc','@misc{Kr2014-uspatent-ResourceControl,\n author = {Krebs, Rouven and Mehta, Arpit},\n howpublished = {US Patent Application No 14/079,289},\n title = {Application Level Based Resource Management in Multi-Tenant Applications},\n year = {2013},\n}\n\n','\n\nRouven Krebs and Arpit Mehta.\nApplication level based resource management in multi-tenant\napplications.\nUS Patent Application No 14/079,289, 2013.\n[ bib  ] 
\n@misc{Kr2014-uspatent-ResourceControl,\nauthor = {Krebs, Rouven and Mehta, Arpit},\nhowpublished = {US Patent Application No 14/079,289},\ntitle = {Application Level Based Resource Management in Multi-Tenant Applications},\nyear = {2013}\n}\n
\n
\n','
\n@misc{Kr2014-uspatent-ResourceControl,\n  author = {Krebs, Rouven and Mehta, Arpit},\n  howpublished = {US Patent Application No 14/079,289},\n  title = {Application Level Based Resource Management in Multi-Tenant Applications},\n  year = {2013}\n}\n
\n\n',NULL,'Application Level Based Resource Management in Multi-Tenant Applications',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(758,'paper','MiViPaAnKo2014-TechReport-TechInformation','techreport','@techreport{MiViPaAnKo2014-TechReport-TechInformation,\n abstract = {{Modern virtualized service infrastructures expose attack vectors that enable attacks of high severity, such as attacks targeting hypervisors. A malicious user of a guest VM (virtual machine) may execute an attack against the underlying hypervisor via hypercalls, which are software traps from a kernel of a fully or partially paravirtualized guest VM to the hypervisor. The exploitation of a vulnerability of a hypercall handler may have severe consequences such as altering hypervisor\'s memory, which may result in the execution of malicious code with hypervisor privilege. Despite the importance of vulnerabilities of hypercall handlers, there is not much publicly available information on them. This significantly hinders advances towards securing hypercall interfaces. In this work, we provide in-depth technical information on publicly disclosed vulnerabilities of hypercall handlers. Our vulnerability analysis is based on reverse engineering the released patches fixing the considered vulnerabilities. For each analyzed vulnerability, we provide background information essential for understanding the vulnerability, and information on the vulnerable hypercall handler and the error causing the vulnerability. We also show how the vulnerability can be triggered and discuss the state of the targeted hypervisor after the vulnerability has been triggered.}},\n address = {{7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}},\n author = {Aleksandar Milenkoski and Marco Vieira and Bryan D. Payne and Nuno Antunes and Samuel Kounev},\n institution = {SPEC Research Group - IDS Benchmarking Working Group, Standard Performance Evaluation Corporation (SPEC)},\n month = {August},\n pdf = {http://research.spec.org/fileadmin/user_upload/documents/wg_ids/endorsed_publications/SPEC-RG-2014-001_HypercallVulnerabilities.pdf},\n title = {{Technical Information on Vulnerabilities of Hypercall Handlers}},\n type = {{Technical Report SPEC-RG-2014-001 v.1.0}},\n year = {2014},\n}\n\n','\n\nAleksandar Milenkoski, Marco Vieira, Bryan D. Payne, Nuno Antunes, and Samuel\nKounev.\nTechnical Information on Vulnerabilities of Hypercall Handlers.\nTechnical Report SPEC-RG-2014-001 v.1.0, SPEC Research Group - IDS\nBenchmarking Working Group, Standard Performance Evaluation Corporation\n(SPEC), 7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA,\nAugust 2014.\n[ bib | .pdf | Abstract  ] 
\n@techreport{MiViPaAnKo2014-TechReport-TechInformation,\nabstract = {{Modern virtualized service infrastructures expose attack vectors that enable attacks of high severity, such as attacks targeting hypervisors. A malicious user of a guest VM (virtual machine) may execute an attack against the underlying hypervisor via hypercalls, which are software traps from a kernel of a fully or partially paravirtualized guest VM to the hypervisor. The exploitation of a vulnerability of a hypercall handler may have severe consequences such as altering hypervisor\'s memory, which may result in the execution of malicious code with hypervisor privilege. Despite the importance of vulnerabilities of hypercall handlers, there is not much publicly available information on them. This significantly hinders advances towards securing hypercall interfaces. In this work, we provide in-depth technical information on publicly disclosed vulnerabilities of hypercall handlers. Our vulnerability analysis is based on reverse engineering the released patches fixing the considered vulnerabilities. For each analyzed vulnerability, we provide background information essential for understanding the vulnerability, and information on the vulnerable hypercall handler and the error causing the vulnerability. We also show how the vulnerability can be triggered and discuss the state of the targeted hypervisor after the vulnerability has been triggered.}},\naddress = {{7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}},\nauthor = {Aleksandar Milenkoski and Marco Vieira and Bryan D. Payne and Nuno Antunes and Samuel Kounev},\ninstitution = {SPEC Research Group - IDS Benchmarking Working Group, Standard Performance Evaluation Corporation (SPEC)},\nmonth = {August},\npdf = {http://research.spec.org/fileadmin/user_upload/documents/wg_ids/endorsed_publications/SPEC-RG-2014-001_HypercallVulnerabilities.pdf},\ntitle = {{Technical Information on Vulnerabilities of Hypercall Handlers}},\ntype = {{Technical Report SPEC-RG-2014-001 v.1.0}},\nyear = {2014}\n}\n
\n
\nModern virtualized service infrastructures expose attack vectors that enable attacks of high severity, such as attacks targeting hypervisors. A malicious user of a guest VM (virtual machine) may execute an attack against the underlying hypervisor via hypercalls, which are software traps from a kernel of a fully or partially paravirtualized guest VM to the hypervisor. The exploitation of a vulnerability of a hypercall handler may have severe consequences such as altering hypervisor\'s memory, which may result in the execution of malicious code with hypervisor privilege. Despite the importance of vulnerabilities of hypercall handlers, there is not much publicly available information on them. This significantly hinders advances towards securing hypercall interfaces. In this work, we provide in-depth technical information on publicly disclosed vulnerabilities of hypercall handlers. Our vulnerability analysis is based on reverse engineering the released patches fixing the considered vulnerabilities. For each analyzed vulnerability, we provide background information essential for understanding the vulnerability, and information on the vulnerable hypercall handler and the error causing the vulnerability. We also show how the vulnerability can be triggered and discuss the state of the targeted hypervisor after the vulnerability has been triggered.\n
\n','
\n@techreport{MiViPaAnKo2014-TechReport-TechInformation,\n  abstract = {{Modern virtualized service infrastructures expose attack vectors that enable attacks of high severity, such as attacks targeting hypervisors. A malicious user of a guest VM (virtual machine) may execute an attack against the underlying hypervisor via hypercalls, which are software traps from a kernel of a fully or partially paravirtualized guest VM to the hypervisor. The exploitation of a vulnerability of a hypercall handler may have severe consequences such as altering hypervisor\'s memory, which may result in the execution of malicious code with hypervisor privilege. Despite the importance of vulnerabilities of hypercall handlers, there is not much publicly available information on them. This significantly hinders advances towards securing hypercall interfaces. In this work, we provide in-depth technical information on publicly disclosed vulnerabilities of hypercall handlers. Our vulnerability analysis is based on reverse engineering the released patches fixing the considered vulnerabilities. For each analyzed vulnerability, we provide background information essential for understanding the vulnerability, and information on the vulnerable hypercall handler and the error causing the vulnerability. We also show how the vulnerability can be triggered and discuss the state of the targeted hypervisor after the vulnerability has been triggered.}},\n  address = {{7001 Heritage Village Plaza Suite 225, Gainesville, VA 20155, USA}},\n  author = {Aleksandar Milenkoski and Marco Vieira and Bryan D. Payne and Nuno Antunes and Samuel Kounev},\n  institution = {SPEC Research Group - IDS Benchmarking Working Group, Standard Performance Evaluation Corporation (SPEC)},\n  month = {August},\n  pdf = {http://research.spec.org/fileadmin/user_upload/documents/wg_ids/endorsed_publications/SPEC-RG-2014-001_HypercallVulnerabilities.pdf},\n  title = {{Technical Information on Vulnerabilities of Hypercall Handlers}},\n  type = {{Technical Report SPEC-RG-2014-001 v.1.0}},\n  year = {2014}\n}\n
\n\n','{Modern virtualized service infrastructures expose attack vectors that enable attacks of high severity, such as attacks targeting hypervisors. A malicious user of a guest VM (virtual machine) may execute an attack against the underlying hypervisor via hypercalls, which are software traps from a kernel of a fully or partially paravirtualized guest VM to the hypervisor. The exploitation of a vulnerability of a hypercall handler may have severe consequences such as altering hypervisor\'s memory, which may result in the execution of malicious code with hypervisor privilege. Despite the importance of vulnerabilities of hypercall handlers, there is not much publicly available information on them. This significantly hinders advances towards securing hypercall interfaces. In this work, we provide in-depth technical information on publicly disclosed vulnerabilities of hypercall handlers. Our vulnerability analysis is based on reverse engineering the released patches fixing the considered vulnerabilities. For each analyzed vulnerability, we provide background information essential for understanding the vulnerability, and information on the vulnerable hypercall handler and the error causing the vulnerability. We also show how the vulnerability can be triggered and discuss the state of the targeted hypervisor after the vulnerability has been triggered.}','{Technical Information on Vulnerabilities of Hypercall Handlers}',0,8,2014,8,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(759,'paper','Huber2014-KIT-AutonomicPerformanceAwareResourceManagement','phdthesis','@phdthesis{Huber2014-KIT-AutonomicPerformanceAwareResourceManagement,\n author = {Nikolaus Huber},\n title = {Autonomic Performance-Aware Resource Management in Dynamic IT Service Infrastructures},\n year = {2014},\n month = {July},\n school = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\n url = {http://nbn-resolving.org/urn:nbn:de:swb:90-432462},\n pdf = {http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3234008},\n}\n\n','\n\nNikolaus Huber.\nAutonomic Performance-Aware Resource Management in Dynamic IT\nService Infrastructures.\nPhD thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, July 2014.\n[ bib | http | http  ] 
\n@phdthesis{Huber2014-KIT-AutonomicPerformanceAwareResourceManagement,\nauthor = {Nikolaus Huber},\ntitle = {Autonomic Performance-Aware Resource Management in Dynamic IT Service Infrastructures},\nyear = {2014},\nmonth = {July},\nschool = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\nurl = {http://nbn-resolving.org/urn:nbn:de:swb:90-432462},\npdf = {http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3234008}\n}\n
\n
\n','
\n@phdthesis{Huber2014-KIT-AutonomicPerformanceAwareResourceManagement,\n  author = {Nikolaus Huber},\n  title = {Autonomic Performance-Aware Resource Management in Dynamic IT Service Infrastructures},\n  year = {2014},\n  month = {July},\n  school = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\n  url = {http://nbn-resolving.org/urn:nbn:de:swb:90-432462},\n  pdf = {http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3234008}\n}\n
\n\n',NULL,'Autonomic Performance-Aware Resource Management in Dynamic IT Service Infrastructures',0,7,2014,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(760,'paper','nehmeierScan2010','article','@article{nehmeierScan2010,\n abstract = {In this paper we will discuss different realizations for an efficient interval arithmetic implementation using expression templates and template meta programming in C++. We will improve the handling of the rounding mode switches using expression templates and show how the constructed expression trees can be combined with other features like automatic differentiation. For a further improvement of the run time performance we try to move as many functionality as possible to the compile time using template meta programming techniques. In addition we will illustrate how an interval arithmetic implementation will profit from new features and keywords defined in the upcoming C++ standard.},\n year = {2012},\n issn = {0010-485X},\n journal = {Computing},\n volume = {94},\n number = {2-4},\n doi = {10.1007/s00607-011-0176-6},\n title = {Interval arithmetic using expression templates, template meta programming and the upcoming {C}++ standard},\n url = {http://dx.doi.org/10.1007/s00607-011-0176-6},\n publisher = {Springer Vienna},\n keywords = {Interval arithmetic; Automatic differentiation; Expression templates; Template meta programming; Compile time code optimization; C++; C++0x; 65G40; 65Y04; 68N15; 68N19; 68W30},\n author = {Nehmeier, Marco},\n pages = {215-228},\n language = {English},\n}\n\n','\n\nMarco Nehmeier.\nInterval arithmetic using expression templates, template meta\nprogramming and the upcoming C++ standard.\nComputing, 94(2-4):215-228, 2012, Springer Vienna.\n[ bib | DOI | http | Abstract  ] 
\n@article{nehmeierScan2010,\nabstract = {In this paper we will discuss different realizations for an efficient interval arithmetic implementation using expression templates and template meta programming in C++. We will improve the handling of the rounding mode switches using expression templates and show how the constructed expression trees can be combined with other features like automatic differentiation. For a further improvement of the run time performance we try to move as many functionality as possible to the compile time using template meta programming techniques. In addition we will illustrate how an interval arithmetic implementation will profit from new features and keywords defined in the upcoming C++ standard.},\nyear = {2012},\nissn = {0010-485X},\njournal = {Computing},\nvolume = {94},\nnumber = {2-4},\ndoi = {10.1007/s00607-011-0176-6},\ntitle = {Interval arithmetic using expression templates, template meta programming and the upcoming {C}++ standard},\nurl = {http://dx.doi.org/10.1007/s00607-011-0176-6},\npublisher = {Springer Vienna},\nkeywords = {Interval arithmetic; Automatic differentiation; Expression templates; Template meta programming; Compile time code optimization; C++; C++0x; 65G40; 65Y04; 68N15; 68N19; 68W30},\nauthor = {Nehmeier, Marco},\npages = {215-228},\nlanguage = {English}\n}\n
\n
\nIn this paper we will discuss different realizations for an efficient interval arithmetic implementation using expression templates and template meta programming in C++. We will improve the handling of the rounding mode switches using expression templates and show how the constructed expression trees can be combined with other features like automatic differentiation. For a further improvement of the run time performance we try to move as many functionality as possible to the compile time using template meta programming techniques. In addition we will illustrate how an interval arithmetic implementation will profit from new features and keywords defined in the upcoming C++ standard.\n
\n','
\n@article{nehmeierScan2010,\n  abstract = {In this paper we will discuss different realizations for an efficient interval arithmetic implementation using expression templates and template meta programming in C++. We will improve the handling of the rounding mode switches using expression templates and show how the constructed expression trees can be combined with other features like automatic differentiation. For a further improvement of the run time performance we try to move as many functionality as possible to the compile time using template meta programming techniques. In addition we will illustrate how an interval arithmetic implementation will profit from new features and keywords defined in the upcoming C++ standard.},\n  year = {2012},\n  issn = {0010-485X},\n  journal = {Computing},\n  volume = {94},\n  number = {2-4},\n  doi = {10.1007/s00607-011-0176-6},\n  title = {Interval arithmetic using expression templates, template meta programming and the upcoming {C}++ standard},\n  url = {http://dx.doi.org/10.1007/s00607-011-0176-6},\n  publisher = {Springer Vienna},\n  keywords = {Interval arithmetic; Automatic differentiation; Expression templates; Template meta programming; Compile time code optimization; C++; C++0x; 65G40; 65Y04; 68N15; 68N19; 68W30},\n  author = {Nehmeier, Marco},\n  pages = {215-228},\n  language = {English}\n}\n
\n\n','In this paper we will discuss different realizations for an efficient interval arithmetic implementation using expression templates and template meta programming in C++. We will improve the handling of the rounding mode switches using expression templates and show how the constructed expression trees can be combined with other features like automatic differentiation. For a further improvement of the run time performance we try to move as many functionality as possible to the compile time using template meta programming techniques. In addition we will illustrate how an interval arithmetic implementation will profit from new features and keywords defined in the upcoming C++ standard.','Interval arithmetic using expression templates, template meta programming and the upcoming {C}++ standard',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(761,'paper','nehmeierPara2012','incollection','@incollection{nehmeierPara2012,\n abstract = {In this paper we discuss a parallel variant of the interval Newton method for root finding of non linear continuously differentiable functions on the CUDA architecture. For this purpose we have investigated different dynamic load balancing methods to get an evenly balanced workload during the parallel computation. We tested the functionality, correctness and performance of our implementation in different case studies and compared it with other implementations.},\n year = {2013},\n isbn = {978-3-642-36802-8},\n booktitle = {Applied Parallel and Scientific Computing},\n volume = {7782},\n series = {Lecture Notes in Computer Science},\n editor = {Manninen, Pekka and \\\"Oster, Per},\n doi = {10.1007/978-3-642-36803-5_34},\n title = {{P}arallel {I}nterval {N}ewton {M}ethod on {CUDA}},\n url = {http://dx.doi.org/10.1007/978-3-642-36803-5_34},\n publisher = {Springer Berlin Heidelberg},\n keywords = {Interval arithmetic; Interval Newton method; Parallel computing; Load balancing; CUDA; GPGPU},\n author = {Beck, Philip-Daniel and Nehmeier, Marco},\n pages = {454-464},\n language = {English},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/761.pdf},\n}\n\n','\n\nPhilip-Daniel Beck and Marco Nehmeier.\nParallel Interval Newton Method on CUDA.\nIn Applied Parallel and Scientific Computing, Pekka Manninen\nand Per Öster, editors, volume 7782 of Lecture Notes in Computer\nScience, pages 454-464. Springer Berlin Heidelberg, 2013.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@incollection{nehmeierPara2012,\nabstract = {In this paper we discuss a parallel variant of the interval Newton method for root finding of non linear continuously differentiable functions on the CUDA architecture. For this purpose we have investigated different dynamic load balancing methods to get an evenly balanced workload during the parallel computation. We tested the functionality, correctness and performance of our implementation in different case studies and compared it with other implementations.},\nyear = {2013},\nisbn = {978-3-642-36802-8},\nbooktitle = {Applied Parallel and Scientific Computing},\nvolume = {7782},\nseries = {Lecture Notes in Computer Science},\neditor = {Manninen, Pekka and \\\"Oster, Per},\ndoi = {10.1007/978-3-642-36803-5_34},\ntitle = {{P}arallel {I}nterval {N}ewton {M}ethod on {CUDA}},\nurl = {http://dx.doi.org/10.1007/978-3-642-36803-5_34},\npublisher = {Springer Berlin Heidelberg},\nkeywords = {Interval arithmetic; Interval Newton method; Parallel computing; Load balancing; CUDA; GPGPU},\nauthor = {Beck, Philip-Daniel and Nehmeier, Marco},\npages = {454-464},\nlanguage = {English},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/761.pdf}\n}\n
\n
\nIn this paper we discuss a parallel variant of the interval Newton method for root finding of non linear continuously differentiable functions on the CUDA architecture. For this purpose we have investigated different dynamic load balancing methods to get an evenly balanced workload during the parallel computation. We tested the functionality, correctness and performance of our implementation in different case studies and compared it with other implementations.\n
\n','
\n@incollection{nehmeierPara2012,\n  abstract = {In this paper we discuss a parallel variant of the interval Newton method for root finding of non linear continuously differentiable functions on the CUDA architecture. For this purpose we have investigated different dynamic load balancing methods to get an evenly balanced workload during the parallel computation. We tested the functionality, correctness and performance of our implementation in different case studies and compared it with other implementations.},\n  year = {2013},\n  isbn = {978-3-642-36802-8},\n  booktitle = {Applied Parallel and Scientific Computing},\n  volume = {7782},\n  series = {Lecture Notes in Computer Science},\n  editor = {Manninen, Pekka and \\\"Oster, Per},\n  doi = {10.1007/978-3-642-36803-5_34},\n  title = {{P}arallel {I}nterval {N}ewton {M}ethod on {CUDA}},\n  url = {http://dx.doi.org/10.1007/978-3-642-36803-5_34},\n  publisher = {Springer Berlin Heidelberg},\n  keywords = {Interval arithmetic; Interval Newton method; Parallel computing; Load balancing; CUDA; GPGPU},\n  author = {Beck, Philip-Daniel and Nehmeier, Marco},\n  pages = {454-464},\n  language = {English},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/761.pdf}\n}\n
\n\n','In this paper we discuss a parallel variant of the interval Newton method for root finding of non linear continuously differentiable functions on the CUDA architecture. For this purpose we have investigated different dynamic load balancing methods to get an evenly balanced workload during the parallel computation. We tested the functionality, correctness and performance of our implementation in different case studies and compared it with other implementations.','{P}arallel {I}nterval {N}ewton {M}ethod on {CUDA}',0,0,2013,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(762,'paper','nehmeierPPAM2011','incollection','@incollection{nehmeierPPAM2011,\n abstract = {In this paper we discuss the interaction of expression templates with OpenCL devices. We show how the expression tree of expression templates can be used to generate problem specific OpenCL kernels. In a second approach we use expression templates to optimize the data transfer between the host and the device which leads to a measurable performance increase in a domain specific language approach. We tested the functionality, correctness and performance for both implementations in a case study for vector and matrix operations.},\n year = {2012},\n isbn = {978-3-642-31499-5},\n booktitle = {Parallel Processing and Applied Mathematics},\n volume = {7204},\n series = {Lecture Notes in Computer Science},\n editor = {Wyrzykowski, Roman and Dongarra, Jack and Karczewski, Konrad and Wa\\\'sniewski, Jerzy},\n doi = {10.1007/978-3-642-31500-8_8},\n title = {{E}xpression {T}emplates and {OpenCL}},\n url = {http://dx.doi.org/10.1007/978-3-642-31500-8_8},\n publisher = {Springer Berlin Heidelberg},\n keywords = {GPGPU; OpenCL; C++; Expression templates; Domain specific language; Code generation},\n author = {Bawidamann, Uwe and Nehmeier, Marco},\n pages = {71-80},\n language = {English},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/762.pdf},\n}\n\n','\n\nUwe Bawidamann and Marco Nehmeier.\nExpression Templates and OpenCL.\nIn Parallel Processing and Applied Mathematics, Roman\nWyrzykowski, Jack Dongarra, Konrad Karczewski, and Jerzy Waśniewski,\neditors, volume 7204 of Lecture Notes in Computer Science, pages\n71-80. Springer Berlin Heidelberg, 2012.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@incollection{nehmeierPPAM2011,\nabstract = {In this paper we discuss the interaction of expression templates with OpenCL devices. We show how the expression tree of expression templates can be used to generate problem specific OpenCL kernels. In a second approach we use expression templates to optimize the data transfer between the host and the device which leads to a measurable performance increase in a domain specific language approach. We tested the functionality, correctness and performance for both implementations in a case study for vector and matrix operations.},\nyear = {2012},\nisbn = {978-3-642-31499-5},\nbooktitle = {Parallel Processing and Applied Mathematics},\nvolume = {7204},\nseries = {Lecture Notes in Computer Science},\neditor = {Wyrzykowski, Roman and Dongarra, Jack and Karczewski, Konrad and Wa\\\'sniewski, Jerzy},\ndoi = {10.1007/978-3-642-31500-8_8},\ntitle = {{E}xpression {T}emplates and {OpenCL}},\nurl = {http://dx.doi.org/10.1007/978-3-642-31500-8_8},\npublisher = {Springer Berlin Heidelberg},\nkeywords = {GPGPU; OpenCL; C++; Expression templates; Domain specific language; Code generation},\nauthor = {Bawidamann, Uwe and Nehmeier, Marco},\npages = {71-80},\nlanguage = {English},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/762.pdf}\n}\n
\n
\nIn this paper we discuss the interaction of expression templates with OpenCL devices. We show how the expression tree of expression templates can be used to generate problem specific OpenCL kernels. In a second approach we use expression templates to optimize the data transfer between the host and the device which leads to a measurable performance increase in a domain specific language approach. We tested the functionality, correctness and performance for both implementations in a case study for vector and matrix operations.\n
\n','
\n@incollection{nehmeierPPAM2011,\n  abstract = {In this paper we discuss the interaction of expression templates with OpenCL devices. We show how the expression tree of expression templates can be used to generate problem specific OpenCL kernels. In a second approach we use expression templates to optimize the data transfer between the host and the device which leads to a measurable performance increase in a domain specific language approach. We tested the functionality, correctness and performance for both implementations in a case study for vector and matrix operations.},\n  year = {2012},\n  isbn = {978-3-642-31499-5},\n  booktitle = {Parallel Processing and Applied Mathematics},\n  volume = {7204},\n  series = {Lecture Notes in Computer Science},\n  editor = {Wyrzykowski, Roman and Dongarra, Jack and Karczewski, Konrad and Wa\\\'sniewski, Jerzy},\n  doi = {10.1007/978-3-642-31500-8_8},\n  title = {{E}xpression {T}emplates and {OpenCL}},\n  url = {http://dx.doi.org/10.1007/978-3-642-31500-8_8},\n  publisher = {Springer Berlin Heidelberg},\n  keywords = {GPGPU; OpenCL; C++; Expression templates; Domain specific language; Code generation},\n  author = {Bawidamann, Uwe and Nehmeier, Marco},\n  pages = {71-80},\n  language = {English},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/762.pdf}\n}\n
\n\n','In this paper we discuss the interaction of expression templates with OpenCL devices. We show how the expression tree of expression templates can be used to generate problem specific OpenCL kernels. In a second approach we use expression templates to optimize the data transfer between the host and the device which leads to a measurable performance increase in a domain specific language approach. We tested the functionality, correctness and performance for both implementations in a case study for vector and matrix operations.','{E}xpression {T}emplates and {OpenCL}',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(763,'paper','nehmeierAD2012','incollection','@incollection{nehmeierAD2012,\n abstract = {In this paper we present a concept for a C++ implementation of forward automatic differentiation of an arbitrary order using expression templates and template metaprogramming. In contrast to other expression template implementations, the expression tree in our implementation has only symbolic characteristics. The run-time code is then generated from the tree structure using template metaprogramming functions to apply the rules of symbolic differentiation onto the single operations at compile-time. This generic approach has the advantage that the template metaprogramming functions are replaceable which offers the opportunity to easily generate different specialized algorithms. We tested the functionality, correctness and performance of a prototype in different case studies for floating point as well as interval data types and compared it against other implementations.},\n year = {2012},\n isbn = {978-3-642-30022-6},\n booktitle = {Recent Advances in Algorithmic Differentiation},\n volume = {87},\n series = {Lecture Notes in Computational Science and Engineering},\n editor = {Forth, Shaun and Hovland, Paul and Phipps, Eric and Utke, Jean and Walther, Andrea},\n doi = {10.1007/978-3-642-30023-3_24},\n title = {{G}enerative {P}rogramming for {A}utomatic {D}ifferentiation},\n url = {http://dx.doi.org/10.1007/978-3-642-30023-3_24},\n publisher = {Springer Berlin Heidelberg},\n keywords = {Automatic differentiation; Expression templates; Template metaprogramming; Generative programming; C $$++$$; C $$++$$ 11; C $$++$$ 0x},\n author = {Nehmeier, Marco},\n pages = {261-271},\n language = {English},\n}\n\n','\n\nMarco Nehmeier.\nGenerative Programming for Automatic Differentiation.\nIn Recent Advances in Algorithmic Differentiation, Shaun Forth,\nPaul Hovland, Eric Phipps, Jean Utke, and Andrea Walther, editors, volume 87\nof Lecture Notes in Computational Science and Engineering, pages\n261-271. Springer Berlin Heidelberg, 2012.\n[ bib | DOI | http | Abstract  ] 
\n@incollection{nehmeierAD2012,\nabstract = {In this paper we present a concept for a C++ implementation of forward automatic differentiation of an arbitrary order using expression templates and template metaprogramming. In contrast to other expression template implementations, the expression tree in our implementation has only symbolic characteristics. The run-time code is then generated from the tree structure using template metaprogramming functions to apply the rules of symbolic differentiation onto the single operations at compile-time. This generic approach has the advantage that the template metaprogramming functions are replaceable which offers the opportunity to easily generate different specialized algorithms. We tested the functionality, correctness and performance of a prototype in different case studies for floating point as well as interval data types and compared it against other implementations.},\nyear = {2012},\nisbn = {978-3-642-30022-6},\nbooktitle = {Recent Advances in Algorithmic Differentiation},\nvolume = {87},\nseries = {Lecture Notes in Computational Science and Engineering},\neditor = {Forth, Shaun and Hovland, Paul and Phipps, Eric and Utke, Jean and Walther, Andrea},\ndoi = {10.1007/978-3-642-30023-3_24},\ntitle = {{G}enerative {P}rogramming for {A}utomatic {D}ifferentiation},\nurl = {http://dx.doi.org/10.1007/978-3-642-30023-3_24},\npublisher = {Springer Berlin Heidelberg},\nkeywords = {Automatic differentiation; Expression templates; Template metaprogramming; Generative programming; C $$++$$; C $$++$$ 11; C $$++$$ 0x},\nauthor = {Nehmeier, Marco},\npages = {261-271},\nlanguage = {English}\n}\n
\n
\nIn this paper we present a concept for a C++ implementation of forward automatic differentiation of an arbitrary order using expression templates and template metaprogramming. In contrast to other expression template implementations, the expression tree in our implementation has only symbolic characteristics. The run-time code is then generated from the tree structure using template metaprogramming functions to apply the rules of symbolic differentiation onto the single operations at compile-time. This generic approach has the advantage that the template metaprogramming functions are replaceable which offers the opportunity to easily generate different specialized algorithms. We tested the functionality, correctness and performance of a prototype in different case studies for floating point as well as interval data types and compared it against other implementations.\n
\n','
\n@incollection{nehmeierAD2012,\n  abstract = {In this paper we present a concept for a C++ implementation of forward automatic differentiation of an arbitrary order using expression templates and template metaprogramming. In contrast to other expression template implementations, the expression tree in our implementation has only symbolic characteristics. The run-time code is then generated from the tree structure using template metaprogramming functions to apply the rules of symbolic differentiation onto the single operations at compile-time. This generic approach has the advantage that the template metaprogramming functions are replaceable which offers the opportunity to easily generate different specialized algorithms. We tested the functionality, correctness and performance of a prototype in different case studies for floating point as well as interval data types and compared it against other implementations.},\n  year = {2012},\n  isbn = {978-3-642-30022-6},\n  booktitle = {Recent Advances in Algorithmic Differentiation},\n  volume = {87},\n  series = {Lecture Notes in Computational Science and Engineering},\n  editor = {Forth, Shaun and Hovland, Paul and Phipps, Eric and Utke, Jean and Walther, Andrea},\n  doi = {10.1007/978-3-642-30023-3_24},\n  title = {{G}enerative {P}rogramming for {A}utomatic {D}ifferentiation},\n  url = {http://dx.doi.org/10.1007/978-3-642-30023-3_24},\n  publisher = {Springer Berlin Heidelberg},\n  keywords = {Automatic differentiation; Expression templates; Template metaprogramming; Generative programming; C $$++$$; C $$++$$ 11; C $$++$$ 0x},\n  author = {Nehmeier, Marco},\n  pages = {261-271},\n  language = {English}\n}\n
\n\n','In this paper we present a concept for a C++ implementation of forward automatic differentiation of an arbitrary order using expression templates and template metaprogramming. In contrast to other expression template implementations, the expression tree in our implementation has only symbolic characteristics. The run-time code is then generated from the tree structure using template metaprogramming functions to apply the rules of symbolic differentiation onto the single operations at compile-time. This generic approach has the advantage that the template metaprogramming functions are replaceable which offers the opportunity to easily generate different specialized algorithms. We tested the functionality, correctness and performance of a prototype in different case studies for floating point as well as interval data types and compared it against other implementations.','{G}enerative {P}rogramming for {A}utomatic {D}ifferentiation',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(764,'paper','nehmeierWiener2014','inproceedings','@inproceedings{nehmeierWiener2014,\n abstract = {In 2008 the IEEE interval standard working group P1788 has been founded to enlarge the acceptance of interval arithmetic. One of the main challenges for the working group was to cope with different approaches of interval arithmetic. Such as set based interval arithmetic or modal interval arithmetic, which have been developed during the last 50 years. For this reason a concept called flavors is defined by the standard. The concept specifies the behavior of the operations. Additionally, a so called decoration system is introduced to treat mathematical events like discontinuity or undefinedness of an expression for a given interval box. The C++ library libieeep1788 tries to implement all features of the tentative interval standard in a clear and straightforward manner. The main goal is to have a faithful reference implementation of the standard and not to use dubious optimizations and hacks. The main design concept of the library is to map the flavors concept one-to-one onto the implementation. To achieve this requirement the so called policy based class design is used. In this paper we will present the key concepts of the faithful C++ library libieeep1788 which will be accompanied by an overview of the preliminary IEEE P1788 interval standard.},\n author = {Nehmeier, Marco},\n booktitle = {Norbert Wiener in the 21st Century (21CW), 2014 IEEE Conference on},\n title = {libieeep1788: {A} {C++} {I}mplementation of the {IEEE} interval standard {P1788}},\n year = {2014},\n month = {June},\n pages = {1-6},\n doi = {10.1109/NORBERT.2014.6893854},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/764.pdf},\n}\n\n','\n\nMarco Nehmeier.\nlibieeep1788: A C++ Implementation of the IEEE interval\nstandard P1788.\nIn Norbert Wiener in the 21st Century (21CW), 2014 IEEE\nConference on, June 2014, pages 1-6.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{nehmeierWiener2014,\nabstract = {In 2008 the IEEE interval standard working group P1788 has been founded to enlarge the acceptance of interval arithmetic. One of the main challenges for the working group was to cope with different approaches of interval arithmetic. Such as set based interval arithmetic or modal interval arithmetic, which have been developed during the last 50 years. For this reason a concept called flavors is defined by the standard. The concept specifies the behavior of the operations. Additionally, a so called decoration system is introduced to treat mathematical events like discontinuity or undefinedness of an expression for a given interval box. The C++ library libieeep1788 tries to implement all features of the tentative interval standard in a clear and straightforward manner. The main goal is to have a faithful reference implementation of the standard and not to use dubious optimizations and hacks. The main design concept of the library is to map the flavors concept one-to-one onto the implementation. To achieve this requirement the so called policy based class design is used. In this paper we will present the key concepts of the faithful C++ library libieeep1788 which will be accompanied by an overview of the preliminary IEEE P1788 interval standard.},\nauthor = {Nehmeier, Marco},\nbooktitle = {Norbert Wiener in the 21st Century (21CW), 2014 IEEE Conference on},\ntitle = {libieeep1788: {A} {C++} {I}mplementation of the {IEEE} interval standard {P1788}},\nyear = {2014},\nmonth = {June},\npages = {1-6},\ndoi = {10.1109/NORBERT.2014.6893854},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/764.pdf}\n}\n
\n
\nIn 2008 the IEEE interval standard working group P1788 has been founded to enlarge the acceptance of interval arithmetic. One of the main challenges for the working group was to cope with different approaches of interval arithmetic. Such as set based interval arithmetic or modal interval arithmetic, which have been developed during the last 50 years. For this reason a concept called flavors is defined by the standard. The concept specifies the behavior of the operations. Additionally, a so called decoration system is introduced to treat mathematical events like discontinuity or undefinedness of an expression for a given interval box. The C++ library libieeep1788 tries to implement all features of the tentative interval standard in a clear and straightforward manner. The main goal is to have a faithful reference implementation of the standard and not to use dubious optimizations and hacks. The main design concept of the library is to map the flavors concept one-to-one onto the implementation. To achieve this requirement the so called policy based class design is used. In this paper we will present the key concepts of the faithful C++ library libieeep1788 which will be accompanied by an overview of the preliminary IEEE P1788 interval standard.\n
\n','
\n@inproceedings{nehmeierWiener2014,\n  abstract = {In 2008 the IEEE interval standard working group P1788 has been founded to enlarge the acceptance of interval arithmetic. One of the main challenges for the working group was to cope with different approaches of interval arithmetic. Such as set based interval arithmetic or modal interval arithmetic, which have been developed during the last 50 years. For this reason a concept called flavors is defined by the standard. The concept specifies the behavior of the operations. Additionally, a so called decoration system is introduced to treat mathematical events like discontinuity or undefinedness of an expression for a given interval box. The C++ library libieeep1788 tries to implement all features of the tentative interval standard in a clear and straightforward manner. The main goal is to have a faithful reference implementation of the standard and not to use dubious optimizations and hacks. The main design concept of the library is to map the flavors concept one-to-one onto the implementation. To achieve this requirement the so called policy based class design is used. In this paper we will present the key concepts of the faithful C++ library libieeep1788 which will be accompanied by an overview of the preliminary IEEE P1788 interval standard.},\n  author = {Nehmeier, Marco},\n  booktitle = {Norbert Wiener in the 21st Century (21CW), 2014 IEEE Conference on},\n  title = {libieeep1788: {A} {C++} {I}mplementation of the {IEEE} interval standard {P1788}},\n  year = {2014},\n  month = {June},\n  pages = {1-6},\n  doi = {10.1109/NORBERT.2014.6893854},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/764.pdf}\n}\n
\n\n','In 2008 the IEEE interval standard working group P1788 has been founded to enlarge the acceptance of interval arithmetic. One of the main challenges for the working group was to cope with different approaches of interval arithmetic. Such as set based interval arithmetic or modal interval arithmetic, which have been developed during the last 50 years. For this reason a concept called flavors is defined by the standard. The concept specifies the behavior of the operations. Additionally, a so called decoration system is introduced to treat mathematical events like discontinuity or undefinedness of an expression for a given interval box. The C++ library libieeep1788 tries to implement all features of the tentative interval standard in a clear and straightforward manner. The main goal is to have a faithful reference implementation of the standard and not to use dubious optimizations and hacks. The main design concept of the library is to map the flavors concept one-to-one onto the implementation. To achieve this requirement the so called policy based class design is used. In this paper we will present the key concepts of the faithful C++ library libieeep1788 which will be accompanied by an overview of the preliminary IEEE P1788 interval standard.','libieeep1788: {A} {C++} {I}mplementation of the {IEEE} interval standard {P1788}',0,6,2014,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 10:29:18',0),(765,'paper','nehmeierTR483','techreport','@techreport{nehmeierTR483,\n abstract = {The computation of the first or higher derivatives of a function is a common problem in scientific computing. The most obvious approach to compute the derivative values is the symbolic differentiation which applies the well known rules of differentiation onto the expression to compute a formal expression of the derivative function. Another method called numerical differentiation is the approximation of the derivative with difference quotients. Superior to these approaches is the automatic differentiation which is a technique to compute a value of the expression and the derivative together by applying the well known rules of differentiation. The difference to symbolic differentiation is that it propagates numerical values instead of formal expressions. Commonly used implementations of automatic differentiation may be divided into two categories, the implementations using operator overloading to compute the values of the function and the derivative together in contrast to special tools applying the technique of source transformation to mix in the expressions to compute the derivatives. Both of these techniques are somehow inflexible in the manner that the operators are not overloaded for high order differentiation or additional tools are required for the source transformation. In this paper we use expression templates and template meta programming to mix in the code for the partial differentiation. The main concept is to apply the symbolic differentiation at compile time only onto the single operations of the expression tree to create the run time code for the automatic differentiation. This has two advantages, we can, in theory, compute derivatives of any order and secondly the differentiation of the operations is done with types. This means that the symbolic differentiation of an operation with a specified order is performed only once by the compiler. Our generic approach provides a domain specific language for partial automatic differentiation of an arbitrary order which is easily extendable by new types. Several C++ and especially C++0x template programming concepts and techniques like variadic templates, type lists or variadic tuples are used to realize the specification of the automatic differentiation at compile time. Common template meta programming techniques are refined. We tested the functionality, correctness and performance of our implementation in different case studies for floating point as well as interval data types and compared it against other implementations.},\n author = {Nehmeier, Marco},\n institution = {Department of Computer Science, University of W\\\"urzburg},\n month = {December},\n number = {483},\n title = {{G}enerative {P}rogramming for {A}utomatic {D}ifferentiation in {C++0x}},\n url = {http://wwwi2.informatik.uni-wuerzburg.de/publications/TRnehmeier11MetaDiff.pdf},\n year = {2011},\n}\n\n','\n\nMarco Nehmeier.\nGenerative Programming for Automatic Differentiation in\nC++0x.\nTechnical Report 483, Department of Computer Science, University of\nWürzburg, December 2011.\n[ bib | .pdf | Abstract  ] 
\n@techreport{nehmeierTR483,\nabstract = {The computation of the first or higher derivatives of a function is a common problem in scientific computing. The most obvious approach to compute the derivative values is the symbolic differentiation which applies the well known rules of differentiation onto the expression to compute a formal expression of the derivative function. Another method called numerical differentiation is the approximation of the derivative with difference quotients. Superior to these approaches is the automatic differentiation which is a technique to compute a value of the expression and the derivative together by applying the well known rules of differentiation. The difference to symbolic differentiation is that it propagates numerical values instead of formal expressions. Commonly used implementations of automatic differentiation may be divided into two categories, the implementations using operator overloading to compute the values of the function and the derivative together in contrast to special tools applying the technique of source transformation to mix in the expressions to compute the derivatives. Both of these techniques are somehow inflexible in the manner that the operators are not overloaded for high order differentiation or additional tools are required for the source transformation. In this paper we use expression templates and template meta programming to mix in the code for the partial differentiation. The main concept is to apply the symbolic differentiation at compile time only onto the single operations of the expression tree to create the run time code for the automatic differentiation. This has two advantages, we can, in theory, compute derivatives of any order and secondly the differentiation of the operations is done with types. This means that the symbolic differentiation of an operation with a specified order is performed only once by the compiler. Our generic approach provides a domain specific language for partial automatic differentiation of an arbitrary order which is easily extendable by new types. Several C++ and especially C++0x template programming concepts and techniques like variadic templates, type lists or variadic tuples are used to realize the specification of the automatic differentiation at compile time. Common template meta programming techniques are refined. We tested the functionality, correctness and performance of our implementation in different case studies for floating point as well as interval data types and compared it against other implementations.},\nauthor = {Nehmeier, Marco},\ninstitution = {Department of Computer Science, University of W\\\"urzburg},\nmonth = {December},\nnumber = {483},\ntitle = {{G}enerative {P}rogramming for {A}utomatic {D}ifferentiation in {C++0x}},\nurl = {http://wwwi2.informatik.uni-wuerzburg.de/publications/TRnehmeier11MetaDiff.pdf},\nyear = {2011}\n}\n
\n
\nThe computation of the first or higher derivatives of a function is a common problem in scientific computing. The most obvious approach to compute the derivative values is the symbolic differentiation which applies the well known rules of differentiation onto the expression to compute a formal expression of the derivative function. Another method called numerical differentiation is the approximation of the derivative with difference quotients. Superior to these approaches is the automatic differentiation which is a technique to compute a value of the expression and the derivative together by applying the well known rules of differentiation. The difference to symbolic differentiation is that it propagates numerical values instead of formal expressions. Commonly used implementations of automatic differentiation may be divided into two categories, the implementations using operator overloading to compute the values of the function and the derivative together in contrast to special tools applying the technique of source transformation to mix in the expressions to compute the derivatives. Both of these techniques are somehow inflexible in the manner that the operators are not overloaded for high order differentiation or additional tools are required for the source transformation. In this paper we use expression templates and template meta programming to mix in the code for the partial differentiation. The main concept is to apply the symbolic differentiation at compile time only onto the single operations of the expression tree to create the run time code for the automatic differentiation. This has two advantages, we can, in theory, compute derivatives of any order and secondly the differentiation of the operations is done with types. This means that the symbolic differentiation of an operation with a specified order is performed only once by the compiler. Our generic approach provides a domain specific language for partial automatic differentiation of an arbitrary order which is easily extendable by new types. Several C++ and especially C++0x template programming concepts and techniques like variadic templates, type lists or variadic tuples are used to realize the specification of the automatic differentiation at compile time. Common template meta programming techniques are refined. We tested the functionality, correctness and performance of our implementation in different case studies for floating point as well as interval data types and compared it against other implementations.\n
\n','
\n@techreport{nehmeierTR483,\n  abstract = {The computation of the first or higher derivatives of a function is a common problem in scientific computing. The most obvious approach to compute the derivative values is the symbolic differentiation which applies the well known rules of differentiation onto the expression to compute a formal expression of the derivative function. Another method called numerical differentiation is the approximation of the derivative with difference quotients. Superior to these approaches is the automatic differentiation which is a technique to compute a value of the expression and the derivative together by applying the well known rules of differentiation. The difference to symbolic differentiation is that it propagates numerical values instead of formal expressions. Commonly used implementations of automatic differentiation may be divided into two categories, the implementations using operator overloading to compute the values of the function and the derivative together in contrast to special tools applying the technique of source transformation to mix in the expressions to compute the derivatives. Both of these techniques are somehow inflexible in the manner that the operators are not overloaded for high order differentiation or additional tools are required for the source transformation. In this paper we use expression templates and template meta programming to mix in the code for the partial differentiation. The main concept is to apply the symbolic differentiation at compile time only onto the single operations of the expression tree to create the run time code for the automatic differentiation. This has two advantages, we can, in theory, compute derivatives of any order and secondly the differentiation of the operations is done with types. This means that the symbolic differentiation of an operation with a specified order is performed only once by the compiler. Our generic approach provides a domain specific language for partial automatic differentiation of an arbitrary order which is easily extendable by new types. Several C++ and especially C++0x template programming concepts and techniques like variadic templates, type lists or variadic tuples are used to realize the specification of the automatic differentiation at compile time. Common template meta programming techniques are refined. We tested the functionality, correctness and performance of our implementation in different case studies for floating point as well as interval data types and compared it against other implementations.},\n  author = {Nehmeier, Marco},\n  institution = {Department of Computer Science, University of W\\\"urzburg},\n  month = {December},\n  number = {483},\n  title = {{G}enerative {P}rogramming for {A}utomatic {D}ifferentiation in {C++0x}},\n  url = {http://wwwi2.informatik.uni-wuerzburg.de/publications/TRnehmeier11MetaDiff.pdf},\n  year = {2011}\n}\n
\n\n','The computation of the first or higher derivatives of a function is a common problem in scientific computing. The most obvious approach to compute the derivative values is the symbolic differentiation which applies the well known rules of differentiation onto the expression to compute a formal expression of the derivative function. Another method called numerical differentiation is the approximation of the derivative with difference quotients. Superior to these approaches is the automatic differentiation which is a technique to compute a value of the expression and the derivative together by applying the well known rules of differentiation. The difference to symbolic differentiation is that it propagates numerical values instead of formal expressions. Commonly used implementations of automatic differentiation may be divided into two categories, the implementations using operator overloading to compute the values of the function and the derivative together in contrast to special tools applying the technique of source transformation to mix in the expressions to compute the derivatives. Both of these techniques are somehow inflexible in the manner that the operators are not overloaded for high order differentiation or additional tools are required for the source transformation. In this paper we use expression templates and template meta programming to mix in the code for the partial differentiation. The main concept is to apply the symbolic differentiation at compile time only onto the single operations of the expression tree to create the run time code for the automatic differentiation. This has two advantages, we can, in theory, compute derivatives of any order and secondly the differentiation of the operations is done with types. This means that the symbolic differentiation of an operation with a specified order is performed only once by the compiler. Our generic approach provides a domain specific language for partial automatic differentiation of an arbitrary order which is easily extendable by new types. Several C++ and especially C++0x template programming concepts and techniques like variadic templates, type lists or variadic tuples are used to realize the specification of the automatic differentiation at compile time. Common template meta programming techniques are refined. We tested the functionality, correctness and performance of our implementation in different case studies for floating point as well as interval data types and compared it against other implementations.','{G}enerative {P}rogramming for {A}utomatic {D}ifferentiation in {C++0x}',0,12,2011,12,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(766,'paper','nehmeierTR476','techreport','@techreport{nehmeierTR476,\n abstract = {In this paper we start with the definition of the interval overlapping relation showing the 13 different cases that may occur when to compare two non-empty intervals. This paper serves 2 purposes: 1. to define a solid foundation for interval comparisons and lattice operations 2. to provide an advanced interface for language embedding and application programs.},\n institution = {Department of Computer Science, University of W\\\"urzburg},\n author = {Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\n month = {September},\n number = {476},\n pdf = {http://wwwi2.informatik.uni-wuerzburg.de/publications/tr476.pdf},\n title = {{I}nterval {C}omparisons and {L}attice {O}perations based on the {I}nterval {O}verlapping {R}elation},\n type = {Technical Report},\n year = {2010},\n}\n\n','\n\nMarco Nehmeier and Jürgen Wolff von Gudenberg.\nInterval Comparisons and Lattice Operations based on the\nInterval Overlapping Relation.\nTechnical Report 476, Department of Computer Science, University of\nWürzburg, September 2010.\n[ bib | .pdf | Abstract  ] 
\n@techreport{nehmeierTR476,\nabstract = {In this paper we start with the definition of the interval overlapping relation showing the 13 different cases that may occur when to compare two non-empty intervals. This paper serves 2 purposes: 1. to define a solid foundation for interval comparisons and lattice operations 2. to provide an advanced interface for language embedding and application programs.},\ninstitution = {Department of Computer Science, University of W\\\"urzburg},\nauthor = {Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\nmonth = {September},\nnumber = {476},\npdf = {http://wwwi2.informatik.uni-wuerzburg.de/publications/tr476.pdf},\ntitle = {{I}nterval {C}omparisons and {L}attice {O}perations based on the {I}nterval {O}verlapping {R}elation},\ntype = {Technical Report},\nyear = {2010}\n}\n
\n
\nIn this paper we start with the definition of the interval overlapping relation showing the 13 different cases that may occur when to compare two non-empty intervals. This paper serves 2 purposes: 1. to define a solid foundation for interval comparisons and lattice operations 2. to provide an advanced interface for language embedding and application programs.\n
\n','
\n@techreport{nehmeierTR476,\n  abstract = {In this paper we start with the definition of the interval overlapping relation showing the 13 different cases that may occur when to compare two non-empty intervals. This paper serves 2 purposes: 1. to define a solid foundation for interval comparisons and lattice operations 2. to provide an advanced interface for language embedding and application programs.},\n  institution = {Department of Computer Science, University of W\\\"urzburg},\n  author = {Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\n  month = {September},\n  number = {476},\n  pdf = {http://wwwi2.informatik.uni-wuerzburg.de/publications/tr476.pdf},\n  title = {{I}nterval {C}omparisons and {L}attice {O}perations based on the {I}nterval {O}verlapping {R}elation},\n  type = {Technical Report},\n  year = {2010}\n}\n
\n\n','In this paper we start with the definition of the interval overlapping relation showing the 13 different cases that may occur when to compare two non-empty intervals. This paper serves 2 purposes: 1. to define a solid foundation for interval comparisons and lattice operations 2. to provide an advanced interface for language embedding and application programs.','{I}nterval {C}omparisons and {L}attice {O}perations based on the {I}nterval {O}verlapping {R}elation',0,9,2010,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(767,'paper','nehmeierDA','mastersthesis','@mastersthesis{nehmeierDA,\n abstract = {Im Bereich des wissenschaftlichen Rechnens st\\\"o{ss}t die Intervallarithmetik in den letzten Jahren auf immer mehr Akzeptanz. Eigenschaften, wie das sichere Einschlie{ss}en der Ergebnisse bei der Intervallauswertung, machen sie zu einem guten Mittel um mit den Rundungsfehlern der Gleitkommazahlen umzugehen. Auch k\\\"onnen Berechnungen auf Wertemengen mit garantierten Grenzen durchgef\\\"uhrt werden. Ebenso wird in Anwendungsgebieten wie der globalen Optimierung mittels \"Branch and Bound\" Algorithmen, der Robotik oder der Computergraphik die Intervallrechnung mit Erfolg eingesetzt. Im Gegensatz zu der vom \"Institute of Electrical and Electronics Engineers\" IEEE standardisierten Gleitkommaarithmetik, existiert f\"ur die Intervallrechnung jedoch keine Norm oder Implementierungsvorschrift. Viele verschiedene Implementierungen und Konzepte wurden \\\"uber die Jahre entwickelt und auch eingesetzt. Eine einheitliche Semantik wie bei den Gleitkommazahlen ist jedoch nicht gegeben. Um die Unterst\"utzung der Intervallarithmetik auf Rechnern zu verbessern, aber auch um die Akzeptanz bei Benutzern weiter zu erh\\\"ohen wird aktuell an einem IEEE Standard f\\\"ur Intervallrechnung gearbeitet. Diese Diplomarbeit besch\\\"aftigt sich mit den M\"oglichkeiten einer effizienten Implementierung der Intervallarithmetik auf Computersystemen mittels der Programmiersprache C++.},\n author = {Nehmeier, Marco},\n month = {},\n school = {Lehrstuhl f\\\"ur Informatik 2, Universit\\\"at W\\\"urzburg},\n title = {{E}ffiziente {I}ntervallarithmetik mit {C++}},\n type = {Diplomarbeit},\n url = {http://wwwi2.informatik.uni-wuerzburg.de/publications/daNehmeier09.pdf},\n year = {2009},\n}\n\n','\n\nMarco Nehmeier.\nEffiziente Intervallarithmetik mit C++.\nDiplomarbeit, Lehrstuhl für Informatik 2, Universität Würzburg,\n2009.\n[ bib | .pdf | Abstract  ] 
\n@mastersthesis{nehmeierDA,\nabstract = {Im Bereich des wissenschaftlichen Rechnens st\\\"o{ss}t die Intervallarithmetik in den letzten Jahren auf immer mehr Akzeptanz. Eigenschaften, wie das sichere Einschlie{ss}en der Ergebnisse bei der Intervallauswertung, machen sie zu einem guten Mittel um mit den Rundungsfehlern der Gleitkommazahlen umzugehen. Auch k\\\"onnen Berechnungen auf Wertemengen mit garantierten Grenzen durchgef\\\"uhrt werden. Ebenso wird in Anwendungsgebieten wie der globalen Optimierung mittels \"Branch and Bound\" Algorithmen, der Robotik oder der Computergraphik die Intervallrechnung mit Erfolg eingesetzt. Im Gegensatz zu der vom \"Institute of Electrical and Electronics Engineers\" IEEE standardisierten Gleitkommaarithmetik, existiert f\"ur die Intervallrechnung jedoch keine Norm oder Implementierungsvorschrift. Viele verschiedene Implementierungen und Konzepte wurden \\\"uber die Jahre entwickelt und auch eingesetzt. Eine einheitliche Semantik wie bei den Gleitkommazahlen ist jedoch nicht gegeben. Um die Unterst\"utzung der Intervallarithmetik auf Rechnern zu verbessern, aber auch um die Akzeptanz bei Benutzern weiter zu erh\\\"ohen wird aktuell an einem IEEE Standard f\\\"ur Intervallrechnung gearbeitet. Diese Diplomarbeit besch\\\"aftigt sich mit den M\"oglichkeiten einer effizienten Implementierung der Intervallarithmetik auf Computersystemen mittels der Programmiersprache C++.},\nauthor = {Nehmeier, Marco},\nmonth = {},\nschool = {Lehrstuhl f\\\"ur Informatik 2, Universit\\\"at W\\\"urzburg},\ntitle = {{E}ffiziente {I}ntervallarithmetik mit {C++}},\ntype = {Diplomarbeit},\nurl = {http://wwwi2.informatik.uni-wuerzburg.de/publications/daNehmeier09.pdf},\nyear = {2009}\n}\n
\n
\nIm Bereich des wissenschaftlichen Rechnens stösst die Intervallarithmetik in den letzten Jahren auf immer mehr Akzeptanz. Eigenschaften, wie das sichere Einschliessen der Ergebnisse bei der Intervallauswertung, machen sie zu einem guten Mittel um mit den Rundungsfehlern der Gleitkommazahlen umzugehen. Auch können Berechnungen auf Wertemengen mit garantierten Grenzen durchgeführt werden. Ebenso wird in Anwendungsgebieten wie der globalen Optimierung mittels \"Branch and Bound\" Algorithmen, der Robotik oder der Computergraphik die Intervallrechnung mit Erfolg eingesetzt. Im Gegensatz zu der vom \"Institute of Electrical and Electronics Engineers\" IEEE standardisierten Gleitkommaarithmetik, existiert f\"ur die Intervallrechnung jedoch keine Norm oder Implementierungsvorschrift. Viele verschiedene Implementierungen und Konzepte wurden über die Jahre entwickelt und auch eingesetzt. Eine einheitliche Semantik wie bei den Gleitkommazahlen ist jedoch nicht gegeben. Um die Unterst\"utzung der Intervallarithmetik auf Rechnern zu verbessern, aber auch um die Akzeptanz bei Benutzern weiter zu erhöhen wird aktuell an einem IEEE Standard für Intervallrechnung gearbeitet. Diese Diplomarbeit beschäftigt sich mit den M\"oglichkeiten einer effizienten Implementierung der Intervallarithmetik auf Computersystemen mittels der Programmiersprache C++.\n
\n','
\n@mastersthesis{nehmeierDA,\n  abstract = {Im Bereich des wissenschaftlichen Rechnens st\\\"o{ss}t die Intervallarithmetik in den letzten Jahren auf immer mehr Akzeptanz. Eigenschaften, wie das sichere Einschlie{ss}en der Ergebnisse bei der Intervallauswertung, machen sie zu einem guten Mittel um mit den Rundungsfehlern der Gleitkommazahlen umzugehen. Auch k\\\"onnen Berechnungen auf Wertemengen mit garantierten Grenzen durchgef\\\"uhrt werden. Ebenso wird in Anwendungsgebieten wie der globalen Optimierung mittels \"Branch and Bound\" Algorithmen, der Robotik oder der Computergraphik die Intervallrechnung mit Erfolg eingesetzt. Im Gegensatz zu der vom \"Institute of Electrical and Electronics Engineers\" IEEE standardisierten Gleitkommaarithmetik, existiert f\"ur die Intervallrechnung jedoch keine Norm oder Implementierungsvorschrift. Viele verschiedene Implementierungen und Konzepte wurden \\\"uber die Jahre entwickelt und auch eingesetzt. Eine einheitliche Semantik wie bei den Gleitkommazahlen ist jedoch nicht gegeben. Um die Unterst\"utzung der Intervallarithmetik auf Rechnern zu verbessern, aber auch um die Akzeptanz bei Benutzern weiter zu erh\\\"ohen wird aktuell an einem IEEE Standard f\\\"ur Intervallrechnung gearbeitet. Diese Diplomarbeit besch\\\"aftigt sich mit den M\"oglichkeiten einer effizienten Implementierung der Intervallarithmetik auf Computersystemen mittels der Programmiersprache C++.},\n  author = {Nehmeier, Marco},\n  month = {},\n  school = {Lehrstuhl f\\\"ur Informatik 2, Universit\\\"at W\\\"urzburg},\n  title = {{E}ffiziente {I}ntervallarithmetik mit {C++}},\n  type = {Diplomarbeit},\n  url = {http://wwwi2.informatik.uni-wuerzburg.de/publications/daNehmeier09.pdf},\n  year = {2009}\n}\n
\n\n','Im Bereich des wissenschaftlichen Rechnens st\\\"o{ss}t die Intervallarithmetik in den letzten Jahren auf immer mehr Akzeptanz. Eigenschaften, wie das sichere Einschlie{ss}en der Ergebnisse bei der Intervallauswertung, machen sie zu einem guten Mittel um mit den Rundungsfehlern der Gleitkommazahlen umzugehen. Auch k\\\"onnen Berechnungen auf Wertemengen mit garantierten Grenzen durchgef\\\"uhrt werden. Ebenso wird in Anwendungsgebieten wie der globalen Optimierung mittels \"Branch and Bound\" Algorithmen, der Robotik oder der Computergraphik die Intervallrechnung mit Erfolg eingesetzt. Im Gegensatz zu der vom \"Institute of Electrical and Electronics Engineers\" IEEE standardisierten Gleitkommaarithmetik, existiert f\"ur die Intervallrechnung jedoch keine Norm oder Implementierungsvorschrift. Viele verschiedene Implementierungen und Konzepte wurden \\\"uber die Jahre entwickelt und auch eingesetzt. Eine einheitliche Semantik wie bei den Gleitkommazahlen ist jedoch nicht gegeben. Um die Unterst\"utzung der Intervallarithmetik auf Rechnern zu verbessern, aber auch um die Akzeptanz bei Benutzern weiter zu erh\\\"ohen wird aktuell an einem IEEE Standard f\\\"ur Intervallrechnung gearbeitet. Diese Diplomarbeit besch\\\"aftigt sich mit den M\"oglichkeiten einer effizienten Implementierung der Intervallarithmetik auf Computersystemen mittels der Programmiersprache C++.','{E}ffiziente {I}ntervallarithmetik mit {C++}',0,0,2009,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(768,'paper','Brosig2014-KIT-OnlinePerformancePrediction','phdthesis','@phdthesis{Brosig2014-KIT-OnlinePerformancePrediction,\n author = {Fabian Brosig},\n title = {Architecture-Level Software Performance Models for Online Performance Prediction},\n year = {2014},\n month = {July},\n school = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\n url = {http://nbn-resolving.org/urn:nbn:de:swb:90-435372},\n pdf = {http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3263306},\n}\n\n','\n\nFabian Brosig.\nArchitecture-Level Software Performance Models for Online\nPerformance Prediction.\nPhD thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, July 2014.\n[ bib | http | http  ] 
\n@phdthesis{Brosig2014-KIT-OnlinePerformancePrediction,\nauthor = {Fabian Brosig},\ntitle = {Architecture-Level Software Performance Models for Online Performance Prediction},\nyear = {2014},\nmonth = {July},\nschool = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\nurl = {http://nbn-resolving.org/urn:nbn:de:swb:90-435372},\npdf = {http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3263306}\n}\n
\n
\n','
\n@phdthesis{Brosig2014-KIT-OnlinePerformancePrediction,\n  author = {Fabian Brosig},\n  title = {Architecture-Level Software Performance Models for Online Performance Prediction},\n  year = {2014},\n  month = {July},\n  school = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\n  url = {http://nbn-resolving.org/urn:nbn:de:swb:90-435372},\n  pdf = {http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3263306}\n}\n
\n\n',NULL,'Architecture-Level Software Performance Models for Online Performance Prediction',0,7,2014,7,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(769,'paper','RyKo-DNI-Manual-TR','techreport','@techreport{RyKo-DNI-Manual-TR,\n address = {Am Hubland, 97074 W\\\"{u}rzburg},\n author = {Piotr Rygielski and Samuel Kounev},\n institution = {Chair of Software Engineering, University of W\\\"{u}rzburg},\n month = {September},\n title = {{Descartes Network Infrastructures (DNI) Manual: Meta-models, Transformations, Examples}},\n type = {{Technical Report v.0.3}},\n year = {2014},\n url = {http://se.informatik.uni-wuerzburg.de/staff/piotr_rygielski/dni_manual/},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/769.pdf},\n abstract = {The goal of this document is to present the DNI Meta-Model, its instances, sub-meta-models, and model transformations in more details than in an usual conference or journal paper. We describe the meta-models and the transformations in details, give example of systems modeled using the meta-models, and present the transformations in a step-by-step manner.},\n}\n\n','\n\nPiotr Rygielski and Samuel Kounev.\nDescartes Network Infrastructures (DNI) Manual: Meta-models,\nTransformations, Examples.\nTechnical Report v.0.3, Chair of Software Engineering, University\nof Würzburg, Am Hubland, 97074 Würzburg, September 2014.\n[ bib | http | .pdf | Abstract  ] 
\n@techreport{RyKo-DNI-Manual-TR,\naddress = {Am Hubland, 97074 W\\\"{u}rzburg},\nauthor = {Piotr Rygielski and Samuel Kounev},\ninstitution = {Chair of Software Engineering, University of W\\\"{u}rzburg},\nmonth = {September},\ntitle = {{Descartes Network Infrastructures (DNI) Manual: Meta-models, Transformations, Examples}},\ntype = {{Technical Report v.0.3}},\nyear = {2014},\nurl = {http://se.informatik.uni-wuerzburg.de/staff/piotr_rygielski/dni_manual/},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/769.pdf},\nabstract = {The goal of this document is to present the DNI Meta-Model, its instances, sub-meta-models, and model transformations in more details than in an usual conference or journal paper. We describe the meta-models and the transformations in details, give example of systems modeled using the meta-models, and present the transformations in a step-by-step manner.}\n}\n
\n
\nThe goal of this document is to present the DNI Meta-Model, its instances, sub-meta-models, and model transformations in more details than in an usual conference or journal paper. We describe the meta-models and the transformations in details, give example of systems modeled using the meta-models, and present the transformations in a step-by-step manner.\n
\n','
\n@techreport{RyKo-DNI-Manual-TR,\n  address = {Am Hubland, 97074 W\\\"{u}rzburg},\n  author = {Piotr Rygielski and Samuel Kounev},\n  institution = {Chair of Software Engineering, University of W\\\"{u}rzburg},\n  month = {September},\n  title = {{Descartes Network Infrastructures (DNI) Manual: Meta-models, Transformations, Examples}},\n  type = {{Technical Report v.0.3}},\n  year = {2014},\n  url = {http://se.informatik.uni-wuerzburg.de/staff/piotr_rygielski/dni_manual/},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/769.pdf},\n  abstract = {The goal of this document is to present the DNI Meta-Model, its instances, sub-meta-models, and model transformations in more details than in an usual conference or journal paper. We describe the meta-models and the transformations in details, give example of systems modeled using the meta-models, and present the transformations in a step-by-step manner.}\n}\n
\n\n','The goal of this document is to present the DNI Meta-Model, its instances, sub-meta-models, and model transformations in more details than in an usual conference or journal paper. We describe the meta-models and the transformations in details, give example of systems modeled using the meta-models, and present the transformations in a step-by-step manner.','{Descartes Network Infrastructures (DNI) Manual: Meta-models, Transformations, Examples}',0,9,2014,9,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(770,'paper','Weber2014','mastersthesis','@mastersthesis{Weber2014,\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n abstract = {{Auto-scaling features offered by today\'s cloud infrastructures provide increased flexibility, especially for customers that experience high variations in the load intensity over time. However, auto-scaling features introduce new system quality attributes when considering their accuracy and timing. Therefore, distinguishing between different offerings has become a complex task, as it is not yet supported by reliable metrics and measurement approaches. This thesis discusses the shortcomings of existing approaches for measuring and evaluating elastic behavior and proposes a novel benchmark methodology specifically designed for evaluating the elasticity aspects of modern cloud platforms. The benchmarking concept uses open workloads with realistic load intensity profiles in order to induce resource demand variations on the benchmarked system and compares them with the actual variation of the allocated resources. To ensure a fair elasticity comparison between systems with di erent underlying hardware performance, the load intensity profiles are adjusted to induce identical resource demand variations on all compared platforms. Furthermore, this thesis proposes new metrics that capture the accuracy of resource allocations and deallocations, as well as the timing aspects of an auto-scaling mechanism, explicitly. The benchmark concept comprises four activities: The System Analysis evaluates the load processing capabilities of the benchmarked platform for different scaling stages. The Benchmark Calibration then uses the analysis results and adjusts a given load intensity profile in a system specific manner. Within the Measurement activity, the evaluated platformis exposed to a load varying ccording to the adjusted intensity profile. The final Elasticity Evaluation measures the quality of the observed elastic behavior using the proposed elasticity metrics. A java based framework for benchmarking the elasticity of IaaS cloud platforms called BUNGEE implements this concept and automates benchmarking activities. At the moment, BUNGEE allows to analyze the elasticity of CloudStack and Amazon Web Service (AWS) based clouds that scale CPU-bound virtual machines horizontally. Within an extensive evaluation, this thesis demonstrates the ability of the proposed elasticity metrics to consistently rank elastic systems on an ordinal scale. A case study that uses a realistic load profile, consisting of several millions of request submissions, exhibits the applicability of the benchmarking methodology for realistic scenarios. The case study is conducted on a private as well as on a public cloud and uses eleven different elasticity rule configurations and four instance types assigned to resources with different levels of effciency.}},\n author = {Andreas Weber},\n keywords = {Load Intensity, Benchmark, Cloud, Elasticity},\n school = {{Karlsruhe Institute of Technology (KIT)}},\n title = {{Resource Elasticity Benchmarking in Cloud Environments}},\n type = {{Master Thesis}},\n year = {2014},\n month = {August},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/770},\n pdf = {https://sdqweb.ipd.kit.edu/publications/pdfs/Weber2014.pdf},\n}\n\n','\n\nAndreas Weber.\nResource Elasticity Benchmarking in Cloud Environments.\nMaster Thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, August 2014.\n[ bib | slides | .pdf | Abstract  ] 
\n@mastersthesis{Weber2014,\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nabstract = {{Auto-scaling features offered by today\'s cloud infrastructures provide increased flexibility, especially for customers that experience high variations in the load intensity over time. However, auto-scaling features introduce new system quality attributes when considering their accuracy and timing. Therefore, distinguishing between different offerings has become a complex task, as it is not yet supported by reliable metrics and measurement approaches. This thesis discusses the shortcomings of existing approaches for measuring and evaluating elastic behavior and proposes a novel benchmark methodology specifically designed for evaluating the elasticity aspects of modern cloud platforms. The benchmarking concept uses open workloads with realistic load intensity profiles in order to induce resource demand variations on the benchmarked system and compares them with the actual variation of the allocated resources. To ensure a fair elasticity comparison between systems with di erent underlying hardware performance, the load intensity profiles are adjusted to induce identical resource demand variations on all compared platforms. Furthermore, this thesis proposes new metrics that capture the accuracy of resource allocations and deallocations, as well as the timing aspects of an auto-scaling mechanism, explicitly. The benchmark concept comprises four activities: The System Analysis evaluates the load processing capabilities of the benchmarked platform for different scaling stages. The Benchmark Calibration then uses the analysis results and adjusts a given load intensity profile in a system specific manner. Within the Measurement activity, the evaluated platformis exposed to a load varying ccording to the adjusted intensity profile. The final Elasticity Evaluation measures the quality of the observed elastic behavior using the proposed elasticity metrics. A java based framework for benchmarking the elasticity of IaaS cloud platforms called BUNGEE implements this concept and automates benchmarking activities. At the moment, BUNGEE allows to analyze the elasticity of CloudStack and Amazon Web Service (AWS) based clouds that scale CPU-bound virtual machines horizontally. Within an extensive evaluation, this thesis demonstrates the ability of the proposed elasticity metrics to consistently rank elastic systems on an ordinal scale. A case study that uses a realistic load profile, consisting of several millions of request submissions, exhibits the applicability of the benchmarking methodology for realistic scenarios. The case study is conducted on a private as well as on a public cloud and uses eleven different elasticity rule configurations and four instance types assigned to resources with different levels of effciency.}},\nauthor = {Andreas Weber},\nkeywords = {Load Intensity, Benchmark, Cloud, Elasticity},\nschool = {{Karlsruhe Institute of Technology (KIT)}},\ntitle = {{Resource Elasticity Benchmarking in Cloud Environments}},\ntype = {{Master Thesis}},\nyear = {2014},\nmonth = {August},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/770},\npdf = {https://sdqweb.ipd.kit.edu/publications/pdfs/Weber2014.pdf}\n}\n
\n
\nAuto-scaling features offered by today\'s cloud infrastructures provide increased flexibility, especially for customers that experience high variations in the load intensity over time. However, auto-scaling features introduce new system quality attributes when considering their accuracy and timing. Therefore, distinguishing between different offerings has become a complex task, as it is not yet supported by reliable metrics and measurement approaches. This thesis discusses the shortcomings of existing approaches for measuring and evaluating elastic behavior and proposes a novel benchmark methodology specifically designed for evaluating the elasticity aspects of modern cloud platforms. The benchmarking concept uses open workloads with realistic load intensity profiles in order to induce resource demand variations on the benchmarked system and compares them with the actual variation of the allocated resources. To ensure a fair elasticity comparison between systems with di erent underlying hardware performance, the load intensity profiles are adjusted to induce identical resource demand variations on all compared platforms. Furthermore, this thesis proposes new metrics that capture the accuracy of resource allocations and deallocations, as well as the timing aspects of an auto-scaling mechanism, explicitly. The benchmark concept comprises four activities: The System Analysis evaluates the load processing capabilities of the benchmarked platform for different scaling stages. The Benchmark Calibration then uses the analysis results and adjusts a given load intensity profile in a system specific manner. Within the Measurement activity, the evaluated platformis exposed to a load varying ccording to the adjusted intensity profile. The final Elasticity Evaluation measures the quality of the observed elastic behavior using the proposed elasticity metrics. A java based framework for benchmarking the elasticity of IaaS cloud platforms called BUNGEE implements this concept and automates benchmarking activities. At the moment, BUNGEE allows to analyze the elasticity of CloudStack and Amazon Web Service (AWS) based clouds that scale CPU-bound virtual machines horizontally. Within an extensive evaluation, this thesis demonstrates the ability of the proposed elasticity metrics to consistently rank elastic systems on an ordinal scale. A case study that uses a realistic load profile, consisting of several millions of request submissions, exhibits the applicability of the benchmarking methodology for realistic scenarios. The case study is conducted on a private as well as on a public cloud and uses eleven different elasticity rule configurations and four instance types assigned to resources with different levels of effciency.\n
\n','
\n@mastersthesis{Weber2014,\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  abstract = {{Auto-scaling features offered by today\'s cloud infrastructures provide increased flexibility, especially for customers that experience high variations in the load intensity over time. However, auto-scaling features introduce new system quality attributes when considering their accuracy and timing. Therefore, distinguishing between different offerings has become a complex task, as it is not yet supported by reliable metrics and measurement approaches. This thesis discusses the shortcomings of existing approaches for measuring and evaluating elastic behavior and proposes a novel benchmark methodology specifically designed for evaluating the elasticity aspects of modern cloud platforms. The benchmarking concept uses open workloads with realistic load intensity profiles in order to induce resource demand variations on the benchmarked system and compares them with the actual variation of the allocated resources. To ensure a fair elasticity comparison between systems with di erent underlying hardware performance, the load intensity profiles are adjusted to induce identical resource demand variations on all compared platforms. Furthermore, this thesis proposes new metrics that capture the accuracy of resource allocations and deallocations, as well as the timing aspects of an auto-scaling mechanism, explicitly. The benchmark concept comprises four activities: The System Analysis evaluates the load processing capabilities of the benchmarked platform for different scaling stages. The Benchmark Calibration then uses the analysis results and adjusts a given load intensity profile in a system specific manner. Within the Measurement activity, the evaluated platformis exposed to a load varying ccording to the adjusted intensity profile. The final Elasticity Evaluation measures the quality of the observed elastic behavior using the proposed elasticity metrics. A java based framework for benchmarking the elasticity of IaaS cloud platforms called BUNGEE implements this concept and automates benchmarking activities. At the moment, BUNGEE allows to analyze the elasticity of CloudStack and Amazon Web Service (AWS) based clouds that scale CPU-bound virtual machines horizontally. Within an extensive evaluation, this thesis demonstrates the ability of the proposed elasticity metrics to consistently rank elastic systems on an ordinal scale. A case study that uses a realistic load profile, consisting of several millions of request submissions, exhibits the applicability of the benchmarking methodology for realistic scenarios. The case study is conducted on a private as well as on a public cloud and uses eleven different elasticity rule configurations and four instance types assigned to resources with different levels of effciency.}},\n  author = {Andreas Weber},\n  keywords = {Load Intensity, Benchmark, Cloud, Elasticity},\n  school = {{Karlsruhe Institute of Technology (KIT)}},\n  title = {{Resource Elasticity Benchmarking in Cloud Environments}},\n  type = {{Master Thesis}},\n  year = {2014},\n  month = {August},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/770},\n  pdf = {https://sdqweb.ipd.kit.edu/publications/pdfs/Weber2014.pdf}\n}\n
\n\n','{Auto-scaling features offered by today\'s cloud infrastructures provide increased flexibility, especially for customers that experience high variations in the load intensity over time. However, auto-scaling features introduce new system quality attributes when considering their accuracy and timing. Therefore, distinguishing between different offerings has become a complex task, as it is not yet supported by reliable metrics and measurement approaches. This thesis discusses the shortcomings of existing approaches for measuring and evaluating elastic behavior and proposes a novel benchmark methodology specifically designed for evaluating the elasticity aspects of modern cloud platforms. The benchmarking concept uses open workloads with realistic load intensity profiles in order to induce resource demand variations on the benchmarked system and compares them with the actual variation of the allocated resources. To ensure a fair elasticity comparison between systems with di erent underlying hardware performance, the load intensity profiles are adjusted to induce identical resource demand variations on all compared platforms. Furthermore, this thesis proposes new metrics that capture the accuracy of resource allocations and deallocations, as well as the timing aspects of an auto-scaling mechanism, explicitly. The benchmark concept comprises four activities: The System Analysis evaluates the load processing capabilities of the benchmarked platform for different scaling stages. The Benchmark Calibration then uses the analysis results and adjusts a given load intensity profile in a system specific manner. Within the Measurement activity, the evaluated platformis exposed to a load varying ccording to the adjusted intensity profile. The final Elasticity Evaluation measures the quality of the observed elastic behavior using the proposed elasticity metrics. A java based framework for benchmarking the elasticity of IaaS cloud platforms called BUNGEE implements this concept and automates benchmarking activities. At the moment, BUNGEE allows to analyze the elasticity of CloudStack and Amazon Web Service (AWS) based clouds that scale CPU-bound virtual machines horizontally. Within an extensive evaluation, this thesis demonstrates the ability of the proposed elasticity metrics to consistently rank elastic systems on an ordinal scale. A case study that uses a realistic load profile, consisting of several millions of request submissions, exhibits the applicability of the benchmarking methodology for realistic scenarios. The case study is conducted on a private as well as on a public cloud and uses eleven different elasticity rule configurations and four instance types assigned to resources with different levels of effciency.}','{Resource Elasticity Benchmarking in Cloud Environments}',0,8,2014,8,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(771,'paper','KiHeKo2014-SOSP-LIMBO','inproceedings','@inproceedings{KiHeKo2014-SOSP-LIMBO,\n author = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Samuel Kounev},\n abstract = {{LIMBO is a tool for the creation of load profiles with variable intensity over time both from scratch and from existing data. Primarily, LIMBO\'s intended use is the description of load arrival behaviours in open workloads. Specifically, LIMBO can be employed for the creation of custom request or user arrival time-stamps or for the re-parameterization of existing traces. LIMBO bases on the Descartes Load Intensity Model (DLIM) for the formalized description of its load intensity profiles. The DLIM formalism can be understood as a structure for piece-wise defined and combined mathematical functions. We outline DLIM and its elements and demonstrate its integration within LIMBO. LIMBO is capable of generating request or user arrival time stamps from DLIM instances. In a next step, these generated time-stamps can be used for both open workload based benchmarking and simulations. The TimestampTimer plug-in for JMeter already allows the former. LIMBO also offers a range of tools for easy load intensity modeling and analysis, including, but not limited to, a visual decomposition of load intensity time-series into seasonal and trend parts, a simplified load intensity model as part of a model creation wizard, and an automated model instance extractor. As part of our LIMBO tutorial, we explain these features in detail. We demonstrate common use cases for LIMBO and show how they are supported. We also focus on LIMBOs extensible architecture and discuss how to use LIMBO as part of another tool-chain.}},\n title = {{Using and Extending LIMBO for the Descriptive Modeling of Arrival Behaviors}},\n booktitle = {Proceedings of the Symposium on Software Performance 2014},\n location = {Stuttgart, Germany},\n month = {November},\n year = {2014},\n publisher = {University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology},\n pages = {131--140},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/771.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/771},\n note = {Best Poster Award},\n}\n\n','\n\nJóakim von Kistowski, Nikolas Roman Herbst, and Samuel Kounev.\nUsing and Extending LIMBO for the Descriptive Modeling of Arrival\nBehaviors.\nIn Proceedings of the Symposium on Software Performance 2014,\nStuttgart, Germany, November 2014, pages 131-140. University of Stuttgart,\nFaculty of Computer Science, Electrical Engineering, and Information\nTechnology.\nNovember 2014, Best Poster Award.\n[ bib | slides | .pdf | Abstract  ] 
\n@inproceedings{KiHeKo2014-SOSP-LIMBO,\nauthor = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Samuel Kounev},\nabstract = {{LIMBO is a tool for the creation of load profiles with variable intensity over time both from scratch and from existing data. Primarily, LIMBO\'s intended use is the description of load arrival behaviours in open workloads. Specifically, LIMBO can be employed for the creation of custom request or user arrival time-stamps or for the re-parameterization of existing traces. LIMBO bases on the Descartes Load Intensity Model (DLIM) for the formalized description of its load intensity profiles. The DLIM formalism can be understood as a structure for piece-wise defined and combined mathematical functions. We outline DLIM and its elements and demonstrate its integration within LIMBO. LIMBO is capable of generating request or user arrival time stamps from DLIM instances. In a next step, these generated time-stamps can be used for both open workload based benchmarking and simulations. The TimestampTimer plug-in for JMeter already allows the former. LIMBO also offers a range of tools for easy load intensity modeling and analysis, including, but not limited to, a visual decomposition of load intensity time-series into seasonal and trend parts, a simplified load intensity model as part of a model creation wizard, and an automated model instance extractor. As part of our LIMBO tutorial, we explain these features in detail. We demonstrate common use cases for LIMBO and show how they are supported. We also focus on LIMBOs extensible architecture and discuss how to use LIMBO as part of another tool-chain.}},\ntitle = {{Using and Extending LIMBO for the Descriptive Modeling of Arrival Behaviors}},\nbooktitle = {Proceedings of the Symposium on Software Performance 2014},\nlocation = {Stuttgart, Germany},\nmonth = {November},\nyear = {2014},\npublisher = {University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology},\npages = {131--140},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/771.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/771},\nnote = {Best Poster Award}\n}\n
\n
\nLIMBO is a tool for the creation of load profiles with variable intensity over time both from scratch and from existing data. Primarily, LIMBO\'s intended use is the description of load arrival behaviours in open workloads. Specifically, LIMBO can be employed for the creation of custom request or user arrival time-stamps or for the re-parameterization of existing traces. LIMBO bases on the Descartes Load Intensity Model (DLIM) for the formalized description of its load intensity profiles. The DLIM formalism can be understood as a structure for piece-wise defined and combined mathematical functions. We outline DLIM and its elements and demonstrate its integration within LIMBO. LIMBO is capable of generating request or user arrival time stamps from DLIM instances. In a next step, these generated time-stamps can be used for both open workload based benchmarking and simulations. The TimestampTimer plug-in for JMeter already allows the former. LIMBO also offers a range of tools for easy load intensity modeling and analysis, including, but not limited to, a visual decomposition of load intensity time-series into seasonal and trend parts, a simplified load intensity model as part of a model creation wizard, and an automated model instance extractor. As part of our LIMBO tutorial, we explain these features in detail. We demonstrate common use cases for LIMBO and show how they are supported. We also focus on LIMBOs extensible architecture and discuss how to use LIMBO as part of another tool-chain.\n
\n','
\n@inproceedings{KiHeKo2014-SOSP-LIMBO,\n  author = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Samuel Kounev},\n  abstract = {{LIMBO is a tool for the creation of load profiles with variable intensity over time both from scratch and from existing data. Primarily, LIMBO\'s intended use is the description of load arrival behaviours in open workloads. Specifically, LIMBO can be employed for the creation of custom request or user arrival time-stamps or for the re-parameterization of existing traces. LIMBO bases on the Descartes Load Intensity Model (DLIM) for the formalized description of its load intensity profiles. The DLIM formalism can be understood as a structure for piece-wise defined and combined mathematical functions. We outline DLIM and its elements and demonstrate its integration within LIMBO. LIMBO is capable of generating request or user arrival time stamps from DLIM instances. In a next step, these generated time-stamps can be used for both open workload based benchmarking and simulations. The TimestampTimer plug-in for JMeter already allows the former. LIMBO also offers a range of tools for easy load intensity modeling and analysis, including, but not limited to, a visual decomposition of load intensity time-series into seasonal and trend parts, a simplified load intensity model as part of a model creation wizard, and an automated model instance extractor. As part of our LIMBO tutorial, we explain these features in detail. We demonstrate common use cases for LIMBO and show how they are supported. We also focus on LIMBOs extensible architecture and discuss how to use LIMBO as part of another tool-chain.}},\n  title = {{Using and Extending LIMBO for the Descriptive Modeling of Arrival Behaviors}},\n  booktitle = {Proceedings of the Symposium on Software Performance 2014},\n  location = {Stuttgart, Germany},\n  month = {November},\n  year = {2014},\n  publisher = {University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology},\n  pages = {131--140},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/771.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/771},\n  note = {Best Poster Award}\n}\n
\n\n','{LIMBO is a tool for the creation of load profiles with variable intensity over time both from scratch and from existing data. Primarily, LIMBO\'s intended use is the description of load arrival behaviours in open workloads. Specifically, LIMBO can be employed for the creation of custom request or user arrival time-stamps or for the re-parameterization of existing traces. LIMBO bases on the Descartes Load Intensity Model (DLIM) for the formalized description of its load intensity profiles. The DLIM formalism can be understood as a structure for piece-wise defined and combined mathematical functions. We outline DLIM and its elements and demonstrate its integration within LIMBO. LIMBO is capable of generating request or user arrival time stamps from DLIM instances. In a next step, these generated time-stamps can be used for both open workload based benchmarking and simulations. The TimestampTimer plug-in for JMeter already allows the former. LIMBO also offers a range of tools for easy load intensity modeling and analysis, including, but not limited to, a visual decomposition of load intensity time-series into seasonal and trend parts, a simplified load intensity model as part of a model creation wizard, and an automated model instance extractor. As part of our LIMBO tutorial, we explain these features in detail. We demonstrate common use cases for LIMBO and show how they are supported. We also focus on LIMBOs extensible architecture and discuss how to use LIMBO as part of another tool-chain.}','{Using and Extending LIMBO for the Descriptive Modeling of Arrival Behaviors}',0,11,2014,11,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(772,'paper','KiBlBeLaArKo2015-ICPE-SERT','inproceedings','@inproceedings{KiBlBeLaArKo2015-ICPE-SERT,\n author = {J\\\'{o}akim von Kistowski and Hansfried Block and John Beckett and Klaus-Dieter Lange and Jeremy A. Arnold and Samuel Kounev},\n abstract = {{ Energy efficiency of servers has become a significant research topic over the last years, as server energy consumption varies depending on multiple factors, such as server utilization and workload type. Server energy analysis and estimation must take all relevant factors into account to ensure reliable estimates and conclusions. Thorough system analysis requires benchmarks capable of testing different system resources at different load levels using multiple workload types. Server energy estimation approaches, on the other hand, require knowledge about the interactions of these factors for the creation of accurate power models. Common approaches to energy-aware workload classification classify workloads depending on the resource types used by the different workloads. However, they rarely take into account differences in workloads targeting the same resources. Industrial energy-efficiency benchmarks typically do not evaluate the system\'s energy consumption at different resource load levels, and they only provide data for system analysis at maximum system load. In this paper, we benchmark multiple server configurations using the CPU worklets included in SPEC\'s Server Efficiency Rating Tool (SERT). We evaluate the impact of load levels and different CPU workloads on power consumption and energy efficiency. We analyze how functions approximating the measured power consumption differ over multiple server configurations and architectures. We show that workloads targeting the same resource can differ significantly in their power draw and energy efficiency. The power consumption of a given workload type varies depending on utilization, hardware and software configuration. The power consumption of CPU-intensive workloads does not scale uniformly with increased load, nor do hardware or software configuration changes affect it in a uniform manner.}},\n title = {{Analysis of the Influences on Server Power Consumption and Energy Efficiency for CPU-Intensive Workloads}},\n year = {2015},\n booktitle = {Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering (ICPE 2015)},\n location = {Austin, TX, USA},\n month = {February},\n publisher = {ACM},\n series = {ICPE \'15},\n doi = {http://dx.doi.org/10.1145/2668930.2688057},\n publisher = {ACM},\n address = {New York, NY, USA},\n keywords = {SPEC, SERT, Power, Workload Characterization, Energy Efficiency, Metrics, Utilization},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/772.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/772},\n note = {acceptance rate: 27\\%},\n}\n\n','\n\nJóakim von Kistowski, Hansfried Block, John Beckett, Klaus-Dieter Lange,\nJeremy A. Arnold, and Samuel Kounev.\nAnalysis of the Influences on Server Power Consumption and Energy\nEfficiency for CPU-Intensive Workloads.\nIn Proceedings of the 6th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2015), Austin, TX, USA, February 2015, ICPE\n\'15. ACM, New York, NY, USA.\nFebruary 2015, acceptance rate: 27%.\n[ bib | DOI | slides | .pdf | Abstract  ] 
\n@inproceedings{KiBlBeLaArKo2015-ICPE-SERT,\nauthor = {J\\\'{o}akim von Kistowski and Hansfried Block and John Beckett and Klaus-Dieter Lange and Jeremy A. Arnold and Samuel Kounev},\nabstract = {{ Energy efficiency of servers has become a significant research topic over the last years, as server energy consumption varies depending on multiple factors, such as server utilization and workload type. Server energy analysis and estimation must take all relevant factors into account to ensure reliable estimates and conclusions. Thorough system analysis requires benchmarks capable of testing different system resources at different load levels using multiple workload types. Server energy estimation approaches, on the other hand, require knowledge about the interactions of these factors for the creation of accurate power models. Common approaches to energy-aware workload classification classify workloads depending on the resource types used by the different workloads. However, they rarely take into account differences in workloads targeting the same resources. Industrial energy-efficiency benchmarks typically do not evaluate the system\'s energy consumption at different resource load levels, and they only provide data for system analysis at maximum system load. In this paper, we benchmark multiple server configurations using the CPU worklets included in SPEC\'s Server Efficiency Rating Tool (SERT). We evaluate the impact of load levels and different CPU workloads on power consumption and energy efficiency. We analyze how functions approximating the measured power consumption differ over multiple server configurations and architectures. We show that workloads targeting the same resource can differ significantly in their power draw and energy efficiency. The power consumption of a given workload type varies depending on utilization, hardware and software configuration. The power consumption of CPU-intensive workloads does not scale uniformly with increased load, nor do hardware or software configuration changes affect it in a uniform manner.}},\ntitle = {{Analysis of the Influences on Server Power Consumption and Energy Efficiency for CPU-Intensive Workloads}},\nyear = {2015},\nbooktitle = {Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering (ICPE 2015)},\nlocation = {Austin, TX, USA},\nmonth = {February},\npublisher = {ACM},\nseries = {ICPE \'15},\ndoi = {http://dx.doi.org/10.1145/2668930.2688057},\npublisher = {ACM},\naddress = {New York, NY, USA},\nkeywords = {SPEC, SERT, Power, Workload Characterization, Energy Efficiency, Metrics, Utilization},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/772.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/772},\nnote = {acceptance rate: 27\\%}\n}\n
\n
\nEnergy efficiency of servers has become a significant research topic over the last years, as server energy consumption varies depending on multiple factors, such as server utilization and workload type. Server energy analysis and estimation must take all relevant factors into account to ensure reliable estimates and conclusions. Thorough system analysis requires benchmarks capable of testing different system resources at different load levels using multiple workload types. Server energy estimation approaches, on the other hand, require knowledge about the interactions of these factors for the creation of accurate power models. Common approaches to energy-aware workload classification classify workloads depending on the resource types used by the different workloads. However, they rarely take into account differences in workloads targeting the same resources. Industrial energy-efficiency benchmarks typically do not evaluate the system\'s energy consumption at different resource load levels, and they only provide data for system analysis at maximum system load. In this paper, we benchmark multiple server configurations using the CPU worklets included in SPEC\'s Server Efficiency Rating Tool (SERT). We evaluate the impact of load levels and different CPU workloads on power consumption and energy efficiency. We analyze how functions approximating the measured power consumption differ over multiple server configurations and architectures. We show that workloads targeting the same resource can differ significantly in their power draw and energy efficiency. The power consumption of a given workload type varies depending on utilization, hardware and software configuration. The power consumption of CPU-intensive workloads does not scale uniformly with increased load, nor do hardware or software configuration changes affect it in a uniform manner.\n
\n','
\n@inproceedings{KiBlBeLaArKo2015-ICPE-SERT,\n  author = {J\\\'{o}akim von Kistowski and Hansfried Block and John Beckett and Klaus-Dieter Lange and Jeremy A. Arnold and Samuel Kounev},\n  abstract = {{ Energy efficiency of servers has become a significant research topic over the last years, as server energy consumption varies depending on multiple factors, such as server utilization and workload type. Server energy analysis and estimation must take all relevant factors into account to ensure reliable estimates and conclusions. Thorough system analysis requires benchmarks capable of testing different system resources at different load levels using multiple workload types. Server energy estimation approaches, on the other hand, require knowledge about the interactions of these factors for the creation of accurate power models. Common approaches to energy-aware workload classification classify workloads depending on the resource types used by the different workloads. However, they rarely take into account differences in workloads targeting the same resources. Industrial energy-efficiency benchmarks typically do not evaluate the system\'s energy consumption at different resource load levels, and they only provide data for system analysis at maximum system load. In this paper, we benchmark multiple server configurations using the CPU worklets included in SPEC\'s Server Efficiency Rating Tool (SERT). We evaluate the impact of load levels and different CPU workloads on power consumption and energy efficiency. We analyze how functions approximating the measured power consumption differ over multiple server configurations and architectures. We show that workloads targeting the same resource can differ significantly in their power draw and energy efficiency. The power consumption of a given workload type varies depending on utilization, hardware and software configuration. The power consumption of CPU-intensive workloads does not scale uniformly with increased load, nor do hardware or software configuration changes affect it in a uniform manner.}},\n  title = {{Analysis of the Influences on Server Power Consumption and Energy Efficiency for CPU-Intensive Workloads}},\n  year = {2015},\n  booktitle = {Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering (ICPE 2015)},\n  location = {Austin, TX, USA},\n  month = {February},\n  publisher = {ACM},\n  series = {ICPE \'15},\n  doi = {http://dx.doi.org/10.1145/2668930.2688057},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  keywords = {SPEC, SERT, Power, Workload Characterization, Energy Efficiency, Metrics, Utilization},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/772.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/772},\n  note = {acceptance rate: 27\\%}\n}\n
\n\n','{ Energy efficiency of servers has become a significant research topic over the last years, as server energy consumption varies depending on multiple factors, such as server utilization and workload type. Server energy analysis and estimation must take all relevant factors into account to ensure reliable estimates and conclusions. Thorough system analysis requires benchmarks capable of testing different system resources at different load levels using multiple workload types. Server energy estimation approaches, on the other hand, require knowledge about the interactions of these factors for the creation of accurate power models. Common approaches to energy-aware workload classification classify workloads depending on the resource types used by the different workloads. However, they rarely take into account differences in workloads targeting the same resources. Industrial energy-efficiency benchmarks typically do not evaluate the system\'s energy consumption at different resource load levels, and they only provide data for system analysis at maximum system load. In this paper, we benchmark multiple server configurations using the CPU worklets included in SPEC\'s Server Efficiency Rating Tool (SERT). We evaluate the impact of load levels and different CPU workloads on power consumption and energy efficiency. We analyze how functions approximating the measured power consumption differ over multiple server configurations and architectures. We show that workloads targeting the same resource can differ significantly in their power draw and energy efficiency. The power consumption of a given workload type varies depending on utilization, hardware and software configuration. The power consumption of CPU-intensive workloads does not scale uniformly with increased load, nor do hardware or software configuration changes affect it in a uniform manner.}','{Analysis of the Influences on Server Power Consumption and Energy Efficiency for CPU-Intensive Workloads}',0,2,2015,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(773,'paper','KiArHuLaHeCa2015-ICPE-Benchmark','inproceedings','@inproceedings{KiArHuLaHeCa2015-ICPE-Benchmark,\n author = {J\\\'{o}akim von Kistowski and Jeremy A. Arnold and Karl Huppler and Klaus-Dieter Lange and John L. Henning and Paul Cao},\n abstract = {{Standardized benchmarks have become widely accepted tools for the comparison of products and evaluation of methodologies. These benchmarks are created by consortia like SPEC and TPC under confidentiality agreements which provide little opportunity for outside observers to get a look at the processes and concerns that are prevalent in benchmark development. This paper introduces the primary concerns of benchmark development from the perspectives of SPEC and TPC committees. We provide a benchmark definition, outline the types of benchmarks, and explain the characteristics of a good benchmark. We focus on the characteristics important for a standardized benchmark, as created by the SPEC and TPC consortia. To this end, we specify the primary criteria to be employed for benchmark design and workload selection. We use multiple standardized benchmarks as examples to demonstrate how these criteria are ensured.}},\n title = {{How to Build a Benchmark}},\n year = {2015},\n booktitle = {Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering (ICPE 2015)},\n location = {Austin, TX, USA},\n month = {February},\n publisher = {ACM},\n series = {ICPE \'15},\n doi = {http://dx.doi.org/10.1145/2668930.2688819},\n publisher = {ACM},\n address = {New York, NY, USA},\n keywords = {SPEC; TPC; SPECpower\\_ssj2008; SERT; SPEC CPU},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/773.pdf},\n}\n\n','\n\nJóakim von Kistowski, Jeremy A. Arnold, Karl Huppler, Klaus-Dieter Lange,\nJohn L. Henning, and Paul Cao.\nHow to Build a Benchmark.\nIn Proceedings of the 6th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2015), Austin, TX, USA, February 2015, ICPE\n\'15. ACM, New York, NY, USA.\nFebruary 2015.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{KiArHuLaHeCa2015-ICPE-Benchmark,\nauthor = {J\\\'{o}akim von Kistowski and Jeremy A. Arnold and Karl Huppler and Klaus-Dieter Lange and John L. Henning and Paul Cao},\nabstract = {{Standardized benchmarks have become widely accepted tools for the comparison of products and evaluation of methodologies. These benchmarks are created by consortia like SPEC and TPC under confidentiality agreements which provide little opportunity for outside observers to get a look at the processes and concerns that are prevalent in benchmark development. This paper introduces the primary concerns of benchmark development from the perspectives of SPEC and TPC committees. We provide a benchmark definition, outline the types of benchmarks, and explain the characteristics of a good benchmark. We focus on the characteristics important for a standardized benchmark, as created by the SPEC and TPC consortia. To this end, we specify the primary criteria to be employed for benchmark design and workload selection. We use multiple standardized benchmarks as examples to demonstrate how these criteria are ensured.}},\ntitle = {{How to Build a Benchmark}},\nyear = {2015},\nbooktitle = {Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering (ICPE 2015)},\nlocation = {Austin, TX, USA},\nmonth = {February},\npublisher = {ACM},\nseries = {ICPE \'15},\ndoi = {http://dx.doi.org/10.1145/2668930.2688819},\npublisher = {ACM},\naddress = {New York, NY, USA},\nkeywords = {SPEC; TPC; SPECpower\\_ssj2008; SERT; SPEC CPU},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/773.pdf}\n}\n
\n
\nStandardized benchmarks have become widely accepted tools for the comparison of products and evaluation of methodologies. These benchmarks are created by consortia like SPEC and TPC under confidentiality agreements which provide little opportunity for outside observers to get a look at the processes and concerns that are prevalent in benchmark development. This paper introduces the primary concerns of benchmark development from the perspectives of SPEC and TPC committees. We provide a benchmark definition, outline the types of benchmarks, and explain the characteristics of a good benchmark. We focus on the characteristics important for a standardized benchmark, as created by the SPEC and TPC consortia. To this end, we specify the primary criteria to be employed for benchmark design and workload selection. We use multiple standardized benchmarks as examples to demonstrate how these criteria are ensured.\n
\n','
\n@inproceedings{KiArHuLaHeCa2015-ICPE-Benchmark,\n  author = {J\\\'{o}akim von Kistowski and Jeremy A. Arnold and Karl Huppler and Klaus-Dieter Lange and John L. Henning and Paul Cao},\n  abstract = {{Standardized benchmarks have become widely accepted tools for the comparison of products and evaluation of methodologies. These benchmarks are created by consortia like SPEC and TPC under confidentiality agreements which provide little opportunity for outside observers to get a look at the processes and concerns that are prevalent in benchmark development. This paper introduces the primary concerns of benchmark development from the perspectives of SPEC and TPC committees. We provide a benchmark definition, outline the types of benchmarks, and explain the characteristics of a good benchmark. We focus on the characteristics important for a standardized benchmark, as created by the SPEC and TPC consortia. To this end, we specify the primary criteria to be employed for benchmark design and workload selection. We use multiple standardized benchmarks as examples to demonstrate how these criteria are ensured.}},\n  title = {{How to Build a Benchmark}},\n  year = {2015},\n  booktitle = {Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering (ICPE 2015)},\n  location = {Austin, TX, USA},\n  month = {February},\n  publisher = {ACM},\n  series = {ICPE \'15},\n  doi = {http://dx.doi.org/10.1145/2668930.2688819},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  keywords = {SPEC; TPC; SPECpower\\_ssj2008; SERT; SPEC CPU},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/773.pdf}\n}\n
\n\n','{Standardized benchmarks have become widely accepted tools for the comparison of products and evaluation of methodologies. These benchmarks are created by consortia like SPEC and TPC under confidentiality agreements which provide little opportunity for outside observers to get a look at the processes and concerns that are prevalent in benchmark development. This paper introduces the primary concerns of benchmark development from the perspectives of SPEC and TPC committees. We provide a benchmark definition, outline the types of benchmarks, and explain the characteristics of a good benchmark. We focus on the characteristics important for a standardized benchmark, as created by the SPEC and TPC consortia. To this end, we specify the primary criteria to be employed for benchmark design and workload selection. We use multiple standardized benchmarks as examples to demonstrate how these criteria are ensured.}','{How to Build a Benchmark}',0,2,2015,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(774,'paper','WvGa','techreport','@techreport{WvGa,\n author = {G. Bohlender and E. Kaucher and R. Klatte and U. Kulisch and W. L. Miranker and Ch. Ullrich and J. Wolff v. Gudenberg},\n title = {FORTRAN for Contemporary Numerical Computation},\n institution = {IBM Research Report RC 8348, 1980},\n year = {1980},\n}\n\n','\n\nG. Bohlender, E. Kaucher, R. Klatte, U. Kulisch, W. L. Miranker, Ch. Ullrich,\nand J. Wolff v. Gudenberg.\nFortran for contemporary numerical computation.\nTechnical report, IBM Research Report RC 8348, 1980, 1980.\n[ bib  ] 
\n@techreport{WvGa,\nauthor = {G. Bohlender and E. Kaucher and R. Klatte and U. Kulisch and W. L. Miranker and Ch. Ullrich and J. Wolff v. Gudenberg},\ntitle = {FORTRAN for Contemporary Numerical Computation},\ninstitution = {IBM Research Report RC 8348, 1980},\nyear = {1980}\n}\n
\n
\n','
\n@techreport{WvGa,\n  author = {G. Bohlender and E. Kaucher and R. Klatte and U. Kulisch and W. L. Miranker and Ch. Ullrich and J. Wolff v. Gudenberg},\n  title = {FORTRAN for Contemporary Numerical Computation},\n  institution = {IBM Research Report RC 8348, 1980},\n  year = {1980}\n}\n
\n\n',NULL,'FORTRAN for Contemporary Numerical Computation',0,0,1980,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(775,'paper','Ko2015-ICPE_LT_Workshop-Keynote','inproceedings','@inproceedings{Ko2015-ICPE_LT_Workshop-Keynote,\n author = {Samuel Kounev},\n booktitle = {Proceedings of the 4th International Workshop on Large-Scale Testing (LT 2015), co-located with the 6th ACM/SPEC International Conference on Performance Engineering (ICPE 2015)},\n day = {1},\n location = {Austin, Texas, USA},\n month = {February},\n publisher = {ACM},\n title = {{Load Testing Elasticity and Performance Isolation in Shared Execution Environments}},\n numpages = {2},\n address = {New York, NY, USA},\n year = {2015},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/775.pdf},\n}\n\n','\n\nSamuel Kounev.\nLoad Testing Elasticity and Performance Isolation in Shared\nExecution Environments.\nIn Proceedings of the 4th International Workshop on Large-Scale\nTesting (LT 2015), co-located with the 6th ACM/SPEC International Conference\non Performance Engineering (ICPE 2015), Austin, Texas, USA, February 1,\n2015. ACM, New York, NY, USA.\nFebruary 2015.\n[ bib | .pdf  ] 
\n@inproceedings{Ko2015-ICPE_LT_Workshop-Keynote,\nauthor = {Samuel Kounev},\nbooktitle = {Proceedings of the 4th International Workshop on Large-Scale Testing (LT 2015), co-located with the 6th ACM/SPEC International Conference on Performance Engineering (ICPE 2015)},\nday = {1},\nlocation = {Austin, Texas, USA},\nmonth = {February},\npublisher = {ACM},\ntitle = {{Load Testing Elasticity and Performance Isolation in Shared Execution Environments}},\nnumpages = {2},\naddress = {New York, NY, USA},\nyear = {2015},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/775.pdf}\n}\n
\n
\n','
\n@inproceedings{Ko2015-ICPE_LT_Workshop-Keynote,\n  author = {Samuel Kounev},\n  booktitle = {Proceedings of the 4th International Workshop on Large-Scale Testing (LT 2015), co-located with the 6th ACM/SPEC International Conference on Performance Engineering (ICPE 2015)},\n  day = {1},\n  location = {Austin, Texas, USA},\n  month = {February},\n  publisher = {ACM},\n  title = {{Load Testing Elasticity and Performance Isolation in Shared Execution Environments}},\n  numpages = {2},\n  address = {New York, NY, USA},\n  year = {2015},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/775.pdf}\n}\n
\n\n',NULL,'{Load Testing Elasticity and Performance Isolation in Shared Execution Environments}',0,2,2015,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(776,'paper','KoBrHu2015-SE-SelfAwareDescartes','inproceedings','@inproceedings{KoBrHu2015-SE-SelfAwareDescartes,\n address = {Bonn, Germany},\n author = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\n booktitle = {Software Engineering 2015, Fachtagung des GI-Fachbereichs Softwaretechnik, 17. - 20. M\\\"{a}rz 2015, Dresden, Deutschland},\n publisher = {GI},\n series = {Lecture Notes in Informatics (LNI)},\n title = {{The Descartes Modeling Language for Self-Aware Performance and Resource Management}},\n year = {2015},\n month = {March},\n titleaddon = {{(Talk Extended Abstract)}},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/776.pdf},\n}\n\n','\n\nSamuel Kounev, Fabian Brosig, and Nikolaus Huber.\nThe Descartes Modeling Language for Self-Aware Performance and\nResource Management (Talk Extended Abstract).\nIn Software Engineering 2015, Fachtagung des GI-Fachbereichs\nSoftwaretechnik, 17. - 20. März 2015, Dresden, Deutschland, March 2015,\nLecture Notes in Informatics (LNI). GI, Bonn, Germany.\nMarch 2015.\n[ bib | .pdf  ] 
\n@inproceedings{KoBrHu2015-SE-SelfAwareDescartes,\naddress = {Bonn, Germany},\nauthor = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\nbooktitle = {Software Engineering 2015, Fachtagung des GI-Fachbereichs Softwaretechnik, 17. - 20. M\\\"{a}rz 2015, Dresden, Deutschland},\npublisher = {GI},\nseries = {Lecture Notes in Informatics (LNI)},\ntitle = {{The Descartes Modeling Language for Self-Aware Performance and Resource Management}},\nyear = {2015},\nmonth = {March},\ntitleaddon = {{(Talk Extended Abstract)}},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/776.pdf}\n}\n
\n
\n','
\n@inproceedings{KoBrHu2015-SE-SelfAwareDescartes,\n  address = {Bonn, Germany},\n  author = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\n  booktitle = {Software Engineering 2015, Fachtagung des GI-Fachbereichs Softwaretechnik, 17. - 20. M\\\"{a}rz 2015, Dresden, Deutschland},\n  publisher = {GI},\n  series = {Lecture Notes in Informatics (LNI)},\n  title = {{The Descartes Modeling Language for Self-Aware Performance and Resource Management}},\n  year = {2015},\n  month = {March},\n  titleaddon = {{(Talk Extended Abstract)}},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/776.pdf}\n}\n
\n\n',NULL,'{The Descartes Modeling Language for Self-Aware Performance and Resource Management}',0,3,2015,3,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(777,'paper','PT2011-kompozycja','article','@article{PT2011-kompozycja,\n author = {Krzysztof Brzostowski and Piotr Rygielski},\n title = {Automatyczna kompozycja uslug monitorowania dla systemu wspomagania treningu wytrzymalo\\\'sciowego sportowc\\\'ow},\n journal = {Przegl\\k{a}d Telekomunikacyjny, Wiadomo\\\'sci Telekomunikacyjne},\n volume = {84},\n issue = {8/9},\n pages = {1017--1022},\n note = {In Polish},\n year = {2011},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/777.pdf},\n}\n\n','\n\nKrzysztof Brzostowski and Piotr Rygielski.\nAutomatyczna kompozycja uslug monitorowania dla systemu wspomagania\ntreningu wytrzymalościowego sportowców.\nPrzegląd Telekomunikacyjny, Wiadomości Telekomunikacyjne,\n84:1017-1022, 2011.\nIn Polish.\n[ bib | .pdf  ] 
\n@article{PT2011-kompozycja,\nauthor = {Krzysztof Brzostowski and Piotr Rygielski},\ntitle = {Automatyczna kompozycja uslug monitorowania dla systemu wspomagania treningu wytrzymalo\\\'sciowego sportowc\\\'ow},\njournal = {Przegl\\k{a}d Telekomunikacyjny, Wiadomo\\\'sci Telekomunikacyjne},\nvolume = {84},\nissue = {8/9},\npages = {1017--1022},\nnote = {In Polish},\nyear = {2011},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/777.pdf}\n}\n
\n
\n','
\n@article{PT2011-kompozycja,\n  author = {Krzysztof Brzostowski and Piotr Rygielski},\n  title = {Automatyczna kompozycja uslug monitorowania dla systemu wspomagania treningu wytrzymalo\\\'sciowego sportowc\\\'ow},\n  journal = {Przegl\\k{a}d Telekomunikacyjny, Wiadomo\\\'sci Telekomunikacyjne},\n  volume = {84},\n  issue = {8/9},\n  pages = {1017--1022},\n  note = {In Polish},\n  year = {2011},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/777.pdf}\n}\n
\n\n',NULL,'Automatyczna kompozycja uslug monitorowania dla systemu wspomagania treningu wytrzymalo\\\'sciowego sportowc\\\'ow',0,0,2011,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(778,'paper','BuNoKoKoReAm2015-ICPE-WorkloadCharacterization','inproceedings','@inproceedings{BuNoKoKoReAm2015-ICPE-WorkloadCharacterization,\n address = {New York, NY, USA},\n author = {Busch, Axel and Noorshams, Qais and Kounev, Samuel and Koziolek, Anne and Reussner, Ralf and Amrehn, Erich},\n booktitle = {Proceedings of the ACM/SPEC International Conference on Performance Engineering},\n location = {Austin, Texas, USA},\n publisher = {ACM},\n series = {ICPE \'15},\n title = {{Automated Workload Characterization for I/O Performance Analysis in Virtualized Environments}},\n year = {2015},\n month = {February},\n url = {http://dx.doi.org/10.1145/2668930.2688050},\n doi = {10.1145/2668930.2688050},\n note = {Acceptance Rate (Full Paper): 15/56 = 27\\%.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/778.pdf},\n}\n\n','\n\nAxel Busch, Qais Noorshams, Samuel Kounev, Anne Koziolek, Ralf Reussner, and\nErich Amrehn.\nAutomated Workload Characterization for I/O Performance Analysis in\nVirtualized Environments.\nIn Proceedings of the ACM/SPEC International Conference on\nPerformance Engineering, Austin, Texas, USA, February 2015, ICPE \'15. ACM,\nNew York, NY, USA.\nFebruary 2015, Acceptance Rate (Full Paper): 15/56 = 27%.\n[ bib | DOI | http | .pdf  ] 
\n@inproceedings{BuNoKoKoReAm2015-ICPE-WorkloadCharacterization,\naddress = {New York, NY, USA},\nauthor = {Busch, Axel and Noorshams, Qais and Kounev, Samuel and Koziolek, Anne and Reussner, Ralf and Amrehn, Erich},\nbooktitle = {Proceedings of the ACM/SPEC International Conference on Performance Engineering},\nlocation = {Austin, Texas, USA},\npublisher = {ACM},\nseries = {ICPE \'15},\ntitle = {{Automated Workload Characterization for I/O Performance Analysis in Virtualized Environments}},\nyear = {2015},\nmonth = {February},\nurl = {http://dx.doi.org/10.1145/2668930.2688050},\ndoi = {10.1145/2668930.2688050},\nnote = {Acceptance Rate (Full Paper): 15/56 = 27\\%.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/778.pdf}\n}\n
\n
\n','
\n@inproceedings{BuNoKoKoReAm2015-ICPE-WorkloadCharacterization,\n  address = {New York, NY, USA},\n  author = {Busch, Axel and Noorshams, Qais and Kounev, Samuel and Koziolek, Anne and Reussner, Ralf and Amrehn, Erich},\n  booktitle = {Proceedings of the ACM/SPEC International Conference on Performance Engineering},\n  location = {Austin, Texas, USA},\n  publisher = {ACM},\n  series = {ICPE \'15},\n  title = {{Automated Workload Characterization for I/O Performance Analysis in Virtualized Environments}},\n  year = {2015},\n  month = {February},\n  url = {http://dx.doi.org/10.1145/2668930.2688050},\n  doi = {10.1145/2668930.2688050},\n  note = {Acceptance Rate (Full Paper): 15/56 = 27\\%.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/778.pdf}\n}\n
\n\n',NULL,'{Automated Workload Characterization for I/O Performance Analysis in Virtualized Environments}',0,2,2015,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(779,'paper','ReWeNoHaRe2014-AMT-Transformation','inproceedings','@inproceedings{ReWeNoHaRe2014-AMT-Transformation,\n author = {Andreas Rentschler and Dominik Werle and Qais Noorshams and Lucia Happe and Ralf Reussner},\n title = {{Remodularizing Legacy Model Transformations with Automatic Clustering Techniques}},\n _ee = {http://ceur-ws.org/Vol-1077/amt13_submission_4.pdf},\n editor = {Benoit Baudry and J{\\\"u}rgen Dingel and Levi Lucio and Hans Vangheluwe},\n booktitle = {Proceedings of the 3rd Workshop on the Analysis of Model Transformations (AMT@MODELS 2014), Valencia, Spain, September 29, 2014},\n publisher = {CEUR-WS.org},\n series = {CEUR Workshop Proceedings},\n _volume = {1077},\n month = {October},\n year = {2014},\n bibsource = {DBLP, http://dblp.uni-trier.de},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/779.pdf},\n}\n\n','\n\nAndreas Rentschler, Dominik Werle, Qais Noorshams, Lucia Happe, and Ralf\nReussner.\nRemodularizing Legacy Model Transformations with Automatic\nClustering Techniques.\nIn Proceedings of the 3rd Workshop on the Analysis of Model\nTransformations (AMT@MODELS 2014), Valencia, Spain, September 29, 2014,\nBenoit Baudry, Jürgen Dingel, Levi Lucio, and Hans Vangheluwe, editors,\nOctober 2014, CEUR Workshop Proceedings. CEUR-WS.org.\nOctober 2014.\n[ bib | .pdf  ] 
\n@inproceedings{ReWeNoHaRe2014-AMT-Transformation,\nauthor = {Andreas Rentschler and Dominik Werle and Qais Noorshams and Lucia Happe and Ralf Reussner},\ntitle = {{Remodularizing Legacy Model Transformations with Automatic Clustering Techniques}},\n_ee = {http://ceur-ws.org/Vol-1077/amt13_submission_4.pdf},\neditor = {Benoit Baudry and J{\\\"u}rgen Dingel and Levi Lucio and Hans Vangheluwe},\nbooktitle = {Proceedings of the 3rd Workshop on the Analysis of Model Transformations (AMT@MODELS 2014), Valencia, Spain, September 29, 2014},\npublisher = {CEUR-WS.org},\nseries = {CEUR Workshop Proceedings},\n_volume = {1077},\nmonth = {October},\nyear = {2014},\nbibsource = {DBLP, http://dblp.uni-trier.de},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/779.pdf}\n}\n
\n
\n','
\n@inproceedings{ReWeNoHaRe2014-AMT-Transformation,\n  author = {Andreas Rentschler and Dominik Werle and Qais Noorshams and Lucia Happe and Ralf Reussner},\n  title = {{Remodularizing Legacy Model Transformations with Automatic Clustering Techniques}},\n  _ee = {http://ceur-ws.org/Vol-1077/amt13_submission_4.pdf},\n  editor = {Benoit Baudry and J{\\\"u}rgen Dingel and Levi Lucio and Hans Vangheluwe},\n  booktitle = {Proceedings of the 3rd Workshop on the Analysis of Model Transformations (AMT@MODELS 2014), Valencia, Spain, September 29, 2014},\n  publisher = {CEUR-WS.org},\n  series = {CEUR Workshop Proceedings},\n  _volume = {1077},\n  month = {October},\n  year = {2014},\n  bibsource = {DBLP, http://dblp.uni-trier.de},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/779.pdf}\n}\n
\n\n',NULL,'{Remodularizing Legacy Model Transformations with Automatic Clustering Techniques}',0,10,2014,10,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(780,'paper','KiHeZoKoHo2015_SEAMS_DLIMExtraction','inproceedings','@inproceedings{KiHeZoKoHo2015_SEAMS_DLIMExtraction,\n author = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Daniel Zoller and Samuel Kounev and Andreas Hotho},\n title = {{Modeling and Extracting Load Intensity Profiles}},\n keywords = {load intensity variation, load profile, meta-modeling, model extraction, open workloads, transformation},\n booktitle = {Proceedings of the 10th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2015)},\n abstract = {Today\'s system developers and operators face the challenge of creating software systems that make efficient use of dynamically allocated resources under highly variable and dynamic load profiles, while at the same time delivering reliable performance. Benchmarking of systems under these constraints is difficult, as state-of-the-art benchmarking frameworks provide only limited support for emulating such dynamic and highly variable load profiles for the creation of realistic workload scenarios. Industrial benchmarks typically confine themselves to workloads with constant or stepwise increasing loads. Alternatively, they support replaying of recorded load traces. Statistical load intensity descriptions also do not sufficiently capture concrete pattern load profile variations over time. To address these issues, we present the Descartes Load Intensity Model (DLIM). DLIM provides a modeling formalism for describing load intensity variations over time. A DLIM instance can be used as a compact representation of a recorded load intensity trace, providing a powerful tool for benchmarking and performance analysis. As manually obtaining DLIM instances can be time consuming, we present three different automated extraction methods, which also help to enable autonomous system analysis for self-adaptive systems. Model expressiveness is validated using the presented extraction methods. Extracted DLIM instances exhibit a median modeling error of 12.4% on average over nine different real-world traces covering between two weeks and seven months. Additionally, extraction methods perform orders of magnitude faster than existing time series decomposition approaches.},\n day = {18--19},\n location = {Firenze, Italy},\n month = {May},\n year = {2015},\n note = {Acceptance rate: 29\\%},\n doi = {http://dx.doi.org/10.1109/SEAMS.2015.19},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/780.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/780},\n}\n\n','\n\nJóakim von Kistowski, Nikolas Roman Herbst, Daniel Zoller, Samuel Kounev,\nand Andreas Hotho.\nModeling and Extracting Load Intensity Profiles.\nIn Proceedings of the 10th International Symposium on Software\nEngineering for Adaptive and Self-Managing Systems (SEAMS 2015), Firenze,\nItaly, May 18-19, 2015.\nAcceptance rate: 29%.\n[ bib | DOI | slides | .pdf | Abstract  ] 
\n@inproceedings{KiHeZoKoHo2015_SEAMS_DLIMExtraction,\nauthor = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Daniel Zoller and Samuel Kounev and Andreas Hotho},\ntitle = {{Modeling and Extracting Load Intensity Profiles}},\nkeywords = {load intensity variation, load profile, meta-modeling, model extraction, open workloads, transformation},\nbooktitle = {Proceedings of the 10th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2015)},\nabstract = {Today\'s system developers and operators face the challenge of creating software systems that make efficient use of dynamically allocated resources under highly variable and dynamic load profiles, while at the same time delivering reliable performance. Benchmarking of systems under these constraints is difficult, as state-of-the-art benchmarking frameworks provide only limited support for emulating such dynamic and highly variable load profiles for the creation of realistic workload scenarios. Industrial benchmarks typically confine themselves to workloads with constant or stepwise increasing loads. Alternatively, they support replaying of recorded load traces. Statistical load intensity descriptions also do not sufficiently capture concrete pattern load profile variations over time. To address these issues, we present the Descartes Load Intensity Model (DLIM). DLIM provides a modeling formalism for describing load intensity variations over time. A DLIM instance can be used as a compact representation of a recorded load intensity trace, providing a powerful tool for benchmarking and performance analysis. As manually obtaining DLIM instances can be time consuming, we present three different automated extraction methods, which also help to enable autonomous system analysis for self-adaptive systems. Model expressiveness is validated using the presented extraction methods. Extracted DLIM instances exhibit a median modeling error of 12.4% on average over nine different real-world traces covering between two weeks and seven months. Additionally, extraction methods perform orders of magnitude faster than existing time series decomposition approaches.},\nday = {18--19},\nlocation = {Firenze, Italy},\nmonth = {May},\nyear = {2015},\nnote = {Acceptance rate: 29\\%},\ndoi = {http://dx.doi.org/10.1109/SEAMS.2015.19},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/780.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/780}\n}\n
\n
\nToday\'s system developers and operators face the challenge of creating software systems that make efficient use of dynamically allocated resources under highly variable and dynamic load profiles, while at the same time delivering reliable performance. Benchmarking of systems under these constraints is difficult, as state-of-the-art benchmarking frameworks provide only limited support for emulating such dynamic and highly variable load profiles for the creation of realistic workload scenarios. Industrial benchmarks typically confine themselves to workloads with constant or stepwise increasing loads. Alternatively, they support replaying of recorded load traces. Statistical load intensity descriptions also do not sufficiently capture concrete pattern load profile variations over time. To address these issues, we present the Descartes Load Intensity Model (DLIM). DLIM provides a modeling formalism for describing load intensity variations over time. A DLIM instance can be used as a compact representation of a recorded load intensity trace, providing a powerful tool for benchmarking and performance analysis. As manually obtaining DLIM instances can be time consuming, we present three different automated extraction methods, which also help to enable autonomous system analysis for self-adaptive systems. Model expressiveness is validated using the presented extraction methods. Extracted DLIM instances exhibit a median modeling error of 12.4% on average over nine different real-world traces covering between two weeks and seven months. Additionally, extraction methods perform orders of magnitude faster than existing time series decomposition approaches.\n
\n','
\n@inproceedings{KiHeZoKoHo2015_SEAMS_DLIMExtraction,\n  author = {J\\\'{o}akim von Kistowski and Nikolas Roman Herbst and Daniel Zoller and Samuel Kounev and Andreas Hotho},\n  title = {{Modeling and Extracting Load Intensity Profiles}},\n  keywords = {load intensity variation, load profile, meta-modeling, model extraction, open workloads, transformation},\n  booktitle = {Proceedings of the 10th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2015)},\n  abstract = {Today\'s system developers and operators face the challenge of creating software systems that make efficient use of dynamically allocated resources under highly variable and dynamic load profiles, while at the same time delivering reliable performance. Benchmarking of systems under these constraints is difficult, as state-of-the-art benchmarking frameworks provide only limited support for emulating such dynamic and highly variable load profiles for the creation of realistic workload scenarios. Industrial benchmarks typically confine themselves to workloads with constant or stepwise increasing loads. Alternatively, they support replaying of recorded load traces. Statistical load intensity descriptions also do not sufficiently capture concrete pattern load profile variations over time. To address these issues, we present the Descartes Load Intensity Model (DLIM). DLIM provides a modeling formalism for describing load intensity variations over time. A DLIM instance can be used as a compact representation of a recorded load intensity trace, providing a powerful tool for benchmarking and performance analysis. As manually obtaining DLIM instances can be time consuming, we present three different automated extraction methods, which also help to enable autonomous system analysis for self-adaptive systems. Model expressiveness is validated using the presented extraction methods. Extracted DLIM instances exhibit a median modeling error of 12.4% on average over nine different real-world traces covering between two weeks and seven months. Additionally, extraction methods perform orders of magnitude faster than existing time series decomposition approaches.},\n  day = {18--19},\n  location = {Firenze, Italy},\n  month = {May},\n  year = {2015},\n  note = {Acceptance rate: 29\\%},\n  doi = {http://dx.doi.org/10.1109/SEAMS.2015.19},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/780.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/780}\n}\n
\n\n','Today\'s system developers and operators face the challenge of creating software systems that make efficient use of dynamically allocated resources under highly variable and dynamic load profiles, while at the same time delivering reliable performance. Benchmarking of systems under these constraints is difficult, as state-of-the-art benchmarking frameworks provide only limited support for emulating such dynamic and highly variable load profiles for the creation of realistic workload scenarios. Industrial benchmarks typically confine themselves to workloads with constant or stepwise increasing loads. Alternatively, they support replaying of recorded load traces. Statistical load intensity descriptions also do not sufficiently capture concrete pattern load profile variations over time. To address these issues, we present the Descartes Load Intensity Model (DLIM). DLIM provides a modeling formalism for describing load intensity variations over time. A DLIM instance can be used as a compact representation of a recorded load intensity trace, providing a powerful tool for benchmarking and performance analysis. As manually obtaining DLIM instances can be time consuming, we present three different automated extraction methods, which also help to enable autonomous system analysis for self-adaptive systems. Model expressiveness is validated using the presented extraction methods. Extracted DLIM instances exhibit a median modeling error of 12.4% on average over nine different real-world traces covering between two weeks and seven months. Additionally, extraction methods perform orders of magnitude faster than existing time series decomposition approaches.','{Modeling and Extracting Load Intensity Profiles}',0,5,2015,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(781,'paper','SPEC-RG-NEWSLETTER-4','misc','@misc{SPEC-RG-NEWSLETTER-4,\n author = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\n month = {January},\n note = {Published by Standard Performance Evaluation Corporation (SPEC)},\n title = {{SPEC Research Group Newsletter, vol. 1 no. 4}},\n url = {http://research.spec.org/en/newsletter.html},\n year = {2015},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/781.pdf},\n}\n\n','\n\nSamuel Kounev, Kai Sachs, and Piotr Rygielski.\nSPEC Research Group Newsletter, vol. 1 no. 4, January 2015.\nPublished by Standard Performance Evaluation Corporation (SPEC).\n[ bib | .html | .pdf  ] 
\n@misc{SPEC-RG-NEWSLETTER-4,\nauthor = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\nmonth = {January},\nnote = {Published by Standard Performance Evaluation Corporation (SPEC)},\ntitle = {{SPEC Research Group Newsletter, vol. 1 no. 4}},\nurl = {http://research.spec.org/en/newsletter.html},\nyear = {2015},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/781.pdf}\n}\n
\n
\n','
\n@misc{SPEC-RG-NEWSLETTER-4,\n  author = {Samuel Kounev and Kai Sachs and Piotr Rygielski},\n  month = {January},\n  note = {Published by Standard Performance Evaluation Corporation (SPEC)},\n  title = {{SPEC Research Group Newsletter, vol. 1 no. 4}},\n  url = {http://research.spec.org/en/newsletter.html},\n  year = {2015},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/781.pdf}\n}\n
\n\n',NULL,'{SPEC Research Group Newsletter, vol. 1 no. 4}',0,1,2015,1,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(782,'paper','HeKoWeGr_2015_SEAMS_BUNGEE','inproceedings','@inproceedings{HeKoWeGr_2015_SEAMS_BUNGEE,\n author = {Nikolas Roman Herbst and Samuel Kounev and Andreas Weber and Henning Groenda},\n title = {{BUNGEE: An Elasticity Benchmark for Self-Adaptive IaaS Cloud Environments}},\n keywords = {IaaS, benchmark, metric, cloud, elasticity, resource, measurement},\n booktitle = {Proceedings of the 10th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2015)},\n abstract = {Today\'s infrastructure clouds provide resource elasticity (i.e. auto-scaling) mechanisms enabling self-adaptive resource provisioning to reflect variations in the load intensity over time. These mechanisms impact on the application performance, however, their effect in specific situations is hard to quantify and compare. To evaluate the quality of elasticity mechanisms provided by different platforms and configurations, respective metrics and benchmarks are required. Existing metrics for elasticity only consider the time required to provision and deprovision resources or the costs impact of adaptations. Existing benchmarks lack the capability to handle open workloads with realistic load intensity profiles and do not explicitly distinguish between the performance exhibited by the provisioned underlying resources, on the one hand, and the quality of the elasticity mechanisms themselves, on the other hand. In this paper, we propose reliable metrics for quantifying the timing aspects and accuracy of elasticity. Based on these metrics, we propose a novel approach for benchmarking the elasticity of Infrastructure-as-a-Service (IaaS) cloud platforms independent of the performance exhibited by the provisioned underlying resources. We show that the proposed metrics provide consistent ranking of elastic platforms on an ordinal scale. Finally, we present an extensive case study of real-world complexity demonstrating that the proposed approach is applicable in realistic scenarios and can cope with different levels of resource efficiency.},\n day = {18--19},\n location = {Firenze, Italy},\n month = {May},\n year = {2015},\n note = {Acceptance rate: 29\\%},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/782.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/782},\n}\n\n','\n\nNikolas Roman Herbst, Samuel Kounev, Andreas Weber, and Henning Groenda.\nBUNGEE: An Elasticity Benchmark for Self-Adaptive IaaS Cloud\nEnvironments.\nIn Proceedings of the 10th International Symposium on Software\nEngineering for Adaptive and Self-Managing Systems (SEAMS 2015), Firenze,\nItaly, May 18-19, 2015.\nAcceptance rate: 29%.\n[ bib | slides | .pdf | Abstract  ] 
\n@inproceedings{HeKoWeGr_2015_SEAMS_BUNGEE,\nauthor = {Nikolas Roman Herbst and Samuel Kounev and Andreas Weber and Henning Groenda},\ntitle = {{BUNGEE: An Elasticity Benchmark for Self-Adaptive IaaS Cloud Environments}},\nkeywords = {IaaS, benchmark, metric, cloud, elasticity, resource, measurement},\nbooktitle = {Proceedings of the 10th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2015)},\nabstract = {Today\'s infrastructure clouds provide resource elasticity (i.e. auto-scaling) mechanisms enabling self-adaptive resource provisioning to reflect variations in the load intensity over time. These mechanisms impact on the application performance, however, their effect in specific situations is hard to quantify and compare. To evaluate the quality of elasticity mechanisms provided by different platforms and configurations, respective metrics and benchmarks are required. Existing metrics for elasticity only consider the time required to provision and deprovision resources or the costs impact of adaptations. Existing benchmarks lack the capability to handle open workloads with realistic load intensity profiles and do not explicitly distinguish between the performance exhibited by the provisioned underlying resources, on the one hand, and the quality of the elasticity mechanisms themselves, on the other hand. In this paper, we propose reliable metrics for quantifying the timing aspects and accuracy of elasticity. Based on these metrics, we propose a novel approach for benchmarking the elasticity of Infrastructure-as-a-Service (IaaS) cloud platforms independent of the performance exhibited by the provisioned underlying resources. We show that the proposed metrics provide consistent ranking of elastic platforms on an ordinal scale. Finally, we present an extensive case study of real-world complexity demonstrating that the proposed approach is applicable in realistic scenarios and can cope with different levels of resource efficiency.},\nday = {18--19},\nlocation = {Firenze, Italy},\nmonth = {May},\nyear = {2015},\nnote = {Acceptance rate: 29\\%},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/782.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/782}\n}\n
\n
\nToday\'s infrastructure clouds provide resource elasticity (i.e. auto-scaling) mechanisms enabling self-adaptive resource provisioning to reflect variations in the load intensity over time. These mechanisms impact on the application performance, however, their effect in specific situations is hard to quantify and compare. To evaluate the quality of elasticity mechanisms provided by different platforms and configurations, respective metrics and benchmarks are required. Existing metrics for elasticity only consider the time required to provision and deprovision resources or the costs impact of adaptations. Existing benchmarks lack the capability to handle open workloads with realistic load intensity profiles and do not explicitly distinguish between the performance exhibited by the provisioned underlying resources, on the one hand, and the quality of the elasticity mechanisms themselves, on the other hand. In this paper, we propose reliable metrics for quantifying the timing aspects and accuracy of elasticity. Based on these metrics, we propose a novel approach for benchmarking the elasticity of Infrastructure-as-a-Service (IaaS) cloud platforms independent of the performance exhibited by the provisioned underlying resources. We show that the proposed metrics provide consistent ranking of elastic platforms on an ordinal scale. Finally, we present an extensive case study of real-world complexity demonstrating that the proposed approach is applicable in realistic scenarios and can cope with different levels of resource efficiency.\n
\n','
\n@inproceedings{HeKoWeGr_2015_SEAMS_BUNGEE,\n  author = {Nikolas Roman Herbst and Samuel Kounev and Andreas Weber and Henning Groenda},\n  title = {{BUNGEE: An Elasticity Benchmark for Self-Adaptive IaaS Cloud Environments}},\n  keywords = {IaaS, benchmark, metric, cloud, elasticity, resource, measurement},\n  booktitle = {Proceedings of the 10th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2015)},\n  abstract = {Today\'s infrastructure clouds provide resource elasticity (i.e. auto-scaling) mechanisms enabling self-adaptive resource provisioning to reflect variations in the load intensity over time. These mechanisms impact on the application performance, however, their effect in specific situations is hard to quantify and compare. To evaluate the quality of elasticity mechanisms provided by different platforms and configurations, respective metrics and benchmarks are required. Existing metrics for elasticity only consider the time required to provision and deprovision resources or the costs impact of adaptations. Existing benchmarks lack the capability to handle open workloads with realistic load intensity profiles and do not explicitly distinguish between the performance exhibited by the provisioned underlying resources, on the one hand, and the quality of the elasticity mechanisms themselves, on the other hand. In this paper, we propose reliable metrics for quantifying the timing aspects and accuracy of elasticity. Based on these metrics, we propose a novel approach for benchmarking the elasticity of Infrastructure-as-a-Service (IaaS) cloud platforms independent of the performance exhibited by the provisioned underlying resources. We show that the proposed metrics provide consistent ranking of elastic platforms on an ordinal scale. Finally, we present an extensive case study of real-world complexity demonstrating that the proposed approach is applicable in realistic scenarios and can cope with different levels of resource efficiency.},\n  day = {18--19},\n  location = {Firenze, Italy},\n  month = {May},\n  year = {2015},\n  note = {Acceptance rate: 29\\%},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/782.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/782}\n}\n
\n\n','Today\'s infrastructure clouds provide resource elasticity (i.e. auto-scaling) mechanisms enabling self-adaptive resource provisioning to reflect variations in the load intensity over time. These mechanisms impact on the application performance, however, their effect in specific situations is hard to quantify and compare. To evaluate the quality of elasticity mechanisms provided by different platforms and configurations, respective metrics and benchmarks are required. Existing metrics for elasticity only consider the time required to provision and deprovision resources or the costs impact of adaptations. Existing benchmarks lack the capability to handle open workloads with realistic load intensity profiles and do not explicitly distinguish between the performance exhibited by the provisioned underlying resources, on the one hand, and the quality of the elasticity mechanisms themselves, on the other hand. In this paper, we propose reliable metrics for quantifying the timing aspects and accuracy of elasticity. Based on these metrics, we propose a novel approach for benchmarking the elasticity of Infrastructure-as-a-Service (IaaS) cloud platforms independent of the performance exhibited by the provisioned underlying resources. We show that the proposed metrics provide consistent ranking of elastic platforms on an ordinal scale. Finally, we present an extensive case study of real-world complexity demonstrating that the proposed approach is applicable in realistic scenarios and can cope with different levels of resource efficiency.','{BUNGEE: An Elasticity Benchmark for Self-Adaptive IaaS Cloud Environments}',0,5,2015,5,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(783,'paper','Yavuz2013-monitoring-control-flow','mastersthesis','@mastersthesis{Yavuz2013-monitoring-control-flow,\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n author = {Can Alexander Yavuz},\n month = {April},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{\\\"{U}berwachung des effektiven Kontrollflusses einer mehrschichtigen Anwendung}},\n year = {2013},\n type = {Bachelor\'s Thesis},\n}\n\n','\n\nCan Alexander Yavuz.\nÜberwachung des effektiven Kontrollflusses einer mehrschichtigen\nAnwendung.\nBachelor\'s thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, April 2013.\n[ bib  ] 
\n@mastersthesis{Yavuz2013-monitoring-control-flow,\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nauthor = {Can Alexander Yavuz},\nmonth = {April},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{\\\"{U}berwachung des effektiven Kontrollflusses einer mehrschichtigen Anwendung}},\nyear = {2013},\ntype = {Bachelor\'s Thesis}\n}\n
\n
\n','
\n@mastersthesis{Yavuz2013-monitoring-control-flow,\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  author = {Can Alexander Yavuz},\n  month = {April},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{\\\"{U}berwachung des effektiven Kontrollflusses einer mehrschichtigen Anwendung}},\n  year = {2013},\n  type = {Bachelor\'s Thesis}\n}\n
\n\n',NULL,'{\\\"{U}berwachung des effektiven Kontrollflusses einer mehrschichtigen Anwendung}',0,4,2013,4,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(784,'talk','talk-Kounev-LT2015','misc','@misc{talk-Kounev-LT2015,\n title = {{Load Testing Elasticity and Performance Isolation in Shared Execution Environments.}},\n howpublished = {Keynote Talk at the 4th International Workshop on Large-Scale Testing (LT 2015), co-located with ICPE 2015, Austin, TX, USA, February 1, 2015},\n author = {Samuel Kounev},\n days = {1},\n month = {February},\n year = {2015},\n}\n\n','\n\nSamuel Kounev.\nLoad Testing Elasticity and Performance Isolation in Shared\nExecution Environments.\nKeynote Talk at the 4th International Workshop on Large-Scale Testing\n(LT 2015), co-located with ICPE 2015, Austin, TX, USA, February 1, 2015,\nFebruary 2015.\n[ bib  ] 
\n@misc{talk-Kounev-LT2015,\ntitle = {{Load Testing Elasticity and Performance Isolation in Shared Execution Environments.}},\nhowpublished = {Keynote Talk at the 4th International Workshop on Large-Scale Testing (LT 2015), co-located with ICPE 2015, Austin, TX, USA, February 1, 2015},\nauthor = {Samuel Kounev},\ndays = {1},\nmonth = {February},\nyear = {2015}\n}\n
\n
\n','
\n@misc{talk-Kounev-LT2015,\n  title = {{Load Testing Elasticity and Performance Isolation in Shared Execution Environments.}},\n  howpublished = {Keynote Talk at the 4th International Workshop on Large-Scale Testing (LT 2015), co-located with ICPE 2015, Austin, TX, USA, February 1, 2015},\n  author = {Samuel Kounev},\n  days = {1},\n  month = {February},\n  year = {2015}\n}\n
\n\n',NULL,'{Load Testing Elasticity and Performance Isolation in Shared Execution Environments.}',0,2,2015,2,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(785,'talk','talk-Rygielski-OEW2012','misc','@misc{talk-Rygielski-OEW2012,\n author = {Piotr Rygielski},\n title = {{Modeling Virtualized Cloud Data Center Networks: Do We need QoS in Networks?}},\n howpublished = {Open Excellence Workshop (Invited Talk), Charles University in Prague, Czech Republic.},\n days = {21},\n month = {June},\n year = {2012},\n}\n\n','\n\nPiotr Rygielski.\nModeling Virtualized Cloud Data Center Networks: Do We need QoS in\nNetworks?\nOpen Excellence Workshop (Invited Talk), Charles University in\nPrague, Czech Republic., June 2012.\n[ bib  ] 
\n@misc{talk-Rygielski-OEW2012,\nauthor = {Piotr Rygielski},\ntitle = {{Modeling Virtualized Cloud Data Center Networks: Do We need QoS in Networks?}},\nhowpublished = {Open Excellence Workshop (Invited Talk), Charles University in Prague, Czech Republic.},\ndays = {21},\nmonth = {June},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Rygielski-OEW2012,\n  author = {Piotr Rygielski},\n  title = {{Modeling Virtualized Cloud Data Center Networks: Do We need QoS in Networks?}},\n  howpublished = {Open Excellence Workshop (Invited Talk), Charles University in Prague, Czech Republic.},\n  days = {21},\n  month = {June},\n  year = {2012}\n}\n
\n\n',NULL,'{Modeling Virtualized Cloud Data Center Networks: Do We need QoS in Networks?}',0,6,2012,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(786,'paper','Rattu2012','mastersthesis','@mastersthesis{Rattu2012,\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n author = {Dharminder Rattu},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Infrastructure Reconfiguration Using Architecture-Level Performance Models}},\n year = {2012},\n type = {{Master\'s thesis}},\n}\n\n','\n\nDharminder Rattu.\nInfrastructure Reconfiguration Using Architecture-Level Performance\nModels.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, 2012.\n[ bib  ] 
\n@mastersthesis{Rattu2012,\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nauthor = {Dharminder Rattu},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Infrastructure Reconfiguration Using Architecture-Level Performance Models}},\nyear = {2012},\ntype = {{Master\'s thesis}}\n}\n
\n
\n','
\n@mastersthesis{Rattu2012,\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  author = {Dharminder Rattu},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Infrastructure Reconfiguration Using Architecture-Level Performance Models}},\n  year = {2012},\n  type = {{Master\'s thesis}}\n}\n
\n\n',NULL,'{Infrastructure Reconfiguration Using Architecture-Level Performance Models}',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(787,'paper','Schott2012','mastersthesis','@mastersthesis{Schott2012,\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n author = {Waldemar Schott},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Verbesserte Performance-Vorhersage f\\\"{u}r virtualisierte Umgebungen durchIntegration von Messergebnissen}},\n year = {2012},\n type = {{Bachelor\'s thesis}},\n note = {{(in German)}},\n}\n\n','\n\nWaldemar Schott.\nVerbesserte Performance-Vorhersage für virtualisierte Umgebungen\ndurchIntegration von Messergebnissen.\nBachelor\'s thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, 2012.\n(in German).\n[ bib  ] 
\n@mastersthesis{Schott2012,\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nauthor = {Waldemar Schott},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Verbesserte Performance-Vorhersage f\\\"{u}r virtualisierte Umgebungen durchIntegration von Messergebnissen}},\nyear = {2012},\ntype = {{Bachelor\'s thesis}},\nnote = {{(in German)}}\n}\n
\n
\n','
\n@mastersthesis{Schott2012,\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  author = {Waldemar Schott},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Verbesserte Performance-Vorhersage f\\\"{u}r virtualisierte Umgebungen durchIntegration von Messergebnissen}},\n  year = {2012},\n  type = {{Bachelor\'s thesis}},\n  note = {{(in German)}}\n}\n
\n\n',NULL,'{Verbesserte Performance-Vorhersage f\\\"{u}r virtualisierte Umgebungen durchIntegration von Messergebnissen}',0,0,2012,0,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 10:18:11',0),(788,'paper','Hildebrandt2014','mastersthesis','@mastersthesis{Hildebrandt2014,\n author = {Adrian Hildebrandt},\n address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n school = {University of W\\\"urzburg},\n title = {{Automated Transformation of Descartes Modeling Language to Palladio Component Models}},\n year = {2015},\n month = {January},\n type = {{Bachelor Thesis}},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/788},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/788.pdf},\n}\n\n','\n\nAdrian Hildebrandt.\nAutomated Transformation of Descartes Modeling Language to Palladio\nComponent Models.\nBachelor Thesis, University of Würzburg, Am Hubland,\nInformatikgebäude, 97074 Würzburg, Germany, January 2015.\n[ bib | slides | .pdf  ] 
\n@mastersthesis{Hildebrandt2014,\nauthor = {Adrian Hildebrandt},\naddress = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\nschool = {University of W\\\"urzburg},\ntitle = {{Automated Transformation of Descartes Modeling Language to Palladio Component Models}},\nyear = {2015},\nmonth = {January},\ntype = {{Bachelor Thesis}},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/788},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/788.pdf}\n}\n
\n
\n','
\n@mastersthesis{Hildebrandt2014,\n  author = {Adrian Hildebrandt},\n  address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n  school = {University of W\\\"urzburg},\n  title = {{Automated Transformation of Descartes Modeling Language to Palladio Component Models}},\n  year = {2015},\n  month = {January},\n  type = {{Bachelor Thesis}},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/788},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/788.pdf}\n}\n
\n\n',NULL,'{Automated Transformation of Descartes Modeling Language to Palladio Component Models}',0,1,2015,1,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:03',0),(789,'paper','RyKoTr2015-SIMUTools-FlexPerformancePrediction','inproceedings','@inproceedings{RyKoTr2015-SIMUTools-FlexPerformancePrediction,\n title = {{Flexible Performance Prediction of Data Center Networks using Automatically Generated Simulation Models}},\n year = {2015},\n month = {August},\n days = {24--26},\n pages = {119--128},\n isbn = {978-1-63190-079-2},\n doi = {10.4108/eai.24-8-2015.2260961},\n location = {Athens, Greece},\n booktitle = {Proceedings of the Eighth International Conference on Simulation Tools and Techniques (SIMUTools 2015)},\n author = {Piotr Rygielski and Samuel Kounev and Phuoc Tran-Gia},\n abstract = {{Using different modeling and simulation approaches for predicting network performance requires extensive experience and involves a number of time consuming manual steps regarding each of the modeling formalisms. In this paper, we propose a generic approach to modeling the performance of data center networks. The approach offers multiple performance models but requires to use only a single modeling language. We propose a two-step modeling methodology, in which a high-level descriptive model of the network is built in the first step, and in the second step model-to-model transformations are used to automatically transform the descriptive model to different network simulation models. We automatically generate three performance models defined at different levels of abstraction to analyze network throughput. By offering multiple simulation models in parallel, we provide flexibility in trading-off between the modeling accuracy and the simulation overhead. We analyze the simulation models by comparing the prediction accuracy with respect to the simulation duration. We observe, that in the investigated scenarios the solution duration of coarser simulation models is up to 300 times shorter, whereas the average prediction accuracy decreases only by 4 percent.}},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/789.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/789},\n}\n\n','\n\nPiotr Rygielski, Samuel Kounev, and Phuoc Tran-Gia.\nFlexible Performance Prediction of Data Center Networks using\nAutomatically Generated Simulation Models.\nIn Proceedings of the Eighth International Conference on\nSimulation Tools and Techniques (SIMUTools 2015), Athens, Greece, August\n2015, pages 119-128.\n[ bib | DOI | slides | .pdf | Abstract  ] 
\n@inproceedings{RyKoTr2015-SIMUTools-FlexPerformancePrediction,\ntitle = {{Flexible Performance Prediction of Data Center Networks using Automatically Generated Simulation Models}},\nyear = {2015},\nmonth = {August},\ndays = {24--26},\npages = {119--128},\nisbn = {978-1-63190-079-2},\ndoi = {10.4108/eai.24-8-2015.2260961},\nlocation = {Athens, Greece},\nbooktitle = {Proceedings of the Eighth International Conference on Simulation Tools and Techniques (SIMUTools 2015)},\nauthor = {Piotr Rygielski and Samuel Kounev and Phuoc Tran-Gia},\nabstract = {{Using different modeling and simulation approaches for predicting network performance requires extensive experience and involves a number of time consuming manual steps regarding each of the modeling formalisms. In this paper, we propose a generic approach to modeling the performance of data center networks. The approach offers multiple performance models but requires to use only a single modeling language. We propose a two-step modeling methodology, in which a high-level descriptive model of the network is built in the first step, and in the second step model-to-model transformations are used to automatically transform the descriptive model to different network simulation models. We automatically generate three performance models defined at different levels of abstraction to analyze network throughput. By offering multiple simulation models in parallel, we provide flexibility in trading-off between the modeling accuracy and the simulation overhead. We analyze the simulation models by comparing the prediction accuracy with respect to the simulation duration. We observe, that in the investigated scenarios the solution duration of coarser simulation models is up to 300 times shorter, whereas the average prediction accuracy decreases only by 4 percent.}},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/789.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/789}\n}\n
\n
\nUsing different modeling and simulation approaches for predicting network performance requires extensive experience and involves a number of time consuming manual steps regarding each of the modeling formalisms. In this paper, we propose a generic approach to modeling the performance of data center networks. The approach offers multiple performance models but requires to use only a single modeling language. We propose a two-step modeling methodology, in which a high-level descriptive model of the network is built in the first step, and in the second step model-to-model transformations are used to automatically transform the descriptive model to different network simulation models. We automatically generate three performance models defined at different levels of abstraction to analyze network throughput. By offering multiple simulation models in parallel, we provide flexibility in trading-off between the modeling accuracy and the simulation overhead. We analyze the simulation models by comparing the prediction accuracy with respect to the simulation duration. We observe, that in the investigated scenarios the solution duration of coarser simulation models is up to 300 times shorter, whereas the average prediction accuracy decreases only by 4 percent.\n
\n','
\n@inproceedings{RyKoTr2015-SIMUTools-FlexPerformancePrediction,\n  title = {{Flexible Performance Prediction of Data Center Networks using Automatically Generated Simulation Models}},\n  year = {2015},\n  month = {August},\n  days = {24--26},\n  pages = {119--128},\n  isbn = {978-1-63190-079-2},\n  doi = {10.4108/eai.24-8-2015.2260961},\n  location = {Athens, Greece},\n  booktitle = {Proceedings of the Eighth International Conference on Simulation Tools and Techniques (SIMUTools 2015)},\n  author = {Piotr Rygielski and Samuel Kounev and Phuoc Tran-Gia},\n  abstract = {{Using different modeling and simulation approaches for predicting network performance requires extensive experience and involves a number of time consuming manual steps regarding each of the modeling formalisms. In this paper, we propose a generic approach to modeling the performance of data center networks. The approach offers multiple performance models but requires to use only a single modeling language. We propose a two-step modeling methodology, in which a high-level descriptive model of the network is built in the first step, and in the second step model-to-model transformations are used to automatically transform the descriptive model to different network simulation models. We automatically generate three performance models defined at different levels of abstraction to analyze network throughput. By offering multiple simulation models in parallel, we provide flexibility in trading-off between the modeling accuracy and the simulation overhead. We analyze the simulation models by comparing the prediction accuracy with respect to the simulation duration. We observe, that in the investigated scenarios the solution duration of coarser simulation models is up to 300 times shorter, whereas the average prediction accuracy decreases only by 4 percent.}},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/789.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/789}\n}\n
\n\n','{Using different modeling and simulation approaches for predicting network performance requires extensive experience and involves a number of time consuming manual steps regarding each of the modeling formalisms. In this paper, we propose a generic approach to modeling the performance of data center networks. The approach offers multiple performance models but requires to use only a single modeling language. We propose a two-step modeling methodology, in which a high-level descriptive model of the network is built in the first step, and in the second step model-to-model transformations are used to automatically transform the descriptive model to different network simulation models. We automatically generate three performance models defined at different levels of abstraction to analyze network throughput. By offering multiple simulation models in parallel, we provide flexibility in trading-off between the modeling accuracy and the simulation overhead. We analyze the simulation models by comparing the prediction accuracy with respect to the simulation duration. We observe, that in the investigated scenarios the solution duration of coarser simulation models is up to 300 times shorter, whereas the average prediction accuracy decreases only by 4 percent.}','{Flexible Performance Prediction of Data Center Networks using Automatically Generated Simulation Models}',0,8,2015,8,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:04',0),(790,'paper','Ko2005-TUD-PhD_Thesis_as_phdthesis_class','phdthesis','@phdthesis{Ko2005-TUD-PhD_Thesis_as_phdthesis_class,\n title = {Performance Engineering of Distributed Component-Based Systems - Benchmarking, Modeling and Performance Prediction},\n year = {2005},\n month = {December},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa//uploads/papers/paper-288.pdf},\n school = {Technische Universit{\\\"a}t Darmstadt, Germany},\n author = {Kounev, Samuel},\n note = {Distinguished Dissertation Award},\n}\n\n','\n\nSamuel Kounev.\nPerformance Engineering of Distributed Component-Based Systems -\nBenchmarking, Modeling and Performance Prediction.\nPhD thesis, Technische Universität Darmstadt, Germany, December\n2005.\nDistinguished Dissertation Award.\n[ bib | .pdf  ] 
\n@phdthesis{Ko2005-TUD-PhD_Thesis_as_phdthesis_class,\ntitle = {Performance Engineering of Distributed Component-Based Systems - Benchmarking, Modeling and Performance Prediction},\nyear = {2005},\nmonth = {December},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa//uploads/papers/paper-288.pdf},\nschool = {Technische Universit{\\\"a}t Darmstadt, Germany},\nauthor = {Kounev, Samuel},\nnote = {Distinguished Dissertation Award}\n}\n
\n
\n','
\n@phdthesis{Ko2005-TUD-PhD_Thesis_as_phdthesis_class,\n  title = {Performance Engineering of Distributed Component-Based Systems - Benchmarking, Modeling and Performance Prediction},\n  year = {2005},\n  month = {December},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa//uploads/papers/paper-288.pdf},\n  school = {Technische Universit{\\\"a}t Darmstadt, Germany},\n  author = {Kounev, Samuel},\n  note = {Distinguished Dissertation Award}\n}\n
\n\n',NULL,'Performance Engineering of Distributed Component-Based Systems - Benchmarking, Modeling and Performance Prediction',0,12,2005,12,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:04',0),(791,'paper','SpHeKoZhLuUyGr2015-CLOUD-ProactiveMemoryScaling','inproceedings','@inproceedings{SpHeKoZhLuUyGr2015-CLOUD-ProactiveMemoryScaling,\n author = {Simon Spinner and Nikolas Herbst and Samuel Kounev and Xiaoyun Zhu and Lei Lu and Mustafa Uysal and Rean Griffith},\n title = {{Proactive Memory Scaling of Virtualized Applications}},\n booktitle = {Proceedings of the 2015 IEEE 8th International Conference on Cloud Computing (IEEE CLOUD 2015)},\n day = {27},\n location = {New York, NY, USA},\n month = {June},\n publisher = {IEEE},\n year = {2015},\n pages = {277--284},\n note = {Acceptance Rate: 15%},\n doi = {10.1109/CLOUD.2015.45},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/791.pdf},\n abstract = {{Enterprise applications in virtualized environments are often subject to time-varying workloads with multiple seasonal patterns and trends. In order to ensure quality of service for such applications while avoiding over-provisioning, resources need to be dynamically adapted to accommodate the current workload demands. Many memory-intensive applications are not suitable for the traditional horizontal scaling approach often used for runtime performance management, as it relies on complex and expensive state replication. On the other hand, vertical scaling of memory often requires a restart of the application. In this paper, we propose a proactive approach to memory scaling for virtualized applications. It uses statistical forecasting to predict the future workload and reconfigure the memory size of the virtual machine of an application automatically. To this end, we propose an extended forecasting technique that leverages meta-knowledge, such as calendar information, to improve the forecast accuracy. In addition, we develop an application controller to adjust settings associated with application memory management during memory reconfiguration. Our evaluation using real-world traces shows that the forecast accuracy quantified with the MASE error metric can be improved by 11-59%. Furthermore, we demonstrate that the proactive approach can reduce the impact of reconfiguration on application availability by over 80% and significantly improve performance relative to a reactive controller.}},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/791},\n}\n\n','\n\nSimon Spinner, Nikolas Herbst, Samuel Kounev, Xiaoyun Zhu, Lei Lu, Mustafa\nUysal, and Rean Griffith.\nProactive Memory Scaling of Virtualized Applications.\nIn Proceedings of the 2015 IEEE 8th International Conference on\nCloud Computing (IEEE CLOUD 2015), New York, NY, USA, June 27, 2015, pages\n277-284. IEEE.\nJune 2015, Acceptance Rate: 15%.\n[ bib | DOI | slides | .pdf | Abstract  ] 
\n@inproceedings{SpHeKoZhLuUyGr2015-CLOUD-ProactiveMemoryScaling,\nauthor = {Simon Spinner and Nikolas Herbst and Samuel Kounev and Xiaoyun Zhu and Lei Lu and Mustafa Uysal and Rean Griffith},\ntitle = {{Proactive Memory Scaling of Virtualized Applications}},\nbooktitle = {Proceedings of the 2015 IEEE 8th International Conference on Cloud Computing (IEEE CLOUD 2015)},\nday = {27},\nlocation = {New York, NY, USA},\nmonth = {June},\npublisher = {IEEE},\nyear = {2015},\npages = {277--284},\nnote = {Acceptance Rate: 15%},\ndoi = {10.1109/CLOUD.2015.45},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/791.pdf},\nabstract = {{Enterprise applications in virtualized environments are often subject to time-varying workloads with multiple seasonal patterns and trends. In order to ensure quality of service for such applications while avoiding over-provisioning, resources need to be dynamically adapted to accommodate the current workload demands. Many memory-intensive applications are not suitable for the traditional horizontal scaling approach often used for runtime performance management, as it relies on complex and expensive state replication. On the other hand, vertical scaling of memory often requires a restart of the application. In this paper, we propose a proactive approach to memory scaling for virtualized applications. It uses statistical forecasting to predict the future workload and reconfigure the memory size of the virtual machine of an application automatically. To this end, we propose an extended forecasting technique that leverages meta-knowledge, such as calendar information, to improve the forecast accuracy. In addition, we develop an application controller to adjust settings associated with application memory management during memory reconfiguration. Our evaluation using real-world traces shows that the forecast accuracy quantified with the MASE error metric can be improved by 11-59%. Furthermore, we demonstrate that the proactive approach can reduce the impact of reconfiguration on application availability by over 80% and significantly improve performance relative to a reactive controller.}},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/791}\n}\n
\n
\nEnterprise applications in virtualized environments are often subject to time-varying workloads with multiple seasonal patterns and trends. In order to ensure quality of service for such applications while avoiding over-provisioning, resources need to be dynamically adapted to accommodate the current workload demands. Many memory-intensive applications are not suitable for the traditional horizontal scaling approach often used for runtime performance management, as it relies on complex and expensive state replication. On the other hand, vertical scaling of memory often requires a restart of the application. In this paper, we propose a proactive approach to memory scaling for virtualized applications. It uses statistical forecasting to predict the future workload and reconfigure the memory size of the virtual machine of an application automatically. To this end, we propose an extended forecasting technique that leverages meta-knowledge, such as calendar information, to improve the forecast accuracy. In addition, we develop an application controller to adjust settings associated with application memory management during memory reconfiguration. Our evaluation using real-world traces shows that the forecast accuracy quantified with the MASE error metric can be improved by 11-59%. Furthermore, we demonstrate that the proactive approach can reduce the impact of reconfiguration on application availability by over 80% and significantly improve performance relative to a reactive controller.\n
\n','
\n@inproceedings{SpHeKoZhLuUyGr2015-CLOUD-ProactiveMemoryScaling,\n  author = {Simon Spinner and Nikolas Herbst and Samuel Kounev and Xiaoyun Zhu and Lei Lu and Mustafa Uysal and Rean Griffith},\n  title = {{Proactive Memory Scaling of Virtualized Applications}},\n  booktitle = {Proceedings of the 2015 IEEE 8th International Conference on Cloud Computing (IEEE CLOUD 2015)},\n  day = {27},\n  location = {New York, NY, USA},\n  month = {June},\n  publisher = {IEEE},\n  year = {2015},\n  pages = {277--284},\n  note = {Acceptance Rate: 15%},\n  doi = {10.1109/CLOUD.2015.45},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/791.pdf},\n  abstract = {{Enterprise applications in virtualized environments are often subject to time-varying workloads with multiple seasonal patterns and trends. In order to ensure quality of service for such applications while avoiding over-provisioning, resources need to be dynamically adapted to accommodate the current workload demands. Many memory-intensive applications are not suitable for the traditional horizontal scaling approach often used for runtime performance management, as it relies on complex and expensive state replication. On the other hand, vertical scaling of memory often requires a restart of the application. In this paper, we propose a proactive approach to memory scaling for virtualized applications. It uses statistical forecasting to predict the future workload and reconfigure the memory size of the virtual machine of an application automatically. To this end, we propose an extended forecasting technique that leverages meta-knowledge, such as calendar information, to improve the forecast accuracy. In addition, we develop an application controller to adjust settings associated with application memory management during memory reconfiguration. Our evaluation using real-world traces shows that the forecast accuracy quantified with the MASE error metric can be improved by 11-59%. Furthermore, we demonstrate that the proactive approach can reduce the impact of reconfiguration on application availability by over 80% and significantly improve performance relative to a reactive controller.}},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/791}\n}\n
\n\n','{Enterprise applications in virtualized environments are often subject to time-varying workloads with multiple seasonal patterns and trends. In order to ensure quality of service for such applications while avoiding over-provisioning, resources need to be dynamically adapted to accommodate the current workload demands. Many memory-intensive applications are not suitable for the traditional horizontal scaling approach often used for runtime performance management, as it relies on complex and expensive state replication. On the other hand, vertical scaling of memory often requires a restart of the application. In this paper, we propose a proactive approach to memory scaling for virtualized applications. It uses statistical forecasting to predict the future workload and reconfigure the memory size of the virtual machine of an application automatically. To this end, we propose an extended forecasting technique that leverages meta-knowledge, such as calendar information, to improve the forecast accuracy. In addition, we develop an application controller to adjust settings associated with application memory management during memory reconfiguration. Our evaluation using real-world traces shows that the forecast accuracy quantified with the MASE error metric can be improved by 11-59%. Furthermore, we demonstrate that the proactive approach can reduce the impact of reconfiguration on application availability by over 80% and significantly improve performance relative to a reactive controller.}','{Proactive Memory Scaling of Virtualized Applications}',0,6,2015,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:04',0),(792,'paper','WaSpKo-SIMUTools-QPNParallelSimulation','inproceedings','@inproceedings{WaSpKo-SIMUTools-QPNParallelSimulation,\n title = {{Parallel Simulation of Queueing Petri Nets}},\n year = {2015},\n month = {August},\n days = {24--26},\n location = {Athens, Greece},\n booktitle = {Proceedings of the Eighth EAI International Conference on Simulation Tools and Techniques (SIMUTools 2015)},\n author = {J\\\"{u}rgen Walter and Simon Spinner and Samuel Kounev},\n abstract = {Queueing Petri nets show high accurracy to model and analyze cloud scenarios. To apply these models in online scenarios a speedup of simulation is desirable. One way to speedup simulation is parallelization. Decades of intensive research showed no general solution for parallel discrete event simulation, which provides reasonable speedups. We research the application of parallel simulation for cloud scenarios. We develop a parallel simulation engine that shows speedup for certain scenarios common in cloud models. We present a parallel simualtion engine that employs application level and event level parallelism. We parallelize the execution of a single run by the use of a conservative barrier-based synchronization algorithm. The speedup for a single run depends on the capability of the model. Hence, a number of experiments on different net characteristics were conducted showing that for certain models a superlinear speedup is possible.},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/792},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/792.pdf},\n}\n\n','\n\nJürgen Walter, Simon Spinner, and Samuel Kounev.\nParallel Simulation of Queueing Petri Nets.\nIn Proceedings of the Eighth EAI International Conference on\nSimulation Tools and Techniques (SIMUTools 2015), Athens, Greece, August\n2015.\n[ bib | slides | .pdf | Abstract  ] 
\n@inproceedings{WaSpKo-SIMUTools-QPNParallelSimulation,\ntitle = {{Parallel Simulation of Queueing Petri Nets}},\nyear = {2015},\nmonth = {August},\ndays = {24--26},\nlocation = {Athens, Greece},\nbooktitle = {Proceedings of the Eighth EAI International Conference on Simulation Tools and Techniques (SIMUTools 2015)},\nauthor = {J\\\"{u}rgen Walter and Simon Spinner and Samuel Kounev},\nabstract = {Queueing Petri nets show high accurracy to model and analyze cloud scenarios. To apply these models in online scenarios a speedup of simulation is desirable. One way to speedup simulation is parallelization. Decades of intensive research showed no general solution for parallel discrete event simulation, which provides reasonable speedups. We research the application of parallel simulation for cloud scenarios. We develop a parallel simulation engine that shows speedup for certain scenarios common in cloud models. We present a parallel simualtion engine that employs application level and event level parallelism. We parallelize the execution of a single run by the use of a conservative barrier-based synchronization algorithm. The speedup for a single run depends on the capability of the model. Hence, a number of experiments on different net characteristics were conducted showing that for certain models a superlinear speedup is possible.},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/792},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/792.pdf}\n}\n
\n
\nQueueing Petri nets show high accurracy to model and analyze cloud scenarios. To apply these models in online scenarios a speedup of simulation is desirable. One way to speedup simulation is parallelization. Decades of intensive research showed no general solution for parallel discrete event simulation, which provides reasonable speedups. We research the application of parallel simulation for cloud scenarios. We develop a parallel simulation engine that shows speedup for certain scenarios common in cloud models. We present a parallel simualtion engine that employs application level and event level parallelism. We parallelize the execution of a single run by the use of a conservative barrier-based synchronization algorithm. The speedup for a single run depends on the capability of the model. Hence, a number of experiments on different net characteristics were conducted showing that for certain models a superlinear speedup is possible.\n
\n','
\n@inproceedings{WaSpKo-SIMUTools-QPNParallelSimulation,\n  title = {{Parallel Simulation of Queueing Petri Nets}},\n  year = {2015},\n  month = {August},\n  days = {24--26},\n  location = {Athens, Greece},\n  booktitle = {Proceedings of the Eighth EAI International Conference on Simulation Tools and Techniques (SIMUTools 2015)},\n  author = {J\\\"{u}rgen Walter and Simon Spinner and Samuel Kounev},\n  abstract = {Queueing Petri nets show high accurracy to model and analyze cloud scenarios. To apply these models in online scenarios a speedup of simulation is desirable. One way to speedup simulation is parallelization. Decades of intensive research showed no general solution for parallel discrete event simulation, which provides reasonable speedups. We research the application of parallel simulation for cloud scenarios. We develop a parallel simulation engine that shows speedup for certain scenarios common in cloud models. We present a parallel simualtion engine that employs application level and event level parallelism. We parallelize the execution of a single run by the use of a conservative barrier-based synchronization algorithm. The speedup for a single run depends on the capability of the model. Hence, a number of experiments on different net characteristics were conducted showing that for certain models a superlinear speedup is possible.},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/792},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/792.pdf}\n}\n
\n\n','Queueing Petri nets show high accurracy to model and analyze cloud scenarios. To apply these models in online scenarios a speedup of simulation is desirable. One way to speedup simulation is parallelization. Decades of intensive research showed no general solution for parallel discrete event simulation, which provides reasonable speedups. We research the application of parallel simulation for cloud scenarios. We develop a parallel simulation engine that shows speedup for certain scenarios common in cloud models. We present a parallel simualtion engine that employs application level and event level parallelism. We parallelize the execution of a single run by the use of a conservative barrier-based synchronization algorithm. The speedup for a single run depends on the capability of the model. Hence, a number of experiments on different net characteristics were conducted showing that for certain models a superlinear speedup is possible.','{Parallel Simulation of Queueing Petri Nets}',0,8,2015,8,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:04',0),(793,'paper','CaAnViMiKo2015-DSN-Challenges','inproceedings','@inproceedings{CaAnViMiKo2015-DSN-Challenges,\n author = {Diogo Carvalho and Nuno Antunes and Marco Vieira and Aleksandar Milenkoski and Samuel Kounev},\n booktitle = {The 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2015)},\n publisher = {{IEEE}},\n location = {Rio de Janeiro, Brazil},\n title = {{Challenges of Assessing the Hypercall Interface Robustness}},\n titleaddon = {{(Fast Abstract)}},\n year = {2015},\n month = {June},\n abstract = {{Assessing the robustness of hypercall interfaces is essential to understand the dependability of virtualized infrastructures. However, the particularities in the domain raise particular challenges, as discussed in the present paper.}},\n}\n\n','\n\nDiogo Carvalho, Nuno Antunes, Marco Vieira, Aleksandar Milenkoski, and Samuel\nKounev.\nChallenges of Assessing the Hypercall Interface Robustness (Fast\nAbstract).\nIn The 45th Annual IEEE/IFIP International Conference on\nDependable Systems and Networks (DSN 2015), Rio de Janeiro, Brazil, June\n2015. IEEE.\nJune 2015.\n[ bib | Abstract  ] 
\n@inproceedings{CaAnViMiKo2015-DSN-Challenges,\nauthor = {Diogo Carvalho and Nuno Antunes and Marco Vieira and Aleksandar Milenkoski and Samuel Kounev},\nbooktitle = {The 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2015)},\npublisher = {{IEEE}},\nlocation = {Rio de Janeiro, Brazil},\ntitle = {{Challenges of Assessing the Hypercall Interface Robustness}},\ntitleaddon = {{(Fast Abstract)}},\nyear = {2015},\nmonth = {June},\nabstract = {{Assessing the robustness of hypercall interfaces is essential to understand the dependability of virtualized infrastructures. However, the particularities in the domain raise particular challenges, as discussed in the present paper.}}\n}\n
\n
\nAssessing the robustness of hypercall interfaces is essential to understand the dependability of virtualized infrastructures. However, the particularities in the domain raise particular challenges, as discussed in the present paper.\n
\n','
\n@inproceedings{CaAnViMiKo2015-DSN-Challenges,\n  author = {Diogo Carvalho and Nuno Antunes and Marco Vieira and Aleksandar Milenkoski and Samuel Kounev},\n  booktitle = {The 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2015)},\n  publisher = {{IEEE}},\n  location = {Rio de Janeiro, Brazil},\n  title = {{Challenges of Assessing the Hypercall Interface Robustness}},\n  titleaddon = {{(Fast Abstract)}},\n  year = {2015},\n  month = {June},\n  abstract = {{Assessing the robustness of hypercall interfaces is essential to understand the dependability of virtualized infrastructures. However, the particularities in the domain raise particular challenges, as discussed in the present paper.}}\n}\n
\n\n','{Assessing the robustness of hypercall interfaces is essential to understand the dependability of virtualized infrastructures. However, the particularities in the domain raise particular challenges, as discussed in the present paper.}','{Challenges of Assessing the Hypercall Interface Robustness}',0,6,2015,6,NULL,NULL,NULL,'0000-00-00 00:00:00','2016-06-01 09:41:04',0),(798,'paper','Schott2013','mastersthesis','@mastersthesis{Schott2013,\n author = {Waldemar Schott},\n address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {Automated Model-based System Reconfiguration: A Case Study},\n year = {2013},\n mont = {July},\n type = {{Master Thesis}},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/798},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/798.pdf},\n}\n\n','\n\nWaldemar Schott.\nAutomated model-based system reconfiguration: A case study.\nMaster Thesis, Karlsruhe Institute of Technology (KIT), Am\nFasanengarten 5, 76131 Karlsruhe, Germany, 2013.\n[ bib | slides | .pdf  ] 
\n@mastersthesis{Schott2013,\nauthor = {Waldemar Schott},\naddress = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {Automated Model-based System Reconfiguration: A Case Study},\nyear = {2013},\nmont = {July},\ntype = {{Master Thesis}},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/798},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/798.pdf}\n}\n
\n
\n','
\n@mastersthesis{Schott2013,\n  author = {Waldemar Schott},\n  address = {Am Fasanengarten 5, 76131 Karlsruhe, Germany},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {Automated Model-based System Reconfiguration: A Case Study},\n  year = {2013},\n  mont = {July},\n  type = {{Master Thesis}},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/798},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/798.pdf}\n}\n
\n\n',NULL,'Automated Model-based System Reconfiguration: A Case Study',0,0,2013,0,NULL,NULL,NULL,'2015-05-11 14:14:02','2016-06-01 09:41:04',0),(799,'paper','Eismann2015','mastersthesis','@mastersthesis{Eismann2015,\n author = {Simon Eismann},\n address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n school = {University of W\\\"urzburg},\n title = {{Declarative Automation Framework for QPME based on DQL}},\n year = {2015},\n month = {March},\n type = {{Bachelor Thesis}},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/799},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/799.pdf},\n}\n\n','\n\nSimon Eismann.\nDeclarative Automation Framework for QPME based on DQL.\nBachelor Thesis, University of Würzburg, Am Hubland,\nInformatikgebäude, 97074 Würzburg, Germany, March 2015.\n[ bib | slides | .pdf  ] 
\n@mastersthesis{Eismann2015,\nauthor = {Simon Eismann},\naddress = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\nschool = {University of W\\\"urzburg},\ntitle = {{Declarative Automation Framework for QPME based on DQL}},\nyear = {2015},\nmonth = {March},\ntype = {{Bachelor Thesis}},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/799},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/799.pdf}\n}\n
\n
\n','
\n@mastersthesis{Eismann2015,\n  author = {Simon Eismann},\n  address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n  school = {University of W\\\"urzburg},\n  title = {{Declarative Automation Framework for QPME based on DQL}},\n  year = {2015},\n  month = {March},\n  type = {{Bachelor Thesis}},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/799},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/799.pdf}\n}\n
\n\n',NULL,'{Declarative Automation Framework for QPME based on DQL}',0,3,2015,3,NULL,NULL,NULL,'2015-05-12 11:32:26','2016-06-01 09:41:04',0),(802,'paper','KoZhKeKw2015','book','@book{KoZhKeKw2015,\n address = {Dagstuhl, Germany},\n editor = {Kounev, Samuel and Zhu, Xiaoyun and Kephart, Jeffrey O. and Kwiatkowska, Marta and Aleksandar Milenkoski (Assistant Editor)},\n series = {Dagstuhl Reports},\n title = {{Model-driven Algorithms and Architectures for Self-Aware Computing Systems}},\n year = {2015},\n month = {January},\n abstract = {{This report documents the program and the outcomes of Dagstuhl Seminar 15041 \"Model-driven Algorithms and Architectures for Self-Aware Computing Systems\". The design of self-aware computing systems calls for an integrated interdisciplinary approach building on results from multiple areas of computer science and engineering, including software and systems engineering, systems modeling, simulation and analysis, autonomic and organic computing, machine learning and artificial intelligence, data center resource management, and so on. The Dagstuhl Seminar 15041 served as a platform to raise the awareness about the relevant research efforts in the respective research communities as well as existing synergies that can be exploited to advance the state-of-the-art, formulate a new research agenda that takes a broader view on the problem following an integrated and interdisciplinary approach, and establish collaborations between academia and industry.}},\n url = {http://drops.dagstuhl.de/opus/volltexte/2015/5038/},\n pdf = {http://drops.dagstuhl.de/opus/volltexte/2015/5038/pdf/dagrep_v005_i001_p164_s15041.pdf},\n}\n\n','\n\nSamuel Kounev, Xiaoyun Zhu, Jeffrey O. Kephart, Marta Kwiatkowska, and\nAleksandar Milenkoski (Assistant Editor), editors.\nModel-driven Algorithms and Architectures for Self-Aware\nComputing Systems.\nDagstuhl Reports. Dagstuhl, Germany, January 2015.\n[ bib | http | .pdf | Abstract  ] 
\n@book{KoZhKeKw2015,\naddress = {Dagstuhl, Germany},\neditor = {Kounev, Samuel and Zhu, Xiaoyun and Kephart, Jeffrey O. and Kwiatkowska, Marta and Aleksandar Milenkoski (Assistant Editor)},\nseries = {Dagstuhl Reports},\ntitle = {{Model-driven Algorithms and Architectures for Self-Aware Computing Systems}},\nyear = {2015},\nmonth = {January},\nabstract = {{This report documents the program and the outcomes of Dagstuhl Seminar 15041 \"Model-driven Algorithms and Architectures for Self-Aware Computing Systems\". The design of self-aware computing systems calls for an integrated interdisciplinary approach building on results from multiple areas of computer science and engineering, including software and systems engineering, systems modeling, simulation and analysis, autonomic and organic computing, machine learning and artificial intelligence, data center resource management, and so on. The Dagstuhl Seminar 15041 served as a platform to raise the awareness about the relevant research efforts in the respective research communities as well as existing synergies that can be exploited to advance the state-of-the-art, formulate a new research agenda that takes a broader view on the problem following an integrated and interdisciplinary approach, and establish collaborations between academia and industry.}},\nurl = {http://drops.dagstuhl.de/opus/volltexte/2015/5038/},\npdf = {http://drops.dagstuhl.de/opus/volltexte/2015/5038/pdf/dagrep_v005_i001_p164_s15041.pdf}\n}\n
\n
\nThis report documents the program and the outcomes of Dagstuhl Seminar 15041 \"Model-driven Algorithms and Architectures for Self-Aware Computing Systems\". The design of self-aware computing systems calls for an integrated interdisciplinary approach building on results from multiple areas of computer science and engineering, including software and systems engineering, systems modeling, simulation and analysis, autonomic and organic computing, machine learning and artificial intelligence, data center resource management, and so on. The Dagstuhl Seminar 15041 served as a platform to raise the awareness about the relevant research efforts in the respective research communities as well as existing synergies that can be exploited to advance the state-of-the-art, formulate a new research agenda that takes a broader view on the problem following an integrated and interdisciplinary approach, and establish collaborations between academia and industry.\n
\n','
\n@book{KoZhKeKw2015,\n  address = {Dagstuhl, Germany},\n  editor = {Kounev, Samuel and Zhu, Xiaoyun and Kephart, Jeffrey O. and Kwiatkowska, Marta and Aleksandar Milenkoski (Assistant Editor)},\n  series = {Dagstuhl Reports},\n  title = {{Model-driven Algorithms and Architectures for Self-Aware Computing Systems}},\n  year = {2015},\n  month = {January},\n  abstract = {{This report documents the program and the outcomes of Dagstuhl Seminar 15041 \"Model-driven Algorithms and Architectures for Self-Aware Computing Systems\". The design of self-aware computing systems calls for an integrated interdisciplinary approach building on results from multiple areas of computer science and engineering, including software and systems engineering, systems modeling, simulation and analysis, autonomic and organic computing, machine learning and artificial intelligence, data center resource management, and so on. The Dagstuhl Seminar 15041 served as a platform to raise the awareness about the relevant research efforts in the respective research communities as well as existing synergies that can be exploited to advance the state-of-the-art, formulate a new research agenda that takes a broader view on the problem following an integrated and interdisciplinary approach, and establish collaborations between academia and industry.}},\n  url = {http://drops.dagstuhl.de/opus/volltexte/2015/5038/},\n  pdf = {http://drops.dagstuhl.de/opus/volltexte/2015/5038/pdf/dagrep_v005_i001_p164_s15041.pdf}\n}\n
\n\n','{This report documents the program and the outcomes of Dagstuhl Seminar 15041 \"Model-driven Algorithms and Architectures for Self-Aware Computing Systems\". The design of self-aware computing systems calls for an integrated interdisciplinary approach building on results from multiple areas of computer science and engineering, including software and systems engineering, systems modeling, simulation and analysis, autonomic and organic computing, machine learning and artificial intelligence, data center resource management, and so on. The Dagstuhl Seminar 15041 served as a platform to raise the awareness about the relevant research efforts in the respective research communities as well as existing synergies that can be exploited to advance the state-of-the-art, formulate a new research agenda that takes a broader view on the problem following an integrated and interdisciplinary approach, and establish collaborations between academia and industry.}','{Model-driven Algorithms and Architectures for Self-Aware Computing Systems}',0,1,2015,1,NULL,NULL,NULL,'2015-05-15 09:51:25','2016-06-01 09:41:04',0),(803,'paper','LaGeSpRyZiKoTG-SDN-Controller-Placement-ITC2015','inproceedings','@inproceedings{LaGeSpRyZiKoTG-SDN-Controller-Placement-ITC2015,\n author = {Stanislav Lange and Steffen Gebert and Joachim Spoerhase and Piotr Rygielski and Thomas Zinner and Samuel Kounev and Phuoc Tran-Gia},\n title = {{Specialized Heuristics for the Controller Placement Problem in Large Scale SDN Networks}},\n booktitle = {27th International Teletraffic Congress ({ITC 2015})},\n address = {Ghent, Belgium},\n day = {8--10},\n month = {September},\n year = {2015},\n pages = {210--218},\n url = {http://dx.doi.org/10.1109/ITC.2015.32},\n doi = {10.1109/ITC.2015.32},\n abstract = {{The Software Defined Networking~(SDN) concept introduces a paradigm shift in the networking world towards an externalized control plane which is logically centralized. When designing an SDN-based WAN architecture, it is of vital importance to find a feasible solution to the controller placement problem, i.e., to decide where to position a limited amount of resources within the network. In addition to time-independent constraints regarding aspects like scalability, resilience, and control plane communication delays, dynamically changing network conditions like traffic patterns or bandwidth demands need to be considered as well. Consequently, such dynamic environments call for a regular and fast recalculation of placements in order to adapt to the current situation in a timely manner. While an exhaustive evaluation of all possible solutions can be performed within a practically feasible time frame for small and medium-sized networks, such an approach is out of scope for large problem instances which have significantly higher time and memory requirements. Therefore, this work investigates a specialized heuristic, which takes into account a particular set of optimization objectives and returns solutions representing the possible trade-offs between them. Due to its low computation time and acceptable margin of error, this heuristic can be employed by automatic decision systems operating in dynamic environments.}},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/803.pdf},\n}\n\n','\n\nStanislav Lange, Steffen Gebert, Joachim Spoerhase, Piotr Rygielski, Thomas\nZinner, Samuel Kounev, and Phuoc Tran-Gia.\nSpecialized Heuristics for the Controller Placement Problem in Large\nScale SDN Networks.\nIn 27th International Teletraffic Congress (ITC 2015),\nSeptember 8-10, 2015, pages 210-218. Ghent, Belgium.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@inproceedings{LaGeSpRyZiKoTG-SDN-Controller-Placement-ITC2015,\nauthor = {Stanislav Lange and Steffen Gebert and Joachim Spoerhase and Piotr Rygielski and Thomas Zinner and Samuel Kounev and Phuoc Tran-Gia},\ntitle = {{Specialized Heuristics for the Controller Placement Problem in Large Scale SDN Networks}},\nbooktitle = {27th International Teletraffic Congress ({ITC 2015})},\naddress = {Ghent, Belgium},\nday = {8--10},\nmonth = {September},\nyear = {2015},\npages = {210--218},\nurl = {http://dx.doi.org/10.1109/ITC.2015.32},\ndoi = {10.1109/ITC.2015.32},\nabstract = {{The Software Defined Networking~(SDN) concept introduces a paradigm shift in the networking world towards an externalized control plane which is logically centralized. When designing an SDN-based WAN architecture, it is of vital importance to find a feasible solution to the controller placement problem, i.e., to decide where to position a limited amount of resources within the network. In addition to time-independent constraints regarding aspects like scalability, resilience, and control plane communication delays, dynamically changing network conditions like traffic patterns or bandwidth demands need to be considered as well. Consequently, such dynamic environments call for a regular and fast recalculation of placements in order to adapt to the current situation in a timely manner. While an exhaustive evaluation of all possible solutions can be performed within a practically feasible time frame for small and medium-sized networks, such an approach is out of scope for large problem instances which have significantly higher time and memory requirements. Therefore, this work investigates a specialized heuristic, which takes into account a particular set of optimization objectives and returns solutions representing the possible trade-offs between them. Due to its low computation time and acceptable margin of error, this heuristic can be employed by automatic decision systems operating in dynamic environments.}},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/803.pdf}\n}\n
\n
\nThe Software Defined Networking (SDN) concept introduces a paradigm shift in the networking world towards an externalized control plane which is logically centralized. When designing an SDN-based WAN architecture, it is of vital importance to find a feasible solution to the controller placement problem, i.e., to decide where to position a limited amount of resources within the network. In addition to time-independent constraints regarding aspects like scalability, resilience, and control plane communication delays, dynamically changing network conditions like traffic patterns or bandwidth demands need to be considered as well. Consequently, such dynamic environments call for a regular and fast recalculation of placements in order to adapt to the current situation in a timely manner. While an exhaustive evaluation of all possible solutions can be performed within a practically feasible time frame for small and medium-sized networks, such an approach is out of scope for large problem instances which have significantly higher time and memory requirements. Therefore, this work investigates a specialized heuristic, which takes into account a particular set of optimization objectives and returns solutions representing the possible trade-offs between them. Due to its low computation time and acceptable margin of error, this heuristic can be employed by automatic decision systems operating in dynamic environments.\n
\n','
\n@inproceedings{LaGeSpRyZiKoTG-SDN-Controller-Placement-ITC2015,\n  author = {Stanislav Lange and Steffen Gebert and Joachim Spoerhase and Piotr Rygielski and Thomas Zinner and Samuel Kounev and Phuoc Tran-Gia},\n  title = {{Specialized Heuristics for the Controller Placement Problem in Large Scale SDN Networks}},\n  booktitle = {27th International Teletraffic Congress ({ITC 2015})},\n  address = {Ghent, Belgium},\n  day = {8--10},\n  month = {September},\n  year = {2015},\n  pages = {210--218},\n  url = {http://dx.doi.org/10.1109/ITC.2015.32},\n  doi = {10.1109/ITC.2015.32},\n  abstract = {{The Software Defined Networking~(SDN) concept introduces a paradigm shift in the networking world towards an externalized control plane which is logically centralized. When designing an SDN-based WAN architecture, it is of vital importance to find a feasible solution to the controller placement problem, i.e., to decide where to position a limited amount of resources within the network. In addition to time-independent constraints regarding aspects like scalability, resilience, and control plane communication delays, dynamically changing network conditions like traffic patterns or bandwidth demands need to be considered as well. Consequently, such dynamic environments call for a regular and fast recalculation of placements in order to adapt to the current situation in a timely manner. While an exhaustive evaluation of all possible solutions can be performed within a practically feasible time frame for small and medium-sized networks, such an approach is out of scope for large problem instances which have significantly higher time and memory requirements. Therefore, this work investigates a specialized heuristic, which takes into account a particular set of optimization objectives and returns solutions representing the possible trade-offs between them. Due to its low computation time and acceptable margin of error, this heuristic can be employed by automatic decision systems operating in dynamic environments.}},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/803.pdf}\n}\n
\n\n','{The Software Defined Networking~(SDN) concept introduces a paradigm shift in the networking world towards an externalized control plane which is logically centralized. When designing an SDN-based WAN architecture, it is of vital importance to find a feasible solution to the controller placement problem, i.e., to decide where to position a limited amount of resources within the network. In addition to time-independent constraints regarding aspects like scalability, resilience, and control plane communication delays, dynamically changing network conditions like traffic patterns or bandwidth demands need to be considered as well. Consequently, such dynamic environments call for a regular and fast recalculation of placements in order to adapt to the current situation in a timely manner. While an exhaustive evaluation of all possible solutions can be performed within a practically feasible time frame for small and medium-sized networks, such an approach is out of scope for large problem instances which have significantly higher time and memory requirements. Therefore, this work investigates a specialized heuristic, which takes into account a particular set of optimization objectives and returns solutions representing the possible trade-offs between them. Due to its low computation time and acceptable margin of error, this heuristic can be employed by automatic decision systems operating in dynamic environments.}','{Specialized Heuristics for the Controller Placement Problem in Large Scale SDN Networks}',0,9,2015,9,NULL,NULL,NULL,'2015-05-18 08:02:38','2016-06-01 09:41:04',0),(804,'talk','talk-Kounev-WsWue15','misc','@misc{talk-Kounev-WsWue15,\n author = {Samuel Kounev},\n title = {{Engineering & Provisioning of Cloud Applications - Research and Entrepreneurship}},\n howpublished = {Winder School, University of W\\\"urzburg, Germany},\n days = {17},\n month = {February},\n year = {2015},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/804},\n}\n\n','\n\nSamuel Kounev.\nEngineering & Provisioning of Cloud Applications - Research and\nEntrepreneurship.\nWinder School, University of Würzburg, Germany, February 2015.\n[ bib | slides  ] 
\n@misc{talk-Kounev-WsWue15,\nauthor = {Samuel Kounev},\ntitle = {{Engineering & Provisioning of Cloud Applications - Research and Entrepreneurship}},\nhowpublished = {Winder School, University of W\\\"urzburg, Germany},\ndays = {17},\nmonth = {February},\nyear = {2015},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/804}\n}\n
\n
\n','
\n@misc{talk-Kounev-WsWue15,\n  author = {Samuel Kounev},\n  title = {{Engineering & Provisioning of Cloud Applications - Research and Entrepreneurship}},\n  howpublished = {Winder School, University of W\\\"urzburg, Germany},\n  days = {17},\n  month = {February},\n  year = {2015},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/804}\n}\n
\n\n',NULL,'{Engineering & Provisioning of Cloud Applications - Research and Entrepreneurship}',0,2,2015,2,NULL,NULL,NULL,'2015-05-19 21:02:57','2016-06-01 09:41:04',0),(805,'talk','talk-Kounev-SPEC15','misc','@misc{talk-Kounev-SPEC15,\n author = {Samuel Kounev},\n title = {{The SPEC Research Group - Status Quo}},\n howpublished = {Talk at the SPEC 2015 Annual Meeting, Austin, Texas, USA},\n days = {5},\n month = {February},\n year = {2015},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/805},\n}\n\n','\n\nSamuel Kounev.\nThe SPEC Research Group - Status Quo.\nTalk at the SPEC 2015 Annual Meeting, Austin, Texas, USA, February\n2015.\n[ bib | slides  ] 
\n@misc{talk-Kounev-SPEC15,\nauthor = {Samuel Kounev},\ntitle = {{The SPEC Research Group - Status Quo}},\nhowpublished = {Talk at the SPEC 2015 Annual Meeting, Austin, Texas, USA},\ndays = {5},\nmonth = {February},\nyear = {2015},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/805}\n}\n
\n
\n','
\n@misc{talk-Kounev-SPEC15,\n  author = {Samuel Kounev},\n  title = {{The SPEC Research Group - Status Quo}},\n  howpublished = {Talk at the SPEC 2015 Annual Meeting, Austin, Texas, USA},\n  days = {5},\n  month = {February},\n  year = {2015},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/805}\n}\n
\n\n',NULL,'{The SPEC Research Group - Status Quo}',0,2,2015,2,NULL,NULL,NULL,'2015-05-21 08:52:29','2016-06-01 09:41:04',0),(806,'talk','talk-Kounev-LT15','misc','@misc{talk-Kounev-LT15,\n author = {Samuel Kounev},\n title = {{Load Testing Elasticity and Performance Isolation in Shared Execution Environments}},\n howpublished = {Keynote Talk at the 4th International Workshop on Large-Scale Testing (LT 2015), co-located with ICPE 2015, Austin, TX, USA},\n days = {1},\n month = {February},\n year = {2015},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/806},\n}\n\n','\n\nSamuel Kounev.\nLoad Testing Elasticity and Performance Isolation in Shared\nExecution Environments.\nKeynote Talk at the 4th International Workshop on Large-Scale Testing\n(LT 2015), co-located with ICPE 2015, Austin, TX, USA, February 2015.\n[ bib | slides  ] 
\n@misc{talk-Kounev-LT15,\nauthor = {Samuel Kounev},\ntitle = {{Load Testing Elasticity and Performance Isolation in Shared Execution Environments}},\nhowpublished = {Keynote Talk at the 4th International Workshop on Large-Scale Testing (LT 2015), co-located with ICPE 2015, Austin, TX, USA},\ndays = {1},\nmonth = {February},\nyear = {2015},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/806}\n}\n
\n
\n','
\n@misc{talk-Kounev-LT15,\n  author = {Samuel Kounev},\n  title = {{Load Testing Elasticity and Performance Isolation in Shared Execution Environments}},\n  howpublished = {Keynote Talk at the 4th International Workshop on Large-Scale Testing (LT 2015), co-located with ICPE 2015, Austin, TX, USA},\n  days = {1},\n  month = {February},\n  year = {2015},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/806}\n}\n
\n\n',NULL,'{Load Testing Elasticity and Performance Isolation in Shared Execution Environments}',0,2,2015,2,NULL,NULL,NULL,'2015-05-21 08:56:21','2016-06-01 09:41:04',0),(807,'talk','talk-Kounev-Dagstuhl15','misc','@misc{talk-Kounev-Dagstuhl15,\n author = {Samuel Kounev},\n title = {{Software Engineering for Self-Aware Computing}},\n howpublished = {Tutorial Talk at Dagstuhl Seminar 15041 on \'\'Model-driven Algorithms and Architectures for Self-Aware Computing Systems\'\'},\n days = {19},\n month = {January},\n year = {2015},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/807},\n}\n\n','\n\nSamuel Kounev.\nSoftware Engineering for Self-Aware Computing.\nTutorial Talk at Dagstuhl Seminar 15041 on ”Model-driven Algorithms\nand Architectures for Self-Aware Computing Systems”, January 2015.\n[ bib | slides  ] 
\n@misc{talk-Kounev-Dagstuhl15,\nauthor = {Samuel Kounev},\ntitle = {{Software Engineering for Self-Aware Computing}},\nhowpublished = {Tutorial Talk at Dagstuhl Seminar 15041 on \'\'Model-driven Algorithms and Architectures for Self-Aware Computing Systems\'\'},\ndays = {19},\nmonth = {January},\nyear = {2015},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/807}\n}\n
\n
\n','
\n@misc{talk-Kounev-Dagstuhl15,\n  author = {Samuel Kounev},\n  title = {{Software Engineering for Self-Aware Computing}},\n  howpublished = {Tutorial Talk at Dagstuhl Seminar 15041 on \'\'Model-driven Algorithms and Architectures for Self-Aware Computing Systems\'\'},\n  days = {19},\n  month = {January},\n  year = {2015},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/807}\n}\n
\n\n',NULL,'{Software Engineering for Self-Aware Computing}',0,1,2015,1,NULL,NULL,NULL,'2015-05-21 08:59:01','2016-06-01 09:41:04',0),(808,'talk','talk-Kounev-Dagstuhl15-2','misc','@misc{talk-Kounev-Dagstuhl15-2,\n author = {Samuel Kounev},\n title = {{The Descartes Modeling Language and Tool Chain}},\n howpublished = {Presentation at Dagstuhl Seminar 15041 on \'\'Model-driven Algorithms and Architectures for Self-Aware Computing Systems\'\'},\n days = {21},\n month = {January},\n year = {2015},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/808},\n}\n\n','\n\nSamuel Kounev.\nThe Descartes Modeling Language and Tool Chain.\nPresentation at Dagstuhl Seminar 15041 on ”Model-driven Algorithms\nand Architectures for Self-Aware Computing Systems”, January 2015.\n[ bib | slides  ] 
\n@misc{talk-Kounev-Dagstuhl15-2,\nauthor = {Samuel Kounev},\ntitle = {{The Descartes Modeling Language and Tool Chain}},\nhowpublished = {Presentation at Dagstuhl Seminar 15041 on \'\'Model-driven Algorithms and Architectures for Self-Aware Computing Systems\'\'},\ndays = {21},\nmonth = {January},\nyear = {2015},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/808}\n}\n
\n
\n','
\n@misc{talk-Kounev-Dagstuhl15-2,\n  author = {Samuel Kounev},\n  title = {{The Descartes Modeling Language and Tool Chain}},\n  howpublished = {Presentation at Dagstuhl Seminar 15041 on \'\'Model-driven Algorithms and Architectures for Self-Aware Computing Systems\'\'},\n  days = {21},\n  month = {January},\n  year = {2015},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/808}\n}\n
\n\n',NULL,'{The Descartes Modeling Language and Tool Chain}',0,1,2015,1,NULL,NULL,NULL,'2015-05-21 09:02:30','2016-06-01 09:41:04',0),(809,'talk','talk-Kounev-Florence15','misc','@misc{talk-Kounev-Florence15,\n author = {Samuel Kounev},\n title = {{Quantitative Evaluation of Service Dependability in Shared Execution Environments}},\n howpublished = {Keynote Talk at FLORENCE 2014 - a joint scientific event of QEST 2014, SAFECOMP 2014, FORMATS 2014, EPEW 2014 and FMICS 2014, Florence, Italy},\n days = {8-12},\n month = {September},\n year = {2014},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/809},\n}\n\n','\n\nSamuel Kounev.\nQuantitative Evaluation of Service Dependability in Shared Execution\nEnvironments.\nKeynote Talk at FLORENCE 2014 - a joint scientific event of QEST\n2014, SAFECOMP 2014, FORMATS 2014, EPEW 2014 and FMICS 2014, Florence, Italy,\nSeptember 2014.\n[ bib | slides  ] 
\n@misc{talk-Kounev-Florence15,\nauthor = {Samuel Kounev},\ntitle = {{Quantitative Evaluation of Service Dependability in Shared Execution Environments}},\nhowpublished = {Keynote Talk at FLORENCE 2014 - a joint scientific event of QEST 2014, SAFECOMP 2014, FORMATS 2014, EPEW 2014 and FMICS 2014, Florence, Italy},\ndays = {8-12},\nmonth = {September},\nyear = {2014},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/809}\n}\n
\n
\n','
\n@misc{talk-Kounev-Florence15,\n  author = {Samuel Kounev},\n  title = {{Quantitative Evaluation of Service Dependability in Shared Execution Environments}},\n  howpublished = {Keynote Talk at FLORENCE 2014 - a joint scientific event of QEST 2014, SAFECOMP 2014, FORMATS 2014, EPEW 2014 and FMICS 2014, Florence, Italy},\n  days = {8-12},\n  month = {September},\n  year = {2014},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/809}\n}\n
\n\n',NULL,'{Quantitative Evaluation of Service Dependability in Shared Execution Environments}',0,9,2014,9,NULL,NULL,NULL,'2015-05-21 09:05:51','2016-06-01 09:41:04',0),(810,'talk','talk-Kounev-WelcomeWue14','misc','@misc{talk-Kounev-WelcomeWue14,\n author = {Samuel Kounev},\n title = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\n howpublished = {Faculty of Mathematics and Computer Science, University of W\\\"{u}rzburg},\n days = {5},\n month = {May},\n year = {2014},\n}\n\n','\n\nSamuel Kounev.\nIngenieurmässige Entwicklung verlässlicher und effizienter\nSoftware-Systeme.\nFaculty of Mathematics and Computer Science, University of\nWürzburg, May 2014.\n[ bib  ] 
\n@misc{talk-Kounev-WelcomeWue14,\nauthor = {Samuel Kounev},\ntitle = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\nhowpublished = {Faculty of Mathematics and Computer Science, University of W\\\"{u}rzburg},\ndays = {5},\nmonth = {May},\nyear = {2014}\n}\n
\n
\n','
\n@misc{talk-Kounev-WelcomeWue14,\n  author = {Samuel Kounev},\n  title = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\n  howpublished = {Faculty of Mathematics and Computer Science, University of W\\\"{u}rzburg},\n  days = {5},\n  month = {May},\n  year = {2014}\n}\n
\n\n',NULL,'{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}',0,5,2014,5,NULL,NULL,NULL,'2015-05-21 09:08:40','2016-06-01 09:41:04',0),(811,'talk','talk-Kounev-SOSP14','misc','@misc{talk-Kounev-SOSP14,\n author = {Samuel Kounev},\n title = {{The Descartes Modeling Language: Status Quo}},\n howpublished = {Technical Talk at the Symposium on Software Performance (SOSP 2014), Joint Descartes/Kieker/Palladio Days (Joint Developer and Community Meeting), Stuttgart, Germany},\n days = {26-28},\n month = {November},\n year = {2014},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/811},\n}\n\n','\n\nSamuel Kounev.\nThe Descartes Modeling Language: Status Quo.\nTechnical Talk at the Symposium on Software Performance (SOSP 2014),\nJoint Descartes/Kieker/Palladio Days (Joint Developer and Community Meeting),\nStuttgart, Germany, November 2014.\n[ bib | slides  ] 
\n@misc{talk-Kounev-SOSP14,\nauthor = {Samuel Kounev},\ntitle = {{The Descartes Modeling Language: Status Quo}},\nhowpublished = {Technical Talk at the Symposium on Software Performance (SOSP 2014), Joint Descartes/Kieker/Palladio Days (Joint Developer and Community Meeting), Stuttgart, Germany},\ndays = {26-28},\nmonth = {November},\nyear = {2014},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/811}\n}\n
\n
\n','
\n@misc{talk-Kounev-SOSP14,\n  author = {Samuel Kounev},\n  title = {{The Descartes Modeling Language: Status Quo}},\n  howpublished = {Technical Talk at the Symposium on Software Performance (SOSP 2014), Joint Descartes/Kieker/Palladio Days (Joint Developer and Community Meeting), Stuttgart, Germany},\n  days = {26-28},\n  month = {November},\n  year = {2014},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/811}\n}\n
\n\n',NULL,'{The Descartes Modeling Language: Status Quo}',0,11,2014,11,NULL,NULL,NULL,'2015-05-21 09:10:31','2016-06-01 09:41:04',0),(812,'talk','talk-Kounev-VMWare13','misc','@misc{talk-Kounev-VMWare13,\n author = {Samuel Kounev},\n title = {{Online model-based performance and resource management in virtualized application environments}},\n howpublished = {Invited Talk. 2013 VMware Academic Research Symposium, Palo Alto, CA, USA},\n days = {17},\n month = {July},\n year = {2013},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/812},\n}\n\n','\n\nSamuel Kounev.\nOnline model-based performance and resource management in\nvirtualized application environments.\nInvited Talk. 2013 VMware Academic Research Symposium, Palo Alto, CA,\nUSA, July 2013.\n[ bib | slides  ] 
\n@misc{talk-Kounev-VMWare13,\nauthor = {Samuel Kounev},\ntitle = {{Online model-based performance and resource management in virtualized application environments}},\nhowpublished = {Invited Talk. 2013 VMware Academic Research Symposium, Palo Alto, CA, USA},\ndays = {17},\nmonth = {July},\nyear = {2013},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/812}\n}\n
\n
\n','
\n@misc{talk-Kounev-VMWare13,\n  author = {Samuel Kounev},\n  title = {{Online model-based performance and resource management in virtualized application environments}},\n  howpublished = {Invited Talk. 2013 VMware Academic Research Symposium, Palo Alto, CA, USA},\n  days = {17},\n  month = {July},\n  year = {2013},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/812}\n}\n
\n\n',NULL,'{Online model-based performance and resource management in virtualized application environments}',0,7,2013,7,NULL,NULL,NULL,'2015-05-21 09:14:16','2016-06-01 09:41:04',0),(813,'talk','talk-Kounev-Salesforce13','misc','@misc{talk-Kounev-Salesforce13,\n author = {Samuel Kounev},\n title = {{Online workload forecasting and performance prediction for elastic capacity management in cloud environments}},\n howpublished = {Invited Talk. Salesforce.com, San Francisco, CA, USA},\n days = {16},\n month = {July},\n year = {2013},\n}\n\n','\n\nSamuel Kounev.\nOnline workload forecasting and performance prediction for elastic\ncapacity management in cloud environments.\nInvited Talk. Salesforce.com, San Francisco, CA, USA, July 2013.\n[ bib  ] 
\n@misc{talk-Kounev-Salesforce13,\nauthor = {Samuel Kounev},\ntitle = {{Online workload forecasting and performance prediction for elastic capacity management in cloud environments}},\nhowpublished = {Invited Talk. Salesforce.com, San Francisco, CA, USA},\ndays = {16},\nmonth = {July},\nyear = {2013}\n}\n
\n
\n','
\n@misc{talk-Kounev-Salesforce13,\n  author = {Samuel Kounev},\n  title = {{Online workload forecasting and performance prediction for elastic capacity management in cloud environments}},\n  howpublished = {Invited Talk. Salesforce.com, San Francisco, CA, USA},\n  days = {16},\n  month = {July},\n  year = {2013}\n}\n
\n\n',NULL,'{Online workload forecasting and performance prediction for elastic capacity management in cloud environments}',0,7,2013,7,NULL,NULL,NULL,'2015-05-21 09:16:15','2016-06-01 09:41:04',0),(814,'talk','talk-Kounev-hottopics13','misc','@misc{talk-Kounev-hottopics13,\n author = {Samuel Kounev},\n title = {{RELATE: A Research Training Network on Engineering and Provisioning of Service-Based Cloud Applications}},\n howpublished = {Invited Talk, International Workshop on Hot Topics in Cloud Services (HotTopiCS 2013), Prague, Czech Republic},\n days = {20-21},\n month = {April},\n year = {2013},\n}\n\n','\n\nSamuel Kounev.\nRELATE: A Research Training Network on Engineering and Provisioning\nof Service-Based Cloud Applications.\nInvited Talk, International Workshop on Hot Topics in Cloud Services\n(HotTopiCS 2013), Prague, Czech Republic, April 2013.\n[ bib  ] 
\n@misc{talk-Kounev-hottopics13,\nauthor = {Samuel Kounev},\ntitle = {{RELATE: A Research Training Network on Engineering and Provisioning of Service-Based Cloud Applications}},\nhowpublished = {Invited Talk, International Workshop on Hot Topics in Cloud Services (HotTopiCS 2013), Prague, Czech Republic},\ndays = {20-21},\nmonth = {April},\nyear = {2013}\n}\n
\n
\n','
\n@misc{talk-Kounev-hottopics13,\n  author = {Samuel Kounev},\n  title = {{RELATE: A Research Training Network on Engineering and Provisioning of Service-Based Cloud Applications}},\n  howpublished = {Invited Talk, International Workshop on Hot Topics in Cloud Services (HotTopiCS 2013), Prague, Czech Republic},\n  days = {20-21},\n  month = {April},\n  year = {2013}\n}\n
\n\n',NULL,'{RELATE: A Research Training Network on Engineering and Provisioning of Service-Based Cloud Applications}',0,4,2013,4,NULL,NULL,NULL,'2015-05-21 09:19:29','2016-06-01 09:41:04',0),(815,'talk','talk-Kounev-ERCFinal','misc','@misc{talk-Kounev-ERCFinal,\n author = {Samuel Kounev},\n title = {{ERC Starting Grant Finalist}},\n howpublished = {(top 18\\% out of 3.329 StG applicants), European Research Council, Brussels, Belgium},\n}\n\n','\n\nSamuel Kounev.\nERC Starting Grant Finalist.\n(top 18% out of 3.329 StG applicants), European Research Council,\nBrussels, Belgium.\n[ bib  ] 
\n@misc{talk-Kounev-ERCFinal,\nauthor = {Samuel Kounev},\ntitle = {{ERC Starting Grant Finalist}},\nhowpublished = {(top 18\\% out of 3.329 StG applicants), European Research Council, Brussels, Belgium}\n}\n
\n
\n','
\n@misc{talk-Kounev-ERCFinal,\n  author = {Samuel Kounev},\n  title = {{ERC Starting Grant Finalist}},\n  howpublished = {(top 18\\% out of 3.329 StG applicants), European Research Council, Brussels, Belgium}\n}\n
\n\n',NULL,'{ERC Starting Grant Finalist}',0,0,NULL,0,NULL,NULL,NULL,'2015-05-21 09:21:08','2016-06-01 09:41:04',0),(816,'talk','talk-Kounev-DMMDublin13','misc','@misc{talk-Kounev-DMMDublin13,\n author = {Samuel Kounev},\n title = {{The Descartes Meta-Model (DMM) - An Architecture-level Modeling Language for Online Quality-of-Service and Resource Management}},\n howpublished = {Invited Talk. UCD School of Computer Science and Informatics, University College Dublin, Dublin, Ireland},\n days = {22},\n month = {March},\n year = {2013},\n}\n\n','\n\nSamuel Kounev.\nThe Descartes Meta-Model (DMM) - An Architecture-level Modeling\nLanguage for Online Quality-of-Service and Resource Management.\nInvited Talk. UCD School of Computer Science and Informatics,\nUniversity College Dublin, Dublin, Ireland, March 2013.\n[ bib  ] 
\n@misc{talk-Kounev-DMMDublin13,\nauthor = {Samuel Kounev},\ntitle = {{The Descartes Meta-Model (DMM) - An Architecture-level Modeling Language for Online Quality-of-Service and Resource Management}},\nhowpublished = {Invited Talk. UCD School of Computer Science and Informatics, University College Dublin, Dublin, Ireland},\ndays = {22},\nmonth = {March},\nyear = {2013}\n}\n
\n
\n','
\n@misc{talk-Kounev-DMMDublin13,\n  author = {Samuel Kounev},\n  title = {{The Descartes Meta-Model (DMM) - An Architecture-level Modeling Language for Online Quality-of-Service and Resource Management}},\n  howpublished = {Invited Talk. UCD School of Computer Science and Informatics, University College Dublin, Dublin, Ireland},\n  days = {22},\n  month = {March},\n  year = {2013}\n}\n
\n\n',NULL,'{The Descartes Meta-Model (DMM) - An Architecture-level Modeling Language for Online Quality-of-Service and Resource Management}',0,3,2013,3,NULL,NULL,NULL,'2015-05-21 09:22:11','2016-06-01 09:41:04',0),(817,'talk','talk-Kounev-WueInv13','misc','@misc{talk-Kounev-WueInv13,\n author = {Samuel Kounev},\n title = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\n howpublished = {Invited Talk, Faculty of Mathematics and Computer Science, University of W\\\"{u}rzburg, W\\\"{u}rzburg},\n days = {5},\n month = {March},\n year = {2013},\n}\n\n','\n\nSamuel Kounev.\nIngenieurmässige Entwicklung verlässlicher und effizienter\nSoftware-Systeme.\nInvited Talk, Faculty of Mathematics and Computer Science, University\nof Würzburg, Würzburg, March 2013.\n[ bib  ] 
\n@misc{talk-Kounev-WueInv13,\nauthor = {Samuel Kounev},\ntitle = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\nhowpublished = {Invited Talk, Faculty of Mathematics and Computer Science, University of W\\\"{u}rzburg, W\\\"{u}rzburg},\ndays = {5},\nmonth = {March},\nyear = {2013}\n}\n
\n
\n','
\n@misc{talk-Kounev-WueInv13,\n  author = {Samuel Kounev},\n  title = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\n  howpublished = {Invited Talk, Faculty of Mathematics and Computer Science, University of W\\\"{u}rzburg, W\\\"{u}rzburg},\n  days = {5},\n  month = {March},\n  year = {2013}\n}\n
\n\n',NULL,'{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}',0,3,2013,3,NULL,NULL,NULL,'2015-05-21 09:25:30','2016-06-01 10:34:02',0),(818,'talk','talk-Kounev-relate-KIT-12','misc','@misc{talk-Kounev-relate-KIT-12,\n author = {Samuel Kounev},\n title = {{Design-Time vs. Run-Time Models for Quality-of-Service Prediction}},\n howpublished = {Keynote Talk, Open Excellence Workshop on \"Online Models for Quality-of-Service and Resource Management in Modern IT Systems\" organized by the \"RELATE\" FP7 Marie Curie Initial Training Network (ITN), Karlsruhe, Germany},\n days = {4},\n month = {December},\n year = {2012},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/818},\n}\n\n','\n\nSamuel Kounev.\nDesign-Time vs. Run-Time Models for Quality-of-Service Prediction.\nKeynote Talk, Open Excellence Workshop on \"Online Models for\nQuality-of-Service and Resource Management in Modern IT Systems\" organized by\nthe \"RELATE\" FP7 Marie Curie Initial Training Network (ITN), Karlsruhe,\nGermany, December 2012.\n[ bib | slides  ] 
\n@misc{talk-Kounev-relate-KIT-12,\nauthor = {Samuel Kounev},\ntitle = {{Design-Time vs. Run-Time Models for Quality-of-Service Prediction}},\nhowpublished = {Keynote Talk, Open Excellence Workshop on \"Online Models for Quality-of-Service and Resource Management in Modern IT Systems\" organized by the \"RELATE\" FP7 Marie Curie Initial Training Network (ITN), Karlsruhe, Germany},\ndays = {4},\nmonth = {December},\nyear = {2012},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/818}\n}\n
\n
\n','
\n@misc{talk-Kounev-relate-KIT-12,\n  author = {Samuel Kounev},\n  title = {{Design-Time vs. Run-Time Models for Quality-of-Service Prediction}},\n  howpublished = {Keynote Talk, Open Excellence Workshop on \"Online Models for Quality-of-Service and Resource Management in Modern IT Systems\" organized by the \"RELATE\" FP7 Marie Curie Initial Training Network (ITN), Karlsruhe, Germany},\n  days = {4},\n  month = {December},\n  year = {2012},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/818}\n}\n
\n\n',NULL,'{Design-Time vs. Run-Time Models for Quality-of-Service Prediction}',0,12,2012,12,NULL,NULL,NULL,'2015-05-21 09:34:37','2016-06-01 09:41:04',0),(819,'talk','talk-Kounev-InvUlm12','misc','@misc{talk-Kounev-InvUlm12,\n author = {Samuel Kounev},\n title = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\n howpublished = {Invited Talk, Faculty of Engineering and Computer Science, University of Ulm, Ulm, Germany},\n days = {12},\n month = {November},\n year = {2012},\n}\n\n','\n\nSamuel Kounev.\nIngenieurmässige Entwicklung verlässlicher und effizienter\nSoftware-Systeme.\nInvited Talk, Faculty of Engineering and Computer Science, University\nof Ulm, Ulm, Germany, November 2012.\n[ bib  ] 
\n@misc{talk-Kounev-InvUlm12,\nauthor = {Samuel Kounev},\ntitle = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\nhowpublished = {Invited Talk, Faculty of Engineering and Computer Science, University of Ulm, Ulm, Germany},\ndays = {12},\nmonth = {November},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Kounev-InvUlm12,\n  author = {Samuel Kounev},\n  title = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\n  howpublished = {Invited Talk, Faculty of Engineering and Computer Science, University of Ulm, Ulm, Germany},\n  days = {12},\n  month = {November},\n  year = {2012}\n}\n
\n\n',NULL,'{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}',0,11,2012,11,NULL,NULL,NULL,'2015-05-21 09:56:58','2016-06-01 09:41:04',0),(820,'talk','talk-Kounev-InvStutt12','misc','@misc{talk-Kounev-InvStutt12,\n author = {Samuel Kounev},\n title = {{Engineering of Dependable and Efficient Self-Aware Complex Systems}},\n howpublished = {Invited Talk (Kolloquiumsvortrag), Faculty of Computer Science, Electrical Engineering and Information Technology, University of Stuttgart, Stuttgart, Germany},\n days = {9},\n month = {July},\n year = {2012},\n}\n\n','\n\nSamuel Kounev.\nEngineering of Dependable and Efficient Self-Aware Complex Systems.\nInvited Talk (Kolloquiumsvortrag), Faculty of Computer Science,\nElectrical Engineering and Information Technology, University of Stuttgart,\nStuttgart, Germany, July 2012.\n[ bib  ] 
\n@misc{talk-Kounev-InvStutt12,\nauthor = {Samuel Kounev},\ntitle = {{Engineering of Dependable and Efficient Self-Aware Complex Systems}},\nhowpublished = {Invited Talk (Kolloquiumsvortrag), Faculty of Computer Science, Electrical Engineering and Information Technology, University of Stuttgart, Stuttgart, Germany},\ndays = {9},\nmonth = {July},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Kounev-InvStutt12,\n  author = {Samuel Kounev},\n  title = {{Engineering of Dependable and Efficient Self-Aware Complex Systems}},\n  howpublished = {Invited Talk (Kolloquiumsvortrag), Faculty of Computer Science, Electrical Engineering and Information Technology, University of Stuttgart, Stuttgart, Germany},\n  days = {9},\n  month = {July},\n  year = {2012}\n}\n
\n\n',NULL,'{Engineering of Dependable and Efficient Self-Aware Complex Systems}',0,7,2012,7,NULL,NULL,NULL,'2015-05-21 10:01:32','2016-06-01 09:41:04',0),(821,'talk','talk-Kounev-InvPassau12','misc','@misc{talk-Kounev-InvPassau12,\n author = {Samuel Kounev},\n title = {{Engineering of Dependable and Efficient Self-Aware Complex Systems}},\n howpublished = {Invited Talk, Faculty of Computer Science and Mathematics, University of Passau, Passau, Germany},\n days = {29},\n month = {June},\n year = {2012},\n}\n\n','\n\nSamuel Kounev.\nEngineering of Dependable and Efficient Self-Aware Complex Systems.\nInvited Talk, Faculty of Computer Science and Mathematics, University\nof Passau, Passau, Germany, June 2012.\n[ bib  ] 
\n@misc{talk-Kounev-InvPassau12,\nauthor = {Samuel Kounev},\ntitle = {{Engineering of Dependable and Efficient Self-Aware Complex Systems}},\nhowpublished = {Invited Talk, Faculty of Computer Science and Mathematics, University of Passau, Passau, Germany},\ndays = {29},\nmonth = {June},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Kounev-InvPassau12,\n  author = {Samuel Kounev},\n  title = {{Engineering of Dependable and Efficient Self-Aware Complex Systems}},\n  howpublished = {Invited Talk, Faculty of Computer Science and Mathematics, University of Passau, Passau, Germany},\n  days = {29},\n  month = {June},\n  year = {2012}\n}\n
\n\n',NULL,'{Engineering of Dependable and Efficient Self-Aware Complex Systems}',0,6,2012,6,NULL,NULL,NULL,'2015-05-21 10:23:52','2016-06-01 09:41:04',0),(822,'talk','talk-Kounev-InvPrague12','misc','@misc{talk-Kounev-InvPrague12,\n author = {Samuel Kounev},\n title = {{Introduction to the Descartes Meta-Model (DMM)}},\n howpublished = {Invited Talk, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic},\n days = {4},\n month = {June},\n year = {2012},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/822},\n}\n\n','\n\nSamuel Kounev.\nIntroduction to the Descartes Meta-Model (DMM).\nInvited Talk, Faculty of Mathematics and Physics, Charles University,\nPrague, Czech Republic, June 2012.\n[ bib | slides  ] 
\n@misc{talk-Kounev-InvPrague12,\nauthor = {Samuel Kounev},\ntitle = {{Introduction to the Descartes Meta-Model (DMM)}},\nhowpublished = {Invited Talk, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic},\ndays = {4},\nmonth = {June},\nyear = {2012},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/822}\n}\n
\n
\n','
\n@misc{talk-Kounev-InvPrague12,\n  author = {Samuel Kounev},\n  title = {{Introduction to the Descartes Meta-Model (DMM)}},\n  howpublished = {Invited Talk, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic},\n  days = {4},\n  month = {June},\n  year = {2012},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/822}\n}\n
\n\n',NULL,'{Introduction to the Descartes Meta-Model (DMM)}',0,6,2012,6,NULL,NULL,NULL,'2015-05-21 10:25:20','2016-06-01 09:41:04',0),(823,'talk','talk-Kounev-Dagstuhl12','misc','@misc{talk-Kounev-Dagstuhl12,\n author = {Samuel Kounev},\n title = {{Engineering of Self-Aware Software Systems -- An Online Model-based Approach}},\n howpublished = {Dagstuhl Seminar 12211 \'\'Quality-of-Service Attributes in Service- and Cloud-based Systems\'\', Schloss Dagstuhl, Germany},\n days = {23},\n month = {May},\n year = {2012},\n}\n\n','\n\nSamuel Kounev.\nEngineering of Self-Aware Software Systems - An Online Model-based\nApproach.\nDagstuhl Seminar 12211 ”Quality-of-Service Attributes in Service-\nand Cloud-based Systems”, Schloss Dagstuhl, Germany, May 2012.\n[ bib  ] 
\n@misc{talk-Kounev-Dagstuhl12,\nauthor = {Samuel Kounev},\ntitle = {{Engineering of Self-Aware Software Systems -- An Online Model-based Approach}},\nhowpublished = {Dagstuhl Seminar 12211 \'\'Quality-of-Service Attributes in Service- and Cloud-based Systems\'\', Schloss Dagstuhl, Germany},\ndays = {23},\nmonth = {May},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Kounev-Dagstuhl12,\n  author = {Samuel Kounev},\n  title = {{Engineering of Self-Aware Software Systems -- An Online Model-based Approach}},\n  howpublished = {Dagstuhl Seminar 12211 \'\'Quality-of-Service Attributes in Service- and Cloud-based Systems\'\', Schloss Dagstuhl, Germany},\n  days = {23},\n  month = {May},\n  year = {2012}\n}\n
\n\n',NULL,'{Engineering of Self-Aware Software Systems -- An Online Model-based Approach}',0,5,2012,5,NULL,NULL,NULL,'2015-05-21 10:27:47','2016-06-01 09:41:04',0),(824,'talk','talk-Kounev-Cloudzone12','misc','@misc{talk-Kounev-Cloudzone12,\n author = {Samuel Kounev},\n title = {{Cloud Computing Challenges and Opportunities for Service Providers}},\n howpublished = {Invited Talk, CLOUDZONE 2012, Karlsruher Messe- und Kongress-GmbH, Karlsruhe, Germany},\n days = {11},\n month = {May},\n year = {2012},\n}\n\n','\n\nSamuel Kounev.\nCloud Computing Challenges and Opportunities for Service Providers.\nInvited Talk, CLOUDZONE 2012, Karlsruher Messe- und Kongress-GmbH,\nKarlsruhe, Germany, May 2012.\n[ bib  ] 
\n@misc{talk-Kounev-Cloudzone12,\nauthor = {Samuel Kounev},\ntitle = {{Cloud Computing Challenges and Opportunities for Service Providers}},\nhowpublished = {Invited Talk, CLOUDZONE 2012, Karlsruher Messe- und Kongress-GmbH, Karlsruhe, Germany},\ndays = {11},\nmonth = {May},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Kounev-Cloudzone12,\n  author = {Samuel Kounev},\n  title = {{Cloud Computing Challenges and Opportunities for Service Providers}},\n  howpublished = {Invited Talk, CLOUDZONE 2012, Karlsruher Messe- und Kongress-GmbH, Karlsruhe, Germany},\n  days = {11},\n  month = {May},\n  year = {2012}\n}\n
\n\n',NULL,'{Cloud Computing Challenges and Opportunities for Service Providers}',0,5,2012,5,NULL,NULL,NULL,'2015-05-21 10:32:40','2016-06-01 09:41:04',0),(825,'talk','talk-Kounev-SAPResearch12','misc','@misc{talk-Kounev-SAPResearch12,\n author = {Samuel Kounev},\n title = {{The Descartes Meta-Model for Online QoS and Resource Management}},\n howpublished = {Invited Talk, SAP Research, Karlsruhe/Darmstadt, Germany},\n days = {4},\n month = {May},\n year = {2012},\n}\n\n','\n\nSamuel Kounev.\nThe Descartes Meta-Model for Online QoS and Resource Management.\nInvited Talk, SAP Research, Karlsruhe/Darmstadt, Germany, May 2012.\n[ bib  ] 
\n@misc{talk-Kounev-SAPResearch12,\nauthor = {Samuel Kounev},\ntitle = {{The Descartes Meta-Model for Online QoS and Resource Management}},\nhowpublished = {Invited Talk, SAP Research, Karlsruhe/Darmstadt, Germany},\ndays = {4},\nmonth = {May},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Kounev-SAPResearch12,\n  author = {Samuel Kounev},\n  title = {{The Descartes Meta-Model for Online QoS and Resource Management}},\n  howpublished = {Invited Talk, SAP Research, Karlsruhe/Darmstadt, Germany},\n  days = {4},\n  month = {May},\n  year = {2012}\n}\n
\n\n',NULL,'{The Descartes Meta-Model for Online QoS and Resource Management}',0,5,2012,5,NULL,NULL,NULL,'2015-05-21 10:33:54','2016-06-01 09:41:04',0),(826,'talk','talk-Kounev-IBM12','misc','@misc{talk-Kounev-IBM12,\n author = {Samuel Kounev},\n title = {{Model-based Self-Adaptive Resource Management in Virtualized Environments}},\n howpublished = {Invited Talk, IBM T.J. Watson Research Center, New York, USA},\n days = {27},\n month = {April},\n year = {2012},\n}\n\n','\n\nSamuel Kounev.\nModel-based Self-Adaptive Resource Management in Virtualized\nEnvironments.\nInvited Talk, IBM T.J. Watson Research Center, New York, USA, April\n2012.\n[ bib  ] 
\n@misc{talk-Kounev-IBM12,\nauthor = {Samuel Kounev},\ntitle = {{Model-based Self-Adaptive Resource Management in Virtualized Environments}},\nhowpublished = {Invited Talk, IBM T.J. Watson Research Center, New York, USA},\ndays = {27},\nmonth = {April},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Kounev-IBM12,\n  author = {Samuel Kounev},\n  title = {{Model-based Self-Adaptive Resource Management in Virtualized Environments}},\n  howpublished = {Invited Talk, IBM T.J. Watson Research Center, New York, USA},\n  days = {27},\n  month = {April},\n  year = {2012}\n}\n
\n\n',NULL,'{Model-based Self-Adaptive Resource Management in Virtualized Environments}',0,4,2012,4,NULL,NULL,NULL,'2015-05-21 10:38:47','2016-06-01 09:41:04',0),(827,'talk','talk-Kounev-AMCSPEC12','misc','@misc{talk-Kounev-AMCSPEC12,\n author = {Samuel Kounev},\n title = {{Introduction to Queueing Petri Nets: Modeling Formalism, Tool Support and Case Studies}},\n howpublished = {Tutorial Presentation, 3rd ACM/SPEC International Conference on Performance Engineering (ICPE 2012), Boston, USA},\n days = {22},\n month = {April},\n year = {2012},\n}\n\n','\n\nSamuel Kounev.\nIntroduction to Queueing Petri Nets: Modeling Formalism, Tool\nSupport and Case Studies.\nTutorial Presentation, 3rd ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2012), Boston, USA, April 2012.\n[ bib  ] 
\n@misc{talk-Kounev-AMCSPEC12,\nauthor = {Samuel Kounev},\ntitle = {{Introduction to Queueing Petri Nets: Modeling Formalism, Tool Support and Case Studies}},\nhowpublished = {Tutorial Presentation, 3rd ACM/SPEC International Conference on Performance Engineering (ICPE 2012), Boston, USA},\ndays = {22},\nmonth = {April},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Kounev-AMCSPEC12,\n  author = {Samuel Kounev},\n  title = {{Introduction to Queueing Petri Nets: Modeling Formalism, Tool Support and Case Studies}},\n  howpublished = {Tutorial Presentation, 3rd ACM/SPEC International Conference on Performance Engineering (ICPE 2012), Boston, USA},\n  days = {22},\n  month = {April},\n  year = {2012}\n}\n
\n\n',NULL,'{Introduction to Queueing Petri Nets: Modeling Formalism, Tool Support and Case Studies}',0,4,2012,4,NULL,NULL,NULL,'2015-05-21 10:42:08','2016-06-01 09:41:04',0),(828,'talk','talk-Kounev-FESCA12','misc','@misc{talk-Kounev-FESCA12,\n author = {Samuel Kounev},\n title = {{Modeling of Event-based Communication in Component-based Architectures: State-of-the-Art and Future Directions}},\n howpublished = {Keynote Talk, 9th International Workshop on Formal Engineering approaches to Software Components and Architectures (FESCA @ ETAPS 2012), Tallinn, Estonia},\n days = {31},\n month = {March},\n year = {2012},\n}\n\n','\n\nSamuel Kounev.\nModeling of Event-based Communication in Component-based\nArchitectures: State-of-the-Art and Future Directions.\nKeynote Talk, 9th International Workshop on Formal Engineering\napproaches to Software Components and Architectures (FESCA @ ETAPS 2012),\nTallinn, Estonia, March 2012.\n[ bib  ] 
\n@misc{talk-Kounev-FESCA12,\nauthor = {Samuel Kounev},\ntitle = {{Modeling of Event-based Communication in Component-based Architectures: State-of-the-Art and Future Directions}},\nhowpublished = {Keynote Talk, 9th International Workshop on Formal Engineering approaches to Software Components and Architectures (FESCA @ ETAPS 2012), Tallinn, Estonia},\ndays = {31},\nmonth = {March},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Kounev-FESCA12,\n  author = {Samuel Kounev},\n  title = {{Modeling of Event-based Communication in Component-based Architectures: State-of-the-Art and Future Directions}},\n  howpublished = {Keynote Talk, 9th International Workshop on Formal Engineering approaches to Software Components and Architectures (FESCA @ ETAPS 2012), Tallinn, Estonia},\n  days = {31},\n  month = {March},\n  year = {2012}\n}\n
\n\n',NULL,'{Modeling of Event-based Communication in Component-based Architectures: State-of-the-Art and Future Directions}',0,3,2012,3,NULL,NULL,NULL,'2015-05-21 10:44:52','2016-06-01 09:41:04',0),(829,'talk','talk-Kounev-MultiSkill-KIT12','misc','@misc{talk-Kounev-MultiSkill-KIT12,\n author = {Samuel Kounev},\n title = {{Industry Trends and Research Challenges in Cloud Computing}},\n howpublished = {Keynote Talk, Multi-Skills Training Camp, \"RELATE\" Marie Curie Initial Training Network (ITN), Karlsruhe, Germany},\n days = {13},\n month = {March},\n year = {2012},\n}\n\n','\n\nSamuel Kounev.\nIndustry Trends and Research Challenges in Cloud Computing.\nKeynote Talk, Multi-Skills Training Camp, \"RELATE\" Marie Curie\nInitial Training Network (ITN), Karlsruhe, Germany, March 2012.\n[ bib  ] 
\n@misc{talk-Kounev-MultiSkill-KIT12,\nauthor = {Samuel Kounev},\ntitle = {{Industry Trends and Research Challenges in Cloud Computing}},\nhowpublished = {Keynote Talk, Multi-Skills Training Camp, \"RELATE\" Marie Curie Initial Training Network (ITN), Karlsruhe, Germany},\ndays = {13},\nmonth = {March},\nyear = {2012}\n}\n
\n
\n','
\n@misc{talk-Kounev-MultiSkill-KIT12,\n  author = {Samuel Kounev},\n  title = {{Industry Trends and Research Challenges in Cloud Computing}},\n  howpublished = {Keynote Talk, Multi-Skills Training Camp, \"RELATE\" Marie Curie Initial Training Network (ITN), Karlsruhe, Germany},\n  days = {13},\n  month = {March},\n  year = {2012}\n}\n
\n\n',NULL,'{Industry Trends and Research Challenges in Cloud Computing}',0,3,2012,3,NULL,NULL,NULL,'2015-05-21 10:51:57','2016-06-01 09:41:04',0),(830,'talk','talk-Kounev-InvImperial11','misc','@misc{talk-Kounev-InvImperial11,\n author = {Samuel Kounev},\n title = {{Engineering of Self-Aware IT Systems and Services}},\n howpublished = {Invited Talk, Imperial College London, Department of Computing, London, UK},\n days = {21},\n month = {November},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nEngineering of Self-Aware IT Systems and Services.\nInvited Talk, Imperial College London, Department of Computing,\nLondon, UK, November 2011.\n[ bib  ] 
\n@misc{talk-Kounev-InvImperial11,\nauthor = {Samuel Kounev},\ntitle = {{Engineering of Self-Aware IT Systems and Services}},\nhowpublished = {Invited Talk, Imperial College London, Department of Computing, London, UK},\ndays = {21},\nmonth = {November},\nyear = {2011}\n}\n
\n
\n','
\n@misc{talk-Kounev-InvImperial11,\n  author = {Samuel Kounev},\n  title = {{Engineering of Self-Aware IT Systems and Services}},\n  howpublished = {Invited Talk, Imperial College London, Department of Computing, London, UK},\n  days = {21},\n  month = {November},\n  year = {2011}\n}\n
\n\n',NULL,'{Engineering of Self-Aware IT Systems and Services}',0,11,2011,11,NULL,NULL,NULL,'2015-05-22 08:27:40','2016-06-01 09:41:04',0),(831,'talk','talk-Kounev-Palladio11','misc','@misc{talk-Kounev-Palladio11,\n author = {Samuel Kounev},\n title = {{From Offline to Online Component Models for Run-Time Resource Management}},\n howpublished = {Invited Talk, Palladio Days 2011, FZI Forschungzentrum Informatik, Karlsruhe, Germany},\n days = {17},\n month = {November},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nFrom Offline to Online Component Models for Run-Time Resource\nManagement.\nInvited Talk, Palladio Days 2011, FZI Forschungzentrum Informatik,\nKarlsruhe, Germany, November 2011.\n[ bib  ] 
\n@misc{talk-Kounev-Palladio11,\nauthor = {Samuel Kounev},\ntitle = {{From Offline to Online Component Models for Run-Time Resource Management}},\nhowpublished = {Invited Talk, Palladio Days 2011, FZI Forschungzentrum Informatik, Karlsruhe, Germany},\ndays = {17},\nmonth = {November},\nyear = {2011}\n}\n
\n
\n','
\n@misc{talk-Kounev-Palladio11,\n  author = {Samuel Kounev},\n  title = {{From Offline to Online Component Models for Run-Time Resource Management}},\n  howpublished = {Invited Talk, Palladio Days 2011, FZI Forschungzentrum Informatik, Karlsruhe, Germany},\n  days = {17},\n  month = {November},\n  year = {2011}\n}\n
\n\n',NULL,'{From Offline to Online Component Models for Run-Time Resource Management}',0,11,2011,11,NULL,NULL,NULL,'2015-05-22 08:29:37','2016-06-01 09:41:05',0),(832,'talk','talk-Kounev-BYonder11','misc','@misc{talk-Kounev-BYonder11,\n author = {Samuel Kounev},\n title = {{Descartes Research Group at KIT: Engineering of Self-Aware IT Systems and Services}},\n howpublished = {Invited Talk, Blue Yonder GmbH & Co. KG, Karlsruhe, Germany},\n days = {10},\n month = {November},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nDescartes Research Group at KIT: Engineering of Self-Aware IT\nSystems and Services.\nInvited Talk, Blue Yonder GmbH & Co. KG, Karlsruhe, Germany, November\n2011.\n[ bib  ] 
\n@misc{talk-Kounev-BYonder11,\nauthor = {Samuel Kounev},\ntitle = {{Descartes Research Group at KIT: Engineering of Self-Aware IT Systems and Services}},\nhowpublished = {Invited Talk, Blue Yonder GmbH & Co. KG, Karlsruhe, Germany},\ndays = {10},\nmonth = {November},\nyear = {2011}\n}\n
\n
\n','
\n@misc{talk-Kounev-BYonder11,\n  author = {Samuel Kounev},\n  title = {{Descartes Research Group at KIT: Engineering of Self-Aware IT Systems and Services}},\n  howpublished = {Invited Talk, Blue Yonder GmbH & Co. KG, Karlsruhe, Germany},\n  days = {10},\n  month = {November},\n  year = {2011}\n}\n
\n\n',NULL,'{Descartes Research Group at KIT: Engineering of Self-Aware IT Systems and Services}',0,11,2011,11,NULL,NULL,NULL,'2015-05-22 08:31:43','2016-06-01 09:41:05',0),(833,'talk','talk-Kounev-EPEW11','misc','@misc{talk-Kounev-EPEW11,\n author = {Samuel Kounev},\n title = {{Engineering of Self-Aware IT Systems and Services: State-of-the-Art and Research Challenges}},\n howpublished = {Keynote Talk, 8th European Performance Engineering Workshop, Borrowdale, The English Lake District},\n days = {12-13},\n month = {October},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nEngineering of Self-Aware IT Systems and Services: State-of-the-Art\nand Research Challenges.\nKeynote Talk, 8th European Performance Engineering Workshop,\nBorrowdale, The English Lake District, October 2011.\n[ bib  ] 
\n@misc{talk-Kounev-EPEW11,\nauthor = {Samuel Kounev},\ntitle = {{Engineering of Self-Aware IT Systems and Services: State-of-the-Art and Research Challenges}},\nhowpublished = {Keynote Talk, 8th European Performance Engineering Workshop, Borrowdale, The English Lake District},\ndays = {12-13},\nmonth = {October},\nyear = {2011}\n}\n
\n
\n','
\n@misc{talk-Kounev-EPEW11,\n  author = {Samuel Kounev},\n  title = {{Engineering of Self-Aware IT Systems and Services: State-of-the-Art and Research Challenges}},\n  howpublished = {Keynote Talk, 8th European Performance Engineering Workshop, Borrowdale, The English Lake District},\n  days = {12-13},\n  month = {October},\n  year = {2011}\n}\n
\n\n',NULL,'{Engineering of Self-Aware IT Systems and Services: State-of-the-Art and Research Challenges}',0,10,2011,10,NULL,NULL,NULL,'2015-05-22 08:33:14','2016-06-01 09:41:05',0),(834,'talk','talk-Kounev-VMWare11','misc','@misc{talk-Kounev-VMWare11,\n author = {Samuel Kounev},\n title = {{Model-based Self-Adaptive Resource Management in Virtualized Environments}},\n howpublished = {Invited Talk, VMware, Inc., USA},\n days = {9},\n month = {June},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nModel-based Self-Adaptive Resource Management in Virtualized\nEnvironments.\nInvited Talk, VMware, Inc., USA, June 2011.\n[ bib  ] 
\n@misc{talk-Kounev-VMWare11,\nauthor = {Samuel Kounev},\ntitle = {{Model-based Self-Adaptive Resource Management in Virtualized Environments}},\nhowpublished = {Invited Talk, VMware, Inc., USA},\ndays = {9},\nmonth = {June},\nyear = {2011}\n}\n
\n
\n','
\n@misc{talk-Kounev-VMWare11,\n  author = {Samuel Kounev},\n  title = {{Model-based Self-Adaptive Resource Management in Virtualized Environments}},\n  howpublished = {Invited Talk, VMware, Inc., USA},\n  days = {9},\n  month = {June},\n  year = {2011}\n}\n
\n\n',NULL,'{Model-based Self-Adaptive Resource Management in Virtualized Environments}',0,6,2011,6,NULL,NULL,NULL,'2015-05-22 08:35:40','2016-06-01 09:41:05',0),(835,'talk','talk-Kounev-Dagstuhl11','misc','@misc{talk-Kounev-Dagstuhl11,\n author = {Samuel Kounev},\n title = {{Descartes Research Group at KIT: Towards Engineering of Self-Aware Software Systems}},\n howpublished = {Invited Talk, Jahrestreffen des Beirates der Universit\\\"atsprofessoren in der Gesselschaft f\\\"ur Informatik (GIBU), Schloss Dagstuhl},\n days = {17-20},\n month = {April},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nDescartes Research Group at KIT: Towards Engineering of Self-Aware\nSoftware Systems.\nInvited Talk, Jahrestreffen des Beirates der\nUniversitätsprofessoren in der Gesselschaft für Informatik (GIBU),\nSchloss Dagstuhl, April 2011.\n[ bib  ] 
\n@misc{talk-Kounev-Dagstuhl11,\nauthor = {Samuel Kounev},\ntitle = {{Descartes Research Group at KIT: Towards Engineering of Self-Aware Software Systems}},\nhowpublished = {Invited Talk, Jahrestreffen des Beirates der Universit\\\"atsprofessoren in der Gesselschaft f\\\"ur Informatik (GIBU), Schloss Dagstuhl},\ndays = {17-20},\nmonth = {April},\nyear = {2011}\n}\n
\n
\n','
\n@misc{talk-Kounev-Dagstuhl11,\n  author = {Samuel Kounev},\n  title = {{Descartes Research Group at KIT: Towards Engineering of Self-Aware Software Systems}},\n  howpublished = {Invited Talk, Jahrestreffen des Beirates der Universit\\\"atsprofessoren in der Gesselschaft f\\\"ur Informatik (GIBU), Schloss Dagstuhl},\n  days = {17-20},\n  month = {April},\n  year = {2011}\n}\n
\n\n',NULL,'{Descartes Research Group at KIT: Towards Engineering of Self-Aware Software Systems}',0,4,2011,4,NULL,NULL,NULL,'2015-05-22 08:37:09','2016-06-01 09:41:05',0),(836,'talk','talk-Kounev-Nachwuchs11','misc','@misc{talk-Kounev-Nachwuchs11,\n author = {Samuel Kounev},\n title = {{Self-Aware Software and Systems Engineering: A Vision and Research Roadmap}},\n howpublished = {Software Engineering 2011 (SE 2011), Nachwuchswissenschaftler-Symposium, Karlsruhe},\n days = {24},\n month = {February},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nSelf-Aware Software and Systems Engineering: A Vision and Research\nRoadmap.\nSoftware Engineering 2011 (SE 2011),\nNachwuchswissenschaftler-Symposium, Karlsruhe, February 2011.\n[ bib  ] 
\n@misc{talk-Kounev-Nachwuchs11,\nauthor = {Samuel Kounev},\ntitle = {{Self-Aware Software and Systems Engineering: A Vision and Research Roadmap}},\nhowpublished = {Software Engineering 2011 (SE 2011), Nachwuchswissenschaftler-Symposium, Karlsruhe},\ndays = {24},\nmonth = {February},\nyear = {2011}\n}\n
\n
\n','
\n@misc{talk-Kounev-Nachwuchs11,\n  author = {Samuel Kounev},\n  title = {{Self-Aware Software and Systems Engineering: A Vision and Research Roadmap}},\n  howpublished = {Software Engineering 2011 (SE 2011), Nachwuchswissenschaftler-Symposium, Karlsruhe},\n  days = {24},\n  month = {February},\n  year = {2011}\n}\n
\n\n',NULL,'{Self-Aware Software and Systems Engineering: A Vision and Research Roadmap}',0,2,2011,2,NULL,NULL,NULL,'2015-05-22 08:39:08','2016-06-01 09:41:05',0),(837,'talk','talk-Kounev-KielKolloq11','misc','@misc{talk-Kounev-KielKolloq11,\n author = {Samuel Kounev},\n title = {{Automatic Performance Model Extraction for Run-Time Capacity Management}},\n howpublished = {Invited Talk (Kolloquiumsvortrag), Department of Computer Science, Christian-Albrechts-Universit\\\"{a}t zu Kiel, Kiel},\n days = {21},\n month = {January},\n year = {2011},\n}\n\n','\n\nSamuel Kounev.\nAutomatic Performance Model Extraction for Run-Time Capacity\nManagement.\nInvited Talk (Kolloquiumsvortrag), Department of Computer Science,\nChristian-Albrechts-Universität zu Kiel, Kiel, January 2011.\n[ bib  ] 
\n@misc{talk-Kounev-KielKolloq11,\nauthor = {Samuel Kounev},\ntitle = {{Automatic Performance Model Extraction for Run-Time Capacity Management}},\nhowpublished = {Invited Talk (Kolloquiumsvortrag), Department of Computer Science, Christian-Albrechts-Universit\\\"{a}t zu Kiel, Kiel},\ndays = {21},\nmonth = {January},\nyear = {2011}\n}\n
\n
\n','
\n@misc{talk-Kounev-KielKolloq11,\n  author = {Samuel Kounev},\n  title = {{Automatic Performance Model Extraction for Run-Time Capacity Management}},\n  howpublished = {Invited Talk (Kolloquiumsvortrag), Department of Computer Science, Christian-Albrechts-Universit\\\"{a}t zu Kiel, Kiel},\n  days = {21},\n  month = {January},\n  year = {2011}\n}\n
\n\n',NULL,'{Automatic Performance Model Extraction for Run-Time Capacity Management}',0,1,2011,1,NULL,NULL,NULL,'2015-05-22 08:41:17','2016-06-01 10:23:40',0),(838,'talk','talk-Kounev-KITNachwuchs10','misc','@misc{talk-Kounev-KITNachwuchs10,\n author = {Samuel Kounev},\n title = {{Engineering of Next Generation Self-Aware Software Systems: A Research Roadmap}},\n howpublished = {Informatik am KIT: Die Nachwuchsgruppen stellen sich vor, Karlsruhe Institute of Technology, Karlsruhe, Germany},\n days = {26},\n month = {July},\n year = {2010},\n}\n\n','\n\nSamuel Kounev.\nEngineering of Next Generation Self-Aware Software Systems: A\nResearch Roadmap.\nInformatik am KIT: Die Nachwuchsgruppen stellen sich vor, Karlsruhe\nInstitute of Technology, Karlsruhe, Germany, July 2010.\n[ bib  ] 
\n@misc{talk-Kounev-KITNachwuchs10,\nauthor = {Samuel Kounev},\ntitle = {{Engineering of Next Generation Self-Aware Software Systems: A Research Roadmap}},\nhowpublished = {Informatik am KIT: Die Nachwuchsgruppen stellen sich vor, Karlsruhe Institute of Technology, Karlsruhe, Germany},\ndays = {26},\nmonth = {July},\nyear = {2010}\n}\n
\n
\n','
\n@misc{talk-Kounev-KITNachwuchs10,\n  author = {Samuel Kounev},\n  title = {{Engineering of Next Generation Self-Aware Software Systems: A Research Roadmap}},\n  howpublished = {Informatik am KIT: Die Nachwuchsgruppen stellen sich vor, Karlsruhe Institute of Technology, Karlsruhe, Germany},\n  days = {26},\n  month = {July},\n  year = {2010}\n}\n
\n\n',NULL,'{Engineering of Next Generation Self-Aware Software Systems: A Research Roadmap}',0,7,2010,7,NULL,NULL,NULL,'2015-05-22 08:43:24','2016-06-01 09:41:05',0),(839,'talk','talk-Kounev-Dagstuhl10','misc','@misc{talk-Kounev-Dagstuhl10,\n author = {Samuel Kounev},\n title = {{Towards Self-Aware Dependability Management in Virtualized Service Infrastructures}},\n howpublished = {Dagstuhl Seminar 10292, Resilience Assessment and Evaluation, Schloss Dagstuhl, Germany},\n days = {22},\n month = {July},\n year = {2010},\n}\n\n','\n\nSamuel Kounev.\nTowards Self-Aware Dependability Management in Virtualized Service\nInfrastructures.\nDagstuhl Seminar 10292, Resilience Assessment and Evaluation, Schloss\nDagstuhl, Germany, July 2010.\n[ bib  ] 
\n@misc{talk-Kounev-Dagstuhl10,\nauthor = {Samuel Kounev},\ntitle = {{Towards Self-Aware Dependability Management in Virtualized Service Infrastructures}},\nhowpublished = {Dagstuhl Seminar 10292, Resilience Assessment and Evaluation, Schloss Dagstuhl, Germany},\ndays = {22},\nmonth = {July},\nyear = {2010}\n}\n
\n
\n','
\n@misc{talk-Kounev-Dagstuhl10,\n  author = {Samuel Kounev},\n  title = {{Towards Self-Aware Dependability Management in Virtualized Service Infrastructures}},\n  howpublished = {Dagstuhl Seminar 10292, Resilience Assessment and Evaluation, Schloss Dagstuhl, Germany},\n  days = {22},\n  month = {July},\n  year = {2010}\n}\n
\n\n',NULL,'{Towards Self-Aware Dependability Management in Virtualized Service Infrastructures}',0,7,2010,7,NULL,NULL,NULL,'2015-05-22 08:46:38','2016-06-01 09:41:05',0),(840,'talk','talk-Kounev-GIF10','misc','@misc{talk-Kounev-GIF10,\n author = {Samuel Kounev},\n title = {{Performance Management in the Cloud}},\n howpublished = {Invited Talk, Annual Meeting of the GI Fachgruppe Software Architectures 2010, Munich, Germany},\n days = {16},\n month = {July},\n year = {2010},\n}\n\n','\n\nSamuel Kounev.\nPerformance Management in the Cloud.\nInvited Talk, Annual Meeting of the GI Fachgruppe Software\nArchitectures 2010, Munich, Germany, July 2010.\n[ bib  ] 
\n@misc{talk-Kounev-GIF10,\nauthor = {Samuel Kounev},\ntitle = {{Performance Management in the Cloud}},\nhowpublished = {Invited Talk, Annual Meeting of the GI Fachgruppe Software Architectures 2010, Munich, Germany},\ndays = {16},\nmonth = {July},\nyear = {2010}\n}\n
\n
\n','
\n@misc{talk-Kounev-GIF10,\n  author = {Samuel Kounev},\n  title = {{Performance Management in the Cloud}},\n  howpublished = {Invited Talk, Annual Meeting of the GI Fachgruppe Software Architectures 2010, Munich, Germany},\n  days = {16},\n  month = {July},\n  year = {2010}\n}\n
\n\n',NULL,'{Performance Management in the Cloud}',0,7,2010,7,NULL,NULL,NULL,'2015-05-22 08:49:09','2016-06-01 09:41:05',0),(841,'talk','talk-Kounev-Oracle09','misc','@misc{talk-Kounev-Oracle09,\n author = {Samuel Kounev},\n title = {{Automated Model-based Capacity Planning for Java EE applications}},\n howpublished = {Invited Talk, Oracle Corp, USA},\n days = {9},\n month = {December},\n year = {2009},\n}\n\n','\n\nSamuel Kounev.\nAutomated Model-based Capacity Planning for Java EE applications.\nInvited Talk, Oracle Corp, USA, December 2009.\n[ bib  ] 
\n@misc{talk-Kounev-Oracle09,\nauthor = {Samuel Kounev},\ntitle = {{Automated Model-based Capacity Planning for Java EE applications}},\nhowpublished = {Invited Talk, Oracle Corp, USA},\ndays = {9},\nmonth = {December},\nyear = {2009}\n}\n
\n
\n','
\n@misc{talk-Kounev-Oracle09,\n  author = {Samuel Kounev},\n  title = {{Automated Model-based Capacity Planning for Java EE applications}},\n  howpublished = {Invited Talk, Oracle Corp, USA},\n  days = {9},\n  month = {December},\n  year = {2009}\n}\n
\n\n',NULL,'{Automated Model-based Capacity Planning for Java EE applications}',0,12,2009,12,NULL,NULL,NULL,'2015-05-22 08:51:48','2016-06-01 09:41:05',0),(842,'talk','talk-Kounev-OraclePres09','misc','@misc{talk-Kounev-OraclePres09,\n author = {Samuel Kounev},\n title = {Using WebLogic Diagnostics Framework to Enable Performance Prediction for Java EE Applications},\n howpublished = {Presentation to Oracle Corp, USA},\n days = {9},\n month = {September},\n year = {2009},\n}\n\n','\n\nSamuel Kounev.\nUsing weblogic diagnostics framework to enable performance prediction\nfor java ee applications.\nPresentation to Oracle Corp, USA, September 2009.\n[ bib  ] 
\n@misc{talk-Kounev-OraclePres09,\nauthor = {Samuel Kounev},\ntitle = {Using WebLogic Diagnostics Framework to Enable Performance Prediction for Java EE Applications},\nhowpublished = {Presentation to Oracle Corp, USA},\ndays = {9},\nmonth = {September},\nyear = {2009}\n}\n
\n
\n','
\n@misc{talk-Kounev-OraclePres09,\n  author = {Samuel Kounev},\n  title = {Using WebLogic Diagnostics Framework to Enable Performance Prediction for Java EE Applications},\n  howpublished = {Presentation to Oracle Corp, USA},\n  days = {9},\n  month = {September},\n  year = {2009}\n}\n
\n\n',NULL,'Using WebLogic Diagnostics Framework to Enable Performance Prediction for Java EE Applications',0,9,2009,9,NULL,NULL,NULL,'2015-05-22 08:53:03','2016-06-01 09:41:05',0),(843,'talk','talk-Kounev-infoex09','misc','@misc{talk-Kounev-infoex09,\n author = {Samuel Kounev},\n title = {{Performance-Engineering-Research an der Universit\\\"{a}t Karlsruhe}},\n howpublished = {Invited Talk, CA infoexchange 2009 Conference, Mannheim, Germany},\n days = {20},\n month = {May},\n year = {2009},\n}\n\n','\n\nSamuel Kounev.\nPerformance-Engineering-Research an der Universität Karlsruhe.\nInvited Talk, CA infoexchange 2009 Conference, Mannheim, Germany, May\n2009.\n[ bib  ] 
\n@misc{talk-Kounev-infoex09,\nauthor = {Samuel Kounev},\ntitle = {{Performance-Engineering-Research an der Universit\\\"{a}t Karlsruhe}},\nhowpublished = {Invited Talk, CA infoexchange 2009 Conference, Mannheim, Germany},\ndays = {20},\nmonth = {May},\nyear = {2009}\n}\n
\n
\n','
\n@misc{talk-Kounev-infoex09,\n  author = {Samuel Kounev},\n  title = {{Performance-Engineering-Research an der Universit\\\"{a}t Karlsruhe}},\n  howpublished = {Invited Talk, CA infoexchange 2009 Conference, Mannheim, Germany},\n  days = {20},\n  month = {May},\n  year = {2009}\n}\n
\n\n',NULL,'{Performance-Engineering-Research an der Universit\\\"{a}t Karlsruhe}',0,5,2009,5,NULL,NULL,NULL,'2015-05-22 08:54:49','2016-06-01 09:41:05',0),(844,'talk','talk-Kounev-ABB09','misc','@misc{talk-Kounev-ABB09,\n author = {Samuel Kounev},\n title = {{SOA2 - A Vision of Next Generation Service-Oriented Architectures}},\n howpublished = {Invited Talk (Kolloquiumsvortrag), ABB Corporate Research, Ladenburg, Germany},\n days = {3},\n month = {April},\n year = {2009},\n}\n\n','\n\nSamuel Kounev.\nSOA2 - A Vision of Next Generation Service-Oriented Architectures.\nInvited Talk (Kolloquiumsvortrag), ABB Corporate Research, Ladenburg,\nGermany, April 2009.\n[ bib  ] 
\n@misc{talk-Kounev-ABB09,\nauthor = {Samuel Kounev},\ntitle = {{SOA2 - A Vision of Next Generation Service-Oriented Architectures}},\nhowpublished = {Invited Talk (Kolloquiumsvortrag), ABB Corporate Research, Ladenburg, Germany},\ndays = {3},\nmonth = {April},\nyear = {2009}\n}\n
\n
\n','
\n@misc{talk-Kounev-ABB09,\n  author = {Samuel Kounev},\n  title = {{SOA2 - A Vision of Next Generation Service-Oriented Architectures}},\n  howpublished = {Invited Talk (Kolloquiumsvortrag), ABB Corporate Research, Ladenburg, Germany},\n  days = {3},\n  month = {April},\n  year = {2009}\n}\n
\n\n',NULL,'{SOA2 - A Vision of Next Generation Service-Oriented Architectures}',0,4,2009,4,NULL,NULL,NULL,'2015-05-22 08:56:26','2016-06-01 09:41:05',0),(845,'talk','talk-Kounev-SOA209','misc','@misc{talk-Kounev-SOA209,\n author = {Samuel Kounev},\n title = {{Keynote: SOA2 - Eine Vision f\\\"{u}r die n\\\"{a}chste Generation dienstorienterter Software-Architekturen}},\n howpublished = {Invited Talk, Deutschepost Strategietagung - 6100 Application Service Management MAIL/Retail, St. Goar, Germany},\n days = {9},\n month = {February},\n year = {2009},\n}\n\n','\n\nSamuel Kounev.\nKeynote: SOA2 - Eine Vision für die nächste Generation\ndienstorienterter Software-Architekturen.\nInvited Talk, Deutschepost Strategietagung - 6100 Application Service\nManagement MAIL/Retail, St. Goar, Germany, February 2009.\n[ bib  ] 
\n@misc{talk-Kounev-SOA209,\nauthor = {Samuel Kounev},\ntitle = {{Keynote: SOA2 - Eine Vision f\\\"{u}r die n\\\"{a}chste Generation dienstorienterter Software-Architekturen}},\nhowpublished = {Invited Talk, Deutschepost Strategietagung - 6100 Application Service Management MAIL/Retail, St. Goar, Germany},\ndays = {9},\nmonth = {February},\nyear = {2009}\n}\n
\n
\n','
\n@misc{talk-Kounev-SOA209,\n  author = {Samuel Kounev},\n  title = {{Keynote: SOA2 - Eine Vision f\\\"{u}r die n\\\"{a}chste Generation dienstorienterter Software-Architekturen}},\n  howpublished = {Invited Talk, Deutschepost Strategietagung - 6100 Application Service Management MAIL/Retail, St. Goar, Germany},\n  days = {9},\n  month = {February},\n  year = {2009}\n}\n
\n\n',NULL,'{Keynote: SOA2 - Eine Vision f\\\"{u}r die n\\\"{a}chste Generation dienstorienterter Software-Architekturen}',0,2,2009,2,NULL,NULL,NULL,'2015-05-22 08:59:41','2016-06-01 09:41:05',0),(846,'talk','talk-Kounev-DFG08','misc','@misc{talk-Kounev-DFG08,\n author = {Samuel Kounev},\n title = {{Descartes Projekt - Autonomes Performanz-und Ressourcen-Management in dynamischen, dienstorientierten Umgebungen}},\n howpublished = {Invited Talk, DFG Fachforum Informatik, Deutsche Forschungsgemeinschaft (German Research Foundation), Bonn, Germany},\n days = {30},\n month = {September},\n year = {2008},\n}\n\n','\n\nSamuel Kounev.\nDescartes Projekt - Autonomes Performanz-und Ressourcen-Management\nin dynamischen, dienstorientierten Umgebungen.\nInvited Talk, DFG Fachforum Informatik, Deutsche\nForschungsgemeinschaft (German Research Foundation), Bonn, Germany, September\n2008.\n[ bib  ] 
\n@misc{talk-Kounev-DFG08,\nauthor = {Samuel Kounev},\ntitle = {{Descartes Projekt - Autonomes Performanz-und Ressourcen-Management in dynamischen, dienstorientierten Umgebungen}},\nhowpublished = {Invited Talk, DFG Fachforum Informatik, Deutsche Forschungsgemeinschaft (German Research Foundation), Bonn, Germany},\ndays = {30},\nmonth = {September},\nyear = {2008}\n}\n
\n
\n','
\n@misc{talk-Kounev-DFG08,\n  author = {Samuel Kounev},\n  title = {{Descartes Projekt - Autonomes Performanz-und Ressourcen-Management in dynamischen, dienstorientierten Umgebungen}},\n  howpublished = {Invited Talk, DFG Fachforum Informatik, Deutsche Forschungsgemeinschaft (German Research Foundation), Bonn, Germany},\n  days = {30},\n  month = {September},\n  year = {2008}\n}\n
\n\n',NULL,'{Descartes Projekt - Autonomes Performanz-und Ressourcen-Management in dynamischen, dienstorientierten Umgebungen}',0,9,2008,9,NULL,NULL,NULL,'2015-05-22 09:02:09','2016-06-01 09:41:05',0),(847,'talk','talk-Kounev-Oldenburg08','misc','@misc{talk-Kounev-Oldenburg08,\n author = {Samuel Kounev},\n title = {{QoS-aware resource allocation and load-balancing in enterprise Grids using online simulation}},\n howpublished = {Invited Talk (Kolloquiumsvortrag), University of Oldenburg, Department of Computing Science, Oldenburg, Germany},\n days = {26},\n month = {August},\n year = {2008},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/847},\n}\n\n','\n\nSamuel Kounev.\nQoS-aware resource allocation and load-balancing in enterprise Grids\nusing online simulation.\nInvited Talk (Kolloquiumsvortrag), University of Oldenburg,\nDepartment of Computing Science, Oldenburg, Germany, August 2008.\n[ bib | slides  ] 
\n@misc{talk-Kounev-Oldenburg08,\nauthor = {Samuel Kounev},\ntitle = {{QoS-aware resource allocation and load-balancing in enterprise Grids using online simulation}},\nhowpublished = {Invited Talk (Kolloquiumsvortrag), University of Oldenburg, Department of Computing Science, Oldenburg, Germany},\ndays = {26},\nmonth = {August},\nyear = {2008},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/847}\n}\n
\n
\n','
\n@misc{talk-Kounev-Oldenburg08,\n  author = {Samuel Kounev},\n  title = {{QoS-aware resource allocation and load-balancing in enterprise Grids using online simulation}},\n  howpublished = {Invited Talk (Kolloquiumsvortrag), University of Oldenburg, Department of Computing Science, Oldenburg, Germany},\n  days = {26},\n  month = {August},\n  year = {2008},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/847}\n}\n
\n\n',NULL,'{QoS-aware resource allocation and load-balancing in enterprise Grids using online simulation}',0,8,2008,8,NULL,NULL,NULL,'2015-05-22 09:04:50','2016-06-01 09:41:05',0),(848,'talk','talk-Kounev-Cambridge08','misc','@misc{talk-Kounev-Cambridge08,\n author = {Samuel Kounev},\n title = {{Towards Autonomic QoS Management in Event-based and Service-Oriented Environments}},\n howpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\n days = {11},\n month = {March},\n year = {2008},\n}\n\n','\n\nSamuel Kounev.\nTowards Autonomic QoS Management in Event-based and Service-Oriented\nEnvironments.\nUniversity of Cambridge, Computer Laboratory, Cambridge, UK, March\n2008.\n[ bib  ] 
\n@misc{talk-Kounev-Cambridge08,\nauthor = {Samuel Kounev},\ntitle = {{Towards Autonomic QoS Management in Event-based and Service-Oriented Environments}},\nhowpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\ndays = {11},\nmonth = {March},\nyear = {2008}\n}\n
\n
\n','
\n@misc{talk-Kounev-Cambridge08,\n  author = {Samuel Kounev},\n  title = {{Towards Autonomic QoS Management in Event-based and Service-Oriented Environments}},\n  howpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\n  days = {11},\n  month = {March},\n  year = {2008}\n}\n
\n\n',NULL,'{Towards Autonomic QoS Management in Event-based and Service-Oriented Environments}',0,3,2008,3,NULL,NULL,NULL,'2015-05-22 09:07:03','2016-06-01 09:41:05',0),(849,'talk','talk-Kounev-NewcastleTyne08','misc','@misc{talk-Kounev-NewcastleTyne08,\n author = {Samuel Kounev},\n title = {{Autonomic QoS control in enterprise Grid environments using online simulation}},\n howpublished = {Invited Talk (Kolloquiumsvortrag), School of Computing Science, Newcastle University, Newcastle upon Tyne, UK},\n days = {12},\n month = {February},\n year = {2008},\n}\n\n','\n\nSamuel Kounev.\nAutonomic QoS control in enterprise Grid environments using online\nsimulation.\nInvited Talk (Kolloquiumsvortrag), School of Computing Science,\nNewcastle University, Newcastle upon Tyne, UK, February 2008.\n[ bib  ] 
\n@misc{talk-Kounev-NewcastleTyne08,\nauthor = {Samuel Kounev},\ntitle = {{Autonomic QoS control in enterprise Grid environments using online simulation}},\nhowpublished = {Invited Talk (Kolloquiumsvortrag), School of Computing Science, Newcastle University, Newcastle upon Tyne, UK},\ndays = {12},\nmonth = {February},\nyear = {2008}\n}\n
\n
\n','
\n@misc{talk-Kounev-NewcastleTyne08,\n  author = {Samuel Kounev},\n  title = {{Autonomic QoS control in enterprise Grid environments using online simulation}},\n  howpublished = {Invited Talk (Kolloquiumsvortrag), School of Computing Science, Newcastle University, Newcastle upon Tyne, UK},\n  days = {12},\n  month = {February},\n  year = {2008}\n}\n
\n\n',NULL,'{Autonomic QoS control in enterprise Grid environments using online simulation}',0,2,2008,2,NULL,NULL,NULL,'2015-05-22 09:09:25','2016-06-01 09:41:05',0),(850,'talk','talk-Kounev-Charles08','misc','@misc{talk-Kounev-Charles08,\n author = {Samuel Kounev},\n title = {{Performance Prediction using QPN Models: From Capacity Planning to Online Performance Management}},\n howpublished = {Invited Talk, Department of Software Engineering, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic},\n days = {16},\n month = {January},\n year = {2008},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/850},\n}\n\n','\n\nSamuel Kounev.\nPerformance Prediction using QPN Models: From Capacity Planning to\nOnline Performance Management.\nInvited Talk, Department of Software Engineering, Faculty of\nMathematics and Physics, Charles University, Prague, Czech Republic, January\n2008.\n[ bib | slides  ] 
\n@misc{talk-Kounev-Charles08,\nauthor = {Samuel Kounev},\ntitle = {{Performance Prediction using QPN Models: From Capacity Planning to Online Performance Management}},\nhowpublished = {Invited Talk, Department of Software Engineering, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic},\ndays = {16},\nmonth = {January},\nyear = {2008},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/850}\n}\n
\n
\n','
\n@misc{talk-Kounev-Charles08,\n  author = {Samuel Kounev},\n  title = {{Performance Prediction using QPN Models: From Capacity Planning to Online Performance Management}},\n  howpublished = {Invited Talk, Department of Software Engineering, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic},\n  days = {16},\n  month = {January},\n  year = {2008},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/850}\n}\n
\n\n',NULL,'{Performance Prediction using QPN Models: From Capacity Planning to Online Performance Management}',0,1,2008,1,NULL,NULL,NULL,'2015-05-22 09:11:16','2016-06-01 09:41:05',0),(851,'talk','talk-Kounev-SPECjms07','misc','@misc{talk-Kounev-SPECjms07,\n author = {Samuel Kounev},\n title = {{SPECjms2007 - A Novel Benchmark and Performance Analysis Framework for Message-Oriented Middleware}},\n howpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\n days = {16},\n month = {October},\n year = {2007},\n}\n\n','\n\nSamuel Kounev.\nSPECjms2007 - A Novel Benchmark and Performance Analysis Framework\nfor Message-Oriented Middleware.\nUniversity of Cambridge, Computer Laboratory, Cambridge, UK, October\n2007.\n[ bib  ] 
\n@misc{talk-Kounev-SPECjms07,\nauthor = {Samuel Kounev},\ntitle = {{SPECjms2007 - A Novel Benchmark and Performance Analysis Framework for Message-Oriented Middleware}},\nhowpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\ndays = {16},\nmonth = {October},\nyear = {2007}\n}\n
\n
\n','
\n@misc{talk-Kounev-SPECjms07,\n  author = {Samuel Kounev},\n  title = {{SPECjms2007 - A Novel Benchmark and Performance Analysis Framework for Message-Oriented Middleware}},\n  howpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\n  days = {16},\n  month = {October},\n  year = {2007}\n}\n
\n\n',NULL,'{SPECjms2007 - A Novel Benchmark and Performance Analysis Framework for Message-Oriented Middleware}',0,10,2007,10,NULL,NULL,NULL,'2015-05-22 09:13:41','2016-06-01 09:41:05',0),(852,'talk','talk-Kounev-SPEC08','misc','@misc{talk-Kounev-SPEC08,\n author = {Samuel Kounev},\n title = {{SPEC Enterprise Java Benchmarks: State of the Art and Future Directions}},\n howpublished = {Invited Talk, SPEC Benchmarking Joint US/Europe Colloquium, Dresden, Germany},\n days = {22},\n month = {June},\n year = {2007},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/852},\n}\n\n','\n\nSamuel Kounev.\nSPEC Enterprise Java Benchmarks: State of the Art and Future\nDirections.\nInvited Talk, SPEC Benchmarking Joint US/Europe Colloquium, Dresden,\nGermany, June 2007.\n[ bib | slides  ] 
\n@misc{talk-Kounev-SPEC08,\nauthor = {Samuel Kounev},\ntitle = {{SPEC Enterprise Java Benchmarks: State of the Art and Future Directions}},\nhowpublished = {Invited Talk, SPEC Benchmarking Joint US/Europe Colloquium, Dresden, Germany},\ndays = {22},\nmonth = {June},\nyear = {2007},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/852}\n}\n
\n
\n','
\n@misc{talk-Kounev-SPEC08,\n  author = {Samuel Kounev},\n  title = {{SPEC Enterprise Java Benchmarks: State of the Art and Future Directions}},\n  howpublished = {Invited Talk, SPEC Benchmarking Joint US/Europe Colloquium, Dresden, Germany},\n  days = {22},\n  month = {June},\n  year = {2007},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/852}\n}\n
\n\n',NULL,'{SPEC Enterprise Java Benchmarks: State of the Art and Future Directions}',0,6,2007,6,NULL,NULL,NULL,'2015-05-22 09:15:33','2016-06-01 09:41:05',0),(853,'talk','talk-Kounev-Edinburgh07','misc','@misc{talk-Kounev-Edinburgh07,\n author = {Samuel Kounev},\n title = {{Performance Modeling and Evaluation of Distributed Component Systems using Queueing Petri Nets}},\n howpublished = {Invited Talk (Kolloquiumsvortrag), University of Edinburgh, Laboratory for Foundations of Computer Science, School of Informatics, Edinburgh, UK},\n days = {4},\n month = {May},\n year = {2007},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/853},\n}\n\n','\n\nSamuel Kounev.\nPerformance Modeling and Evaluation of Distributed Component Systems\nusing Queueing Petri Nets.\nInvited Talk (Kolloquiumsvortrag), University of Edinburgh,\nLaboratory for Foundations of Computer Science, School of Informatics,\nEdinburgh, UK, May 2007.\n[ bib | slides  ] 
\n@misc{talk-Kounev-Edinburgh07,\nauthor = {Samuel Kounev},\ntitle = {{Performance Modeling and Evaluation of Distributed Component Systems using Queueing Petri Nets}},\nhowpublished = {Invited Talk (Kolloquiumsvortrag), University of Edinburgh, Laboratory for Foundations of Computer Science, School of Informatics, Edinburgh, UK},\ndays = {4},\nmonth = {May},\nyear = {2007},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/853}\n}\n
\n
\n','
\n@misc{talk-Kounev-Edinburgh07,\n  author = {Samuel Kounev},\n  title = {{Performance Modeling and Evaluation of Distributed Component Systems using Queueing Petri Nets}},\n  howpublished = {Invited Talk (Kolloquiumsvortrag), University of Edinburgh, Laboratory for Foundations of Computer Science, School of Informatics, Edinburgh, UK},\n  days = {4},\n  month = {May},\n  year = {2007},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/853}\n}\n
\n\n',NULL,'{Performance Modeling and Evaluation of Distributed Component Systems using Queueing Petri Nets}',0,5,2007,5,NULL,NULL,NULL,'2015-05-22 09:18:37','2016-06-01 09:41:05',0),(854,'talk','talk-Kounev-Camb07','misc','@misc{talk-Kounev-Camb07,\n author = {Samuel Kounev},\n title = {{An Approach to Performance Modeling and Analysis of Distributed Event-Based Systems}},\n howpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\n days = {13},\n month = {March},\n year = {2007},\n}\n\n','\n\nSamuel Kounev.\nAn Approach to Performance Modeling and Analysis of Distributed\nEvent-Based Systems.\nUniversity of Cambridge, Computer Laboratory, Cambridge, UK, March\n2007.\n[ bib  ] 
\n@misc{talk-Kounev-Camb07,\nauthor = {Samuel Kounev},\ntitle = {{An Approach to Performance Modeling and Analysis of Distributed Event-Based Systems}},\nhowpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\ndays = {13},\nmonth = {March},\nyear = {2007}\n}\n
\n
\n','
\n@misc{talk-Kounev-Camb07,\n  author = {Samuel Kounev},\n  title = {{An Approach to Performance Modeling and Analysis of Distributed Event-Based Systems}},\n  howpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\n  days = {13},\n  month = {March},\n  year = {2007}\n}\n
\n\n',NULL,'{An Approach to Performance Modeling and Analysis of Distributed Event-Based Systems}',0,3,2007,3,NULL,NULL,NULL,'2015-05-23 07:29:41','2016-06-01 09:41:05',0),(855,'talk','talk-Kounev-Camb06','misc','@misc{talk-Kounev-Camb06,\n author = {Samuel Kounev},\n title = {{A Practical Approach for Predicting the Performance and Scalability of Distributed Component Systems}},\n howpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\n days = {13},\n month = {April},\n year = {2006},\n}\n\n','\n\nSamuel Kounev.\nA Practical Approach for Predicting the Performance and Scalability\nof Distributed Component Systems.\nUniversity of Cambridge, Computer Laboratory, Cambridge, UK, April\n2006.\n[ bib  ] 
\n@misc{talk-Kounev-Camb06,\nauthor = {Samuel Kounev},\ntitle = {{A Practical Approach for Predicting the Performance and Scalability of Distributed Component Systems}},\nhowpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\ndays = {13},\nmonth = {April},\nyear = {2006}\n}\n
\n
\n','
\n@misc{talk-Kounev-Camb06,\n  author = {Samuel Kounev},\n  title = {{A Practical Approach for Predicting the Performance and Scalability of Distributed Component Systems}},\n  howpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\n  days = {13},\n  month = {April},\n  year = {2006}\n}\n
\n\n',NULL,'{A Practical Approach for Predicting the Performance and Scalability of Distributed Component Systems}',0,4,2006,4,NULL,NULL,NULL,'2015-05-23 07:32:54','2016-06-01 09:41:05',0),(856,'talk','talk-Kounev-Camb06-2','misc','@misc{talk-Kounev-Camb06-2,\n author = {Samuel Kounev},\n title = {{Performance Modeling and Evaluation of Event-based Systems}},\n howpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\n days = {3},\n month = {March},\n year = {2006},\n}\n\n','\n\nSamuel Kounev.\nPerformance Modeling and Evaluation of Event-based Systems.\nUniversity of Cambridge, Computer Laboratory, Cambridge, UK, March\n2006.\n[ bib  ] 
\n@misc{talk-Kounev-Camb06-2,\nauthor = {Samuel Kounev},\ntitle = {{Performance Modeling and Evaluation of Event-based Systems}},\nhowpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\ndays = {3},\nmonth = {March},\nyear = {2006}\n}\n
\n
\n','
\n@misc{talk-Kounev-Camb06-2,\n  author = {Samuel Kounev},\n  title = {{Performance Modeling and Evaluation of Event-based Systems}},\n  howpublished = {University of Cambridge, Computer Laboratory, Cambridge, UK},\n  days = {3},\n  month = {March},\n  year = {2006}\n}\n
\n\n',NULL,'{Performance Modeling and Evaluation of Event-based Systems}',0,3,2006,3,NULL,NULL,NULL,'2015-05-23 07:35:16','2016-06-01 09:41:05',0),(857,'talk','talk-Kounev-TUBerlin05','misc','@misc{talk-Kounev-TUBerlin05,\n author = {Samuel Kounev},\n title = {{Performance Engineering of Distributed Component Systems - From Benchmarking to Modeling and Performance Prediction}},\n howpublished = {Invited Talk, Technical University of Berlin, Institut f\\\"{u}r Technische Informatik und Mikroelektronik, Berlin},\n days = {29},\n month = {April},\n year = {2005},\n}\n\n','\n\nSamuel Kounev.\nPerformance Engineering of Distributed Component Systems - From\nBenchmarking to Modeling and Performance Prediction.\nInvited Talk, Technical University of Berlin, Institut für\nTechnische Informatik und Mikroelektronik, Berlin, April 2005.\n[ bib  ] 
\n@misc{talk-Kounev-TUBerlin05,\nauthor = {Samuel Kounev},\ntitle = {{Performance Engineering of Distributed Component Systems - From Benchmarking to Modeling and Performance Prediction}},\nhowpublished = {Invited Talk, Technical University of Berlin, Institut f\\\"{u}r Technische Informatik und Mikroelektronik, Berlin},\ndays = {29},\nmonth = {April},\nyear = {2005}\n}\n
\n
\n','
\n@misc{talk-Kounev-TUBerlin05,\n  author = {Samuel Kounev},\n  title = {{Performance Engineering of Distributed Component Systems - From Benchmarking to Modeling and Performance Prediction}},\n  howpublished = {Invited Talk, Technical University of Berlin, Institut f\\\"{u}r Technische Informatik und Mikroelektronik, Berlin},\n  days = {29},\n  month = {April},\n  year = {2005}\n}\n
\n\n',NULL,'{Performance Engineering of Distributed Component Systems - From Benchmarking to Modeling and Performance Prediction}',0,4,2005,4,NULL,NULL,NULL,'2015-05-23 07:37:36','2016-06-01 09:41:05',0),(858,'talk','talk-Kounev-SAP05','misc','@misc{talk-Kounev-SAP05,\n author = {Samuel Kounev},\n title = {{E-Business Performance and Scalability - From Measuring to Predicting}},\n howpublished = {Invited Talk (Kolloquiumsvortrag), SAP Research Forum, Walldorf, Germany},\n days = {27},\n month = {January},\n year = {2005},\n}\n\n','\n\nSamuel Kounev.\nE-Business Performance and Scalability - From Measuring to\nPredicting.\nInvited Talk (Kolloquiumsvortrag), SAP Research Forum, Walldorf,\nGermany, January 2005.\n[ bib  ] 
\n@misc{talk-Kounev-SAP05,\nauthor = {Samuel Kounev},\ntitle = {{E-Business Performance and Scalability - From Measuring to Predicting}},\nhowpublished = {Invited Talk (Kolloquiumsvortrag), SAP Research Forum, Walldorf, Germany},\ndays = {27},\nmonth = {January},\nyear = {2005}\n}\n
\n
\n','
\n@misc{talk-Kounev-SAP05,\n  author = {Samuel Kounev},\n  title = {{E-Business Performance and Scalability - From Measuring to Predicting}},\n  howpublished = {Invited Talk (Kolloquiumsvortrag), SAP Research Forum, Walldorf, Germany},\n  days = {27},\n  month = {January},\n  year = {2005}\n}\n
\n\n',NULL,'{E-Business Performance and Scalability - From Measuring to Predicting}',0,1,2005,1,NULL,NULL,NULL,'2015-05-23 07:40:19','2016-06-01 09:41:05',0),(859,'talk','talk-Kounev-Dagstuhl03','misc','@misc{talk-Kounev-Dagstuhl03,\n author = {Samuel Kounev},\n title = {{Performance Modeling of Distributed E-Business Applications using Queueing Petri Nets}},\n howpublished = {Invited Talk, Dagstuhl - Workshop of five Informatik-Graduiertenkolles, Schloss Dagstuhl},\n days = {16-18},\n month = {June},\n year = {2003},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/859},\n}\n\n','\n\nSamuel Kounev.\nPerformance Modeling of Distributed E-Business Applications using\nQueueing Petri Nets.\nInvited Talk, Dagstuhl - Workshop of five\nInformatik-Graduiertenkolles, Schloss Dagstuhl, June 2003.\n[ bib | slides  ] 
\n@misc{talk-Kounev-Dagstuhl03,\nauthor = {Samuel Kounev},\ntitle = {{Performance Modeling of Distributed E-Business Applications using Queueing Petri Nets}},\nhowpublished = {Invited Talk, Dagstuhl - Workshop of five Informatik-Graduiertenkolles, Schloss Dagstuhl},\ndays = {16-18},\nmonth = {June},\nyear = {2003},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/859}\n}\n
\n
\n','
\n@misc{talk-Kounev-Dagstuhl03,\n  author = {Samuel Kounev},\n  title = {{Performance Modeling of Distributed E-Business Applications using Queueing Petri Nets}},\n  howpublished = {Invited Talk, Dagstuhl - Workshop of five Informatik-Graduiertenkolles, Schloss Dagstuhl},\n  days = {16-18},\n  month = {June},\n  year = {2003},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/859}\n}\n
\n\n',NULL,'{Performance Modeling of Distributed E-Business Applications using Queueing Petri Nets}',0,6,2003,6,NULL,NULL,NULL,'2015-05-23 07:41:19','2016-06-01 09:41:05',0),(860,'talk','talk-Kounev-DVSPhD02','misc','@misc{talk-Kounev-DVSPhD02,\n author = {Samuel Kounev},\n title = {{J2EE PERFORMANCE: From Benchmarking to Sizing and Capacity Planning}},\n howpublished = {DVS-PhD Internal Workshop, Darmstadt, Germany},\n days = {21},\n month = {May},\n year = {2002},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/860},\n}\n\n','\n\nSamuel Kounev.\nJ2EE PERFORMANCE: From Benchmarking to Sizing and Capacity\nPlanning.\nDVS-PhD Internal Workshop, Darmstadt, Germany, May 2002.\n[ bib | slides  ] 
\n@misc{talk-Kounev-DVSPhD02,\nauthor = {Samuel Kounev},\ntitle = {{J2EE PERFORMANCE: From Benchmarking to Sizing and Capacity Planning}},\nhowpublished = {DVS-PhD Internal Workshop, Darmstadt, Germany},\ndays = {21},\nmonth = {May},\nyear = {2002},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/860}\n}\n
\n
\n','
\n@misc{talk-Kounev-DVSPhD02,\n  author = {Samuel Kounev},\n  title = {{J2EE PERFORMANCE: From Benchmarking to Sizing and Capacity Planning}},\n  howpublished = {DVS-PhD Internal Workshop, Darmstadt, Germany},\n  days = {21},\n  month = {May},\n  year = {2002},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/860}\n}\n
\n\n',NULL,'{J2EE PERFORMANCE: From Benchmarking to Sizing and Capacity Planning}',0,5,2002,5,NULL,NULL,NULL,'2015-05-23 07:42:59','2016-06-01 09:41:05',0),(861,'talk','talk-Kounev-BEA01','misc','@misc{talk-Kounev-BEA01,\n author = {Samuel Kounev},\n title = {{Implementing and Optimizing Sun\'s ECperf Benchmark with BEA WebLogic Server}},\n howpublished = {Invited Talk, BEA Hochschul-Industrie-Kooperations-Tagung, Frankfurt, Germany},\n days = {13},\n month = {November},\n year = {2001},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/861},\n}\n\n','\n\nSamuel Kounev.\nImplementing and Optimizing Sun\'s ECperf Benchmark with BEA WebLogic\nServer.\nInvited Talk, BEA Hochschul-Industrie-Kooperations-Tagung, Frankfurt,\nGermany, November 2001.\n[ bib | slides  ] 
\n@misc{talk-Kounev-BEA01,\nauthor = {Samuel Kounev},\ntitle = {{Implementing and Optimizing Sun\'s ECperf Benchmark with BEA WebLogic Server}},\nhowpublished = {Invited Talk, BEA Hochschul-Industrie-Kooperations-Tagung, Frankfurt, Germany},\ndays = {13},\nmonth = {November},\nyear = {2001},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/861}\n}\n
\n
\n','
\n@misc{talk-Kounev-BEA01,\n  author = {Samuel Kounev},\n  title = {{Implementing and Optimizing Sun\'s ECperf Benchmark with BEA WebLogic Server}},\n  howpublished = {Invited Talk, BEA Hochschul-Industrie-Kooperations-Tagung, Frankfurt, Germany},\n  days = {13},\n  month = {November},\n  year = {2001},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/861}\n}\n
\n\n',NULL,'{Implementing and Optimizing Sun\'s ECperf Benchmark with BEA WebLogic Server}',0,11,2001,11,NULL,NULL,NULL,'2015-05-23 07:44:28','2016-06-01 09:41:05',0),(862,'talk','talk-Kounev-BGOUG99','misc','@misc{talk-Kounev-BGOUG99,\n author = {Samuel Kounev},\n title = {{Electronic Store: MALL2000 - Mall for Online Business beyond the Year 2000}},\n howpublished = {Invited Talk, Bulgarian Oracle User Group (BGOUG) Annual Conference 1999, Sofia, Bulgaria},\n days = {4-5},\n month = {November},\n year = {1999},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/862},\n}\n\n','\n\nSamuel Kounev.\nElectronic Store: MALL2000 - Mall for Online Business beyond the\nYear 2000.\nInvited Talk, Bulgarian Oracle User Group (BGOUG) Annual Conference\n1999, Sofia, Bulgaria, November 1999.\n[ bib | slides  ] 
\n@misc{talk-Kounev-BGOUG99,\nauthor = {Samuel Kounev},\ntitle = {{Electronic Store: MALL2000 - Mall for Online Business beyond the Year 2000}},\nhowpublished = {Invited Talk, Bulgarian Oracle User Group (BGOUG) Annual Conference 1999, Sofia, Bulgaria},\ndays = {4-5},\nmonth = {November},\nyear = {1999},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/862}\n}\n
\n
\n','
\n@misc{talk-Kounev-BGOUG99,\n  author = {Samuel Kounev},\n  title = {{Electronic Store: MALL2000 - Mall for Online Business beyond the Year 2000}},\n  howpublished = {Invited Talk, Bulgarian Oracle User Group (BGOUG) Annual Conference 1999, Sofia, Bulgaria},\n  days = {4-5},\n  month = {November},\n  year = {1999},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/862}\n}\n
\n\n',NULL,'{Electronic Store: MALL2000 - Mall for Online Business beyond the Year 2000}',0,11,1999,11,NULL,NULL,NULL,'2015-05-23 07:46:32','2016-06-01 09:41:05',0),(864,'paper','thesis-Yavuz2013','mastersthesis','@mastersthesis{thesis-Yavuz2013,\n author = {Can Alexander Yavuz},\n month = {April},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{\\\"{U}berwachung des effektiven Kontrollflusses einer mehrschichtigen Anwendung}},\n type = {Bachelor\'s thesis (in German)},\n year = {2013},\n}\n\n','\n\nCan Alexander Yavuz.\nÜberwachung des effektiven Kontrollflusses einer mehrschichtigen\nAnwendung.\nBachelor\'s thesis (in german), Karlsruhe Institute of Technology\n(KIT), April 2013.\n[ bib  ] 
\n@mastersthesis{thesis-Yavuz2013,\nauthor = {Can Alexander Yavuz},\nmonth = {April},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{\\\"{U}berwachung des effektiven Kontrollflusses einer mehrschichtigen Anwendung}},\ntype = {Bachelor\'s thesis (in German)},\nyear = {2013}\n}\n
\n
\n','
\n@mastersthesis{thesis-Yavuz2013,\n  author = {Can Alexander Yavuz},\n  month = {April},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{\\\"{U}berwachung des effektiven Kontrollflusses einer mehrschichtigen Anwendung}},\n  type = {Bachelor\'s thesis (in German)},\n  year = {2013}\n}\n
\n\n',NULL,'{\\\"{U}berwachung des effektiven Kontrollflusses einer mehrschichtigen Anwendung}',0,4,2013,4,NULL,NULL,NULL,'2015-05-23 08:09:55','2016-06-01 09:41:05',0),(865,'paper','thesis-Busch2013','mastersthesis','@mastersthesis{thesis-Busch2013,\n author = {Axel Busch},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Workload Characterization for I/O Performance Analysis on IBM System z}},\n type = {Master\'s thesis},\n year = {2013},\n}\n\n','\n\nAxel Busch.\nWorkload Characterization for I/O Performance Analysis on IBM System\nz.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), 2013.\n[ bib  ] 
\n@mastersthesis{thesis-Busch2013,\nauthor = {Axel Busch},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Workload Characterization for I/O Performance Analysis on IBM System z}},\ntype = {Master\'s thesis},\nyear = {2013}\n}\n
\n
\n','
\n@mastersthesis{thesis-Busch2013,\n  author = {Axel Busch},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Workload Characterization for I/O Performance Analysis on IBM System z}},\n  type = {Master\'s thesis},\n  year = {2013}\n}\n
\n\n',NULL,'{Workload Characterization for I/O Performance Analysis on IBM System z}',0,0,2013,0,NULL,NULL,NULL,'2015-05-23 08:10:50','2016-06-01 09:41:05',0),(867,'paper','thesis-Rostami2012','mastersthesis','@mastersthesis{thesis-Rostami2012,\n author = {Kiana Rostami},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Performance-Vorhersage von virtualisiertem Storage mit Warteschlangennetzen}},\n type = {Bachelor\'s thesis (in German)},\n year = {2012},\n}\n\n','\n\nKiana Rostami.\nPerformance-Vorhersage von virtualisiertem Storage mit\nWarteschlangennetzen.\nBachelor\'s thesis (in german), Karlsruhe Institute of Technology\n(KIT), 2012.\n[ bib  ] 
\n@mastersthesis{thesis-Rostami2012,\nauthor = {Kiana Rostami},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Performance-Vorhersage von virtualisiertem Storage mit Warteschlangennetzen}},\ntype = {Bachelor\'s thesis (in German)},\nyear = {2012}\n}\n
\n
\n','
\n@mastersthesis{thesis-Rostami2012,\n  author = {Kiana Rostami},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Performance-Vorhersage von virtualisiertem Storage mit Warteschlangennetzen}},\n  type = {Bachelor\'s thesis (in German)},\n  year = {2012}\n}\n
\n\n',NULL,'{Performance-Vorhersage von virtualisiertem Storage mit Warteschlangennetzen}',0,0,2012,0,NULL,NULL,NULL,'2015-05-23 08:12:49','2016-06-01 09:41:05',0),(868,'paper','thesis-Bruhn2012','mastersthesis','@mastersthesis{thesis-Bruhn2012,\n author = {Dominik Bruhn},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Modeling and Experimental Analysis of Virtualized Storage Performance using IBM System Z as Example}},\n type = {Master\'s thesis},\n year = {2012},\n}\n\n','\n\nDominik Bruhn.\nModeling and Experimental Analysis of Virtualized Storage\nPerformance using IBM System Z as Example.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), 2012.\n[ bib  ] 
\n@mastersthesis{thesis-Bruhn2012,\nauthor = {Dominik Bruhn},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Modeling and Experimental Analysis of Virtualized Storage Performance using IBM System Z as Example}},\ntype = {Master\'s thesis},\nyear = {2012}\n}\n
\n
\n','
\n@mastersthesis{thesis-Bruhn2012,\n  author = {Dominik Bruhn},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Modeling and Experimental Analysis of Virtualized Storage Performance using IBM System Z as Example}},\n  type = {Master\'s thesis},\n  year = {2012}\n}\n
\n\n',NULL,'{Modeling and Experimental Analysis of Virtualized Storage Performance using IBM System Z as Example}',0,0,2012,0,NULL,NULL,NULL,'2015-05-23 08:14:05','2016-06-01 09:41:05',0),(870,'paper','thesis-Schott2012','mastersthesis','@mastersthesis{thesis-Schott2012,\n author = {Waldemar Schott},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Verbesserte Performance-Vorhersage f\\\"{u}r virtualisierte Umgebungen durchIntegration von Messergebnissen}},\n type = {{Bachelor\'s thesis (in German)}},\n year = {2012},\n}\n\n','\n\nWaldemar Schott.\nVerbesserte Performance-Vorhersage für virtualisierte Umgebungen\ndurchIntegration von Messergebnissen.\nBachelor\'s thesis (in German), Karlsruhe Institute of Technology\n(KIT), 2012.\n[ bib  ] 
\n@mastersthesis{thesis-Schott2012,\nauthor = {Waldemar Schott},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Verbesserte Performance-Vorhersage f\\\"{u}r virtualisierte Umgebungen durchIntegration von Messergebnissen}},\ntype = {{Bachelor\'s thesis (in German)}},\nyear = {2012}\n}\n
\n
\n','
\n@mastersthesis{thesis-Schott2012,\n  author = {Waldemar Schott},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Verbesserte Performance-Vorhersage f\\\"{u}r virtualisierte Umgebungen durchIntegration von Messergebnissen}},\n  type = {{Bachelor\'s thesis (in German)}},\n  year = {2012}\n}\n
\n\n',NULL,'{Verbesserte Performance-Vorhersage f\\\"{u}r virtualisierte Umgebungen durchIntegration von Messergebnissen}',0,0,2012,0,NULL,NULL,NULL,'2015-05-23 08:22:49','2016-06-01 09:41:05',0),(871,'paper','thesis-Becker2011','mastersthesis','@mastersthesis{thesis-Becker2011,\n author = {Stefan Becker},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Performance-Modellierung des 1\\&1 Mail-Systems}},\n type = {{Master\'s thesis (in German)}},\n year = {2011},\n}\n\n','\n\nStefan Becker.\nPerformance-Modellierung des 1&1 Mail-Systems.\nMaster\'s thesis (in German), Karlsruhe Institute of Technology\n(KIT), 2011.\n[ bib  ] 
\n@mastersthesis{thesis-Becker2011,\nauthor = {Stefan Becker},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Performance-Modellierung des 1\\&1 Mail-Systems}},\ntype = {{Master\'s thesis (in German)}},\nyear = {2011}\n}\n
\n
\n','
\n@mastersthesis{thesis-Becker2011,\n  author = {Stefan Becker},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Performance-Modellierung des 1\\&1 Mail-Systems}},\n  type = {{Master\'s thesis (in German)}},\n  year = {2011}\n}\n
\n\n',NULL,'{Performance-Modellierung des 1\\&1 Mail-Systems}',0,0,2011,0,NULL,NULL,NULL,'2015-05-23 08:24:16','2016-06-01 09:41:05',0),(872,'paper','thesis-Kusnady2011','mastersthesis','@mastersthesis{thesis-Kusnady2011,\n author = {Enrico Kusnady},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{QoS-aware Resource Allocation in Virtualized Environments}},\n type = {Master\'s thesis},\n year = {2011},\n}\n\n','\n\nEnrico Kusnady.\nQoS-aware Resource Allocation in Virtualized Environments.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), 2011.\n[ bib  ] 
\n@mastersthesis{thesis-Kusnady2011,\nauthor = {Enrico Kusnady},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{QoS-aware Resource Allocation in Virtualized Environments}},\ntype = {Master\'s thesis},\nyear = {2011}\n}\n
\n
\n','
\n@mastersthesis{thesis-Kusnady2011,\n  author = {Enrico Kusnady},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{QoS-aware Resource Allocation in Virtualized Environments}},\n  type = {Master\'s thesis},\n  year = {2011}\n}\n
\n\n',NULL,'{QoS-aware Resource Allocation in Virtualized Environments}',0,0,2011,0,NULL,NULL,NULL,'2015-05-23 08:26:14','2016-06-01 09:41:05',0),(873,'paper','thesis-vQuast2010','mastersthesis','@mastersthesis{thesis-vQuast2010,\n author = {Marcel von Quast},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Automatisierte Performance-Analyse von Virtualisierungsplattformen}},\n type = {Master\'s thesis (in German)},\n year = {2010},\n}\n\n','\n\nMarcel von Quast.\nAutomatisierte Performance-Analyse von Virtualisierungsplattformen.\nMaster\'s thesis (in german), Karlsruhe Institute of Technology (KIT),\n2010.\n[ bib  ] 
\n@mastersthesis{thesis-vQuast2010,\nauthor = {Marcel von Quast},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Automatisierte Performance-Analyse von Virtualisierungsplattformen}},\ntype = {Master\'s thesis (in German)},\nyear = {2010}\n}\n
\n
\n','
\n@mastersthesis{thesis-vQuast2010,\n  author = {Marcel von Quast},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Automatisierte Performance-Analyse von Virtualisierungsplattformen}},\n  type = {Master\'s thesis (in German)},\n  year = {2010}\n}\n
\n\n',NULL,'{Automatisierte Performance-Analyse von Virtualisierungsplattformen}',0,0,2010,0,NULL,NULL,NULL,'2015-05-23 08:27:20','2016-06-01 09:41:05',0),(875,'paper','thesis-Bender2010','mastersthesis','@mastersthesis{thesis-Bender2010,\n author = {Konstantin Bender},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Automated Performance Model Extraction of Enterprise Data Fabrics}},\n year = {2010},\n month = {May},\n}\n\n','\n\nKonstantin Bender.\nAutomated Performance Model Extraction of Enterprise Data Fabrics.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), May 2010.\n[ bib  ] 
\n@mastersthesis{thesis-Bender2010,\nauthor = {Konstantin Bender},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Automated Performance Model Extraction of Enterprise Data Fabrics}},\nyear = {2010},\nmonth = {May}\n}\n
\n
\n','
\n@mastersthesis{thesis-Bender2010,\n  author = {Konstantin Bender},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Automated Performance Model Extraction of Enterprise Data Fabrics}},\n  year = {2010},\n  month = {May}\n}\n
\n\n',NULL,'{Automated Performance Model Extraction of Enterprise Data Fabrics}',0,5,2010,5,NULL,NULL,NULL,'2015-05-23 08:33:23','2016-06-01 09:41:05',0),(876,'paper','thesis-Klatt2010','mastersthesis','@mastersthesis{thesis-Klatt2010,\n author = {Benjamin Klatt},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Modelling and prediction of event-based communication in component-based architectures}},\n type = {Master\'s thesis},\n year = {2010},\n note = {ObjektForum Thesis Award},\n}\n\n','\n\nBenjamin Klatt.\nModelling and prediction of event-based communication in\ncomponent-based architectures.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), 2010.\nObjektForum Thesis Award.\n[ bib  ] 
\n@mastersthesis{thesis-Klatt2010,\nauthor = {Benjamin Klatt},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Modelling and prediction of event-based communication in component-based architectures}},\ntype = {Master\'s thesis},\nyear = {2010},\nnote = {ObjektForum Thesis Award}\n}\n
\n
\n','
\n@mastersthesis{thesis-Klatt2010,\n  author = {Benjamin Klatt},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Modelling and prediction of event-based communication in component-based architectures}},\n  type = {Master\'s thesis},\n  year = {2010},\n  note = {ObjektForum Thesis Award}\n}\n
\n\n',NULL,'{Modelling and prediction of event-based communication in component-based architectures}',0,0,2010,0,NULL,NULL,NULL,'2015-05-23 08:34:46','2016-06-01 09:41:05',0),(877,'paper','thesis-Zipp2009','mastersthesis','@mastersthesis{thesis-Zipp2009,\n author = {Frederik Zipp},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Querying, Aggregating and Visualizing QPN Model Analysis Data}},\n type = {Study thesis},\n year = {2009},\n}\n\n','\n\nFrederik Zipp.\nQuerying, Aggregating and Visualizing QPN Model Analysis Data.\nStudy thesis, Karlsruhe Institute of Technology (KIT), 2009.\n[ bib  ] 
\n@mastersthesis{thesis-Zipp2009,\nauthor = {Frederik Zipp},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Querying, Aggregating and Visualizing QPN Model Analysis Data}},\ntype = {Study thesis},\nyear = {2009}\n}\n
\n
\n','
\n@mastersthesis{thesis-Zipp2009,\n  author = {Frederik Zipp},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Querying, Aggregating and Visualizing QPN Model Analysis Data}},\n  type = {Study thesis},\n  year = {2009}\n}\n
\n\n',NULL,'{Querying, Aggregating and Visualizing QPN Model Analysis Data}',0,0,2009,0,NULL,NULL,NULL,'2015-05-23 08:35:28','2016-06-01 09:41:05',0),(878,'paper','KiBeLaBlArKo2015-MASCOTS','inproceedings','@inproceedings{KiBeLaBlArKo2015-MASCOTS,\n author = {J\\\'{o}akim von Kistowski and John Beckett and Klaus-Dieter Lange and Hansfried Block and Jeremy A. Arnold and Samuel Kounev},\n abstract = {{Energy efficiency of servers has become a significant issue over the last years. Load distribution plays a crucial role in the improvement of energy efficiency as (un-)balancing strategies can be leveraged to distribute load over one or multiple systems in a way in which resources are utilized at high performance, yet low overall power consumption. This can be achieved on multiple levels, from load distribution on single CPU cores to machine level load balancing on distributed systems. With modern day server architectures providing load balancing opportunities at several layers, answering the question of optimal load distribution has become non-trivial. Work has to be distributed hierarchically in a fashion that enables maximum energy efficiency at each level. Current approaches balance load based on generalized assumptions about the energy efficiency of servers. These assumptions are based either on very machine-specific or highly generalized observations that may or may not hold true over a variety of systems and configurations. In this paper, we use a modified version of the SPEC SERT suite to measure the energy efficiency of a variety of hierarchical load distribution strategies on single and multi-node systems. We introduce a new strategy and evaluate energy efficiency for homogeneous and heterogeneous workloads over different hardware configurations. Our results show that the selection of a load distribution strategy depends heavily on workload, system utilization, as well as hardware. Used in conjunction with existing strategies, our new load distribution strategy can reduce a single system\'s power consumption by up to 10.7%.}},\n title = {{Energy Efficiency of Hierarchical Server Load Distribution Strategies}},\n year = {2015},\n booktitle = {Proceedings of the IEEE 23nd International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2015)},\n location = {Atlanta, GA, USA},\n month = {October},\n day = {5--7},\n publisher = {IEEE},\n keywords = {SPEC, SERT, Power, Benchmarking, Workload, Energy Efficiency, Metrics, Utilization, Load level},\n note = {Full paper acceptance rate: 19\\%},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/878.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/878},\n doi = {http://dx.doi.org/10.1109/MASCOTS.2015.11},\n}\n\n','\n\nJóakim von Kistowski, John Beckett, Klaus-Dieter Lange, Hansfried Block,\nJeremy A. Arnold, and Samuel Kounev.\nEnergy Efficiency of Hierarchical Server Load Distribution\nStrategies.\nIn Proceedings of the IEEE 23nd International Symposium on\nModeling, Analysis and Simulation of Computer and Telecommunication Systems\n(MASCOTS 2015), Atlanta, GA, USA, October 5-7, 2015. IEEE.\nOctober 2015, Full paper acceptance rate: 19%.\n[ bib | DOI | slides | .pdf | Abstract  ] 
\n@inproceedings{KiBeLaBlArKo2015-MASCOTS,\nauthor = {J\\\'{o}akim von Kistowski and John Beckett and Klaus-Dieter Lange and Hansfried Block and Jeremy A. Arnold and Samuel Kounev},\nabstract = {{Energy efficiency of servers has become a significant issue over the last years. Load distribution plays a crucial role in the improvement of energy efficiency as (un-)balancing strategies can be leveraged to distribute load over one or multiple systems in a way in which resources are utilized at high performance, yet low overall power consumption. This can be achieved on multiple levels, from load distribution on single CPU cores to machine level load balancing on distributed systems. With modern day server architectures providing load balancing opportunities at several layers, answering the question of optimal load distribution has become non-trivial. Work has to be distributed hierarchically in a fashion that enables maximum energy efficiency at each level. Current approaches balance load based on generalized assumptions about the energy efficiency of servers. These assumptions are based either on very machine-specific or highly generalized observations that may or may not hold true over a variety of systems and configurations. In this paper, we use a modified version of the SPEC SERT suite to measure the energy efficiency of a variety of hierarchical load distribution strategies on single and multi-node systems. We introduce a new strategy and evaluate energy efficiency for homogeneous and heterogeneous workloads over different hardware configurations. Our results show that the selection of a load distribution strategy depends heavily on workload, system utilization, as well as hardware. Used in conjunction with existing strategies, our new load distribution strategy can reduce a single system\'s power consumption by up to 10.7%.}},\ntitle = {{Energy Efficiency of Hierarchical Server Load Distribution Strategies}},\nyear = {2015},\nbooktitle = {Proceedings of the IEEE 23nd International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2015)},\nlocation = {Atlanta, GA, USA},\nmonth = {October},\nday = {5--7},\npublisher = {IEEE},\nkeywords = {SPEC, SERT, Power, Benchmarking, Workload, Energy Efficiency, Metrics, Utilization, Load level},\nnote = {Full paper acceptance rate: 19\\%},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/878.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/878},\ndoi = {http://dx.doi.org/10.1109/MASCOTS.2015.11}\n}\n
\n
\nEnergy efficiency of servers has become a significant issue over the last years. Load distribution plays a crucial role in the improvement of energy efficiency as (un-)balancing strategies can be leveraged to distribute load over one or multiple systems in a way in which resources are utilized at high performance, yet low overall power consumption. This can be achieved on multiple levels, from load distribution on single CPU cores to machine level load balancing on distributed systems. With modern day server architectures providing load balancing opportunities at several layers, answering the question of optimal load distribution has become non-trivial. Work has to be distributed hierarchically in a fashion that enables maximum energy efficiency at each level. Current approaches balance load based on generalized assumptions about the energy efficiency of servers. These assumptions are based either on very machine-specific or highly generalized observations that may or may not hold true over a variety of systems and configurations. In this paper, we use a modified version of the SPEC SERT suite to measure the energy efficiency of a variety of hierarchical load distribution strategies on single and multi-node systems. We introduce a new strategy and evaluate energy efficiency for homogeneous and heterogeneous workloads over different hardware configurations. Our results show that the selection of a load distribution strategy depends heavily on workload, system utilization, as well as hardware. Used in conjunction with existing strategies, our new load distribution strategy can reduce a single system\'s power consumption by up to 10.7%.\n
\n','
\n@inproceedings{KiBeLaBlArKo2015-MASCOTS,\n  author = {J\\\'{o}akim von Kistowski and John Beckett and Klaus-Dieter Lange and Hansfried Block and Jeremy A. Arnold and Samuel Kounev},\n  abstract = {{Energy efficiency of servers has become a significant issue over the last years. Load distribution plays a crucial role in the improvement of energy efficiency as (un-)balancing strategies can be leveraged to distribute load over one or multiple systems in a way in which resources are utilized at high performance, yet low overall power consumption. This can be achieved on multiple levels, from load distribution on single CPU cores to machine level load balancing on distributed systems. With modern day server architectures providing load balancing opportunities at several layers, answering the question of optimal load distribution has become non-trivial. Work has to be distributed hierarchically in a fashion that enables maximum energy efficiency at each level. Current approaches balance load based on generalized assumptions about the energy efficiency of servers. These assumptions are based either on very machine-specific or highly generalized observations that may or may not hold true over a variety of systems and configurations. In this paper, we use a modified version of the SPEC SERT suite to measure the energy efficiency of a variety of hierarchical load distribution strategies on single and multi-node systems. We introduce a new strategy and evaluate energy efficiency for homogeneous and heterogeneous workloads over different hardware configurations. Our results show that the selection of a load distribution strategy depends heavily on workload, system utilization, as well as hardware. Used in conjunction with existing strategies, our new load distribution strategy can reduce a single system\'s power consumption by up to 10.7%.}},\n  title = {{Energy Efficiency of Hierarchical Server Load Distribution Strategies}},\n  year = {2015},\n  booktitle = {Proceedings of the IEEE 23nd International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2015)},\n  location = {Atlanta, GA, USA},\n  month = {October},\n  day = {5--7},\n  publisher = {IEEE},\n  keywords = {SPEC, SERT, Power, Benchmarking, Workload, Energy Efficiency, Metrics, Utilization, Load level},\n  note = {Full paper acceptance rate: 19\\%},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/878.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/878},\n  doi = {http://dx.doi.org/10.1109/MASCOTS.2015.11}\n}\n
\n\n','{Energy efficiency of servers has become a significant issue over the last years. Load distribution plays a crucial role in the improvement of energy efficiency as (un-)balancing strategies can be leveraged to distribute load over one or multiple systems in a way in which resources are utilized at high performance, yet low overall power consumption. This can be achieved on multiple levels, from load distribution on single CPU cores to machine level load balancing on distributed systems. With modern day server architectures providing load balancing opportunities at several layers, answering the question of optimal load distribution has become non-trivial. Work has to be distributed hierarchically in a fashion that enables maximum energy efficiency at each level. Current approaches balance load based on generalized assumptions about the energy efficiency of servers. These assumptions are based either on very machine-specific or highly generalized observations that may or may not hold true over a variety of systems and configurations. In this paper, we use a modified version of the SPEC SERT suite to measure the energy efficiency of a variety of hierarchical load distribution strategies on single and multi-node systems. We introduce a new strategy and evaluate energy efficiency for homogeneous and heterogeneous workloads over different hardware configurations. Our results show that the selection of a load distribution strategy depends heavily on workload, system utilization, as well as hardware. Used in conjunction with existing strategies, our new load distribution strategy can reduce a single system\'s power consumption by up to 10.7%.}','{Energy Efficiency of Hierarchical Server Load Distribution Strategies}',0,10,2015,10,NULL,NULL,NULL,'2015-05-27 13:55:28','2016-06-01 09:41:05',0),(879,'talk','Talk-KoBrHu2015-SE-SelfAwareDescartes','misc','@misc{Talk-KoBrHu2015-SE-SelfAwareDescartes,\n address = {Bonn, Germany},\n author = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\n howpublished = {Software Engineering 2015, Fachtagung des GI-Fachbereichs Softwaretechnik, 17. - 20. M\\\"{a}rz 2015, Dresden, Deutschland},\n title = {{The Descartes Modeling Language for Self-Aware Performance and Resource Management}},\n year = {2015},\n month = {March},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/879},\n}\n\n','\n\nSamuel Kounev, Fabian Brosig, and Nikolaus Huber.\nThe Descartes Modeling Language for Self-Aware Performance and\nResource Management.\nSoftware Engineering 2015, Fachtagung des GI-Fachbereichs\nSoftwaretechnik, 17. - 20. März 2015, Dresden, Deutschland, March 2015.\n[ bib | slides  ] 
\n@misc{Talk-KoBrHu2015-SE-SelfAwareDescartes,\naddress = {Bonn, Germany},\nauthor = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\nhowpublished = {Software Engineering 2015, Fachtagung des GI-Fachbereichs Softwaretechnik, 17. - 20. M\\\"{a}rz 2015, Dresden, Deutschland},\ntitle = {{The Descartes Modeling Language for Self-Aware Performance and Resource Management}},\nyear = {2015},\nmonth = {March},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/879}\n}\n
\n
\n','
\n@misc{Talk-KoBrHu2015-SE-SelfAwareDescartes,\n  address = {Bonn, Germany},\n  author = {Samuel Kounev and Fabian Brosig and Nikolaus Huber},\n  howpublished = {Software Engineering 2015, Fachtagung des GI-Fachbereichs Softwaretechnik, 17. - 20. M\\\"{a}rz 2015, Dresden, Deutschland},\n  title = {{The Descartes Modeling Language for Self-Aware Performance and Resource Management}},\n  year = {2015},\n  month = {March},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/879}\n}\n
\n\n',NULL,'{The Descartes Modeling Language for Self-Aware Performance and Resource Management}',0,3,2015,3,NULL,NULL,NULL,'2015-05-27 14:39:49','2016-06-01 09:41:05',0),(881,'talk','talk-Walter-SOSP14','misc','@misc{talk-Walter-SOSP14,\n author = {J\\\"{u}rgen Walter and Simon Spinner and Samuel Kounev},\n title = {{Parallel Simulation of Queueing Petri Nets}},\n howpublished = {Technical Talk at Symposion on Software Performance (SOSP) 2014},\n days = {28},\n month = {November},\n year = {2014},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/881},\n}\n\n','\n\nJürgen Walter, Simon Spinner, and Samuel Kounev.\nParallel Simulation of Queueing Petri Nets.\nTechnical Talk at Symposion on Software Performance (SOSP) 2014,\nNovember 2014.\n[ bib | slides  ] 
\n@misc{talk-Walter-SOSP14,\nauthor = {J\\\"{u}rgen Walter and Simon Spinner and Samuel Kounev},\ntitle = {{Parallel Simulation of Queueing Petri Nets}},\nhowpublished = {Technical Talk at Symposion on Software Performance (SOSP) 2014},\ndays = {28},\nmonth = {November},\nyear = {2014},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/881}\n}\n
\n
\n','
\n@misc{talk-Walter-SOSP14,\n  author = {J\\\"{u}rgen Walter and Simon Spinner and Samuel Kounev},\n  title = {{Parallel Simulation of Queueing Petri Nets}},\n  howpublished = {Technical Talk at Symposion on Software Performance (SOSP) 2014},\n  days = {28},\n  month = {November},\n  year = {2014},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/881}\n}\n
\n\n',NULL,'{Parallel Simulation of Queueing Petri Nets}',0,11,2014,11,NULL,NULL,NULL,'2015-06-03 14:38:41','2016-06-01 09:41:05',0),(882,'talk','talk-Spinner-SOSP14','misc','@misc{talk-Spinner-SOSP14,\n author = {Simon Spinner and J\\\"{u}rgen Walter},\n title = {{LibReDE: A Library for Resource Demand Estimation}},\n howpublished = {Technical Talk at Symposion on Software Performance (SOSP) 2014},\n days = {28},\n month = {November},\n year = {2014},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/882},\n}\n\n','\n\nSimon Spinner and Jürgen Walter.\nLibReDE: A Library for Resource Demand Estimation.\nTechnical Talk at Symposion on Software Performance (SOSP) 2014,\nNovember 2014.\n[ bib | slides  ] 
\n@misc{talk-Spinner-SOSP14,\nauthor = {Simon Spinner and J\\\"{u}rgen Walter},\ntitle = {{LibReDE: A Library for Resource Demand Estimation}},\nhowpublished = {Technical Talk at Symposion on Software Performance (SOSP) 2014},\ndays = {28},\nmonth = {November},\nyear = {2014},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/882}\n}\n
\n
\n','
\n@misc{talk-Spinner-SOSP14,\n  author = {Simon Spinner and J\\\"{u}rgen Walter},\n  title = {{LibReDE: A Library for Resource Demand Estimation}},\n  howpublished = {Technical Talk at Symposion on Software Performance (SOSP) 2014},\n  days = {28},\n  month = {November},\n  year = {2014},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/882}\n}\n
\n\n',NULL,'{LibReDE: A Library for Resource Demand Estimation}',0,11,2014,11,NULL,NULL,NULL,'2015-06-03 14:43:40','2016-06-01 09:41:05',0),(883,'paper','nehmeierTR495','techreport','@techreport{nehmeierTR495,\n abstract = {Libraries implementing the interval arithmetic standard IEEE 1788 have to be tested for errors. Although the standard is language agnostic, the different implementations are not. Therefore the same tests must be implemented in many different languages. Hence it is useful to only have to formulate the tests once in a domain-specific language and to subsequently generate the language-specific test code automatically. To save time and encourage test-driven development, we present a language for testing interval arithmetic libraries and a corresponding source code generator which produces language-specific unit tests.},\n author = {Kiesner, Maximilian and Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\n institution = {Department of Computer Science, University of W\\\"urzburg},\n month = {June},\n number = {495},\n title = {{ITF1788: An Interval Testframework for IEEE 1788}},\n url = {http://wwwi2.informatik.uni-wuerzburg.de/publications/tr495.pdf},\n year = {2015},\n}\n\n','\n\nMaximilian Kiesner, Marco Nehmeier, and Jürgen Wolff von Gudenberg.\nITF1788: An Interval Testframework for IEEE 1788.\nTechnical Report 495, Department of Computer Science, University of\nWürzburg, June 2015.\n[ bib | .pdf | Abstract  ] 
\n@techreport{nehmeierTR495,\nabstract = {Libraries implementing the interval arithmetic standard IEEE 1788 have to be tested for errors. Although the standard is language agnostic, the different implementations are not. Therefore the same tests must be implemented in many different languages. Hence it is useful to only have to formulate the tests once in a domain-specific language and to subsequently generate the language-specific test code automatically. To save time and encourage test-driven development, we present a language for testing interval arithmetic libraries and a corresponding source code generator which produces language-specific unit tests.},\nauthor = {Kiesner, Maximilian and Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\ninstitution = {Department of Computer Science, University of W\\\"urzburg},\nmonth = {June},\nnumber = {495},\ntitle = {{ITF1788: An Interval Testframework for IEEE 1788}},\nurl = {http://wwwi2.informatik.uni-wuerzburg.de/publications/tr495.pdf},\nyear = {2015}\n}\n
\n
\nLibraries implementing the interval arithmetic standard IEEE 1788 have to be tested for errors. Although the standard is language agnostic, the different implementations are not. Therefore the same tests must be implemented in many different languages. Hence it is useful to only have to formulate the tests once in a domain-specific language and to subsequently generate the language-specific test code automatically. To save time and encourage test-driven development, we present a language for testing interval arithmetic libraries and a corresponding source code generator which produces language-specific unit tests.\n
\n','
\n@techreport{nehmeierTR495,\n  abstract = {Libraries implementing the interval arithmetic standard IEEE 1788 have to be tested for errors. Although the standard is language agnostic, the different implementations are not. Therefore the same tests must be implemented in many different languages. Hence it is useful to only have to formulate the tests once in a domain-specific language and to subsequently generate the language-specific test code automatically. To save time and encourage test-driven development, we present a language for testing interval arithmetic libraries and a corresponding source code generator which produces language-specific unit tests.},\n  author = {Kiesner, Maximilian and Nehmeier, Marco and Wolff von Gudenberg, J\\\"urgen},\n  institution = {Department of Computer Science, University of W\\\"urzburg},\n  month = {June},\n  number = {495},\n  title = {{ITF1788: An Interval Testframework for IEEE 1788}},\n  url = {http://wwwi2.informatik.uni-wuerzburg.de/publications/tr495.pdf},\n  year = {2015}\n}\n
\n\n','Libraries implementing the interval arithmetic standard IEEE 1788 have to be tested for errors. Although the standard is language agnostic, the different implementations are not. Therefore the same tests must be implemented in many different languages. Hence it is useful to only have to formulate the tests once in a domain-specific language and to subsequently generate the language-specific test code automatically. To save time and encourage test-driven development, we present a language for testing interval arithmetic libraries and a corresponding source code generator which produces language-specific unit tests.','{ITF1788: An Interval Testframework for IEEE 1788}',0,6,2015,6,NULL,NULL,NULL,'2015-06-17 13:04:01','2016-06-01 10:31:37',0),(884,'talk','talk-Kounev-CAS2015','misc','@misc{talk-Kounev-CAS2015,\n author = {Samuel Kounev},\n title = {{Software Engineering Research at the University of W\\\"urzburg}},\n howpublished = {Invited Talk, CAS Software AG, Karlsruhe, Germany},\n days = {26},\n month = {June},\n year = {2015},\n}\n\n','\n\nSamuel Kounev.\nSoftware Engineering Research at the University of Würzburg.\nInvited Talk, CAS Software AG, Karlsruhe, Germany, June 2015.\n[ bib  ] 
\n@misc{talk-Kounev-CAS2015,\nauthor = {Samuel Kounev},\ntitle = {{Software Engineering Research at the University of W\\\"urzburg}},\nhowpublished = {Invited Talk, CAS Software AG, Karlsruhe, Germany},\ndays = {26},\nmonth = {June},\nyear = {2015}\n}\n
\n
\n','
\n@misc{talk-Kounev-CAS2015,\n  author = {Samuel Kounev},\n  title = {{Software Engineering Research at the University of W\\\"urzburg}},\n  howpublished = {Invited Talk, CAS Software AG, Karlsruhe, Germany},\n  days = {26},\n  month = {June},\n  year = {2015}\n}\n
\n\n',NULL,'{Software Engineering Research at the University of W\\\"urzburg}',0,6,2015,6,NULL,NULL,NULL,'2015-06-19 10:59:06','2016-06-01 09:41:05',0),(885,'talk','talk-Kounev-DATEV_TrendScout2015a','misc','@misc{talk-Kounev-DATEV_TrendScout2015a,\n author = {Samuel Kounev},\n title = {{How elastic is your cloud? From metrics to benchmarks}},\n howpublished = {Invited Talk, DATEV Trendscout, N\\\"urnberg, Germany},\n days = {5},\n month = {May},\n year = {2015},\n}\n\n','\n\nSamuel Kounev.\nHow elastic is your cloud? From metrics to benchmarks.\nInvited Talk, DATEV Trendscout, Nürnberg, Germany, May 2015.\n[ bib  ] 
\n@misc{talk-Kounev-DATEV_TrendScout2015a,\nauthor = {Samuel Kounev},\ntitle = {{How elastic is your cloud? From metrics to benchmarks}},\nhowpublished = {Invited Talk, DATEV Trendscout, N\\\"urnberg, Germany},\ndays = {5},\nmonth = {May},\nyear = {2015}\n}\n
\n
\n','
\n@misc{talk-Kounev-DATEV_TrendScout2015a,\n  author = {Samuel Kounev},\n  title = {{How elastic is your cloud? From metrics to benchmarks}},\n  howpublished = {Invited Talk, DATEV Trendscout, N\\\"urnberg, Germany},\n  days = {5},\n  month = {May},\n  year = {2015}\n}\n
\n\n',NULL,'{How elastic is your cloud? From metrics to benchmarks}',0,5,2015,5,NULL,NULL,NULL,'2015-06-19 11:04:38','2016-06-01 09:41:05',0),(886,'talk','talk-Kounev-DATEV2015','misc','@misc{talk-Kounev-DATEV2015,\n author = {Samuel Kounev},\n title = {{Self-Aware Performance and Resource Management in Shared IT Infrastructures}},\n howpublished = {Invited Talk, DATEV eG, 90329 N\\\"urnberg, Germany},\n days = {5},\n month = {May},\n year = {2015},\n}\n\n','\n\nSamuel Kounev.\nSelf-Aware Performance and Resource Management in Shared IT\nInfrastructures.\nInvited Talk, DATEV eG, 90329 Nürnberg, Germany, May 2015.\n[ bib  ] 
\n@misc{talk-Kounev-DATEV2015,\nauthor = {Samuel Kounev},\ntitle = {{Self-Aware Performance and Resource Management in Shared IT Infrastructures}},\nhowpublished = {Invited Talk, DATEV eG, 90329 N\\\"urnberg, Germany},\ndays = {5},\nmonth = {May},\nyear = {2015}\n}\n
\n
\n','
\n@misc{talk-Kounev-DATEV2015,\n  author = {Samuel Kounev},\n  title = {{Self-Aware Performance and Resource Management in Shared IT Infrastructures}},\n  howpublished = {Invited Talk, DATEV eG, 90329 N\\\"urnberg, Germany},\n  days = {5},\n  month = {May},\n  year = {2015}\n}\n
\n\n',NULL,'{Self-Aware Performance and Resource Management in Shared IT Infrastructures}',0,5,2015,5,NULL,NULL,NULL,'2015-06-19 11:06:28','2016-06-01 09:41:05',0),(887,'paper','WiDlBrSpKoKr2015-EPEW-LibredePMWT','inproceedings','@inproceedings{WiDlBrSpKoKr2015-EPEW-LibredePMWT,\n author = {Felix Willnecker and Markus Dlugi and Andreas Brunnert and Simon Spinner and Samuel Kounev and Helmut Krcmar},\n title = {{Comparing the Accuracy of Resource Demand Measurement and Estimation Techniques}},\n booktitle = {Computer Performance Engineering - Proceedings of the 12th European Workshop (EPEW 2015)},\n location = {Madrid, Spain},\n series = {Lecture Notes in Computer Science},\n volume = {9272},\n pages = {115-129},\n editor = {Beltr\\\'{a}n, Marta and Knottenbelt, William and Bradley, Jeremy},\n year = {2015},\n month = {{August}},\n isbn = {978-3-319-23266-9},\n doi = {10.1007/978-3-319-23267-6_8},\n publisher = {Springer},\n location = {Madrid, Spain},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/887.pdf},\n abstract = {Resource demands are a core aspect of performance models. They describe how an operation utilizes a resource and therefore influence the systems performance metrics: response time, resource utilization and throughput. Such demands can be determined by two extraction classes: direct measurement or demand estimation. Selecting the best suited technique depends on available tools, acceptable measurement overhead and the level of granularity necessary for the performance model. This work compares two direct measurement techniques and an adaptive estimation technique based on multiple statistical approaches to evaluate strengths and weaknesses of each technique.We conduct a series of experiments using the SPECjEnterprise2010 industry benchmark and an automatic performance model generator for architecture-level performance models based on the Palladio Component Model. To compare the techniques we conduct two experiments with different levels of granularity on a standalone system, followed by one experiment using a distributed SPECjEnterprise2010 deployment combining both extraction classes for generating a full-stack performance model.},\n}\n\n','\n\nFelix Willnecker, Markus Dlugi, Andreas Brunnert, Simon Spinner, Samuel Kounev,\nand Helmut Krcmar.\nComparing the Accuracy of Resource Demand Measurement and Estimation\nTechniques.\nIn Computer Performance Engineering - Proceedings of the 12th\nEuropean Workshop (EPEW 2015), Marta Beltrán, William Knottenbelt, and\nJeremy Bradley, editors, Madrid, Spain, August 2015, volume 9272 of \nLecture Notes in Computer Science, pages 115-129. Springer.\nAugust 2015.\n[ bib | DOI | .pdf | Abstract  ] 
\n@inproceedings{WiDlBrSpKoKr2015-EPEW-LibredePMWT,\nauthor = {Felix Willnecker and Markus Dlugi and Andreas Brunnert and Simon Spinner and Samuel Kounev and Helmut Krcmar},\ntitle = {{Comparing the Accuracy of Resource Demand Measurement and Estimation Techniques}},\nbooktitle = {Computer Performance Engineering - Proceedings of the 12th European Workshop (EPEW 2015)},\nlocation = {Madrid, Spain},\nseries = {Lecture Notes in Computer Science},\nvolume = {9272},\npages = {115-129},\neditor = {Beltr\\\'{a}n, Marta and Knottenbelt, William and Bradley, Jeremy},\nyear = {2015},\nmonth = {{August}},\nisbn = {978-3-319-23266-9},\ndoi = {10.1007/978-3-319-23267-6_8},\npublisher = {Springer},\nlocation = {Madrid, Spain},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/887.pdf},\nabstract = {Resource demands are a core aspect of performance models. They describe how an operation utilizes a resource and therefore influence the systems performance metrics: response time, resource utilization and throughput. Such demands can be determined by two extraction classes: direct measurement or demand estimation. Selecting the best suited technique depends on available tools, acceptable measurement overhead and the level of granularity necessary for the performance model. This work compares two direct measurement techniques and an adaptive estimation technique based on multiple statistical approaches to evaluate strengths and weaknesses of each technique.We conduct a series of experiments using the SPECjEnterprise2010 industry benchmark and an automatic performance model generator for architecture-level performance models based on the Palladio Component Model. To compare the techniques we conduct two experiments with different levels of granularity on a standalone system, followed by one experiment using a distributed SPECjEnterprise2010 deployment combining both extraction classes for generating a full-stack performance model.}\n}\n
\n
\nResource demands are a core aspect of performance models. They describe how an operation utilizes a resource and therefore influence the systems performance metrics: response time, resource utilization and throughput. Such demands can be determined by two extraction classes: direct measurement or demand estimation. Selecting the best suited technique depends on available tools, acceptable measurement overhead and the level of granularity necessary for the performance model. This work compares two direct measurement techniques and an adaptive estimation technique based on multiple statistical approaches to evaluate strengths and weaknesses of each technique.We conduct a series of experiments using the SPECjEnterprise2010 industry benchmark and an automatic performance model generator for architecture-level performance models based on the Palladio Component Model. To compare the techniques we conduct two experiments with different levels of granularity on a standalone system, followed by one experiment using a distributed SPECjEnterprise2010 deployment combining both extraction classes for generating a full-stack performance model.\n
\n','
\n@inproceedings{WiDlBrSpKoKr2015-EPEW-LibredePMWT,\n  author = {Felix Willnecker and Markus Dlugi and Andreas Brunnert and Simon Spinner and Samuel Kounev and Helmut Krcmar},\n  title = {{Comparing the Accuracy of Resource Demand Measurement and Estimation Techniques}},\n  booktitle = {Computer Performance Engineering - Proceedings of the 12th European Workshop (EPEW 2015)},\n  location = {Madrid, Spain},\n  series = {Lecture Notes in Computer Science},\n  volume = {9272},\n  pages = {115-129},\n  editor = {Beltr\\\'{a}n, Marta and Knottenbelt, William and Bradley, Jeremy},\n  year = {2015},\n  month = {{August}},\n  isbn = {978-3-319-23266-9},\n  doi = {10.1007/978-3-319-23267-6_8},\n  publisher = {Springer},\n  location = {Madrid, Spain},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/887.pdf},\n  abstract = {Resource demands are a core aspect of performance models. They describe how an operation utilizes a resource and therefore influence the systems performance metrics: response time, resource utilization and throughput. Such demands can be determined by two extraction classes: direct measurement or demand estimation. Selecting the best suited technique depends on available tools, acceptable measurement overhead and the level of granularity necessary for the performance model. This work compares two direct measurement techniques and an adaptive estimation technique based on multiple statistical approaches to evaluate strengths and weaknesses of each technique.We conduct a series of experiments using the SPECjEnterprise2010 industry benchmark and an automatic performance model generator for architecture-level performance models based on the Palladio Component Model. To compare the techniques we conduct two experiments with different levels of granularity on a standalone system, followed by one experiment using a distributed SPECjEnterprise2010 deployment combining both extraction classes for generating a full-stack performance model.}\n}\n
\n\n','Resource demands are a core aspect of performance models. They describe how an operation utilizes a resource and therefore influence the systems performance metrics: response time, resource utilization and throughput. Such demands can be determined by two extraction classes: direct measurement or demand estimation. Selecting the best suited technique depends on available tools, acceptable measurement overhead and the level of granularity necessary for the performance model. This work compares two direct measurement techniques and an adaptive estimation technique based on multiple statistical approaches to evaluate strengths and weaknesses of each technique.We conduct a series of experiments using the SPECjEnterprise2010 industry benchmark and an automatic performance model generator for architecture-level performance models based on the Palladio Component Model. To compare the techniques we conduct two experiments with different levels of granularity on a standalone system, followed by one experiment using a distributed SPECjEnterprise2010 deployment combining both extraction classes for generating a full-stack performance model.','{Comparing the Accuracy of Resource Demand Measurement and Estimation Techniques}',0,8,2015,8,NULL,NULL,NULL,'2015-06-28 18:07:30','2016-06-01 09:41:05',0),(888,'paper','MiViKoAvPa2015-CSUR-IDSEval','article','@article{MiViKoAvPa2015-CSUR-IDSEval,\n author = {Aleksandar Milenkoski and Marco Vieira and Samuel Kounev and Alberto Avrtizer and Bryan D. Payne},\n title = {{Evaluating Computer Intrusion Detection Systems: A Survey of Common Practices}},\n journal = {{ACM Computing Surveys}},\n publisher = {ACM},\n address = {New York, NY, USA},\n year = {2015},\n month = {{September}},\n volume = {48},\n number = {1},\n pages = {12:1--12:41},\n url = {http://dl.acm.org/authorize?N06203},\n note = {{5-year Impact Factor (2014): 5.949}},\n abstract = {{The evaluation of computer intrusion detection systems (which we refer to as intrusion detection systems) is an active research area. In this paper, we survey and systematize common practices in the area of evaluation of intrusion detection systems. For this purpose, we define a design space structured into three parts: workload, metrics, and measurement methodology. We then provide an overview of the common practices in evaluation of intrusion detection systems by surveying evaluation approaches and methods related to each part of the design space. Finally, we discuss open issues and challenges focusing on evaluation methodologies for novel intrusion detection systems.}},\n}\n\n','\n\nAleksandar Milenkoski, Marco Vieira, Samuel Kounev, Alberto Avrtizer, and\nBryan D. Payne.\nEvaluating Computer Intrusion Detection Systems: A Survey of Common\nPractices.\nACM Computing Surveys, 48(1):12:1-12:41, September 2015,\nACM, New York, NY, USA.\n5-year Impact Factor (2014): 5.949.\n[ bib | http | Abstract  ] 
\n@article{MiViKoAvPa2015-CSUR-IDSEval,\nauthor = {Aleksandar Milenkoski and Marco Vieira and Samuel Kounev and Alberto Avrtizer and Bryan D. Payne},\ntitle = {{Evaluating Computer Intrusion Detection Systems: A Survey of Common Practices}},\njournal = {{ACM Computing Surveys}},\npublisher = {ACM},\naddress = {New York, NY, USA},\nyear = {2015},\nmonth = {{September}},\nvolume = {48},\nnumber = {1},\npages = {12:1--12:41},\nurl = {http://dl.acm.org/authorize?N06203},\nnote = {{5-year Impact Factor (2014): 5.949}},\nabstract = {{The evaluation of computer intrusion detection systems (which we refer to as intrusion detection systems) is an active research area. In this paper, we survey and systematize common practices in the area of evaluation of intrusion detection systems. For this purpose, we define a design space structured into three parts: workload, metrics, and measurement methodology. We then provide an overview of the common practices in evaluation of intrusion detection systems by surveying evaluation approaches and methods related to each part of the design space. Finally, we discuss open issues and challenges focusing on evaluation methodologies for novel intrusion detection systems.}}\n}\n
\n
\nThe evaluation of computer intrusion detection systems (which we refer to as intrusion detection systems) is an active research area. In this paper, we survey and systematize common practices in the area of evaluation of intrusion detection systems. For this purpose, we define a design space structured into three parts: workload, metrics, and measurement methodology. We then provide an overview of the common practices in evaluation of intrusion detection systems by surveying evaluation approaches and methods related to each part of the design space. Finally, we discuss open issues and challenges focusing on evaluation methodologies for novel intrusion detection systems.\n
\n','
\n@article{MiViKoAvPa2015-CSUR-IDSEval,\n  author = {Aleksandar Milenkoski and Marco Vieira and Samuel Kounev and Alberto Avrtizer and Bryan D. Payne},\n  title = {{Evaluating Computer Intrusion Detection Systems: A Survey of Common Practices}},\n  journal = {{ACM Computing Surveys}},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  year = {2015},\n  month = {{September}},\n  volume = {48},\n  number = {1},\n  pages = {12:1--12:41},\n  url = {http://dl.acm.org/authorize?N06203},\n  note = {{5-year Impact Factor (2014): 5.949}},\n  abstract = {{The evaluation of computer intrusion detection systems (which we refer to as intrusion detection systems) is an active research area. In this paper, we survey and systematize common practices in the area of evaluation of intrusion detection systems. For this purpose, we define a design space structured into three parts: workload, metrics, and measurement methodology. We then provide an overview of the common practices in evaluation of intrusion detection systems by surveying evaluation approaches and methods related to each part of the design space. Finally, we discuss open issues and challenges focusing on evaluation methodologies for novel intrusion detection systems.}}\n}\n
\n\n','{The evaluation of computer intrusion detection systems (which we refer to as intrusion detection systems) is an active research area. In this paper, we survey and systematize common practices in the area of evaluation of intrusion detection systems. For this purpose, we define a design space structured into three parts: workload, metrics, and measurement methodology. We then provide an overview of the common practices in evaluation of intrusion detection systems by surveying evaluation approaches and methods related to each part of the design space. Finally, we discuss open issues and challenges focusing on evaluation methodologies for novel intrusion detection systems.}','{Evaluating Computer Intrusion Detection Systems: A Survey of Common Practices}',0,9,2015,9,NULL,NULL,NULL,'2015-07-01 08:26:33','2016-06-01 09:41:06',0),(889,'paper','Gehring2015','mastersthesis','@mastersthesis{Gehring2015,\n author = {Andreas Gehring},\n address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n title = {{Metriken zur Bestimmung der Energieeffizienz von Servern}},\n type = {{Bachelor Thesis}},\n school = {University of W\\\"{u}rzburg},\n year = {2014},\n month = {October},\n}\n\n','\n\nAndreas Gehring.\nMetriken zur Bestimmung der Energieeffizienz von Servern.\nBachelor Thesis, University of Würzburg, Am Hubland,\nInformatikgebäude, 97074 Würzburg, Germany, October 2014.\n[ bib  ] 
\n@mastersthesis{Gehring2015,\nauthor = {Andreas Gehring},\naddress = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\ntitle = {{Metriken zur Bestimmung der Energieeffizienz von Servern}},\ntype = {{Bachelor Thesis}},\nschool = {University of W\\\"{u}rzburg},\nyear = {2014},\nmonth = {October}\n}\n
\n
\n','
\n@mastersthesis{Gehring2015,\n  author = {Andreas Gehring},\n  address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n  title = {{Metriken zur Bestimmung der Energieeffizienz von Servern}},\n  type = {{Bachelor Thesis}},\n  school = {University of W\\\"{u}rzburg},\n  year = {2014},\n  month = {October}\n}\n
\n\n',NULL,'{Metriken zur Bestimmung der Energieeffizienz von Servern}',0,10,2014,10,NULL,NULL,NULL,'2015-07-03 09:10:24','2016-06-01 09:41:06',0),(890,'paper','SpCaBrKo2015-PEVA-ResDemEstSurvey','article','@article{SpCaBrKo2015-PEVA-ResDemEstSurvey,\n author = {Spinner, Simon and Casale, Giuliano and Brosig, Fabian and Kounev, Samuel},\n title = {{Evaluating Approaches to Resource Demand Estimation}},\n journal = {Performance Evaluation},\n month = {October},\n year = {2015},\n volume = {92},\n number = {},\n pages = {51 -- 71},\n issn = {0166-5316},\n url = {http://www.sciencedirect.com/science/article/pii/S0166531615000711},\n publisher = {Elsevier B.V.},\n doi = {10.1016/j.peva.2015.07.005},\n abstract = {Resource demands are a key parameter of stochastic performance models that needs to be determined when performing a quantitative performance analysis of a system. However, the direct measurement of resource demands is not feasible in most realistic systems. Therefore, statistical approaches that estimate resource demands based on coarse-grained monitoring data (e.g., CPU utilization, and response times) have been proposed in the literature. These approaches have different assumptions and characteristics that need to be considered when estimating resource demands. This paper surveys the state-of-the-art in resource demand estimation and proposes a classification scheme for estimation approaches. Furthermore, it contains an experimental evaluation comparing the impact of different factors (monitoring window size, number of workload classes, load level, collinearity, and model mismatch) on the estimation accuracy of seven different approaches. The classification scheme and the experimental comparison helps performance engineers to select an approach to resource demand estimation that fulfills the requirements of a given analysis scenario.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/890.pdf},\n}\n\n','\n\nSimon Spinner, Giuliano Casale, Fabian Brosig, and Samuel Kounev.\nEvaluating Approaches to Resource Demand Estimation.\nPerformance Evaluation, 92:51 - 71, October 2015, Elsevier\nB.V.\n[ bib | DOI | http | .pdf | Abstract  ] 
\n@article{SpCaBrKo2015-PEVA-ResDemEstSurvey,\nauthor = {Spinner, Simon and Casale, Giuliano and Brosig, Fabian and Kounev, Samuel},\ntitle = {{Evaluating Approaches to Resource Demand Estimation}},\njournal = {Performance Evaluation},\nmonth = {October},\nyear = {2015},\nvolume = {92},\nnumber = {},\npages = {51 -- 71},\nissn = {0166-5316},\nurl = {http://www.sciencedirect.com/science/article/pii/S0166531615000711},\npublisher = {Elsevier B.V.},\ndoi = {10.1016/j.peva.2015.07.005},\nabstract = {Resource demands are a key parameter of stochastic performance models that needs to be determined when performing a quantitative performance analysis of a system. However, the direct measurement of resource demands is not feasible in most realistic systems. Therefore, statistical approaches that estimate resource demands based on coarse-grained monitoring data (e.g., CPU utilization, and response times) have been proposed in the literature. These approaches have different assumptions and characteristics that need to be considered when estimating resource demands. This paper surveys the state-of-the-art in resource demand estimation and proposes a classification scheme for estimation approaches. Furthermore, it contains an experimental evaluation comparing the impact of different factors (monitoring window size, number of workload classes, load level, collinearity, and model mismatch) on the estimation accuracy of seven different approaches. The classification scheme and the experimental comparison helps performance engineers to select an approach to resource demand estimation that fulfills the requirements of a given analysis scenario.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/890.pdf}\n}\n
\n
\nResource demands are a key parameter of stochastic performance models that needs to be determined when performing a quantitative performance analysis of a system. However, the direct measurement of resource demands is not feasible in most realistic systems. Therefore, statistical approaches that estimate resource demands based on coarse-grained monitoring data (e.g., CPU utilization, and response times) have been proposed in the literature. These approaches have different assumptions and characteristics that need to be considered when estimating resource demands. This paper surveys the state-of-the-art in resource demand estimation and proposes a classification scheme for estimation approaches. Furthermore, it contains an experimental evaluation comparing the impact of different factors (monitoring window size, number of workload classes, load level, collinearity, and model mismatch) on the estimation accuracy of seven different approaches. The classification scheme and the experimental comparison helps performance engineers to select an approach to resource demand estimation that fulfills the requirements of a given analysis scenario.\n
\n','
\n@article{SpCaBrKo2015-PEVA-ResDemEstSurvey,\n  author = {Spinner, Simon and Casale, Giuliano and Brosig, Fabian and Kounev, Samuel},\n  title = {{Evaluating Approaches to Resource Demand Estimation}},\n  journal = {Performance Evaluation},\n  month = {October},\n  year = {2015},\n  volume = {92},\n  number = {},\n  pages = {51 -- 71},\n  issn = {0166-5316},\n  url = {http://www.sciencedirect.com/science/article/pii/S0166531615000711},\n  publisher = {Elsevier B.V.},\n  doi = {10.1016/j.peva.2015.07.005},\n  abstract = {Resource demands are a key parameter of stochastic performance models that needs to be determined when performing a quantitative performance analysis of a system. However, the direct measurement of resource demands is not feasible in most realistic systems. Therefore, statistical approaches that estimate resource demands based on coarse-grained monitoring data (e.g., CPU utilization, and response times) have been proposed in the literature. These approaches have different assumptions and characteristics that need to be considered when estimating resource demands. This paper surveys the state-of-the-art in resource demand estimation and proposes a classification scheme for estimation approaches. Furthermore, it contains an experimental evaluation comparing the impact of different factors (monitoring window size, number of workload classes, load level, collinearity, and model mismatch) on the estimation accuracy of seven different approaches. The classification scheme and the experimental comparison helps performance engineers to select an approach to resource demand estimation that fulfills the requirements of a given analysis scenario.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/890.pdf}\n}\n
\n\n','Resource demands are a key parameter of stochastic performance models that needs to be determined when performing a quantitative performance analysis of a system. However, the direct measurement of resource demands is not feasible in most realistic systems. Therefore, statistical approaches that estimate resource demands based on coarse-grained monitoring data (e.g., CPU utilization, and response times) have been proposed in the literature. These approaches have different assumptions and characteristics that need to be considered when estimating resource demands. This paper surveys the state-of-the-art in resource demand estimation and proposes a classification scheme for estimation approaches. Furthermore, it contains an experimental evaluation comparing the impact of different factors (monitoring window size, number of workload classes, load level, collinearity, and model mismatch) on the estimation accuracy of seven different approaches. The classification scheme and the experimental comparison helps performance engineers to select an approach to resource demand estimation that fulfills the requirements of a given analysis scenario.','{Evaluating Approaches to Resource Demand Estimation}',0,10,2015,10,NULL,NULL,NULL,'2015-07-17 17:42:05','2016-06-01 09:41:06',0),(891,'paper','HuWaBaKo2015-ICCAC-BlueYonder','inproceedings','@inproceedings{HuWaBaKo2015-ICCAC-BlueYonder,\n author = {Nikolaus Huber and J\\\"{u}rgen Walter and Manuel B\\\"{a}hr and Samuel Kounev},\n title = {{Model-based Autonomic and Performance-aware System Adaptation in Heterogeneous Resource Environments: A Case Study}},\n year = {2015},\n month = {September},\n day = {21-24},\n publisher = {IEEE},\n booktitle = {Proceedings of the 2015 IEEE International Conference on Cloud and Autonomic Computing (ICCAC)},\n location = {Cambridge, MA, USA},\n abstract = {Recent trends like cloud computing show that service providers increasingly adopt to modern self-adaptive system architectures promising higher resource efficiency and lower operating costs. Blue Yonder is such a service provider in the field of predictive analytics, looking for novel approaches to automatically adapt their service infrastructure to changing customer workloads and service-level agreements. In this paper, we present a realistic case study in which we apply a holistic modelbased approach to build a self-adaptive system that automatically maintains performance requirements and resource efficiency in the heterogeneous resource environment of Blue Yonder. As modeling formalism, we employ the Descartes Modeling Language (DML), a domain-specific language for modeling the performance behavior and run-time adaptation processes of modern dynamic IT systems. This case study is an exemplar for applying a holistic model-based approach to engineering performance-aware system adaptation. More specifically, the results evaluate the applicability and effectiveness of our approach and demonstrate that DML provides suitable modeling abstractions that can be used as a basis for self-adaptive performance and resource management.},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/891},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/891.pdf},\n}\n\n','\n\nNikolaus Huber, Jürgen Walter, Manuel Bähr, and Samuel Kounev.\nModel-based Autonomic and Performance-aware System Adaptation in\nHeterogeneous Resource Environments: A Case Study.\nIn Proceedings of the 2015 IEEE International Conference on\nCloud and Autonomic Computing (ICCAC), Cambridge, MA, USA, September 21-24,\n2015. IEEE.\nSeptember 2015.\n[ bib | slides | .pdf | Abstract  ] 
\n@inproceedings{HuWaBaKo2015-ICCAC-BlueYonder,\nauthor = {Nikolaus Huber and J\\\"{u}rgen Walter and Manuel B\\\"{a}hr and Samuel Kounev},\ntitle = {{Model-based Autonomic and Performance-aware System Adaptation in Heterogeneous Resource Environments: A Case Study}},\nyear = {2015},\nmonth = {September},\nday = {21-24},\npublisher = {IEEE},\nbooktitle = {Proceedings of the 2015 IEEE International Conference on Cloud and Autonomic Computing (ICCAC)},\nlocation = {Cambridge, MA, USA},\nabstract = {Recent trends like cloud computing show that service providers increasingly adopt to modern self-adaptive system architectures promising higher resource efficiency and lower operating costs. Blue Yonder is such a service provider in the field of predictive analytics, looking for novel approaches to automatically adapt their service infrastructure to changing customer workloads and service-level agreements. In this paper, we present a realistic case study in which we apply a holistic modelbased approach to build a self-adaptive system that automatically maintains performance requirements and resource efficiency in the heterogeneous resource environment of Blue Yonder. As modeling formalism, we employ the Descartes Modeling Language (DML), a domain-specific language for modeling the performance behavior and run-time adaptation processes of modern dynamic IT systems. This case study is an exemplar for applying a holistic model-based approach to engineering performance-aware system adaptation. More specifically, the results evaluate the applicability and effectiveness of our approach and demonstrate that DML provides suitable modeling abstractions that can be used as a basis for self-adaptive performance and resource management.},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/891},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/891.pdf}\n}\n
\n
\nRecent trends like cloud computing show that service providers increasingly adopt to modern self-adaptive system architectures promising higher resource efficiency and lower operating costs. Blue Yonder is such a service provider in the field of predictive analytics, looking for novel approaches to automatically adapt their service infrastructure to changing customer workloads and service-level agreements. In this paper, we present a realistic case study in which we apply a holistic modelbased approach to build a self-adaptive system that automatically maintains performance requirements and resource efficiency in the heterogeneous resource environment of Blue Yonder. As modeling formalism, we employ the Descartes Modeling Language (DML), a domain-specific language for modeling the performance behavior and run-time adaptation processes of modern dynamic IT systems. This case study is an exemplar for applying a holistic model-based approach to engineering performance-aware system adaptation. More specifically, the results evaluate the applicability and effectiveness of our approach and demonstrate that DML provides suitable modeling abstractions that can be used as a basis for self-adaptive performance and resource management.\n
\n','
\n@inproceedings{HuWaBaKo2015-ICCAC-BlueYonder,\n  author = {Nikolaus Huber and J\\\"{u}rgen Walter and Manuel B\\\"{a}hr and Samuel Kounev},\n  title = {{Model-based Autonomic and Performance-aware System Adaptation in Heterogeneous Resource Environments: A Case Study}},\n  year = {2015},\n  month = {September},\n  day = {21-24},\n  publisher = {IEEE},\n  booktitle = {Proceedings of the 2015 IEEE International Conference on Cloud and Autonomic Computing (ICCAC)},\n  location = {Cambridge, MA, USA},\n  abstract = {Recent trends like cloud computing show that service providers increasingly adopt to modern self-adaptive system architectures promising higher resource efficiency and lower operating costs. Blue Yonder is such a service provider in the field of predictive analytics, looking for novel approaches to automatically adapt their service infrastructure to changing customer workloads and service-level agreements. In this paper, we present a realistic case study in which we apply a holistic modelbased approach to build a self-adaptive system that automatically maintains performance requirements and resource efficiency in the heterogeneous resource environment of Blue Yonder. As modeling formalism, we employ the Descartes Modeling Language (DML), a domain-specific language for modeling the performance behavior and run-time adaptation processes of modern dynamic IT systems. This case study is an exemplar for applying a holistic model-based approach to engineering performance-aware system adaptation. More specifically, the results evaluate the applicability and effectiveness of our approach and demonstrate that DML provides suitable modeling abstractions that can be used as a basis for self-adaptive performance and resource management.},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/891},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/891.pdf}\n}\n
\n\n','Recent trends like cloud computing show that service providers increasingly adopt to modern self-adaptive system architectures promising higher resource efficiency and lower operating costs. Blue Yonder is such a service provider in the field of predictive analytics, looking for novel approaches to automatically adapt their service infrastructure to changing customer workloads and service-level agreements. In this paper, we present a realistic case study in which we apply a holistic modelbased approach to build a self-adaptive system that automatically maintains performance requirements and resource efficiency in the heterogeneous resource environment of Blue Yonder. As modeling formalism, we employ the Descartes Modeling Language (DML), a domain-specific language for modeling the performance behavior and run-time adaptation processes of modern dynamic IT systems. This case study is an exemplar for applying a holistic model-based approach to engineering performance-aware system adaptation. More specifically, the results evaluate the applicability and effectiveness of our approach and demonstrate that DML provides suitable modeling abstractions that can be used as a basis for self-adaptive performance and resource management.','{Model-based Autonomic and Performance-aware System Adaptation in Heterogeneous Resource Environments: A Case Study}',0,9,2015,9,NULL,NULL,NULL,'2015-07-22 12:27:08','2016-06-01 09:41:06',0),(892,'paper','SPEC-RG-2015-001-DevOpsPerformanceResearchAgenda','techreport','@techreport{SPEC-RG-2015-001-DevOpsPerformanceResearchAgenda,\n title = {Performance-oriented {DevOps}: {A} Research Agenda},\n author = {Andreas Brunnert and Andre van Hoorn and Felix Willnecker and Alexandru Danciu and Wilhelm Hasselbring and Christoph Heger and Nikolas Herbst and Pooyan Jamshidi and Reiner Jung and Joakim von Kistowski and Anne Koziolek and Johannes Kro{\\ss} and Simon Spinner and Christian V{\\\"o}gele and J{\\\"u}rgen Walter and Alexander Wert},\n institution = {SPEC Research Group --- DevOps Performance Working Group, Standard Performance Evaluation Corporation (SPEC)},\n year = {2015},\n month = {August},\n number = {SPEC-RG-2015-01},\n url = {https://research.spec.org/fileadmin/user_upload/documents/wg_devops/endorsed_publications/SPEC-RG-2015-001-DevOpsPerformanceResearchAgenda.pdf},\n abstract = {DevOps is a trend towards a tighter integration between development (Dev) and operations (Ops) teams. The need for such an integration is driven by the requirement to continuously adapt enterprise applications (EAs) to changes in the business environment. As of today, DevOps concepts have been primarily introduced to ensure a constant flow of features and bug fixes into new releases from a functional perspective. In order to integrate a non-functional perspective into these DevOps concepts this report focuses on tools, activities, and processes to ensure one of the most important quality attributes of a software system, namely performance. Performance describes system properties concerning its timeliness and use of resources. Common metrics are response time, throughput, and resource utilization. Performance goals for EAs are typically defined by setting upper and/or lower bounds for these metrics and specific business transactions. In order to ensure that such performance goals can be met, several activities are required during development and operation of these systems as well as during the transition from Dev to Ops. Activities during development are typically summarized by the term Software Performance Engineering (SPE), whereas activities during operations are called Application Performance Management (APM). SPE and APM were historically tackled independently from each other, but the newly emerging DevOps concepts require and enable a tighter integration between both activity streams. This report presents existing solutions to support this integration as well as open research challenges in this area. The report starts by defining EAs and summarizes their characteristics that make performance evaluations for these systems particularly challenging. It continues by describing our understanding of DevOps and explaining the roots of this trend to set the context for the remaining parts of the report. Afterwards, performance management activities that are common in both life cycle phases are explained, until the particularities of SPE and APM are discussed in separate sections. Finally, the report concludes by outlining activities and challenges to support the rapid iteration between Dev and Ops.},\n}\n\n','\n\nAndreas Brunnert, Andre van Hoorn, Felix Willnecker, Alexandru Danciu, Wilhelm\nHasselbring, Christoph Heger, Nikolas Herbst, Pooyan Jamshidi, Reiner Jung,\nJoakim von Kistowski, Anne Koziolek, Johannes Kroß, Simon Spinner,\nChristian Vögele, Jürgen Walter, and Alexander Wert.\nPerformance-oriented DevOps: A research agenda.\nTechnical Report SPEC-RG-2015-01, SPEC Research Group - DevOps\nPerformance Working Group, Standard Performance Evaluation Corporation\n(SPEC), August 2015.\n[ bib | .pdf | Abstract  ] 
\n@techreport{SPEC-RG-2015-001-DevOpsPerformanceResearchAgenda,\ntitle = {Performance-oriented {DevOps}: {A} Research Agenda},\nauthor = {Andreas Brunnert and Andre van Hoorn and Felix Willnecker and Alexandru Danciu and Wilhelm Hasselbring and Christoph Heger and Nikolas Herbst and Pooyan Jamshidi and Reiner Jung and Joakim von Kistowski and Anne Koziolek and Johannes Kro{\\ss} and Simon Spinner and Christian V{\\\"o}gele and J{\\\"u}rgen Walter and Alexander Wert},\ninstitution = {SPEC Research Group --- DevOps Performance Working Group, Standard Performance Evaluation Corporation (SPEC)},\nyear = {2015},\nmonth = {August},\nnumber = {SPEC-RG-2015-01},\nurl = {https://research.spec.org/fileadmin/user_upload/documents/wg_devops/endorsed_publications/SPEC-RG-2015-001-DevOpsPerformanceResearchAgenda.pdf},\nabstract = {DevOps is a trend towards a tighter integration between development (Dev) and operations (Ops) teams. The need for such an integration is driven by the requirement to continuously adapt enterprise applications (EAs) to changes in the business environment. As of today, DevOps concepts have been primarily introduced to ensure a constant flow of features and bug fixes into new releases from a functional perspective. In order to integrate a non-functional perspective into these DevOps concepts this report focuses on tools, activities, and processes to ensure one of the most important quality attributes of a software system, namely performance. Performance describes system properties concerning its timeliness and use of resources. Common metrics are response time, throughput, and resource utilization. Performance goals for EAs are typically defined by setting upper and/or lower bounds for these metrics and specific business transactions. In order to ensure that such performance goals can be met, several activities are required during development and operation of these systems as well as during the transition from Dev to Ops. Activities during development are typically summarized by the term Software Performance Engineering (SPE), whereas activities during operations are called Application Performance Management (APM). SPE and APM were historically tackled independently from each other, but the newly emerging DevOps concepts require and enable a tighter integration between both activity streams. This report presents existing solutions to support this integration as well as open research challenges in this area. The report starts by defining EAs and summarizes their characteristics that make performance evaluations for these systems particularly challenging. It continues by describing our understanding of DevOps and explaining the roots of this trend to set the context for the remaining parts of the report. Afterwards, performance management activities that are common in both life cycle phases are explained, until the particularities of SPE and APM are discussed in separate sections. Finally, the report concludes by outlining activities and challenges to support the rapid iteration between Dev and Ops.}\n}\n
\n
\nDevOps is a trend towards a tighter integration between development (Dev) and operations (Ops) teams. The need for such an integration is driven by the requirement to continuously adapt enterprise applications (EAs) to changes in the business environment. As of today, DevOps concepts have been primarily introduced to ensure a constant flow of features and bug fixes into new releases from a functional perspective. In order to integrate a non-functional perspective into these DevOps concepts this report focuses on tools, activities, and processes to ensure one of the most important quality attributes of a software system, namely performance. Performance describes system properties concerning its timeliness and use of resources. Common metrics are response time, throughput, and resource utilization. Performance goals for EAs are typically defined by setting upper and/or lower bounds for these metrics and specific business transactions. In order to ensure that such performance goals can be met, several activities are required during development and operation of these systems as well as during the transition from Dev to Ops. Activities during development are typically summarized by the term Software Performance Engineering (SPE), whereas activities during operations are called Application Performance Management (APM). SPE and APM were historically tackled independently from each other, but the newly emerging DevOps concepts require and enable a tighter integration between both activity streams. This report presents existing solutions to support this integration as well as open research challenges in this area. The report starts by defining EAs and summarizes their characteristics that make performance evaluations for these systems particularly challenging. It continues by describing our understanding of DevOps and explaining the roots of this trend to set the context for the remaining parts of the report. Afterwards, performance management activities that are common in both life cycle phases are explained, until the particularities of SPE and APM are discussed in separate sections. Finally, the report concludes by outlining activities and challenges to support the rapid iteration between Dev and Ops.\n
\n','
\n@techreport{SPEC-RG-2015-001-DevOpsPerformanceResearchAgenda,\n  title = {Performance-oriented {DevOps}: {A} Research Agenda},\n  author = {Andreas Brunnert and Andre van Hoorn and Felix Willnecker and Alexandru Danciu and Wilhelm Hasselbring and Christoph Heger and Nikolas Herbst and Pooyan Jamshidi and Reiner Jung and Joakim von Kistowski and Anne Koziolek and Johannes Kro{\\ss} and Simon Spinner and Christian V{\\\"o}gele and J{\\\"u}rgen Walter and Alexander Wert},\n  institution = {SPEC Research Group --- DevOps Performance Working Group, Standard Performance Evaluation Corporation (SPEC)},\n  year = {2015},\n  month = {August},\n  number = {SPEC-RG-2015-01},\n  url = {https://research.spec.org/fileadmin/user_upload/documents/wg_devops/endorsed_publications/SPEC-RG-2015-001-DevOpsPerformanceResearchAgenda.pdf},\n  abstract = {DevOps is a trend towards a tighter integration between development (Dev) and operations (Ops) teams. The need for such an integration is driven by the requirement to continuously adapt enterprise applications (EAs) to changes in the business environment. As of today, DevOps concepts have been primarily introduced to ensure a constant flow of features and bug fixes into new releases from a functional perspective. In order to integrate a non-functional perspective into these DevOps concepts this report focuses on tools, activities, and processes to ensure one of the most important quality attributes of a software system, namely performance. Performance describes system properties concerning its timeliness and use of resources. Common metrics are response time, throughput, and resource utilization. Performance goals for EAs are typically defined by setting upper and/or lower bounds for these metrics and specific business transactions. In order to ensure that such performance goals can be met, several activities are required during development and operation of these systems as well as during the transition from Dev to Ops. Activities during development are typically summarized by the term Software Performance Engineering (SPE), whereas activities during operations are called Application Performance Management (APM). SPE and APM were historically tackled independently from each other, but the newly emerging DevOps concepts require and enable a tighter integration between both activity streams. This report presents existing solutions to support this integration as well as open research challenges in this area. The report starts by defining EAs and summarizes their characteristics that make performance evaluations for these systems particularly challenging. It continues by describing our understanding of DevOps and explaining the roots of this trend to set the context for the remaining parts of the report. Afterwards, performance management activities that are common in both life cycle phases are explained, until the particularities of SPE and APM are discussed in separate sections. Finally, the report concludes by outlining activities and challenges to support the rapid iteration between Dev and Ops.}\n}\n
\n\n','DevOps is a trend towards a tighter integration between development (Dev) and operations (Ops) teams. The need for such an integration is driven by the requirement to continuously adapt enterprise applications (EAs) to changes in the business environment. As of today, DevOps concepts have been primarily introduced to ensure a constant flow of features and bug fixes into new releases from a functional perspective. In order to integrate a non-functional perspective into these DevOps concepts this report focuses on tools, activities, and processes to ensure one of the most important quality attributes of a software system, namely performance. Performance describes system properties concerning its timeliness and use of resources. Common metrics are response time, throughput, and resource utilization. Performance goals for EAs are typically defined by setting upper and/or lower bounds for these metrics and specific business transactions. In order to ensure that such performance goals can be met, several activities are required during development and operation of these systems as well as during the transition from Dev to Ops. Activities during development are typically summarized by the term Software Performance Engineering (SPE), whereas activities during operations are called Application Performance Management (APM). SPE and APM were historically tackled independently from each other, but the newly emerging DevOps concepts require and enable a tighter integration between both activity streams. This report presents existing solutions to support this integration as well as open research challenges in this area. The report starts by defining EAs and summarizes their characteristics that make performance evaluations for these systems particularly challenging. It continues by describing our understanding of DevOps and explaining the roots of this trend to set the context for the remaining parts of the report. Afterwards, performance management activities that are common in both life cycle phases are explained, until the particularities of SPE and APM are discussed in separate sections. Finally, the report concludes by outlining activities and challenges to support the rapid iteration between Dev and Ops.','Performance-oriented {DevOps}: {A} Research Agenda',0,8,2015,8,NULL,NULL,NULL,'2015-08-14 11:10:07','2016-06-01 09:41:06',0),(893,'paper','MiPaAnViKoAvLu2015-RAID-Challenges','inproceedings','@inproceedings{MiPaAnViKoAvLu2015-RAID-Challenges,\n author = {Aleksandar Milenkoski and Bryan D. Payne and Nuno Antunes and Marco Vieira and Samuel Kounev and Alberto Avritzer and Matthias Luft},\n booktitle = {The 18th International Symposium on Research in Attacks, Intrusions, and Defenses (RAID 2015)},\n publisher = {{Springer}},\n location = {Kyoto, Japan},\n title = {{Evaluation of Intrusion Detection Systems in Virtualized Environments Using Attack Injection}},\n year = {2015},\n month = {{November}},\n url = {http://link.springer.com/chapter/10.1007/978-3-319-26362-5_22},\n abstract = {{The evaluation of intrusion detection systems (IDSes) is an active research area with many open challenges, one of which is the generation of representative workloads that contain attacks. In this paper, we propose a novel approach for the rigorous evaluation of IDSes in virtualized environments, with a focus on IDSes designed to detect attacks leveraging or targeting the hypervisor via its hypercall interface. We present hInjector, a tool for generating IDS evaluation workloads by injecting such attacks during regular operation of a virtualized environment. We demonstrate the application of our approach and show its practical usefulness by evaluating a representative IDS designed to operate in virtualized environments. The virtualized environment of the industry-standard benchmark SPECvirt_sc2013 is used as a testbed, whose drivers generate workloads representative of workloads seen in production environments. This work enables for the first time the injection of attacks in virtualized environments for the purpose of generating representative IDS evaluation workloads.}},\n note = {{Acceptance Rate: 23%.}},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/893.pdf},\n}\n\n','\n\nAleksandar Milenkoski, Bryan D. Payne, Nuno Antunes, Marco Vieira, Samuel\nKounev, Alberto Avritzer, and Matthias Luft.\nEvaluation of Intrusion Detection Systems in Virtualized\nEnvironments Using Attack Injection.\nIn The 18th International Symposium on Research in Attacks,\nIntrusions, and Defenses (RAID 2015), Kyoto, Japan, November 2015.\nSpringer.\nNovember 2015, Acceptance Rate: 23%.\n[ bib | http | .pdf | Abstract  ] 
\n@inproceedings{MiPaAnViKoAvLu2015-RAID-Challenges,\nauthor = {Aleksandar Milenkoski and Bryan D. Payne and Nuno Antunes and Marco Vieira and Samuel Kounev and Alberto Avritzer and Matthias Luft},\nbooktitle = {The 18th International Symposium on Research in Attacks, Intrusions, and Defenses (RAID 2015)},\npublisher = {{Springer}},\nlocation = {Kyoto, Japan},\ntitle = {{Evaluation of Intrusion Detection Systems in Virtualized Environments Using Attack Injection}},\nyear = {2015},\nmonth = {{November}},\nurl = {http://link.springer.com/chapter/10.1007/978-3-319-26362-5_22},\nabstract = {{The evaluation of intrusion detection systems (IDSes) is an active research area with many open challenges, one of which is the generation of representative workloads that contain attacks. In this paper, we propose a novel approach for the rigorous evaluation of IDSes in virtualized environments, with a focus on IDSes designed to detect attacks leveraging or targeting the hypervisor via its hypercall interface. We present hInjector, a tool for generating IDS evaluation workloads by injecting such attacks during regular operation of a virtualized environment. We demonstrate the application of our approach and show its practical usefulness by evaluating a representative IDS designed to operate in virtualized environments. The virtualized environment of the industry-standard benchmark SPECvirt_sc2013 is used as a testbed, whose drivers generate workloads representative of workloads seen in production environments. This work enables for the first time the injection of attacks in virtualized environments for the purpose of generating representative IDS evaluation workloads.}},\nnote = {{Acceptance Rate: 23%.}},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/893.pdf}\n}\n
\n
\nThe evaluation of intrusion detection systems (IDSes) is an active research area with many open challenges, one of which is the generation of representative workloads that contain attacks. In this paper, we propose a novel approach for the rigorous evaluation of IDSes in virtualized environments, with a focus on IDSes designed to detect attacks leveraging or targeting the hypervisor via its hypercall interface. We present hInjector, a tool for generating IDS evaluation workloads by injecting such attacks during regular operation of a virtualized environment. We demonstrate the application of our approach and show its practical usefulness by evaluating a representative IDS designed to operate in virtualized environments. The virtualized environment of the industry-standard benchmark SPECvirt_sc2013 is used as a testbed, whose drivers generate workloads representative of workloads seen in production environments. This work enables for the first time the injection of attacks in virtualized environments for the purpose of generating representative IDS evaluation workloads.\n
\n','
\n@inproceedings{MiPaAnViKoAvLu2015-RAID-Challenges,\n  author = {Aleksandar Milenkoski and Bryan D. Payne and Nuno Antunes and Marco Vieira and Samuel Kounev and Alberto Avritzer and Matthias Luft},\n  booktitle = {The 18th International Symposium on Research in Attacks, Intrusions, and Defenses (RAID 2015)},\n  publisher = {{Springer}},\n  location = {Kyoto, Japan},\n  title = {{Evaluation of Intrusion Detection Systems in Virtualized Environments Using Attack Injection}},\n  year = {2015},\n  month = {{November}},\n  url = {http://link.springer.com/chapter/10.1007/978-3-319-26362-5_22},\n  abstract = {{The evaluation of intrusion detection systems (IDSes) is an active research area with many open challenges, one of which is the generation of representative workloads that contain attacks. In this paper, we propose a novel approach for the rigorous evaluation of IDSes in virtualized environments, with a focus on IDSes designed to detect attacks leveraging or targeting the hypervisor via its hypercall interface. We present hInjector, a tool for generating IDS evaluation workloads by injecting such attacks during regular operation of a virtualized environment. We demonstrate the application of our approach and show its practical usefulness by evaluating a representative IDS designed to operate in virtualized environments. The virtualized environment of the industry-standard benchmark SPECvirt_sc2013 is used as a testbed, whose drivers generate workloads representative of workloads seen in production environments. This work enables for the first time the injection of attacks in virtualized environments for the purpose of generating representative IDS evaluation workloads.}},\n  note = {{Acceptance Rate: 23%.}},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/893.pdf}\n}\n
\n\n','{The evaluation of intrusion detection systems (IDSes) is an active research area with many open challenges, one of which is the generation of representative workloads that contain attacks. In this paper, we propose a novel approach for the rigorous evaluation of IDSes in virtualized environments, with a focus on IDSes designed to detect attacks leveraging or targeting the hypervisor via its hypercall interface. We present hInjector, a tool for generating IDS evaluation workloads by injecting such attacks during regular operation of a virtualized environment. We demonstrate the application of our approach and show its practical usefulness by evaluating a representative IDS designed to operate in virtualized environments. The virtualized environment of the industry-standard benchmark SPECvirt_sc2013 is used as a testbed, whose drivers generate workloads representative of workloads seen in production environments. This work enables for the first time the injection of attacks in virtualized environments for the purpose of generating representative IDS evaluation workloads.}','{Evaluation of Intrusion Detection Systems in Virtualized Environments Using Attack Injection}',0,11,2015,11,NULL,NULL,NULL,'2015-08-15 11:09:29','2016-06-01 09:41:06',0),(894,'paper','Krebs2015-phd','phdthesis','@phdthesis{Krebs2015-phd,\n author = {Rouven Krebs},\n title = {Performance Isolation in Multi-Tenant Applications},\n year = {2015},\n month = {August},\n school = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/894.pdf},\n}\n\n','\n\nRouven Krebs.\nPerformance Isolation in Multi-Tenant Applications.\nPhD thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, August 2015.\n[ bib | .pdf  ] 
\n@phdthesis{Krebs2015-phd,\nauthor = {Rouven Krebs},\ntitle = {Performance Isolation in Multi-Tenant Applications},\nyear = {2015},\nmonth = {August},\nschool = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/894.pdf}\n}\n
\n
\n','
\n@phdthesis{Krebs2015-phd,\n  author = {Rouven Krebs},\n  title = {Performance Isolation in Multi-Tenant Applications},\n  year = {2015},\n  month = {August},\n  school = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/894.pdf}\n}\n
\n\n',NULL,'Performance Isolation in Multi-Tenant Applications',0,8,2015,8,NULL,NULL,NULL,'2015-10-08 08:22:19','2016-06-01 09:41:06',0),(895,'paper','Noorshams2015-phd','phdthesis','@phdthesis{Noorshams2015-phd,\n author = {Qais Noorshams},\n title = {Modeling and Prediction of I/O Performance in Virtualized Environments},\n year = {2015},\n month = {February},\n url = {http://primo.bibliothek.kit.edu/primo_library/libweb/action/dlDisplay.do?vid=KIT&docId=KITSRCE1000046750&tab=kit_evastar&srt=date},\n school = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/895.pdf},\n}\n\n','\n\nQais Noorshams.\nModeling and Prediction of I/O Performance in Virtualized\nEnvironments.\nPhD thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, February 2015.\n[ bib | http | .pdf  ] 
\n@phdthesis{Noorshams2015-phd,\nauthor = {Qais Noorshams},\ntitle = {Modeling and Prediction of I/O Performance in Virtualized Environments},\nyear = {2015},\nmonth = {February},\nurl = {http://primo.bibliothek.kit.edu/primo_library/libweb/action/dlDisplay.do?vid=KIT&docId=KITSRCE1000046750&tab=kit_evastar&srt=date},\nschool = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/895.pdf}\n}\n
\n
\n','
\n@phdthesis{Noorshams2015-phd,\n  author = {Qais Noorshams},\n  title = {Modeling and Prediction of I/O Performance in Virtualized Environments},\n  year = {2015},\n  month = {February},\n  url = {http://primo.bibliothek.kit.edu/primo_library/libweb/action/dlDisplay.do?vid=KIT&docId=KITSRCE1000046750&tab=kit_evastar&srt=date},\n  school = {Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/895.pdf}\n}\n
\n\n',NULL,'Modeling and Prediction of I/O Performance in Virtualized Environments',0,2,2015,2,NULL,NULL,NULL,'2015-10-08 08:27:43','2016-06-01 09:41:06',0),(896,'paper','busch2013','mastersthesis','@mastersthesis{busch2013,\n address = {Karlsruhe, Germany},\n author = {Axel Busch},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Workload Characterization for I/O Performance Analysis on IBM System z}},\n year = {2013},\n}\n\n','\n\nAxel Busch.\nWorkload Characterization for I/O Performance Analysis on IBM System\nz.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, 2013.\n[ bib  ] 
\n@mastersthesis{busch2013,\naddress = {Karlsruhe, Germany},\nauthor = {Axel Busch},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Workload Characterization for I/O Performance Analysis on IBM System z}},\nyear = {2013}\n}\n
\n
\n','
\n@mastersthesis{busch2013,\n  address = {Karlsruhe, Germany},\n  author = {Axel Busch},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Workload Characterization for I/O Performance Analysis on IBM System z}},\n  year = {2013}\n}\n
\n\n',NULL,'{Workload Characterization for I/O Performance Analysis on IBM System z}',0,0,2013,0,NULL,NULL,NULL,'2015-10-08 08:46:40','2016-06-01 09:41:06',0),(897,'paper','rostami2013','mastersthesis','@mastersthesis{rostami2013,\n address = {Karlsruhe, Germany},\n author = {Kiana Rostami},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Performance-Vorhersage von virtualisiertem Storage mit Warteschlangennetzen}},\n year = {2013},\n}\n\n','\n\nKiana Rostami.\nPerformance-Vorhersage von virtualisiertem Storage mit\nWarteschlangennetzen.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, 2013.\n[ bib  ] 
\n@mastersthesis{rostami2013,\naddress = {Karlsruhe, Germany},\nauthor = {Kiana Rostami},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Performance-Vorhersage von virtualisiertem Storage mit Warteschlangennetzen}},\nyear = {2013}\n}\n
\n
\n','
\n@mastersthesis{rostami2013,\n  address = {Karlsruhe, Germany},\n  author = {Kiana Rostami},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Performance-Vorhersage von virtualisiertem Storage mit Warteschlangennetzen}},\n  year = {2013}\n}\n
\n\n',NULL,'{Performance-Vorhersage von virtualisiertem Storage mit Warteschlangennetzen}',0,0,2013,0,NULL,NULL,NULL,'2015-10-08 08:47:13','2016-06-01 09:41:06',0),(898,'paper','bruhn2012','mastersthesis','@mastersthesis{bruhn2012,\n address = {Karlsruhe, Germany},\n author = {Dominik Bruhn},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Modeling and Experimental Analysis of Virtualized Storage Performance using IBM System Z as Example}},\n year = {2012},\n}\n\n','\n\nDominik Bruhn.\nModeling and Experimental Analysis of Virtualized Storage\nPerformance using IBM System Z as Example.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, 2012.\n[ bib  ] 
\n@mastersthesis{bruhn2012,\naddress = {Karlsruhe, Germany},\nauthor = {Dominik Bruhn},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Modeling and Experimental Analysis of Virtualized Storage Performance using IBM System Z as Example}},\nyear = {2012}\n}\n
\n
\n','
\n@mastersthesis{bruhn2012,\n  address = {Karlsruhe, Germany},\n  author = {Dominik Bruhn},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Modeling and Experimental Analysis of Virtualized Storage Performance using IBM System Z as Example}},\n  year = {2012}\n}\n
\n\n',NULL,'{Modeling and Experimental Analysis of Virtualized Storage Performance using IBM System Z as Example}',0,0,2012,0,NULL,NULL,NULL,'2015-10-08 08:48:00','2016-06-01 09:41:06',0),(899,'paper','becker2012ma','mastersthesis','@mastersthesis{becker2012ma,\n address = {Karlsruhe, Germany},\n author = {Stefan Becker},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Performance-Modellierung des 1&1 Mail-Systems}},\n year = {2011},\n}\n\n','\n\nStefan Becker.\nPerformance-Modellierung des 1&1 Mail-Systems.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, 2011.\n[ bib  ] 
\n@mastersthesis{becker2012ma,\naddress = {Karlsruhe, Germany},\nauthor = {Stefan Becker},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Performance-Modellierung des 1&1 Mail-Systems}},\nyear = {2011}\n}\n
\n
\n','
\n@mastersthesis{becker2012ma,\n  address = {Karlsruhe, Germany},\n  author = {Stefan Becker},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Performance-Modellierung des 1&1 Mail-Systems}},\n  year = {2011}\n}\n
\n\n',NULL,'{Performance-Modellierung des 1&1 Mail-Systems}',0,0,2011,0,NULL,NULL,NULL,'2015-10-08 08:48:42','2016-06-01 09:41:06',0),(900,'paper','Kusnady2011','mastersthesis','@mastersthesis{Kusnady2011,\n author = {Enrico Kusnady},\n address = {Karlsruhe, Germany},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{QoS-aware Resource Allocation in Virtualized Environments}},\n year = {2011},\n}\n\n','\n\nEnrico Kusnady.\nQoS-aware Resource Allocation in Virtualized Environments.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, 2011.\n[ bib  ] 
\n@mastersthesis{Kusnady2011,\nauthor = {Enrico Kusnady},\naddress = {Karlsruhe, Germany},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{QoS-aware Resource Allocation in Virtualized Environments}},\nyear = {2011}\n}\n
\n
\n','
\n@mastersthesis{Kusnady2011,\n  author = {Enrico Kusnady},\n  address = {Karlsruhe, Germany},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{QoS-aware Resource Allocation in Virtualized Environments}},\n  year = {2011}\n}\n
\n\n',NULL,'{QoS-aware Resource Allocation in Virtualized Environments}',0,0,2011,0,NULL,NULL,NULL,'2015-10-08 08:49:14','2016-06-01 09:41:06',0),(901,'paper','Matershev2010','mastersthesis','@mastersthesis{Matershev2010,\n author = {Evgeny Matershev},\n address = {Karlsruhe, Germany},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Comparison of selected SOA middleware platforms focusing on provided facilities for online monitoring, instrumentation and dynamic reconfiguration}},\n year = {2010},\n type = {{Bachelor Thesis}},\n}\n\n','\n\nEvgeny Matershev.\nComparison of selected SOA middleware platforms focusing on provided\nfacilities for online monitoring, instrumentation and dynamic\nreconfiguration.\nBachelor Thesis, Karlsruhe Institute of Technology (KIT),\nKarlsruhe, Germany, 2010.\n[ bib  ] 
\n@mastersthesis{Matershev2010,\nauthor = {Evgeny Matershev},\naddress = {Karlsruhe, Germany},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Comparison of selected SOA middleware platforms focusing on provided facilities for online monitoring, instrumentation and dynamic reconfiguration}},\nyear = {2010},\ntype = {{Bachelor Thesis}}\n}\n
\n
\n','
\n@mastersthesis{Matershev2010,\n  author = {Evgeny Matershev},\n  address = {Karlsruhe, Germany},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Comparison of selected SOA middleware platforms focusing on provided facilities for online monitoring, instrumentation and dynamic reconfiguration}},\n  year = {2010},\n  type = {{Bachelor Thesis}}\n}\n
\n\n',NULL,'{Comparison of selected SOA middleware platforms focusing on provided facilities for online monitoring, instrumentation and dynamic reconfiguration}',0,0,2010,0,NULL,NULL,NULL,'2015-10-08 08:50:49','2016-06-01 09:41:06',0),(902,'paper','Quast2010','mastersthesis','@mastersthesis{Quast2010,\n author = {Marcel von Quast},\n address = {Karlsruhe, Germany},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Automatisierte Performance-Analyse von Virtualisierungsplattformen}},\n year = {2010},\n}\n\n','\n\nMarcel von Quast.\nAutomatisierte Performance-Analyse von Virtualisierungsplattformen.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, 2010.\n[ bib  ] 
\n@mastersthesis{Quast2010,\nauthor = {Marcel von Quast},\naddress = {Karlsruhe, Germany},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Automatisierte Performance-Analyse von Virtualisierungsplattformen}},\nyear = {2010}\n}\n
\n
\n','
\n@mastersthesis{Quast2010,\n  author = {Marcel von Quast},\n  address = {Karlsruhe, Germany},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Automatisierte Performance-Analyse von Virtualisierungsplattformen}},\n  year = {2010}\n}\n
\n\n',NULL,'{Automatisierte Performance-Analyse von Virtualisierungsplattformen}',0,0,2010,0,NULL,NULL,NULL,'2015-10-08 08:51:33','2016-06-01 09:41:06',0),(903,'paper','Zipp2009','mastersthesis','@mastersthesis{Zipp2009,\n author = {Frederik Zipp},\n address = {Karlsruhe, Germany},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Querying, Aggregating and Visualizing QPN Model Analysis Data}},\n year = {2009},\n type = {{Study Thesis}},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/903.pdf},\n}\n\n','\n\nFrederik Zipp.\nQuerying, Aggregating and Visualizing QPN Model Analysis Data.\nStudy Thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, 2009.\n[ bib | .pdf  ] 
\n@mastersthesis{Zipp2009,\nauthor = {Frederik Zipp},\naddress = {Karlsruhe, Germany},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Querying, Aggregating and Visualizing QPN Model Analysis Data}},\nyear = {2009},\ntype = {{Study Thesis}},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/903.pdf}\n}\n
\n
\n','
\n@mastersthesis{Zipp2009,\n  author = {Frederik Zipp},\n  address = {Karlsruhe, Germany},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Querying, Aggregating and Visualizing QPN Model Analysis Data}},\n  year = {2009},\n  type = {{Study Thesis}},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/903.pdf}\n}\n
\n\n',NULL,'{Querying, Aggregating and Visualizing QPN Model Analysis Data}',0,0,2009,0,NULL,NULL,NULL,'2015-10-08 08:52:26','2016-06-01 09:41:06',0),(904,'paper','Klatt2010','mastersthesis','@mastersthesis{Klatt2010,\n author = {Benjamin Klatt},\n address = {Karlsruhe, Germany},\n school = {Karlsruhe Institute of Technology (KIT)},\n title = {{Modelling and prediction of event-based communication in component-based architectures}},\n year = {2010},\n note = {{ObjektForum Thesis Award}},\n}\n\n','\n\nBenjamin Klatt.\nModelling and prediction of event-based communication in\ncomponent-based architectures.\nMaster\'s thesis, Karlsruhe Institute of Technology (KIT), Karlsruhe,\nGermany, 2010.\nObjektForum Thesis Award.\n[ bib  ] 
\n@mastersthesis{Klatt2010,\nauthor = {Benjamin Klatt},\naddress = {Karlsruhe, Germany},\nschool = {Karlsruhe Institute of Technology (KIT)},\ntitle = {{Modelling and prediction of event-based communication in component-based architectures}},\nyear = {2010},\nnote = {{ObjektForum Thesis Award}}\n}\n
\n
\n','
\n@mastersthesis{Klatt2010,\n  author = {Benjamin Klatt},\n  address = {Karlsruhe, Germany},\n  school = {Karlsruhe Institute of Technology (KIT)},\n  title = {{Modelling and prediction of event-based communication in component-based architectures}},\n  year = {2010},\n  note = {{ObjektForum Thesis Award}}\n}\n
\n\n',NULL,'{Modelling and prediction of event-based communication in component-based architectures}',0,0,2010,0,NULL,NULL,NULL,'2015-10-08 08:53:25','2016-06-01 09:41:06',0),(905,'paper','WaEiHi2015-SPP-DML2PCM','inproceedings','@inproceedings{WaEiHi2015-SPP-DML2PCM,\n author = {J\\\"{u}rgen Walter and Simon Eismann and Adrian Hildebrandt},\n title = {{Automated Transformation of Descartes Modeling Language to Palladio Component Model}},\n year = {2015},\n month = {November},\n day = {6},\n booktitle = {Proceedings of the 2015 Symposium on Software Performance (SSP)},\n location = {Munich, Germany},\n abstract = {Model-based performance predictions and reconfigurations enable optimizing resource efficiency while ensuring that Quality-of-Service demands are met in today\'s complex ITsystems. The Descartes Modeling Language (DML) and the Palladio Component Model (PCM) are two architectural performance modeling formalisms applied in this context. This paper compares DML to PCM concerning similarities, differences and semantic gaps. Based on this, we propose a mapping from DML to PCM for which we implemented a tool realizing an automated transformation.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/905.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/905},\n}\n\n','\n\nJürgen Walter, Simon Eismann, and Adrian Hildebrandt.\nAutomated Transformation of Descartes Modeling Language to Palladio\nComponent Model.\nIn Proceedings of the 2015 Symposium on Software Performance\n(SSP), Munich, Germany, November 6, 2015.\n[ bib | slides | .pdf | Abstract  ] 
\n@inproceedings{WaEiHi2015-SPP-DML2PCM,\nauthor = {J\\\"{u}rgen Walter and Simon Eismann and Adrian Hildebrandt},\ntitle = {{Automated Transformation of Descartes Modeling Language to Palladio Component Model}},\nyear = {2015},\nmonth = {November},\nday = {6},\nbooktitle = {Proceedings of the 2015 Symposium on Software Performance (SSP)},\nlocation = {Munich, Germany},\nabstract = {Model-based performance predictions and reconfigurations enable optimizing resource efficiency while ensuring that Quality-of-Service demands are met in today\'s complex ITsystems. The Descartes Modeling Language (DML) and the Palladio Component Model (PCM) are two architectural performance modeling formalisms applied in this context. This paper compares DML to PCM concerning similarities, differences and semantic gaps. Based on this, we propose a mapping from DML to PCM for which we implemented a tool realizing an automated transformation.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/905.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/905}\n}\n
\n
\nModel-based performance predictions and reconfigurations enable optimizing resource efficiency while ensuring that Quality-of-Service demands are met in today\'s complex ITsystems. The Descartes Modeling Language (DML) and the Palladio Component Model (PCM) are two architectural performance modeling formalisms applied in this context. This paper compares DML to PCM concerning similarities, differences and semantic gaps. Based on this, we propose a mapping from DML to PCM for which we implemented a tool realizing an automated transformation.\n
\n','
\n@inproceedings{WaEiHi2015-SPP-DML2PCM,\n  author = {J\\\"{u}rgen Walter and Simon Eismann and Adrian Hildebrandt},\n  title = {{Automated Transformation of Descartes Modeling Language to Palladio Component Model}},\n  year = {2015},\n  month = {November},\n  day = {6},\n  booktitle = {Proceedings of the 2015 Symposium on Software Performance (SSP)},\n  location = {Munich, Germany},\n  abstract = {Model-based performance predictions and reconfigurations enable optimizing resource efficiency while ensuring that Quality-of-Service demands are met in today\'s complex ITsystems. The Descartes Modeling Language (DML) and the Palladio Component Model (PCM) are two architectural performance modeling formalisms applied in this context. This paper compares DML to PCM concerning similarities, differences and semantic gaps. Based on this, we propose a mapping from DML to PCM for which we implemented a tool realizing an automated transformation.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/905.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/905}\n}\n
\n\n','Model-based performance predictions and reconfigurations enable optimizing resource efficiency while ensuring that Quality-of-Service demands are met in today\'s complex ITsystems. The Descartes Modeling Language (DML) and the Palladio Component Model (PCM) are two architectural performance modeling formalisms applied in this context. This paper compares DML to PCM concerning similarities, differences and semantic gaps. Based on this, we propose a mapping from DML to PCM for which we implemented a tool realizing an automated transformation.','{Automated Transformation of Descartes Modeling Language to Palladio Component Model}',0,11,2015,11,NULL,NULL,NULL,'2015-10-12 07:21:08','2016-06-01 09:41:06',0),(906,'paper','KiKo2015-VALUETOOLS','inproceedings','@inproceedings{KiKo2015-VALUETOOLS,\n author = {J\\\'{o}akim von Kistowski and Samuel Kounev},\n abstract = {{Performance and power scale non-linearly with device utilization, making characterization and prediction of energy efficiency at a given load level a challenging issue. A common approach to address this problem is the creation of power or performance state tables for a pre-measured subset of all possible system states. Approaches to determine performance and power for a state not included in the measured subset use simple interpolation, such as nearest neighbor interpolation, or define state switching rules. This leads to a loss in accuracy, as unmeasured system states are not considered. In this paper, we compare different interpolation functions and automatically configure and select functions for a given domain or measurement set. We evaluate our approach by comparing interpolation of measurement data subsets against power and performance measurements on a commodity server. We show that for non-extrapolating models interpolation is significantly more accurate than regression, with our automatically configured interpolation function improving modeling accuracy up to 43.6\\%.}},\n title = {{Univariate Interpolation-based Modeling of Power and Performance}},\n year = {2015},\n booktitle = {Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2015)},\n location = {Berlin, Germany},\n month = {December},\n day = {14--16},\n keywords = {Interpolation, Energy Efficiency, Power, Performance, Interpolation, Utilization, SERT},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/906},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/906.pdf},\n doi = {http://dx.doi.org/10.4108/eai.14-12-2015.2262579},\n}\n\n','\n\nJóakim von Kistowski and Samuel Kounev.\nUnivariate Interpolation-based Modeling of Power and Performance.\nIn Proceedings of the 9th EAI International Conference on\nPerformance Evaluation Methodologies and Tools (VALUETOOLS 2015), Berlin,\nGermany, December 14-16, 2015.\n[ bib | DOI | slides | .pdf | Abstract  ] 
\n@inproceedings{KiKo2015-VALUETOOLS,\nauthor = {J\\\'{o}akim von Kistowski and Samuel Kounev},\nabstract = {{Performance and power scale non-linearly with device utilization, making characterization and prediction of energy efficiency at a given load level a challenging issue. A common approach to address this problem is the creation of power or performance state tables for a pre-measured subset of all possible system states. Approaches to determine performance and power for a state not included in the measured subset use simple interpolation, such as nearest neighbor interpolation, or define state switching rules. This leads to a loss in accuracy, as unmeasured system states are not considered. In this paper, we compare different interpolation functions and automatically configure and select functions for a given domain or measurement set. We evaluate our approach by comparing interpolation of measurement data subsets against power and performance measurements on a commodity server. We show that for non-extrapolating models interpolation is significantly more accurate than regression, with our automatically configured interpolation function improving modeling accuracy up to 43.6\\%.}},\ntitle = {{Univariate Interpolation-based Modeling of Power and Performance}},\nyear = {2015},\nbooktitle = {Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2015)},\nlocation = {Berlin, Germany},\nmonth = {December},\nday = {14--16},\nkeywords = {Interpolation, Energy Efficiency, Power, Performance, Interpolation, Utilization, SERT},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/906},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/906.pdf},\ndoi = {http://dx.doi.org/10.4108/eai.14-12-2015.2262579}\n}\n
\n
\nPerformance and power scale non-linearly with device utilization, making characterization and prediction of energy efficiency at a given load level a challenging issue. A common approach to address this problem is the creation of power or performance state tables for a pre-measured subset of all possible system states. Approaches to determine performance and power for a state not included in the measured subset use simple interpolation, such as nearest neighbor interpolation, or define state switching rules. This leads to a loss in accuracy, as unmeasured system states are not considered. In this paper, we compare different interpolation functions and automatically configure and select functions for a given domain or measurement set. We evaluate our approach by comparing interpolation of measurement data subsets against power and performance measurements on a commodity server. We show that for non-extrapolating models interpolation is significantly more accurate than regression, with our automatically configured interpolation function improving modeling accuracy up to 43.6%.\n
\n','
\n@inproceedings{KiKo2015-VALUETOOLS,\n  author = {J\\\'{o}akim von Kistowski and Samuel Kounev},\n  abstract = {{Performance and power scale non-linearly with device utilization, making characterization and prediction of energy efficiency at a given load level a challenging issue. A common approach to address this problem is the creation of power or performance state tables for a pre-measured subset of all possible system states. Approaches to determine performance and power for a state not included in the measured subset use simple interpolation, such as nearest neighbor interpolation, or define state switching rules. This leads to a loss in accuracy, as unmeasured system states are not considered. In this paper, we compare different interpolation functions and automatically configure and select functions for a given domain or measurement set. We evaluate our approach by comparing interpolation of measurement data subsets against power and performance measurements on a commodity server. We show that for non-extrapolating models interpolation is significantly more accurate than regression, with our automatically configured interpolation function improving modeling accuracy up to 43.6\\%.}},\n  title = {{Univariate Interpolation-based Modeling of Power and Performance}},\n  year = {2015},\n  booktitle = {Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2015)},\n  location = {Berlin, Germany},\n  month = {December},\n  day = {14--16},\n  keywords = {Interpolation, Energy Efficiency, Power, Performance, Interpolation, Utilization, SERT},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/906},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/906.pdf},\n  doi = {http://dx.doi.org/10.4108/eai.14-12-2015.2262579}\n}\n
\n\n','{Performance and power scale non-linearly with device utilization, making characterization and prediction of energy efficiency at a given load level a challenging issue. A common approach to address this problem is the creation of power or performance state tables for a pre-measured subset of all possible system states. Approaches to determine performance and power for a state not included in the measured subset use simple interpolation, such as nearest neighbor interpolation, or define state switching rules. This leads to a loss in accuracy, as unmeasured system states are not considered. In this paper, we compare different interpolation functions and automatically configure and select functions for a given domain or measurement set. We evaluate our approach by comparing interpolation of measurement data subsets against power and performance measurements on a commodity server. We show that for non-extrapolating models interpolation is significantly more accurate than regression, with our automatically configured interpolation function improving modeling accuracy up to 43.6\\%.}','{Univariate Interpolation-based Modeling of Power and Performance}',0,12,2015,12,NULL,NULL,NULL,'2015-11-03 10:31:17','2016-06-01 09:41:06',0),(907,'talk','talk-Kistowski-SSP15','misc','@misc{talk-Kistowski-SSP15,\n author = {J\\\'{o}akim von Kistowski},\n title = {{Common Errors and Assumptions in Energy Measurement and Management}},\n howpublished = {Technical Talk at Symposium on Software Performance (SSP) 2015},\n days = {5--6},\n month = {November},\n year = {2015},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/907},\n}\n\n','\n\nJóakim von Kistowski.\nCommon Errors and Assumptions in Energy Measurement and Management.\nTechnical Talk at Symposium on Software Performance (SSP) 2015,\nNovember 2015.\n[ bib | slides  ] 
\n@misc{talk-Kistowski-SSP15,\nauthor = {J\\\'{o}akim von Kistowski},\ntitle = {{Common Errors and Assumptions in Energy Measurement and Management}},\nhowpublished = {Technical Talk at Symposium on Software Performance (SSP) 2015},\ndays = {5--6},\nmonth = {November},\nyear = {2015},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/907}\n}\n
\n
\n','
\n@misc{talk-Kistowski-SSP15,\n  author = {J\\\'{o}akim von Kistowski},\n  title = {{Common Errors and Assumptions in Energy Measurement and Management}},\n  howpublished = {Technical Talk at Symposium on Software Performance (SSP) 2015},\n  days = {5--6},\n  month = {November},\n  year = {2015},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/907}\n}\n
\n\n',NULL,'{Common Errors and Assumptions in Energy Measurement and Management}',0,11,2015,11,NULL,NULL,NULL,'2015-11-04 08:27:06','2016-06-01 09:41:06',0),(908,'talk','talk-Kistowski-SPECRG2014','misc','@misc{talk-Kistowski-SPECRG2014,\n author = {J\\\'{o}akim von Kistowski},\n title = {{LIMBO - A Load Intensity Modeling Platform}},\n howpublished = {Talk at SPEC RG Annual Meeting 2014},\n location = {Dublin, Ireland},\n days = {26},\n month = {March},\n year = {2014},\n}\n\n','\n\nJóakim von Kistowski.\nLIMBO - A Load Intensity Modeling Platform.\nTalk at SPEC RG Annual Meeting 2014, March 2014.\n[ bib  ] 
\n@misc{talk-Kistowski-SPECRG2014,\nauthor = {J\\\'{o}akim von Kistowski},\ntitle = {{LIMBO - A Load Intensity Modeling Platform}},\nhowpublished = {Talk at SPEC RG Annual Meeting 2014},\nlocation = {Dublin, Ireland},\ndays = {26},\nmonth = {March},\nyear = {2014}\n}\n
\n
\n','
\n@misc{talk-Kistowski-SPECRG2014,\n  author = {J\\\'{o}akim von Kistowski},\n  title = {{LIMBO - A Load Intensity Modeling Platform}},\n  howpublished = {Talk at SPEC RG Annual Meeting 2014},\n  location = {Dublin, Ireland},\n  days = {26},\n  month = {March},\n  year = {2014}\n}\n
\n\n',NULL,'{LIMBO - A Load Intensity Modeling Platform}',0,3,2014,3,NULL,NULL,NULL,'2015-11-04 10:07:43','2016-06-01 09:41:06',0),(909,'talk','talk-Spinner-SSP15','misc','@misc{talk-Spinner-SSP15,\n author = {Simon Spinner},\n title = {{Resource Demand Estimation in Distributed, Service-Oriented Applications using LibReDE}},\n howpublished = {Technical Talk at Symposion on Software Performance (SSP) 2015},\n days = {5},\n month = {November},\n year = {2015},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/909},\n}\n\n','\n\nSimon Spinner.\nResource Demand Estimation in Distributed, Service-Oriented\nApplications using LibReDE.\nTechnical Talk at Symposion on Software Performance (SSP) 2015,\nNovember 2015.\n[ bib | slides  ] 
\n@misc{talk-Spinner-SSP15,\nauthor = {Simon Spinner},\ntitle = {{Resource Demand Estimation in Distributed, Service-Oriented Applications using LibReDE}},\nhowpublished = {Technical Talk at Symposion on Software Performance (SSP) 2015},\ndays = {5},\nmonth = {November},\nyear = {2015},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/909}\n}\n
\n
\n','
\n@misc{talk-Spinner-SSP15,\n  author = {Simon Spinner},\n  title = {{Resource Demand Estimation in Distributed, Service-Oriented Applications using LibReDE}},\n  howpublished = {Technical Talk at Symposion on Software Performance (SSP) 2015},\n  days = {5},\n  month = {November},\n  year = {2015},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/909}\n}\n
\n\n',NULL,'{Resource Demand Estimation in Distributed, Service-Oriented Applications using LibReDE}',0,11,2015,11,NULL,NULL,NULL,'2015-11-16 10:39:31','2016-06-01 09:41:06',0),(911,'paper','KiBlBeSpLaKo2016-ICPE-PowerVariation','inproceedings','@inproceedings{KiBlBeSpLaKo2016-ICPE-PowerVariation,\n author = {J\\\'{o}akim von Kistowski and Hansfried Block and John Beckett and Cloyce Spradling and Klaus-Dieter Lange and Samuel Kounev},\n abstract = {{Experimental analysis of computer systems\' power consumption has become an integral part of system performance evaluation, efficiency management, and model-based analysis. As with all measurements, repeatability and reproducibility of power measurements is a major challenge. Nominally identical systems can have different power consumption running the same workload under otherwise identical conditions. This behavior can also be observed for individual system components. Specifically, CPU power consumption can vary amongst different samples of nominally identical CPUs. This in turn has a significant impact on the overall system power, considering that a system\'s processor is the largest and most dynamic power consumer of the overall system. The concrete impact of CPU sample power variations is unknown, as comprehensive studies about differences in power consumption for nominally identical systems are currently missing. We address this lack of studies by conducting measurements on four different processor types from two different architectures. For each of these types, we compare up to 30 physical processor samples with a total sum of 90 samples over all processor types. We analyze the variations in power consumption for the different samples using six different workloads over five load levels. Additionally, we analyze how these variations change for different processor core counts and architectures. The results of this paper show that selection of a processor sample can have a statistically significant impact on power consumption. With no correlation to performance, power consumption for nominally identical processors can differ as much as 29.6\\% in idle and 19.5\\% at full load. We also show that these variations change over different architectures and processor types.}},\n title = {{Variations in CPU Power Consumption}},\n year = {2016},\n booktitle = {Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)},\n location = {Delft, the Netherlands},\n month = {March},\n publisher = {ACM},\n address = {New York, NY, USA},\n keywords = {Benchmarking, CPU, Power, Variation, SPEC, SERT, Workloads, Energy Efficiency, Metrics, Load level, Utilization},\n doi = {http://dx.doi.org/10.1145/2851553.2851567},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/911},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/911.pdf},\n}\n\n','\n\nJóakim von Kistowski, Hansfried Block, John Beckett, Cloyce Spradling,\nKlaus-Dieter Lange, and Samuel Kounev.\nVariations in CPU Power Consumption.\nIn Proceedings of the 7th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2016), Delft, the Netherlands, March 2016.\nACM, New York, NY, USA.\nMarch 2016.\n[ bib | DOI | slides | .pdf | Abstract  ] 
\n@inproceedings{KiBlBeSpLaKo2016-ICPE-PowerVariation,\nauthor = {J\\\'{o}akim von Kistowski and Hansfried Block and John Beckett and Cloyce Spradling and Klaus-Dieter Lange and Samuel Kounev},\nabstract = {{Experimental analysis of computer systems\' power consumption has become an integral part of system performance evaluation, efficiency management, and model-based analysis. As with all measurements, repeatability and reproducibility of power measurements is a major challenge. Nominally identical systems can have different power consumption running the same workload under otherwise identical conditions. This behavior can also be observed for individual system components. Specifically, CPU power consumption can vary amongst different samples of nominally identical CPUs. This in turn has a significant impact on the overall system power, considering that a system\'s processor is the largest and most dynamic power consumer of the overall system. The concrete impact of CPU sample power variations is unknown, as comprehensive studies about differences in power consumption for nominally identical systems are currently missing. We address this lack of studies by conducting measurements on four different processor types from two different architectures. For each of these types, we compare up to 30 physical processor samples with a total sum of 90 samples over all processor types. We analyze the variations in power consumption for the different samples using six different workloads over five load levels. Additionally, we analyze how these variations change for different processor core counts and architectures. The results of this paper show that selection of a processor sample can have a statistically significant impact on power consumption. With no correlation to performance, power consumption for nominally identical processors can differ as much as 29.6\\% in idle and 19.5\\% at full load. We also show that these variations change over different architectures and processor types.}},\ntitle = {{Variations in CPU Power Consumption}},\nyear = {2016},\nbooktitle = {Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)},\nlocation = {Delft, the Netherlands},\nmonth = {March},\npublisher = {ACM},\naddress = {New York, NY, USA},\nkeywords = {Benchmarking, CPU, Power, Variation, SPEC, SERT, Workloads, Energy Efficiency, Metrics, Load level, Utilization},\ndoi = {http://dx.doi.org/10.1145/2851553.2851567},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/911},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/911.pdf}\n}\n
\n
\nExperimental analysis of computer systems\' power consumption has become an integral part of system performance evaluation, efficiency management, and model-based analysis. As with all measurements, repeatability and reproducibility of power measurements is a major challenge. Nominally identical systems can have different power consumption running the same workload under otherwise identical conditions. This behavior can also be observed for individual system components. Specifically, CPU power consumption can vary amongst different samples of nominally identical CPUs. This in turn has a significant impact on the overall system power, considering that a system\'s processor is the largest and most dynamic power consumer of the overall system. The concrete impact of CPU sample power variations is unknown, as comprehensive studies about differences in power consumption for nominally identical systems are currently missing. We address this lack of studies by conducting measurements on four different processor types from two different architectures. For each of these types, we compare up to 30 physical processor samples with a total sum of 90 samples over all processor types. We analyze the variations in power consumption for the different samples using six different workloads over five load levels. Additionally, we analyze how these variations change for different processor core counts and architectures. The results of this paper show that selection of a processor sample can have a statistically significant impact on power consumption. With no correlation to performance, power consumption for nominally identical processors can differ as much as 29.6% in idle and 19.5% at full load. We also show that these variations change over different architectures and processor types.\n
\n','
\n@inproceedings{KiBlBeSpLaKo2016-ICPE-PowerVariation,\n  author = {J\\\'{o}akim von Kistowski and Hansfried Block and John Beckett and Cloyce Spradling and Klaus-Dieter Lange and Samuel Kounev},\n  abstract = {{Experimental analysis of computer systems\' power consumption has become an integral part of system performance evaluation, efficiency management, and model-based analysis. As with all measurements, repeatability and reproducibility of power measurements is a major challenge. Nominally identical systems can have different power consumption running the same workload under otherwise identical conditions. This behavior can also be observed for individual system components. Specifically, CPU power consumption can vary amongst different samples of nominally identical CPUs. This in turn has a significant impact on the overall system power, considering that a system\'s processor is the largest and most dynamic power consumer of the overall system. The concrete impact of CPU sample power variations is unknown, as comprehensive studies about differences in power consumption for nominally identical systems are currently missing. We address this lack of studies by conducting measurements on four different processor types from two different architectures. For each of these types, we compare up to 30 physical processor samples with a total sum of 90 samples over all processor types. We analyze the variations in power consumption for the different samples using six different workloads over five load levels. Additionally, we analyze how these variations change for different processor core counts and architectures. The results of this paper show that selection of a processor sample can have a statistically significant impact on power consumption. With no correlation to performance, power consumption for nominally identical processors can differ as much as 29.6\\% in idle and 19.5\\% at full load. We also show that these variations change over different architectures and processor types.}},\n  title = {{Variations in CPU Power Consumption}},\n  year = {2016},\n  booktitle = {Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)},\n  location = {Delft, the Netherlands},\n  month = {March},\n  publisher = {ACM},\n  address = {New York, NY, USA},\n  keywords = {Benchmarking, CPU, Power, Variation, SPEC, SERT, Workloads, Energy Efficiency, Metrics, Load level, Utilization},\n  doi = {http://dx.doi.org/10.1145/2851553.2851567},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/911},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/911.pdf}\n}\n
\n\n','{Experimental analysis of computer systems\' power consumption has become an integral part of system performance evaluation, efficiency management, and model-based analysis. As with all measurements, repeatability and reproducibility of power measurements is a major challenge. Nominally identical systems can have different power consumption running the same workload under otherwise identical conditions. This behavior can also be observed for individual system components. Specifically, CPU power consumption can vary amongst different samples of nominally identical CPUs. This in turn has a significant impact on the overall system power, considering that a system\'s processor is the largest and most dynamic power consumer of the overall system. The concrete impact of CPU sample power variations is unknown, as comprehensive studies about differences in power consumption for nominally identical systems are currently missing. We address this lack of studies by conducting measurements on four different processor types from two different architectures. For each of these types, we compare up to 30 physical processor samples with a total sum of 90 samples over all processor types. We analyze the variations in power consumption for the different samples using six different workloads over five load levels. Additionally, we analyze how these variations change for different processor core counts and architectures. The results of this paper show that selection of a processor sample can have a statistically significant impact on power consumption. With no correlation to performance, power consumption for nominally identical processors can differ as much as 29.6\\% in idle and 19.5\\% at full load. We also show that these variations change over different architectures and processor types.}','{Variations in CPU Power Consumption}',0,3,2016,3,NULL,NULL,NULL,'2015-11-17 12:09:54','2016-06-01 09:41:06',0),(912,'talk','talk-Spinner-SPECdevops14','misc','@misc{talk-Spinner-SPECdevops14,\n author = {Simon Spinner},\n title = {{LibReDE - A library for Resource Demand Estimation}},\n howpublished = {Technical Talk at SPEC DevOps Performance Working Group},\n days = {25},\n month = {July},\n year = {2014},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/912},\n}\n\n','\n\nSimon Spinner.\nLibReDE - A library for Resource Demand Estimation.\nTechnical Talk at SPEC DevOps Performance Working Group, July 2014.\n[ bib | slides  ] 
\n@misc{talk-Spinner-SPECdevops14,\nauthor = {Simon Spinner},\ntitle = {{LibReDE - A library for Resource Demand Estimation}},\nhowpublished = {Technical Talk at SPEC DevOps Performance Working Group},\ndays = {25},\nmonth = {July},\nyear = {2014},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/912}\n}\n
\n
\n','
\n@misc{talk-Spinner-SPECdevops14,\n  author = {Simon Spinner},\n  title = {{LibReDE - A library for Resource Demand Estimation}},\n  howpublished = {Technical Talk at SPEC DevOps Performance Working Group},\n  days = {25},\n  month = {July},\n  year = {2014},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/912}\n}\n
\n\n',NULL,'{LibReDE - A library for Resource Demand Estimation}',0,7,2014,7,NULL,NULL,NULL,'2015-11-26 09:48:52','2016-06-01 09:41:06',0),(913,'paper','RySiSiAschKoSch2016-dni-traffic-extraction-icpe2016','inproceedings','@inproceedings{RySiSiAschKoSch2016-dni-traffic-extraction-icpe2016,\n author = {Piotr Rygielski and Viliam Simko and Felix Sittner and Doris Aschenbrenner and Samuel Kounev and Klaus Schilling},\n title = {{Automated Extraction of Network Traffic Models Suitable for Performance Simulation}},\n year = {2016},\n month = {March},\n day = {12--18},\n pages = {27--35},\n doi = {http://dx.doi.org/10.1145/2851553.2851570},\n booktitle = {Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)},\n location = {Delft, The Netherlands},\n publisher = {ACM},\n abstract = {{Data centers are increasingly becoming larger and dynamic due to virtualization. In order to leverage the performance modeling and prediction techniques, such as Palladio Component Model or Descartes Modeling Language, in such a dynamic environments, it is necessary to automate the model extraction. Building and maintaining such models manually is not feasible anymore due to their size and the level of details. This paper is focused on traffic models that are an essential part of network infrastructure. Our goal is to decompose real traffic dumps into models suitable for performance prediction using Descartes Network Infrastructure modeling approach. The main challenge was to efficiently encode an arbitrary signal in the form of simple traffic generators while maintaining the shape of the original signal. We show that a typical 15 minute long tcpdump trace can be compressed to 0.4--15% of its original size whereas the relative median of extraction error is 0% for the most of the 69 examined traces.}},\n note = {{Acceptance rate (Full Paper): 19/57 = 33\\%}},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/913},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/913.pdf},\n url = {http://dl.acm.org/citation.cfm?doid=2851553.2851570},\n}\n\n','\n\nPiotr Rygielski, Viliam Simko, Felix Sittner, Doris Aschenbrenner, Samuel\nKounev, and Klaus Schilling.\nAutomated Extraction of Network Traffic Models Suitable for\nPerformance Simulation.\nIn Proceedings of the 7th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2016), Delft, The Netherlands, March 12-18,\n2016, pages 27-35. ACM.\nMarch 2016, Acceptance rate (Full Paper): 19/57 = 33%.\n[ bib | DOI | slides | http | .pdf | Abstract  ] 
\n@inproceedings{RySiSiAschKoSch2016-dni-traffic-extraction-icpe2016,\nauthor = {Piotr Rygielski and Viliam Simko and Felix Sittner and Doris Aschenbrenner and Samuel Kounev and Klaus Schilling},\ntitle = {{Automated Extraction of Network Traffic Models Suitable for Performance Simulation}},\nyear = {2016},\nmonth = {March},\nday = {12--18},\npages = {27--35},\ndoi = {http://dx.doi.org/10.1145/2851553.2851570},\nbooktitle = {Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)},\nlocation = {Delft, The Netherlands},\npublisher = {ACM},\nabstract = {{Data centers are increasingly becoming larger and dynamic due to virtualization. In order to leverage the performance modeling and prediction techniques, such as Palladio Component Model or Descartes Modeling Language, in such a dynamic environments, it is necessary to automate the model extraction. Building and maintaining such models manually is not feasible anymore due to their size and the level of details. This paper is focused on traffic models that are an essential part of network infrastructure. Our goal is to decompose real traffic dumps into models suitable for performance prediction using Descartes Network Infrastructure modeling approach. The main challenge was to efficiently encode an arbitrary signal in the form of simple traffic generators while maintaining the shape of the original signal. We show that a typical 15 minute long tcpdump trace can be compressed to 0.4--15% of its original size whereas the relative median of extraction error is 0% for the most of the 69 examined traces.}},\nnote = {{Acceptance rate (Full Paper): 19/57 = 33\\%}},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/913},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/913.pdf},\nurl = {http://dl.acm.org/citation.cfm?doid=2851553.2851570}\n}\n
\n
\nData centers are increasingly becoming larger and dynamic due to virtualization. In order to leverage the performance modeling and prediction techniques, such as Palladio Component Model or Descartes Modeling Language, in such a dynamic environments, it is necessary to automate the model extraction. Building and maintaining such models manually is not feasible anymore due to their size and the level of details. This paper is focused on traffic models that are an essential part of network infrastructure. Our goal is to decompose real traffic dumps into models suitable for performance prediction using Descartes Network Infrastructure modeling approach. The main challenge was to efficiently encode an arbitrary signal in the form of simple traffic generators while maintaining the shape of the original signal. We show that a typical 15 minute long tcpdump trace can be compressed to 0.4-15% of its original size whereas the relative median of extraction error is 0% for the most of the 69 examined traces.\n
\n','
\n@inproceedings{RySiSiAschKoSch2016-dni-traffic-extraction-icpe2016,\n  author = {Piotr Rygielski and Viliam Simko and Felix Sittner and Doris Aschenbrenner and Samuel Kounev and Klaus Schilling},\n  title = {{Automated Extraction of Network Traffic Models Suitable for Performance Simulation}},\n  year = {2016},\n  month = {March},\n  day = {12--18},\n  pages = {27--35},\n  doi = {http://dx.doi.org/10.1145/2851553.2851570},\n  booktitle = {Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)},\n  location = {Delft, The Netherlands},\n  publisher = {ACM},\n  abstract = {{Data centers are increasingly becoming larger and dynamic due to virtualization. In order to leverage the performance modeling and prediction techniques, such as Palladio Component Model or Descartes Modeling Language, in such a dynamic environments, it is necessary to automate the model extraction. Building and maintaining such models manually is not feasible anymore due to their size and the level of details. This paper is focused on traffic models that are an essential part of network infrastructure. Our goal is to decompose real traffic dumps into models suitable for performance prediction using Descartes Network Infrastructure modeling approach. The main challenge was to efficiently encode an arbitrary signal in the form of simple traffic generators while maintaining the shape of the original signal. We show that a typical 15 minute long tcpdump trace can be compressed to 0.4--15% of its original size whereas the relative median of extraction error is 0% for the most of the 69 examined traces.}},\n  note = {{Acceptance rate (Full Paper): 19/57 = 33\\%}},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/913},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/913.pdf},\n  url = {http://dl.acm.org/citation.cfm?doid=2851553.2851570}\n}\n
\n\n','{Data centers are increasingly becoming larger and dynamic due to virtualization. In order to leverage the performance modeling and prediction techniques, such as Palladio Component Model or Descartes Modeling Language, in such a dynamic environments, it is necessary to automate the model extraction. Building and maintaining such models manually is not feasible anymore due to their size and the level of details. This paper is focused on traffic models that are an essential part of network infrastructure. Our goal is to decompose real traffic dumps into models suitable for performance prediction using Descartes Network Infrastructure modeling approach. The main challenge was to efficiently encode an arbitrary signal in the form of simple traffic generators while maintaining the shape of the original signal. We show that a typical 15 minute long tcpdump trace can be compressed to 0.4--15% of its original size whereas the relative median of extraction error is 0% for the most of the 69 examined traces.}','{Automated Extraction of Network Traffic Models Suitable for Performance Simulation}',0,3,2016,3,NULL,NULL,NULL,'2015-11-26 20:13:18','2016-06-01 09:41:06',0),(914,'paper','SpWaKo2015-WOSPC-ReferenceArchitecture','inproceedings','@inproceedings{SpWaKo2015-WOSPC-ReferenceArchitecture,\n author = {Simon Spinner and J\\\"{u}rgen Walter and Samuel Kounev},\n title = {{A Reference Architecture for Online Performance Model Extraction in Virtualized Environments}},\n booktitle = {{Proceedings of the 2016 Workshop on Challenges in Performance Methods for Software Development (WOSP-C\'16) co-located with 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\n year = {2016},\n location = {Delft, the Netherlands},\n month = {March},\n day = {12},\n note = {Accepted for publication},\n abstract = {Performance models can support decisions throughout the life-cycle of a software system. However, the manual construction of such performance models is a complex and time-consuming task requiring deep system knowledge. Therefore, automatic approaches for creating and updating performance models of a running system are necessary. Existing work focuses on single aspects of model extraction or proposes approaches specifically designed for a certain technology stack. In virtualized environments, we often see different applications based on diverse technology stacks sharing the same infrastructure. In order to enable online performance model extraction in such environments, we describe a new reference architecture for integrating different specialized model extraction solutions.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/914.pdf},\n}\n\n','\n\nSimon Spinner, Jürgen Walter, and Samuel Kounev.\nA Reference Architecture for Online Performance Model Extraction in\nVirtualized Environments.\nIn Proceedings of the 2016 Workshop on Challenges in\nPerformance Methods for Software Development (WOSP-C\'16) co-located with 7th\nACM/SPEC International Conference on Performance Engineering (ICPE 2016),\nDelft, the Netherlands, March 12, 2016.\nAccepted for publication.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{SpWaKo2015-WOSPC-ReferenceArchitecture,\nauthor = {Simon Spinner and J\\\"{u}rgen Walter and Samuel Kounev},\ntitle = {{A Reference Architecture for Online Performance Model Extraction in Virtualized Environments}},\nbooktitle = {{Proceedings of the 2016 Workshop on Challenges in Performance Methods for Software Development (WOSP-C\'16) co-located with 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\nyear = {2016},\nlocation = {Delft, the Netherlands},\nmonth = {March},\nday = {12},\nnote = {Accepted for publication},\nabstract = {Performance models can support decisions throughout the life-cycle of a software system. However, the manual construction of such performance models is a complex and time-consuming task requiring deep system knowledge. Therefore, automatic approaches for creating and updating performance models of a running system are necessary. Existing work focuses on single aspects of model extraction or proposes approaches specifically designed for a certain technology stack. In virtualized environments, we often see different applications based on diverse technology stacks sharing the same infrastructure. In order to enable online performance model extraction in such environments, we describe a new reference architecture for integrating different specialized model extraction solutions.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/914.pdf}\n}\n
\n
\nPerformance models can support decisions throughout the life-cycle of a software system. However, the manual construction of such performance models is a complex and time-consuming task requiring deep system knowledge. Therefore, automatic approaches for creating and updating performance models of a running system are necessary. Existing work focuses on single aspects of model extraction or proposes approaches specifically designed for a certain technology stack. In virtualized environments, we often see different applications based on diverse technology stacks sharing the same infrastructure. In order to enable online performance model extraction in such environments, we describe a new reference architecture for integrating different specialized model extraction solutions.\n
\n','
\n@inproceedings{SpWaKo2015-WOSPC-ReferenceArchitecture,\n  author = {Simon Spinner and J\\\"{u}rgen Walter and Samuel Kounev},\n  title = {{A Reference Architecture for Online Performance Model Extraction in Virtualized Environments}},\n  booktitle = {{Proceedings of the 2016 Workshop on Challenges in Performance Methods for Software Development (WOSP-C\'16) co-located with 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\n  year = {2016},\n  location = {Delft, the Netherlands},\n  month = {March},\n  day = {12},\n  note = {Accepted for publication},\n  abstract = {Performance models can support decisions throughout the life-cycle of a software system. However, the manual construction of such performance models is a complex and time-consuming task requiring deep system knowledge. Therefore, automatic approaches for creating and updating performance models of a running system are necessary. Existing work focuses on single aspects of model extraction or proposes approaches specifically designed for a certain technology stack. In virtualized environments, we often see different applications based on diverse technology stacks sharing the same infrastructure. In order to enable online performance model extraction in such environments, we describe a new reference architecture for integrating different specialized model extraction solutions.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/914.pdf}\n}\n
\n\n','Performance models can support decisions throughout the life-cycle of a software system. However, the manual construction of such performance models is a complex and time-consuming task requiring deep system knowledge. Therefore, automatic approaches for creating and updating performance models of a running system are necessary. Existing work focuses on single aspects of model extraction or proposes approaches specifically designed for a certain technology stack. In virtualized environments, we often see different applications based on diverse technology stacks sharing the same infrastructure. In order to enable online performance model extraction in such environments, we describe a new reference architecture for integrating different specialized model extraction solutions.','{A Reference Architecture for Online Performance Model Extraction in Virtualized Environments}',0,3,2016,3,NULL,NULL,NULL,'2015-12-16 14:24:04','2016-06-01 09:41:06',0),(915,'paper','WaHoKoOkKo2016-ICPE-DPE_Vision','inproceedings','@inproceedings{WaHoKoOkKo2016-ICPE-DPE_Vision,\n author = {J\\\"{u}rgen Walter and Andre van Hoorn and Heiko Koziolek and Dusan Okanovic and Samuel Kounev},\n title = {{Asking ``What?\'\', Automating the ``How?\'\': The Vision of Declarative Performance Engineering}},\n booktitle = {{Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\n year = {2016},\n location = {Delft, the Netherlands},\n month = {March},\n day = {12},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/915.pdf},\n abstract = {Over the past decades, various methods, techniques, and tools for modeling and evaluating performance properties of software systems have been proposed covering the entire software life cycle. However, the application of performance engineering approaches to solve a given user concern is still rather challenging and requires expert knowledge and experience. There are no recipes on how to select, configure, and execute suitable methods, tools, and techniques allowing to address the user concerns. In this paper, we describe our vision of Declarative Performance Engineering (DPE), which aims to decouple the description of the user concerns to be solved (performance questions and goals) from the task of selecting and applying a specific solution approach. The strict separation of ``what\'\' versus ``how\'\' enables the development of different techniques and algorithms to automatically select and apply a suitable approach for a given scenario. The goal is to hide complexity from the user by allowing users to express their concerns and goals without requiring any knowledge about performance engineering techniques. Towards realizing the DPE vision, we discuss the different requirements and propose a reference architecture for implementing and integrating respective methods, algorithms, and tooling.},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/915},\n}\n\n','\n\nJürgen Walter, Andre van Hoorn, Heiko Koziolek, Dusan Okanovic, and Samuel\nKounev.\nAsking “What?”, Automating the “How?”: The Vision of Declarative\nPerformance Engineering.\nIn Proceedings of the 7th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2016), Delft, the Netherlands, March 12,\n2016.\n[ bib | slides | .pdf | Abstract  ] 
\n@inproceedings{WaHoKoOkKo2016-ICPE-DPE_Vision,\nauthor = {J\\\"{u}rgen Walter and Andre van Hoorn and Heiko Koziolek and Dusan Okanovic and Samuel Kounev},\ntitle = {{Asking ``What?\'\', Automating the ``How?\'\': The Vision of Declarative Performance Engineering}},\nbooktitle = {{Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\nyear = {2016},\nlocation = {Delft, the Netherlands},\nmonth = {March},\nday = {12},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/915.pdf},\nabstract = {Over the past decades, various methods, techniques, and tools for modeling and evaluating performance properties of software systems have been proposed covering the entire software life cycle. However, the application of performance engineering approaches to solve a given user concern is still rather challenging and requires expert knowledge and experience. There are no recipes on how to select, configure, and execute suitable methods, tools, and techniques allowing to address the user concerns. In this paper, we describe our vision of Declarative Performance Engineering (DPE), which aims to decouple the description of the user concerns to be solved (performance questions and goals) from the task of selecting and applying a specific solution approach. The strict separation of ``what\'\' versus ``how\'\' enables the development of different techniques and algorithms to automatically select and apply a suitable approach for a given scenario. The goal is to hide complexity from the user by allowing users to express their concerns and goals without requiring any knowledge about performance engineering techniques. Towards realizing the DPE vision, we discuss the different requirements and propose a reference architecture for implementing and integrating respective methods, algorithms, and tooling.},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/915}\n}\n
\n
\nOver the past decades, various methods, techniques, and tools for modeling and evaluating performance properties of software systems have been proposed covering the entire software life cycle. However, the application of performance engineering approaches to solve a given user concern is still rather challenging and requires expert knowledge and experience. There are no recipes on how to select, configure, and execute suitable methods, tools, and techniques allowing to address the user concerns. In this paper, we describe our vision of Declarative Performance Engineering (DPE), which aims to decouple the description of the user concerns to be solved (performance questions and goals) from the task of selecting and applying a specific solution approach. The strict separation of “what” versus “how” enables the development of different techniques and algorithms to automatically select and apply a suitable approach for a given scenario. The goal is to hide complexity from the user by allowing users to express their concerns and goals without requiring any knowledge about performance engineering techniques. Towards realizing the DPE vision, we discuss the different requirements and propose a reference architecture for implementing and integrating respective methods, algorithms, and tooling.\n
\n','
\n@inproceedings{WaHoKoOkKo2016-ICPE-DPE_Vision,\n  author = {J\\\"{u}rgen Walter and Andre van Hoorn and Heiko Koziolek and Dusan Okanovic and Samuel Kounev},\n  title = {{Asking ``What?\'\', Automating the ``How?\'\': The Vision of Declarative Performance Engineering}},\n  booktitle = {{Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\n  year = {2016},\n  location = {Delft, the Netherlands},\n  month = {March},\n  day = {12},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/915.pdf},\n  abstract = {Over the past decades, various methods, techniques, and tools for modeling and evaluating performance properties of software systems have been proposed covering the entire software life cycle. However, the application of performance engineering approaches to solve a given user concern is still rather challenging and requires expert knowledge and experience. There are no recipes on how to select, configure, and execute suitable methods, tools, and techniques allowing to address the user concerns. In this paper, we describe our vision of Declarative Performance Engineering (DPE), which aims to decouple the description of the user concerns to be solved (performance questions and goals) from the task of selecting and applying a specific solution approach. The strict separation of ``what\'\' versus ``how\'\' enables the development of different techniques and algorithms to automatically select and apply a suitable approach for a given scenario. The goal is to hide complexity from the user by allowing users to express their concerns and goals without requiring any knowledge about performance engineering techniques. Towards realizing the DPE vision, we discuss the different requirements and propose a reference architecture for implementing and integrating respective methods, algorithms, and tooling.},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/915}\n}\n
\n\n','Over the past decades, various methods, techniques, and tools for modeling and evaluating performance properties of software systems have been proposed covering the entire software life cycle. However, the application of performance engineering approaches to solve a given user concern is still rather challenging and requires expert knowledge and experience. There are no recipes on how to select, configure, and execute suitable methods, tools, and techniques allowing to address the user concerns. In this paper, we describe our vision of Declarative Performance Engineering (DPE), which aims to decouple the description of the user concerns to be solved (performance questions and goals) from the task of selecting and applying a specific solution approach. The strict separation of ``what\'\' versus ``how\'\' enables the development of different techniques and algorithms to automatically select and apply a suitable approach for a given scenario. The goal is to hide complexity from the user by allowing users to express their concerns and goals without requiring any knowledge about performance engineering techniques. Towards realizing the DPE vision, we discuss the different requirements and propose a reference architecture for implementing and integrating respective methods, algorithms, and tooling.','{Asking ``What?\'\', Automating the ``How?\'\': The Vision of Declarative Performance Engineering}',0,3,2016,3,NULL,NULL,NULL,'2016-01-11 15:32:13','2016-06-01 09:41:06',0),(916,'paper','PMX2015','article','@article{PMX2015,\n author = {einBLICK (Robert Emmerich)},\n title = {{Leistung von IT-Systemen vorhersagen}},\n year = {2015},\n month = {December},\n day = {23},\n pages = {1-2},\n url = {http://www.presse.uni-wuerzburg.de/einblick/single_special/artikel/leistung-von-it-systemen-vorhersagen/},\n comment = {Samuel Kounev and J\\\"{u}rgen Walter},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/916.pdf},\n}\n\n','\n\neinBLICK (Robert Emmerich).\nLeistung von IT-Systemen vorhersagen.\npages 1-2, December 2015.\n[ bib | http | .pdf  ] 
\n@article{PMX2015,\nauthor = {einBLICK (Robert Emmerich)},\ntitle = {{Leistung von IT-Systemen vorhersagen}},\nyear = {2015},\nmonth = {December},\nday = {23},\npages = {1-2},\nurl = {http://www.presse.uni-wuerzburg.de/einblick/single_special/artikel/leistung-von-it-systemen-vorhersagen/},\ncomment = {Samuel Kounev and J\\\"{u}rgen Walter},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/916.pdf}\n}\n
\n
\n','
\n@article{PMX2015,\n  author = {einBLICK (Robert Emmerich)},\n  title = {{Leistung von IT-Systemen vorhersagen}},\n  year = {2015},\n  month = {December},\n  day = {23},\n  pages = {1-2},\n  url = {http://www.presse.uni-wuerzburg.de/einblick/single_special/artikel/leistung-von-it-systemen-vorhersagen/},\n  comment = {Samuel Kounev and J\\\"{u}rgen Walter},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/916.pdf}\n}\n
\n\n',NULL,'{Leistung von IT-Systemen vorhersagen}',0,12,2015,12,NULL,NULL,NULL,'2016-01-11 17:17:27','2016-06-01 09:41:06',0),(919,'paper','Demler2015','mastersthesis','@mastersthesis{Demler2015,\n author = {Jakob Demler},\n address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n title = {{Compiling Handlebars to C#}},\n type = {{Bachelor Thesis}},\n school = {University of W\\\"{u}rzburg},\n year = {2015},\n month = {December},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/919},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/919.pdf},\n}\n\n','\n\nJakob Demler.\nCompiling Handlebars to C#.\nBachelor Thesis, University of Würzburg, Am Hubland,\nInformatikgebäude, 97074 Würzburg, Germany, December 2015.\n[ bib | slides | .pdf  ] 
\n@mastersthesis{Demler2015,\nauthor = {Jakob Demler},\naddress = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\ntitle = {{Compiling Handlebars to C#}},\ntype = {{Bachelor Thesis}},\nschool = {University of W\\\"{u}rzburg},\nyear = {2015},\nmonth = {December},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/919},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/919.pdf}\n}\n
\n
\n','
\n@mastersthesis{Demler2015,\n  author = {Jakob Demler},\n  address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n  title = {{Compiling Handlebars to C#}},\n  type = {{Bachelor Thesis}},\n  school = {University of W\\\"{u}rzburg},\n  year = {2015},\n  month = {December},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/919},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/919.pdf}\n}\n
\n\n',NULL,'{Compiling Handlebars to C#}',0,12,2015,12,NULL,NULL,NULL,'2016-01-13 15:36:27','2016-06-01 09:41:06',0),(920,'talk','talk-Kounev-DATEV_TrendScout2015b','misc','@misc{talk-Kounev-DATEV_TrendScout2015b,\n author = {Samuel Kounev},\n title = {{Industrie 4.1: So wird die Produktion wirklich smart!}},\n howpublished = {Invited Talk, DATEV Trendscout, N\\\"urnberg, Germany},\n days = {19},\n month = {Nov},\n year = {2015},\n}\n\n','\n\nSamuel Kounev.\nIndustrie 4.1: So wird die Produktion wirklich smart!\nInvited Talk, DATEV Trendscout, Nürnberg, Germany, Nov 2015.\n[ bib  ] 
\n@misc{talk-Kounev-DATEV_TrendScout2015b,\nauthor = {Samuel Kounev},\ntitle = {{Industrie 4.1: So wird die Produktion wirklich smart!}},\nhowpublished = {Invited Talk, DATEV Trendscout, N\\\"urnberg, Germany},\ndays = {19},\nmonth = {Nov},\nyear = {2015}\n}\n
\n
\n','
\n@misc{talk-Kounev-DATEV_TrendScout2015b,\n  author = {Samuel Kounev},\n  title = {{Industrie 4.1: So wird die Produktion wirklich smart!}},\n  howpublished = {Invited Talk, DATEV Trendscout, N\\\"urnberg, Germany},\n  days = {19},\n  month = {Nov},\n  year = {2015}\n}\n
\n\n',NULL,'{Industrie 4.1: So wird die Produktion wirklich smart!}',0,11,2015,11,NULL,NULL,NULL,'2016-01-16 18:15:19','2016-06-01 09:41:06',0),(921,'talk','talk-Kounev-InvStutt15','misc','@misc{talk-Kounev-InvStutt15,\n author = {Samuel Kounev},\n title = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\n howpublished = {Invited Talk, Faculty of Computer Science, Electrical Engineering and Information Technology, University of Stuttgart, Stuttgart, Germany},\n days = {23},\n month = {July},\n year = {2015},\n}\n\n','\n\nSamuel Kounev.\nIngenieurmässige Entwicklung verlässlicher und effizienter\nSoftware-Systeme.\nInvited Talk, Faculty of Computer Science, Electrical Engineering and\nInformation Technology, University of Stuttgart, Stuttgart, Germany, July\n2015.\n[ bib  ] 
\n@misc{talk-Kounev-InvStutt15,\nauthor = {Samuel Kounev},\ntitle = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\nhowpublished = {Invited Talk, Faculty of Computer Science, Electrical Engineering and Information Technology, University of Stuttgart, Stuttgart, Germany},\ndays = {23},\nmonth = {July},\nyear = {2015}\n}\n
\n
\n','
\n@misc{talk-Kounev-InvStutt15,\n  author = {Samuel Kounev},\n  title = {{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}},\n  howpublished = {Invited Talk, Faculty of Computer Science, Electrical Engineering and Information Technology, University of Stuttgart, Stuttgart, Germany},\n  days = {23},\n  month = {July},\n  year = {2015}\n}\n
\n\n',NULL,'{Ingenieurm\\\"{a}ssige Entwicklung verl\\\"{a}sslicher und effizienter Software-Systeme}',0,7,2015,7,NULL,NULL,NULL,'2016-01-16 18:23:14','2016-06-01 09:41:06',0),(922,'talk','talk-Kounev-InvFAU16','misc','@misc{talk-Kounev-InvFAU16,\n author = {Samuel Kounev},\n title = {{Model-Based Approach to Designing Self-Aware IT Systems and Infrastructures}},\n howpublished = {Invited Talk (Kolloquiumsvortrag), Department Informatik, Friedrich-Alexander-Universit\\\"{a}t Erlangen-N\\\"{u}rnberg, Erlangen, Germany},\n days = {25},\n month = {Jan},\n year = {2016},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/922},\n}\n\n','\n\nSamuel Kounev.\nModel-Based Approach to Designing Self-Aware IT Systems and\nInfrastructures.\nInvited Talk (Kolloquiumsvortrag), Department Informatik,\nFriedrich-Alexander-Universität Erlangen-Nürnberg, Erlangen, Germany,\nJan 2016.\n[ bib | slides  ] 
\n@misc{talk-Kounev-InvFAU16,\nauthor = {Samuel Kounev},\ntitle = {{Model-Based Approach to Designing Self-Aware IT Systems and Infrastructures}},\nhowpublished = {Invited Talk (Kolloquiumsvortrag), Department Informatik, Friedrich-Alexander-Universit\\\"{a}t Erlangen-N\\\"{u}rnberg, Erlangen, Germany},\ndays = {25},\nmonth = {Jan},\nyear = {2016},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/922}\n}\n
\n
\n','
\n@misc{talk-Kounev-InvFAU16,\n  author = {Samuel Kounev},\n  title = {{Model-Based Approach to Designing Self-Aware IT Systems and Infrastructures}},\n  howpublished = {Invited Talk (Kolloquiumsvortrag), Department Informatik, Friedrich-Alexander-Universit\\\"{a}t Erlangen-N\\\"{u}rnberg, Erlangen, Germany},\n  days = {25},\n  month = {Jan},\n  year = {2016},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/922}\n}\n
\n\n',NULL,'{Model-Based Approach to Designing Self-Aware IT Systems and Infrastructures}',0,1,2016,1,NULL,NULL,NULL,'2016-01-16 18:27:35','2016-06-01 09:41:06',0),(923,'talk','Talk-vanHoKo-SPP1593-2016','misc','@misc{Talk-vanHoKo-SPP1593-2016,\n address = {Hannover, Germany},\n author = {Andr\\\'{e} van Hoorn and Samuel Kounev and Dusan Okanovi\\\'{c} and J\\\"{u}rgen Walter},\n howpublished = {Renewal Kickoff Workshop of the DFG Priority Programme 1593, Hannover, January 14-15, 2016},\n title = {{DECLARE: Declarative Performance Engineering}},\n year = {2016},\n month = {January},\n days = {14},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/923},\n}\n\n','\n\nAndré van Hoorn, Samuel Kounev, Dusan Okanović, and Jürgen Walter.\nDECLARE: Declarative Performance Engineering.\nRenewal Kickoff Workshop of the DFG Priority Programme 1593,\nHannover, January 14-15, 2016, January 2016.\n[ bib | slides  ] 
\n@misc{Talk-vanHoKo-SPP1593-2016,\naddress = {Hannover, Germany},\nauthor = {Andr\\\'{e} van Hoorn and Samuel Kounev and Dusan Okanovi\\\'{c} and J\\\"{u}rgen Walter},\nhowpublished = {Renewal Kickoff Workshop of the DFG Priority Programme 1593, Hannover, January 14-15, 2016},\ntitle = {{DECLARE: Declarative Performance Engineering}},\nyear = {2016},\nmonth = {January},\ndays = {14},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/923}\n}\n
\n
\n','
\n@misc{Talk-vanHoKo-SPP1593-2016,\n  address = {Hannover, Germany},\n  author = {Andr\\\'{e} van Hoorn and Samuel Kounev and Dusan Okanovi\\\'{c} and J\\\"{u}rgen Walter},\n  howpublished = {Renewal Kickoff Workshop of the DFG Priority Programme 1593, Hannover, January 14-15, 2016},\n  title = {{DECLARE: Declarative Performance Engineering}},\n  year = {2016},\n  month = {January},\n  days = {14},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/923}\n}\n
\n\n',NULL,'{DECLARE: Declarative Performance Engineering}',0,1,2016,1,NULL,NULL,NULL,'2016-01-16 18:40:08','2016-06-01 09:41:06',0),(924,'paper','CaSpWa2016-ICPE-AutomatedParameterizationTutorial','inproceedings','@inproceedings{CaSpWa2016-ICPE-AutomatedParameterizationTutorial,\n author = {Giuliano Casale and Simon Spinner and Weikun Wang},\n title = {{Automated Parameterization of Performance Models from Measurements}},\n titleaddon = {{(Tutorial Paper)}},\n year = {2016},\n month = {March},\n day = {12},\n location = {Delft, the Netherlands},\n booktitle = {{Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\n abstract = {Estimating parameters of performance models from empirical measurements is a critical task, which often has a major influence on the predictive accuracy of a model. This tutorial presents the problem of parameter estimation in queueing systems and queueing networks. The focus is on reliable estimation of the {\\em arrival rates} of the requests and of the {\\em service demands} they place at the servers. The tutorial covers common estimation techniques such as regression methods, maximum-likelihood estimation, and moment-matching, discussing their sensitivity with respect to data and model characteristics. The tutorial also demonstrates the automated estimation of model parameters using new open source tools.},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/924.pdf},\n}\n\n','\n\nGiuliano Casale, Simon Spinner, and Weikun Wang.\nAutomated Parameterization of Performance Models from Measurements\n(Tutorial Paper).\nIn Proceedings of the 7th ACM/SPEC International Conference on\nPerformance Engineering (ICPE 2016), Delft, the Netherlands, March 12,\n2016.\n[ bib | .pdf | Abstract  ] 
\n@inproceedings{CaSpWa2016-ICPE-AutomatedParameterizationTutorial,\nauthor = {Giuliano Casale and Simon Spinner and Weikun Wang},\ntitle = {{Automated Parameterization of Performance Models from Measurements}},\ntitleaddon = {{(Tutorial Paper)}},\nyear = {2016},\nmonth = {March},\nday = {12},\nlocation = {Delft, the Netherlands},\nbooktitle = {{Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\nabstract = {Estimating parameters of performance models from empirical measurements is a critical task, which often has a major influence on the predictive accuracy of a model. This tutorial presents the problem of parameter estimation in queueing systems and queueing networks. The focus is on reliable estimation of the {\\em arrival rates} of the requests and of the {\\em service demands} they place at the servers. The tutorial covers common estimation techniques such as regression methods, maximum-likelihood estimation, and moment-matching, discussing their sensitivity with respect to data and model characteristics. The tutorial also demonstrates the automated estimation of model parameters using new open source tools.},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/924.pdf}\n}\n
\n
\nEstimating parameters of performance models from empirical measurements is a critical task, which often has a major influence on the predictive accuracy of a model. This tutorial presents the problem of parameter estimation in queueing systems and queueing networks. The focus is on reliable estimation of the arrival rates of the requests and of the service demands they place at the servers. The tutorial covers common estimation techniques such as regression methods, maximum-likelihood estimation, and moment-matching, discussing their sensitivity with respect to data and model characteristics. The tutorial also demonstrates the automated estimation of model parameters using new open source tools.\n
\n','
\n@inproceedings{CaSpWa2016-ICPE-AutomatedParameterizationTutorial,\n  author = {Giuliano Casale and Simon Spinner and Weikun Wang},\n  title = {{Automated Parameterization of Performance Models from Measurements}},\n  titleaddon = {{(Tutorial Paper)}},\n  year = {2016},\n  month = {March},\n  day = {12},\n  location = {Delft, the Netherlands},\n  booktitle = {{Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\n  abstract = {Estimating parameters of performance models from empirical measurements is a critical task, which often has a major influence on the predictive accuracy of a model. This tutorial presents the problem of parameter estimation in queueing systems and queueing networks. The focus is on reliable estimation of the {\\em arrival rates} of the requests and of the {\\em service demands} they place at the servers. The tutorial covers common estimation techniques such as regression methods, maximum-likelihood estimation, and moment-matching, discussing their sensitivity with respect to data and model characteristics. The tutorial also demonstrates the automated estimation of model parameters using new open source tools.},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/924.pdf}\n}\n
\n\n','Estimating parameters of performance models from empirical measurements is a critical task, which often has a major influence on the predictive accuracy of a model. This tutorial presents the problem of parameter estimation in queueing systems and queueing networks. The focus is on reliable estimation of the {\\em arrival rates} of the requests and of the {\\em service demands} they place at the servers. The tutorial covers common estimation techniques such as regression methods, maximum-likelihood estimation, and moment-matching, discussing their sensitivity with respect to data and model characteristics. The tutorial also demonstrates the automated estimation of model parameters using new open source tools.','{Automated Parameterization of Performance Models from Measurements}',0,3,2016,3,NULL,NULL,NULL,'2016-01-17 15:28:38','2016-06-01 09:41:06',0),(925,'paper','Schreck2015','mastersthesis','@mastersthesis{Schreck2015,\n author = {Marco Schreck},\n address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n title = {{Benchmarking Energy Efficiency of Servers in Virtualized Environments}},\n type = {{Master Thesis}},\n school = {University of W\\\"{u}rzburg},\n year = {2015},\n month = {December},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/925.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/925},\n}\n\n','\n\nMarco Schreck.\nBenchmarking Energy Efficiency of Servers in Virtualized\nEnvironments.\nMaster Thesis, University of Würzburg, Am Hubland,\nInformatikgebäude, 97074 Würzburg, Germany, December 2015.\n[ bib | slides | .pdf  ] 
\n@mastersthesis{Schreck2015,\nauthor = {Marco Schreck},\naddress = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\ntitle = {{Benchmarking Energy Efficiency of Servers in Virtualized Environments}},\ntype = {{Master Thesis}},\nschool = {University of W\\\"{u}rzburg},\nyear = {2015},\nmonth = {December},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/925.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/925}\n}\n
\n
\n','
\n@mastersthesis{Schreck2015,\n  author = {Marco Schreck},\n  address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n  title = {{Benchmarking Energy Efficiency of Servers in Virtualized Environments}},\n  type = {{Master Thesis}},\n  school = {University of W\\\"{u}rzburg},\n  year = {2015},\n  month = {December},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/925.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/925}\n}\n
\n\n',NULL,'{Benchmarking Energy Efficiency of Servers in Virtualized Environments}',0,12,2015,12,NULL,NULL,NULL,'2016-01-21 13:35:05','2016-06-01 09:41:06',0),(926,'paper','KoHuBrZh2016-IEEEComputer-Descartes','article','@article{KoHuBrZh2016-IEEEComputer-Descartes,\n author = {Samuel Kounev and Nikolaus Huber and Fabian Brosig and Xiaoyun Zhu},\n journal = {IEEE Computer Magazine},\n title = {{Model-Based Approach to Designing Self-Aware IT Systems and Infrastructures}},\n year = {2016},\n publisher = {IEEE},\n note = {Accepted for Publication, To appear in 2016},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/926.pdf},\n}\n\n','\n\nSamuel Kounev, Nikolaus Huber, Fabian Brosig, and Xiaoyun Zhu.\nModel-Based Approach to Designing Self-Aware IT Systems and\nInfrastructures.\nIEEE Computer Magazine, 2016, IEEE.\nAccepted for Publication, To appear in 2016.\n[ bib | .pdf  ] 
\n@article{KoHuBrZh2016-IEEEComputer-Descartes,\nauthor = {Samuel Kounev and Nikolaus Huber and Fabian Brosig and Xiaoyun Zhu},\njournal = {IEEE Computer Magazine},\ntitle = {{Model-Based Approach to Designing Self-Aware IT Systems and Infrastructures}},\nyear = {2016},\npublisher = {IEEE},\nnote = {Accepted for Publication, To appear in 2016},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/926.pdf}\n}\n
\n
\n','
\n@article{KoHuBrZh2016-IEEEComputer-Descartes,\n  author = {Samuel Kounev and Nikolaus Huber and Fabian Brosig and Xiaoyun Zhu},\n  journal = {IEEE Computer Magazine},\n  title = {{Model-Based Approach to Designing Self-Aware IT Systems and Infrastructures}},\n  year = {2016},\n  publisher = {IEEE},\n  note = {Accepted for Publication, To appear in 2016},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/926.pdf}\n}\n
\n\n',NULL,'{Model-Based Approach to Designing Self-Aware IT Systems and Infrastructures}',0,0,2016,0,NULL,NULL,NULL,'2016-01-23 10:35:14','2016-06-01 09:41:06',0),(927,'paper','Leonhardt2015','mastersthesis','@mastersthesis{Leonhardt2015,\n author = {Alexander Leonhardt},\n address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n school = {University of W\\\"urzburg},\n title = {{Quantification of the Impact of Transient Behaviors of Intrusion Detection Systems on Evaluation Metrics}},\n year = {2015},\n type = {{Bachelor Thesis}},\n}\n\n','\n\nAlexander Leonhardt.\nQuantification of the Impact of Transient Behaviors of Intrusion\nDetection Systems on Evaluation Metrics.\nBachelor Thesis, University of Würzburg, Am Hubland,\nInformatikgebäude, 97074 Würzburg, Germany, 2015.\n[ bib  ] 
\n@mastersthesis{Leonhardt2015,\nauthor = {Alexander Leonhardt},\naddress = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\nschool = {University of W\\\"urzburg},\ntitle = {{Quantification of the Impact of Transient Behaviors of Intrusion Detection Systems on Evaluation Metrics}},\nyear = {2015},\ntype = {{Bachelor Thesis}}\n}\n
\n
\n','
\n@mastersthesis{Leonhardt2015,\n  author = {Alexander Leonhardt},\n  address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n  school = {University of W\\\"urzburg},\n  title = {{Quantification of the Impact of Transient Behaviors of Intrusion Detection Systems on Evaluation Metrics}},\n  year = {2015},\n  type = {{Bachelor Thesis}}\n}\n
\n\n',NULL,'{Quantification of the Impact of Transient Behaviors of Intrusion Detection Systems on Evaluation Metrics}',0,0,2015,0,NULL,NULL,NULL,'2016-01-28 11:31:03','2016-06-01 09:41:06',0),(928,'paper','WvGb','article','@article{WvGb,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Computing zy with Maximum Accuracy},\n journal = {Computing 31, p. 185-189, 1983},\n year = {1983},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nComputing zy with maximum accuracy.\nComputing 31, p. 185-189, 1983, 1983.\n[ bib  ] 
\n@article{WvGb,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Computing zy with Maximum Accuracy},\njournal = {Computing 31, p. 185-189, 1983},\nyear = {1983},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGb,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Computing zy with Maximum Accuracy},\n  journal = {Computing 31, p. 185-189, 1983},\n  year = {1983},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Computing zy with Maximum Accuracy',0,0,1983,0,NULL,NULL,NULL,'2016-02-20 23:18:58','2016-06-01 09:41:06',0),(929,'paper','WvGc','article','@article{WvGc,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {An Introduction to MATRIX PASCAL: A PASCAL Extension for Scientific Computation},\n journal = {in Kulisch/Miranker (Hrsg): A New Approach to Scientific Computation, Academic Press, 1983},\n year = {1983},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nAn introduction to matrix pascal: A pascal extension for scientific\ncomputation.\nin Kulisch/Miranker (Hrsg): A New Approach to Scientific\nComputation, Academic Press, 1983, 1983.\n[ bib  ] 
\n@article{WvGc,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {An Introduction to MATRIX PASCAL: A PASCAL Extension for Scientific Computation},\njournal = {in Kulisch/Miranker (Hrsg): A New Approach to Scientific Computation, Academic Press, 1983},\nyear = {1983},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGc,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {An Introduction to MATRIX PASCAL: A PASCAL Extension for Scientific Computation},\n  journal = {in Kulisch/Miranker (Hrsg): A New Approach to Scientific Computation, Academic Press, 1983},\n  year = {1983},\n  tags = {Reliability}\n}\n
\n\n',NULL,'An Introduction to MATRIX PASCAL: A PASCAL Extension for Scientific Computation',0,0,1983,0,NULL,NULL,NULL,'2016-02-20 23:18:58','2016-06-01 09:41:06',0),(930,'paper','WvGd','article','@article{WvGd,\n author = {G. Bohlender and K. Gr\"{u}ner and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Realisierung einer optimalen Arithmetik},\n journal = {Elektron. Rechenanlagen 24, H.2, p. 68-72, 1982},\n year = {1982},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, K. Gr\"uner, and Jürgen Wolff von Gudenberg.\nRealisierung einer optimalen arithmetik.\nElektron. Rechenanlagen 24, H.2, p. 68-72, 1982, 1982.\n[ bib  ] 
\n@article{WvGd,\nauthor = {G. Bohlender and K. Gr\"{u}ner and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Realisierung einer optimalen Arithmetik},\njournal = {Elektron. Rechenanlagen 24, H.2, p. 68-72, 1982},\nyear = {1982},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGd,\n  author = {G. Bohlender and K. Gr\"{u}ner and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Realisierung einer optimalen Arithmetik},\n  journal = {Elektron. Rechenanlagen 24, H.2, p. 68-72, 1982},\n  year = {1982},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Realisierung einer optimalen Arithmetik',0,0,1982,0,NULL,NULL,NULL,'2016-02-20 23:18:58','2016-06-01 09:41:06',0),(931,'paper','WvGe','article','@article{WvGe,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Berechnung maximal genauer Standardfunktionen mit einfacher Mantissenl\\\"{a}nge},\n journal = {Elektron. Rechenanlagen 26, H.5, p. 230 - 238, 1984},\n year = {1984},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nBerechnung maximal genauer standardfunktionen mit einfacher\nmantissenlänge.\nElektron. Rechenanlagen 26, H.5, p. 230 - 238, 1984, 1984.\n[ bib  ] 
\n@article{WvGe,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Berechnung maximal genauer Standardfunktionen mit einfacher Mantissenl\\\"{a}nge},\njournal = {Elektron. Rechenanlagen 26, H.5, p. 230 - 238, 1984},\nyear = {1984},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGe,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Berechnung maximal genauer Standardfunktionen mit einfacher Mantissenl\\\"{a}nge},\n  journal = {Elektron. Rechenanlagen 26, H.5, p. 230 - 238, 1984},\n  year = {1984},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Berechnung maximal genauer Standardfunktionen mit einfacher Mantissenl\\\"{a}nge',0,0,1984,0,NULL,NULL,NULL,'2016-02-20 23:18:58','2016-06-01 09:41:06',0),(932,'paper','WvGf','techreport','@techreport{WvGf,\n author = {G. Bohlender and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {PASCAL-SC: A PASCAL for Contemporary Scientific Computation},\n institution = {IBM Research Report, RC 9009, 1981},\n year = {1981},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, K. Gr\"uner, E. Kaucher, R. Klatte, W. Krämer, U. Kulisch,\nW. L. Miranker, S. M. Rump, Ch. Ullrich, and Jürgen Wolff von Gudenberg.\nPascal-sc: A pascal for contemporary scientific computation.\nTechnical report, IBM Research Report, RC 9009, 1981, 1981.\n[ bib  ] 
\n@techreport{WvGf,\nauthor = {G. Bohlender and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {PASCAL-SC: A PASCAL for Contemporary Scientific Computation},\ninstitution = {IBM Research Report, RC 9009, 1981},\nyear = {1981},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGf,\n  author = {G. Bohlender and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {PASCAL-SC: A PASCAL for Contemporary Scientific Computation},\n  institution = {IBM Research Report, RC 9009, 1981},\n  year = {1981},\n  tags = {Reliability}\n}\n
\n\n',NULL,'PASCAL-SC: A PASCAL for Contemporary Scientific Computation',0,0,1981,0,NULL,NULL,NULL,'2016-02-20 23:18:58','2016-06-01 09:41:06',0),(933,'paper','WvGg','article','@article{WvGg,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Standard functions with maximum accuracy computed in single precision arithmetic},\n journal = {IMACS 1985 Trans. on Scientific Computation, Vol. 2, Computer Systems: Performance and Simulation, North-Holland, 1986},\n year = {1986},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nStandard functions with maximum accuracy computed in single precision\narithmetic.\nIMACS 1985 Trans. on Scientific Computation, Vol. 2, Computer\nSystems: Performance and Simulation, North-Holland, 1986, 1986.\n[ bib  ] 
\n@article{WvGg,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Standard functions with maximum accuracy computed in single precision arithmetic},\njournal = {IMACS 1985 Trans. on Scientific Computation, Vol. 2, Computer Systems: Performance and Simulation, North-Holland, 1986},\nyear = {1986},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGg,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Standard functions with maximum accuracy computed in single precision arithmetic},\n  journal = {IMACS 1985 Trans. on Scientific Computation, Vol. 2, Computer Systems: Performance and Simulation, North-Holland, 1986},\n  year = {1986},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Standard functions with maximum accuracy computed in single precision arithmetic',0,0,1986,0,NULL,NULL,NULL,'2016-02-20 23:18:58','2016-06-01 09:41:06',0),(934,'paper','WvGh','article','@article{WvGh,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Standard functions with maximum accuracy computed in single precision arithmetic},\n journal = {Proceedings of the 11th IMACS World Congress, Vol. 1, Oslo, p. 171-183, 1985},\n year = {1985},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nStandard functions with maximum accuracy computed in single precision\narithmetic.\nProceedings of the 11th IMACS World Congress, Vol. 1, Oslo, p.\n171-183, 1985, 1985.\n[ bib  ] 
\n@article{WvGh,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Standard functions with maximum accuracy computed in single precision arithmetic},\njournal = {Proceedings of the 11th IMACS World Congress, Vol. 1, Oslo, p. 171-183, 1985},\nyear = {1985},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGh,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Standard functions with maximum accuracy computed in single precision arithmetic},\n  journal = {Proceedings of the 11th IMACS World Congress, Vol. 1, Oslo, p. 171-183, 1985},\n  year = {1985},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Standard functions with maximum accuracy computed in single precision arithmetic',0,0,1985,0,NULL,NULL,NULL,'2016-02-20 23:18:58','2016-06-01 09:41:06',0),(935,'paper','WvGi','article','@article{WvGi,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Floating-point Computation in PASCAL-SC with Verified Results},\n journal = {Lecture Notes in Computer Science 204, Eurocal \'85, p. 322 - 324, Springer 1985},\n year = {1985},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nFloating-point computation in pascal-sc with verified results.\nLecture Notes in Computer Science 204, Eurocal \'85, p. 322 -\n324, Springer 1985, 1985.\n[ bib  ] 
\n@article{WvGi,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Floating-point Computation in PASCAL-SC with Verified Results},\njournal = {Lecture Notes in Computer Science 204, Eurocal \'85, p. 322 - 324, Springer 1985},\nyear = {1985},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGi,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Floating-point Computation in PASCAL-SC with Verified Results},\n  journal = {Lecture Notes in Computer Science 204, Eurocal \'85, p. 322 - 324, Springer 1985},\n  year = {1985},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Floating-point Computation in PASCAL-SC with Verified Results',0,0,1985,0,NULL,NULL,NULL,'2016-02-20 23:18:58','2016-06-01 09:41:06',0),(936,'paper','WvGj','article','@article{WvGj,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {PASCAL-SC Demonstration. Accurate Arithmetic for Verified Results},\n journal = {Lecture Notes in Computer Science 204, Eurocal \'85, p. 325-326, Springer 1985},\n year = {1985},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nPascal-sc demonstration. accurate arithmetic for verified results.\nLecture Notes in Computer Science 204, Eurocal \'85, p. 325-326,\nSpringer 1985, 1985.\n[ bib  ] 
\n@article{WvGj,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {PASCAL-SC Demonstration. Accurate Arithmetic for Verified Results},\njournal = {Lecture Notes in Computer Science 204, Eurocal \'85, p. 325-326, Springer 1985},\nyear = {1985},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGj,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {PASCAL-SC Demonstration. Accurate Arithmetic for Verified Results},\n  journal = {Lecture Notes in Computer Science 204, Eurocal \'85, p. 325-326, Springer 1985},\n  year = {1985},\n  tags = {Reliability}\n}\n
\n\n',NULL,'PASCAL-SC Demonstration. Accurate Arithmetic for Verified Results',0,0,1985,0,NULL,NULL,NULL,'2016-02-20 23:18:58','2016-06-01 09:41:06',0),(937,'paper','WvGk','article','@article{WvGk,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Rechnerarithmetik f\\\"{u}r wissenschaftliches Rechnen},\n journal = {PASCAL-SC, Computer Theoretikum und Praktikum f\\\"{u}r Physiker, Fachinformationszentrum Karlsruhe, p. 43-50, 1985},\n year = {1985},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nRechnerarithmetik für wissenschaftliches rechnen.\nPASCAL-SC, Computer Theoretikum und Praktikum für Physiker,\nFachinformationszentrum Karlsruhe, p. 43-50, 1985, 1985.\n[ bib  ] 
\n@article{WvGk,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Rechnerarithmetik f\\\"{u}r wissenschaftliches Rechnen},\njournal = {PASCAL-SC, Computer Theoretikum und Praktikum f\\\"{u}r Physiker, Fachinformationszentrum Karlsruhe, p. 43-50, 1985},\nyear = {1985},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGk,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Rechnerarithmetik f\\\"{u}r wissenschaftliches Rechnen},\n  journal = {PASCAL-SC, Computer Theoretikum und Praktikum f\\\"{u}r Physiker, Fachinformationszentrum Karlsruhe, p. 43-50, 1985},\n  year = {1985},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Rechnerarithmetik f\\\"{u}r wissenschaftliches Rechnen',0,0,1985,0,NULL,NULL,NULL,'2016-02-20 23:18:59','2016-06-01 09:41:07',0),(938,'paper','WvGl','techreport','@techreport{WvGl,\n author = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {MATRIX PASCAL},\n institution = {IBM Research Report, RC 9577, 1982},\n year = {1982},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, H. Böhm, K. Gr\"uner, E. Kaucher, R. Klatte, W. Krämer,\nU. Kulisch, W. L. Miranker, S. M. Rump, Ch. Ullrich, and Jürgen Wolff von\nGudenberg.\nMatrix pascal.\nTechnical report, IBM Research Report, RC 9577, 1982, 1982.\n[ bib  ] 
\n@techreport{WvGl,\nauthor = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {MATRIX PASCAL},\ninstitution = {IBM Research Report, RC 9577, 1982},\nyear = {1982},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGl,\n  author = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {MATRIX PASCAL},\n  institution = {IBM Research Report, RC 9577, 1982},\n  year = {1982},\n  tags = {Reliability}\n}\n
\n\n',NULL,'MATRIX PASCAL',0,0,1982,0,NULL,NULL,NULL,'2016-02-20 23:18:59','2016-06-01 09:41:07',0),(939,'paper','WvGm','article','@article{WvGm,\n author = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {MATRIX PASCAL},\n journal = {in Kulisch/Miranker (Hrsg): A New Approach to Scientific Computation. Academic Press, p. 312-384, 1983},\n year = {1983},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, H. Böhm, K. Gr\"uner, E. Kaucher, R. Klatte, W. Krämer,\nU. Kulisch, W. L. Miranker, S. M. Rump, Ch. Ullrich, and Jürgen Wolff von\nGudenberg.\nMatrix pascal.\nin Kulisch/Miranker (Hrsg): A New Approach to Scientific\nComputation. Academic Press, p. 312-384, 1983, 1983.\n[ bib  ] 
\n@article{WvGm,\nauthor = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {MATRIX PASCAL},\njournal = {in Kulisch/Miranker (Hrsg): A New Approach to Scientific Computation. Academic Press, p. 312-384, 1983},\nyear = {1983},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGm,\n  author = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {MATRIX PASCAL},\n  journal = {in Kulisch/Miranker (Hrsg): A New Approach to Scientific Computation. Academic Press, p. 312-384, 1983},\n  year = {1983},\n  tags = {Reliability}\n}\n
\n\n',NULL,'MATRIX PASCAL',0,0,1983,0,NULL,NULL,NULL,'2016-02-20 23:18:59','2016-06-01 09:41:07',0); -INSERT INTO `Entry` VALUES (940,'paper','WvGn','article','@article{WvGn,\n author = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Proposal for Arithmetic Specification in FORTRAN 8x},\n journal = {in B. Ford, J.C. Rault, F. Thomasset (Eds.): Tools Methods and Languages for Scientific and Engineering Computation, North-Holland, INRIA, 1984},\n year = {1984},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, H. Böhm, K. Gr\"uner, E. Kaucher, R. Klatte, W. Krämer,\nU. Kulisch, W. L. Miranker, S. M. Rump, Ch. Ullrich, and Jürgen Wolff von\nGudenberg.\nProposal for arithmetic specification in fortran 8x.\nin B. Ford, J.C. Rault, F. Thomasset (Eds.): Tools Methods and\nLanguages for Scientific and Engineering Computation, North-Holland, INRIA,\n1984, 1984.\n[ bib  ] 
\n@article{WvGn,\nauthor = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Proposal for Arithmetic Specification in FORTRAN 8x},\njournal = {in B. Ford, J.C. Rault, F. Thomasset (Eds.): Tools Methods and Languages for Scientific and Engineering Computation, North-Holland, INRIA, 1984},\nyear = {1984},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGn,\n  author = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Proposal for Arithmetic Specification in FORTRAN 8x},\n  journal = {in B. Ford, J.C. Rault, F. Thomasset (Eds.): Tools Methods and Languages for Scientific and Engineering Computation, North-Holland, INRIA, 1984},\n  year = {1984},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Proposal for Arithmetic Specification in FORTRAN 8x',0,0,1984,0,NULL,NULL,NULL,'2016-02-20 23:18:59','2016-06-01 09:41:07',0),(941,'paper','WvGo','article','@article{WvGo,\n author = {T. Urlaub and J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n title = {XOMT},\n journal = {Informatik Forschung und Entwicklung 11, p.218, 1996},\n year = {1996},\n tags = {Reliability},\n}\n\n','\n\nT. Urlaub, J. Seemann, and Jürgen Wolff von Gudenberg.\nXomt.\nInformatik Forschung und Entwicklung 11, p.218, 1996, 1996.\n[ bib  ] 
\n@article{WvGo,\nauthor = {T. Urlaub and J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {XOMT},\njournal = {Informatik Forschung und Entwicklung 11, p.218, 1996},\nyear = {1996},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGo,\n  author = {T. Urlaub and J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {XOMT},\n  journal = {Informatik Forschung und Entwicklung 11, p.218, 1996},\n  year = {1996},\n  tags = {Reliability}\n}\n
\n\n',NULL,'XOMT',0,0,1996,0,NULL,NULL,NULL,'2016-02-20 23:18:59','2016-06-01 09:41:07',0),(942,'paper','WvGp','techreport','@techreport{WvGp,\n author = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Proposal for Arithmetic Specification in FORTRAN 8x},\n institution = {Bericht des Instituts f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1982},\n year = {1982},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, H. Böhm, K. Gr\"uner, E. Kaucher, R. Klatte, W. Krämer,\nU. Kulisch, W. L. Miranker, S. M. Rump, Ch. Ullrich, and Jürgen Wolff von\nGudenberg.\nProposal for arithmetic specification in fortran 8x.\nTechnical report, Bericht des Instituts für Angewandte\nMathematik, Universität Karlsruhe, 1982, 1982.\n[ bib  ] 
\n@techreport{WvGp,\nauthor = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Proposal for Arithmetic Specification in FORTRAN 8x},\ninstitution = {Bericht des Instituts f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1982},\nyear = {1982},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGp,\n  author = {G. Bohlender and H. B\\\"{o}hm and K. Gr\"{u}ner and E. Kaucher and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and S. M. Rump and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Proposal for Arithmetic Specification in FORTRAN 8x},\n  institution = {Bericht des Instituts f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1982},\n  year = {1982},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Proposal for Arithmetic Specification in FORTRAN 8x',0,0,1982,0,NULL,NULL,NULL,'2016-02-20 23:18:59','2016-06-01 09:41:07',0),(943,'paper','WvGq','misc','@misc{WvGq,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Mathematics on Computers. A commented list of references},\n howpublished = {ESPRIT DIAMOND consortium, No. 03/2a-6/3/K2, 1987},\n year = {1987},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nMathematics on computers. a commented list of references.\nESPRIT DIAMOND consortium, No. 03/2a-6/3/K2, 1987, 1987.\n[ bib  ] 
\n@misc{WvGq,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Mathematics on Computers. A commented list of references},\nhowpublished = {ESPRIT DIAMOND consortium, No. 03/2a-6/3/K2, 1987},\nyear = {1987},\ntags = {Reliability}\n}\n
\n
\n','
\n@misc{WvGq,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Mathematics on Computers. A commented list of references},\n  howpublished = {ESPRIT DIAMOND consortium, No. 03/2a-6/3/K2, 1987},\n  year = {1987},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Mathematics on Computers. A commented list of references',0,0,1987,0,NULL,NULL,NULL,'2016-02-20 23:18:59','2016-06-01 09:41:07',0),(944,'paper','WvGr','article','@article{WvGr,\n author = {J. Seemann and T. Urlaub and J\\\"{u}rgen Wolff von Gudenberg},\n title = {XOMT - ein graphischer Editor f\\\"{u}r OMT-Objektmodelle},\n journal = {in Beitr\\\"{a}ge der GI-Fachtagung Softwaretechnik 95, Braunschweig, 1995, p.162},\n year = {1995},\n tags = {Reliability},\n}\n\n','\n\nJ. Seemann, T. Urlaub, and Jürgen Wolff von Gudenberg.\nXomt - ein graphischer editor für omt-objektmodelle.\nin Beiträge der GI-Fachtagung Softwaretechnik 95,\nBraunschweig, 1995, p.162, 1995.\n[ bib  ] 
\n@article{WvGr,\nauthor = {J. Seemann and T. Urlaub and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {XOMT - ein graphischer Editor f\\\"{u}r OMT-Objektmodelle},\njournal = {in Beitr\\\"{a}ge der GI-Fachtagung Softwaretechnik 95, Braunschweig, 1995, p.162},\nyear = {1995},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGr,\n  author = {J. Seemann and T. Urlaub and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {XOMT - ein graphischer Editor f\\\"{u}r OMT-Objektmodelle},\n  journal = {in Beitr\\\"{a}ge der GI-Fachtagung Softwaretechnik 95, Braunschweig, 1995, p.162},\n  year = {1995},\n  tags = {Reliability}\n}\n
\n\n',NULL,'XOMT - ein graphischer Editor f\\\"{u}r OMT-Objektmodelle',0,0,1995,0,NULL,NULL,NULL,'2016-02-20 23:18:59','2016-06-01 09:41:07',0),(945,'paper','WvGs','misc','@misc{WvGs,\n author = {M. Klingspor and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Modula-2O},\n howpublished = {An object-oriented extension of Modula-2, ISO Document ISO/IEC JTC1/SC22/WG13/D199, 1994},\n year = {1994},\n tags = {Reliability},\n}\n\n','\n\nM. Klingspor and Jürgen Wolff von Gudenberg.\nModula-2o.\nAn object-oriented extension of Modula-2, ISO Document ISO/IEC\nJTC1/SC22/WG13/D199, 1994, 1994.\n[ bib  ] 
\n@misc{WvGs,\nauthor = {M. Klingspor and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Modula-2O},\nhowpublished = {An object-oriented extension of Modula-2, ISO Document ISO/IEC JTC1/SC22/WG13/D199, 1994},\nyear = {1994},\ntags = {Reliability}\n}\n
\n
\n','
\n@misc{WvGs,\n  author = {M. Klingspor and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Modula-2O},\n  howpublished = {An object-oriented extension of Modula-2, ISO Document ISO/IEC JTC1/SC22/WG13/D199, 1994},\n  year = {1994},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Modula-2O',0,0,1994,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(946,'paper','WvGt','techreport','@techreport{WvGt,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Transformation of dotproduct expressions in PASCAL-SC},\n institution = {DIAMOND consortium, No. 03/2a-6/3/K2, 1987},\n year = {1987},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nTransformation of dotproduct expressions in pascal-sc.\nTechnical report, DIAMOND consortium, No. 03/2a-6/3/K2, 1987, 1987.\n[ bib  ] 
\n@techreport{WvGt,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Transformation of dotproduct expressions in PASCAL-SC},\ninstitution = {DIAMOND consortium, No. 03/2a-6/3/K2, 1987},\nyear = {1987},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGt,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Transformation of dotproduct expressions in PASCAL-SC},\n  institution = {DIAMOND consortium, No. 03/2a-6/3/K2, 1987},\n  year = {1987},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Transformation of dotproduct expressions in PASCAL-SC',0,0,1987,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(947,'paper','WvGu','article','@article{WvGu,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Reliable Expression Evaluation in PASCAL-SC},\n journal = {in R. E. Moore (Ed) Reliability in Computing Academic Press, p. 81-98, 1988},\n year = {1988},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nReliable expression evaluation in pascal-sc.\nin R. E. Moore (Ed) Reliability in Computing Academic Press, p.\n81-98, 1988, 1988.\n[ bib  ] 
\n@article{WvGu,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Reliable Expression Evaluation in PASCAL-SC},\njournal = {in R. E. Moore (Ed) Reliability in Computing Academic Press, p. 81-98, 1988},\nyear = {1988},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGu,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Reliable Expression Evaluation in PASCAL-SC},\n  journal = {in R. E. Moore (Ed) Reliability in Computing Academic Press, p. 81-98, 1988},\n  year = {1988},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Reliable Expression Evaluation in PASCAL-SC',0,0,1988,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(948,'paper','WvGv','article','@article{WvGv,\n author = {A. Yakovlev and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Multiaspect Data Types in Scientific Computation},\n journal = {in S. Markov (ed.) : Mathematical Modelling and Scientific Computation, Datecs Publishing, Sofia, 1993},\n year = {1993},\n tags = {Reliability},\n}\n\n','\n\nA. Yakovlev and Jürgen Wolff von Gudenberg.\nMultiaspect data types in scientific computation.\nin S. Markov (ed.) : Mathematical Modelling and Scientific\nComputation, Datecs Publishing, Sofia, 1993, 1993.\n[ bib  ] 
\n@article{WvGv,\nauthor = {A. Yakovlev and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Multiaspect Data Types in Scientific Computation},\njournal = {in S. Markov (ed.) : Mathematical Modelling and Scientific Computation, Datecs Publishing, Sofia, 1993},\nyear = {1993},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGv,\n  author = {A. Yakovlev and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Multiaspect Data Types in Scientific Computation},\n  journal = {in S. Markov (ed.) : Mathematical Modelling and Scientific Computation, Datecs Publishing, Sofia, 1993},\n  year = {1993},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Multiaspect Data Types in Scientific Computation',0,0,1993,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(949,'paper','WvGw','article','@article{WvGw,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {PASCAL-SC (Level 2) Language Extension},\n journal = {ESPRIT \'88, Putting the Technology to Use, p. 460-466, North-Holland, 1988},\n year = {1988},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nPascal-sc (level 2) language extension.\nESPRIT \'88, Putting the Technology to Use, p. 460-466,\nNorth-Holland, 1988, 1988.\n[ bib  ] 
\n@article{WvGw,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {PASCAL-SC (Level 2) Language Extension},\njournal = {ESPRIT \'88, Putting the Technology to Use, p. 460-466, North-Holland, 1988},\nyear = {1988},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGw,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {PASCAL-SC (Level 2) Language Extension},\n  journal = {ESPRIT \'88, Putting the Technology to Use, p. 460-466, North-Holland, 1988},\n  year = {1988},\n  tags = {Reliability}\n}\n
\n\n',NULL,'PASCAL-SC (Level 2) Language Extension',0,0,1988,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(950,'paper','WvGx','article','@article{WvGx,\n author = {A. Yakovlev and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Enhanced Evaluation of Mathematical Expressions},\n journal = {Interval\'94 Abstracts, Reliable Computing, p.248, 1994},\n year = {1994},\n tags = {Reliability},\n}\n\n','\n\nA. Yakovlev and Jürgen Wolff von Gudenberg.\nEnhanced evaluation of mathematical expressions.\nInterval\'94 Abstracts, Reliable Computing, p.248, 1994, 1994.\n[ bib  ] 
\n@article{WvGx,\nauthor = {A. Yakovlev and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Enhanced Evaluation of Mathematical Expressions},\njournal = {Interval\'94 Abstracts, Reliable Computing, p.248, 1994},\nyear = {1994},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGx,\n  author = {A. Yakovlev and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Enhanced Evaluation of Mathematical Expressions},\n  journal = {Interval\'94 Abstracts, Reliable Computing, p.248, 1994},\n  year = {1994},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Enhanced Evaluation of Mathematical Expressions',0,0,1994,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(951,'paper','WvGy','techreport','@techreport{WvGy,\n author = {B. Menzel and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Kommentierte Syntaxdiagramme f\\\"{u}r C++},\n institution = {Inst. f\\\"{u}r Informatik, Universit\\\"{a}t W\"{u}rzburg, Bericht Nr. 47, 1992},\n year = {1992},\n tags = {Reliability},\n}\n\n','\n\nB. Menzel and Jürgen Wolff von Gudenberg.\nKommentierte syntaxdiagramme für c++.\nTechnical report, Inst. für Informatik, Universität\nW\"urzburg, Bericht Nr. 47, 1992, 1992.\n[ bib  ] 
\n@techreport{WvGy,\nauthor = {B. Menzel and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Kommentierte Syntaxdiagramme f\\\"{u}r C++},\ninstitution = {Inst. f\\\"{u}r Informatik, Universit\\\"{a}t W\"{u}rzburg, Bericht Nr. 47, 1992},\nyear = {1992},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGy,\n  author = {B. Menzel and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Kommentierte Syntaxdiagramme f\\\"{u}r C++},\n  institution = {Inst. f\\\"{u}r Informatik, Universit\\\"{a}t W\"{u}rzburg, Bericht Nr. 47, 1992},\n  year = {1992},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Kommentierte Syntaxdiagramme f\\\"{u}r C++',0,0,1992,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(952,'paper','WvGz','article','@article{WvGz,\n author = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Introduction to Tools and Languages for Scientific Computation},\n journal = {Applied Mathematics I -- Algorithms and Theory, North Holland, 1992},\n year = {1992},\n tags = {Reliability},\n}\n\n','\n\nCh. Ullrich and Jürgen Wolff von Gudenberg.\nIntroduction to tools and languages for scientific computation.\nApplied Mathematics I - Algorithms and Theory, North Holland,\n1992, 1992.\n[ bib  ] 
\n@article{WvGz,\nauthor = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Introduction to Tools and Languages for Scientific Computation},\njournal = {Applied Mathematics I -- Algorithms and Theory, North Holland, 1992},\nyear = {1992},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGz,\n  author = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Introduction to Tools and Languages for Scientific Computation},\n  journal = {Applied Mathematics I -- Algorithms and Theory, North Holland, 1992},\n  year = {1992},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Introduction to Tools and Languages for Scientific Computation',0,0,1992,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(953,'paper','WvGaa','conference','@conference{WvGaa,\n author = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Introduction to Tools and Languages for Scientific Computation},\n booktitle = {Proceedings zum IMACS World Congress Dublin, p.37-39, 1991 und C. Brezinski, U. Kulisch (eds) Computational},\n year = {1991},\n tags = {Reliability},\n}\n\n','\n\nCh. Ullrich and Jürgen Wolff von Gudenberg.\nIntroduction to tools and languages for scientific computation.\nIn Proceedings zum IMACS World Congress Dublin, p.37-39, 1991\nund C. Brezinski, U. Kulisch (eds) Computational, 1991.\n[ bib  ] 
\n@conference{WvGaa,\nauthor = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Introduction to Tools and Languages for Scientific Computation},\nbooktitle = {Proceedings zum IMACS World Congress Dublin, p.37-39, 1991 und C. Brezinski, U. Kulisch (eds) Computational},\nyear = {1991},\ntags = {Reliability}\n}\n
\n
\n','
\n@conference{WvGaa,\n  author = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Introduction to Tools and Languages for Scientific Computation},\n  booktitle = {Proceedings zum IMACS World Congress Dublin, p.37-39, 1991 und C. Brezinski, U. Kulisch (eds) Computational},\n  year = {1991},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Introduction to Tools and Languages for Scientific Computation',0,0,1991,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(954,'paper','WvGab','techreport','@techreport{WvGab,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Esprit-Projekt DIAMOND},\n institution = {in U. Kulisch (Ed.) Wissenschaftliches Rechnen mit Ergebnisverifikation, Akademie und Vieweg, p. 251-259, 1989},\n year = {1989},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nEsprit-projekt diamond.\nTechnical report, in U. Kulisch (Ed.) Wissenschaftliches Rechnen mit\nErgebnisverifikation, Akademie und Vieweg, p. 251-259, 1989, 1989.\n[ bib  ] 
\n@techreport{WvGab,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Esprit-Projekt DIAMOND},\ninstitution = {in U. Kulisch (Ed.) Wissenschaftliches Rechnen mit Ergebnisverifikation, Akademie und Vieweg, p. 251-259, 1989},\nyear = {1989},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGab,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Esprit-Projekt DIAMOND},\n  institution = {in U. Kulisch (Ed.) Wissenschaftliches Rechnen mit Ergebnisverifikation, Akademie und Vieweg, p. 251-259, 1989},\n  year = {1989},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Esprit-Projekt DIAMOND',0,0,1989,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(955,'paper','WvGac','techreport','@techreport{WvGac,\n author = {G. Bohlender and W.L. Miranker and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Floating-Point Systems for Theorem Proving},\n institution = {IBM Research Report RC 15 101, 1989},\n year = {1989},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, W.L. Miranker, and Jürgen Wolff von Gudenberg.\nFloating-point systems for theorem proving.\nTechnical report, IBM Research Report RC 15 101, 1989, 1989.\n[ bib  ] 
\n@techreport{WvGac,\nauthor = {G. Bohlender and W.L. Miranker and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Floating-Point Systems for Theorem Proving},\ninstitution = {IBM Research Report RC 15 101, 1989},\nyear = {1989},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGac,\n  author = {G. Bohlender and W.L. Miranker and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Floating-Point Systems for Theorem Proving},\n  institution = {IBM Research Report RC 15 101, 1989},\n  year = {1989},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Floating-Point Systems for Theorem Proving',0,0,1989,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(956,'paper','WvGad','techreport','@techreport{WvGad,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Project No 1072 - DIAMOND},\n institution = {ESPRIT, Information Processing Systems, Results and Progress of Esprit Projects 1989, p. 51-56, 1989},\n year = {1989},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nProject no 1072 - diamond.\nTechnical report, ESPRIT, Information Processing Systems, Results and\nProgress of Esprit Projects 1989, p. 51-56, 1989, 1989.\n[ bib  ] 
\n@techreport{WvGad,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Project No 1072 - DIAMOND},\ninstitution = {ESPRIT, Information Processing Systems, Results and Progress of Esprit Projects 1989, p. 51-56, 1989},\nyear = {1989},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGad,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Project No 1072 - DIAMOND},\n  institution = {ESPRIT, Information Processing Systems, Results and Progress of Esprit Projects 1989, p. 51-56, 1989},\n  year = {1989},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Project No 1072 - DIAMOND',0,0,1989,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(957,'paper','WvGae','article','@article{WvGae,\n author = {G. Bohlender and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Accurate Matrix Multiplication on the Array Processor AMT-DAP},\n journal = {in Kaucher/Markov/Mayer (Eds.), Computer Arithmetic, Scientific Computation and Mathematical Modelling, J.C. Baltzer, p.133-150, 1991},\n year = {1991},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender and Jürgen Wolff von Gudenberg.\nAccurate matrix multiplication on the array processor amt-dap.\nin Kaucher/Markov/Mayer (Eds.), Computer Arithmetic, Scientific\nComputation and Mathematical Modelling, J.C. Baltzer, p.133-150, 1991, 1991.\n[ bib  ] 
\n@article{WvGae,\nauthor = {G. Bohlender and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Accurate Matrix Multiplication on the Array Processor AMT-DAP},\njournal = {in Kaucher/Markov/Mayer (Eds.), Computer Arithmetic, Scientific Computation and Mathematical Modelling, J.C. Baltzer, p.133-150, 1991},\nyear = {1991},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGae,\n  author = {G. Bohlender and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Accurate Matrix Multiplication on the Array Processor AMT-DAP},\n  journal = {in Kaucher/Markov/Mayer (Eds.), Computer Arithmetic, Scientific Computation and Mathematical Modelling, J.C. Baltzer, p.133-150, 1991},\n  year = {1991},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Accurate Matrix Multiplication on the Array Processor AMT-DAP',0,0,1991,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(958,'paper','WvGaf','article','@article{WvGaf,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {The Karlsruhe Accurate Arithmetic Approach},\n journal = {in P.J.L. Wallis (Ed), Improving Floating Point Programming, Wiley, 1990},\n year = {1990},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nThe karlsruhe accurate arithmetic approach.\nin P.J.L. Wallis (Ed), Improving Floating Point Programming,\nWiley, 1990, 1990.\n[ bib  ] 
\n@article{WvGaf,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {The Karlsruhe Accurate Arithmetic Approach},\njournal = {in P.J.L. Wallis (Ed), Improving Floating Point Programming, Wiley, 1990},\nyear = {1990},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGaf,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {The Karlsruhe Accurate Arithmetic Approach},\n  journal = {in P.J.L. Wallis (Ed), Improving Floating Point Programming, Wiley, 1990},\n  year = {1990},\n  tags = {Reliability}\n}\n
\n\n',NULL,'The Karlsruhe Accurate Arithmetic Approach',0,0,1990,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(959,'paper','WvGag','article','@article{WvGag,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {The Embedding of Accurate Arithmetic in PASCAL-SC},\n journal = {in P.J.L. Wallis (Ed), Improving Floating Point Programming, Wiley, 1990},\n year = {1990},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nThe embedding of accurate arithmetic in pascal-sc.\nin P.J.L. Wallis (Ed), Improving Floating Point Programming,\nWiley, 1990, 1990.\n[ bib  ] 
\n@article{WvGag,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {The Embedding of Accurate Arithmetic in PASCAL-SC},\njournal = {in P.J.L. Wallis (Ed), Improving Floating Point Programming, Wiley, 1990},\nyear = {1990},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGag,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {The Embedding of Accurate Arithmetic in PASCAL-SC},\n  journal = {in P.J.L. Wallis (Ed), Improving Floating Point Programming, Wiley, 1990},\n  year = {1990},\n  tags = {Reliability}\n}\n
\n\n',NULL,'The Embedding of Accurate Arithmetic in PASCAL-SC',0,0,1990,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(960,'paper','WvGah','article','@article{WvGah,\n author = {G. Bohlender and W.L. Miranker and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Floating-Point Systems for Theorem Proving},\n journal = {in K.Meyer, D. Schmidt (Eds.) Computer Aided Proofs in Analysis, Springer, p. 22-32, 1991},\n year = {1991},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, W.L. Miranker, and Jürgen Wolff von Gudenberg.\nFloating-point systems for theorem proving.\nin K.Meyer, D. Schmidt (Eds.) Computer Aided Proofs in Analysis,\nSpringer, p. 22-32, 1991, 1991.\n[ bib  ] 
\n@article{WvGah,\nauthor = {G. Bohlender and W.L. Miranker and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Floating-Point Systems for Theorem Proving},\njournal = {in K.Meyer, D. Schmidt (Eds.) Computer Aided Proofs in Analysis, Springer, p. 22-32, 1991},\nyear = {1991},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGah,\n  author = {G. Bohlender and W.L. Miranker and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Floating-Point Systems for Theorem Proving},\n  journal = {in K.Meyer, D. Schmidt (Eds.) Computer Aided Proofs in Analysis, Springer, p. 22-32, 1991},\n  year = {1991},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Floating-Point Systems for Theorem Proving',0,0,1991,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(961,'paper','WvGai','article','@article{WvGai,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Arithmetische und programmiersprachliche Werkzeuge f\\\"{u}r die Numerik (Teil 1)},\n journal = {Computer Theoretikum und Praktikum f\\\"{u}r Physiker,p. 15-42, 1990},\n year = {1990},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nArithmetische und programmiersprachliche werkzeuge für die\nnumerik (teil 1).\nComputer Theoretikum und Praktikum für Physiker,p. 15-42,\n1990, 1990.\n[ bib  ] 
\n@article{WvGai,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Arithmetische und programmiersprachliche Werkzeuge f\\\"{u}r die Numerik (Teil 1)},\njournal = {Computer Theoretikum und Praktikum f\\\"{u}r Physiker,p. 15-42, 1990},\nyear = {1990},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGai,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Arithmetische und programmiersprachliche Werkzeuge f\\\"{u}r die Numerik (Teil 1)},\n  journal = {Computer Theoretikum und Praktikum f\\\"{u}r Physiker,p. 15-42, 1990},\n  year = {1990},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Arithmetische und programmiersprachliche Werkzeuge f\\\"{u}r die Numerik (Teil 1)',0,0,1990,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(962,'paper','WvGaj','article','@article{WvGaj,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {A Symbolic Generic Expression Concept},\n journal = {in C. Ullrich (Ed.), Contributions to Computer Arithmetic and Self-Validating numerical methods, IMACS, p. 459-464, 1990},\n year = {1990},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nA symbolic generic expression concept.\nin C. Ullrich (Ed.), Contributions to Computer Arithmetic and\nSelf-Validating numerical methods, IMACS, p. 459-464, 1990, 1990.\n[ bib  ] 
\n@article{WvGaj,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {A Symbolic Generic Expression Concept},\njournal = {in C. Ullrich (Ed.), Contributions to Computer Arithmetic and Self-Validating numerical methods, IMACS, p. 459-464, 1990},\nyear = {1990},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGaj,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {A Symbolic Generic Expression Concept},\n  journal = {in C. Ullrich (Ed.), Contributions to Computer Arithmetic and Self-Validating numerical methods, IMACS, p. 459-464, 1990},\n  year = {1990},\n  tags = {Reliability}\n}\n
\n\n',NULL,'A Symbolic Generic Expression Concept',0,0,1990,0,NULL,NULL,NULL,'2016-02-20 23:19:00','2016-06-01 09:41:07',0),(963,'paper','WvGak','article','@article{WvGak,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Einsatz genauer Nullstellenverfahren bei der Berechnung zweiseitig gek\\\"{u}hlter Halbleiterbauelemente},\n journal = {ZAMM 70,p. T549-T551, 1990},\n year = {1990},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nEinsatz genauer nullstellenverfahren bei der berechnung zweiseitig\ngekühlter halbleiterbauelemente.\nZAMM 70,p. T549-T551, 1990, 1990.\n[ bib  ] 
\n@article{WvGak,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Einsatz genauer Nullstellenverfahren bei der Berechnung zweiseitig gek\\\"{u}hlter Halbleiterbauelemente},\njournal = {ZAMM 70,p. T549-T551, 1990},\nyear = {1990},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGak,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Einsatz genauer Nullstellenverfahren bei der Berechnung zweiseitig gek\\\"{u}hlter Halbleiterbauelemente},\n  journal = {ZAMM 70,p. T549-T551, 1990},\n  year = {1990},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Einsatz genauer Nullstellenverfahren bei der Berechnung zweiseitig gek\\\"{u}hlter Halbleiterbauelemente',0,0,1990,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 10:17:18',0),(964,'paper','WvGal','techreport','@techreport{WvGal,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Typvererbung in objektorienten Datenbanken},\n institution = {Kolloquium Angewandte Informatik Karlsruhe 1989, Universit\\\"{a}t Karlsruhe, 1990},\n year = {1990},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nTypvererbung in objektorienten datenbanken.\nTechnical report, Kolloquium Angewandte Informatik Karlsruhe 1989,\nUniversität Karlsruhe, 1990, 1990.\n[ bib  ] 
\n@techreport{WvGal,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Typvererbung in objektorienten Datenbanken},\ninstitution = {Kolloquium Angewandte Informatik Karlsruhe 1989, Universit\\\"{a}t Karlsruhe, 1990},\nyear = {1990},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGal,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Typvererbung in objektorienten Datenbanken},\n  institution = {Kolloquium Angewandte Informatik Karlsruhe 1989, Universit\\\"{a}t Karlsruhe, 1990},\n  year = {1990},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Typvererbung in objektorienten Datenbanken',0,0,1990,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(965,'paper','WvGam','article','@article{WvGam,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Arithmetic for Vector and Parallel Computers},\n journal = {Decision Support Systems 7, p. 285-292, 1991 (Abstract in Methods of Operations Research 62, 1990)},\n year = {1990},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nArithmetic for vector and parallel computers.\nDecision Support Systems 7, p. 285-292, 1991 (Abstract in\nMethods of Operations Research 62, 1990), 1990.\n[ bib  ] 
\n@article{WvGam,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Arithmetic for Vector and Parallel Computers},\njournal = {Decision Support Systems 7, p. 285-292, 1991 (Abstract in Methods of Operations Research 62, 1990)},\nyear = {1990},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGam,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Arithmetic for Vector and Parallel Computers},\n  journal = {Decision Support Systems 7, p. 285-292, 1991 (Abstract in Methods of Operations Research 62, 1990)},\n  year = {1990},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Arithmetic for Vector and Parallel Computers',0,0,1990,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(966,'paper','WvGan','article','@article{WvGan,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Object-oriented Concepts for Scientific Computation},\n journal = {in Kaucher/Markov/Mayer(Eds.), Computer Arithmetic, Scientific Computation and Mathematical Modelling, J.C. Baltzer, p.181-192, 1991},\n year = {1991},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nObject-oriented concepts for scientific computation.\nin Kaucher/Markov/Mayer(Eds.), Computer Arithmetic, Scientific\nComputation and Mathematical Modelling, J.C. Baltzer, p.181-192, 1991, 1991.\n[ bib  ] 
\n@article{WvGan,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Object-oriented Concepts for Scientific Computation},\njournal = {in Kaucher/Markov/Mayer(Eds.), Computer Arithmetic, Scientific Computation and Mathematical Modelling, J.C. Baltzer, p.181-192, 1991},\nyear = {1991},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGan,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Object-oriented Concepts for Scientific Computation},\n  journal = {in Kaucher/Markov/Mayer(Eds.), Computer Arithmetic, Scientific Computation and Mathematical Modelling, J.C. Baltzer, p.181-192, 1991},\n  year = {1991},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Object-oriented Concepts for Scientific Computation',0,0,1991,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(967,'paper','WvGao','article','@article{WvGao,\n author = {G. Schumacher and J\\\"{u}rgen Wolff von Gudenberg},\n title = {E-Methods for Improving Accuracy},\n journal = {in P.J.L. Wallis (Ed.) Improving Floating Point Programming, Wiley 1990},\n year = {1990},\n tags = {Reliability},\n}\n\n','\n\nG. Schumacher and Jürgen Wolff von Gudenberg.\nE-methods for improving accuracy.\nin P.J.L. Wallis (Ed.) Improving Floating Point Programming,\nWiley 1990, 1990.\n[ bib  ] 
\n@article{WvGao,\nauthor = {G. Schumacher and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {E-Methods for Improving Accuracy},\njournal = {in P.J.L. Wallis (Ed.) Improving Floating Point Programming, Wiley 1990},\nyear = {1990},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGao,\n  author = {G. Schumacher and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {E-Methods for Improving Accuracy},\n  journal = {in P.J.L. Wallis (Ed.) Improving Floating Point Programming, Wiley 1990},\n  year = {1990},\n  tags = {Reliability}\n}\n
\n\n',NULL,'E-Methods for Improving Accuracy',0,0,1990,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(968,'paper','WvGap','article','@article{WvGap,\n author = {G. Bohlender and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {The Module Concepts in PASCAL-SC, ADA, MODULA-2 and FORTRAN 8x,},\n journal = {Journal for Pascal, Ada & C},\n year = {1990},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, Ch. Ullrich, and Jürgen Wolff von Gudenberg.\nThe module concepts in pascal-sc, ada, modula-2 and fortran 8x,.\nJournal for Pascal, Ada & C, 1990.\n[ bib  ] 
\n@article{WvGap,\nauthor = {G. Bohlender and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {The Module Concepts in PASCAL-SC, ADA, MODULA-2 and FORTRAN 8x,},\njournal = {Journal for Pascal, Ada & C},\nyear = {1990},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGap,\n  author = {G. Bohlender and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {The Module Concepts in PASCAL-SC, ADA, MODULA-2 and FORTRAN 8x,},\n  journal = {Journal for Pascal, Ada & C},\n  year = {1990},\n  tags = {Reliability}\n}\n
\n\n',NULL,'The Module Concepts in PASCAL-SC, ADA, MODULA-2 and FORTRAN 8x,',0,0,1990,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(969,'paper','WvGaq','article','@article{WvGaq,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Modelling SIMD - Type Parallel Arithmetic Operations in Ada},\n journal = {in D. Christodoulakis (Ed.): Ada: The Choice for \'92, LNCS 499, Springer Berlin 1991},\n year = {1991},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nModelling simd - type parallel arithmetic operations in ada.\nin D. Christodoulakis (Ed.): Ada: The Choice for \'92, LNCS 499,\nSpringer Berlin 1991, 1991.\n[ bib  ] 
\n@article{WvGaq,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Modelling SIMD - Type Parallel Arithmetic Operations in Ada},\njournal = {in D. Christodoulakis (Ed.): Ada: The Choice for \'92, LNCS 499, Springer Berlin 1991},\nyear = {1991},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGaq,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Modelling SIMD - Type Parallel Arithmetic Operations in Ada},\n  journal = {in D. Christodoulakis (Ed.): Ada: The Choice for \'92, LNCS 499, Springer Berlin 1991},\n  year = {1991},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Modelling SIMD - Type Parallel Arithmetic Operations in Ada',0,0,1991,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(970,'paper','WvGar','article','@article{WvGar,\n author = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Implementation of Arithmetic for Scientific Computation in ADA},\n journal = {\"Journal for Pascal, Ada & C},\n year = {1989},\n tags = {Reliability},\n}\n\n','\n\nR. Klatte, Ch. Ullrich, and Jürgen Wolff von Gudenberg.\nImplementation of arithmetic for scientific computation in ada.\n\"Journal for Pascal, Ada & C, 1989.\n[ bib  ] 
\n@article{WvGar,\nauthor = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Implementation of Arithmetic for Scientific Computation in ADA},\njournal = {\"Journal for Pascal, Ada & C},\nyear = {1989},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGar,\n  author = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Implementation of Arithmetic for Scientific Computation in ADA},\n  journal = {\"Journal for Pascal, Ada & C},\n  year = {1989},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Implementation of Arithmetic for Scientific Computation in ADA',0,0,1989,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(971,'paper','WvGas','techreport','@techreport{WvGas,\n author = {L. Bamberger and H.C. Fischer and G. Schumacher and D. Winter and A. Z\\\"{o}llner and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Local Transformations to obtain Accuracy ESPRIT-DIAMOND consortium},\n institution = {Deliverable D2a-5, 1988},\n year = {1988},\n tags = {Reliability},\n}\n\n','\n\nL. Bamberger, H.C. Fischer, G. Schumacher, D. Winter, A. Zöllner, and\nJürgen Wolff von Gudenberg.\nLocal transformations to obtain accuracy esprit-diamond consortium.\nTechnical report, Deliverable D2a-5, 1988, 1988.\n[ bib  ] 
\n@techreport{WvGas,\nauthor = {L. Bamberger and H.C. Fischer and G. Schumacher and D. Winter and A. Z\\\"{o}llner and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Local Transformations to obtain Accuracy ESPRIT-DIAMOND consortium},\ninstitution = {Deliverable D2a-5, 1988},\nyear = {1988},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGas,\n  author = {L. Bamberger and H.C. Fischer and G. Schumacher and D. Winter and A. Z\\\"{o}llner and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Local Transformations to obtain Accuracy ESPRIT-DIAMOND consortium},\n  institution = {Deliverable D2a-5, 1988},\n  year = {1988},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Local Transformations to obtain Accuracy ESPRIT-DIAMOND consortium',0,0,1988,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(972,'paper','WvGat','techreport','@techreport{WvGat,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Grundroutinen f\\\"{u}r sichere, numerische Algorithmen auf Parallelrechnern},\n institution = {Wiss. Zeitschrift der TH Leipzig 15, p.421-426, 1991},\n year = {1991},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nGrundroutinen für sichere, numerische algorithmen auf\nparallelrechnern.\nTechnical report, Wiss. Zeitschrift der TH Leipzig 15, p.421-426,\n1991, 1991.\n[ bib  ] 
\n@techreport{WvGat,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Grundroutinen f\\\"{u}r sichere, numerische Algorithmen auf Parallelrechnern},\ninstitution = {Wiss. Zeitschrift der TH Leipzig 15, p.421-426, 1991},\nyear = {1991},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGat,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Grundroutinen f\\\"{u}r sichere, numerische Algorithmen auf Parallelrechnern},\n  institution = {Wiss. Zeitschrift der TH Leipzig 15, p.421-426, 1991},\n  year = {1991},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Grundroutinen f\\\"{u}r sichere, numerische Algorithmen auf Parallelrechnern',0,0,1991,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(973,'paper','WvGau','techreport','@techreport{WvGau,\n author = {W. Klein and M. Erl and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Verified Results for Linear Systems with Sparse Matrices. ESPRIT DIAMOND consortium},\n institution = {Deliverable D3-3, 1988},\n year = {1988},\n tags = {Reliability},\n}\n\n','\n\nW. Klein, M. Erl, and Jürgen Wolff von Gudenberg.\nVerified results for linear systems with sparse matrices. esprit\ndiamond consortium.\nTechnical report, Deliverable D3-3, 1988, 1988.\n[ bib  ] 
\n@techreport{WvGau,\nauthor = {W. Klein and M. Erl and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Verified Results for Linear Systems with Sparse Matrices. ESPRIT DIAMOND consortium},\ninstitution = {Deliverable D3-3, 1988},\nyear = {1988},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGau,\n  author = {W. Klein and M. Erl and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Verified Results for Linear Systems with Sparse Matrices. ESPRIT DIAMOND consortium},\n  institution = {Deliverable D3-3, 1988},\n  year = {1988},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Verified Results for Linear Systems with Sparse Matrices. ESPRIT DIAMOND consortium',0,0,1988,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(974,'paper','WvGav','article','@article{WvGav,\n author = {G. Schumacher and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Highly Accurate Numerical Algorithms},\n journal = {in Ullrich/ Wolff von Gudenberg (Eds.), Accurate Numerical Algorithms, Springer, p. 1-58, 1989},\n year = {1989},\n tags = {Reliability},\n}\n\n','\n\nG. Schumacher and Jürgen Wolff von Gudenberg.\nHighly accurate numerical algorithms.\nin Ullrich/ Wolff von Gudenberg (Eds.), Accurate Numerical\nAlgorithms, Springer, p. 1-58, 1989, 1989.\n[ bib  ] 
\n@article{WvGav,\nauthor = {G. Schumacher and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Highly Accurate Numerical Algorithms},\njournal = {in Ullrich/ Wolff von Gudenberg (Eds.), Accurate Numerical Algorithms, Springer, p. 1-58, 1989},\nyear = {1989},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGav,\n  author = {G. Schumacher and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Highly Accurate Numerical Algorithms},\n  journal = {in Ullrich/ Wolff von Gudenberg (Eds.), Accurate Numerical Algorithms, Springer, p. 1-58, 1989},\n  year = {1989},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Highly Accurate Numerical Algorithms',0,0,1989,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(975,'paper','WvGaw','article','@article{WvGaw,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Accurate Matrix Operations on Hypercube Computers},\n journal = {in J. Herzberger, L. Atanassova (eds): Computer Arithmetic and Closure Methods, North Holland, p. 167-176, 1992},\n year = {1992},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nAccurate matrix operations on hypercube computers.\nin J. Herzberger, L. Atanassova (eds): Computer Arithmetic and\nClosure Methods, North Holland, p. 167-176, 1992, 1992.\n[ bib  ] 
\n@article{WvGaw,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Accurate Matrix Operations on Hypercube Computers},\njournal = {in J. Herzberger, L. Atanassova (eds): Computer Arithmetic and Closure Methods, North Holland, p. 167-176, 1992},\nyear = {1992},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGaw,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Accurate Matrix Operations on Hypercube Computers},\n  journal = {in J. Herzberger, L. Atanassova (eds): Computer Arithmetic and Closure Methods, North Holland, p. 167-176, 1992},\n  year = {1992},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Accurate Matrix Operations on Hypercube Computers',0,0,1992,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(976,'paper','WvGax','article','@article{WvGax,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Programming Language Support for Scientific Computation},\n journal = {Proceedings of INTERVAL-92, Moskau, 1992 und Interval ComputationsNo. 4(6), p.116-126, 1992},\n year = {1992},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nProgramming language support for scientific computation.\nProceedings of INTERVAL-92, Moskau, 1992 und Interval\nComputationsNo. 4(6), p.116-126, 1992, 1992.\n[ bib  ] 
\n@article{WvGax,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Programming Language Support for Scientific Computation},\njournal = {Proceedings of INTERVAL-92, Moskau, 1992 und Interval ComputationsNo. 4(6), p.116-126, 1992},\nyear = {1992},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGax,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Programming Language Support for Scientific Computation},\n  journal = {Proceedings of INTERVAL-92, Moskau, 1992 und Interval ComputationsNo. 4(6), p.116-126, 1992},\n  year = {1992},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Programming Language Support for Scientific Computation',0,0,1992,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(977,'paper','WvGay','article','@article{WvGay,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Arithmetische und programmiersprachliche Werkzeuge f\\\"{u}r die Numerik (Teil 2)},\n journal = {Computer Theoretikum und Praktikum f\\\"{u}r Physiker, No. 6, 1993},\n year = {1993},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nArithmetische und programmiersprachliche werkzeuge für die\nnumerik (teil 2).\nComputer Theoretikum und Praktikum für Physiker, No. 6,\n1993, 1993.\n[ bib  ] 
\n@article{WvGay,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Arithmetische und programmiersprachliche Werkzeuge f\\\"{u}r die Numerik (Teil 2)},\njournal = {Computer Theoretikum und Praktikum f\\\"{u}r Physiker, No. 6, 1993},\nyear = {1993},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGay,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Arithmetische und programmiersprachliche Werkzeuge f\\\"{u}r die Numerik (Teil 2)},\n  journal = {Computer Theoretikum und Praktikum f\\\"{u}r Physiker, No. 6, 1993},\n  year = {1993},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Arithmetische und programmiersprachliche Werkzeuge f\\\"{u}r die Numerik (Teil 2)',0,0,1993,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(978,'paper','WvGaz','article','@article{WvGaz,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Implementation of Accurate Matrix Multiplication on the CM-2},\n journal = {Computing Suppl. 9, p.287-291, 1993},\n year = {1993},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nImplementation of accurate matrix multiplication on the cm-2.\nComputing Suppl. 9, p.287-291, 1993, 1993.\n[ bib  ] 
\n@article{WvGaz,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Implementation of Accurate Matrix Multiplication on the CM-2},\njournal = {Computing Suppl. 9, p.287-291, 1993},\nyear = {1993},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGaz,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Implementation of Accurate Matrix Multiplication on the CM-2},\n  journal = {Computing Suppl. 9, p.287-291, 1993},\n  year = {1993},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Implementation of Accurate Matrix Multiplication on the CM-2',0,0,1993,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(979,'paper','WvGba','article','@article{WvGba,\n author = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {PASCAL-SC and Numerical and Non Numerical Applications},\n journal = {in B. Krause, A. Schreiner (Eds) HECTOR Vol. 1, New Ways in Education and Research, Springer, Berlin 1988},\n year = {1988},\n tags = {Reliability},\n}\n\n','\n\nR. Klatte, Ch. Ullrich, and Jürgen Wolff von Gudenberg.\nPascal-sc and numerical and non numerical applications.\nin B. Krause, A. Schreiner (Eds) HECTOR Vol. 1, New Ways in\nEducation and Research, Springer, Berlin 1988, 1988.\n[ bib  ] 
\n@article{WvGba,\nauthor = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {PASCAL-SC and Numerical and Non Numerical Applications},\njournal = {in B. Krause, A. Schreiner (Eds) HECTOR Vol. 1, New Ways in Education and Research, Springer, Berlin 1988},\nyear = {1988},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGba,\n  author = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {PASCAL-SC and Numerical and Non Numerical Applications},\n  journal = {in B. Krause, A. Schreiner (Eds) HECTOR Vol. 1, New Ways in Education and Research, Springer, Berlin 1988},\n  year = {1988},\n  tags = {Reliability}\n}\n
\n\n',NULL,'PASCAL-SC and Numerical and Non Numerical Applications',0,0,1988,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(980,'paper','WvGbb','techreport','@techreport{WvGbb,\n author = {M. Neaga and J\\\"{u}rgen Wolff von Gudenberg},\n title = {The PASCAL-SC level 2 Compiler},\n institution = {Architecture and Implementation Description, ESPRIT DIAMOND consotium, Deliverable D1-1, 1988},\n year = {1988},\n tags = {Reliability},\n}\n\n','\n\nM. Neaga and Jürgen Wolff von Gudenberg.\nThe pascal-sc level 2 compiler.\nTechnical report, Architecture and Implementation Description, ESPRIT\nDIAMOND consotium, Deliverable D1-1, 1988, 1988.\n[ bib  ] 
\n@techreport{WvGbb,\nauthor = {M. Neaga and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {The PASCAL-SC level 2 Compiler},\ninstitution = {Architecture and Implementation Description, ESPRIT DIAMOND consotium, Deliverable D1-1, 1988},\nyear = {1988},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGbb,\n  author = {M. Neaga and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {The PASCAL-SC level 2 Compiler},\n  institution = {Architecture and Implementation Description, ESPRIT DIAMOND consotium, Deliverable D1-1, 1988},\n  year = {1988},\n  tags = {Reliability}\n}\n
\n\n',NULL,'The PASCAL-SC level 2 Compiler',0,0,1988,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(981,'paper','WvGbc','article','@article{WvGbc,\n author = {G. Bohlender and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {New Developments in PASCAL-SC},\n journal = {SIGPLAN Notices, Vol 23, No 8, p. 83-92, 1988},\n year = {1988},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, Ch. Ullrich, and Jürgen Wolff von Gudenberg.\nNew developments in pascal-sc.\nSIGPLAN Notices, Vol 23, No 8, p. 83-92, 1988, 1988.\n[ bib  ] 
\n@article{WvGbc,\nauthor = {G. Bohlender and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {New Developments in PASCAL-SC},\njournal = {SIGPLAN Notices, Vol 23, No 8, p. 83-92, 1988},\nyear = {1988},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbc,\n  author = {G. Bohlender and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {New Developments in PASCAL-SC},\n  journal = {SIGPLAN Notices, Vol 23, No 8, p. 83-92, 1988},\n  year = {1988},\n  tags = {Reliability}\n}\n
\n\n',NULL,'New Developments in PASCAL-SC',0,0,1988,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(982,'paper','WvGbd','techreport','@techreport{WvGbd,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Comparison of Accurate Dot Product Algorithms},\n institution = {Research report 881IRISA, Rennes 1994},\n year = {1994},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nComparison of accurate dot product algorithms.\nTechnical report, Research report 881IRISA, Rennes 1994, 1994.\n[ bib  ] 
\n@techreport{WvGbd,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Comparison of Accurate Dot Product Algorithms},\ninstitution = {Research report 881IRISA, Rennes 1994},\nyear = {1994},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGbd,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Comparison of Accurate Dot Product Algorithms},\n  institution = {Research report 881IRISA, Rennes 1994},\n  year = {1994},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Comparison of Accurate Dot Product Algorithms',0,0,1994,0,NULL,NULL,NULL,'2016-02-20 23:19:01','2016-06-01 09:41:07',0),(983,'paper','WvGbe','techreport','@techreport{WvGbe,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Parallelisierung mittels einer Klassenbibliothek},\n institution = {Tagungsberichte GI FG 2.1.4 Alternative Sprachen und Konzepte, Universit\\\"{a}t Koblenz, 1995},\n year = {1995},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nParallelisierung mittels einer klassenbibliothek.\nTechnical report, Tagungsberichte GI FG 2.1.4 Alternative Sprachen\nund Konzepte, Universität Koblenz, 1995, 1995.\n[ bib  ] 
\n@techreport{WvGbe,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Parallelisierung mittels einer Klassenbibliothek},\ninstitution = {Tagungsberichte GI FG 2.1.4 Alternative Sprachen und Konzepte, Universit\\\"{a}t Koblenz, 1995},\nyear = {1995},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGbe,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Parallelisierung mittels einer Klassenbibliothek},\n  institution = {Tagungsberichte GI FG 2.1.4 Alternative Sprachen und Konzepte, Universit\\\"{a}t Koblenz, 1995},\n  year = {1995},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Parallelisierung mittels einer Klassenbibliothek',0,0,1995,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(984,'paper','WvGbf','techreport','@techreport{WvGbf,\n author = {M. Neaga and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Implementation of Dynamic Arrays in PASCAL-SC},\n institution = {ESPRIT DIAMOND consortium, No. 03/1-1/2/K2, 1987},\n year = {1987},\n tags = {Reliability},\n}\n\n','\n\nM. Neaga and Jürgen Wolff von Gudenberg.\nImplementation of dynamic arrays in pascal-sc.\nTechnical report, ESPRIT DIAMOND consortium, No. 03/1-1/2/K2, 1987,\n1987.\n[ bib  ] 
\n@techreport{WvGbf,\nauthor = {M. Neaga and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Implementation of Dynamic Arrays in PASCAL-SC},\ninstitution = {ESPRIT DIAMOND consortium, No. 03/1-1/2/K2, 1987},\nyear = {1987},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGbf,\n  author = {M. Neaga and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Implementation of Dynamic Arrays in PASCAL-SC},\n  institution = {ESPRIT DIAMOND consortium, No. 03/1-1/2/K2, 1987},\n  year = {1987},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Implementation of Dynamic Arrays in PASCAL-SC',0,0,1987,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(985,'paper','WvGbg','article','@article{WvGbg,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Hardware Support for Interval Arithmetic - Extended Version},\n journal = {Inst. f\\\"{u}r Informatik, Universit\\\"{a}t W\"{u}rzburg, Bericht Nr. 125, 1995},\n year = {1995},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nHardware support for interval arithmetic - extended version.\nInst. für Informatik, Universität W\"urzburg, Bericht\nNr. 125, 1995, 1995.\n[ bib  ] 
\n@article{WvGbg,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Hardware Support for Interval Arithmetic - Extended Version},\njournal = {Inst. f\\\"{u}r Informatik, Universit\\\"{a}t W\"{u}rzburg, Bericht Nr. 125, 1995},\nyear = {1995},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbg,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Hardware Support for Interval Arithmetic - Extended Version},\n  journal = {Inst. f\\\"{u}r Informatik, Universit\\\"{a}t W\"{u}rzburg, Bericht Nr. 125, 1995},\n  year = {1995},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Hardware Support for Interval Arithmetic - Extended Version',0,0,1995,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(986,'paper','WvGbh','article','@article{WvGbh,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Design of a Parallel Linear Algebra Library for Verified Computation},\n journal = {Reliable Computing, 1 (4), p.411-420, 1995},\n year = {1995},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nDesign of a parallel linear algebra library for verified computation.\nReliable Computing, 1 (4), p.411-420, 1995, 1995.\n[ bib  ] 
\n@article{WvGbh,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Design of a Parallel Linear Algebra Library for Verified Computation},\njournal = {Reliable Computing, 1 (4), p.411-420, 1995},\nyear = {1995},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbh,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Design of a Parallel Linear Algebra Library for Verified Computation},\n  journal = {Reliable Computing, 1 (4), p.411-420, 1995},\n  year = {1995},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Design of a Parallel Linear Algebra Library for Verified Computation',0,0,1995,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(987,'paper','WvGbi','article','@article{WvGbi,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Parallel Accurate Linear Algebra Subroutines},\n journal = {Reliable Computing, 1 (2), p.189-199, 1995},\n year = {1995},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nParallel accurate linear algebra subroutines.\nReliable Computing, 1 (2), p.189-199, 1995, 1995.\n[ bib  ] 
\n@article{WvGbi,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Parallel Accurate Linear Algebra Subroutines},\njournal = {Reliable Computing, 1 (2), p.189-199, 1995},\nyear = {1995},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbi,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Parallel Accurate Linear Algebra Subroutines},\n  journal = {Reliable Computing, 1 (2), p.189-199, 1995},\n  year = {1995},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Parallel Accurate Linear Algebra Subroutines',0,0,1995,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(988,'paper','WvGbj','techreport','@techreport{WvGbj,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Structure of a C++ Library for Parallel Accurate Linear Algebra},\n institution = {in Alefeld/ Mahrenholtz/ Mennicken(eds.) Numerical Analysis, Scientific Computing, Computer Science ICIAM 95 Proceedings, Akademie Verlag ISBN 3-05-501744-7, 1996},\n year = {1996},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nStructure of a c++ library for parallel accurate linear algebra.\nTechnical report, in Alefeld/ Mahrenholtz/ Mennicken(eds.) Numerical\nAnalysis, Scientific Computing, Computer Science ICIAM 95 Proceedings,\nAkademie Verlag ISBN 3-05-501744-7, 1996, 1996.\n[ bib  ] 
\n@techreport{WvGbj,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Structure of a C++ Library for Parallel Accurate Linear Algebra},\ninstitution = {in Alefeld/ Mahrenholtz/ Mennicken(eds.) Numerical Analysis, Scientific Computing, Computer Science ICIAM 95 Proceedings, Akademie Verlag ISBN 3-05-501744-7, 1996},\nyear = {1996},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGbj,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Structure of a C++ Library for Parallel Accurate Linear Algebra},\n  institution = {in Alefeld/ Mahrenholtz/ Mennicken(eds.) Numerical Analysis, Scientific Computing, Computer Science ICIAM 95 Proceedings, Akademie Verlag ISBN 3-05-501744-7, 1996},\n  year = {1996},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Structure of a C++ Library for Parallel Accurate Linear Algebra',0,0,1996,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(989,'paper','WvGbk','article','@article{WvGbk,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Hardware Support for Interval Arithmetic},\n journal = {in Alefeld/ Frommer/ Lang (eds.) Scientific Computing and Validated Numerics, Akademie Verlag, p. 32-37, 1996},\n year = {1996},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nHardware support for interval arithmetic.\nin Alefeld/ Frommer/ Lang (eds.) Scientific Computing and\nValidated Numerics, Akademie Verlag, p. 32-37, 1996, 1996.\n[ bib  ] 
\n@article{WvGbk,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Hardware Support for Interval Arithmetic},\njournal = {in Alefeld/ Frommer/ Lang (eds.) Scientific Computing and Validated Numerics, Akademie Verlag, p. 32-37, 1996},\nyear = {1996},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbk,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Hardware Support for Interval Arithmetic},\n  journal = {in Alefeld/ Frommer/ Lang (eds.) Scientific Computing and Validated Numerics, Akademie Verlag, p. 32-37, 1996},\n  year = {1996},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Hardware Support for Interval Arithmetic',0,0,1996,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(990,'paper','WvGbl','article','@article{WvGbl,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Objektorientierter Entwurf im wissenschaftlichen Rechnen},\n journal = {in Mackens/ Rump (eds.) Software Engineering im Scientific Computing, Vieweg, p. 31-37, 1996},\n year = {1996},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nObjektorientierter entwurf im wissenschaftlichen rechnen.\nin Mackens/ Rump (eds.) Software Engineering im Scientific\nComputing, Vieweg, p. 31-37, 1996, 1996.\n[ bib  ] 
\n@article{WvGbl,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Objektorientierter Entwurf im wissenschaftlichen Rechnen},\njournal = {in Mackens/ Rump (eds.) Software Engineering im Scientific Computing, Vieweg, p. 31-37, 1996},\nyear = {1996},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbl,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Objektorientierter Entwurf im wissenschaftlichen Rechnen},\n  journal = {in Mackens/ Rump (eds.) Software Engineering im Scientific Computing, Vieweg, p. 31-37, 1996},\n  year = {1996},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Objektorientierter Entwurf im wissenschaftlichen Rechnen',0,0,1996,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(991,'paper','WvGbm','article','@article{WvGbm,\n author = {M. Lerch and W. Wiechert and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Objektorientierte Entwurfsmuster f\\\"{u}r die Wiederverwendung numerischer Softwarekomponenten},\n journal = {in Mackens/ Rump (eds.) Software Engineering im Scientific Computing, Vieweg, p. 51-62, 1996},\n year = {1996},\n tags = {Reliability},\n}\n\n','\n\nM. Lerch, W. Wiechert, and Jürgen Wolff von Gudenberg.\nObjektorientierte entwurfsmuster für die wiederverwendung\nnumerischer softwarekomponenten.\nin Mackens/ Rump (eds.) Software Engineering im Scientific\nComputing, Vieweg, p. 51-62, 1996, 1996.\n[ bib  ] 
\n@article{WvGbm,\nauthor = {M. Lerch and W. Wiechert and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Objektorientierte Entwurfsmuster f\\\"{u}r die Wiederverwendung numerischer Softwarekomponenten},\njournal = {in Mackens/ Rump (eds.) Software Engineering im Scientific Computing, Vieweg, p. 51-62, 1996},\nyear = {1996},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbm,\n  author = {M. Lerch and W. Wiechert and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Objektorientierte Entwurfsmuster f\\\"{u}r die Wiederverwendung numerischer Softwarekomponenten},\n  journal = {in Mackens/ Rump (eds.) Software Engineering im Scientific Computing, Vieweg, p. 51-62, 1996},\n  year = {1996},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Objektorientierte Entwurfsmuster f\\\"{u}r die Wiederverwendung numerischer Softwarekomponenten',0,0,1996,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(992,'paper','WvGbn','techreport','@techreport{WvGbn,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Objektorientiertes Programmieren im wissenschaftlichen Rechnen},\n institution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 181, Sept. 1997},\n year = {1997},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nObjektorientiertes programmieren im wissenschaftlichen rechnen.\nTechnical report, Inst. f. Informatik, Universität W\"urzburg,\nTR 181, Sept. 1997, 1997.\n[ bib  ] 
\n@techreport{WvGbn,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Objektorientiertes Programmieren im wissenschaftlichen Rechnen},\ninstitution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 181, Sept. 1997},\nyear = {1997},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGbn,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Objektorientiertes Programmieren im wissenschaftlichen Rechnen},\n  institution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 181, Sept. 1997},\n  year = {1997},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Objektorientiertes Programmieren im wissenschaftlichen Rechnen',0,0,1997,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(993,'paper','WvGbo','techreport','@techreport{WvGbo,\n author = {M. Neaga and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Functional and Design Specification of the PASCAL-SC Compiler: Pass 1},\n institution = {ESPRIT DIAMOND consortium, No. 03/1/1/K1, 1986},\n year = {1986},\n tags = {Reliability},\n}\n\n','\n\nM. Neaga and Jürgen Wolff von Gudenberg.\nFunctional and design specification of the pascal-sc compiler: Pass\n1.\nTechnical report, ESPRIT DIAMOND consortium, No. 03/1/1/K1, 1986,\n1986.\n[ bib  ] 
\n@techreport{WvGbo,\nauthor = {M. Neaga and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Functional and Design Specification of the PASCAL-SC Compiler: Pass 1},\ninstitution = {ESPRIT DIAMOND consortium, No. 03/1/1/K1, 1986},\nyear = {1986},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGbo,\n  author = {M. Neaga and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Functional and Design Specification of the PASCAL-SC Compiler: Pass 1},\n  institution = {ESPRIT DIAMOND consortium, No. 03/1/1/K1, 1986},\n  year = {1986},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Functional and Design Specification of the PASCAL-SC Compiler: Pass 1',0,0,1986,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(994,'paper','WvGbp','article','@article{WvGbp,\n author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Eine OMT-Beschreibung durch attributierte Grammatiken und Hornklauseln},\n journal = {(Abstract), Softwaretechnik-Trends, 1997},\n year = {1997},\n tags = {Reliability},\n}\n\n','\n\nJ. Seemann and Jürgen Wolff von Gudenberg.\nEine omt-beschreibung durch attributierte grammatiken und\nhornklauseln.\n(Abstract), Softwaretechnik-Trends, 1997, 1997.\n[ bib  ] 
\n@article{WvGbp,\nauthor = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Eine OMT-Beschreibung durch attributierte Grammatiken und Hornklauseln},\njournal = {(Abstract), Softwaretechnik-Trends, 1997},\nyear = {1997},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbp,\n  author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Eine OMT-Beschreibung durch attributierte Grammatiken und Hornklauseln},\n  journal = {(Abstract), Softwaretechnik-Trends, 1997},\n  year = {1997},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Eine OMT-Beschreibung durch attributierte Grammatiken und Hornklauseln',0,0,1997,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:07',0),(995,'paper','WvGbq','techreport','@techreport{WvGbq,\n author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n title = {OMT-Script eine Programmiersprache f\\\"{u}r objektorientierten Entwurf},\n institution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 187, Okt. 1997},\n year = {1997},\n tags = {Reliability},\n}\n\n','\n\nJ. Seemann and Jürgen Wolff von Gudenberg.\nOmt-script eine programmiersprache für objektorientierten\nentwurf.\nTechnical report, Inst. f. Informatik, Universität W\"urzburg,\nTR 187, Okt. 1997, 1997.\n[ bib  ] 
\n@techreport{WvGbq,\nauthor = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {OMT-Script eine Programmiersprache f\\\"{u}r objektorientierten Entwurf},\ninstitution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 187, Okt. 1997},\nyear = {1997},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGbq,\n  author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {OMT-Script eine Programmiersprache f\\\"{u}r objektorientierten Entwurf},\n  institution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 187, Okt. 1997},\n  year = {1997},\n  tags = {Reliability}\n}\n
\n\n',NULL,'OMT-Script eine Programmiersprache f\\\"{u}r objektorientierten Entwurf',0,0,1997,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:08',0),(996,'paper','WvGbr','article','@article{WvGbr,\n author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n title = {UMLscript A Programming Language for Object-Oriented Design},\n journal = {Proceedings of the UML-Workshop 97, Physika-Verlag, p.160-169, 1998},\n year = {1998},\n tags = {Reliability},\n}\n\n','\n\nJ. Seemann and Jürgen Wolff von Gudenberg.\nUmlscript a programming language for object-oriented design.\nProceedings of the UML-Workshop 97, Physika-Verlag, p.160-169,\n1998, 1998.\n[ bib  ] 
\n@article{WvGbr,\nauthor = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {UMLscript A Programming Language for Object-Oriented Design},\njournal = {Proceedings of the UML-Workshop 97, Physika-Verlag, p.160-169, 1998},\nyear = {1998},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbr,\n  author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {UMLscript A Programming Language for Object-Oriented Design},\n  journal = {Proceedings of the UML-Workshop 97, Physika-Verlag, p.160-169, 1998},\n  year = {1998},\n  tags = {Reliability}\n}\n
\n\n',NULL,'UMLscript A Programming Language for Object-Oriented Design',0,0,1998,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:08',0),(997,'paper','WvGbs','article','@article{WvGbs,\n author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Visualization of Differences between Versions of Object-Oriented Sofware},\n journal = {Proc. of 2nd Euromicro Working Conference on Software Maintenance and Reengineering, IEEE, p.~201-204, 1998},\n year = {1998},\n tags = {Reliability},\n}\n\n','\n\nJ. Seemann and Jürgen Wolff von Gudenberg.\nVisualization of differences between versions of object-oriented\nsofware.\nProc. of 2nd Euromicro Working Conference on Software\nMaintenance and Reengineering, IEEE, p. 201-204, 1998, 1998.\n[ bib  ] 
\n@article{WvGbs,\nauthor = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Visualization of Differences between Versions of Object-Oriented Sofware},\njournal = {Proc. of 2nd Euromicro Working Conference on Software Maintenance and Reengineering, IEEE, p.~201-204, 1998},\nyear = {1998},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbs,\n  author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Visualization of Differences between Versions of Object-Oriented Sofware},\n  journal = {Proc. of 2nd Euromicro Working Conference on Software Maintenance and Reengineering, IEEE, p.~201-204, 1998},\n  year = {1998},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Visualization of Differences between Versions of Object-Oriented Sofware',0,0,1998,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:08',0),(998,'paper','WvGbt','article','@article{WvGbt,\n author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Aktuelles Schlagwort UML Unified Modeling Language},\n journal = {Informatik Spekrum 21, p.89-90, 1998},\n year = {1998},\n tags = {Reliability},\n}\n\n','\n\nJ. Seemann and Jürgen Wolff von Gudenberg.\nAktuelles schlagwort uml unified modeling language.\nInformatik Spekrum 21, p.89-90, 1998, 1998.\n[ bib  ] 
\n@article{WvGbt,\nauthor = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Aktuelles Schlagwort UML Unified Modeling Language},\njournal = {Informatik Spekrum 21, p.89-90, 1998},\nyear = {1998},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbt,\n  author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Aktuelles Schlagwort UML Unified Modeling Language},\n  journal = {Informatik Spekrum 21, p.89-90, 1998},\n  year = {1998},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Aktuelles Schlagwort UML Unified Modeling Language',0,0,1998,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:08',0),(999,'paper','WvGbu','article','@article{WvGbu,\n author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Extension of UML Sequence Diagrams for Real-Time Systems},\n journal = {International UML Workshop, Mulhouse, June 1998, und LNCS 1618, Springer, 1999},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nJ. Seemann and Jürgen Wolff von Gudenberg.\nExtension of uml sequence diagrams for real-time systems.\nInternational UML Workshop, Mulhouse, June 1998, und LNCS 1618,\nSpringer, 1999, 1999.\n[ bib  ] 
\n@article{WvGbu,\nauthor = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Extension of UML Sequence Diagrams for Real-Time Systems},\njournal = {International UML Workshop, Mulhouse, June 1998, und LNCS 1618, Springer, 1999},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbu,\n  author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Extension of UML Sequence Diagrams for Real-Time Systems},\n  journal = {International UML Workshop, Mulhouse, June 1998, und LNCS 1618, Springer, 1999},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Extension of UML Sequence Diagrams for Real-Time Systems',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:08',0),(1000,'paper','WvGbv','article','@article{WvGbv,\n author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Pattern-Based Design Recovery of Java Software},\n journal = {Symposium on Foundations of Software Engineering, FSE-6, p. 10-16, ACM, 1998},\n year = {1998},\n tags = {Reliability},\n}\n\n','\n\nJ. Seemann and Jürgen Wolff von Gudenberg.\nPattern-based design recovery of java software.\nSymposium on Foundations of Software Engineering, FSE-6, p.\n10-16, ACM, 1998, 1998.\n[ bib  ] 
\n@article{WvGbv,\nauthor = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Pattern-Based Design Recovery of Java Software},\njournal = {Symposium on Foundations of Software Engineering, FSE-6, p. 10-16, ACM, 1998},\nyear = {1998},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbv,\n  author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Pattern-Based Design Recovery of Java Software},\n  journal = {Symposium on Foundations of Software Engineering, FSE-6, p. 10-16, ACM, 1998},\n  year = {1998},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Pattern-Based Design Recovery of Java Software',0,0,1998,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:08',0),(1001,'paper','WvGbw','article','@article{WvGbw,\n author = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Parallel Accurate Linear Algebra in Java},\n journal = {(Abstract) Reliable Computing 5 (1), p. 99, 1999},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nM. Lerch and Jürgen Wolff von Gudenberg.\nParallel accurate linear algebra in java.\n(Abstract) Reliable Computing 5 (1), p. 99, 1999, 1999.\n[ bib  ] 
\n@article{WvGbw,\nauthor = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Parallel Accurate Linear Algebra in Java},\njournal = {(Abstract) Reliable Computing 5 (1), p. 99, 1999},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbw,\n  author = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Parallel Accurate Linear Algebra in Java},\n  journal = {(Abstract) Reliable Computing 5 (1), p. 99, 1999},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Parallel Accurate Linear Algebra in Java',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:08',0),(1002,'paper','WvGbx','article','@article{WvGbx,\n author = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Expression Templates for Dotproduct Expressions},\n journal = {Interval 98, Reliable Computing 5 (1), p. 69-80, 1999},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nM. Lerch and Jürgen Wolff von Gudenberg.\nExpression templates for dotproduct expressions.\nInterval 98, Reliable Computing 5 (1), p. 69-80, 1999, 1999.\n[ bib  ] 
\n@article{WvGbx,\nauthor = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Expression Templates for Dotproduct Expressions},\njournal = {Interval 98, Reliable Computing 5 (1), p. 69-80, 1999},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGbx,\n  author = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Expression Templates for Dotproduct Expressions},\n  journal = {Interval 98, Reliable Computing 5 (1), p. 69-80, 1999},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Expression Templates for Dotproduct Expressions',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:02','2016-06-01 09:41:08',0),(1003,'paper','WvGby','article','@article{WvGby,\n author = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Multiaspect Interval Types},\n journal = {in Developments in Reliable Computing, T. Csendes (ed.), Kluwer, p. 365-372, 1999},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nM. Lerch and Jürgen Wolff von Gudenberg.\nMultiaspect interval types.\nin Developments in Reliable Computing, T. Csendes (ed.), Kluwer,\np. 365-372, 1999, 1999.\n[ bib  ] 
\n@article{WvGby,\nauthor = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Multiaspect Interval Types},\njournal = {in Developments in Reliable Computing, T. Csendes (ed.), Kluwer, p. 365-372, 1999},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGby,\n  author = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Multiaspect Interval Types},\n  journal = {in Developments in Reliable Computing, T. Csendes (ed.), Kluwer, p. 365-372, 1999},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Multiaspect Interval Types',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1004,'paper','WvGbz','techreport','@techreport{WvGbz,\n author = {G. Corliss and C. Hu and B. Kearfott and B. Walster and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Interval BLAS},\n institution = {chapter 5 of Document for the Basic Linear Algebra Subprograms, University of Tennessee, Knoxville, 1999},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nG. Corliss, C. Hu, B. Kearfott, B. Walster, and Jürgen Wolff von Gudenberg.\nInterval blas.\nTechnical report, chapter 5 of Document for the Basic Linear Algebra\nSubprograms, University of Tennessee, Knoxville, 1999, 1999.\n[ bib  ] 
\n@techreport{WvGbz,\nauthor = {G. Corliss and C. Hu and B. Kearfott and B. Walster and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Interval BLAS},\ninstitution = {chapter 5 of Document for the Basic Linear Algebra Subprograms, University of Tennessee, Knoxville, 1999},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGbz,\n  author = {G. Corliss and C. Hu and B. Kearfott and B. Walster and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Interval BLAS},\n  institution = {chapter 5 of Document for the Basic Linear Algebra Subprograms, University of Tennessee, Knoxville, 1999},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Interval BLAS',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1005,'paper','WvGca','article','@article{WvGca,\n author = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Arithmetic of Complex Sets},\n journal = {Nickel\'s Classical Paper Revisited from a Geometric Viewpoint\"},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nV. Kreinovich and Jürgen Wolff von Gudenberg.\nArithmetic of complex sets.\nNickel\'s Classical Paper Revisited from a Geometric Viewpoint\",\n1999.\n[ bib  ] 
\n@article{WvGca,\nauthor = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Arithmetic of Complex Sets},\njournal = {Nickel\'s Classical Paper Revisited from a Geometric Viewpoint\"},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGca,\n  author = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Arithmetic of Complex Sets},\n  journal = {Nickel\'s Classical Paper Revisited from a Geometric Viewpoint\"},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Arithmetic of Complex Sets',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1006,'paper','WvGcb','techreport','@techreport{WvGcb,\n author = {R. Kolla and A. Vodopivec and J\\\"{u}rgen Wolff von Gudenberg},\n title = {The IAX,Interval Arithmetic Extension Architecture},\n institution = {University of W\"{u}rzburg},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nR. Kolla, A. Vodopivec, and Jürgen Wolff von Gudenberg.\nThe iax,interval arithmetic extension architecture.\nTechnical report, University of W\"urzburg, 1999.\n[ bib  ] 
\n@techreport{WvGcb,\nauthor = {R. Kolla and A. Vodopivec and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {The IAX,Interval Arithmetic Extension Architecture},\ninstitution = {University of W\"{u}rzburg},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGcb,\n  author = {R. Kolla and A. Vodopivec and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {The IAX,Interval Arithmetic Extension Architecture},\n  institution = {University of W\"{u}rzburg},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'The IAX,Interval Arithmetic Extension Architecture',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1007,'paper','WvGcc','article','@article{WvGcc,\n author = {R. Kolla and A. Vodopivec and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Splitting Double Precision FPUs for Single Precision Interval Arithmetic},\n journal = {in W. Erhard et al. (Hrsg.) ARCS\'99 Workshops zur Architektur von Rechensystemen, Uni Jena, 1999, p.~5-16,1999},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nR. Kolla, A. Vodopivec, and Jürgen Wolff von Gudenberg.\nSplitting double precision fpus for single precision interval\narithmetic.\nin W. Erhard et al. (Hrsg.) ARCS\'99 Workshops zur Architektur\nvon Rechensystemen, Uni Jena, 1999, p. 5-16,1999, 1999.\n[ bib  ] 
\n@article{WvGcc,\nauthor = {R. Kolla and A. Vodopivec and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Splitting Double Precision FPUs for Single Precision Interval Arithmetic},\njournal = {in W. Erhard et al. (Hrsg.) ARCS\'99 Workshops zur Architektur von Rechensystemen, Uni Jena, 1999, p.~5-16,1999},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcc,\n  author = {R. Kolla and A. Vodopivec and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Splitting Double Precision FPUs for Single Precision Interval Arithmetic},\n  journal = {in W. Erhard et al. (Hrsg.) ARCS\'99 Workshops zur Architektur von Rechensystemen, Uni Jena, 1999, p.~5-16,1999},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Splitting Double Precision FPUs for Single Precision Interval Arithmetic',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1008,'paper','WvGcd','article','@article{WvGcd,\n author = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Candidate Sets for Complex Interval Arithmetic},\n journal = {in H. Mohanty, C. Baral: CIT 99 Trends in Information Technology, Tata McGraw-Hill, New Delhi, p. 230-233, 1999},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nV. Kreinovich and Jürgen Wolff von Gudenberg.\nCandidate sets for complex interval arithmetic.\nin H. Mohanty, C. Baral: CIT 99 Trends in Information\nTechnology, Tata McGraw-Hill, New Delhi, p. 230-233, 1999, 1999.\n[ bib  ] 
\n@article{WvGcd,\nauthor = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Candidate Sets for Complex Interval Arithmetic},\njournal = {in H. Mohanty, C. Baral: CIT 99 Trends in Information Technology, Tata McGraw-Hill, New Delhi, p. 230-233, 1999},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcd,\n  author = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Candidate Sets for Complex Interval Arithmetic},\n  journal = {in H. Mohanty, C. Baral: CIT 99 Trends in Information Technology, Tata McGraw-Hill, New Delhi, p. 230-233, 1999},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Candidate Sets for Complex Interval Arithmetic',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1009,'paper','WvGce','article','@article{WvGce,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Cheap Extension of Floating-Point Units for Interval Arithmetic},\n journal = {in Electronics \'99, Proceedings Vol. 1, TU Sofia, ISBN954-438-260-7, p.~96-101, 1999},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nCheap extension of floating-point units for interval arithmetic.\nin Electronics \'99, Proceedings Vol. 1, TU Sofia,\nISBN954-438-260-7, p. 96-101, 1999, 1999.\n[ bib  ] 
\n@article{WvGce,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Cheap Extension of Floating-Point Units for Interval Arithmetic},\njournal = {in Electronics \'99, Proceedings Vol. 1, TU Sofia, ISBN954-438-260-7, p.~96-101, 1999},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGce,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Cheap Extension of Floating-Point Units for Interval Arithmetic},\n  journal = {in Electronics \'99, Proceedings Vol. 1, TU Sofia, ISBN954-438-260-7, p.~96-101, 1999},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Cheap Extension of Floating-Point Units for Interval Arithmetic',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1010,'paper','WvGcf','article','@article{WvGcf,\n author = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\n title = {fi_lib++ Specification},\n journal = {Implementation and Test of a Library for Extended Interval Arithmetic, in P. Kornerup (ed.) RNC4 Fourth Real Numbers and Computers, p.~111-124, 2000, Online Proceedings RNC 4,},\n year = {2000},\n tags = {Reliability},\n}\n\n','\n\nM. Lerch and Jürgen Wolff von Gudenberg.\nfi_lib++ specification.\nImplementation and Test of a Library for Extended Interval\nArithmetic, in P. Kornerup (ed.) RNC4 Fourth Real Numbers and Computers,\np. 111-124, 2000, Online Proceedings RNC 4,, 2000.\n[ bib  ] 
\n@article{WvGcf,\nauthor = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {fi_lib++ Specification},\njournal = {Implementation and Test of a Library for Extended Interval Arithmetic, in P. Kornerup (ed.) RNC4 Fourth Real Numbers and Computers, p.~111-124, 2000, Online Proceedings RNC 4,},\nyear = {2000},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcf,\n  author = {M. Lerch and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {fi_lib++ Specification},\n  journal = {Implementation and Test of a Library for Extended Interval Arithmetic, in P. Kornerup (ed.) RNC4 Fourth Real Numbers and Computers, p.~111-124, 2000, Online Proceedings RNC 4,},\n  year = {2000},\n  tags = {Reliability}\n}\n
\n\n',NULL,'fi_lib++ Specification',0,0,2000,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1011,'paper','Wvcg','article','@article{Wvcg,\n author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n title = {UML Description of the STL},\n journal = {First Workshop on C++ Template Programming, Erfurt, Okt. 2000,},\n year = {2000},\n tags = {Reliability},\n}\n\n','\n\nH. Eichelberger and Jürgen Wolff von Gudenberg.\nUml description of the stl.\nFirst Workshop on C++ Template Programming, Erfurt, Okt. 2000,,\n2000.\n[ bib  ] 
\n@article{Wvcg,\nauthor = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {UML Description of the STL},\njournal = {First Workshop on C++ Template Programming, Erfurt, Okt. 2000,},\nyear = {2000},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{Wvcg,\n  author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {UML Description of the STL},\n  journal = {First Workshop on C++ Template Programming, Erfurt, Okt. 2000,},\n  year = {2000},\n  tags = {Reliability}\n}\n
\n\n',NULL,'UML Description of the STL',0,0,2000,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1012,'paper','WvGch','article','@article{WvGch,\n author = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {An Optimality Criterion for Arithmetic on Complex Sets},\n journal = {Geombinatorics (ISSN 1065-7371), Vol X, 1, p.~31-37, 2000},\n year = {2000},\n tags = {Reliability},\n}\n\n','\n\nV. Kreinovich and Jürgen Wolff von Gudenberg.\nAn optimality criterion for arithmetic on complex sets.\nGeombinatorics (ISSN 1065-7371), Vol X, 1, p. 31-37, 2000,\n2000.\n[ bib  ] 
\n@article{WvGch,\nauthor = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {An Optimality Criterion for Arithmetic on Complex Sets},\njournal = {Geombinatorics (ISSN 1065-7371), Vol X, 1, p.~31-37, 2000},\nyear = {2000},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGch,\n  author = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {An Optimality Criterion for Arithmetic on Complex Sets},\n  journal = {Geombinatorics (ISSN 1065-7371), Vol X, 1, p.~31-37, 2000},\n  year = {2000},\n  tags = {Reliability}\n}\n
\n\n',NULL,'An Optimality Criterion for Arithmetic on Complex Sets',0,0,2000,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1013,'paper','WvGci','techreport','@techreport{WvGci,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Software Engineering -- 30 Jahre Softwarekrise ?},\n institution = {Lehrerfortbildung,Inst. f. Informatik, Universit\\\"{a}tW\"{u}rzburg, Okt. 2000},\n year = {2000},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nSoftware engineering - 30 jahre softwarekrise ?\nTechnical report, Lehrerfortbildung,Inst. f. Informatik,\nUniversitätW\"urzburg, Okt. 2000, 2000.\n[ bib  ] 
\n@techreport{WvGci,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Software Engineering -- 30 Jahre Softwarekrise ?},\ninstitution = {Lehrerfortbildung,Inst. f. Informatik, Universit\\\"{a}tW\"{u}rzburg, Okt. 2000},\nyear = {2000},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGci,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Software Engineering -- 30 Jahre Softwarekrise ?},\n  institution = {Lehrerfortbildung,Inst. f. Informatik, Universit\\\"{a}tW\"{u}rzburg, Okt. 2000},\n  year = {2000},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Software Engineering -- 30 Jahre Softwarekrise ?',0,0,2000,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1014,'paper','WvGcj','techreport','@techreport{WvGcj,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Multimedia Architectures and Interval Arithmetic},\n institution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 265, Okt. 2000},\n year = {2000},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nMultimedia architectures and interval arithmetic.\nTechnical report, Inst. f. Informatik, Universität W\"urzburg,\nTR 265, Okt. 2000, 2000.\n[ bib  ] 
\n@techreport{WvGcj,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Multimedia Architectures and Interval Arithmetic},\ninstitution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 265, Okt. 2000},\nyear = {2000},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGcj,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Multimedia Architectures and Interval Arithmetic},\n  institution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 265, Okt. 2000},\n  year = {2000},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Multimedia Architectures and Interval Arithmetic',0,0,2000,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1015,'paper','WvGck','techreport','@techreport{WvGck,\n author = {H. Eichelberger and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Comprehensive Graphical Description of the STL},\n institution = {Inst. f. Informatik, Universit\\\"{a}tW\"{u}rzburg, TR 270, Feb. 2001},\n year = {2001},\n tags = {Reliability},\n}\n\n','\n\nH. Eichelberger, G. Tischler, and Jürgen Wolff von Gudenberg.\nComprehensive graphical description of the stl.\nTechnical report, Inst. f. Informatik, UniversitätW\"urzburg, TR\n270, Feb. 2001, 2001.\n[ bib  ] 
\n@techreport{WvGck,\nauthor = {H. Eichelberger and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Comprehensive Graphical Description of the STL},\ninstitution = {Inst. f. Informatik, Universit\\\"{a}tW\"{u}rzburg, TR 270, Feb. 2001},\nyear = {2001},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGck,\n  author = {H. Eichelberger and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Comprehensive Graphical Description of the STL},\n  institution = {Inst. f. Informatik, Universit\\\"{a}tW\"{u}rzburg, TR 270, Feb. 2001},\n  year = {2001},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Comprehensive Graphical Description of the STL',0,0,2001,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1016,'paper','WvGcl','article','@article{WvGcl,\n author = {G. Mayer and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Stichw\\\"{o}rter zur Intervallrechnung},\n journal = {Lexikon der Mathematik, Spektrum, 1999-2001},\n year = {1999},\n tags = {Reliability},\n}\n\n','\n\nG. Mayer and Jürgen Wolff von Gudenberg.\nStichwörter zur intervallrechnung.\nLexikon der Mathematik, Spektrum, 1999-2001, 1999.\n[ bib  ] 
\n@article{WvGcl,\nauthor = {G. Mayer and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Stichw\\\"{o}rter zur Intervallrechnung},\njournal = {Lexikon der Mathematik, Spektrum, 1999-2001},\nyear = {1999},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcl,\n  author = {G. Mayer and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Stichw\\\"{o}rter zur Intervallrechnung},\n  journal = {Lexikon der Mathematik, Spektrum, 1999-2001},\n  year = {1999},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Stichw\\\"{o}rter zur Intervallrechnung',0,0,1999,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1017,'paper','WvGcm','techreport','@techreport{WvGcm,\n author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n title = {UMLscript Sprachspezifikation},\n institution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 272, Feb. 2001},\n year = {2001},\n tags = {Reliability},\n}\n\n','\n\nH. Eichelberger and Jürgen Wolff von Gudenberg.\nUmlscript sprachspezifikation.\nTechnical report, Inst. f. Informatik, Universität W\"urzburg,\nTR 272, Feb. 2001, 2001.\n[ bib  ] 
\n@techreport{WvGcm,\nauthor = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {UMLscript Sprachspezifikation},\ninstitution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 272, Feb. 2001},\nyear = {2001},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGcm,\n  author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {UMLscript Sprachspezifikation},\n  institution = {Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 272, Feb. 2001},\n  year = {2001},\n  tags = {Reliability}\n}\n
\n\n',NULL,'UMLscript Sprachspezifikation',0,0,2001,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1018,'paper','WvGcn','techreport','@techreport{WvGcn,\n author = {M. Lerch and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\n title = {fi_lib++ Interval Library},\n institution = {Specification and Reference Manual, Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 279, Aug. 2001},\n year = {2001},\n tags = {Reliability},\n}\n\n','\n\nM. Lerch, G. Tischler, and Jürgen Wolff von Gudenberg.\nfi_lib++ interval library.\nTechnical report, Specification and Reference Manual, Inst. f.\nInformatik, Universität W\"urzburg, TR 279, Aug. 2001, 2001.\n[ bib  ] 
\n@techreport{WvGcn,\nauthor = {M. Lerch and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {fi_lib++ Interval Library},\ninstitution = {Specification and Reference Manual, Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 279, Aug. 2001},\nyear = {2001},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGcn,\n  author = {M. Lerch and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {fi_lib++ Interval Library},\n  institution = {Specification and Reference Manual, Inst. f. Informatik, Universit\\\"{a}t W\"{u}rzburg, TR 279, Aug. 2001},\n  year = {2001},\n  tags = {Reliability}\n}\n
\n\n',NULL,'fi_lib++ Interval Library',0,0,2001,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1019,'paper','WvGco','article','@article{WvGco,\n author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n title = {On the Visualization of Java Programs},\n journal = {in S. Diehl (ed.) Software Visualization, LNCS 2269, p.295-306, 2002},\n year = {2002},\n tags = {Reliability},\n}\n\n','\n\nH. Eichelberger and Jürgen Wolff von Gudenberg.\nOn the visualization of java programs.\nin S. Diehl (ed.) Software Visualization, LNCS 2269, p.295-306,\n2002, 2002.\n[ bib  ] 
\n@article{WvGco,\nauthor = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {On the Visualization of Java Programs},\njournal = {in S. Diehl (ed.) Software Visualization, LNCS 2269, p.295-306, 2002},\nyear = {2002},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGco,\n  author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {On the Visualization of Java Programs},\n  journal = {in S. Diehl (ed.) Software Visualization, LNCS 2269, p.295-306, 2002},\n  year = {2002},\n  tags = {Reliability}\n}\n
\n\n',NULL,'On the Visualization of Java Programs',0,0,2002,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1020,'paper','WvGcp','techreport','@techreport{WvGcp,\n author = {W. Hofschuster and W. Kr\\\"{a}mer and M. Lerch and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\n title = {The Interval Library fi_lib++ 2.0},\n institution = {Design, Features and Sample Programs, Preprint 2001/4,Universit\\\"{a}t Wuppertal, Dec 2001},\n year = {2001},\n tags = {Reliability},\n}\n\n','\n\nW. Hofschuster, W. Krämer, M. Lerch, G. Tischler, and Jürgen Wolff von\nGudenberg.\nThe interval library fi_lib++ 2.0.\nTechnical report, Design, Features and Sample Programs, Preprint\n2001/4,Universität Wuppertal, Dec 2001, 2001.\n[ bib  ] 
\n@techreport{WvGcp,\nauthor = {W. Hofschuster and W. Kr\\\"{a}mer and M. Lerch and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {The Interval Library fi_lib++ 2.0},\ninstitution = {Design, Features and Sample Programs, Preprint 2001/4,Universit\\\"{a}t Wuppertal, Dec 2001},\nyear = {2001},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGcp,\n  author = {W. Hofschuster and W. Kr\\\"{a}mer and M. Lerch and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {The Interval Library fi_lib++ 2.0},\n  institution = {Design, Features and Sample Programs, Preprint 2001/4,Universit\\\"{a}t Wuppertal, Dec 2001},\n  year = {2001},\n  tags = {Reliability}\n}\n
\n\n',NULL,'The Interval Library fi_lib++ 2.0',0,0,2001,0,NULL,NULL,NULL,'2016-02-20 23:19:03','2016-06-01 09:41:08',0),(1021,'paper','WvGcq','article','@article{WvGcq,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Interval Arithmetic on Multimedia Architectures},\n journal = {Reliable Computing, Reliable Computing 8 (4), 2002},\n year = {2002},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nInterval arithmetic on multimedia architectures.\nReliable Computing, Reliable Computing 8 (4), 2002, 2002.\n[ bib  ] 
\n@article{WvGcq,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Interval Arithmetic on Multimedia Architectures},\njournal = {Reliable Computing, Reliable Computing 8 (4), 2002},\nyear = {2002},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcq,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Interval Arithmetic on Multimedia Architectures},\n  journal = {Reliable Computing, Reliable Computing 8 (4), 2002},\n  year = {2002},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Interval Arithmetic on Multimedia Architectures',0,0,2002,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1022,'paper','WvGcr','article','@article{WvGcr,\n author = {W. Hofschuster and W. Kr\\\"{a}mer and M. Lerch and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\n title = {filib++ a Fast Interval Library Supporting Containment Computations},\n journal = {TOMS Vol 32 No 2, pp.299 - 324, 2006},\n year = {2005},\n tags = {Reliability},\n}\n\n','\n\nW. Hofschuster, W. Krämer, M. Lerch, G. Tischler, and Jürgen Wolff von\nGudenberg.\nfilib++ a fast interval library supporting containment computations.\nTOMS Vol 32 No 2, pp.299 - 324, 2006, 2005.\n[ bib  ] 
\n@article{WvGcr,\nauthor = {W. Hofschuster and W. Kr\\\"{a}mer and M. Lerch and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {filib++ a Fast Interval Library Supporting Containment Computations},\njournal = {TOMS Vol 32 No 2, pp.299 - 324, 2006},\nyear = {2005},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcr,\n  author = {W. Hofschuster and W. Kr\\\"{a}mer and M. Lerch and G. Tischler and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {filib++ a Fast Interval Library Supporting Containment Computations},\n  journal = {TOMS Vol 32 No 2, pp.299 - 324, 2006},\n  year = {2005},\n  tags = {Reliability}\n}\n
\n\n',NULL,'filib++ a Fast Interval Library Supporting Containment Computations',0,0,2005,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1023,'paper','WvGcs','article','@article{WvGcs,\n author = {W. Kr\\\"{a}mer and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Extended Interval Power Function},\n journal = {Proceedings of Validated Computing, Reliable Computing, 2003},\n year = {2003},\n tags = {Reliability},\n}\n\n','\n\nW. Krämer and Jürgen Wolff von Gudenberg.\nExtended interval power function.\nProceedings of Validated Computing, Reliable Computing, 2003,\n2003.\n[ bib  ] 
\n@article{WvGcs,\nauthor = {W. Kr\\\"{a}mer and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Extended Interval Power Function},\njournal = {Proceedings of Validated Computing, Reliable Computing, 2003},\nyear = {2003},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcs,\n  author = {W. Kr\\\"{a}mer and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Extended Interval Power Function},\n  journal = {Proceedings of Validated Computing, Reliable Computing, 2003},\n  year = {2003},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Extended Interval Power Function',0,0,2003,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1024,'paper','WvGct','article','@article{WvGct,\n author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Software-Entwurf mit UML Objektorientierte Modellierung mit Beispielen in Java},\n journal = {Springer, Heidelberg},\n year = {2000},\n tags = {Reliability},\n}\n\n','\n\nJ. Seemann and Jürgen Wolff von Gudenberg.\nSoftware-entwurf mit uml objektorientierte modellierung mit\nbeispielen in java.\nSpringer, Heidelberg, 2000.\n[ bib  ] 
\n@article{WvGct,\nauthor = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Software-Entwurf mit UML Objektorientierte Modellierung mit Beispielen in Java},\njournal = {Springer, Heidelberg},\nyear = {2000},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGct,\n  author = {J. Seemann and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Software-Entwurf mit UML Objektorientierte Modellierung mit Beispielen in Java},\n  journal = {Springer, Heidelberg},\n  year = {2000},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Software-Entwurf mit UML Objektorientierte Modellierung mit Beispielen in Java',0,0,2000,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1025,'paper','WvGcu','article','@article{WvGcu,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Objektorientiert programmieren von Anfang an Eine Einf\\\"{u}hrung mit C++},\n journal = {BI Wissenschaftsverlag, Mannheim},\n year = {1993},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nObjektorientiert programmieren von anfang an eine einführung mit\nc++.\nBI Wissenschaftsverlag, Mannheim, 1993.\n[ bib  ] 
\n@article{WvGcu,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Objektorientiert programmieren von Anfang an Eine Einf\\\"{u}hrung mit C++},\njournal = {BI Wissenschaftsverlag, Mannheim},\nyear = {1993},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcu,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Objektorientiert programmieren von Anfang an Eine Einf\\\"{u}hrung mit C++},\n  journal = {BI Wissenschaftsverlag, Mannheim},\n  year = {1993},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Objektorientiert programmieren von Anfang an Eine Einf\\\"{u}hrung mit C++',0,0,1993,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 10:16:55',0),(1026,'paper','WvGcv','article','@article{WvGcv,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Objektorientiert programmieren von Anfang an Eine Einf\\\"{u}hrung mit C++},\n journal = {2. Auflage :Spektrum AkademischerVerlag, Heidelberg},\n year = {1996},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nObjektorientiert programmieren von anfang an eine einführung mit\nc++.\n2. Auflage :Spektrum AkademischerVerlag, Heidelberg, 1996.\n[ bib  ] 
\n@article{WvGcv,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Objektorientiert programmieren von Anfang an Eine Einf\\\"{u}hrung mit C++},\njournal = {2. Auflage :Spektrum AkademischerVerlag, Heidelberg},\nyear = {1996},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcv,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Objektorientiert programmieren von Anfang an Eine Einf\\\"{u}hrung mit C++},\n  journal = {2. Auflage :Spektrum AkademischerVerlag, Heidelberg},\n  year = {1996},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Objektorientiert programmieren von Anfang an Eine Einf\\\"{u}hrung mit C++',0,0,1996,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 10:15:58',0),(1027,'paper','WvGcw','article','@article{WvGcw,\n author = {J. Puchan and W. Stucky and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Programmieren mit Modula-2},\n journal = {BG Teubner, Stuttgart, 2. Auflage},\n year = {1993},\n tags = {Reliability},\n}\n\n','\n\nJ. Puchan, W. Stucky, and Jürgen Wolff von Gudenberg.\nProgrammieren mit modula-2.\nBG Teubner, Stuttgart, 2. Auflage, 1993.\n[ bib  ] 
\n@article{WvGcw,\nauthor = {J. Puchan and W. Stucky and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Programmieren mit Modula-2},\njournal = {BG Teubner, Stuttgart, 2. Auflage},\nyear = {1993},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcw,\n  author = {J. Puchan and W. Stucky and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Programmieren mit Modula-2},\n  journal = {BG Teubner, Stuttgart, 2. Auflage},\n  year = {1993},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Programmieren mit Modula-2',0,0,1993,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1028,'paper','WvGcx','article','@article{WvGcx,\n author = {E. Kaucher and R. Klatte and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Programmiersprachen im Griff, Band 4: ADA},\n journal = {BI Wissenschaftsverlag, Mannheim},\n year = {1983},\n tags = {Reliability},\n}\n\n','\n\nE. Kaucher, R. Klatte, C. Ullrich, and Jürgen Wolff von Gudenberg.\nProgrammiersprachen im griff, band 4: Ada.\nBI Wissenschaftsverlag, Mannheim, 1983.\n[ bib  ] 
\n@article{WvGcx,\nauthor = {E. Kaucher and R. Klatte and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Programmiersprachen im Griff, Band 4: ADA},\njournal = {BI Wissenschaftsverlag, Mannheim},\nyear = {1983},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcx,\n  author = {E. Kaucher and R. Klatte and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Programmiersprachen im Griff, Band 4: ADA},\n  journal = {BI Wissenschaftsverlag, Mannheim},\n  year = {1983},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Programmiersprachen im Griff, Band 4: ADA',0,0,1983,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1029,'paper','WvGcy','book','@book{WvGcy,\n author = {W. Kr\\\"{a}mer and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Scientific Computing, Validated Numerics, Interval Methods, Proceedings of the conference Scan-2000/Interval-2000},\n publisher = {Kluwer/Plenum, New York},\n year = {2001},\n tags = {Reliability},\n}\n\n','\n\nW. Krämer and Jürgen Wolff von Gudenberg.\nScientific Computing, Validated Numerics, Interval Methods,\nProceedings of the conference Scan-2000/Interval-2000.\nKluwer/Plenum, New York, 2001.\n[ bib  ] 
\n@book{WvGcy,\nauthor = {W. Kr\\\"{a}mer and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Scientific Computing, Validated Numerics, Interval Methods, Proceedings of the conference Scan-2000/Interval-2000},\npublisher = {Kluwer/Plenum, New York},\nyear = {2001},\ntags = {Reliability}\n}\n
\n
\n','
\n@book{WvGcy,\n  author = {W. Kr\\\"{a}mer and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Scientific Computing, Validated Numerics, Interval Methods, Proceedings of the conference Scan-2000/Interval-2000},\n  publisher = {Kluwer/Plenum, New York},\n  year = {2001},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Scientific Computing, Validated Numerics, Interval Methods, Proceedings of the conference Scan-2000/Interval-2000',0,0,2001,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1030,'paper','WvGcz','article','@article{WvGcz,\n author = {E. Kaucher and R. Klatte and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {{Programmiersprachen im Griff, Band 6: \\\"{U}bungen und Tests in Pascal}},\n journal = {BI Wissenschaftsverlag, Mannheim},\n year = {1984},\n tags = {Reliability},\n}\n\n','\n\nE. Kaucher, R. Klatte, C. Ullrich, and Jürgen Wolff von Gudenberg.\nProgrammiersprachen im Griff, Band 6: Übungen und Tests in\nPascal.\nBI Wissenschaftsverlag, Mannheim, 1984.\n[ bib  ] 
\n@article{WvGcz,\nauthor = {E. Kaucher and R. Klatte and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {{Programmiersprachen im Griff, Band 6: \\\"{U}bungen und Tests in Pascal}},\njournal = {BI Wissenschaftsverlag, Mannheim},\nyear = {1984},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGcz,\n  author = {E. Kaucher and R. Klatte and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {{Programmiersprachen im Griff, Band 6: \\\"{U}bungen und Tests in Pascal}},\n  journal = {BI Wissenschaftsverlag, Mannheim},\n  year = {1984},\n  tags = {Reliability}\n}\n
\n\n',NULL,'{Programmiersprachen im Griff, Band 6: \\\"{U}bungen und Tests in Pascal}',0,0,1984,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 10:17:48',0),(1031,'paper','WvGda','article','@article{WvGda,\n author = {G. Bohlender and L.B. Rall and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {PASCAL-SC, A Computer Language for Scientific Computation},\n journal = {Academic Press, Boston},\n year = {1987},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, L.B. Rall, C. Ullrich, and Jürgen Wolff von Gudenberg.\nPascal-sc, a computer language for scientific computation.\nAcademic Press, Boston, 1987.\n[ bib  ] 
\n@article{WvGda,\nauthor = {G. Bohlender and L.B. Rall and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {PASCAL-SC, A Computer Language for Scientific Computation},\njournal = {Academic Press, Boston},\nyear = {1987},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGda,\n  author = {G. Bohlender and L.B. Rall and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {PASCAL-SC, A Computer Language for Scientific Computation},\n  journal = {Academic Press, Boston},\n  year = {1987},\n  tags = {Reliability}\n}\n
\n\n',NULL,'PASCAL-SC, A Computer Language for Scientific Computation',0,0,1987,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1032,'paper','WvGdb','article','@article{WvGdb,\n author = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Accurate Numerical Algorithms},\n journal = {Springer Research Reports ESPRIT},\n year = {1989},\n tags = {Reliability},\n}\n\n','\n\nCh. Ullrich and Jürgen Wolff von Gudenberg.\nAccurate numerical algorithms.\nSpringer Research Reports ESPRIT, 1989.\n[ bib  ] 
\n@article{WvGdb,\nauthor = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Accurate Numerical Algorithms},\njournal = {Springer Research Reports ESPRIT},\nyear = {1989},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdb,\n  author = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Accurate Numerical Algorithms},\n  journal = {Springer Research Reports ESPRIT},\n  year = {1989},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Accurate Numerical Algorithms',0,0,1989,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1033,'paper','WvGdc','article','@article{WvGdc,\n author = {A.P. Voshchinin and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Proceedings of the Conference \'Interval-92\'},\n journal = {Interval Computations No. 3(5) und No. 4(6), St. Petersburg--Moskau},\n year = {1992},\n tags = {Reliability},\n}\n\n','\n\nA.P. Voshchinin and Jürgen Wolff von Gudenberg.\nProceedings of the conference \'interval-92\'.\nInterval Computations No. 3(5) und No. 4(6), St.\nPetersburg-Moskau, 1992.\n[ bib  ] 
\n@article{WvGdc,\nauthor = {A.P. Voshchinin and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Proceedings of the Conference \'Interval-92\'},\njournal = {Interval Computations No. 3(5) und No. 4(6), St. Petersburg--Moskau},\nyear = {1992},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdc,\n  author = {A.P. Voshchinin and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Proceedings of the Conference \'Interval-92\'},\n  journal = {Interval Computations No. 3(5) und No. 4(6), St. Petersburg--Moskau},\n  year = {1992},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Proceedings of the Conference \'Interval-92\'',0,0,1992,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1034,'paper','WvGdd','article','@article{WvGdd,\n author = {G. Bohlender and L.B. Rall and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {PASCAL-SC, Wirkungsvoll programmieren, kontrolliert rechnen},\n journal = {BI Wissenschaftsverlag, Mannheim},\n year = {1986},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, L.B. Rall, C. Ullrich, and Jürgen Wolff von Gudenberg.\nPascal-sc, wirkungsvoll programmieren, kontrolliert rechnen.\nBI Wissenschaftsverlag, Mannheim, 1986.\n[ bib  ] 
\n@article{WvGdd,\nauthor = {G. Bohlender and L.B. Rall and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {PASCAL-SC, Wirkungsvoll programmieren, kontrolliert rechnen},\njournal = {BI Wissenschaftsverlag, Mannheim},\nyear = {1986},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdd,\n  author = {G. Bohlender and L.B. Rall and C. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {PASCAL-SC, Wirkungsvoll programmieren, kontrolliert rechnen},\n  journal = {BI Wissenschaftsverlag, Mannheim},\n  year = {1986},\n  tags = {Reliability}\n}\n
\n\n',NULL,'PASCAL-SC, Wirkungsvoll programmieren, kontrolliert rechnen',0,0,1986,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1035,'paper','WvGde','article','@article{WvGde,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {{Algorithmen Datenstrukturen Funktionale Programmierung Eine praktische Einf\\\"{u}hrung mit Caml Light}},\n journal = {Addison-Wesley, Bonn},\n year = {1996},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nAlgorithmen Datenstrukturen Funktionale Programmierung Eine\npraktische Einführung mit Caml Light.\nAddison-Wesley, Bonn, 1996.\n[ bib  ] 
\n@article{WvGde,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {{Algorithmen Datenstrukturen Funktionale Programmierung Eine praktische Einf\\\"{u}hrung mit Caml Light}},\njournal = {Addison-Wesley, Bonn},\nyear = {1996},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGde,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {{Algorithmen Datenstrukturen Funktionale Programmierung Eine praktische Einf\\\"{u}hrung mit Caml Light}},\n  journal = {Addison-Wesley, Bonn},\n  year = {1996},\n  tags = {Reliability}\n}\n
\n\n',NULL,'{Algorithmen Datenstrukturen Funktionale Programmierung Eine praktische Einf\\\"{u}hrung mit Caml Light}',0,0,1996,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 10:16:22',0),(1036,'paper','WvGdf','article','@article{WvGdf,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Proceedings of the Conference Interval-96},\n journal = {Reliable Computing 3 (3)},\n year = {1997},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nProceedings of the conference interval-96.\nReliable Computing 3 (3), 1997.\n[ bib  ] 
\n@article{WvGdf,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Proceedings of the Conference Interval-96},\njournal = {Reliable Computing 3 (3)},\nyear = {1997},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdf,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Proceedings of the Conference Interval-96},\n  journal = {Reliable Computing 3 (3)},\n  year = {1997},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Proceedings of the Conference Interval-96',0,0,1997,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1037,'paper','WvGdg','article','@article{WvGdg,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Java for Scientific Computation Pros and Cons},\n journal = {J. Universal Computer Science 4, 1, p.~11-15, 1998},\n year = {1998},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nJava for scientific computation pros and cons.\nJ. Universal Computer Science 4, 1, p. 11-15, 1998, 1998.\n[ bib  ] 
\n@article{WvGdg,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Java for Scientific Computation Pros and Cons},\njournal = {J. Universal Computer Science 4, 1, p.~11-15, 1998},\nyear = {1998},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdg,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Java for Scientific Computation Pros and Cons},\n  journal = {J. Universal Computer Science 4, 1, p.~11-15, 1998},\n  year = {1998},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Java for Scientific Computation Pros and Cons',0,0,1998,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1038,'paper','WvGdh','article','@article{WvGdh,\n author = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Different Approaches to Interval Arithmetic},\n journal = {ESPRIT DIAMOND consortium, No. 03/4/1/K2, 1986, in P.J.L. Wallis (Ed.), Improving Floating Point Programming, Wiley, p.61-72, 1990},\n year = {1990},\n tags = {Reliability},\n}\n\n','\n\nCh. Ullrich and Jürgen Wolff von Gudenberg.\nDifferent approaches to interval arithmetic.\nESPRIT DIAMOND consortium, No. 03/4/1/K2, 1986, in P.J.L. Wallis\n(Ed.), Improving Floating Point Programming, Wiley, p.61-72, 1990, 1990.\n[ bib  ] 
\n@article{WvGdh,\nauthor = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Different Approaches to Interval Arithmetic},\njournal = {ESPRIT DIAMOND consortium, No. 03/4/1/K2, 1986, in P.J.L. Wallis (Ed.), Improving Floating Point Programming, Wiley, p.61-72, 1990},\nyear = {1990},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdh,\n  author = {Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Different Approaches to Interval Arithmetic},\n  journal = {ESPRIT DIAMOND consortium, No. 03/4/1/K2, 1986, in P.J.L. Wallis (Ed.), Improving Floating Point Programming, Wiley, p.61-72, 1990},\n  year = {1990},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Different Approaches to Interval Arithmetic',0,0,1990,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1039,'paper','WvGdi','techreport','@techreport{WvGdi,\n author = {R. Klatte and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Forschungsschwerpunkt Computerarithmetik und Programmiersysteme f\\\"{u}r ingenieurwissenschaftliche Anwendungen},\n institution = {Institut f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1986},\n year = {1986},\n tags = {Reliability},\n}\n\n','\n\nR. Klatte and Jürgen Wolff von Gudenberg.\nForschungsschwerpunkt computerarithmetik und programmiersysteme\nfür ingenieurwissenschaftliche anwendungen.\nTechnical report, Institut für Angewandte Mathematik,\nUniversität Karlsruhe, 1986, 1986.\n[ bib  ] 
\n@techreport{WvGdi,\nauthor = {R. Klatte and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Forschungsschwerpunkt Computerarithmetik und Programmiersysteme f\\\"{u}r ingenieurwissenschaftliche Anwendungen},\ninstitution = {Institut f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1986},\nyear = {1986},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGdi,\n  author = {R. Klatte and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Forschungsschwerpunkt Computerarithmetik und Programmiersysteme f\\\"{u}r ingenieurwissenschaftliche Anwendungen},\n  institution = {Institut f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1986},\n  year = {1986},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Forschungsschwerpunkt Computerarithmetik und Programmiersysteme f\\\"{u}r ingenieurwissenschaftliche Anwendungen',0,0,1986,0,NULL,NULL,NULL,'2016-02-20 23:19:04','2016-06-01 09:41:08',0),(1040,'paper','WvGdj','article','@article{WvGdj,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Syntax und Semantik der vorliegenden Implementierung der PASCAL Spracherweiterung},\n journal = {in Kulisch/Ullrich (Hrsg): Wissenschaftliches Rechnen und Programmiersprachen, German Chapter of the ACM, Berichte 10, Teubner, p. 207-231,1982},\n year = {1982},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nSyntax und semantik der vorliegenden implementierung der pascal\nspracherweiterung.\nin Kulisch/Ullrich (Hrsg): Wissenschaftliches Rechnen und\nProgrammiersprachen, German Chapter of the ACM, Berichte 10, Teubner, p.\n207-231,1982, 1982.\n[ bib  ] 
\n@article{WvGdj,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Syntax und Semantik der vorliegenden Implementierung der PASCAL Spracherweiterung},\njournal = {in Kulisch/Ullrich (Hrsg): Wissenschaftliches Rechnen und Programmiersprachen, German Chapter of the ACM, Berichte 10, Teubner, p. 207-231,1982},\nyear = {1982},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdj,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Syntax und Semantik der vorliegenden Implementierung der PASCAL Spracherweiterung},\n  journal = {in Kulisch/Ullrich (Hrsg): Wissenschaftliches Rechnen und Programmiersprachen, German Chapter of the ACM, Berichte 10, Teubner, p. 207-231,1982},\n  year = {1982},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Syntax und Semantik der vorliegenden Implementierung der PASCAL Spracherweiterung',0,0,1982,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1041,'paper','WvGdk','article','@article{WvGdk,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {PASCAL-Erweiterung f\\\"{u}r wissenschaftliches Rechnen},\n journal = {in Kulisch/Ullrich (Hrsg): Wissenschaftliches Rechnen und Programmiersprachen, German Chapter of the ACM, Berichte 10, Teubner, p. 71-95, 1982},\n year = {1982},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nPascal-erweiterung für wissenschaftliches rechnen.\nin Kulisch/Ullrich (Hrsg): Wissenschaftliches Rechnen und\nProgrammiersprachen, German Chapter of the ACM, Berichte 10, Teubner, p.\n71-95, 1982, 1982.\n[ bib  ] 
\n@article{WvGdk,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {PASCAL-Erweiterung f\\\"{u}r wissenschaftliches Rechnen},\njournal = {in Kulisch/Ullrich (Hrsg): Wissenschaftliches Rechnen und Programmiersprachen, German Chapter of the ACM, Berichte 10, Teubner, p. 71-95, 1982},\nyear = {1982},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdk,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {PASCAL-Erweiterung f\\\"{u}r wissenschaftliches Rechnen},\n  journal = {in Kulisch/Ullrich (Hrsg): Wissenschaftliches Rechnen und Programmiersprachen, German Chapter of the ACM, Berichte 10, Teubner, p. 71-95, 1982},\n  year = {1982},\n  tags = {Reliability}\n}\n
\n\n',NULL,'PASCAL-Erweiterung f\\\"{u}r wissenschaftliches Rechnen',0,0,1982,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1042,'paper','WvGdl','article','@article{WvGdl,\n author = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Optimal Arithmetic and ADA},\n journal = {Proceedings of the 11th IMACS World Congress, Vol. 1, Oslo, p. 179-181, 1985},\n year = {1985},\n tags = {Reliability},\n}\n\n','\n\nR. Klatte, Ch. Ullrich, and Jürgen Wolff von Gudenberg.\nOptimal arithmetic and ada.\nProceedings of the 11th IMACS World Congress, Vol. 1, Oslo, p.\n179-181, 1985, 1985.\n[ bib  ] 
\n@article{WvGdl,\nauthor = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Optimal Arithmetic and ADA},\njournal = {Proceedings of the 11th IMACS World Congress, Vol. 1, Oslo, p. 179-181, 1985},\nyear = {1985},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdl,\n  author = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Optimal Arithmetic and ADA},\n  journal = {Proceedings of the 11th IMACS World Congress, Vol. 1, Oslo, p. 179-181, 1985},\n  year = {1985},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Optimal Arithmetic and ADA',0,0,1985,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1043,'paper','WvGdm','article','@article{WvGdm,\n author = {G. Schumacher and J\\\"{u}rgen Wolff von Gudenberg},\n title = {A Set of Highly Accurate Numerical Algorithms},\n journal = {ESPRIT DIAMOND consortium, Deliverable D 3-6, 1989},\n year = {1989},\n tags = {Reliability},\n}\n\n','\n\nG. Schumacher and Jürgen Wolff von Gudenberg.\nA set of highly accurate numerical algorithms.\nESPRIT DIAMOND consortium, Deliverable D 3-6, 1989, 1989.\n[ bib  ] 
\n@article{WvGdm,\nauthor = {G. Schumacher and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {A Set of Highly Accurate Numerical Algorithms},\njournal = {ESPRIT DIAMOND consortium, Deliverable D 3-6, 1989},\nyear = {1989},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdm,\n  author = {G. Schumacher and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {A Set of Highly Accurate Numerical Algorithms},\n  journal = {ESPRIT DIAMOND consortium, Deliverable D 3-6, 1989},\n  year = {1989},\n  tags = {Reliability}\n}\n
\n\n',NULL,'A Set of Highly Accurate Numerical Algorithms',0,0,1989,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1044,'paper','WvGdn','article','@article{WvGdn,\n author = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Optimal Arithmetic and ADA},\n journal = {IMACS 1985 Trans. on Scientific Computation, Vol. 2, Computer Systems: Perfomance and Simulation, North-Holland, 1986},\n year = {1986},\n tags = {Reliability},\n}\n\n','\n\nR. Klatte, Ch. Ullrich, and Jürgen Wolff von Gudenberg.\nOptimal arithmetic and ada.\nIMACS 1985 Trans. on Scientific Computation, Vol. 2, Computer\nSystems: Perfomance and Simulation, North-Holland, 1986, 1986.\n[ bib  ] 
\n@article{WvGdn,\nauthor = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Optimal Arithmetic and ADA},\njournal = {IMACS 1985 Trans. on Scientific Computation, Vol. 2, Computer Systems: Perfomance and Simulation, North-Holland, 1986},\nyear = {1986},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdn,\n  author = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Optimal Arithmetic and ADA},\n  journal = {IMACS 1985 Trans. on Scientific Computation, Vol. 2, Computer Systems: Perfomance and Simulation, North-Holland, 1986},\n  year = {1986},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Optimal Arithmetic and ADA',0,0,1986,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1045,'paper','WvGdo','techreport','@techreport{WvGdo,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Gesamte Arithmetik des PASCAL-SC Rechners, Benutzerhandbuch},\n institution = {Universit\\\"{a}t Karlsruhe, 1982},\n year = {1982},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nGesamte arithmetik des pascal-sc rechners, benutzerhandbuch.\nTechnical report, Universität Karlsruhe, 1982, 1982.\n[ bib  ] 
\n@techreport{WvGdo,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Gesamte Arithmetik des PASCAL-SC Rechners, Benutzerhandbuch},\ninstitution = {Universit\\\"{a}t Karlsruhe, 1982},\nyear = {1982},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGdo,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Gesamte Arithmetik des PASCAL-SC Rechners, Benutzerhandbuch},\n  institution = {Universit\\\"{a}t Karlsruhe, 1982},\n  year = {1982},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Gesamte Arithmetik des PASCAL-SC Rechners, Benutzerhandbuch',0,0,1982,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1046,'paper','WvGdp','article','@article{WvGdp,\n author = {R. Lohner and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Complex Interval Division with Maximum Accuracy},\n journal = {Proceedings of the 7 Symposium on Computer Arithmetic, IEEE, p. 332-336, 1985},\n year = {1985},\n tags = {Reliability},\n}\n\n','\n\nR. Lohner and Jürgen Wolff von Gudenberg.\nComplex interval division with maximum accuracy.\nProceedings of the 7 Symposium on Computer Arithmetic, IEEE, p.\n332-336, 1985, 1985.\n[ bib  ] 
\n@article{WvGdp,\nauthor = {R. Lohner and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Complex Interval Division with Maximum Accuracy},\njournal = {Proceedings of the 7 Symposium on Computer Arithmetic, IEEE, p. 332-336, 1985},\nyear = {1985},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdp,\n  author = {R. Lohner and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Complex Interval Division with Maximum Accuracy},\n  journal = {Proceedings of the 7 Symposium on Computer Arithmetic, IEEE, p. 332-336, 1985},\n  year = {1985},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Complex Interval Division with Maximum Accuracy',0,0,1985,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1047,'paper','WvGdq','techreport','@techreport{WvGdq,\n author = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Arithmetic for Scientific Computation in ADA},\n institution = {Bericht des Instituts f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1983, IEEE Transactions on Computers, Vol. C -34, No. 11, p. 996-1006, 1985},\n year = {1985},\n tags = {Reliability},\n}\n\n','\n\nR. Klatte, Ch. Ullrich, and Jürgen Wolff von Gudenberg.\nArithmetic for scientific computation in ada.\nTechnical report, Bericht des Instituts für Angewandte\nMathematik, Universität Karlsruhe, 1983, IEEE Transactions on Computers,\nVol. C -34, No. 11, p. 996-1006, 1985, 1985.\n[ bib  ] 
\n@techreport{WvGdq,\nauthor = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Arithmetic for Scientific Computation in ADA},\ninstitution = {Bericht des Instituts f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1983, IEEE Transactions on Computers, Vol. C -34, No. 11, p. 996-1006, 1985},\nyear = {1985},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGdq,\n  author = {R. Klatte and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Arithmetic for Scientific Computation in ADA},\n  institution = {Bericht des Instituts f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1983, IEEE Transactions on Computers, Vol. C -34, No. 11, p. 996-1006, 1985},\n  year = {1985},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Arithmetic for Scientific Computation in ADA',0,0,1985,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1048,'paper','WvGdr','techreport','@techreport{WvGdr,\n author = {G. Bohlender and H. B\\\"{o}hm and K. Braune and W. Gr\"{u}ner and E. Kaucher and R. Kirchner and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Modified Proposal for Arithmetic Specification According to Guidelines of the X3J3 Meetings in Tulsa and Chapel Hill},\n institution = {Bericht des Instituts f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1983},\n year = {1983},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, H. Böhm, K. Braune, W. Gr\"uner, E. Kaucher, R. Kirchner,\nR. Klatte, W. Krämer, U. Kulisch, W. L. Miranker, Ch. Ullrich, and\nJürgen Wolff von Gudenberg.\nModified proposal for arithmetic specification according to\nguidelines of the x3j3 meetings in tulsa and chapel hill.\nTechnical report, Bericht des Instituts für Angewandte\nMathematik, Universität Karlsruhe, 1983, 1983.\n[ bib  ] 
\n@techreport{WvGdr,\nauthor = {G. Bohlender and H. B\\\"{o}hm and K. Braune and W. Gr\"{u}ner and E. Kaucher and R. Kirchner and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Modified Proposal for Arithmetic Specification According to Guidelines of the X3J3 Meetings in Tulsa and Chapel Hill},\ninstitution = {Bericht des Instituts f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1983},\nyear = {1983},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGdr,\n  author = {G. Bohlender and H. B\\\"{o}hm and K. Braune and W. Gr\"{u}ner and E. Kaucher and R. Kirchner and R. Klatte and W. Kr\\\"{a}mer and U. Kulisch and W. L. Miranker and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Modified Proposal for Arithmetic Specification According to Guidelines of the X3J3 Meetings in Tulsa and Chapel Hill},\n  institution = {Bericht des Instituts f\\\"{u}r Angewandte Mathematik, Universit\\\"{a}t Karlsruhe, 1983},\n  year = {1983},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Modified Proposal for Arithmetic Specification According to Guidelines of the X3J3 Meetings in Tulsa and Chapel Hill',0,0,1983,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1049,'paper','WvGds','phdthesis','@phdthesis{WvGds,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Einbettung allgemeiner Rechnerarithmetik in PASCAL mittels eines Operatorkonzeptes und Implementierung der Standardfunktionen mit optimaler Genauigkeit},\n school = {University of Karlsruhe, 1980},\n year = {1980},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nEinbettung allgemeiner Rechnerarithmetik in PASCAL mittels eines\nOperatorkonzeptes und Implementierung der Standardfunktionen mit optimaler\nGenauigkeit.\nPhD thesis, University of Karlsruhe, 1980, 1980.\n[ bib  ] 
\n@phdthesis{WvGds,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Einbettung allgemeiner Rechnerarithmetik in PASCAL mittels eines Operatorkonzeptes und Implementierung der Standardfunktionen mit optimaler Genauigkeit},\nschool = {University of Karlsruhe, 1980},\nyear = {1980},\ntags = {Reliability}\n}\n
\n
\n','
\n@phdthesis{WvGds,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Einbettung allgemeiner Rechnerarithmetik in PASCAL mittels eines Operatorkonzeptes und Implementierung der Standardfunktionen mit optimaler Genauigkeit},\n  school = {University of Karlsruhe, 1980},\n  year = {1980},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Einbettung allgemeiner Rechnerarithmetik in PASCAL mittels eines Operatorkonzeptes und Implementierung der Standardfunktionen mit optimaler Genauigkeit',0,0,1980,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1050,'paper','WvGdt','article','@article{WvGdt,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Determination of Minimum Sets of the Set of Zeros of a Function},\n journal = {Computing 24, p. 203-212, 1980},\n year = {1980},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nDetermination of minimum sets of the set of zeros of a function.\nComputing 24, p. 203-212, 1980, 1980.\n[ bib  ] 
\n@article{WvGdt,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Determination of Minimum Sets of the Set of Zeros of a Function},\njournal = {Computing 24, p. 203-212, 1980},\nyear = {1980},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdt,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Determination of Minimum Sets of the Set of Zeros of a Function},\n  journal = {Computing 24, p. 203-212, 1980},\n  year = {1980},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Determination of Minimum Sets of the Set of Zeros of a Function',0,0,1980,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1051,'paper','WvGdu','article','@article{WvGdu,\n author = {G. Bohlender and E. Kaucher and R. Klatte and U. Kulisch and W. L. Miranker and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {FORTRAN for Contemporary Numerical Computation},\n journal = {Computing 26, p. 277-314, 1981},\n year = {1981},\n tags = {Reliability},\n}\n\n','\n\nG. Bohlender, E. Kaucher, R. Klatte, U. Kulisch, W. L. Miranker, Ch. Ullrich,\nand Jürgen Wolff von Gudenberg.\nFortran for contemporary numerical computation.\nComputing 26, p. 277-314, 1981, 1981.\n[ bib  ] 
\n@article{WvGdu,\nauthor = {G. Bohlender and E. Kaucher and R. Klatte and U. Kulisch and W. L. Miranker and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {FORTRAN for Contemporary Numerical Computation},\njournal = {Computing 26, p. 277-314, 1981},\nyear = {1981},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdu,\n  author = {G. Bohlender and E. Kaucher and R. Klatte and U. Kulisch and W. L. Miranker and Ch. Ullrich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {FORTRAN for Contemporary Numerical Computation},\n  journal = {Computing 26, p. 277-314, 1981},\n  year = {1981},\n  tags = {Reliability}\n}\n
\n\n',NULL,'FORTRAN for Contemporary Numerical Computation',0,0,1981,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1052,'paper','WvGdv','article','@article{WvGdv,\n author = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n title = {JOP ein Java Online Praktikum der vhb},\n journal = {Softwaretechnik-Trends 22(4) pp.15-18, 2002},\n year = {2002},\n tags = {Reliability},\n}\n\n','\n\nG. Fischer and Jürgen Wolff von Gudenberg.\nJop ein java online praktikum der vhb.\nSoftwaretechnik-Trends 22(4) pp.15-18, 2002, 2002.\n[ bib  ] 
\n@article{WvGdv,\nauthor = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {JOP ein Java Online Praktikum der vhb},\njournal = {Softwaretechnik-Trends 22(4) pp.15-18, 2002},\nyear = {2002},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdv,\n  author = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {JOP ein Java Online Praktikum der vhb},\n  journal = {Softwaretechnik-Trends 22(4) pp.15-18, 2002},\n  year = {2002},\n  tags = {Reliability}\n}\n
\n\n',NULL,'JOP ein Java Online Praktikum der vhb',0,0,2002,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1053,'paper','WvGdw','article','@article{WvGdw,\n author = {M. Hopfner and D. Seipel and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Comprehending and Visualizing Software based on XML-Representations and Call Graphs},\n journal = {11th Int. Workshop on Program Comprehension, pp 290-291, IEEE 2003},\n year = {2003},\n tags = {Reliability},\n}\n\n','\n\nM. Hopfner, D. Seipel, and Jürgen Wolff von Gudenberg.\nComprehending and visualizing software based on xml-representations\nand call graphs.\n11th Int. Workshop on Program Comprehension, pp 290-291, IEEE\n2003, 2003.\n[ bib  ] 
\n@article{WvGdw,\nauthor = {M. Hopfner and D. Seipel and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Comprehending and Visualizing Software based on XML-Representations and Call Graphs},\njournal = {11th Int. Workshop on Program Comprehension, pp 290-291, IEEE 2003},\nyear = {2003},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdw,\n  author = {M. Hopfner and D. Seipel and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Comprehending and Visualizing Software based on XML-Representations and Call Graphs},\n  journal = {11th Int. Workshop on Program Comprehension, pp 290-291, IEEE 2003},\n  year = {2003},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Comprehending and Visualizing Software based on XML-Representations and Call Graphs',0,0,2003,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1054,'paper','WvGdx','article','@article{WvGdx,\n author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Object-oriented Processing of Java Source Code},\n journal = {Software Practice and Experience, 34, 2004},\n year = {2004},\n tags = {Reliability},\n}\n\n','\n\nH. Eichelberger and Jürgen Wolff von Gudenberg.\nObject-oriented processing of java source code.\nSoftware Practice and Experience, 34, 2004, 2004.\n[ bib  ] 
\n@article{WvGdx,\nauthor = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Object-oriented Processing of Java Source Code},\njournal = {Software Practice and Experience, 34, 2004},\nyear = {2004},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdx,\n  author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Object-oriented Processing of Java Source Code},\n  journal = {Software Practice and Experience, 34, 2004},\n  year = {2004},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Object-oriented Processing of Java Source Code',0,0,2004,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:08',0),(1055,'paper','WvGdy','article','@article{WvGdy,\n author = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Simplifying Source Code Analysis by an XML Representation},\n journal = {Softwaretechnik Trends 23(2), pp.49-50, 2003},\n year = {2003},\n tags = {Reliability},\n}\n\n','\n\nG. Fischer and Jürgen Wolff von Gudenberg.\nSimplifying source code analysis by an xml representation.\nSoftwaretechnik Trends 23(2), pp.49-50, 2003, 2003.\n[ bib  ] 
\n@article{WvGdy,\nauthor = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Simplifying Source Code Analysis by an XML Representation},\njournal = {Softwaretechnik Trends 23(2), pp.49-50, 2003},\nyear = {2003},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdy,\n  author = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Simplifying Source Code Analysis by an XML Representation},\n  journal = {Softwaretechnik Trends 23(2), pp.49-50, 2003},\n  year = {2003},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Simplifying Source Code Analysis by an XML Representation',0,0,2003,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:09',0),(1056,'paper','WvGdz','article','@article{WvGdz,\n author = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Java Online Pedagogy},\n journal = {ECOOP\'03 Workshop on Pedagogies and Tools for Learning Object-Oriented Concepts.},\n year = {2003},\n tags = {Reliability},\n}\n\n','\n\nG. Fischer and Jürgen Wolff von Gudenberg.\nJava online pedagogy.\nECOOP\'03 Workshop on Pedagogies and Tools for Learning\nObject-Oriented Concepts., 2003.\n[ bib  ] 
\n@article{WvGdz,\nauthor = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Java Online Pedagogy},\njournal = {ECOOP\'03 Workshop on Pedagogies and Tools for Learning Object-Oriented Concepts.},\nyear = {2003},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGdz,\n  author = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Java Online Pedagogy},\n  journal = {ECOOP\'03 Workshop on Pedagogies and Tools for Learning Object-Oriented Concepts.},\n  year = {2003},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Java Online Pedagogy',0,0,2003,0,NULL,NULL,NULL,'2016-02-20 23:19:05','2016-06-01 09:41:09',0),(1057,'paper','WvGea','article','@article{WvGea,\n author = {G. Fischer and M. Hopfner and D. Seipel and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Reasoning about Source Code in XML-Representation},\n journal = {Softwaretechnik Trends 23(2), pp.51-52, 2003},\n year = {2003},\n tags = {Reliability},\n}\n\n','\n\nG. Fischer, M. Hopfner, D. Seipel, and Jürgen Wolff von Gudenberg.\nReasoning about source code in xml-representation.\nSoftwaretechnik Trends 23(2), pp.51-52, 2003, 2003.\n[ bib  ] 
\n@article{WvGea,\nauthor = {G. Fischer and M. Hopfner and D. Seipel and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Reasoning about Source Code in XML-Representation},\njournal = {Softwaretechnik Trends 23(2), pp.51-52, 2003},\nyear = {2003},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGea,\n  author = {G. Fischer and M. Hopfner and D. Seipel and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Reasoning about Source Code in XML-Representation},\n  journal = {Softwaretechnik Trends 23(2), pp.51-52, 2003},\n  year = {2003},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Reasoning about Source Code in XML-Representation',0,0,2003,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1058,'paper','WvGeb','article','@article{WvGeb,\n author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n title = {UML Class Diagrams - State of the Art in Layout Techniques},\n journal = {Vissoft 2003, Amsterdam, p. 30-34},\n year = {2003},\n tags = {Reliability},\n}\n\n','\n\nH. Eichelberger and Jürgen Wolff von Gudenberg.\nUml class diagrams - state of the art in layout techniques.\nVissoft 2003, Amsterdam, p. 30-34, 2003.\n[ bib  ] 
\n@article{WvGeb,\nauthor = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {UML Class Diagrams - State of the Art in Layout Techniques},\njournal = {Vissoft 2003, Amsterdam, p. 30-34},\nyear = {2003},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGeb,\n  author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {UML Class Diagrams - State of the Art in Layout Techniques},\n  journal = {Vissoft 2003, Amsterdam, p. 30-34},\n  year = {2003},\n  tags = {Reliability}\n}\n
\n\n',NULL,'UML Class Diagrams - State of the Art in Layout Techniques',0,0,2003,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1059,'paper','WvGec','article','@article{WvGec,\n author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Demonstration of Advanced Layout of UML Class Diagrams by SugiBib},\n journal = {Vissoft 2003, Amsterdam, p.53-54},\n year = {2003},\n tags = {Reliability},\n}\n\n','\n\nH. Eichelberger and Jürgen Wolff von Gudenberg.\nDemonstration of advanced layout of uml class diagrams by sugibib.\nVissoft 2003, Amsterdam, p.53-54, 2003.\n[ bib  ] 
\n@article{WvGec,\nauthor = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Demonstration of Advanced Layout of UML Class Diagrams by SugiBib},\njournal = {Vissoft 2003, Amsterdam, p.53-54},\nyear = {2003},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGec,\n  author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Demonstration of Advanced Layout of UML Class Diagrams by SugiBib},\n  journal = {Vissoft 2003, Amsterdam, p.53-54},\n  year = {2003},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Demonstration of Advanced Layout of UML Class Diagrams by SugiBib',0,0,2003,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1060,'paper','WvGed','article','@article{WvGed,\n author = {H. Eichelberger and G. Fischer and F. Grupp and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Programmierausbildung Online},\n journal = {DeLFI 2003, A.Bode,J.Desel,S.Rathmayer,M.Wessner (eds), Lecture Notes in Informatics, GI, p.134-143},\n year = {2003},\n tags = {Reliability},\n}\n\n','\n\nH. Eichelberger, G. Fischer, F. Grupp, and Jürgen Wolff von Gudenberg.\nProgrammierausbildung online.\nDeLFI 2003, A.Bode,J.Desel,S.Rathmayer,M.Wessner (eds), Lecture\nNotes in Informatics, GI, p.134-143, 2003.\n[ bib  ] 
\n@article{WvGed,\nauthor = {H. Eichelberger and G. Fischer and F. Grupp and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Programmierausbildung Online},\njournal = {DeLFI 2003, A.Bode,J.Desel,S.Rathmayer,M.Wessner (eds), Lecture Notes in Informatics, GI, p.134-143},\nyear = {2003},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGed,\n  author = {H. Eichelberger and G. Fischer and F. Grupp and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Programmierausbildung Online},\n  journal = {DeLFI 2003, A.Bode,J.Desel,S.Rathmayer,M.Wessner (eds), Lecture Notes in Informatics, GI, p.134-143},\n  year = {2003},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Programmierausbildung Online',0,0,2003,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1061,'paper','WvGee','article','@article{WvGee,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {OOP and Interval Arithmetic - Language Support and Libraries},\n journal = {Numerical Software with Result Verification, R. Alt, A. Frommer, B. Kearfott, W. Luther (eds), Springer Lecture Notes in Computer Science.},\n year = {2003},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nOop and interval arithmetic - language support and libraries.\nNumerical Software with Result Verification, R. Alt, A. Frommer,\nB. Kearfott, W. Luther (eds), Springer Lecture Notes in Computer Science.,\n2003.\n[ bib  ] 
\n@article{WvGee,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {OOP and Interval Arithmetic - Language Support and Libraries},\njournal = {Numerical Software with Result Verification, R. Alt, A. Frommer, B. Kearfott, W. Luther (eds), Springer Lecture Notes in Computer Science.},\nyear = {2003},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGee,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {OOP and Interval Arithmetic - Language Support and Libraries},\n  journal = {Numerical Software with Result Verification, R. Alt, A. Frommer, B. Kearfott, W. Luther (eds), Springer Lecture Notes in Computer Science.},\n  year = {2003},\n  tags = {Reliability}\n}\n
\n\n',NULL,'OOP and Interval Arithmetic - Language Support and Libraries',0,0,2003,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1062,'paper','WvGef','article','@article{WvGef,\n author = {V. Wahler and D. Seipel and J\\\"{u}rgen Wolff von Gudenberg and G. Fischer},\n title = {Clone Detection in Source Code by Frequent Itemset Techniques},\n journal = {4th IEEE Workshop on Source Code Analysis and Manipulation, 2004 pp 128-135},\n year = {2004},\n tags = {Reliability},\n}\n\n','\n\nV. Wahler, D. Seipel, Jürgen Wolff von Gudenberg, and G. Fischer.\nClone detection in source code by frequent itemset techniques.\n4th IEEE Workshop on Source Code Analysis and Manipulation, 2004\npp 128-135, 2004.\n[ bib  ] 
\n@article{WvGef,\nauthor = {V. Wahler and D. Seipel and J\\\"{u}rgen Wolff von Gudenberg and G. Fischer},\ntitle = {Clone Detection in Source Code by Frequent Itemset Techniques},\njournal = {4th IEEE Workshop on Source Code Analysis and Manipulation, 2004 pp 128-135},\nyear = {2004},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGef,\n  author = {V. Wahler and D. Seipel and J\\\"{u}rgen Wolff von Gudenberg and G. Fischer},\n  title = {Clone Detection in Source Code by Frequent Itemset Techniques},\n  journal = {4th IEEE Workshop on Source Code Analysis and Manipulation, 2004 pp 128-135},\n  year = {2004},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Clone Detection in Source Code by Frequent Itemset Techniques',0,0,2004,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1063,'paper','WvGeg','article','@article{WvGeg,\n author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n title = {JTransform, a Tool for Source code Analysis},\n journal = {Softwaretechnik Trends, 24 (2), pp 65-66},\n year = {2004},\n tags = {Reliability},\n}\n\n','\n\nH. Eichelberger and Jürgen Wolff von Gudenberg.\nJtransform, a tool for source code analysis.\nSoftwaretechnik Trends, 24 (2), pp 65-66, 2004.\n[ bib  ] 
\n@article{WvGeg,\nauthor = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {JTransform, a Tool for Source code Analysis},\njournal = {Softwaretechnik Trends, 24 (2), pp 65-66},\nyear = {2004},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGeg,\n  author = {H. Eichelberger and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {JTransform, a Tool for Source code Analysis},\n  journal = {Softwaretechnik Trends, 24 (2), pp 65-66},\n  year = {2004},\n  tags = {Reliability}\n}\n
\n\n',NULL,'JTransform, a Tool for Source code Analysis',0,0,2004,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1064,'paper','WvGeh','article','@article{WvGeh,\n author = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\n title = {A Full Function-Based Calculus of Directed and Undirected Intervals: Markov\'S Interval Arithmetic Revisited},\n journal = {Numerical Algorithms, 37 (1-4): 417-428, 2004},\n year = {2004},\n tags = {Reliability},\n}\n\n','\n\nV. Kreinovich and Jürgen Wolff von Gudenberg.\nA full function-based calculus of directed and undirected intervals:\nMarkov\'s interval arithmetic revisited.\nNumerical Algorithms, 37 (1-4): 417-428, 2004, 2004.\n[ bib  ] 
\n@article{WvGeh,\nauthor = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {A Full Function-Based Calculus of Directed and Undirected Intervals: Markov\'S Interval Arithmetic Revisited},\njournal = {Numerical Algorithms, 37 (1-4): 417-428, 2004},\nyear = {2004},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGeh,\n  author = {V. Kreinovich and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {A Full Function-Based Calculus of Directed and Undirected Intervals: Markov\'S Interval Arithmetic Revisited},\n  journal = {Numerical Algorithms, 37 (1-4): 417-428, 2004},\n  year = {2004},\n  tags = {Reliability}\n}\n
\n\n',NULL,'A Full Function-Based Calculus of Directed and Undirected Intervals: Markov\'S Interval Arithmetic Revisited',0,0,2004,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1065,'paper','WvGei','article','@article{WvGei,\n author = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Online Assessment of Programming Exercises},\n journal = {ECOOP 2004 Eighth Workshop on Pedagogies and Tools for the Teaching and Learning of Object Oriented Concepts},\n url = {http://www.cs.umu.se/~jubo/Meetings/ECOOP04/Submissions/FischerWolffvGudenberg.pdf},\n year = {2004},\n tags = {Reliability},\n}\n\n','\n\nG. Fischer and Jürgen Wolff von Gudenberg.\nOnline assessment of programming exercises.\nECOOP 2004 Eighth Workshop on Pedagogies and Tools for the\nTeaching and Learning of Object Oriented Concepts, 2004.\n[ bib | .pdf  ] 
\n@article{WvGei,\nauthor = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Online Assessment of Programming Exercises},\njournal = {ECOOP 2004 Eighth Workshop on Pedagogies and Tools for the Teaching and Learning of Object Oriented Concepts},\nurl = {http://www.cs.umu.se/~jubo/Meetings/ECOOP04/Submissions/FischerWolffvGudenberg.pdf},\nyear = {2004},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGei,\n  author = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Online Assessment of Programming Exercises},\n  journal = {ECOOP 2004 Eighth Workshop on Pedagogies and Tools for the Teaching and Learning of Object Oriented Concepts},\n  url = {http://www.cs.umu.se/~jubo/Meetings/ECOOP04/Submissions/FischerWolffvGudenberg.pdf},\n  year = {2004},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Online Assessment of Programming Exercises',0,0,2004,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1066,'paper','WvGej','article','@article{WvGej,\n author = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Improving the Quality of Programming Education by Online Assessment},\n journal = {Proceedings of PPPJ-06, Mannheim 2006, p. 208-212},\n year = {2006},\n tags = {Reliability},\n}\n\n','\n\nG. Fischer and Jürgen Wolff von Gudenberg.\nImproving the quality of programming education by online assessment.\nProceedings of PPPJ-06, Mannheim 2006, p. 208-212, 2006.\n[ bib  ] 
\n@article{WvGej,\nauthor = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Improving the Quality of Programming Education by Online Assessment},\njournal = {Proceedings of PPPJ-06, Mannheim 2006, p. 208-212},\nyear = {2006},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGej,\n  author = {G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Improving the Quality of Programming Education by Online Assessment},\n  journal = {Proceedings of PPPJ-06, Mannheim 2006, p. 208-212},\n  year = {2006},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Improving the Quality of Programming Education by Online Assessment',0,0,2006,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1067,'paper','WvGek','article','@article{WvGek,\n author = {J\\\"{u}rgen Wolff von Gudenberg},\n title = {Interval Arithmetic and Standardization},\n journal = {Dagstuhl Seminar Proceedings 08021},\n year = {2008},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg.\nInterval arithmetic and standardization.\nDagstuhl Seminar Proceedings 08021, 2008.\n[ bib  ] 
\n@article{WvGek,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Interval Arithmetic and Standardization},\njournal = {Dagstuhl Seminar Proceedings 08021},\nyear = {2008},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGek,\n  author = {J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Interval Arithmetic and Standardization},\n  journal = {Dagstuhl Seminar Proceedings 08021},\n  year = {2008},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Interval Arithmetic and Standardization',0,0,2008,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1068,'paper','WvGel','article','@article{WvGel,\n author = {J\\\"{u}rgen Wolff von Gudenberg and A. Niederle and M. Ebner and H. Eichelberger},\n title = {Evolutionary Layout of UML Class Diagrams},\n journal = {SoftVis06, ACM Symposium on Software Visualization, Brighton 2006, p. 163-164},\n year = {2006},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg, A. Niederle, M. Ebner, and H. Eichelberger.\nEvolutionary layout of uml class diagrams.\nSoftVis06, ACM Symposium on Software Visualization, Brighton\n2006, p. 163-164, 2006.\n[ bib  ] 
\n@article{WvGel,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg and A. Niederle and M. Ebner and H. Eichelberger},\ntitle = {Evolutionary Layout of UML Class Diagrams},\njournal = {SoftVis06, ACM Symposium on Software Visualization, Brighton 2006, p. 163-164},\nyear = {2006},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGel,\n  author = {J\\\"{u}rgen Wolff von Gudenberg and A. Niederle and M. Ebner and H. Eichelberger},\n  title = {Evolutionary Layout of UML Class Diagrams},\n  journal = {SoftVis06, ACM Symposium on Software Visualization, Brighton 2006, p. 163-164},\n  year = {2006},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Evolutionary Layout of UML Class Diagrams',0,0,2006,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1069,'paper','WvGem','article','@article{WvGem,\n author = {D. Glaser and G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Automated Component Bridge Generator},\n journal = {Proceedings of the 11th Workshop on Component Oriented Programming, R. Reussner, C. Szypersky, W. Weck (Eds), Interner Bericht 2006-11, Informatik Uni Karlsruhe},\n year = {2006},\n tags = {Reliability},\n}\n\n','\n\nD. Glaser, G. Fischer, and Jürgen Wolff von Gudenberg.\nAutomated component bridge generator.\nProceedings of the 11th Workshop on Component Oriented\nProgramming, R. Reussner, C. Szypersky, W. Weck (Eds), Interner Bericht\n2006-11, Informatik Uni Karlsruhe, 2006.\n[ bib  ] 
\n@article{WvGem,\nauthor = {D. Glaser and G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Automated Component Bridge Generator},\njournal = {Proceedings of the 11th Workshop on Component Oriented Programming, R. Reussner, C. Szypersky, W. Weck (Eds), Interner Bericht 2006-11, Informatik Uni Karlsruhe},\nyear = {2006},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGem,\n  author = {D. Glaser and G. Fischer and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Automated Component Bridge Generator},\n  journal = {Proceedings of the 11th Workshop on Component Oriented Programming, R. Reussner, C. Szypersky, W. Weck (Eds), Interner Bericht 2006-11, Informatik Uni Karlsruhe},\n  year = {2006},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Automated Component Bridge Generator',0,0,2006,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1070,'paper','WvGen','techreport','@techreport{WvGen,\n author = {J\\\"{u}rgen Wolff von Gudenberg and A. Niederle and M. Ebner and H. Eichelberger},\n title = {An Evolutionary Algorithm for the Layout of UML Class Diagrams},\n institution = {Informatik. TR 391, Uni W\"{u}rzburg},\n year = {2006},\n tags = {Reliability},\n}\n\n','\n\nJürgen Wolff von Gudenberg, A. Niederle, M. Ebner, and H. Eichelberger.\nAn evolutionary algorithm for the layout of uml class diagrams.\nTechnical report, Informatik. TR 391, Uni W\"urzburg, 2006.\n[ bib  ] 
\n@techreport{WvGen,\nauthor = {J\\\"{u}rgen Wolff von Gudenberg and A. Niederle and M. Ebner and H. Eichelberger},\ntitle = {An Evolutionary Algorithm for the Layout of UML Class Diagrams},\ninstitution = {Informatik. TR 391, Uni W\"{u}rzburg},\nyear = {2006},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGen,\n  author = {J\\\"{u}rgen Wolff von Gudenberg and A. Niederle and M. Ebner and H. Eichelberger},\n  title = {An Evolutionary Algorithm for the Layout of UML Class Diagrams},\n  institution = {Informatik. TR 391, Uni W\"{u}rzburg},\n  year = {2006},\n  tags = {Reliability}\n}\n
\n\n',NULL,'An Evolutionary Algorithm for the Layout of UML Class Diagrams',0,0,2006,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1071,'paper','WvGeo','techreport','@techreport{WvGeo,\n author = {G. Fischer and J. Lusiardi and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Source Code Model Hierarchies},\n institution = {TR 444, Institut f. Informatik, Uni W\"{u}rzburg},\n year = {2008},\n tags = {Reliability},\n}\n\n','\n\nG. Fischer, J. Lusiardi, and Jürgen Wolff von Gudenberg.\nSource code model hierarchies.\nTechnical report, TR 444, Institut f. Informatik, Uni W\"urzburg,\n2008.\n[ bib  ] 
\n@techreport{WvGeo,\nauthor = {G. Fischer and J. Lusiardi and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Source Code Model Hierarchies},\ninstitution = {TR 444, Institut f. Informatik, Uni W\"{u}rzburg},\nyear = {2008},\ntags = {Reliability}\n}\n
\n
\n','
\n@techreport{WvGeo,\n  author = {G. Fischer and J. Lusiardi and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Source Code Model Hierarchies},\n  institution = {TR 444, Institut f. Informatik, Uni W\"{u}rzburg},\n  year = {2008},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Source Code Model Hierarchies',0,0,2008,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1072,'paper','WvGep','article','@article{WvGep,\n author = {G. Fischer and J. Lusiardi and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Modeling Source Code with Orthogonal Hierarchies},\n journal = {Workshop MMSS bei ECMDA 2008, Berlin},\n year = {2008},\n tags = {Reliability},\n}\n\n','\n\nG. Fischer, J. Lusiardi, and Jürgen Wolff von Gudenberg.\nModeling source code with orthogonal hierarchies.\nWorkshop MMSS bei ECMDA 2008, Berlin, 2008.\n[ bib  ] 
\n@article{WvGep,\nauthor = {G. Fischer and J. Lusiardi and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Modeling Source Code with Orthogonal Hierarchies},\njournal = {Workshop MMSS bei ECMDA 2008, Berlin},\nyear = {2008},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGep,\n  author = {G. Fischer and J. Lusiardi and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Modeling Source Code with Orthogonal Hierarchies},\n  journal = {Workshop MMSS bei ECMDA 2008, Berlin},\n  year = {2008},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Modeling Source Code with Orthogonal Hierarchies',0,0,2008,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1073,'paper','WvGeq','article','@article{WvGeq,\n author = {G. Fischer and J. Lusiardi and J\\\"{u}rgen Wolff von Gudenberg},\n title = {Abstract Syntax Trees and their Role in Model Driven Software Development},\n journal = {ICSEA 2007 Online proceedings},\n year = {2007},\n tags = {Reliability},\n}\n\n','\n\nG. Fischer, J. Lusiardi, and Jürgen Wolff von Gudenberg.\nAbstract syntax trees and their role in model driven software\ndevelopment.\nICSEA 2007 Online proceedings, 2007.\n[ bib  ] 
\n@article{WvGeq,\nauthor = {G. Fischer and J. Lusiardi and J\\\"{u}rgen Wolff von Gudenberg},\ntitle = {Abstract Syntax Trees and their Role in Model Driven Software Development},\njournal = {ICSEA 2007 Online proceedings},\nyear = {2007},\ntags = {Reliability}\n}\n
\n
\n','
\n@article{WvGeq,\n  author = {G. Fischer and J. Lusiardi and J\\\"{u}rgen Wolff von Gudenberg},\n  title = {Abstract Syntax Trees and their Role in Model Driven Software Development},\n  journal = {ICSEA 2007 Online proceedings},\n  year = {2007},\n  tags = {Reliability}\n}\n
\n\n',NULL,'Abstract Syntax Trees and their Role in Model Driven Software Development',0,0,2007,0,NULL,NULL,NULL,'2016-02-20 23:19:06','2016-06-01 09:41:09',0),(1074,'paper','HaKlKuBrWeSpStKo-2016-MITPress-Palladio','incollection','@incollection{HaKlKuBrWeSpStKo-2016-MITPress-Palladio,\n author = {Jens Happe and Benjamin Klatt and Martin K\\\"{u}ster and Fabian Brosig and Alexander Wert and Simon Spinner and Christian Stier and Heiko Koziolek},\n editor = {Reussner, Ralf H. and Becker, Steffen and Happe, Jens and Heinrich, Robert and Koziolek, Anne and Koziolek, Heiko and Kramer, Max and Krogmann, Klaus},\n title = {{Getting the Data}},\n booktitle = {{Modeling and Simulating Software Architectures - The Palladio Approach}},\n publisher = {MIT Press},\n year = {2016},\n address = {Cambridge, MA},\n note = {In Press},\n isbn = {9780262034760},\n}\n\n','\n\nJens Happe, Benjamin Klatt, Martin Küster, Fabian Brosig, Alexander Wert,\nSimon Spinner, Christian Stier, and Heiko Koziolek.\nGetting the Data.\nIn Modeling and Simulating Software Architectures - The\nPalladio Approach, Ralf H. Reussner, Steffen Becker, Jens Happe, Robert\nHeinrich, Anne Koziolek, Heiko Koziolek, Max Kramer, and Klaus Krogmann,\neditors. MIT Press, Cambridge, MA, 2016.\nIn Press.\n[ bib  ] 
\n@incollection{HaKlKuBrWeSpStKo-2016-MITPress-Palladio,\nauthor = {Jens Happe and Benjamin Klatt and Martin K\\\"{u}ster and Fabian Brosig and Alexander Wert and Simon Spinner and Christian Stier and Heiko Koziolek},\neditor = {Reussner, Ralf H. and Becker, Steffen and Happe, Jens and Heinrich, Robert and Koziolek, Anne and Koziolek, Heiko and Kramer, Max and Krogmann, Klaus},\ntitle = {{Getting the Data}},\nbooktitle = {{Modeling and Simulating Software Architectures - The Palladio Approach}},\npublisher = {MIT Press},\nyear = {2016},\naddress = {Cambridge, MA},\nnote = {In Press},\nisbn = {9780262034760}\n}\n
\n
\n','
\n@incollection{HaKlKuBrWeSpStKo-2016-MITPress-Palladio,\n  author = {Jens Happe and Benjamin Klatt and Martin K\\\"{u}ster and Fabian Brosig and Alexander Wert and Simon Spinner and Christian Stier and Heiko Koziolek},\n  editor = {Reussner, Ralf H. and Becker, Steffen and Happe, Jens and Heinrich, Robert and Koziolek, Anne and Koziolek, Heiko and Kramer, Max and Krogmann, Klaus},\n  title = {{Getting the Data}},\n  booktitle = {{Modeling and Simulating Software Architectures - The Palladio Approach}},\n  publisher = {MIT Press},\n  year = {2016},\n  address = {Cambridge, MA},\n  note = {In Press},\n  isbn = {9780262034760}\n}\n
\n\n',NULL,'{Getting the Data}',0,1,2016,1,NULL,NULL,NULL,'2016-02-22 08:52:19','2016-06-01 09:41:09',0),(1075,'paper','MuRySpKo2016-PASM-QPN-LQN-Transformation','inproceedings','@inproceedings{MuRySpKo2016-PASM-QPN-LQN-Transformation,\n author = {Christoph M\\\"{u}ller and Piotr Rygielski and Simon Spinner and Samuel Kounev},\n title = {{Enabling Fluid Analysis for Queueing Petri Nets via Model Transformation}},\n booktitle = {Proceedings of the Eighth International Workshop on Practical Applications of Stochastic Modelling (PASM 2016)},\n year = {2016},\n month = {April},\n day = {5},\n location = {M\\\"{u}nster, Germany},\n series = {{Electronic Notes in Theoretical Computer Science (ENTCS)}},\n publisher = {Elsevier},\n abstract = {{Due to the growing size of modern IT systems, their performance analysis becomes an even more challenging task. Existing simulators are unable to analyze the behavior of large systems in a reasonable time, whereas analytical methods suffer from the state space explosion problem. Fluid analysis techniques can be used to approximate the solution of high-order Markov chain models enabling time efficient analysis of large performance models. In this paper, we describe a model-to-model transformation from queueing Petri nets (QPN) into layered queueing networks (LQN). Obtained LQN models can benefit from three existing solvers: LINE, LQNS, LQSIM. LINE internally utilize fluid limits approximation to speed up the solving process for large models. We present the incentives for developing the automated model-to-model transformation and present a systematic approach that we followed in its design. We demonstrate the transformations using representative examples. Finally, we evaluate and compare the performance predictions of existing analytical, simulation and fluid analysis solvers. We analyze solver\'s limitations, solving time, and memory consumption.}},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1075.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1075},\n}\n\n','\n\nChristoph Müller, Piotr Rygielski, Simon Spinner, and Samuel Kounev.\nEnabling Fluid Analysis for Queueing Petri Nets via Model\nTransformation.\nIn Proceedings of the Eighth International Workshop on Practical\nApplications of Stochastic Modelling (PASM 2016), Münster, Germany,\nApril 5, 2016, Electronic Notes in Theoretical Computer Science (ENTCS).\nElsevier.\nApril 2016.\n[ bib | slides | .pdf | Abstract  ] 
\n@inproceedings{MuRySpKo2016-PASM-QPN-LQN-Transformation,\nauthor = {Christoph M\\\"{u}ller and Piotr Rygielski and Simon Spinner and Samuel Kounev},\ntitle = {{Enabling Fluid Analysis for Queueing Petri Nets via Model Transformation}},\nbooktitle = {Proceedings of the Eighth International Workshop on Practical Applications of Stochastic Modelling (PASM 2016)},\nyear = {2016},\nmonth = {April},\nday = {5},\nlocation = {M\\\"{u}nster, Germany},\nseries = {{Electronic Notes in Theoretical Computer Science (ENTCS)}},\npublisher = {Elsevier},\nabstract = {{Due to the growing size of modern IT systems, their performance analysis becomes an even more challenging task. Existing simulators are unable to analyze the behavior of large systems in a reasonable time, whereas analytical methods suffer from the state space explosion problem. Fluid analysis techniques can be used to approximate the solution of high-order Markov chain models enabling time efficient analysis of large performance models. In this paper, we describe a model-to-model transformation from queueing Petri nets (QPN) into layered queueing networks (LQN). Obtained LQN models can benefit from three existing solvers: LINE, LQNS, LQSIM. LINE internally utilize fluid limits approximation to speed up the solving process for large models. We present the incentives for developing the automated model-to-model transformation and present a systematic approach that we followed in its design. We demonstrate the transformations using representative examples. Finally, we evaluate and compare the performance predictions of existing analytical, simulation and fluid analysis solvers. We analyze solver\'s limitations, solving time, and memory consumption.}},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1075.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1075}\n}\n
\n
\nDue to the growing size of modern IT systems, their performance analysis becomes an even more challenging task. Existing simulators are unable to analyze the behavior of large systems in a reasonable time, whereas analytical methods suffer from the state space explosion problem. Fluid analysis techniques can be used to approximate the solution of high-order Markov chain models enabling time efficient analysis of large performance models. In this paper, we describe a model-to-model transformation from queueing Petri nets (QPN) into layered queueing networks (LQN). Obtained LQN models can benefit from three existing solvers: LINE, LQNS, LQSIM. LINE internally utilize fluid limits approximation to speed up the solving process for large models. We present the incentives for developing the automated model-to-model transformation and present a systematic approach that we followed in its design. We demonstrate the transformations using representative examples. Finally, we evaluate and compare the performance predictions of existing analytical, simulation and fluid analysis solvers. We analyze solver\'s limitations, solving time, and memory consumption.\n
\n','
\n@inproceedings{MuRySpKo2016-PASM-QPN-LQN-Transformation,\n  author = {Christoph M\\\"{u}ller and Piotr Rygielski and Simon Spinner and Samuel Kounev},\n  title = {{Enabling Fluid Analysis for Queueing Petri Nets via Model Transformation}},\n  booktitle = {Proceedings of the Eighth International Workshop on Practical Applications of Stochastic Modelling (PASM 2016)},\n  year = {2016},\n  month = {April},\n  day = {5},\n  location = {M\\\"{u}nster, Germany},\n  series = {{Electronic Notes in Theoretical Computer Science (ENTCS)}},\n  publisher = {Elsevier},\n  abstract = {{Due to the growing size of modern IT systems, their performance analysis becomes an even more challenging task. Existing simulators are unable to analyze the behavior of large systems in a reasonable time, whereas analytical methods suffer from the state space explosion problem. Fluid analysis techniques can be used to approximate the solution of high-order Markov chain models enabling time efficient analysis of large performance models. In this paper, we describe a model-to-model transformation from queueing Petri nets (QPN) into layered queueing networks (LQN). Obtained LQN models can benefit from three existing solvers: LINE, LQNS, LQSIM. LINE internally utilize fluid limits approximation to speed up the solving process for large models. We present the incentives for developing the automated model-to-model transformation and present a systematic approach that we followed in its design. We demonstrate the transformations using representative examples. Finally, we evaluate and compare the performance predictions of existing analytical, simulation and fluid analysis solvers. We analyze solver\'s limitations, solving time, and memory consumption.}},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1075.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1075}\n}\n
\n\n','{Due to the growing size of modern IT systems, their performance analysis becomes an even more challenging task. Existing simulators are unable to analyze the behavior of large systems in a reasonable time, whereas analytical methods suffer from the state space explosion problem. Fluid analysis techniques can be used to approximate the solution of high-order Markov chain models enabling time efficient analysis of large performance models. In this paper, we describe a model-to-model transformation from queueing Petri nets (QPN) into layered queueing networks (LQN). Obtained LQN models can benefit from three existing solvers: LINE, LQNS, LQSIM. LINE internally utilize fluid limits approximation to speed up the solving process for large models. We present the incentives for developing the automated model-to-model transformation and present a systematic approach that we followed in its design. We demonstrate the transformations using representative examples. Finally, we evaluate and compare the performance predictions of existing analytical, simulation and fluid analysis solvers. We analyze solver\'s limitations, solving time, and memory consumption.}','{Enabling Fluid Analysis for Queueing Petri Nets via Model Transformation}',0,4,2016,4,NULL,NULL,NULL,'2016-02-23 08:48:38','2016-06-01 09:41:09',0),(1077,'paper','KoBrMeBeKoKoRy2016-SE-tradeoffs_perf_prediction_approaches','inproceedings','@inproceedings{KoBrMeBeKoKoRy2016-SE-tradeoffs_perf_prediction_approaches,\n author = {Samuel Kounev and Fabian Brosig and Philipp Meier and Steffen Becker and Anne Koziolek and Heiko Koziolek and Piotr Rygielski},\n title = {{Analysis of the Trade-offs in Different Modeling Approaches for Performance Prediction of Software Systems}},\n booktitle = {Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. M\\\"{a}rz 2016, Vienna, Austria},\n publisher = {GI},\n series = {Lecture Notes in Informatics (LNI)},\n address = {Vienna, Austria},\n days = {23-26},\n month = {February},\n year = {2016},\n pages = {47--48},\n titleaddon = {{(Talk Extended Abstract)}},\n http = {http://subs.emis.de/LNI/Proceedings/Proceedings252/article3.html},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1077.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1077},\n}\n\n','\n\nSamuel Kounev, Fabian Brosig, Philipp Meier, Steffen Becker, Anne Koziolek,\nHeiko Koziolek, and Piotr Rygielski.\nAnalysis of the Trade-offs in Different Modeling Approaches for\nPerformance Prediction of Software Systems (Talk Extended Abstract).\nIn Software Engineering 2016 (SE 2016), Fachtagung des\nGI-Fachbereichs Softwaretechnik, 23.-26. März 2016, Vienna, Austria,\nFebruary 2016, Lecture Notes in Informatics (LNI), pages 47-48. GI, Vienna,\nAustria.\nFebruary 2016.\n[ bib | slides | .html | .pdf  ] 
\n@inproceedings{KoBrMeBeKoKoRy2016-SE-tradeoffs_perf_prediction_approaches,\nauthor = {Samuel Kounev and Fabian Brosig and Philipp Meier and Steffen Becker and Anne Koziolek and Heiko Koziolek and Piotr Rygielski},\ntitle = {{Analysis of the Trade-offs in Different Modeling Approaches for Performance Prediction of Software Systems}},\nbooktitle = {Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. M\\\"{a}rz 2016, Vienna, Austria},\npublisher = {GI},\nseries = {Lecture Notes in Informatics (LNI)},\naddress = {Vienna, Austria},\ndays = {23-26},\nmonth = {February},\nyear = {2016},\npages = {47--48},\ntitleaddon = {{(Talk Extended Abstract)}},\nhttp = {http://subs.emis.de/LNI/Proceedings/Proceedings252/article3.html},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1077.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1077}\n}\n
\n
\n','
\n@inproceedings{KoBrMeBeKoKoRy2016-SE-tradeoffs_perf_prediction_approaches,\n  author = {Samuel Kounev and Fabian Brosig and Philipp Meier and Steffen Becker and Anne Koziolek and Heiko Koziolek and Piotr Rygielski},\n  title = {{Analysis of the Trade-offs in Different Modeling Approaches for Performance Prediction of Software Systems}},\n  booktitle = {Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. M\\\"{a}rz 2016, Vienna, Austria},\n  publisher = {GI},\n  series = {Lecture Notes in Informatics (LNI)},\n  address = {Vienna, Austria},\n  days = {23-26},\n  month = {February},\n  year = {2016},\n  pages = {47--48},\n  titleaddon = {{(Talk Extended Abstract)}},\n  http = {http://subs.emis.de/LNI/Proceedings/Proceedings252/article3.html},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1077.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1077}\n}\n
\n\n',NULL,'{Analysis of the Trade-offs in Different Modeling Approaches for Performance Prediction of Software Systems}',0,2,2016,2,NULL,NULL,NULL,'2016-02-24 17:09:58','2016-06-01 09:41:09',0),(1080,'paper','LibredePressIdw2016','article','@article{LibredePressIdw2016,\n author = {Informationsdienst Wissenschaft (Idw) (Robert Emmerich)},\n title = {{Informatiker erh\\\"{a}lt Google Research Award}},\n year = {2016},\n month = {February},\n day = {29},\n url = {https://idw-online.de/de/news646849},\n comment = {Samuel Kounev and Simon Spinner},\n}\n\n','\n\nInformationsdienst Wissenschaft (Idw) (Robert Emmerich).\nInformatiker erhält Google Research Award.\nFebruary 2016.\n[ bib | http  ] 
\n@article{LibredePressIdw2016,\nauthor = {Informationsdienst Wissenschaft (Idw) (Robert Emmerich)},\ntitle = {{Informatiker erh\\\"{a}lt Google Research Award}},\nyear = {2016},\nmonth = {February},\nday = {29},\nurl = {https://idw-online.de/de/news646849},\ncomment = {Samuel Kounev and Simon Spinner}\n}\n
\n
\n','
\n@article{LibredePressIdw2016,\n  author = {Informationsdienst Wissenschaft (Idw) (Robert Emmerich)},\n  title = {{Informatiker erh\\\"{a}lt Google Research Award}},\n  year = {2016},\n  month = {February},\n  day = {29},\n  url = {https://idw-online.de/de/news646849},\n  comment = {Samuel Kounev and Simon Spinner}\n}\n
\n\n',NULL,'{Informatiker erh\\\"{a}lt Google Research Award}',0,2,2016,2,NULL,NULL,NULL,'2016-03-02 15:19:53','2016-06-01 09:41:09',0),(1081,'paper','LibredePressEinblick2016','article','@article{LibredePressEinblick2016,\n author = {einBLICK (Vera Katzenberger)},\n title = {{Informatiker erh\\\"{a}lt Google Research Award}},\n year = {2016},\n month = {March},\n day = {1},\n url = {http://www.presse.uni-wuerzburg.de/einblick/single/artikel/informatiker-erhaelt-google-research-award/},\n comment = {Samuel Kounev and Simon Spinner},\n publisher = {Universit\\\"{a}t W\\\"{u}rzburg},\n volume = {Ausgabe 8, 2016},\n}\n\n','\n\neinBLICK (Vera Katzenberger).\nInformatiker erhält Google Research Award.\nAusgabe 8, 2016, March 2016, Universität Würzburg.\n[ bib | http  ] 
\n@article{LibredePressEinblick2016,\nauthor = {einBLICK (Vera Katzenberger)},\ntitle = {{Informatiker erh\\\"{a}lt Google Research Award}},\nyear = {2016},\nmonth = {March},\nday = {1},\nurl = {http://www.presse.uni-wuerzburg.de/einblick/single/artikel/informatiker-erhaelt-google-research-award/},\ncomment = {Samuel Kounev and Simon Spinner},\npublisher = {Universit\\\"{a}t W\\\"{u}rzburg},\nvolume = {Ausgabe 8, 2016}\n}\n
\n
\n','
\n@article{LibredePressEinblick2016,\n  author = {einBLICK (Vera Katzenberger)},\n  title = {{Informatiker erh\\\"{a}lt Google Research Award}},\n  year = {2016},\n  month = {March},\n  day = {1},\n  url = {http://www.presse.uni-wuerzburg.de/einblick/single/artikel/informatiker-erhaelt-google-research-award/},\n  comment = {Samuel Kounev and Simon Spinner},\n  publisher = {Universit\\\"{a}t W\\\"{u}rzburg},\n  volume = {Ausgabe 8, 2016}\n}\n
\n\n',NULL,'{Informatiker erh\\\"{a}lt Google Research Award}',0,3,2016,3,NULL,NULL,NULL,'2016-03-02 15:57:42','2016-06-01 09:41:09',0),(1082,'paper','KounevPressWiWO2014','article','@article{KounevPressWiWO2014,\n author = {(Dieter D\\\"{u}rand), Wirtschaftswoche},\n title = {{Intelligente Computer - Die Menschwerdung der Maschine}},\n year = {2014},\n month = {August},\n day = {2},\n url = {http://www.wiwo.de/technologie/digitale-welt/intelligente-computer-die-menschwerdung-der-maschine/10278182.html},\n comment = {Samuel Kounev},\n publisher = {Verlagsgruppe Handelsblatt},\n volume = {Ausgabe 32/2014},\n}\n\n','\n\nWirtschaftswoche (Dieter Dürand).\nIntelligente Computer - Die Menschwerdung der Maschine.\nAusgabe 32/2014, August 2014, Verlagsgruppe Handelsblatt.\n[ bib | .html  ] 
\n@article{KounevPressWiWO2014,\nauthor = {(Dieter D\\\"{u}rand), Wirtschaftswoche},\ntitle = {{Intelligente Computer - Die Menschwerdung der Maschine}},\nyear = {2014},\nmonth = {August},\nday = {2},\nurl = {http://www.wiwo.de/technologie/digitale-welt/intelligente-computer-die-menschwerdung-der-maschine/10278182.html},\ncomment = {Samuel Kounev},\npublisher = {Verlagsgruppe Handelsblatt},\nvolume = {Ausgabe 32/2014}\n}\n
\n
\n','
\n@article{KounevPressWiWO2014,\n  author = {(Dieter D\\\"{u}rand), Wirtschaftswoche},\n  title = {{Intelligente Computer - Die Menschwerdung der Maschine}},\n  year = {2014},\n  month = {August},\n  day = {2},\n  url = {http://www.wiwo.de/technologie/digitale-welt/intelligente-computer-die-menschwerdung-der-maschine/10278182.html},\n  comment = {Samuel Kounev},\n  publisher = {Verlagsgruppe Handelsblatt},\n  volume = {Ausgabe 32/2014}\n}\n
\n\n',NULL,'{Intelligente Computer - Die Menschwerdung der Maschine}',0,8,2014,8,NULL,NULL,NULL,'2016-03-07 12:50:46','2016-06-01 09:41:09',0),(1083,'paper','SPEC-RG-2016-01-CloudMetrics','techreport','@techreport{SPEC-RG-2016-01-CloudMetrics,\n title = {{Ready for Rain? A View from SPEC Research on the Future of Cloud Metrics}},\n author = {Nikolas Herbst and Rouven Krebs and Giorgos Oikonomou and George Kousiouris and Athanasia Evangelinou and Alexandru Iosup and Samuel Kounev},\n institution = {SPEC Research Group --- Cloud Working Group, Standard Performance Evaluation Corporation (SPEC)},\n year = {2016},\n month = {},\n number = {SPEC-RG-2016-01},\n url = {https://research.spec.org/fileadmin/user_upload/documents/rg_cloud/endorsed_publications/SPEC-RG-2016-01_CloudMetrics.pdf},\n}\n\n','\n\nNikolas Herbst, Rouven Krebs, Giorgos Oikonomou, George Kousiouris, Athanasia\nEvangelinou, Alexandru Iosup, and Samuel Kounev.\nReady for Rain? A View from SPEC Research on the Future of Cloud\nMetrics.\nTechnical Report SPEC-RG-2016-01, SPEC Research Group - Cloud\nWorking Group, Standard Performance Evaluation Corporation (SPEC), 2016.\n[ bib | .pdf  ] 
\n@techreport{SPEC-RG-2016-01-CloudMetrics,\ntitle = {{Ready for Rain? A View from SPEC Research on the Future of Cloud Metrics}},\nauthor = {Nikolas Herbst and Rouven Krebs and Giorgos Oikonomou and George Kousiouris and Athanasia Evangelinou and Alexandru Iosup and Samuel Kounev},\ninstitution = {SPEC Research Group --- Cloud Working Group, Standard Performance Evaluation Corporation (SPEC)},\nyear = {2016},\nmonth = {},\nnumber = {SPEC-RG-2016-01},\nurl = {https://research.spec.org/fileadmin/user_upload/documents/rg_cloud/endorsed_publications/SPEC-RG-2016-01_CloudMetrics.pdf}\n}\n
\n
\n','
\n@techreport{SPEC-RG-2016-01-CloudMetrics,\n  title = {{Ready for Rain? A View from SPEC Research on the Future of Cloud Metrics}},\n  author = {Nikolas Herbst and Rouven Krebs and Giorgos Oikonomou and George Kousiouris and Athanasia Evangelinou and Alexandru Iosup and Samuel Kounev},\n  institution = {SPEC Research Group --- Cloud Working Group, Standard Performance Evaluation Corporation (SPEC)},\n  year = {2016},\n  month = {},\n  number = {SPEC-RG-2016-01},\n  url = {https://research.spec.org/fileadmin/user_upload/documents/rg_cloud/endorsed_publications/SPEC-RG-2016-01_CloudMetrics.pdf}\n}\n
\n\n',NULL,'{Ready for Rain? A View from SPEC Research on the Future of Cloud Metrics}',0,0,2016,0,NULL,NULL,NULL,'2016-03-09 09:55:01','2016-06-01 09:41:09',0),(1084,'paper','pressLibredeMainEcho2016','article','@article{pressLibredeMainEcho2016,\n author = {Main-Echo},\n title = {{Internet ist so klimasch\\\"{a}dlich wie Flugzeuge}},\n location = {{W\\\"{u}rzburg}},\n year = {2016},\n month = {March},\n day = {2},\n url = {http://www.main-echo.de/regional/franken-bayern/art4006,4009504},\n}\n\n','\n\nMain-Echo.\nInternet ist so klimaschädlich wie Flugzeuge.\nMarch 2016.\n[ bib | http  ] 
\n@article{pressLibredeMainEcho2016,\nauthor = {Main-Echo},\ntitle = {{Internet ist so klimasch\\\"{a}dlich wie Flugzeuge}},\nlocation = {{W\\\"{u}rzburg}},\nyear = {2016},\nmonth = {March},\nday = {2},\nurl = {http://www.main-echo.de/regional/franken-bayern/art4006,4009504}\n}\n
\n
\n','
\n@article{pressLibredeMainEcho2016,\n  author = {Main-Echo},\n  title = {{Internet ist so klimasch\\\"{a}dlich wie Flugzeuge}},\n  location = {{W\\\"{u}rzburg}},\n  year = {2016},\n  month = {March},\n  day = {2},\n  url = {http://www.main-echo.de/regional/franken-bayern/art4006,4009504}\n}\n
\n\n',NULL,'{Internet ist so klimasch\\\"{a}dlich wie Flugzeuge}',0,3,2016,3,NULL,NULL,NULL,'2016-03-09 12:41:35','2016-06-01 09:41:09',0),(1085,'paper','pressLibredeMainPost2016','article','@article{pressLibredeMainPost2016,\n author = {Main-Post},\n title = {{CO2-Aussto\\ss{} von Rechnern verringern}},\n location = {{W\\\"{u}rzburg}},\n year = {2016},\n month = {March},\n day = {4},\n url = {http://m.mainpost.de/97070-W%FCrzburg~artikel/Rechenzentren-Treibhausgase;art735,9139925},\n}\n\n','\n\nMain-Post.\nCO2-Ausstoß von Rechnern verringern.\nMarch 2016.\n[ bib | http  ] 
\n@article{pressLibredeMainPost2016,\nauthor = {Main-Post},\ntitle = {{CO2-Aussto\\ss{} von Rechnern verringern}},\nlocation = {{W\\\"{u}rzburg}},\nyear = {2016},\nmonth = {March},\nday = {4},\nurl = {http://m.mainpost.de/97070-W%FCrzburg~artikel/Rechenzentren-Treibhausgase;art735,9139925}\n}\n
\n
\n','
\n@article{pressLibredeMainPost2016,\n  author = {Main-Post},\n  title = {{CO2-Aussto\\ss{} von Rechnern verringern}},\n  location = {{W\\\"{u}rzburg}},\n  year = {2016},\n  month = {March},\n  day = {4},\n  url = {http://m.mainpost.de/97070-W%FCrzburg~artikel/Rechenzentren-Treibhausgase;art735,9139925}\n}\n
\n\n',NULL,'{CO2-Aussto\\ss{} von Rechnern verringern}',0,3,2016,3,NULL,NULL,NULL,'2016-03-09 12:48:36','2016-06-01 09:41:09',0),(1086,'paper','SPEC-RG-NEWSLETTER-5','misc','@misc{SPEC-RG-NEWSLETTER-5,\n author = {Samuel Kounev and Andre van Hoorn and Piotr Rygielski},\n month = {March},\n note = {Published by Standard Performance Evaluation Corporation (SPEC)},\n title = {{SPEC Research Group Newsletter, vol. 2 no. 1}},\n url = {http://research.spec.org/en/newsletter.html},\n year = {2016},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1086.pdf},\n}\n\n','\n\nSamuel Kounev, Andre van Hoorn, and Piotr Rygielski.\nSPEC Research Group Newsletter, vol. 2 no. 1, March 2016.\nPublished by Standard Performance Evaluation Corporation (SPEC).\n[ bib | .html | .pdf  ] 
\n@misc{SPEC-RG-NEWSLETTER-5,\nauthor = {Samuel Kounev and Andre van Hoorn and Piotr Rygielski},\nmonth = {March},\nnote = {Published by Standard Performance Evaluation Corporation (SPEC)},\ntitle = {{SPEC Research Group Newsletter, vol. 2 no. 1}},\nurl = {http://research.spec.org/en/newsletter.html},\nyear = {2016},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1086.pdf}\n}\n
\n
\n','
\n@misc{SPEC-RG-NEWSLETTER-5,\n  author = {Samuel Kounev and Andre van Hoorn and Piotr Rygielski},\n  month = {March},\n  note = {Published by Standard Performance Evaluation Corporation (SPEC)},\n  title = {{SPEC Research Group Newsletter, vol. 2 no. 1}},\n  url = {http://research.spec.org/en/newsletter.html},\n  year = {2016},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1086.pdf}\n}\n
\n\n',NULL,'{SPEC Research Group Newsletter, vol. 2 no. 1}',0,3,2016,3,NULL,NULL,NULL,'2016-03-12 15:34:10','2016-06-01 09:41:09',0),(1087,'paper','Stoll2016','mastersthesis','@mastersthesis{Stoll2016,\n author = {Jonathan Stoll},\n address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n title = {{SDN-basierte Lastverteilung f\\\"ur Schicht-7 Anfragen (SDN Rechenzentrum Fallstudie)}},\n type = {{Bachelor Thesis}},\n school = {University of W\\\"{u}rzburg},\n year = {2016},\n month = {March},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1087.pdf},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1087},\n}\n\n','\n\nJonathan Stoll.\nSDN-basierte Lastverteilung für Schicht-7 Anfragen (SDN\nRechenzentrum Fallstudie).\nBachelor Thesis, University of Würzburg, Am Hubland,\nInformatikgebäude, 97074 Würzburg, Germany, March 2016.\n[ bib | slides | .pdf  ] 
\n@mastersthesis{Stoll2016,\nauthor = {Jonathan Stoll},\naddress = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\ntitle = {{SDN-basierte Lastverteilung f\\\"ur Schicht-7 Anfragen (SDN Rechenzentrum Fallstudie)}},\ntype = {{Bachelor Thesis}},\nschool = {University of W\\\"{u}rzburg},\nyear = {2016},\nmonth = {March},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1087.pdf},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1087}\n}\n
\n
\n','
\n@mastersthesis{Stoll2016,\n  author = {Jonathan Stoll},\n  address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n  title = {{SDN-basierte Lastverteilung f\\\"ur Schicht-7 Anfragen (SDN Rechenzentrum Fallstudie)}},\n  type = {{Bachelor Thesis}},\n  school = {University of W\\\"{u}rzburg},\n  year = {2016},\n  month = {March},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1087.pdf},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1087}\n}\n
\n\n',NULL,'{SDN-basierte Lastverteilung f\\\"ur Schicht-7 Anfragen (SDN Rechenzentrum Fallstudie)}',0,3,2016,3,NULL,NULL,NULL,'2016-03-12 15:41:54','2016-06-01 09:41:09',0),(1088,'paper','Mi-CSA-SecPos','misc','@misc{Mi-CSA-SecPos,\n author = {Aleksandar Milenkoski and Bernd Jaeger and Kapil Raina and Mason Harris and Saif Chaudhry and Sivadon Chasiri and Veronica David and Wenmao Liu},\n month = {March},\n note = {Published by Cloud Security Alliance (CSA) - Virtualization Working Group},\n title = {{Security Position Paper: Network Function Virtualization}},\n url = {https://cloudsecurityalliance.org/download/security-position-paper-network-function-virtualization/},\n year = {2016},\n pdf = {https://downloads.cloudsecurityalliance.org/assets/research/virtualization/Security_Position_Paper-Network_Function_Virtualization.pdf},\n}\n\n','\n\nAleksandar Milenkoski, Bernd Jaeger, Kapil Raina, Mason Harris, Saif Chaudhry,\nSivadon Chasiri, Veronica David, and Wenmao Liu.\nSecurity Position Paper: Network Function Virtualization, March\n2016.\nPublished by Cloud Security Alliance (CSA) - Virtualization Working\nGroup.\n[ bib | http | .pdf  ] 
\n@misc{Mi-CSA-SecPos,\nauthor = {Aleksandar Milenkoski and Bernd Jaeger and Kapil Raina and Mason Harris and Saif Chaudhry and Sivadon Chasiri and Veronica David and Wenmao Liu},\nmonth = {March},\nnote = {Published by Cloud Security Alliance (CSA) - Virtualization Working Group},\ntitle = {{Security Position Paper: Network Function Virtualization}},\nurl = {https://cloudsecurityalliance.org/download/security-position-paper-network-function-virtualization/},\nyear = {2016},\npdf = {https://downloads.cloudsecurityalliance.org/assets/research/virtualization/Security_Position_Paper-Network_Function_Virtualization.pdf}\n}\n
\n
\n','
\n@misc{Mi-CSA-SecPos,\n  author = {Aleksandar Milenkoski and Bernd Jaeger and Kapil Raina and Mason Harris and Saif Chaudhry and Sivadon Chasiri and Veronica David and Wenmao Liu},\n  month = {March},\n  note = {Published by Cloud Security Alliance (CSA) - Virtualization Working Group},\n  title = {{Security Position Paper: Network Function Virtualization}},\n  url = {https://cloudsecurityalliance.org/download/security-position-paper-network-function-virtualization/},\n  year = {2016},\n  pdf = {https://downloads.cloudsecurityalliance.org/assets/research/virtualization/Security_Position_Paper-Network_Function_Virtualization.pdf}\n}\n
\n\n',NULL,'{Security Position Paper: Network Function Virtualization}',0,3,2016,3,NULL,NULL,NULL,'2016-03-29 11:48:51','2016-06-01 09:41:09',0),(1089,'paper','Mi-CSA-BestPr','misc','@misc{Mi-CSA-BestPr,\n author = {Abhik Chaudhuri and Heberto Ferrer and Hemma Prafullchandra and J.D. Sherry and Kelvin Ng and Xiaoyu Ge and Yao Sing and Yiak Por and Aleksandar Milenkoski (Minor Contributor)},\n month = {April},\n note = {Published by Cloud Security Alliance (CSA) - Virtualization Working Group},\n title = {{Best Practices for Mitigating Risks in Virtualized Environments}},\n year = {2015},\n pdf = {https://downloads.cloudsecurityalliance.org/whitepapers/Best_Practices_for%20_Mitigating_Risks_Virtual_Environments_April2015_4-1-15_GLM5.pdf},\n}\n\n','\n\nAbhik Chaudhuri, Heberto Ferrer, Hemma Prafullchandra, J.D. Sherry, Kelvin Ng,\nXiaoyu Ge, Yao Sing, Yiak Por, and Aleksandar Milenkoski (Minor Contributor).\nBest Practices for Mitigating Risks in Virtualized Environments,\nApril 2015.\nPublished by Cloud Security Alliance (CSA) - Virtualization Working\nGroup.\n[ bib | .pdf  ] 
\n@misc{Mi-CSA-BestPr,\nauthor = {Abhik Chaudhuri and Heberto Ferrer and Hemma Prafullchandra and J.D. Sherry and Kelvin Ng and Xiaoyu Ge and Yao Sing and Yiak Por and Aleksandar Milenkoski (Minor Contributor)},\nmonth = {April},\nnote = {Published by Cloud Security Alliance (CSA) - Virtualization Working Group},\ntitle = {{Best Practices for Mitigating Risks in Virtualized Environments}},\nyear = {2015},\npdf = {https://downloads.cloudsecurityalliance.org/whitepapers/Best_Practices_for%20_Mitigating_Risks_Virtual_Environments_April2015_4-1-15_GLM5.pdf}\n}\n
\n
\n','
\n@misc{Mi-CSA-BestPr,\n  author = {Abhik Chaudhuri and Heberto Ferrer and Hemma Prafullchandra and J.D. Sherry and Kelvin Ng and Xiaoyu Ge and Yao Sing and Yiak Por and Aleksandar Milenkoski (Minor Contributor)},\n  month = {April},\n  note = {Published by Cloud Security Alliance (CSA) - Virtualization Working Group},\n  title = {{Best Practices for Mitigating Risks in Virtualized Environments}},\n  year = {2015},\n  pdf = {https://downloads.cloudsecurityalliance.org/whitepapers/Best_Practices_for%20_Mitigating_Risks_Virtual_Environments_April2015_4-1-15_GLM5.pdf}\n}\n
\n\n',NULL,'{Best Practices for Mitigating Risks in Virtualized Environments}',0,4,2015,4,NULL,NULL,NULL,'2016-03-29 11:53:11','2016-06-01 09:41:09',0),(1090,'paper','pressLibredeBR2016','misc','@misc{pressLibredeBR2016,\n author = {Bayern 2 (Radio)},\n title = {{ Prof. Samuel Kounev zu Klimakiller Internet}},\n location = {{W\\\"{u}rzburg}},\n year = {2016},\n month = {March},\n day = {10},\n url = {http://www.br.de/radio/bayern2/politik/radiowelt/prof-samuel-kounev-zu-klimakiller-internet-100.html},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1090.pdf},\n}\n\n','\n\nBayern 2 (Radio).\nProf. Samuel Kounev zu Klimakiller Internet, March 2016.\n[ bib | .html | .pdf  ] 
\n@misc{pressLibredeBR2016,\nauthor = {Bayern 2 (Radio)},\ntitle = {{ Prof. Samuel Kounev zu Klimakiller Internet}},\nlocation = {{W\\\"{u}rzburg}},\nyear = {2016},\nmonth = {March},\nday = {10},\nurl = {http://www.br.de/radio/bayern2/politik/radiowelt/prof-samuel-kounev-zu-klimakiller-internet-100.html},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1090.pdf}\n}\n
\n
\n','
\n@misc{pressLibredeBR2016,\n  author = {Bayern 2 (Radio)},\n  title = {{ Prof. Samuel Kounev zu Klimakiller Internet}},\n  location = {{W\\\"{u}rzburg}},\n  year = {2016},\n  month = {March},\n  day = {10},\n  url = {http://www.br.de/radio/bayern2/politik/radiowelt/prof-samuel-kounev-zu-klimakiller-internet-100.html},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1090.pdf}\n}\n
\n\n',NULL,'{ Prof. Samuel Kounev zu Klimakiller Internet}',0,3,2016,3,NULL,NULL,NULL,'2016-03-30 11:58:03','2016-06-01 09:41:09',0),(1091,'paper','Thiele2016','mastersthesis','@mastersthesis{Thiele2016,\n author = {Christoph Thiele},\n address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n title = {{A Capability Model for Solution Approaches in Performance Engineering}},\n type = {{Bachelor Thesis}},\n school = {University of W\\\"{u}rzburg},\n year = {2016},\n month = {March},\n day = {21},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1091.pdf},\n}\n\n','\n\nChristoph Thiele.\nA Capability Model for Solution Approaches in Performance\nEngineering.\nBachelor Thesis, University of Würzburg, Am Hubland,\nInformatikgebäude, 97074 Würzburg, Germany, March 2016.\n[ bib | .pdf  ] 
\n@mastersthesis{Thiele2016,\nauthor = {Christoph Thiele},\naddress = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\ntitle = {{A Capability Model for Solution Approaches in Performance Engineering}},\ntype = {{Bachelor Thesis}},\nschool = {University of W\\\"{u}rzburg},\nyear = {2016},\nmonth = {March},\nday = {21},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1091.pdf}\n}\n
\n
\n','
\n@mastersthesis{Thiele2016,\n  author = {Christoph Thiele},\n  address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n  title = {{A Capability Model for Solution Approaches in Performance Engineering}},\n  type = {{Bachelor Thesis}},\n  school = {University of W\\\"{u}rzburg},\n  year = {2016},\n  month = {March},\n  day = {21},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1091.pdf}\n}\n
\n\n',NULL,'{A Capability Model for Solution Approaches in Performance Engineering}',1,3,2016,3,NULL,NULL,NULL,'2016-03-30 15:29:17','2016-06-01 09:41:09',0),(1092,'paper','DML_IEEESoftwareblog2016','misc','@misc{DML_IEEESoftwareblog2016,\n author = {Samuel Kounev},\n editor = {Zhen Ming (Jack) Jiang},\n url = {http://blog.ieeesoftware.org/2016/04/the-descartes-modeling-language-for.html},\n title = {{The Descartes Modeling Language for Self-Aware Performance and Resource Management}},\n note = {IEEE Software Blog},\n year = {2016},\n month = {April},\n day = {3},\n}\n\n','\n\nSamuel Kounev.\nThe Descartes Modeling Language for Self-Aware Performance and\nResource Management, April 2016.\nIEEE Software Blog.\n[ bib | .html  ] 
\n@misc{DML_IEEESoftwareblog2016,\nauthor = {Samuel Kounev},\neditor = {Zhen Ming (Jack) Jiang},\nurl = {http://blog.ieeesoftware.org/2016/04/the-descartes-modeling-language-for.html},\ntitle = {{The Descartes Modeling Language for Self-Aware Performance and Resource Management}},\nnote = {IEEE Software Blog},\nyear = {2016},\nmonth = {April},\nday = {3}\n}\n
\n
\n','
\n@misc{DML_IEEESoftwareblog2016,\n  author = {Samuel Kounev},\n  editor = {Zhen Ming (Jack) Jiang},\n  url = {http://blog.ieeesoftware.org/2016/04/the-descartes-modeling-language-for.html},\n  title = {{The Descartes Modeling Language for Self-Aware Performance and Resource Management}},\n  note = {IEEE Software Blog},\n  year = {2016},\n  month = {April},\n  day = {3}\n}\n
\n\n',NULL,'{The Descartes Modeling Language for Self-Aware Performance and Resource Management}',0,4,2016,4,NULL,NULL,NULL,'2016-04-09 15:24:44','2016-06-01 09:41:09',0),(1097,'paper','WaHoKoOkKo2016-ICPE-DPE_Poster','misc','@misc{WaHoKoOkKo2016-ICPE-DPE_Poster,\n author = {J\\\"{u}rgen Walter and Andre van Hoorn and Heiko Koziolek and Dusan Okanovic and Samuel Kounev},\n title = {{The Vision of Declarative Performance Engineering}},\n booktitle = {{Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\n year = {2016},\n location = {Delft, the Netherlands},\n month = {March},\n day = {12},\n abstract = {Over the past decades, various methods, techniques, and tools for modeling and evaluating performance properties of software systems have been proposed covering the entire software life cycle. However, the application of performance engineering approaches to solve a given user concern is still rather challenging and requires expert knowledge and experience. There are no recipes on how to select, configure, and execute suitable methods, tools, and techniques allowing to address the user concerns. In this paper, we describe our vision of Declarative Performance Engineering (DPE), which aims to decouple the description of the user concerns to be solved (performance questions and goals) from the task of selecting and applying a specific solution approach. The strict separation of ``what\'\' versus ``how\'\' enables the development of different techniques and algorithms to automatically select and apply a suitable approach for a given scenario. The goal is to hide complexity from the user by allowing users to express their concerns and goals without requiring any knowledge about performance engineering techniques. Towards realizing the DPE vision, we discuss the different requirements and propose a reference architecture for implementing and integrating respective methods, algorithms, and tooling.},\n note = {Poster},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1097},\n}\n\n','\n\nJürgen Walter, Andre van Hoorn, Heiko Koziolek, Dusan Okanovic, and Samuel\nKounev.\nThe Vision of Declarative Performance Engineering, March 2016.\nPoster.\n[ bib | slides | Abstract  ] 
\n@misc{WaHoKoOkKo2016-ICPE-DPE_Poster,\nauthor = {J\\\"{u}rgen Walter and Andre van Hoorn and Heiko Koziolek and Dusan Okanovic and Samuel Kounev},\ntitle = {{The Vision of Declarative Performance Engineering}},\nbooktitle = {{Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\nyear = {2016},\nlocation = {Delft, the Netherlands},\nmonth = {March},\nday = {12},\nabstract = {Over the past decades, various methods, techniques, and tools for modeling and evaluating performance properties of software systems have been proposed covering the entire software life cycle. However, the application of performance engineering approaches to solve a given user concern is still rather challenging and requires expert knowledge and experience. There are no recipes on how to select, configure, and execute suitable methods, tools, and techniques allowing to address the user concerns. In this paper, we describe our vision of Declarative Performance Engineering (DPE), which aims to decouple the description of the user concerns to be solved (performance questions and goals) from the task of selecting and applying a specific solution approach. The strict separation of ``what\'\' versus ``how\'\' enables the development of different techniques and algorithms to automatically select and apply a suitable approach for a given scenario. The goal is to hide complexity from the user by allowing users to express their concerns and goals without requiring any knowledge about performance engineering techniques. Towards realizing the DPE vision, we discuss the different requirements and propose a reference architecture for implementing and integrating respective methods, algorithms, and tooling.},\nnote = {Poster},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1097}\n}\n
\n
\nOver the past decades, various methods, techniques, and tools for modeling and evaluating performance properties of software systems have been proposed covering the entire software life cycle. However, the application of performance engineering approaches to solve a given user concern is still rather challenging and requires expert knowledge and experience. There are no recipes on how to select, configure, and execute suitable methods, tools, and techniques allowing to address the user concerns. In this paper, we describe our vision of Declarative Performance Engineering (DPE), which aims to decouple the description of the user concerns to be solved (performance questions and goals) from the task of selecting and applying a specific solution approach. The strict separation of “what” versus “how” enables the development of different techniques and algorithms to automatically select and apply a suitable approach for a given scenario. The goal is to hide complexity from the user by allowing users to express their concerns and goals without requiring any knowledge about performance engineering techniques. Towards realizing the DPE vision, we discuss the different requirements and propose a reference architecture for implementing and integrating respective methods, algorithms, and tooling.\n
\n','
\n@misc{WaHoKoOkKo2016-ICPE-DPE_Poster,\n  author = {J\\\"{u}rgen Walter and Andre van Hoorn and Heiko Koziolek and Dusan Okanovic and Samuel Kounev},\n  title = {{The Vision of Declarative Performance Engineering}},\n  booktitle = {{Proceedings of the 7th ACM/SPEC International Conference on Performance Engineering (ICPE 2016)}},\n  year = {2016},\n  location = {Delft, the Netherlands},\n  month = {March},\n  day = {12},\n  abstract = {Over the past decades, various methods, techniques, and tools for modeling and evaluating performance properties of software systems have been proposed covering the entire software life cycle. However, the application of performance engineering approaches to solve a given user concern is still rather challenging and requires expert knowledge and experience. There are no recipes on how to select, configure, and execute suitable methods, tools, and techniques allowing to address the user concerns. In this paper, we describe our vision of Declarative Performance Engineering (DPE), which aims to decouple the description of the user concerns to be solved (performance questions and goals) from the task of selecting and applying a specific solution approach. The strict separation of ``what\'\' versus ``how\'\' enables the development of different techniques and algorithms to automatically select and apply a suitable approach for a given scenario. The goal is to hide complexity from the user by allowing users to express their concerns and goals without requiring any knowledge about performance engineering techniques. Towards realizing the DPE vision, we discuss the different requirements and propose a reference architecture for implementing and integrating respective methods, algorithms, and tooling.},\n  note = {Poster},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1097}\n}\n
\n\n','Over the past decades, various methods, techniques, and tools for modeling and evaluating performance properties of software systems have been proposed covering the entire software life cycle. However, the application of performance engineering approaches to solve a given user concern is still rather challenging and requires expert knowledge and experience. There are no recipes on how to select, configure, and execute suitable methods, tools, and techniques allowing to address the user concerns. In this paper, we describe our vision of Declarative Performance Engineering (DPE), which aims to decouple the description of the user concerns to be solved (performance questions and goals) from the task of selecting and applying a specific solution approach. The strict separation of ``what\'\' versus ``how\'\' enables the development of different techniques and algorithms to automatically select and apply a suitable approach for a given scenario. The goal is to hide complexity from the user by allowing users to express their concerns and goals without requiring any knowledge about performance engineering techniques. Towards realizing the DPE vision, we discuss the different requirements and propose a reference architecture for implementing and integrating respective methods, algorithms, and tooling.','{The Vision of Declarative Performance Engineering}',0,3,2016,3,NULL,NULL,NULL,'2016-04-13 12:54:28','2016-06-01 09:41:09',0),(1098,'paper','Mueller2016','mastersthesis','@mastersthesis{Mueller2016,\n author = {Christoph M\\\"{u}ller},\n address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n title = {{Fluid Analysis of Queueing Petri Nets Models using Model-to-Model Transformations}},\n type = {{Master Thesis}},\n school = {University of W\\\"{u}rzburg},\n year = {2016},\n month = {April},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1098.pdf},\n}\n\n','\n\nChristoph Müller.\nFluid Analysis of Queueing Petri Nets Models using Model-to-Model\nTransformations.\nMaster Thesis, University of Würzburg, Am Hubland,\nInformatikgebäude, 97074 Würzburg, Germany, April 2016.\n[ bib | .pdf  ] 
\n@mastersthesis{Mueller2016,\nauthor = {Christoph M\\\"{u}ller},\naddress = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\ntitle = {{Fluid Analysis of Queueing Petri Nets Models using Model-to-Model Transformations}},\ntype = {{Master Thesis}},\nschool = {University of W\\\"{u}rzburg},\nyear = {2016},\nmonth = {April},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1098.pdf}\n}\n
\n
\n','
\n@mastersthesis{Mueller2016,\n  author = {Christoph M\\\"{u}ller},\n  address = {Am Hubland, Informatikgeb\\\"aude, 97074 W\\\"urzburg, Germany},\n  title = {{Fluid Analysis of Queueing Petri Nets Models using Model-to-Model Transformations}},\n  type = {{Master Thesis}},\n  school = {University of W\\\"{u}rzburg},\n  year = {2016},\n  month = {April},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1098.pdf}\n}\n
\n\n',NULL,'{Fluid Analysis of Queueing Petri Nets Models using Model-to-Model Transformations}',1,4,2016,4,NULL,NULL,NULL,'2016-04-18 07:06:53','2016-06-01 09:41:09',0),(1099,'paper','SpinnerZLUGHK-2015-RADIO-MemoryScaling','inproceedings','@inproceedings{SpinnerZLUGHK-2015-RADIO-MemoryScaling,\n author = {Simon Spinner and Xiaoyun Zhu and Lei Lu and Mustafa Uysal and Rean Griffith and Nikolas Herbst and Samuel Kounev},\n title = {{Proactive Memory Scaling of Virtualized Applications}},\n booktitle = {VMware R&D Innovation Offsite (RADIO)},\n year = {2015},\n month = {July},\n}\n\n','\n\nSimon Spinner, Xiaoyun Zhu, Lei Lu, Mustafa Uysal, Rean Griffith, Nikolas\nHerbst, and Samuel Kounev.\nProactive Memory Scaling of Virtualized Applications.\nIn VMware R&D Innovation Offsite (RADIO), July 2015.\n[ bib  ] 
\n@inproceedings{SpinnerZLUGHK-2015-RADIO-MemoryScaling,\nauthor = {Simon Spinner and Xiaoyun Zhu and Lei Lu and Mustafa Uysal and Rean Griffith and Nikolas Herbst and Samuel Kounev},\ntitle = {{Proactive Memory Scaling of Virtualized Applications}},\nbooktitle = {VMware R&D Innovation Offsite (RADIO)},\nyear = {2015},\nmonth = {July}\n}\n
\n
\n','
\n@inproceedings{SpinnerZLUGHK-2015-RADIO-MemoryScaling,\n  author = {Simon Spinner and Xiaoyun Zhu and Lei Lu and Mustafa Uysal and Rean Griffith and Nikolas Herbst and Samuel Kounev},\n  title = {{Proactive Memory Scaling of Virtualized Applications}},\n  booktitle = {VMware R&D Innovation Offsite (RADIO)},\n  year = {2015},\n  month = {July}\n}\n
\n\n',NULL,'{Proactive Memory Scaling of Virtualized Applications}',1,7,2015,7,NULL,NULL,NULL,'2016-04-20 15:12:15','2016-06-01 09:41:09',0),(1100,'paper','SpinnerKZLUHGP-2014-RADIO-ModelBasedScaling','inproceedings','@inproceedings{SpinnerKZLUHGP-2014-RADIO-ModelBasedScaling,\n author = {Simon Spinner and Samuel Kounev and Xiaoyun Zhu and Lei Lu and Mustafa Uysal and Anne Holler and Rean Griffith and Pradeep Padala},\n title = {{Model-Based Runtime Performance Management for Virtualized Applications}},\n booktitle = {VMware R&D Innovation Offsite (RADIO)},\n year = {2014},\n month = {July},\n}\n\n','\n\nSimon Spinner, Samuel Kounev, Xiaoyun Zhu, Lei Lu, Mustafa Uysal, Anne Holler,\nRean Griffith, and Pradeep Padala.\nModel-Based Runtime Performance Management for Virtualized\nApplications.\nIn VMware R&D Innovation Offsite (RADIO), July 2014.\n[ bib  ] 
\n@inproceedings{SpinnerKZLUHGP-2014-RADIO-ModelBasedScaling,\nauthor = {Simon Spinner and Samuel Kounev and Xiaoyun Zhu and Lei Lu and Mustafa Uysal and Anne Holler and Rean Griffith and Pradeep Padala},\ntitle = {{Model-Based Runtime Performance Management for Virtualized Applications}},\nbooktitle = {VMware R&D Innovation Offsite (RADIO)},\nyear = {2014},\nmonth = {July}\n}\n
\n
\n','
\n@inproceedings{SpinnerKZLUHGP-2014-RADIO-ModelBasedScaling,\n  author = {Simon Spinner and Samuel Kounev and Xiaoyun Zhu and Lei Lu and Mustafa Uysal and Anne Holler and Rean Griffith and Pradeep Padala},\n  title = {{Model-Based Runtime Performance Management for Virtualized Applications}},\n  booktitle = {VMware R&D Innovation Offsite (RADIO)},\n  year = {2014},\n  month = {July}\n}\n
\n\n',NULL,'{Model-Based Runtime Performance Management for Virtualized Applications}',1,7,2014,7,NULL,NULL,NULL,'2016-04-20 15:19:21','2016-06-01 09:41:09',0),(1101,'paper','pressLibredeRundschau2016','misc','@misc{pressLibredeRundschau2016,\n author = {Bayrischer Rundfunk (BR) - Rundschau},\n title = {{Stromverbrauch: Preis f\\\"{u}r W\\\"{u}rzburger Uni}},\n location = {{W\\\"{u}rzburg}},\n year = {2016},\n month = {April},\n day = {26},\n url = {http://www.br.de/mediathek/video/sendungen/nachrichten/sendung-vom-26042016_x-100.html},\n note = {Report starts at 10:18},\n}\n\n','\n\nBayrischer Rundfunk (BR) Rundschau.\nStromverbrauch: Preis für Würzburger Uni, April 2016.\nReport starts at 10:18.\n[ bib | .html  ] 
\n@misc{pressLibredeRundschau2016,\nauthor = {Bayrischer Rundfunk (BR) - Rundschau},\ntitle = {{Stromverbrauch: Preis f\\\"{u}r W\\\"{u}rzburger Uni}},\nlocation = {{W\\\"{u}rzburg}},\nyear = {2016},\nmonth = {April},\nday = {26},\nurl = {http://www.br.de/mediathek/video/sendungen/nachrichten/sendung-vom-26042016_x-100.html},\nnote = {Report starts at 10:18}\n}\n
\n
\n','
\n@misc{pressLibredeRundschau2016,\n  author = {Bayrischer Rundfunk (BR) - Rundschau},\n  title = {{Stromverbrauch: Preis f\\\"{u}r W\\\"{u}rzburger Uni}},\n  location = {{W\\\"{u}rzburg}},\n  year = {2016},\n  month = {April},\n  day = {26},\n  url = {http://www.br.de/mediathek/video/sendungen/nachrichten/sendung-vom-26042016_x-100.html},\n  note = {Report starts at 10:18}\n}\n
\n\n',NULL,'{Stromverbrauch: Preis f\\\"{u}r W\\\"{u}rzburger Uni}',0,4,2016,4,NULL,NULL,NULL,'2016-04-27 07:17:22','2016-06-01 09:41:09',0),(1103,'talk','Talk-KoBrMeBeKoKoRy2016-SE-tradeoffs_perf_prediction_approaches','misc','@misc{Talk-KoBrMeBeKoKoRy2016-SE-tradeoffs_perf_prediction_approaches,\n address = {Vienna, Austria},\n author = {Samuel Kounev and Fabian Brosig and Philipp Meier and Steffen Becker and Anne Koziolek and Heiko Koziolek and Piotr Rygielski},\n howpublished = {Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. M\\\"{a}rz 2016, Vienna, Austria},\n title = {{Analysis of the Trade-offs in Different Modeling Approaches for Performance Prediction of Software Systems}},\n days = {23-26},\n month = {February},\n year = {2016},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1077},\n}\n\n','\n\nSamuel Kounev, Fabian Brosig, Philipp Meier, Steffen Becker, Anne Koziolek,\nHeiko Koziolek, and Piotr Rygielski.\nAnalysis of the Trade-offs in Different Modeling Approaches for\nPerformance Prediction of Software Systems.\nSoftware Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs\nSoftwaretechnik, 23.-26. März 2016, Vienna, Austria, February 2016.\n[ bib | slides  ] 
\n@misc{Talk-KoBrMeBeKoKoRy2016-SE-tradeoffs_perf_prediction_approaches,\naddress = {Vienna, Austria},\nauthor = {Samuel Kounev and Fabian Brosig and Philipp Meier and Steffen Becker and Anne Koziolek and Heiko Koziolek and Piotr Rygielski},\nhowpublished = {Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. M\\\"{a}rz 2016, Vienna, Austria},\ntitle = {{Analysis of the Trade-offs in Different Modeling Approaches for Performance Prediction of Software Systems}},\ndays = {23-26},\nmonth = {February},\nyear = {2016},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1077}\n}\n
\n
\n','
\n@misc{Talk-KoBrMeBeKoKoRy2016-SE-tradeoffs_perf_prediction_approaches,\n  address = {Vienna, Austria},\n  author = {Samuel Kounev and Fabian Brosig and Philipp Meier and Steffen Becker and Anne Koziolek and Heiko Koziolek and Piotr Rygielski},\n  howpublished = {Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. M\\\"{a}rz 2016, Vienna, Austria},\n  title = {{Analysis of the Trade-offs in Different Modeling Approaches for Performance Prediction of Software Systems}},\n  days = {23-26},\n  month = {February},\n  year = {2016},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1077}\n}\n
\n\n',NULL,'{Analysis of the Trade-offs in Different Modeling Approaches for Performance Prediction of Software Systems}',0,2,2016,2,NULL,NULL,NULL,'2016-04-30 11:08:00','2016-06-01 09:41:09',0),(1104,'paper','BuNoKoKoReAm-SE-IO_Workload_Characterization','inproceedings','@inproceedings{BuNoKoKoReAm-SE-IO_Workload_Characterization,\n author = {Axel Busch and Qais Noorshams and Samuel Kounev and Anne Koziolek and Ralf Reussner and Erich Amrehn},\n title = {{Automated Workload Characterization for I/O Performance Analysis in Virtualized Environments}},\n booktitle = {Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. M\\\"{a}rz 2016, Vienna, Austria},\n publisher = {GI},\n series = {Lecture Notes in Informatics (LNI)},\n address = {Vienna, Austria},\n days = {23-26},\n month = {February},\n pages = {27--28},\n year = {2016},\n titleaddon = {{(Talk Extended Abstract)}},\n http = {http://subs.emis.de/LNI/Proceedings/Proceedings252/article48.html},\n pdf = {http://subs.emis.de/LNI/Proceedings/Proceedings252/27.pdf},\n}\n\n','\n\nAxel Busch, Qais Noorshams, Samuel Kounev, Anne Koziolek, Ralf Reussner, and\nErich Amrehn.\nAutomated Workload Characterization for I/O Performance Analysis in\nVirtualized Environments (Talk Extended Abstract).\nIn Software Engineering 2016 (SE 2016), Fachtagung des\nGI-Fachbereichs Softwaretechnik, 23.-26. März 2016, Vienna, Austria,\nFebruary 2016, Lecture Notes in Informatics (LNI), pages 27-28. GI, Vienna,\nAustria.\nFebruary 2016.\n[ bib | .html | .pdf  ] 
\n@inproceedings{BuNoKoKoReAm-SE-IO_Workload_Characterization,\nauthor = {Axel Busch and Qais Noorshams and Samuel Kounev and Anne Koziolek and Ralf Reussner and Erich Amrehn},\ntitle = {{Automated Workload Characterization for I/O Performance Analysis in Virtualized Environments}},\nbooktitle = {Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. M\\\"{a}rz 2016, Vienna, Austria},\npublisher = {GI},\nseries = {Lecture Notes in Informatics (LNI)},\naddress = {Vienna, Austria},\ndays = {23-26},\nmonth = {February},\npages = {27--28},\nyear = {2016},\ntitleaddon = {{(Talk Extended Abstract)}},\nhttp = {http://subs.emis.de/LNI/Proceedings/Proceedings252/article48.html},\npdf = {http://subs.emis.de/LNI/Proceedings/Proceedings252/27.pdf}\n}\n
\n
\n','
\n@inproceedings{BuNoKoKoReAm-SE-IO_Workload_Characterization,\n  author = {Axel Busch and Qais Noorshams and Samuel Kounev and Anne Koziolek and Ralf Reussner and Erich Amrehn},\n  title = {{Automated Workload Characterization for I/O Performance Analysis in Virtualized Environments}},\n  booktitle = {Software Engineering 2016 (SE 2016), Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. M\\\"{a}rz 2016, Vienna, Austria},\n  publisher = {GI},\n  series = {Lecture Notes in Informatics (LNI)},\n  address = {Vienna, Austria},\n  days = {23-26},\n  month = {February},\n  pages = {27--28},\n  year = {2016},\n  titleaddon = {{(Talk Extended Abstract)}},\n  http = {http://subs.emis.de/LNI/Proceedings/Proceedings252/article48.html},\n  pdf = {http://subs.emis.de/LNI/Proceedings/Proceedings252/27.pdf}\n}\n
\n\n',NULL,'{Automated Workload Characterization for I/O Performance Analysis in Virtualized Environments}',0,2,2016,2,NULL,NULL,NULL,'2016-04-30 11:20:46','2016-06-01 09:41:09',0),(1105,'paper','MiIoKoSaMuCuDiRoRy2016-IEEECC-cup','article','@article{MiIoKoSaMuCuDiRoRy2016-IEEECC-cup,\n author = {Aleksandar Milenkoski and Alexandru Iosup and Samuel Kounev and Kai Sachs and Diane E. Mularz and Jonathan A. Curtiss and Jason J. Ding and Florian Rosenberg and Piotr Rygielski},\n title = {{CUP: A Formalism for Expressing Cloud Usage Patterns for Experts and Non-Experts}},\n journal = {IEEE Cloud Computing},\n year = {2016},\n note = {To Appear},\n}\n\n','\n\nAleksandar Milenkoski, Alexandru Iosup, Samuel Kounev, Kai Sachs, Diane E.\nMularz, Jonathan A. Curtiss, Jason J. Ding, Florian Rosenberg, and Piotr\nRygielski.\nCUP: A Formalism for Expressing Cloud Usage Patterns for Experts and\nNon-Experts.\nIEEE Cloud Computing, 2016.\nTo Appear.\n[ bib  ] 
\n@article{MiIoKoSaMuCuDiRoRy2016-IEEECC-cup,\nauthor = {Aleksandar Milenkoski and Alexandru Iosup and Samuel Kounev and Kai Sachs and Diane E. Mularz and Jonathan A. Curtiss and Jason J. Ding and Florian Rosenberg and Piotr Rygielski},\ntitle = {{CUP: A Formalism for Expressing Cloud Usage Patterns for Experts and Non-Experts}},\njournal = {IEEE Cloud Computing},\nyear = {2016},\nnote = {To Appear}\n}\n
\n
\n','
\n@article{MiIoKoSaMuCuDiRoRy2016-IEEECC-cup,\n  author = {Aleksandar Milenkoski and Alexandru Iosup and Samuel Kounev and Kai Sachs and Diane E. Mularz and Jonathan A. Curtiss and Jason J. Ding and Florian Rosenberg and Piotr Rygielski},\n  title = {{CUP: A Formalism for Expressing Cloud Usage Patterns for Experts and Non-Experts}},\n  journal = {IEEE Cloud Computing},\n  year = {2016},\n  note = {To Appear}\n}\n
\n\n',NULL,'{CUP: A Formalism for Expressing Cloud Usage Patterns for Experts and Non-Experts}',0,0,2016,0,NULL,NULL,NULL,'2016-05-09 09:05:03','2016-06-01 09:41:09',0),(1106,'paper','KoKeZhMi2016-self','book','@book{KoKeZhMi2016-self,\n editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n title = {{Self-Aware Computing Systems}},\n publisher = {{Springer Verlag}},\n address = {{Berlin Heidelberg, Germany}},\n year = {2016},\n note = {To Appear},\n}\n\n','\n\nSamuel Kounev, Jeffrey O. Kephart, Xiaoyun Zhu, and Aleksandar Milenkoski,\neditors.\nSelf-Aware Computing Systems.\nSpringer Verlag, Berlin Heidelberg, Germany, 2016.\nTo Appear.\n[ bib  ] 
\n@book{KoKeZhMi2016-self,\neditor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\ntitle = {{Self-Aware Computing Systems}},\npublisher = {{Springer Verlag}},\naddress = {{Berlin Heidelberg, Germany}},\nyear = {2016},\nnote = {To Appear}\n}\n
\n
\n','
\n@book{KoKeZhMi2016-self,\n  editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n  title = {{Self-Aware Computing Systems}},\n  publisher = {{Springer Verlag}},\n  address = {{Berlin Heidelberg, Germany}},\n  year = {2016},\n  note = {To Appear}\n}\n
\n\n',NULL,'{Self-Aware Computing Systems}',0,0,2016,0,NULL,NULL,NULL,'2016-05-09 09:31:33','2016-06-01 09:41:09',0),(1107,'paper','ZhKoKeMi2016-self','incollection','@incollection{ZhKoKeMi2016-self,\n title = {{Open Challenges and Future Research Directions}},\n editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n author = {Xiaoyun Zhu and Samuel Kounev and Jeffrey O. Kephart and Aleksandar Milenkoski},\n booktitle = {{Self-Aware Computing Systems}},\n publisher = {{Springer Verlag}},\n address = {{Berlin Heidelberg, Germany}},\n year = {2016},\n note = {{To Appear}},\n}\n\n','\n\nXiaoyun Zhu, Samuel Kounev, Jeffrey O. Kephart, and Aleksandar Milenkoski.\nOpen Challenges and Future Research Directions.\nIn Self-Aware Computing Systems, Samuel Kounev, Jeffrey O.\nKephart, Xiaoyun Zhu, and Aleksandar Milenkoski, editors. Springer Verlag,\nBerlin Heidelberg, Germany, 2016.\nTo Appear.\n[ bib  ] 
\n@incollection{ZhKoKeMi2016-self,\ntitle = {{Open Challenges and Future Research Directions}},\neditor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\nauthor = {Xiaoyun Zhu and Samuel Kounev and Jeffrey O. Kephart and Aleksandar Milenkoski},\nbooktitle = {{Self-Aware Computing Systems}},\npublisher = {{Springer Verlag}},\naddress = {{Berlin Heidelberg, Germany}},\nyear = {2016},\nnote = {{To Appear}}\n}\n
\n
\n','
\n@incollection{ZhKoKeMi2016-self,\n  title = {{Open Challenges and Future Research Directions}},\n  editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n  author = {Xiaoyun Zhu and Samuel Kounev and Jeffrey O. Kephart and Aleksandar Milenkoski},\n  booktitle = {{Self-Aware Computing Systems}},\n  publisher = {{Springer Verlag}},\n  address = {{Berlin Heidelberg, Germany}},\n  year = {2016},\n  note = {{To Appear}}\n}\n
\n\n',NULL,'{Open Challenges and Future Research Directions}',0,0,2016,0,NULL,NULL,NULL,'2016-05-09 09:41:59','2016-06-01 09:41:09',0),(1108,'paper','JaMiKo2016-self','incollection','@incollection{JaMiKo2016-self,\n title = {{Software Architectures for Self-Protection in IaaS Clouds}},\n editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n author = {K. R. Jayaram and Aleksandar Milenkoski and Samuel Kounev},\n booktitle = {{Self-Aware Computing Systems}},\n publisher = {{Springer Verlag}},\n address = {{Berlin Heidelberg, Germany}},\n year = {2016},\n note = {{To Appear}},\n}\n\n','\n\nK. R. Jayaram, Aleksandar Milenkoski, and Samuel Kounev.\nSoftware Architectures for Self-Protection in IaaS Clouds.\nIn Self-Aware Computing Systems, Samuel Kounev, Jeffrey O.\nKephart, Xiaoyun Zhu, and Aleksandar Milenkoski, editors. Springer Verlag,\nBerlin Heidelberg, Germany, 2016.\nTo Appear.\n[ bib  ] 
\n@incollection{JaMiKo2016-self,\ntitle = {{Software Architectures for Self-Protection in IaaS Clouds}},\neditor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\nauthor = {K. R. Jayaram and Aleksandar Milenkoski and Samuel Kounev},\nbooktitle = {{Self-Aware Computing Systems}},\npublisher = {{Springer Verlag}},\naddress = {{Berlin Heidelberg, Germany}},\nyear = {2016},\nnote = {{To Appear}}\n}\n
\n
\n','
\n@incollection{JaMiKo2016-self,\n  title = {{Software Architectures for Self-Protection in IaaS Clouds}},\n  editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n  author = {K. R. Jayaram and Aleksandar Milenkoski and Samuel Kounev},\n  booktitle = {{Self-Aware Computing Systems}},\n  publisher = {{Springer Verlag}},\n  address = {{Berlin Heidelberg, Germany}},\n  year = {2016},\n  note = {{To Appear}}\n}\n
\n\n',NULL,'{Software Architectures for Self-Protection in IaaS Clouds}',0,0,2016,0,NULL,NULL,NULL,'2016-05-09 09:45:10','2016-06-01 09:41:09',0),(1109,'paper','HeBeKoMaMiSmKo2016-self','incollection','@incollection{HeBeKoMaMiSmKo2016-self,\n title = {{Metrics and Benchmarks for Self-Aware Computing Systems}},\n editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n author = {Nikolas Herbst and Steffen Becker and Heiko Koziolek and Martina Maggio and Aleksandar Milenkoski and Evgenia Smirni and Samuel Kounev},\n booktitle = {{Self-Aware Computing Systems}},\n publisher = {{Springer Verlag}},\n address = {{Berlin Heidelberg, Germany}},\n year = {2016},\n note = {{To Appear}},\n}\n\n','\n\nNikolas Herbst, Steffen Becker, Heiko Koziolek, Martina Maggio, Aleksandar\nMilenkoski, Evgenia Smirni, and Samuel Kounev.\nMetrics and Benchmarks for Self-Aware Computing Systems.\nIn Self-Aware Computing Systems, Samuel Kounev, Jeffrey O.\nKephart, Xiaoyun Zhu, and Aleksandar Milenkoski, editors. Springer Verlag,\nBerlin Heidelberg, Germany, 2016.\nTo Appear.\n[ bib  ] 
\n@incollection{HeBeKoMaMiSmKo2016-self,\ntitle = {{Metrics and Benchmarks for Self-Aware Computing Systems}},\neditor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\nauthor = {Nikolas Herbst and Steffen Becker and Heiko Koziolek and Martina Maggio and Aleksandar Milenkoski and Evgenia Smirni and Samuel Kounev},\nbooktitle = {{Self-Aware Computing Systems}},\npublisher = {{Springer Verlag}},\naddress = {{Berlin Heidelberg, Germany}},\nyear = {2016},\nnote = {{To Appear}}\n}\n
\n
\n','
\n@incollection{HeBeKoMaMiSmKo2016-self,\n  title = {{Metrics and Benchmarks for Self-Aware Computing Systems}},\n  editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n  author = {Nikolas Herbst and Steffen Becker and Heiko Koziolek and Martina Maggio and Aleksandar Milenkoski and Evgenia Smirni and Samuel Kounev},\n  booktitle = {{Self-Aware Computing Systems}},\n  publisher = {{Springer Verlag}},\n  address = {{Berlin Heidelberg, Germany}},\n  year = {2016},\n  note = {{To Appear}}\n}\n
\n\n',NULL,'{Metrics and Benchmarks for Self-Aware Computing Systems}',0,0,2016,0,NULL,NULL,NULL,'2016-05-09 09:46:29','2016-06-01 09:41:09',0),(1110,'paper','MiJaKo2016-self','incollection','@incollection{MiJaKo2016-self,\n title = {{Intrusion Detection Systems and Adaptive Provisioning of Virtualized Resources}},\n editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n author = {Aleksandar Milenkoski and K. R. Jayaram and Samuel Kounev},\n booktitle = {{Self-Aware Computing Systems}},\n publisher = {{Springer Verlag}},\n address = {{Berlin Heidelberg, Germany}},\n year = {2016},\n note = {{To Appear}},\n}\n\n','\n\nAleksandar Milenkoski, K. R. Jayaram, and Samuel Kounev.\nIntrusion Detection Systems and Adaptive Provisioning of Virtualized\nResources.\nIn Self-Aware Computing Systems, Samuel Kounev, Jeffrey O.\nKephart, Xiaoyun Zhu, and Aleksandar Milenkoski, editors. Springer Verlag,\nBerlin Heidelberg, Germany, 2016.\nTo Appear.\n[ bib  ] 
\n@incollection{MiJaKo2016-self,\ntitle = {{Intrusion Detection Systems and Adaptive Provisioning of Virtualized Resources}},\neditor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\nauthor = {Aleksandar Milenkoski and K. R. Jayaram and Samuel Kounev},\nbooktitle = {{Self-Aware Computing Systems}},\npublisher = {{Springer Verlag}},\naddress = {{Berlin Heidelberg, Germany}},\nyear = {2016},\nnote = {{To Appear}}\n}\n
\n
\n','
\n@incollection{MiJaKo2016-self,\n  title = {{Intrusion Detection Systems and Adaptive Provisioning of Virtualized Resources}},\n  editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n  author = {Aleksandar Milenkoski and K. R. Jayaram and Samuel Kounev},\n  booktitle = {{Self-Aware Computing Systems}},\n  publisher = {{Springer Verlag}},\n  address = {{Berlin Heidelberg, Germany}},\n  year = {2016},\n  note = {{To Appear}}\n}\n
\n\n',NULL,'{Intrusion Detection Systems and Adaptive Provisioning of Virtualized Resources}',0,0,2016,0,NULL,NULL,NULL,'2016-05-09 09:47:36','2016-06-01 09:41:09',0),(1111,'paper','HeAmAnGrMeSuKo2016-self','incollection','@incollection{HeAmAnGrMeSuKo2016-self,\n title = {{Online Workload Forecasting}},\n editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n author = {Nikolas Herbst and Ayman Amin and Artur Andrzejak and Lars Grunske and Ole J. Mengshoel and Priya Sundararajan and Samuel Kounev},\n booktitle = {{Self-Aware Computing Systems}},\n publisher = {{Springer Verlag}},\n address = {{Berlin Heidelberg, Germany}},\n year = {2016},\n note = {{To Appear}},\n}\n\n','\n\nNikolas Herbst, Ayman Amin, Artur Andrzejak, Lars Grunske, Ole J. Mengshoel,\nPriya Sundararajan, and Samuel Kounev.\nOnline Workload Forecasting.\nIn Self-Aware Computing Systems, Samuel Kounev, Jeffrey O.\nKephart, Xiaoyun Zhu, and Aleksandar Milenkoski, editors. Springer Verlag,\nBerlin Heidelberg, Germany, 2016.\nTo Appear.\n[ bib  ] 
\n@incollection{HeAmAnGrMeSuKo2016-self,\ntitle = {{Online Workload Forecasting}},\neditor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\nauthor = {Nikolas Herbst and Ayman Amin and Artur Andrzejak and Lars Grunske and Ole J. Mengshoel and Priya Sundararajan and Samuel Kounev},\nbooktitle = {{Self-Aware Computing Systems}},\npublisher = {{Springer Verlag}},\naddress = {{Berlin Heidelberg, Germany}},\nyear = {2016},\nnote = {{To Appear}}\n}\n
\n
\n','
\n@incollection{HeAmAnGrMeSuKo2016-self,\n  title = {{Online Workload Forecasting}},\n  editor = {Samuel Kounev and Jeffrey O. Kephart and Xiaoyun Zhu and Aleksandar Milenkoski},\n  author = {Nikolas Herbst and Ayman Amin and Artur Andrzejak and Lars Grunske and Ole J. Mengshoel and Priya Sundararajan and Samuel Kounev},\n  booktitle = {{Self-Aware Computing Systems}},\n  publisher = {{Springer Verlag}},\n  address = {{Berlin Heidelberg, Germany}},\n  year = {2016},\n  note = {{To Appear}}\n}\n
\n\n',NULL,'{Online Workload Forecasting}',0,0,2016,0,NULL,NULL,NULL,'2016-05-10 13:48:15','2016-06-01 09:41:09',0),(1112,'talk','talk-Kounev-InvPrague16','misc','@misc{talk-Kounev-InvPrague16,\n author = {Samuel Kounev},\n title = {{Benchmarking Dependability of Virtual and Cloud Environments}},\n howpublished = {Invited Talk, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic},\n days = {4},\n month = {May},\n year = {2016},\n slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1112},\n}\n\n','\n\nSamuel Kounev.\nBenchmarking Dependability of Virtual and Cloud Environments.\nInvited Talk, Faculty of Mathematics and Physics, Charles University,\nPrague, Czech Republic, May 2016.\n[ bib | slides  ] 
\n@misc{talk-Kounev-InvPrague16,\nauthor = {Samuel Kounev},\ntitle = {{Benchmarking Dependability of Virtual and Cloud Environments}},\nhowpublished = {Invited Talk, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic},\ndays = {4},\nmonth = {May},\nyear = {2016},\nslides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1112}\n}\n
\n
\n','
\n@misc{talk-Kounev-InvPrague16,\n  author = {Samuel Kounev},\n  title = {{Benchmarking Dependability of Virtual and Cloud Environments}},\n  howpublished = {Invited Talk, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic},\n  days = {4},\n  month = {May},\n  year = {2016},\n  slides = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/slides/1112}\n}\n
\n\n',NULL,'{Benchmarking Dependability of Virtual and Cloud Environments}',0,5,2016,5,NULL,NULL,NULL,'2016-05-16 19:35:13','2016-06-01 09:41:09',0),(1113,'paper','pressDetektorFM2016','misc','@misc{pressDetektorFM2016,\n author = {DetektorFM - Forschungsquartett},\n title = {{Heizen mit der Cloud}},\n location = {{Leipzig}},\n year = {2016},\n month = {April},\n day = {24},\n url = {http://detektor.fm/wissen/forschungsquartett-stromsparende-rechenzentren},\n}\n\n','\n\nDetektorFM Forschungsquartett.\nHeizen mit der Cloud, April 2016.\n[ bib | http  ] 
\n@misc{pressDetektorFM2016,\nauthor = {DetektorFM - Forschungsquartett},\ntitle = {{Heizen mit der Cloud}},\nlocation = {{Leipzig}},\nyear = {2016},\nmonth = {April},\nday = {24},\nurl = {http://detektor.fm/wissen/forschungsquartett-stromsparende-rechenzentren}\n}\n
\n
\n','
\n@misc{pressDetektorFM2016,\n  author = {DetektorFM - Forschungsquartett},\n  title = {{Heizen mit der Cloud}},\n  location = {{Leipzig}},\n  year = {2016},\n  month = {April},\n  day = {24},\n  url = {http://detektor.fm/wissen/forschungsquartett-stromsparende-rechenzentren}\n}\n
\n\n',NULL,'{Heizen mit der Cloud}',0,4,2016,4,NULL,NULL,NULL,'2016-05-24 07:03:11','2016-06-01 09:41:09',0),(1114,'paper','pressUniserve2015','misc','@misc{pressUniserve2015,\n author = {Uniserv},\n title = {{Uniserv, Experte f\\\"{u}r Datenmanagement-Software, stiftet Forschungspreis am KIT}},\n location = {{Pforzheim}},\n year = {2015},\n month = {July},\n day = {21},\n url = {http://www.uniserv.com/unternehmen/blog/detail/article/uniserv-experte-fuer-datenmanagement-software-stiftet-forschungspreis-am-kit/},\n}\n\n','\n\nUniserv.\nUniserv, Experte für Datenmanagement-Software, stiftet\nForschungspreis am KIT, July 2015.\n[ bib | http  ] 
\n@misc{pressUniserve2015,\nauthor = {Uniserv},\ntitle = {{Uniserv, Experte f\\\"{u}r Datenmanagement-Software, stiftet Forschungspreis am KIT}},\nlocation = {{Pforzheim}},\nyear = {2015},\nmonth = {July},\nday = {21},\nurl = {http://www.uniserv.com/unternehmen/blog/detail/article/uniserv-experte-fuer-datenmanagement-software-stiftet-forschungspreis-am-kit/}\n}\n
\n
\n','
\n@misc{pressUniserve2015,\n  author = {Uniserv},\n  title = {{Uniserv, Experte f\\\"{u}r Datenmanagement-Software, stiftet Forschungspreis am KIT}},\n  location = {{Pforzheim}},\n  year = {2015},\n  month = {July},\n  day = {21},\n  url = {http://www.uniserv.com/unternehmen/blog/detail/article/uniserv-experte-fuer-datenmanagement-software-stiftet-forschungspreis-am-kit/}\n}\n
\n\n',NULL,'{Uniserv, Experte f\\\"{u}r Datenmanagement-Software, stiftet Forschungspreis am KIT}',0,7,2015,7,NULL,NULL,NULL,'2016-05-25 07:50:45','2016-06-01 09:41:09',0),(1115,'paper','pressIBMFellowshipAward2014','misc','@misc{pressIBMFellowshipAward2014,\n author = {einBLICK},\n title = {{IBM-Preis f\\\"{u}r herausragenden Doktoranden}},\n location = {W\\\"{u}rzburg},\n year = {2014},\n month = {May},\n day = {13},\n url = {http://www.presse.uni-wuerzburg.de/fileadmin/uniwue/Presse/EinBLICK/2014/PDFs/ar201419-2.pdf},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1115.pdf},\n}\n\n','\n\neinBLICK.\nIBM-Preis für herausragenden Doktoranden, May 2014.\n[ bib | .pdf | .pdf  ] 
\n@misc{pressIBMFellowshipAward2014,\nauthor = {einBLICK},\ntitle = {{IBM-Preis f\\\"{u}r herausragenden Doktoranden}},\nlocation = {W\\\"{u}rzburg},\nyear = {2014},\nmonth = {May},\nday = {13},\nurl = {http://www.presse.uni-wuerzburg.de/fileadmin/uniwue/Presse/EinBLICK/2014/PDFs/ar201419-2.pdf},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1115.pdf}\n}\n
\n
\n','
\n@misc{pressIBMFellowshipAward2014,\n  author = {einBLICK},\n  title = {{IBM-Preis f\\\"{u}r herausragenden Doktoranden}},\n  location = {W\\\"{u}rzburg},\n  year = {2014},\n  month = {May},\n  day = {13},\n  url = {http://www.presse.uni-wuerzburg.de/fileadmin/uniwue/Presse/EinBLICK/2014/PDFs/ar201419-2.pdf},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/publications/download/paper/1115.pdf}\n}\n
\n\n',NULL,'{IBM-Preis f\\\"{u}r herausragenden Doktoranden}',0,5,2014,5,NULL,NULL,NULL,'2016-05-25 07:56:48','2016-06-01 09:41:10',0),(1116,'paper','pressEinblickAntrittsvorlesung2014','misc','@misc{pressEinblickAntrittsvorlesung2014,\n author = {einBLICK},\n title = {{Der Traum vom selbst-bewussten Computer}},\n location = {W\\\"{u}rzburg},\n year = {2014},\n month = {May},\n day = {13},\n url = {http://www.presse.uni-wuerzburg.de/fileadmin/uniwue/Presse/EinBLICK/2014/PDFs/ar201419-2.pdf},\n pdf = {http://se2.informatik.uni-wuerzburg.de/pa/uploads/papers/paper-1115.pdf},\n}\n\n','\n\neinBLICK.\nDer Traum vom selbst-bewussten Computer, May 2014.\n[ bib | .pdf | .pdf  ] 
\n@misc{pressEinblickAntrittsvorlesung2014,\nauthor = {einBLICK},\ntitle = {{Der Traum vom selbst-bewussten Computer}},\nlocation = {W\\\"{u}rzburg},\nyear = {2014},\nmonth = {May},\nday = {13},\nurl = {http://www.presse.uni-wuerzburg.de/fileadmin/uniwue/Presse/EinBLICK/2014/PDFs/ar201419-2.pdf},\npdf = {http://se2.informatik.uni-wuerzburg.de/pa/uploads/papers/paper-1115.pdf}\n}\n
\n
\n','
\n@misc{pressEinblickAntrittsvorlesung2014,\n  author = {einBLICK},\n  title = {{Der Traum vom selbst-bewussten Computer}},\n  location = {W\\\"{u}rzburg},\n  year = {2014},\n  month = {May},\n  day = {13},\n  url = {http://www.presse.uni-wuerzburg.de/fileadmin/uniwue/Presse/EinBLICK/2014/PDFs/ar201419-2.pdf},\n  pdf = {http://se2.informatik.uni-wuerzburg.de/pa/uploads/papers/paper-1115.pdf}\n}\n
\n\n',NULL,'{Der Traum vom selbst-bewussten Computer}',0,5,2014,5,NULL,NULL,NULL,'2016-05-25 08:17:14','2016-06-01 09:41:10',0),(1117,'paper','pressRZ2014','misc','@misc{pressRZ2014,\n author = {Rechenzentrum Universit\\\"{a}t W\\\"{u}rzbug (Tscherner)},\n title = {{Dreharbeiten des bayerischen Rundfunks in den Maschinenr\\\"{a}umen des RZs}},\n location = {W\\\"{u}rzburg},\n year = {2016},\n month = {March},\n day = {9},\n url = {https://www.rz.uni-wuerzburg.de/aktuelles/mitteilungen/single/artikel/dreharbeiten-des-bayerischen-rundfunks-in-den-maschinenraeumen-des-rzs/},\n}\n\n','\n\nRechenzentrum Universität Würzbug (Tscherner).\nDreharbeiten des bayerischen Rundfunks in den Maschinenräumen\ndes RZs, March 2016.\n[ bib | http  ] 
\n@misc{pressRZ2014,\nauthor = {Rechenzentrum Universit\\\"{a}t W\\\"{u}rzbug (Tscherner)},\ntitle = {{Dreharbeiten des bayerischen Rundfunks in den Maschinenr\\\"{a}umen des RZs}},\nlocation = {W\\\"{u}rzburg},\nyear = {2016},\nmonth = {March},\nday = {9},\nurl = {https://www.rz.uni-wuerzburg.de/aktuelles/mitteilungen/single/artikel/dreharbeiten-des-bayerischen-rundfunks-in-den-maschinenraeumen-des-rzs/}\n}\n
\n
\n','
\n@misc{pressRZ2014,\n  author = {Rechenzentrum Universit\\\"{a}t W\\\"{u}rzbug (Tscherner)},\n  title = {{Dreharbeiten des bayerischen Rundfunks in den Maschinenr\\\"{a}umen des RZs}},\n  location = {W\\\"{u}rzburg},\n  year = {2016},\n  month = {March},\n  day = {9},\n  url = {https://www.rz.uni-wuerzburg.de/aktuelles/mitteilungen/single/artikel/dreharbeiten-des-bayerischen-rundfunks-in-den-maschinenraeumen-des-rzs/}\n}\n
\n\n',NULL,'{Dreharbeiten des bayerischen Rundfunks in den Maschinenr\\\"{a}umen des RZs}',0,3,2016,3,NULL,NULL,NULL,'2016-05-25 08:25:16','2016-06-01 09:41:10',0); -/*!40000 ALTER TABLE `Entry` ENABLE KEYS */; --- UNLOCK TABLES; - --- --- Table structure for table `Entry_to_Author` --- - -DROP TABLE IF EXISTS `Entry_to_Author`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `Entry_to_Author` ( - `entry_id` int(11) NOT NULL, - `author_id` int(11) NOT NULL, - PRIMARY KEY (`entry_id`,`author_id`), - KEY `idx_e2a_entry` (`entry_id`), - KEY `idx_e2a_author` (`author_id`), - CONSTRAINT `Entry_to_Author_ibfk_1` FOREIGN KEY (`entry_id`) REFERENCES `Entry` (`id`) ON DELETE CASCADE ON UPDATE CASCADE, - CONSTRAINT `Entry_to_Author_ibfk_2` FOREIGN KEY (`author_id`) REFERENCES `Author` (`master_id`) ON DELETE CASCADE ON UPDATE CASCADE -) ENGINE=InnoDB DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - --- --- Dumping data for table `Entry_to_Author` --- - --- LOCK TABLES `Entry_to_Author` WRITE; -/*!40000 ALTER TABLE `Entry_to_Author` DISABLE KEYS */; -INSERT INTO `Entry_to_Author` VALUES (1,83),(1,84),(1,85),(1,86),(61,218),(65,244),(65,245),(65,246),(65,247),(65,248),(65,249),(65,250),(65,251),(65,252),(65,253),(65,254),(65,255),(76,87),(76,133),(76,166),(76,276),(76,279),(76,280),(76,1107),(76,1141),(76,1188),(76,1189),(81,245),(82,245),(83,84),(83,245),(83,283),(84,84),(84,245),(84,283),(85,84),(85,133),(85,245),(86,84),(86,245),(86,284),(101,279),(101,296),(101,297),(101,298),(101,299),(101,300),(103,1091),(103,1097),(103,1143),(125,327),(126,327),(126,1091),(133,245),(133,327),(133,339),(137,84),(137,245),(137,351),(137,352),(137,353),(163,87),(163,279),(163,378),(171,279),(171,381),(171,1091),(171,1125),(171,1141),(179,383),(179,1091),(179,1097),(179,1188),(186,84),(186,88),(186,90),(186,205),(186,389),(186,390),(186,391),(186,1141),(187,166),(187,205),(187,283),(187,1141),(188,166),(188,205),(188,283),(188,1141),(201,1121),(202,1121),(203,84),(203,283),(203,400),(203,1121),(208,84),(208,283),(208,400),(208,1121),(209,84),(209,1121),(209,1141),(210,84),(210,1121),(210,1137),(211,84),(211,1121),(211,1137),(212,84),(212,87),(212,402),(212,1121),(219,283),(220,279),(220,283),(220,418),(220,1125),(220,1141),(221,84),(221,245),(221,283),(221,419),(221,420),(222,84),(222,245),(222,283),(223,84),(223,245),(223,283),(224,84),(224,245),(224,283),(224,421),(224,1109),(225,84),(225,205),(225,245),(225,283),(225,422),(226,84),(226,245),(226,283),(226,422),(227,84),(227,205),(227,283),(227,422),(231,84),(231,428),(231,429),(243,443),(243,444),(243,445),(243,446),(243,447),(243,448),(243,449),(261,186),(261,276),(261,279),(261,312),(273,84),(273,186),(273,279),(278,84),(279,84),(280,84),(281,84),(282,84),(283,84),(284,84),(285,84),(286,84),(287,84),(288,84),(289,84),(290,84),(291,84),(292,84),(293,84),(294,84),(294,218),(294,245),(294,283),(294,463),(295,84),(295,245),(295,283),(296,84),(296,245),(296,283),(297,84),(297,245),(297,283),(297,1141),(298,84),(298,429),(299,84),(299,429),(300,84),(300,429),(301,84),(301,429),(302,84),(302,429),(303,84),(303,429),(304,84),(304,464),(305,84),(305,464),(306,84),(306,429),(306,464),(307,83),(307,84),(307,245),(307,283),(308,84),(308,465),(309,84),(309,352),(309,466),(310,84),(310,352),(310,466),(311,84),(311,186),(311,279),(312,84),(312,245),(312,467),(312,469),(312,470),(312,471),(312,472),(312,598),(313,84),(313,137),(313,416),(313,458),(313,473),(313,474),(313,475),(313,476),(315,84),(315,383),(316,84),(316,383),(316,429),(316,477),(317,83),(317,84),(317,1115),(318,83),(318,84),(318,478),(319,83),(319,84),(319,478),(320,84),(320,429),(320,479),(329,482),(329,1109),(329,1141),(367,1143),(368,1143),(369,492),(369,1143),(370,84),(370,1085),(370,1143),(371,84),(371,1085),(371,1143),(372,84),(372,493),(372,1143),(390,166),(390,1121),(390,1137),(390,1141),(405,503),(405,1143),(406,84),(406,504),(406,505),(406,506),(406,507),(417,176),(417,482),(417,485),(417,508),(417,509),(417,510),(417,1141),(420,478),(421,84),(421,478),(421,1127),(432,84),(432,383),(432,526),(432,527),(432,528),(432,529),(432,530),(432,1389),(433,84),(433,117),(433,531),(433,532),(433,1389),(434,84),(434,1389),(435,84),(435,531),(435,532),(435,533),(435,1389),(436,138),(436,534),(440,1085),(440,1143),(442,279),(442,513),(442,516),(442,1085),(443,279),(443,1085),(444,279),(444,516),(444,1085),(445,279),(445,516),(445,1085),(447,84),(447,539),(447,540),(449,84),(449,482),(449,543),(449,1141),(450,84),(450,176),(450,482),(450,544),(450,1141),(451,84),(451,176),(451,482),(451,485),(451,543),(451,545),(451,1141),(452,84),(452,482),(452,485),(452,546),(452,1141),(453,84),(453,482),(453,545),(453,1141),(454,84),(454,176),(454,482),(454,1141),(455,84),(455,482),(455,1141),(456,482),(457,482),(457,1141),(457,1189),(458,84),(458,352),(459,84),(459,352),(459,466),(459,547),(460,84),(460,352),(460,466),(481,84),(481,554),(481,555),(481,556),(487,279),(488,279),(489,279),(490,133),(490,279),(490,562),(490,1141),(491,84),(491,279),(491,563),(492,87),(492,279),(493,87),(493,279),(494,87),(494,279),(495,87),(495,279),(496,87),(496,279),(496,1141),(497,186),(497,279),(498,84),(498,186),(498,276),(498,279),(499,186),(499,279),(499,564),(500,84),(500,186),(500,279),(500,563),(501,84),(501,186),(501,279),(501,383),(502,84),(502,279),(503,84),(503,279),(504,84),(504,279),(504,563),(508,176),(508,482),(508,1099),(508,1141),(510,176),(510,482),(510,567),(510,1099),(510,1141),(559,84),(559,527),(560,84),(560,137),(560,527),(563,383),(564,84),(564,383),(564,429),(564,583),(565,84),(565,383),(566,84),(566,383),(567,84),(567,383),(568,84),(568,383),(568,429),(568,583),(569,84),(569,383),(569,429),(569,583),(570,84),(570,383),(570,429),(570,477),(571,84),(571,383),(571,429),(571,477),(572,84),(572,383),(572,429),(573,84),(573,383),(573,429),(573,584),(579,84),(579,504),(579,505),(579,506),(579,507),(580,279),(580,585),(580,586),(580,587),(584,591),(585,591),(586,591),(587,591),(588,591),(589,83),(590,83),(590,84),(590,478),(596,279),(596,298),(596,300),(596,593),(596,594),(596,595),(596,596),(597,84),(597,245),(597,283),(597,597),(597,598),(597,1151),(606,84),(606,261),(606,482),(606,1141),(615,84),(615,383),(615,532),(615,604),(629,393),(629,1091),(629,1097),(629,1143),(639,84),(639,189),(639,301),(639,620),(640,84),(640,156),(640,383),(641,84),(641,137),(641,383),(642,84),(642,621),(646,84),(646,1085),(646,1143),(649,84),(649,245),(649,283),(651,84),(651,245),(651,283),(651,628),(663,84),(663,245),(663,283),(663,421),(663,1109),(664,527),(664,640),(665,527),(665,640),(666,527),(666,640),(666,641),(667,527),(667,640),(667,641),(668,527),(668,640),(668,641),(669,527),(669,640),(669,641),(670,527),(670,640),(670,641),(671,527),(671,640),(671,641),(672,527),(672,640),(672,641),(672,642),(673,527),(673,643),(674,527),(674,640),(674,641),(675,527),(675,640),(675,641),(676,527),(676,640),(676,641),(677,527),(677,640),(678,527),(678,644),(679,527),(679,641),(680,527),(680,640),(681,527),(681,640),(681,641),(682,527),(682,640),(682,641),(682,642),(683,527),(684,84),(684,383),(684,527),(685,84),(685,383),(685,527),(686,84),(686,137),(686,527),(688,1143),(688,1204),(689,84),(689,646),(690,628),(691,1115),(697,84),(697,245),(697,628),(702,84),(702,245),(702,628),(703,83),(703,84),(703,85),(703,651),(705,84),(705,527),(706,652),(706,1121),(706,1143),(707,83),(707,84),(707,653),(707,1143),(708,503),(708,1143),(709,84),(709,383),(709,527),(710,1148),(710,1149),(710,1151),(711,1148),(711,1149),(711,1151),(712,470),(714,470),(714,485),(714,1152),(714,1153),(714,1154),(714,1155),(714,1156),(715,470),(715,485),(716,470),(716,485),(716,1152),(717,84),(717,383),(718,1157),(718,1158),(720,1159),(721,464),(722,1160),(722,1161),(723,1162),(723,1163),(724,1164),(724,1165),(724,1166),(725,1162),(725,1167),(726,1162),(726,1167),(726,1168),(727,1162),(727,1167),(727,1168),(728,1162),(728,1167),(728,1168),(729,1162),(730,1162),(738,654),(738,655),(738,1181),(739,655),(739,1183),(740,654),(740,655),(740,1183),(741,655),(741,1184),(742,654),(742,655),(742,1183),(743,654),(743,655),(744,654),(744,655),(745,84),(745,482),(745,546),(745,1141),(746,83),(746,84),(746,85),(746,86),(746,1201),(746,1202),(746,1203),(747,84),(748,1137),(749,1137),(750,84),(750,531),(750,532),(750,533),(750,1389),(751,84),(751,503),(751,1143),(752,503),(752,1143),(754,84),(754,245),(754,478),(754,1109),(754,1125),(754,1127),(755,1143),(755,1204),(756,1143),(756,1204),(757,1143),(757,1204),(758,84),(758,531),(758,532),(758,533),(758,1389),(759,283),(760,654),(761,654),(761,1209),(762,654),(762,1210),(763,654),(764,654),(765,654),(766,654),(766,655),(767,654),(768,245),(769,84),(769,527),(770,402),(771,84),(771,1121),(771,1137),(772,84),(772,1137),(772,1211),(772,1212),(772,1213),(772,1214),(773,1137),(773,1213),(773,1214),(773,1215),(773,1216),(773,1217),(774,655),(774,1222),(774,1223),(774,1224),(774,1225),(774,1226),(774,1227),(775,84),(776,84),(776,245),(776,283),(777,527),(777,1232),(778,84),(778,400),(778,482),(778,543),(778,1109),(778,1141),(779,176),(779,482),(779,567),(779,1099),(779,1141),(780,84),(780,1121),(780,1137),(780,1233),(780,1234),(781,84),(781,383),(781,527),(782,84),(782,87),(782,402),(782,1121),(783,1235),(784,84),(785,527),(786,1237),(787,1236),(788,1238),(789,84),(789,527),(789,1240),(790,84),(791,83),(791,84),(791,85),(791,86),(791,1121),(791,1201),(791,1203),(792,83),(792,84),(792,1115),(793,84),(793,531),(793,532),(793,1241),(793,1389),(798,1236),(799,1258),(802,84),(802,85),(802,1261),(802,1262),(802,1389),(803,84),(803,527),(803,1240),(803,1263),(803,1264),(803,1265),(803,1266),(804,84),(805,84),(806,84),(807,84),(808,84),(809,84),(810,84),(811,84),(812,84),(813,84),(814,84),(815,84),(816,84),(817,84),(818,84),(819,84),(820,84),(821,84),(822,84),(823,84),(824,84),(825,84),(826,84),(827,84),(828,84),(829,84),(830,84),(831,84),(832,84),(833,84),(834,84),(835,84),(836,84),(837,84),(838,84),(839,84),(840,84),(841,84),(842,84),(843,84),(844,84),(845,84),(846,84),(847,84),(848,84),(849,84),(850,84),(851,84),(852,84),(853,84),(854,84),(855,84),(856,84),(857,84),(858,84),(859,84),(860,84),(861,84),(862,84),(864,1235),(865,543),(867,546),(868,545),(870,1236),(871,562),(872,1267),(873,422),(875,218),(876,186),(877,1269),(878,84),(878,1137),(878,1211),(878,1212),(878,1213),(878,1214),(879,84),(879,245),(879,283),(881,83),(881,84),(881,1115),(882,83),(882,1115),(883,654),(883,655),(883,1271),(884,84),(885,84),(886,84),(887,83),(887,84),(887,1273),(887,1274),(887,1275),(887,1276),(888,84),(888,532),(888,533),(888,1277),(888,1389),(889,1278),(890,83),(890,84),(890,245),(890,651),(891,84),(891,283),(891,1115),(891,1280),(892,83),(892,421),(892,493),(892,1109),(892,1115),(892,1121),(892,1137),(892,1274),(892,1276),(892,1281),(892,1282),(892,1283),(892,1284),(892,1285),(892,1286),(892,1287),(893,84),(893,117),(893,531),(893,532),(893,533),(893,1288),(893,1389),(894,1143),(895,482),(896,543),(897,546),(898,545),(899,562),(900,1267),(901,1268),(902,422),(903,1269),(904,186),(905,1115),(905,1238),(905,1258),(906,84),(906,1137),(907,1137),(908,1137),(909,83),(911,84),(911,1137),(911,1211),(911,1212),(911,1213),(911,1301),(912,83),(913,84),(913,527),(913,1297),(913,1298),(913,1299),(913,1300),(914,83),(914,84),(914,1115),(915,84),(915,421),(915,1115),(915,1127),(915,1302),(916,1399),(919,1304),(920,84),(921,84),(922,84),(923,84),(923,421),(923,1115),(923,1302),(924,83),(924,651),(924,1305),(925,1306),(926,84),(926,85),(926,245),(926,283),(927,1307),(928,655),(929,655),(930,655),(930,1222),(930,1309),(931,655),(932,655),(932,1222),(932,1223),(932,1224),(932,1225),(932,1226),(932,1227),(932,1309),(932,1310),(932,1311),(933,655),(934,655),(935,655),(936,655),(937,655),(938,655),(938,1222),(938,1223),(938,1224),(938,1225),(938,1226),(938,1227),(938,1309),(938,1310),(938,1311),(938,1312),(939,655),(939,1222),(939,1223),(939,1224),(939,1225),(939,1226),(939,1227),(939,1309),(939,1310),(939,1311),(939,1312),(940,655),(940,1222),(940,1223),(940,1224),(940,1225),(940,1226),(940,1227),(940,1309),(940,1310),(940,1311),(940,1312),(941,655),(941,1313),(941,1314),(942,655),(942,1222),(942,1223),(942,1224),(942,1225),(942,1226),(942,1227),(942,1309),(942,1310),(942,1311),(942,1312),(943,655),(944,655),(944,1313),(944,1314),(945,655),(945,1315),(946,655),(947,655),(948,655),(948,1316),(949,655),(950,655),(950,1316),(951,655),(951,1317),(952,655),(952,1227),(953,655),(953,1227),(954,655),(955,655),(955,1222),(955,1318),(956,655),(957,655),(957,1222),(958,655),(959,655),(960,655),(960,1222),(960,1318),(961,655),(962,655),(963,655),(964,655),(965,655),(966,655),(967,655),(967,1319),(968,655),(968,1222),(968,1227),(969,655),(970,655),(970,1224),(970,1227),(971,655),(971,1319),(971,1320),(971,1321),(971,1322),(971,1323),(972,655),(973,655),(973,1324),(973,1325),(974,655),(974,1319),(975,655),(976,655),(977,655),(978,655),(979,655),(979,1224),(979,1227),(980,655),(980,1326),(981,655),(981,1222),(981,1227),(982,655),(983,655),(984,655),(984,1326),(985,655),(986,655),(987,655),(988,655),(989,655),(990,655),(991,655),(991,1327),(991,1328),(992,655),(993,655),(993,1326),(994,655),(994,1314),(995,655),(995,1314),(996,655),(996,1314),(997,655),(997,1314),(998,655),(998,1314),(999,655),(999,1314),(1000,655),(1000,1314),(1001,655),(1001,1327),(1002,655),(1002,1327),(1003,655),(1003,1327),(1004,655),(1004,1329),(1004,1330),(1004,1331),(1004,1332),(1005,655),(1005,1333),(1006,655),(1006,1334),(1006,1335),(1007,655),(1007,1334),(1007,1335),(1008,655),(1008,1333),(1009,655),(1010,655),(1010,1327),(1011,655),(1011,1336),(1012,655),(1012,1333),(1013,655),(1014,655),(1015,655),(1015,1336),(1015,1337),(1016,655),(1016,1338),(1017,655),(1017,1336),(1018,655),(1018,1327),(1018,1337),(1019,655),(1019,1336),(1020,655),(1020,1310),(1020,1327),(1020,1337),(1020,1339),(1021,655),(1022,655),(1022,1310),(1022,1327),(1022,1337),(1022,1339),(1023,655),(1023,1310),(1024,655),(1024,1314),(1025,655),(1026,655),(1027,655),(1027,1340),(1027,1341),(1028,655),(1028,1223),(1028,1224),(1028,1342),(1029,655),(1029,1310),(1030,655),(1030,1223),(1030,1224),(1030,1342),(1031,655),(1031,1222),(1031,1342),(1031,1343),(1032,655),(1032,1227),(1033,655),(1033,1344),(1034,655),(1034,1222),(1034,1342),(1034,1343),(1035,655),(1036,655),(1037,655),(1038,655),(1038,1227),(1039,655),(1039,1224),(1040,655),(1041,655),(1042,655),(1042,1224),(1042,1227),(1043,655),(1043,1319),(1044,655),(1044,1224),(1044,1227),(1045,655),(1046,655),(1046,1345),(1047,655),(1047,1224),(1047,1227),(1048,655),(1048,1222),(1048,1223),(1048,1224),(1048,1225),(1048,1226),(1048,1227),(1048,1310),(1048,1312),(1048,1346),(1048,1347),(1048,1348),(1049,655),(1050,655),(1051,655),(1051,1222),(1051,1223),(1051,1224),(1051,1225),(1051,1226),(1051,1227),(1052,655),(1052,1349),(1053,655),(1053,1350),(1053,1351),(1054,655),(1054,1336),(1055,655),(1055,1349),(1056,655),(1056,1349),(1057,655),(1057,1349),(1057,1350),(1057,1351),(1058,655),(1058,1336),(1059,655),(1059,1336),(1060,655),(1060,1336),(1060,1349),(1060,1352),(1061,655),(1062,655),(1062,1349),(1062,1351),(1062,1353),(1063,655),(1063,1336),(1064,655),(1064,1333),(1065,655),(1065,1349),(1066,655),(1066,1349),(1067,655),(1068,655),(1068,1336),(1068,1354),(1068,1355),(1069,655),(1069,1349),(1069,1356),(1070,655),(1070,1336),(1070,1354),(1070,1355),(1071,655),(1071,1349),(1071,1357),(1072,655),(1072,1349),(1072,1357),(1073,655),(1073,1349),(1073,1357),(1074,83),(1074,186),(1074,245),(1074,493),(1074,1091),(1074,1127),(1074,1359),(1074,1360),(1075,83),(1075,84),(1075,527),(1075,1361),(1077,84),(1077,245),(1077,478),(1077,527),(1077,1109),(1077,1125),(1077,1127),(1080,1400),(1081,1391),(1082,1398),(1083,84),(1083,526),(1083,1121),(1083,1143),(1083,1366),(1083,1367),(1083,1368),(1084,1369),(1085,1370),(1086,84),(1086,421),(1086,527),(1087,1371),(1088,1372),(1088,1373),(1088,1374),(1088,1375),(1088,1376),(1088,1377),(1088,1378),(1088,1389),(1089,1379),(1089,1380),(1089,1381),(1089,1382),(1089,1383),(1089,1384),(1089,1385),(1089,1386),(1089,1389),(1090,1402),(1091,1403),(1092,84),(1097,84),(1097,421),(1097,1115),(1097,1127),(1097,1302),(1098,1361),(1099,83),(1099,84),(1099,85),(1099,86),(1099,1121),(1099,1201),(1099,1203),(1100,83),(1100,84),(1100,85),(1100,86),(1100,1201),(1100,1202),(1100,1203),(1100,1405),(1101,1406),(1103,84),(1103,245),(1103,478),(1103,527),(1103,1109),(1103,1125),(1103,1127),(1104,84),(1104,400),(1104,482),(1104,543),(1104,1109),(1104,1141),(1105,84),(1105,383),(1105,526),(1105,527),(1105,530),(1105,1389),(1105,1408),(1105,1409),(1105,1410),(1106,84),(1106,85),(1106,1261),(1106,1389),(1107,84),(1107,85),(1107,1261),(1107,1389),(1108,84),(1108,1389),(1108,1414),(1109,84),(1109,1121),(1109,1125),(1109,1127),(1109,1389),(1109,1415),(1109,1416),(1110,84),(1110,1389),(1110,1414),(1111,84),(1111,1121),(1111,1417),(1111,1418),(1111,1419),(1111,1420),(1111,1421),(1112,84),(1113,1422),(1114,1423),(1115,1424),(1116,1424),(1117,1426); -/*!40000 ALTER TABLE `Entry_to_Author` ENABLE KEYS */; --- UNLOCK TABLES; - --- --- Table structure for table `Entry_to_Tag` --- - -DROP TABLE IF EXISTS `Entry_to_Tag`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `Entry_to_Tag` ( - `entry_id` int(8) NOT NULL, - `tag_id` int(8) NOT NULL, - PRIMARY KEY (`entry_id`,`tag_id`), - KEY `tag_id` (`tag_id`), - CONSTRAINT `Entry_to_Tag_ibfk_1` FOREIGN KEY (`entry_id`) REFERENCES `Entry` (`id`) ON DELETE CASCADE ON UPDATE CASCADE, - CONSTRAINT `Entry_to_Tag_ibfk_2` FOREIGN KEY (`tag_id`) REFERENCES `Tag` (`id`) ON DELETE CASCADE ON UPDATE CASCADE -) ENGINE=InnoDB DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - --- --- Dumping data for table `Entry_to_Tag` --- - --- LOCK TABLES `Entry_to_Tag` WRITE; -/*!40000 ALTER TABLE `Entry_to_Tag` DISABLE KEYS */; -INSERT INTO `Entry_to_Tag` VALUES (311,4),(481,4),(559,4),(560,4),(665,4),(667,4),(668,4),(671,4),(672,4),(673,4),(674,4),(675,4),(680,4),(681,4),(682,4),(683,4),(686,4),(705,4),(769,4),(789,4),(803,4),(913,4),(1087,4),(1,6),(187,6),(188,6),(202,6),(222,6),(223,6),(225,6),(226,6),(227,6),(296,6),(312,6),(313,6),(372,6),(432,6),(433,6),(434,6),(435,6),(449,6),(451,6),(452,6),(453,6),(454,6),(455,6),(559,6),(646,6),(651,6),(678,6),(680,6),(681,6),(689,6),(706,6),(745,6),(746,6),(747,6),(750,6),(758,6),(759,6),(770,6),(782,6),(791,6),(793,6),(888,6),(893,6),(914,6),(925,6),(1088,6),(1089,6),(1105,6),(186,7),(209,7),(278,7),(282,7),(288,7),(307,7),(311,7),(312,7),(319,7),(432,7),(433,7),(481,7),(559,7),(615,7),(642,7),(651,7),(750,7),(758,7),(790,7),(888,7),(890,7),(1111,7),(273,8),(278,8),(282,8),(283,8),(288,8),(294,8),(299,8),(301,8),(304,8),(305,8),(306,8),(307,8),(309,8),(310,8),(311,8),(316,8),(317,8),(318,8),(319,8),(421,8),(450,8),(458,8),(459,8),(460,8),(491,8),(498,8),(500,8),(502,8),(503,8),(504,8),(560,8),(572,8),(590,8),(597,8),(639,8),(640,8),(665,8),(669,8),(670,8),(671,8),(672,8),(686,8),(691,8),(697,8),(705,8),(745,8),(754,8),(769,8),(789,8),(790,8),(792,8),(802,8),(913,8),(926,8),(1077,8),(83,9),(84,9),(85,9),(210,9),(211,9),(222,9),(223,9),(224,9),(273,9),(278,9),(295,9),(307,9),(311,9),(421,9),(491,9),(498,9),(500,9),(501,9),(502,9),(503,9),(504,9),(560,9),(639,9),(640,9),(649,9),(663,9),(686,9),(705,9),(749,9),(754,9),(759,9),(769,9),(771,9),(780,9),(789,9),(798,9),(891,9),(908,9),(913,9),(926,9),(1092,9),(1,10),(81,10),(82,10),(83,10),(84,10),(85,10),(86,10),(137,10),(187,10),(188,10),(203,10),(208,10),(209,10),(210,10),(211,10),(212,10),(219,10),(220,10),(221,10),(222,10),(223,10),(224,10),(225,10),(226,10),(227,10),(231,10),(273,10),(278,10),(279,10),(280,10),(281,10),(282,10),(283,10),(286,10),(287,10),(288,10),(289,10),(290,10),(291,10),(292,10),(294,10),(295,10),(296,10),(297,10),(298,10),(299,10),(300,10),(301,10),(302,10),(303,10),(304,10),(305,10),(306,10),(307,10),(309,10),(310,10),(311,10),(312,10),(315,10),(316,10),(317,10),(318,10),(319,10),(320,10),(370,10),(371,10),(372,10),(406,10),(421,10),(433,10),(435,10),(449,10),(450,10),(451,10),(452,10),(453,10),(454,10),(455,10),(458,10),(459,10),(460,10),(491,10),(498,10),(500,10),(501,10),(502,10),(503,10),(504,10),(559,10),(560,10),(564,10),(565,10),(566,10),(567,10),(568,10),(569,10),(570,10),(571,10),(572,10),(573,10),(579,10),(589,10),(590,10),(597,10),(606,10),(615,10),(639,10),(640,10),(646,10),(649,10),(651,10),(663,10),(668,10),(683,10),(684,10),(685,10),(686,10),(689,10),(690,10),(691,10),(697,10),(702,10),(703,10),(705,10),(706,10),(707,10),(709,10),(717,10),(745,10),(746,10),(747,10),(751,10),(754,10),(759,10),(768,10),(769,10),(770,10),(771,10),(772,10),(773,10),(775,10),(780,10),(789,10),(790,10),(791,10),(792,10),(802,10),(803,10),(878,10),(887,10),(889,10),(890,10),(891,10),(892,10),(905,10),(906,10),(908,10),(911,10),(913,10),(914,10),(915,10),(924,10),(925,10),(926,10),(1075,10),(1077,10),(1092,10),(1,11),(82,11),(83,11),(84,11),(85,11),(86,11),(137,11),(201,11),(203,11),(208,11),(223,11),(225,11),(227,11),(273,11),(278,11),(279,11),(280,11),(281,11),(282,11),(283,11),(286,11),(288,11),(291,11),(292,11),(294,11),(295,11),(296,11),(297,11),(298,11),(299,11),(300,11),(301,11),(304,11),(305,11),(306,11),(307,11),(309,11),(310,11),(311,11),(312,11),(316,11),(317,11),(318,11),(319,11),(406,11),(421,11),(449,11),(450,11),(451,11),(452,11),(453,11),(454,11),(455,11),(458,11),(459,11),(460,11),(491,11),(498,11),(500,11),(501,11),(502,11),(503,11),(504,11),(560,11),(572,11),(579,11),(590,11),(597,11),(606,11),(639,11),(640,11),(649,11),(651,11),(672,11),(674,11),(682,11),(686,11),(689,11),(690,11),(697,11),(702,11),(705,11),(717,11),(745,11),(746,11),(754,11),(768,11),(769,11),(789,11),(790,11),(792,11),(891,11),(925,11),(926,11),(1077,11),(1092,11),(1111,11),(231,12),(297,12),(309,12),(310,12),(313,12),(432,12),(458,12),(459,12),(460,12),(498,12),(503,12),(641,12),(663,12),(664,12),(666,12),(669,12),(670,12),(673,12),(676,12),(677,12),(678,12),(679,12),(680,12),(777,12),(283,15),(284,15),(285,15),(288,15),(294,15),(298,15),(299,15),(301,15),(304,15),(305,15),(306,15),(309,15),(310,15),(316,15),(317,15),(318,15),(319,15),(421,15),(458,15),(459,15),(460,15),(563,15),(572,15),(589,15),(590,15),(691,15),(705,15),(710,15),(711,15),(712,15),(714,15),(715,15),(716,15),(717,15),(718,15),(720,15),(721,15),(722,15),(723,15),(724,15),(725,15),(726,15),(727,15),(728,15),(729,15),(730,15),(754,15),(769,15),(792,15),(133,19),(186,19),(201,19),(202,19),(209,19),(212,19),(221,19),(227,19),(312,19),(313,19),(370,19),(371,19),(372,19),(390,19),(432,19),(433,19),(434,19),(435,19),(559,19),(641,19),(646,19),(678,19),(689,19),(706,19),(707,19),(747,19),(748,19),(749,19),(751,19),(770,19),(775,19),(791,19),(793,19),(802,19),(891,19),(893,19),(1083,19),(1088,19),(1089,19),(1105,19),(283,20),(288,20),(294,20),(298,20),(299,20),(301,20),(304,20),(305,20),(306,20),(309,20),(310,20),(316,20),(317,20),(318,20),(319,20),(421,20),(458,20),(459,20),(460,20),(572,20),(590,20),(691,20),(705,20),(717,20),(745,20),(754,20),(769,20),(789,20),(790,20),(792,20),(799,20),(881,20),(1075,20),(209,21),(212,21),(747,21),(770,21),(775,21),(782,21),(1083,21),(83,22),(222,22),(224,22),(295,22),(649,22),(663,22),(759,22),(768,22),(769,22),(776,22),(788,22),(891,22),(905,22),(914,22),(926,22),(1092,22),(690,23),(697,23),(702,23),(799,23),(915,23),(1097,23),(210,24),(211,24),(212,24),(749,24),(770,24),(771,24),(780,24),(782,24),(908,24),(589,25),(703,25),(882,25),(887,25),(890,25),(914,25),(924,25),(559,28),(803,28),(1087,28),(449,29),(450,29),(451,29),(452,29),(453,29),(455,29),(745,29),(287,30),(288,30),(289,30),(315,30),(320,30),(432,30),(433,30),(564,30),(565,30),(566,30),(567,30),(568,30),(569,30),(570,30),(571,30),(573,30),(584,30),(585,30),(586,30),(587,30),(588,30),(615,30),(639,30),(640,30),(684,30),(685,30),(709,30),(758,30),(772,30),(773,30),(780,30),(781,30),(790,30),(805,30),(878,30),(887,30),(892,30),(907,30),(908,30),(911,30),(1083,30),(1086,30),(82,31),(201,31),(219,31),(227,31),(288,31),(294,31),(300,31),(301,31),(303,31),(316,31),(584,31),(585,31),(586,31),(664,31),(668,31),(749,31),(750,31),(771,31),(790,31),(202,33),(203,33),(208,33),(209,33),(210,33),(211,33),(212,33),(221,33),(223,33),(312,33),(390,33),(433,33),(615,33),(663,33),(689,33),(746,33),(747,33),(748,33),(770,33),(775,33),(780,33),(782,33),(908,33),(1083,33),(273,34),(289,34),(303,34),(311,34),(315,34),(316,34),(406,34),(481,34),(491,34),(500,34),(501,34),(502,34),(503,34),(504,34),(564,34),(565,34),(566,34),(567,34),(568,34),(569,34),(570,34),(571,34),(572,34),(573,34),(579,34),(717,34),(309,35),(310,35),(458,35),(459,35),(460,35),(370,36),(371,36),(434,36),(451,36),(615,36),(646,36),(668,36),(706,36),(707,36),(745,36),(747,36),(750,36),(751,36),(758,36),(775,36),(1083,36),(370,38),(371,38),(372,38),(646,38),(707,38),(747,38),(751,38),(1083,38),(312,41),(639,41),(640,41),(772,41),(773,41),(878,41),(889,41),(906,41),(907,41),(911,41),(925,41),(137,43),(221,43),(279,43),(280,43),(281,43),(296,43),(312,43),(433,43),(435,43),(459,43),(597,43),(615,43),(738,43),(739,43),(740,43),(741,43),(742,43),(743,43),(744,43),(750,43),(758,43),(760,43),(761,43),(762,43),(763,43),(764,43),(765,43),(766,43),(767,43),(793,43),(888,43),(928,43),(929,43),(930,43),(931,43),(932,43),(933,43),(934,43),(935,43),(936,43),(937,43),(938,43),(939,43),(940,43),(941,43),(942,43),(943,43),(944,43),(945,43),(946,43),(947,43),(948,43),(949,43),(950,43),(951,43),(952,43),(953,43),(954,43),(955,43),(956,43),(957,43),(958,43),(959,43),(960,43),(961,43),(962,43),(963,43),(964,43),(965,43),(966,43),(967,43),(968,43),(969,43),(970,43),(971,43),(972,43),(973,43),(974,43),(975,43),(976,43),(977,43),(978,43),(979,43),(980,43),(981,43),(982,43),(983,43),(984,43),(985,43),(986,43),(987,43),(988,43),(989,43),(990,43),(991,43),(992,43),(993,43),(994,43),(995,43),(996,43),(997,43),(998,43),(999,43),(1000,43),(1001,43),(1002,43),(1003,43),(1004,43),(1005,43),(1006,43),(1007,43),(1008,43),(1009,43),(1010,43),(1011,43),(1012,43),(1013,43),(1014,43),(1015,43),(1016,43),(1017,43),(1018,43),(1019,43),(1020,43),(1021,43),(1022,43),(1023,43),(1024,43),(1025,43),(1026,43),(1027,43),(1028,43),(1029,43),(1030,43),(1031,43),(1032,43),(1033,43),(1034,43),(1035,43),(1036,43),(1037,43),(1038,43),(1039,43),(1040,43),(1041,43),(1042,43),(1043,43),(1044,43),(1045,43),(1046,43),(1047,43),(1048,43),(1049,43),(1050,43),(1051,43),(1052,43),(1053,43),(1054,43),(1055,43),(1056,43),(1057,43),(1058,43),(1059,43),(1060,43),(1061,43),(1062,43),(1063,43),(1064,43),(1065,43),(1066,43),(1067,43),(1068,43),(1069,43),(1070,43),(1071,43),(1072,43),(1073,43),(1083,43),(312,44),(433,44),(434,44),(435,44),(615,44),(747,44),(750,44),(758,44),(793,44),(802,44),(888,44),(893,44),(1088,44),(1089,44),(290,47),(294,47),(302,47),(303,47),(449,47),(450,47),(451,47),(452,47),(453,47),(454,47),(455,47),(745,47),(86,49),(201,49),(203,49),(208,49),(211,49),(212,49),(231,49),(283,49),(287,49),(289,49),(299,49),(304,49),(305,49),(306,49),(315,49),(317,49),(318,49),(319,49),(372,49),(435,49),(447,49),(449,49),(564,49),(565,49),(566,49),(567,49),(568,49),(569,49),(570,49),(571,49),(573,49),(590,49),(691,49),(697,49),(703,49),(749,49),(770,49),(771,49),(773,49),(782,49),(906,49),(916,49),(1087,49),(283,51),(288,51),(299,51),(304,51),(305,51),(306,51),(317,51),(318,51),(319,51),(421,51),(590,51),(691,51),(705,51),(745,51),(754,51),(790,51),(792,51),(799,51),(881,51),(1075,51),(133,52),(221,52),(224,52),(231,52),(289,52),(290,52),(302,52),(303,52),(320,52),(406,52),(449,52),(453,52),(504,52),(579,52),(639,52),(640,52),(663,52),(664,52),(665,52),(677,52),(678,52),(689,52),(697,52),(706,52),(803,52),(878,52),(926,52),(1111,52),(273,53),(279,53),(280,53),(281,53),(289,53),(290,53),(293,53),(295,53),(296,53),(297,53),(302,53),(303,53),(308,53),(310,53),(312,53),(313,53),(320,53),(371,53),(447,53),(459,53),(460,53),(481,53),(491,53),(500,53),(502,53),(503,53),(504,53),(663,53),(751,53),(914,53),(926,53),(1074,53),(1105,53),(1106,53),(83,54),(84,54),(85,54),(86,54),(222,54),(224,54),(273,54),(278,54),(279,54),(280,54),(281,54),(282,54),(283,54),(286,54),(288,54),(294,54),(295,54),(296,54),(297,54),(298,54),(299,54),(300,54),(301,54),(304,54),(305,54),(306,54),(307,54),(309,54),(310,54),(311,54),(316,54),(317,54),(318,54),(319,54),(406,54),(421,54),(432,54),(450,54),(454,54),(458,54),(459,54),(460,54),(491,54),(498,54),(500,54),(501,54),(502,54),(503,54),(504,54),(560,54),(572,54),(579,54),(590,54),(597,54),(639,54),(640,54),(649,54),(663,54),(686,54),(697,54),(702,54),(705,54),(717,54),(754,54),(769,54),(790,54),(802,54),(803,54),(891,54),(905,54),(926,54),(1077,54),(1,55),(81,55),(83,55),(84,55),(85,55),(86,55),(137,55),(220,55),(221,55),(273,55),(278,55),(282,55),(283,55),(286,55),(288,55),(291,55),(292,55),(294,55),(295,55),(298,55),(299,55),(300,55),(301,55),(304,55),(305,55),(306,55),(307,55),(309,55),(310,55),(311,55),(312,55),(316,55),(317,55),(318,55),(319,55),(406,55),(421,55),(449,55),(450,55),(451,55),(452,55),(454,55),(458,55),(459,55),(460,55),(491,55),(498,55),(500,55),(501,55),(502,55),(503,55),(504,55),(560,55),(572,55),(579,55),(590,55),(597,55),(606,55),(639,55),(640,55),(649,55),(651,55),(683,55),(686,55),(691,55),(697,55),(702,55),(703,55),(705,55),(706,55),(717,55),(745,55),(746,55),(754,55),(769,55),(789,55),(790,55),(792,55),(799,55),(802,55),(881,55),(890,55),(915,55),(926,55),(1075,55),(1077,55),(1097,55),(1,56),(82,56),(84,56),(85,56),(86,56),(187,56),(188,56),(203,56),(208,56),(210,56),(211,56),(219,56),(220,56),(225,56),(226,56),(227,56),(278,56),(279,56),(280,56),(281,56),(294,56),(296,56),(297,56),(307,56),(449,56),(450,56),(451,56),(452,56),(453,56),(454,56),(455,56),(459,56),(589,56),(606,56),(639,56),(640,56),(651,56),(703,56),(745,56),(746,56),(749,56),(771,56),(780,56),(798,56),(887,56),(890,56),(892,56),(906,56),(908,56),(913,56),(914,56),(915,56),(916,56),(924,56),(187,57),(188,57),(202,57),(209,57),(210,57),(211,57),(212,57),(225,57),(226,57),(227,57),(231,57),(282,57),(287,57),(288,57),(289,57),(290,57),(302,57),(315,57),(320,57),(370,57),(372,57),(390,57),(433,57),(434,57),(435,57),(564,57),(565,57),(566,57),(567,57),(568,57),(569,57),(570,57),(571,57),(573,57),(615,57),(639,57),(640,57),(646,57),(684,57),(685,57),(709,57),(717,57),(747,57),(748,57),(750,57),(758,57),(770,57),(771,57),(772,57),(773,57),(775,57),(780,57),(782,57),(790,57),(802,57),(878,57),(889,57),(893,57),(907,57),(908,57),(911,57),(925,57),(1083,57),(1106,57),(1,58),(82,58),(84,58),(85,58),(86,58),(203,58),(208,58),(210,58),(211,58),(225,58),(226,58),(227,58),(231,58),(278,58),(282,58),(288,58),(291,58),(292,58),(294,58),(300,58),(302,58),(303,58),(307,58),(320,58),(433,58),(435,58),(449,58),(450,58),(451,58),(452,58),(453,58),(454,58),(455,58),(459,58),(566,58),(567,58),(570,58),(571,58),(573,58),(606,58),(639,58),(640,58),(651,58),(684,58),(703,58),(707,58),(709,58),(746,58),(749,58),(750,58),(758,58),(771,58),(772,58),(780,58),(790,58),(791,58),(878,58),(890,58),(892,58),(893,58),(908,58),(911,58),(913,58),(914,58),(1074,58),(1106,58),(84,59),(85,59),(201,59),(203,59),(208,59),(449,59),(450,59),(451,59),(453,59),(455,59),(589,59),(651,59),(703,59),(707,59),(746,59),(887,59),(890,59),(892,59),(924,59),(1,60),(201,60),(203,60),(208,60),(278,60),(279,60),(280,60),(281,60),(296,60),(297,60),(307,60),(639,60),(640,60),(689,60),(791,60),(887,60),(892,60),(926,60),(1111,60),(1,61),(84,61),(85,61),(86,61),(133,61),(137,61),(201,61),(203,61),(208,61),(209,61),(210,61),(211,61),(212,61),(221,61),(222,61),(223,61),(224,61),(225,61),(226,61),(227,61),(278,61),(279,61),(280,61),(281,61),(282,61),(288,61),(291,61),(292,61),(294,61),(295,61),(296,61),(297,61),(307,61),(309,61),(310,61),(312,61),(313,61),(370,61),(371,61),(372,61),(451,61),(452,61),(453,61),(454,61),(455,61),(458,61),(459,61),(460,61),(504,61),(559,61),(560,61),(639,61),(640,61),(646,61),(651,61),(663,61),(668,61),(681,61),(686,61),(689,61),(697,61),(702,61),(703,61),(705,61),(706,61),(707,61),(745,61),(746,61),(751,61),(759,61),(769,61),(771,61),(780,61),(782,61),(789,61),(790,61),(791,61),(798,61),(802,61),(803,61),(891,61),(908,61),(926,61),(1092,61),(1106,61),(1,62),(83,62),(84,62),(85,62),(86,62),(137,62),(203,62),(208,62),(209,62),(221,62),(222,62),(223,62),(224,62),(273,62),(278,62),(279,62),(280,62),(281,62),(282,62),(288,62),(291,62),(292,62),(294,62),(295,62),(296,62),(297,62),(300,62),(301,62),(307,62),(309,62),(310,62),(311,62),(312,62),(313,62),(316,62),(370,62),(371,62),(406,62),(458,62),(459,62),(460,62),(491,62),(498,62),(500,62),(501,62),(502,62),(503,62),(504,62),(559,62),(572,62),(579,62),(606,62),(639,62),(640,62),(646,62),(649,62),(663,62),(689,62),(690,62),(697,62),(702,62),(706,62),(707,62),(717,62),(746,62),(751,62),(759,62),(790,62),(791,62),(891,62),(905,62),(915,62),(926,62),(1092,62),(1097,62),(312,63),(639,63),(640,63),(759,63),(772,63),(773,63),(878,63),(889,63),(906,63),(907,63),(911,63),(925,63),(221,64),(223,64),(224,64),(312,64),(313,64),(663,64),(706,64),(803,64),(203,65),(208,65),(209,65),(221,65),(222,65),(223,65),(224,65),(279,65),(280,65),(281,65),(295,65),(296,65),(297,65),(309,65),(310,65),(312,65),(459,65),(460,65),(663,65),(707,65),(746,65),(759,65),(770,65),(791,65),(891,65),(926,65),(1092,65),(1106,65),(83,66),(203,66),(208,66),(222,66),(224,66),(279,66),(280,66),(281,66),(295,66),(296,66),(297,66),(312,66),(459,66),(649,66),(663,66),(746,66),(776,66),(782,66),(791,66),(891,66),(914,66),(915,66),(926,66),(1092,66),(1106,66),(1111,66),(560,67),(686,67),(705,67),(769,67),(789,67),(913,67),(434,68),(435,68),(750,68),(758,68),(893,68),(749,69),(770,69),(61,70),(82,70),(201,70),(219,70),(420,70),(589,70),(690,70),(691,70),(749,70),(770,70),(783,70),(786,70),(787,70),(788,70),(798,70),(799,70),(889,70),(896,70),(897,70),(898,70),(899,70),(900,70),(901,70),(902,70),(903,70),(919,70),(927,70),(1087,70),(1091,70),(1098,70),(691,71),(783,71),(784,72),(785,72),(804,72),(805,72),(806,72),(807,72),(808,72),(809,72),(810,72),(811,72),(812,72),(813,72),(814,72),(815,72),(816,72),(817,72),(818,72),(819,72),(820,72),(821,72),(822,72),(823,72),(824,72),(825,72),(826,72),(827,72),(828,72),(829,72),(830,72),(831,72),(832,72),(833,72),(834,72),(835,72),(836,72),(837,72),(838,72),(839,72),(840,72),(841,72),(842,72),(843,72),(844,72),(845,72),(846,72),(847,72),(848,72),(849,72),(850,72),(851,72),(852,72),(853,72),(854,72),(855,72),(856,72),(857,72),(858,72),(859,72),(860,72),(861,72),(862,72),(879,72),(881,72),(882,72),(884,72),(885,72),(886,72),(907,72),(908,72),(920,72),(921,72),(922,72),(923,72),(201,73),(786,73),(787,73),(798,73),(589,74),(690,74),(788,75),(799,75),(919,75),(1091,75),(889,76),(925,76),(487,77),(563,77),(759,77),(768,77),(894,77),(895,77),(906,78),(201,79),(203,79),(208,79),(1111,79),(916,80),(927,81),(916,230),(1080,230),(1081,230),(1082,230),(1084,230),(1085,230),(1090,230),(1113,230),(1114,230),(1115,230),(1116,230),(1117,230),(1087,231),(1098,231); -/*!40000 ALTER TABLE `Entry_to_Tag` ENABLE KEYS */; --- UNLOCK TABLES; - --- --- Table structure for table `Exceptions_Entry_to_Team` --- - -DROP TABLE IF EXISTS `Exceptions_Entry_to_Team`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `Exceptions_Entry_to_Team` ( - `entry_id` int(11) NOT NULL DEFAULT '0', - `team_id` int(11) NOT NULL DEFAULT '0', - PRIMARY KEY (`entry_id`,`team_id`), - KEY `team_id` (`team_id`), - CONSTRAINT `Exceptions_Entry_to_Team_ibfk_1` FOREIGN KEY (`entry_id`) REFERENCES `Entry` (`id`) ON DELETE CASCADE, - CONSTRAINT `Exceptions_Entry_to_Team_ibfk_2` FOREIGN KEY (`team_id`) REFERENCES `Team` (`id`) ON DELETE CASCADE -) ENGINE=InnoDB DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - --- --- Dumping data for table `Exceptions_Entry_to_Team` --- - --- LOCK TABLES `Exceptions_Entry_to_Team` WRITE; -/*!40000 ALTER TABLE `Exceptions_Entry_to_Team` DISABLE KEYS */; -INSERT INTO `Exceptions_Entry_to_Team` VALUES (417,1),(584,1),(585,1),(586,1),(587,1),(588,1),(785,1),(584,6),(585,6),(586,6),(587,6),(588,6); -/*!40000 ALTER TABLE `Exceptions_Entry_to_Team` ENABLE KEYS */; --- UNLOCK TABLES; - --- --- Table structure for table `OurType_to_Type` --- - -DROP TABLE IF EXISTS `OurType_to_Type`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `OurType_to_Type` ( - `bibtex_type` varchar(250) NOT NULL DEFAULT '', - `our_type` varchar(250) NOT NULL DEFAULT '', - `description` text, - `landing` int(11) DEFAULT '0', - PRIMARY KEY (`bibtex_type`,`our_type`) -) ENGINE=InnoDB DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - --- --- Dumping data for table `OurType_to_Type` --- - --- LOCK TABLES `OurType_to_Type` WRITE; -/*!40000 ALTER TABLE `OurType_to_Type` DISABLE KEYS */; -INSERT INTO `OurType_to_Type` VALUES ('article','article','Peer-Reviewed Journal and Magazine Articles',1),('book','book','Authored and Edited Books',1),('book','volumes','Books, Volumes and Theses',0),('inbook','book','Authored and Edited Books',1),('inbook','inbook',NULL,0),('incollection','bibtex-incollection',NULL,0),('incollection','incollection',NULL,0),('incollection','inproceedings','Peer-Reviewed International Conference, Workshop Papers, and Book Chapters',1),('inproceedings','bibtex-inproceedings',NULL,0),('inproceedings','inproceedings','Peer-Reviewed International Conference, Workshop Papers, and Book Chapters',1),('manual','manual','Manuals',1),('mastersthesis','mastersthesis',NULL,0),('mastersthesis','supervised_theses','Supervised Theses',0),('mastersthesis','theses','Theses',1),('misc','misc','Other',1),('phdthesis','phdthesis',NULL,0),('phdthesis','supervised_theses','Supervised Theses',0),('phdthesis','theses','Theses',1),('phdthesis','volumes','Books, Volumes and Theses',0),('proceedings','book','Authored and Edited Books',0),('proceedings','proceedings',NULL,0),('proceedings','volumes','Books, Volumes and Theses',0),('techreport','techreport','Technical Reports',1),('unpublished','unpublished',NULL,0); -/*!40000 ALTER TABLE `OurType_to_Type` ENABLE KEYS */; --- UNLOCK TABLES; - --- --- Table structure for table `Tag` --- - -DROP TABLE IF EXISTS `Tag`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `Tag` ( - `name` varchar(250) NOT NULL, - `id` int(11) NOT NULL, - `type` int(11) DEFAULT '1', - `permalink` text, - PRIMARY KEY (`id`), - UNIQUE KEY `name` (`name`), - KEY `type` (`type`), - CONSTRAINT `Tag_ibfk_1` FOREIGN KEY (`type`) REFERENCES `TagType` (`id`) -) ENGINE=InnoDB DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - --- --- Dumping data for table `Tag` --- - --- LOCK TABLES `Tag` WRITE; -/*!40000 ALTER TABLE `Tag` DISABLE KEYS */; -INSERT INTO `Tag` VALUES ('Networking',4,1,'N'),('Virtualization',6,1,NULL),('Survey',7,1,NULL),('Simulation',8,1,NULL),('Meta-models',9,1,NULL),('Performance',10,1,NULL),('Prediction',11,1,NULL),('SOA',12,1,NULL),('QPME_Bibliography',15,3,NULL),('Cloud',19,1,NULL),('QPN',20,1,NULL),('BUNGEE',21,1,NULL),('DML',22,1,NULL),('DQL',23,1,NULL),('LIMBO',24,1,NULL),('LibReDE',25,1,NULL),('SDN',28,1,NULL),('SPA',29,1,NULL),('SPEC',30,1,NULL),('Award',31,1,NULL),('Elasticity',33,1,NULL),('Event-based',34,1,NULL),('Grid',35,1,NULL),('Isolation',36,1,NULL),('Multi-tenancy',38,1,NULL),('Power',41,1,NULL),('Reliability',43,1,NULL),('Security',44,1,NULL),('Storage',47,1,NULL),('Tool',49,1,NULL),('QPME',51,1,NULL),('Optimization',52,1,NULL),('Design_of_enterprise_system_architectures',53,2,'A1'),('Formal_architecture_modeling',54,2,'A2'),('Analytical_and_simulation-based_analysis',55,2,'A3'),('Model_extraction,_calibration_and_maintenance',56,2,'A4'),('Metrics_and_benchmarking_methodologies',57,2,'B1'),('Instrumentation_profiling_and_workload_characterization',58,2,'B2'),('Statistical_estimation_and_machine_learning',59,2,'B3'),('Online_monitoring_and_forecasting',60,2,'B4'),('Data_center_resource_management',61,2,'C1'),('Application_quality_of_service_management',62,2,'C2'),('Power-energy_efficient_computing',63,2,'C3'),('Multi-criteria_optimization',64,2,'C4'),('Self-adaptive-systems',65,1,NULL),('Self-aware-computing',66,1,NULL),('DNI',67,3,'DNI'),('HInjector',68,1,NULL),('Supervised_by_Nikolas_Herbst',69,3,NULL),('Thesis_supervised_by_SE_member',70,3,NULL),('Thesis_supervised_by_Simon_Spinner',71,3,NULL),('Talks',72,3,'talks'),('Thesis_supervised_by_Nikolaus_Huber',73,3,NULL),('Thesis_supervised_by_Fabian_Brosig',74,3,NULL),('Thesis_supervised_by_Juergen_Walter',75,3,NULL),('Thesis_supervised_by_Joakim_vonKistowski',76,3,NULL),('Supervised_PhD_Thesis',77,3,NULL),('Interpolation',78,3,NULL),('WCF',79,1,NULL),('PMX',80,1,NULL),('Thesis_supervised_by_Aleksandar_Milenkoski',81,3,NULL),('Media-coverage',230,3,NULL),('Thesis_supervised_by_Piotr_Rygielski',231,3,NULL); -/*!40000 ALTER TABLE `Tag` ENABLE KEYS */; --- UNLOCK TABLES; - --- --- Table structure for table `TagType` --- - -DROP TABLE IF EXISTS `TagType`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `TagType` ( - `name` text, - `comment` text, - `id` int(8) NOT NULL, - PRIMARY KEY (`id`) -) ENGINE=InnoDB DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - --- --- Dumping data for table `TagType` --- - --- LOCK TABLES `TagType` WRITE; -/*!40000 ALTER TABLE `TagType` DISABLE KEYS */; -INSERT INTO `TagType` VALUES ('Tag','keyword',1),('Category','12 categories defined as in research agenda',2),('Other','Reserved for other grouppings of papers (e.g., QPME_Bibliography)',3),('Imported','Tags Imported from Bibtex',4); -/*!40000 ALTER TABLE `TagType` ENABLE KEYS */; --- UNLOCK TABLES; - --- --- Table structure for table `Team` --- - -DROP TABLE IF EXISTS `Team`; -/*!40101 SET @saved_cs_client = @@character_set_client */; -/*!40101 SET character_set_client = utf8 */; -CREATE TABLE `Team` ( - `id` int(8) NOT NULL, - `name` varchar(250) NOT NULL, - `parent` varchar(250) DEFAULT NULL, - PRIMARY KEY (`id`), - UNIQUE KEY `team_name_unique` (`name`) -) ENGINE=InnoDB DEFAULT CHARSET=latin1; -/*!40101 SET character_set_client = @saved_cs_client */; - --- --- Dumping data for table `Team` --- - --- LOCK TABLES `Team` WRITE; -/*!40000 ALTER TABLE `Team` DISABLE KEYS */; -INSERT INTO `Team` VALUES (1,'SE-WUERZBURG',NULL),(3,'PiotrPL',NULL),(4,'DESCARTES_ALUMNI',NULL),(6,'DESCARTES',NULL); -/*!40000 ALTER TABLE `Team` ENABLE KEYS */; --- UNLOCK TABLES; -/*!40103 SET TIME_ZONE=@OLD_TIME_ZONE */; -COMMIT; -SET FOREIGN_KEY_CHECKS=1; -/*!40101 SET SQL_MODE=@OLD_SQL_MODE */; -/*!40014 SET FOREIGN_KEY_CHECKS=@OLD_FOREIGN_KEY_CHECKS */; -/*!40014 SET UNIQUE_CHECKS=@OLD_UNIQUE_CHECKS */; -/*!40101 SET CHARACTER_SET_CLIENT=@OLD_CHARACTER_SET_CLIENT */; -/*!40101 SET CHARACTER_SET_RESULTS=@OLD_CHARACTER_SET_RESULTS */; -/*!40101 SET COLLATION_CONNECTION=@OLD_COLLATION_CONNECTION */; -/*!40111 SET SQL_NOTES=@OLD_SQL_NOTES */; - --- Dump completed on 2016-06-12 20:26:00