ISSN: 0129-6264

Journal Home

Journal Guideline

Parallel Processing Letters Q4 Unclaimed

World Scientific Singapore

Unfortunately this journal has not been claimed yet. For this reason, some information may be unavailable.

Parallel Processing Letters is a journal indexed in SJR in Software and Theoretical Computer Science with an H index of 33. It has an SJR impact factor of 0,201 and it has a best quartile of Q4. It is published in English. It has an SJR impact factor of 0,201.

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy:

Type of publications:

Publication frecuency: -

Categories: Hardware and Architecture (Q4) Software (Q4) Theoretical Computer Science (Q4)

Price

- €

Inmediate OA

NPD

Embargoed OA

- €

Non OA

Metrics

0,201

SJR Impact factor

33

H Index

24

Total Docs (Last Year)

62

Total Docs (3 years)

626

Total Refs

37

Total Cites (3 years)

61

Citable Docs (3 years)

0.59

Cites/Doc (2 years)

26.08

Ref/Doc

Comments

No comments ... Be the first to comment!

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID *

* The email or ORCID field is only to validate the authenticity of the comment, the identity will not be public. .

Other journals with similar parameters

International Journal of Digital Crime and Forensics Q4
Revue d'Intelligence Artificielle Q4
International Journal of Embedded Systems Q4
Image Processing On Line Q4
Neural Network World Q4

Compare this journals

Aims and Scope

Best articles by citations

COST OPTIMALITY AND PREDICTABILITY OF PARALLEL PROGRAMMING WITH SKELETONS

A SIMPLE PARALLEL ALGORITHM FOR THE SINGLE FUNCTION COARSEST PARTITION PROBLEM

AUTOMATED NEGOTIATION BETWEEN PUBLISHERS AND CONSUMERS OF GRID NOTIFICATIONS

A FAST HEURISTIC FOR LOOP PARALLELIZATION

EXTENDING OPENMP FOR TASK PARALLELISM

DERIVING PROCESS NETWORKS FROM NESTED LOOP ALGORITHMS

A PROCESSOR EFFICIENT CONNECTIVITY ALGORITHM ON RANDOM GRAPHS

GENERIC PROGRAMMING OF PARALLEL APPLICATIONS WITH JANUS

WEAKEST SPECIFUNCTIONS FOR BSP

FORMAL PROOFS OF FUNCTIONAL BSP PROGRAMS

A WORK-TIME TRADE-OFF IN PARALLEL COMPUTATION OF HUFFMAN TREES AND CONCAVE LEAST WEIGHT SUBSEQUENCE PROBLEM

PARALLEL CREATION OF LINEAR OCTREES FROM QUADTREE SLICES

SHOW MORE ARTICLES

A CORRECTNESS PROOF OF PARALLEL SCAN

HIERARCHICAL PEER-TO-PEER SYSTEMS

AN OPTIMAL ALGORITHM FOR THE DINING PHILOSOPHERS PROBLEM

R2M: A RECONFIGURABLE REWRITE MACHINE

ALIGNED MULTITHREADED COMPUTATIONS AND THEIR SCHEDULING WITH PERFORMANCE GUARANTEES

TOP-DOWN DESIGN OF BULK-SYNCHRONOUS PARALLEL PROGRAMS

PROGRAM DEVELOPMENT FOR COMPUTATIONAL GRIDS USING SKELETONS AND PERFORMANCE PREDICTION

OPTIMAL SYNTHESIS OF PROCESSOR ARRAYS WITH PIPELINED ARITHMETIC UNITS

COMPUTING EXTERNAL WATCHMAN ROUTES ON PRAM, BSR, AND INTERCONNECTION NETWORK MODELS OF PARALLEL COMPUTATION

A FAST RECONFIGURABLE NETWORK FOR GRAPH CONNECTIVITY AND TRANSITIVE CLOSURE

DATA COMPILING FOR SYSTEMS OF UNIFORM RECURRENCE EQUATIONS

A LOOP-BASED SCHEDULING ALGORITHM FOR HARDWARE DESCRIPTION LANGUAGES