[AISWorld] Newly published papers of JCSE (Mar. 2013)

Wed Apr 3 22:05:59 EDT 2013

Dear Colleague:

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.

Journal of Computing Science and Engineering (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.

Please take a look at our new issue posted at http://jcse.kiise.org
<http://jcse.kiise.org/> . All the papers can be downloaded from the Web
page.

The contents of the latest issue of Journal of Computing Science and
Engineering (JCSE)

Official Publication of the Korean Institute of Information Scientists and
Engineers

Volume 7, Number 1, March 2013

pISSN: 1976-4677

eISSN: 2093-8020

* JCSE web page: http://jcse.kiise.org

* e-submission: http://mc.manuscriptcentral.com/jcse

Editor in Chief: Insup Lee (University of Pennsylvania)

Il-Yeol Song (Drexel University) 

Jong C. Park (KAIST)

Taewhan Kim (Seoul National University)

JCSE, vol. 7, no. 1, March 2013

[Paper One]

- Title: Minimizing the MOLAP/ROLAP Divide: You Can Have Your Performance
and Scale It Too

- Authors: Todd Eavis, Ahmad Taleb

- Keyword: Analytics; OLAP; Data warehousing

- Abstract

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’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.

To obtain a copy of the entire article, click on the link below.
JCSE,
<http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=150&page_url=Cur
rent_Issues>  vol. 7, no. 1, pp.1-20

[Paper Two]

- Title: Using Experts Among Users for Novel Movie Recommendations

- Authors: Kibeom Lee, Kyogu Lee

- Keyword: Recommender systems; Collaborative filtering; Experts

- Abstract

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’ 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.

To obtain a copy of the entire article, click on the link below.
JCSE,
<http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=151&page_url=Cur
rent_Issues>  vol. 7, no. 1, pp.21-29

[Paper Three]

- Title: Energy Aware Scheduling of Aperiodic Real-Time Tasks on
Multiprocessor Systems

- Authors: Naveen Anne, Venkatesan Muthukumar

- Keyword: Multiprocessor scheduling; Application mapping; Energy aware
scheduling; Task graphs; DVFS

- Abstract

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.

To obtain a copy of the entire article, click on the link below.
JCSE,
<http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=152&page_url=Cur
rent_Issues>  vol. 7, no. 1, pp.30-43

[Paper Four]

- Title: An Efficient Scheduling Method for Grid Systems Based on a
Hierarchical Stochastic Petri Net

- Authors: Mohammad Shojafar, Zahra Pooranian, Jemal H. Abawajy, Mohammad
Reza Meybodi

- Keyword: Grid computing; Hierarchical stochastic Petri net (HSPN);
Resource scheduling; Resource allocation; Modeling

- Abstract

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.

To obtain a copy of the entire article, click on the link below.
JCSE,
<http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=153&page_url=Cur
rent_Issues>  vol. 7, no. 1, pp.44-52

[Paper Five]

- Title: Bounding Worst-Case DRAM Performance on Multicore Processors

- Authors: Yiqiang Ding, Lan Wu, Wei Zhang

- Keyword: Performance; Reliability; Real-time scheduling; WCET; Multicore
processor

- Abstract

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.

To obtain a copy of the entire article, click on the link below.
JCSE,
<http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=154&page_url=Cur
rent_Issues>  vol. 7, no. 1, pp.53-66

[Paper Six]

- Title: Multicore Real-Time Scheduling to Reduce Inter-Thread Cache
Interferences

- Authors: Yiqiang Ding, Wei Zhang

- Keyword: Performance; Reliability; Real-time scheduling; WCET; Multicore
processor

- Abstract

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.

To obtain a copy of the entire article, click on the link below.
JCSE,
<http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=155&page_url=Cur
rent_Issues>  vol. 7, no. 1, pp.67-80

[Call For Papers]

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
http://jcse.kiise.org <http://jcse.kiise.org/>  for the subareas.

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
<http://mc.manuscriptcentral.com/jcse>
http://mc.manuscriptcentral.com/jcse, 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,
<mailto:office at kiise.org> office at kiise.org (phone: +82-2-588-9240; FAX: +82-
2-521-1352).

=====================================

 Yeon-Joo Song (Ms.)           * E-mail :  <mailto:yjsong at kiise.org>
yjsong at kiise.org

* Tel : +82-2-588-9240        * Fax : +82-2-521-1352

[KIISE JCSE Editorial Office]      <http://jcse.kiise.org/>
http://jcse.kiise.org

[Korean Institute of Information Scientists and Engineers]

=====================================

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.aisnet.org/pipermail/aisworld_lists.aisnet.org/attachments/20130404/15921cfe/attachment.html>