<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40">
<head>
<meta http-equiv=Content-Type content="text/html; charset=ks_c_5601-1987">
<meta name=Generator content="Microsoft Word 12 (filtered medium)">
<style>
<!--
/* Font Definitions */
@font-face
{font-family:¹ÙÅÁ;
panose-1:2 3 6 0 0 1 1 1 1 1;}
@font-face
{font-family:±¼¸²;
panose-1:2 11 6 0 0 1 1 1 1 1;}
@font-face
{font-family:±¼¸²;
panose-1:2 11 6 0 0 1 1 1 1 1;}
@font-face
{font-family:"¸¼Àº °íµñ";
panose-1:2 11 5 3 2 0 0 2 0 4;}
@font-face
{font-family:"\@¸¼Àº °íµñ";
panose-1:2 11 5 3 2 0 0 2 0 4;}
@font-face
{font-family:"\@±¼¸²";
panose-1:2 11 6 0 0 1 1 1 1 1;}
@font-face
{font-family:Verdana;
panose-1:2 11 6 4 3 5 4 4 2 4;}
@font-face
{font-family:Tahoma;
panose-1:2 11 6 4 3 5 4 4 2 4;}
@font-face
{font-family:"\@¹ÙÅÁ";
panose-1:2 3 6 0 0 1 1 1 1 1;}
/* Style Definitions */
p.MsoNormal, li.MsoNormal, div.MsoNormal
{margin:0cm;
margin-bottom:.0001pt;
text-align:justify;
text-justify:inter-ideograph;
text-autospace:none;
word-break:break-hangul;
font-size:10.0pt;
font-family:"¸¼Àº °íµñ";
color:windowtext;}
a:link, span.MsoHyperlink
{mso-style-priority:99;
color:blue;
text-decoration:underline;}
a:visited, span.MsoHyperlinkFollowed
{mso-style-priority:99;
color:purple;
text-decoration:underline;}
p
{mso-margin-top-alt:auto;
margin-right:0cm;
mso-margin-bottom-alt:auto;
margin-left:0cm;
text-align:justify;
text-justify:inter-ideograph;
font-size:12.0pt;
font-family:"Times New Roman","serif";
color:black;}
span.EmailStyle17
{mso-style-type:personal-compose;
font-family:"¸¼Àº °íµñ";
color:windowtext;}
span.site1
{mso-style-name:site1;
font-family:"Tahoma","sans-serif";
color:#A93800;
text-decoration:none none;}
.MsoChpDefault
{mso-style-type:export-only;}
/* Page Definitions */
@page Section1
{size:612.0pt 792.0pt;
margin:3.0cm 72.0pt 72.0pt 72.0pt;}
div.Section1
{page:Section1;}
-->
</style>
<!--[if gte mso 9]><xml>
<o:shapedefaults v:ext="edit" spidmax="1026" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext="edit">
<o:idmap v:ext="edit" data="1" />
</o:shapelayout></xml><![endif]-->
</head>
<body lang=KO link=blue vlink=purple>
<div class=Section1>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'>Dear Colleague:<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal style='line-height:12.0pt;mso-line-height-rule:exactly;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;font-family:"Times New Roman","serif"'>We
are pleased to announce the release of a new issue of Journal of Computing
Science and Engineering (JCSE), published by the Korean Institute of
Information Scientists and Engineers (KIISE). KIISE is the largest organization
for computer scientists in Korea with over 4000 active members.<o:p></o:p></span></p>
<p class=MsoNormal style='line-height:12.0pt;mso-line-height-rule:exactly;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:12.0pt;
mso-line-height-rule:exactly;word-break:keep-all'><i><span lang=EN-US
style='font-size:12.0pt;font-family:"Times New Roman","serif"'>Journal of
Computing Science and Engineering</span></i><span lang=EN-US style='font-size:
12.0pt;font-family:"Times New Roman","serif"'> (JCSE) is a peer-reviewed
quarterly journal that publishes high-quality papers on all aspects of
computing science and engineering. JCSE aims to foster communication between academia
and industry within the rapidly evolving field of Computing Science and
Engineering. The journal is intended to promote problem-oriented research that
fuses academic and industrial expertise. The journal focuses on emerging
computer and information technologies including, but not limited to, embedded
computing, ubiquitous computing, convergence computing, green computing, smart
and intelligent computing, and human computing. JCSE publishes original
research contributions, surveys, and experimental studies with scientific
advances.<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:12.0pt;
mso-line-height-rule:exactly;word-break:keep-all'><span lang=EN-US
style='font-size:12.0pt;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:12.0pt;
mso-line-height-rule:exactly;word-break:keep-all'><span lang=EN-US
style='font-size:12.0pt;font-family:"Times New Roman","serif"'>Please take a
look at our new issue posted at <a href="http://jcse.kiise.org/">http://jcse.kiise.org</a>.
All the papers can be downloaded from the Web page.<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'>The contents of the latest issue of
Journal of Computing Science and Engineering (JCSE)<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'>Official Publication of the Korean
Institute of Information Scientists and Engineers<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'>Volume 7, Number 1, March 2013<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'>pISSN: 1976-4677<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'>eISSN: 2093-8020<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'>* JCSE web page: http://jcse.kiise.org<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'>* e-submission: http://mc.manuscriptcentral.com/jcse<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'>Editor in Chief: Insup Lee (University
of Pennsylvania)<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;text-indent:78.0pt;
line-height:150%;word-break:keep-all'><span lang=FR style='font-size:12.0pt;
line-height:150%;font-family:"Times New Roman","serif"'>Il-Yeol Song (Drexel
University) <o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;text-indent:78.0pt;
line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;
line-height:150%;font-family:"Times New Roman","serif"'>Jong C. Park (KAIST)<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;text-indent:78.0pt;
line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;
line-height:150%;font-family:"Times New Roman","serif"'>Taewhan Kim (Seoul
National University)<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:14.0pt;line-height:
150%;font-family:"Verdana","sans-serif"'>JCSE, vol. 7, no. 1, March 2013<o:p></o:p></span></b></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></b></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>[Paper One]<o:p></o:p></span></b></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Title:</span></b><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>
Minimizing the MOLAP/ROLAP Divide: You Can Have Your Performance and Scale It
Too<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Authors:</span></b><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>
Todd Eavis, Ahmad Taleb<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Keyword:</span></b><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>
Analytics; OLAP; Data warehousing<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Abstract<o:p></o:p></span></b></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'>Over the past generation, data
warehousing and online analytical processing (OLAP) applications have become
the cornerstone of contemporary decision support environments. Typically, OLAP
servers are implemented on top of either proprietary array-based storage
engines (MOLAP) or as extensions to conventional relational DBMSs (ROLAP). While
MOLAP systems do indeed provide impressive performance on common analytics
queries, they tend to have limited scalability. Conversely, ROLAP</span><span
lang=EN-US style='font-size:12.0pt;line-height:150%'>¡¯</span><span lang=EN-US
style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>s
table oriented model scales quite nicely, but offers mediocre performance at
best relative to the MOLAP systems. In this paper, we describe a storage and
indexing framework that aims to provide both MOLAP like performance and ROLAP
like scalability by essentially combining some of the best features from both.
Based upon a combination of R-trees and bitmap indexes, the storage engine has
been integrated with a robust OLAP query engine prototype that is able to fully
exploit the efficiency of the proposed storage model. Specifically, it utilizes
an OLAP algebra coupled with a domain specific query optimizer, to map user
queries directly to the storage and indexing framework. Experimental results
demonstrate that not only does the design improve upon more naive approaches,
but that it does indeed offer the potential to optimize both query performance
and scalability.<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-size:
12.0pt;line-height:150%;font-family:"Times New Roman","serif";color:blue'>To
obtain a copy of the entire article, click on the link below.<br>
</span><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:
"Times New Roman","serif";color:blue'><a
href="http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=150&page_url=Current_Issues">JCSE,
vol. 7, no. 1, pp.1-20</a><o:p></o:p></span></b></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></b></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>[Paper Two]<o:p></o:p></span></b></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Title:</span></b><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>
Using Experts Among Users for Novel Movie Recommendations<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Authors:</span></b><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>
Kibeom Lee, Kyogu Lee<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Keyword:</span></b><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>
Recommender systems; Collaborative filtering; Experts<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Abstract<o:p></o:p></span></b></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'>The introduction of recommender systems
to existing online services is now practically inevitable, with the increasing
number of items and users on online services. Popular recommender systems have
successfully implemented satisfactory systems, which are usually based on
collaborative filtering. However, collaborative filtering-based recommenders
suffer from well-known problems, such as popularity bias, and the cold-start
problem. In this paper, we propose an innovative collaborative-filtering based
recommender system, which uses the concepts of Experts and Novices to create
fine grained recommendations that focus on being novel, while being kept
relevant. Experts and Novices are defined using pre-made clusters of similar
items, and the distribution of users</span><span lang=EN-US style='font-size:
12.0pt;line-height:150%'>¡¯</span><span lang=EN-US style='font-size:12.0pt;
line-height:150%;font-family:"Times New Roman","serif"'> ratings among these
clusters. Thus, in order to generate recommendations, the experts are found
dynamically depending on the seed items of the novice. The proposed recommender
system was built using the MovieLens 1 M dataset, and evaluated with novelty
metrics. Results show that the proposed system outperforms matrix factorization
methods according to discovery-based novelty metrics, and can be a solution to
popularity bias and the cold-start problem, while still retaining collaborative
filtering.<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-size:
12.0pt;line-height:150%;font-family:"Times New Roman","serif";color:blue'>To
obtain a copy of the entire article, click on the link below.<br>
</span><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:
"Times New Roman","serif";color:blue'><a
href="http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=151&page_url=Current_Issues">JCSE,
vol. 7, no. 1, pp.21-29</a><o:p></o:p></span></b></p>
<p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-size:
12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>[Paper Three]<o:p></o:p></span></b></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Title:</span></b><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>
Energy Aware Scheduling of Aperiodic Real-Time Tasks on Multiprocessor Systems<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Authors:</span></b><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>
Naveen Anne, Venkatesan Muthukumar<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Keyword:</span></b><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>
Multiprocessor scheduling; Application mapping; Energy aware scheduling; Task
graphs; DVFS<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Abstract<o:p></o:p></span></b></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'>Multicore and multiprocessor systems
with dynamic voltage scaling architectures are being used as one of the solutions
to satisfy the growing needs of high performance applications with low power
constraints. An important aspect that has propelled this solution is effective
task/application scheduling and mapping algorithms for multiprocessor systems.
This work proposes an energy aware, offline, probability-based unified
scheduling and mapping algorithm for multiprocessor systems, to minimize the
number of processors used, maximize the utilization of the processors, and
optimize the energy consumption of the multiprocessor system. The proposed
algorithm is implemented, simulated and evaluated with synthetic task graphs,
and compared with classical scheduling algorithms for the number of processors
required, utilization of processors, and energy consumed by the processors for
execution of the application task graphs.<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-size:
12.0pt;line-height:150%;font-family:"Times New Roman","serif";color:blue'>To
obtain a copy of the entire article, click on the link below.<br>
</span><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:
"Times New Roman","serif";color:blue'><a
href="http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=152&page_url=Current_Issues">JCSE,
vol. 7, no. 1, pp.30-43</a><o:p></o:p></span></b></p>
<p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-size:
12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>[Paper Four]<o:p></o:p></span></b></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Title:</span></b><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>
An Efficient Scheduling Method for Grid Systems Based on a Hierarchical
Stochastic Petri Net<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Authors:</span></b><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>
Mohammad Shojafar, Zahra Pooranian, Jemal H. Abawajy, Mohammad Reza Meybodi<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Keyword:</span></b><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>
Grid computing; Hierarchical stochastic Petri net (HSPN); Resource scheduling;
Resource allocation; Modeling<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Abstract<o:p></o:p></span></b></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'>This paper addresses the problem of
resource scheduling in a grid computing environment. One of the main goals of
grid computing is to share system resources among geographically dispersed
users, and schedule resource requests in an efficient manner. Grid computing
resources are distributed, heterogeneous, dynamic, and autonomous, which makes
resource scheduling a complex problem. This paper proposes a new approach to
resource scheduling in grid computing environments, the hierarchical stochastic
Petri net (HSPN). The HSPN optimizes grid resource sharing, by categorizing
resource requests in three layers, where each layer has special functions for
receiving subtasks from, and delivering data to, the layer above or below. We
compare the HSPN performance with the Min-min and Max-min resource scheduling
algorithms. Our results show that the HSPN performs better than Max-min, but
slightly underperforms Min-min.<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-size:
12.0pt;line-height:150%;font-family:"Times New Roman","serif";color:blue'>To
obtain a copy of the entire article, click on the link below.<br>
</span><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:
"Times New Roman","serif";color:blue'><a
href="http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=153&page_url=Current_Issues">JCSE,
vol. 7, no. 1, pp.44-52</a><o:p></o:p></span></b></p>
<p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-size:
12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>[Paper Five]<o:p></o:p></span></b></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Title:</span></b><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>
Bounding Worst-Case DRAM Performance on Multicore Processors<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Authors:</span></b><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>
Yiqiang Ding, Lan Wu, Wei Zhang<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Keyword:</span></b><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>
Performance; Reliability; Real-time scheduling; WCET; Multicore processor<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Abstract<o:p></o:p></span></b></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'>Bounding the worst-case DRAM performance
for a real-time application is a challenging problem that is critical for computing
worst-case execution time (WCET), especially for multicore processors, where
the DRAM memory is usually shared by all of the cores. Typically, DRAM commands
from consecutive DRAM accesses can be pipelined on DRAM devices according to
the spatial locality of the data fetched by them. By considering the effect of
DRAM command pipelining, we propose a basic approach to bounding the worst-case
DRAM performance. An enhanced approach is proposed to reduce the overestimation
from the invalid DRAM access sequences by checking the timing order of the
co-running applications on a dual-core processor. Compared with the
conservative approach, which assumes that no DRAM command pipelining exists,
our experimental results show that the basic approach can bound the WCET more
tightly, by 15.73% on average. The experimental results also indicate that the
enhanced approach can further improve the tightness of WCET by 4.23% on average
as compared to the basic approach.<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-size:
12.0pt;line-height:150%;font-family:"Times New Roman","serif";color:blue'>To
obtain a copy of the entire article, click on the link below.<br>
</span><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:
"Times New Roman","serif";color:blue'><a
href="http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=154&page_url=Current_Issues">JCSE,
vol. 7, no. 1, pp.53-66</a><o:p></o:p></span></b></p>
<p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-size:
12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>[Paper Six]<o:p></o:p></span></b></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Title:</span></b><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>
Multicore Real-Time Scheduling to Reduce Inter-Thread Cache Interferences<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Authors:</span></b><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>
Yiqiang Ding, Wei Zhang<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Keyword:</span></b><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>
Performance; Reliability; Real-time scheduling; WCET; Multicore processor<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>- Abstract<o:p></o:p></span></b></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'>The worst-case execution time (WCET) of
each real-time task in multicore processors with shared caches can be significantly
affected by inter-thread cache interferences. The worst-case inter-thread cache
interferences are dependent on how tasks are scheduled to run on different
cores. Therefore, there is a circular dependence between real-time task
scheduling, the worst-case inter-thread cache interferences, and WCET in
multicore processors, which is not the case for single-core processors. To
address this challenging problem, we present an offline real-time scheduling
approach for multicore processors by considering the worst-case inter-thread
interferences on shared L2 caches. Our scheduling approach uses a greedy
heuristic to generate safe schedules while minimizing the worst-case
inter-thread shared L2 cache interferences and WCET. The experimental results
demonstrate that the proposed approach can reduce the utilization of the
resulting schedule by about 12% on average compared to the cyclic multicore
scheduling approaches in our theoretical model. Our evaluation indicates that
the enhanced scheduling approach is more likely to generate feasible and safe
schedules with stricter timing constraints in multicore real-time systems.<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-size:
12.0pt;line-height:150%;font-family:"Times New Roman","serif";color:blue'>To
obtain a copy of the entire article, click on the link below.<br>
</span><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:
"Times New Roman","serif";color:blue'><a
href="http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=155&page_url=Current_Issues">JCSE,
vol. 7, no. 1, pp.67-80</a><o:p></o:p></span></b></p>
<p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-size:
12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:
150%;font-family:"Times New Roman","serif"'>[Call For Papers]<o:p></o:p></span></b></p>
<p class=MsoNormal align=left style='text-align:left;line-height:150%;
word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;
font-family:"Times New Roman","serif"'>Journal of Computing Science and
Engineering (JCSE), published by the Korean Institute of Information Scientists
and Engineers (KIISE) is devoted to the timely dissemination of novel results
and discussions on all aspects of computing science and engineering, divided
into Foundations, Software & Applications, and Systems & Architecture.
Papers are solicited in all areas of computing science and engineering. See
JCSE home page at <a href="http://jcse.kiise.org/">http://jcse.kiise.org</a>
for the subareas.<o:p></o:p></span></p>
<p><span lang=EN-US>The journal publishes regularly submitted papers, invited
papers, selected best papers from reputable conferences and workshops, and
thematic issues that address hot research topics. Potential authors are invited
to submit their manuscripts electronically, prepared in PDF files, through </span><span
class=site1><span lang=EN-US style='font-size:10.0pt'><a
href="http://mc.manuscriptcentral.com/jcse" target="_blank"><span
style='color:#A93800;text-decoration:none'>http://mc.manuscriptcentral.com/jcse</span></a></span></span><span
lang=EN-US>, where ScholarOne is used for on-line submission and review.
Authors are especially encouraged to submit papers of around 10 but not more
than 30 double-spaced pages in twelve point type. The corresponding author's
full postal and e-mail addresses, telephone and FAX numbers as well as current
affiliation information must be given on the manuscript. Further inquires are
welcome at JCSE Editorial Office, </span><span class=site1><span lang=EN-US
style='font-size:10.0pt'><a href="mailto:office@kiise.org"><span
style='color:#A93800;text-decoration:none'>office@kiise.org</span></a></span></span><span
lang=EN-US> (phone: +82-2-588-9240; FAX: +82-2-521-1352).<o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;text-autospace:ideograph-other;
word-break:keep-all'><span lang=EN-US style='font-family:"Tahoma","sans-serif";
color:black'>=====================================</span><span lang=EN-US
style='color:black'><o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;text-autospace:ideograph-other;
word-break:keep-all'><span lang=EN-US style='font-family:"Tahoma","sans-serif";
color:black'> Yeon-Joo
Song (Ms.) *
E-mail : </span><span lang=EN-US style='color:black'><a
href="mailto:yjsong@kiise.org"><span style='font-family:"Tahoma","sans-serif";
color:blue'>yjsong@kiise.org</span></a><o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;text-autospace:ideograph-other;
word-break:keep-all'><span lang=EN-US style='font-family:"Tahoma","sans-serif";
color:black'>* Tel : +82-2-588-9240 *
Fax : +82-2-521-1352</span><span lang=EN-US style='color:black'><o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;text-autospace:ideograph-other;
word-break:keep-all'><span lang=EN-US style='font-family:"Tahoma","sans-serif";
color:black'>[KIISE JCSE Editorial Office] </span><span
lang=EN-US style='color:black'><a href="http://jcse.kiise.org/"
title="http://jcse.kiise.org/"><span style='font-family:"Tahoma","sans-serif";
color:blue'>http://jcse.kiise.org</span></a><o:p></o:p></span></p>
<p class=MsoNormal align=left style='text-align:left;text-autospace:ideograph-other;
word-break:keep-all'><span lang=EN-US style='font-family:"Tahoma","sans-serif";
color:black'>[Korean Institute of Information Scientists and Engineers]</span><span
lang=EN-US style='color:black'><o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US style='font-family:"Tahoma","sans-serif";
color:black'>=====================================</span><span lang=EN-US><o:p></o:p></span></p>
</div>
</body>
</html>